WAMA: a method of optimizing reticle/die placement to increase litho cell productivity

NASA Astrophysics Data System (ADS)

Dor, Amos; Schwarz, Yoram

2005-05-01

This paper focuses on reticle/field placement methodology issues, the disadvantages of typical methods used in the industry, and the innovative way that the WAMA software solution achieves optimized placement. Typical wafer placement methodologies used in the semiconductor industry considers a very limited number of parameters, like placing the maximum amount of die on the wafer circle and manually modifying die placement to minimize edge yield degradation. This paper describes how WAMA software takes into account process characteristics, manufacturing constraints and business objectives to optimize placement for maximum stepper productivity and maximum good die (yield) on the wafer.

Hybrid Motion Planning with Multiple Destinations

NASA Technical Reports Server (NTRS)

Clouse, Jeffery

1998-01-01

In our initial proposal, we laid plans for developing a hybrid motion planning system that combines the concepts of visibility-based motion planning, artificial potential field based motion planning, evolutionary constrained optimization, and reinforcement learning. Our goal was, and still is, to produce a hybrid motion planning system that outperforms the best traditional motion planning systems on problems with dynamic environments. The proposed hybrid system will be in two parts the first is a global motion planning system and the second is a local motion planning system. The global system will take global information about the environment, such as the placement of the obstacles and goals, and produce feasible paths through those obstacles. We envision a system that combines the evolutionary-based optimization and visibility-based motion planning to achieve this end.

Structural damage detection-oriented multi-type sensor placement with multi-objective optimization

NASA Astrophysics Data System (ADS)

Lin, Jian-Fu; Xu, You-Lin; Law, Siu-Seong

2018-05-01

A structural damage detection-oriented multi-type sensor placement method with multi-objective optimization is developed in this study. The multi-type response covariance sensitivity-based damage detection method is first introduced. Two objective functions for optimal sensor placement are then introduced in terms of the response covariance sensitivity and the response independence. The multi-objective optimization problem is formed by using the two objective functions, and the non-dominated sorting genetic algorithm (NSGA)-II is adopted to find the solution for the optimal multi-type sensor placement to achieve the best structural damage detection. The proposed method is finally applied to a nine-bay three-dimensional frame structure. Numerical results show that the optimal multi-type sensor placement determined by the proposed method can avoid redundant sensors and provide satisfactory results for structural damage detection. The restriction on the number of each type of sensors in the optimization can reduce the searching space in the optimization to make the proposed method more effective. Moreover, how to select a most optimal sensor placement from the Pareto solutions via the utility function and the knee point method is demonstrated in the case study.

CT-Guided Placement of a Drainage Catheter Within a Pelvic Abscess Using a Transsacral Approach

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

Iguchi, Toshihiro; Asami, Shinya; Kubo, Shinichiro

2007-11-15

A 66-year-old man underwent CT-guided drainage catheter placement within a pelvic abscess with a diameter of 46 mm. We performed the drainage by a transsacral approach because it was considered the safest and most feasible approach. An 8G bone marrow biopsy needle was used to penetrate the sacrum to create a path for subsequent drainage catheter insertion. After withdrawal of the biopsy needle, a 6 Fr catheter was advanced into the abscess cavity through the path using the Seldinger technique. Except for bearable pain, no procedure-related complications occurred. Twenty-nine days after the placement, the catheter was withdrawn safely and themore » abscess cavity had shrunk remarkably.« less

Validation and scopolamine-reversal of latent learning in the water maze utilizing a revised direct platform placement procedure.

PubMed

Malin, David H; Schaar, Krystal L; Izygon, Jonathan J; Nghiem, Duyen M; Jabitta, Sikirat Y; Henceroth, Mallori M; Chang, Yu-Hsuan; Daggett, Jenny M; Ward, Christopher P

2015-08-01

The Morris water maze is routinely used to explore neurobiological mechanisms of working memory. Humans can often acquire working memory relevant to performing a task by mere sensory observation, without having to actually perform the task followed by reinforcement. This can be modeled in the water maze through direct placement of a rat on the escape platform so that it can observe the location, and then assessing the subject's performance in swimming back to the platform. However, direct placement procedures have hardly been studied for two decades, reflecting a controversy about whether direct placement resulted in sufficiently rapid and direct swims back to the platform. In the present study, utilizing revised training methods, a more comprehensive measure of trajectory directness, a more rigorous sham-trained control procedure and an optimal placement-test interval, rats swam almost directly back to the platform in under 4s, significantly more quickly and directly than sham-trained subjects. Muscarinic cholinergic mechanisms, which are inactivated by scopolamine, are essential to memory for standard learning paradigms in the water maze. This experiment determined whether this would also be true for latent learning. ANOVA revealed significant negative effects of scopolamine on both speed and accuracy of trajectory, as well as significant positive effects of direct placement training vs. sham-training. In a probe trial, placement-trained animals without scopolamine spent significantly more time and path length in the target quadrant than trained rats with scopolamine and sham-trained rats without scopolamine. Scopolamine impairments are likely due to effects on memory, since the same dose had little effect on performance with a visible platform. The revised direct placement model offers a means of further comparing the neural mechanisms of latent learning with those of standard instrumental learning. Copyright © 2015 Elsevier Inc. All rights reserved.

Routing channels in VLSI layout

NASA Astrophysics Data System (ADS)

Cai, Hong

A number of algorithms for the automatic routing of interconnections in Very Large Scale Integration (VLSI) building-block layouts are presented. Algorithms for the topological definition of channels, the global routing and the geometrical definition of channels are presented. In contrast to traditional approaches the definition and ordering of the channels is done after the global routing. This approach has the advantage that global routing information can be taken into account to select the optimal channel structure. A polynomial algorithm for the channel definition and ordering problem is presented. The existence of a conflict-free channel structure is guaranteed by enforcing a sliceable placement. Algorithms for finding the shortest connection path are described. A separate algorithm is developed for the power net routing, because the two power nets must be planarly routed with variable wire width. An integrated placement and routing system for generating building-block layout is briefly described. Some experimental results and design experiences in using the system are also presented. Very good results are obtained.

Experimental Evaluation of UWB Indoor Positioning for Sport Postures

PubMed Central

Defraye, Jense; Steendam, Heidi; Gerlo, Joeri; De Clercq, Dirk; De Poorter, Eli

2018-01-01

Radio frequency (RF)-based indoor positioning systems (IPSs) use wireless technologies (including Wi-Fi, Zigbee, Bluetooth, and ultra-wide band (UWB)) to estimate the location of persons in areas where no Global Positioning System (GPS) reception is available, for example in indoor stadiums or sports halls. Of the above-mentioned forms of radio frequency (RF) technology, UWB is considered one of the most accurate approaches because it can provide positioning estimates with centimeter-level accuracy. However, it is not yet known whether UWB can also offer such accurate position estimates during strenuous dynamic activities in which moves are characterized by fast changes in direction and velocity. To answer this question, this paper investigates the capabilities of UWB indoor localization systems for tracking athletes during their complex (and most of the time unpredictable) movements. To this end, we analyze the impact of on-body tag placement locations and human movement patterns on localization accuracy and communication reliability. Moreover, two localization algorithms (particle filter and Kalman filter) with different optimizations (bias removal, non-line-of-sight (NLoS) detection, and path determination) are implemented. It is shown that although the optimal choice of optimization depends on the type of movement patterns, some of the improvements can reduce the localization error by up to 31%. Overall, depending on the selected optimization and on-body tag placement, our algorithms show good results in terms of positioning accuracy, with average errors in position estimates of 20 cm. This makes UWB a suitable approach for tracking dynamic athletic activities. PMID:29315267

Joint Optimal Placement and Energy Allocation of Underwater Sensors in a Tree Topology

DTIC Science & Technology

2014-03-10

underwater acoustic sensor nodes with respect to the capacity of the wireless links between the... underwater acoustic sensor nodes with respect to the capacity of the wireless links between the nodes. We assumed that the energy consumption of...nodes’ optimal placements. We achieve the optimal placement of the underwater acoustic sensor nodes with respect to the capacity of the wireless

The Homogeneity of Optimal Sensor Placement Across Multiple Winged Insect Species

NASA Astrophysics Data System (ADS)

Jenkins, Abigail L.

Taking inspiration from biology, control algorithms can be implemented to imitate the naturally occurring control systems present in nature. This research is primarily concerned with insect flight and optimal wing sensor placement. Many winged insects with halteres are equipped with mechanoreceptors termed campaniform sensilla. Although the exact information these receptors provide to the insect's nervous system is unknown, it is thought to have the capability of measuring inertial rotation forces. During flight, when the wing bends, the information measured by the campaniform sensilla is received by the central nervous system, and provides the insect necessary data to control flight. This research compares three insect species - the hawkmoth Manduca sexta, the honeybee Apis mellifera, and the fruit fly Drosophila melanogaster. Using an observability-based sensor placement algorithm, the optimal sensor placement for these three species is determined. Simulations resolve if this optimal sensor placement corresponds to the insect's campaniform sensilla, as well as if placement is homogeneous across species.

Three-dimensional Image Fusion Guidance for Transjugular Intrahepatic Portosystemic Shunt Placement.

PubMed

Tacher, Vania; Petit, Arthur; Derbel, Haytham; Novelli, Luigi; Vitellius, Manuel; Ridouani, Fourat; Luciani, Alain; Rahmouni, Alain; Duvoux, Christophe; Salloum, Chady; Chiaradia, Mélanie; Kobeiter, Hicham

2017-11-01

To assess the safety, feasibility and effectiveness of image fusion guidance with pre-procedural portal phase computed tomography with intraprocedural fluoroscopy for transjugular intrahepatic portosystemic shunt (TIPS) placement. All consecutive cirrhotic patients presenting at our interventional unit for TIPS creation from January 2015 to January 2016 were prospectively enrolled. Procedures were performed under general anesthesia in an interventional suite equipped with flat panel detector, cone-beam computed tomography (CBCT) and image fusion technique. All TIPSs were placed under image fusion guidance. After hepatic vein catheterization, an unenhanced CBCT acquisition was performed and co-registered with the pre-procedural portal phase CT images. A virtual path between hepatic vein and portal branch was made using the virtual needle path trajectory software. Subsequently, the 3D virtual path was overlaid on 2D fluoroscopy for guidance during portal branch cannulation. Safety, feasibility, effectiveness and per-procedural data were evaluated. Sixteen patients (12 males; median age 56 years) were included. Procedures were technically feasible in 15 of the 16 patients (94%). One procedure was aborted due to hepatic vein catheterization failure related to severe liver distortion. No periprocedural complications occurred within 48 h of the procedure. The median dose-area product was 91 Gy cm 2 , fluoroscopy time 15 min, procedure time 40 min and contrast media consumption 65 mL. Clinical benefit of the TIPS placement was observed in nine patients (56%). This study suggests that 3D image fusion guidance for TIPS is feasible, safe and effective. By identifying virtual needle path, CBCT enables real-time multiplanar guidance and may facilitate TIPS placement.

Design of a universal logic block for fault-tolerant realization of any logic operation in trapped-ion quantum circuits

NASA Astrophysics Data System (ADS)

Goudarzi, H.; Dousti, M. J.; Shafaei, A.; Pedram, M.

2014-05-01

This paper presents a physical mapping tool for quantum circuits, which generates the optimal universal logic block (ULB) that can, on average, perform any logical fault-tolerant (FT) quantum operations with the minimum latency. The operation scheduling, placement, and qubit routing problems tackled by the quantum physical mapper are highly dependent on one another. More precisely, the scheduling solution affects the quality of the achievable placement solution due to resource pressures that may be created as a result of operation scheduling, whereas the operation placement and qubit routing solutions influence the scheduling solution due to resulting distances between predecessor and current operations, which in turn determines routing latencies. The proposed flow for the quantum physical mapper captures these dependencies by applying (1) a loose scheduling step, which transforms an initial quantum data flow graph into one that explicitly captures the no-cloning theorem of the quantum computing and then performs instruction scheduling based on a modified force-directed scheduling approach to minimize the resource contention and quantum circuit latency, (2) a placement step, which uses timing-driven instruction placement to minimize the approximate routing latencies while making iterative calls to the aforesaid force-directed scheduler to correct scheduling levels of quantum operations as needed, and (3) a routing step that finds dynamic values of routing latencies for the qubits. In addition to the quantum physical mapper, an approach is presented to determine the single best ULB size for a target quantum circuit by examining the latency of different FT quantum operations mapped onto different ULB sizes and using information about the occurrence frequency of operations on critical paths of the target quantum algorithm to weigh these latencies. Experimental results show an average latency reduction of about 40 % compared to previous work.

Optimal placement of tuning masses on truss structures by genetic algorithms

NASA Technical Reports Server (NTRS)

Ponslet, Eric; Haftka, Raphael T.; Cudney, Harley H.

1993-01-01

Optimal placement of tuning masses, actuators and other peripherals on large space structures is a combinatorial optimization problem. This paper surveys several techniques for solving this problem. The genetic algorithm approach to the solution of the placement problem is described in detail. An example of minimizing the difference between the two lowest frequencies of a laboratory truss by adding tuning masses is used for demonstrating some of the advantages of genetic algorithms. The relative efficiencies of different codings are compared using the results of a large number of optimization runs.

Optimal sensor placement for spatial lattice structure based on genetic algorithms

NASA Astrophysics Data System (ADS)

Liu, Wei; Gao, Wei-cheng; Sun, Yi; Xu, Min-jian

2008-10-01

Optimal sensor placement technique plays a key role in structural health monitoring of spatial lattice structures. This paper considers the problem of locating sensors on a spatial lattice structure with the aim of maximizing the data information so that structural dynamic behavior can be fully characterized. Based on the criterion of optimal sensor placement for modal test, an improved genetic algorithm is introduced to find the optimal placement of sensors. The modal strain energy (MSE) and the modal assurance criterion (MAC) have been taken as the fitness function, respectively, so that three placement designs were produced. The decimal two-dimension array coding method instead of binary coding method is proposed to code the solution. Forced mutation operator is introduced when the identical genes appear via the crossover procedure. A computational simulation of a 12-bay plain truss model has been implemented to demonstrate the feasibility of the three optimal algorithms above. The obtained optimal sensor placements using the improved genetic algorithm are compared with those gained by exiting genetic algorithm using the binary coding method. Further the comparison criterion based on the mean square error between the finite element method (FEM) mode shapes and the Guyan expansion mode shapes identified by data-driven stochastic subspace identification (SSI-DATA) method are employed to demonstrate the advantage of the different fitness function. The results showed that some innovations in genetic algorithm proposed in this paper can enlarge the genes storage and improve the convergence of the algorithm. More importantly, the three optimal sensor placement methods can all provide the reliable results and identify the vibration characteristics of the 12-bay plain truss model accurately.

Optimization Strategies for Sensor and Actuator Placement

NASA Technical Reports Server (NTRS)

Padula, Sharon L.; Kincaid, Rex K.

1999-01-01

This paper provides a survey of actuator and sensor placement problems from a wide range of engineering disciplines and a variety of applications. Combinatorial optimization methods are recommended as a means for identifying sets of actuators and sensors that maximize performance. Several sample applications from NASA Langley Research Center, such as active structural acoustic control, are covered in detail. Laboratory and flight tests of these applications indicate that actuator and sensor placement methods are effective and important. Lessons learned in solving these optimization problems can guide future research.

RJMCMC based Text Placement to Optimize Label Placement and Quantity

NASA Astrophysics Data System (ADS)

Touya, Guillaume; Chassin, Thibaud

2018-05-01

Label placement is a tedious task in map design, and its automation has long been a goal for researchers in cartography, but also in computational geometry. Methods that search for an optimal or nearly optimal solution that satisfies a set of constraints, such as label overlapping, have been proposed in the literature. Most of these methods mainly focus on finding the optimal position for a given set of labels, but rarely allow the removal of labels as part of the optimization. This paper proposes to apply an optimization technique called Reversible-Jump Markov Chain Monte Carlo that enables to easily model the removal or addition during the optimization iterations. The method, quite preliminary for now, is tested on a real dataset, and the first results are encouraging.

CT fluoroscopy guided transpleural cutting needle biopsy of small (≤2.5 cm) subpleural pulmonary nodules.

PubMed

Prosch, Helmut; Oschatz, Elisabeth; Eisenhuber, Edith; Wohlschlager, Helmut; Mostbeck, Gerhard H

2011-01-01

Small subpleural pulmonary lesions are difficult to biopsy. While the direct, short needle path has been reported to have a lower rate of pneumothorax, the indirect path provides a higher diagnostic yield. Therefore, we tried to optimize the needle pathway and minimize the iatrogenic pneumothorax risk by evaluating a CT fluoroscopy guided direct approach to biopsy subpleural lesions. Between 01/2005 and 01/2007, CT fluoroscopy guided core biopsies were performed in 24 patients. Using our technique, the tip of the guide needle remains outside the visceral pleura (17 G coaxial guide needle, 18 G Biopsy-gun, 15 or 22 mm needle path). The position of the lesion relative to the needle tip can be optimized using CT fluoroscopy by adjusting the breathing position of the patient. The Biopty gun is fired with the needle tip still outside the pleural space. Cytological smears are analyzed by a cytopathologist on-site, and biopsies are repeated as indicated with the coaxial needle still outside the pleura. Median nodule size was 1.6 cm (0.7-2.3 cm). A definitive diagnosis was obtained in 22 patients by histology and/or cytology. In one patient, only necrotic material could be obtained. In another patient, the intervention had to be aborted as the dyspnoic patient could not follow breathing instructions. An asymptomatic pneumothorax was present in seven patients; chest tube placement was not required. The presented biopsy approach has a high diagnostic yield and is especially advantageous for biopsies of small subpleural lesions in the lower lobes. Copyright © 2009 Elsevier Ireland Ltd. All rights reserved.

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

Artificial Intelligence based technique for BTS placement

NASA Astrophysics Data System (ADS)

Alenoghena, C. O.; Emagbetere, J. O.; Aibinu, A. M.

2013-12-01

The increase of the base transceiver station (BTS) in most urban areas can be traced to the drive by network providers to meet demand for coverage and capacity. In traditional network planning, the final decision of BTS placement is taken by a team of radio planners, this decision is not fool proof against regulatory requirements. In this paper, an intelligent based algorithm for optimal BTS site placement has been proposed. The proposed technique takes into consideration neighbour and regulation considerations objectively while determining cell site. The application will lead to a quantitatively unbiased evaluated decision making process in BTS placement. An experimental data of a 2km by 3km territory was simulated for testing the new algorithm, results obtained show a 100% performance of the neighbour constrained algorithm in BTS placement optimization. Results on the application of GA with neighbourhood constraint indicate that the choices of location can be unbiased and optimization of facility placement for network design can be carried out.

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.

3D sensor placement strategy using the full-range pheromone ant colony system

NASA Astrophysics Data System (ADS)

Shuo, Feng; Jingqing, Jia

2016-07-01

An optimized sensor placement strategy will be extremely beneficial to ensure the safety and cost reduction considerations of structural health monitoring (SHM) systems. The sensors must be placed such that important dynamic information is obtained and the number of sensors is minimized. The practice is to select individual sensor directions by several 1D sensor methods and the triaxial sensors are placed in these directions for monitoring. However, this may lead to non-optimal placement of many triaxial sensors. In this paper, a new method, called FRPACS, is proposed based on the ant colony system (ACS) to solve the optimal placement of triaxial sensors. The triaxial sensors are placed as single units in an optimal fashion. And then the new method is compared with other algorithms using Dalian North Bridge. The computational precision and iteration efficiency of the FRPACS has been greatly improved compared with the original ACS and EFI method.

Self-deployable mobile sensor networks for on-demand surveillance

NASA Astrophysics Data System (ADS)

Miao, Lidan; Qi, Hairong; Wang, Feiyi

2005-05-01

This paper studies two interconnected problems in mobile sensor network deployment, the optimal placement of heterogeneous mobile sensor platforms for cost-efficient and reliable coverage purposes, and the self-organizable deployment. We first develop an optimal placement algorithm based on a "mosaicked technology" such that different types of mobile sensors form a mosaicked pattern uniquely determined by the popularity of different types of sensor nodes. The initial state is assumed to be random. In order to converge to the optimal state, we investigate the swarm intelligence (SI)-based sensor movement strategy, through which the randomly deployed sensors can self-organize themselves to reach the optimal placement state. The proposed algorithm is compared with the random movement and the centralized method using performance metrics such as network coverage, convergence time, and energy consumption. Simulation results are presented to demonstrate the effectiveness of the mosaic placement and the SI-based movement.

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

Simultaneous optimization of loading pattern and burnable poison placement for PWRs

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

Alim, F.; Ivanov, K.; Yilmaz, S.

2006-07-01

To solve in-core fuel management optimization problem, GARCO-PSU (Genetic Algorithm Reactor Core Optimization - Pennsylvania State Univ.) is developed. This code is applicable for all types and geometry of PWR core structures with unlimited number of fuel assembly (FA) types in the inventory. For this reason an innovative genetic algorithm is developed with modifying the classical representation of the genotype. In-core fuel management heuristic rules are introduced into GARCO. The core re-load design optimization has two parts, loading pattern (LP) optimization and burnable poison (BP) placement optimization. These parts depend on each other, but it is difficult to solve themore » combined problem due to its large size. Separating the problem into two parts provides a practical way to solve the problem. However, the result of this method does not reflect the real optimal solution. GARCO-PSU achieves to solve LP optimization and BP placement optimization simultaneously in an efficient manner. (authors)« less

SCAMP: Rapid Focused Sonic Boom Waypoint Flight Planning Methods, Execution, and Results

NASA Technical Reports Server (NTRS)

Haering, Edward A., Jr.; Cliatt, Larry J., II; Delaney, Michael M., Jr.; Plotkin, Kenneth J.; Maglieri, Domenic J.; Brown, Jacob C.

2012-01-01

Successful execution of the flight phase of the Superboom Caustic Analysis and Measurement Project (SCAMP) required accurate placement of focused sonic booms on an array of prepositioned ground sensors. While the array was spread over a 10,000-ft-long area, this is a relatively small region when considering the speed of a supersonic aircraft and sonic boom ray path variability due to shifting atmospheric conditions and aircraft trajectories. Another requirement of the project was to determine the proper position for a microphone-equipped motorized glider to intercept the sonic boom caustic, adding critical timing to the constraints. Variability in several inputs to these calculations caused some shifts of the focus away from the optimal location. Reports of the sonic booms heard by persons positioned amongst the array were used to shift the focus closer to the optimal location for subsequent passes. This paper describes the methods and computations used to place the focused sonic boom on the SCAMP array and gives recommendations for their accurate placement by future quiet supersonic aircraft. For the SCAMP flights, 67% of the foci were placed on the ground array with measured positions within a few thousand feet of computed positions. Among those foci with large caustic elevation angles, 96% of foci were placed on the array, and measured positions were within a few hundred feet of computed positions. The motorized glider captured sonic booms on 59% of the passes when the instrumentation was operating properly.

Preclinical evaluation of an MRI-compatible pneumatic robot for angulated needle placement in transperineal prostate interventions.

PubMed

Tokuda, Junichi; Song, Sang-Eun; Fischer, Gregory S; Iordachita, Iulian I; Seifabadi, Reza; Cho, Nathan B; Tuncali, Kemal; Fichtinger, Gabor; Tempany, Clare M; Hata, Nobuhiko

2012-11-01

To evaluate the targeting accuracy of a small profile MRI-compatible pneumatic robot for needle placement that can angulate a needle insertion path into a large accessible target volume. We extended our MRI-compatible pneumatic robot for needle placement to utilize its four degrees-of-freedom (4-DOF) mechanism with two parallel triangular structures and support transperineal prostate biopsies in a closed-bore magnetic resonance imaging (MRI) scanner. The robot is designed to guide a needle toward a lesion so that a radiologist can manually insert it in the bore. The robot is integrated with navigation software that allows an operator to plan angulated needle insertion by selecting a target and an entry point. The targeting error was evaluated while the angle between the needle insertion path and the static magnetic field was between -5.7° and 5.7° horizontally and between -5.7° and 4.3° vertically in the MRI scanner after sterilizing and draping the device. The robot positioned the needle for angulated insertion as specified on the navigation software with overall targeting error of 0.8 ± 0.5mm along the horizontal axis and 0.8 ± 0.8mm along the vertical axis. The two-dimensional root-mean-square targeting error on the axial slices as containing the targets was 1.4mm. Our preclinical evaluation demonstrated that the MRI-compatible pneumatic robot for needle placement with the capability to angulate the needle insertion path provides targeting accuracy feasible for clinical MRI-guided prostate interventions. The clinical feasibility has to be established in a clinical study.

Optimal Trajectories Generation in Robotic Fiber Placement Systems

NASA Astrophysics Data System (ADS)

Gao, Jiuchun; Pashkevich, Anatol; Caro, Stéphane

2017-06-01

The paper proposes a methodology for optimal trajectories generation in robotic fiber placement systems. A strategy to tune the parameters of the optimization algorithm at hand is also introduced. The presented technique transforms the original continuous problem into a discrete one where the time-optimal motions are generated by using dynamic programming. The developed strategy for the optimization algorithm tuning allows essentially reducing the computing time and obtaining trajectories satisfying industrial constraints. Feasibilities and advantages of the proposed methodology are confirmed by an application example.

Geometric Reasoning for Automated Planning

NASA Technical Reports Server (NTRS)

Clement, Bradley J.; Knight, Russell L.; Broderick, Daniel

2012-01-01

An important aspect of mission planning for NASA s operation of the International Space Station is the allocation and management of space for supplies and equipment. The Stowage, Configuration Analysis, and Operations Planning teams collaborate to perform the bulk of that planning. A Geometric Reasoning Engine is developed in a way that can be shared by the teams to optimize item placement in the context of crew planning. The ISS crew spends (at the time of this writing) a third or more of their time moving supplies and equipment around. Better logistical support and optimized packing could make a significant impact on operational efficiency of the ISS. Currently, computational geometry and motion planning do not focus specifically on the optimized orientation and placement of 3D objects based on multiple distance and containment preferences and constraints. The software performs reasoning about the manipulation of 3D solid models in order to maximize an objective function based on distance. It optimizes for 3D orientation and placement. Spatial placement optimization is a general problem and can be applied to object packing or asset relocation.

Optimal sensor placement for leak location in water distribution networks using genetic algorithms.

PubMed

Casillas, Myrna V; Puig, Vicenç; Garza-Castañón, Luis E; Rosich, Albert

2013-11-04

This paper proposes a new sensor placement approach for leak location in water distribution networks (WDNs). The sensor placement problem is formulated as an integer optimization problem. The optimization criterion consists in minimizing the number of non-isolable leaks according to the isolability criteria introduced. Because of the large size and non-linear integer nature of the resulting optimization problem, genetic algorithms (GAs) are used as the solution approach. The obtained results are compared with a semi-exhaustive search method with higher computational effort, proving that GA allows one to find near-optimal solutions with less computational load. Moreover, three ways of increasing the robustness of the GA-based sensor placement method have been proposed using a time horizon analysis, a distance-based scoring and considering different leaks sizes. A great advantage of the proposed methodology is that it does not depend on the isolation method chosen by the user, as long as it is based on leak sensitivity analysis. Experiments in two networks allow us to evaluate the performance of the proposed approach.

Optimal Sensor Placement for Leak Location in Water Distribution Networks Using Genetic Algorithms

PubMed Central

Casillas, Myrna V.; Puig, Vicenç; Garza-Castañón, Luis E.; Rosich, Albert

2013-01-01

This paper proposes a new sensor placement approach for leak location in water distribution networks (WDNs). The sensor placement problem is formulated as an integer optimization problem. The optimization criterion consists in minimizing the number of non-isolable leaks according to the isolability criteria introduced. Because of the large size and non-linear integer nature of the resulting optimization problem, genetic algorithms (GAs) are used as the solution approach. The obtained results are compared with a semi-exhaustive search method with higher computational effort, proving that GA allows one to find near-optimal solutions with less computational load. Moreover, three ways of increasing the robustness of the GA-based sensor placement method have been proposed using a time horizon analysis, a distance-based scoring and considering different leaks sizes. A great advantage of the proposed methodology is that it does not depend on the isolation method chosen by the user, as long as it is based on leak sensitivity analysis. Experiments in two networks allow us to evaluate the performance of the proposed approach. PMID:24193099

Joint Optimization of Receiver Placement and Illuminator Selection for a Multiband Passive Radar Network.

PubMed

Xie, Rui; Wan, Xianrong; Hong, Sheng; Yi, Jianxin

2017-06-14

The performance of a passive radar network can be greatly improved by an optimal radar network structure. Generally, radar network structure optimization consists of two aspects, namely the placement of receivers in suitable places and selection of appropriate illuminators. The present study investigates issues concerning the joint optimization of receiver placement and illuminator selection for a passive radar network. Firstly, the required radar cross section (RCS) for target detection is chosen as the performance metric, and the joint optimization model boils down to the partition p -center problem (PPCP). The PPCP is then solved by a proposed bisection algorithm. The key of the bisection algorithm lies in solving the partition set covering problem (PSCP), which can be solved by a hybrid algorithm developed by coupling the convex optimization with the greedy dropping algorithm. In the end, the performance of the proposed algorithm is validated via numerical simulations.

Optimal sensor placement for deployable antenna module health monitoring in SSPS using genetic algorithm

NASA Astrophysics Data System (ADS)

Yang, Chen; Zhang, Xuepan; Huang, Xiaoqi; Cheng, ZhengAi; Zhang, Xinghua; Hou, Xinbin

2017-11-01

The concept of space solar power satellite (SSPS) is an advanced system for collecting solar energy in space and transmitting it wirelessly to earth. However, due to the long service life, in-orbit damage may occur in the structural system of SSPS. Therefore, sensor placement layouts for structural health monitoring should be firstly considered in this concept. In this paper, based on genetic algorithm, an optimal sensor placement method for deployable antenna module health monitoring in SSPS is proposed. According to the characteristics of the deployable antenna module, the designs of sensor placement are listed. Furthermore, based on effective independence method and effective interval index, a combined fitness function is defined to maximize linear independence in targeted modes while simultaneously avoiding redundant information at nearby positions. In addition, by considering the reliability of sensors located at deployable mechanisms, another fitness function is constituted. Moreover, the solution process of optimal sensor placement by using genetic algorithm is clearly demonstrated. At last, a numerical example about the sensor placement layout in a deployable antenna module of SSPS is presented, which by synthetically considering all the above mentioned performances. All results can illustrate the effectiveness and feasibility of the proposed sensor placement method in SSPS.

Effect of spatial variability of storm on the optimal placement of best management practices (BMPs).

PubMed

Chang, C L; Chiueh, P T; Lo, S L

2007-12-01

It is significant to design best management practices (BMPs) and determine the proper BMPs placement for the purpose that can not only satisfy the water quantity and water quality standard, but also lower the total cost of BMPs. The spatial rainfall variability can have much effect on its relative runoff and non-point source pollution (NPSP). Meantime, the optimal design and placement of BMPs would be different as well. The objective of this study was to discuss the relationship between the spatial variability of rainfall and the optimal BMPs placements. Three synthetic rainfall storms with varied spatial distributions, including uniform rainfall, downstream rainfall and upstream rainfall, were designed. WinVAST model was applied to predict runoff and NPSP. Additionally, detention pond and swale were selected for being structural BMPs. Scatter search was applied to find the optimal BMPs placement. The results show that mostly the total cost of BMPs is higher in downstream rainfall than in upstream rainfall or uniform rainfall. Moreover, the cost of detention pond is much higher than swale. Thus, even though detention pond has larger efficiency for lowering peak flow and pollutant exports, it is not always the determined set in each subbasin.

An improved reaction path optimization method using a chain of conformations

NASA Astrophysics Data System (ADS)

Asada, Toshio; Sawada, Nozomi; Nishikawa, Takuya; Koseki, Shiro

2018-05-01

The efficient fast path optimization (FPO) method is proposed to optimize the reaction paths on energy surfaces by using chains of conformations. No artificial spring force is used in the FPO method to ensure the equal spacing of adjacent conformations. The FPO method is applied to optimize the reaction path on two model potential surfaces. The use of this method enabled the optimization of the reaction paths with a drastically reduced number of optimization cycles for both potentials. It was also successfully utilized to define the MEP of the isomerization of the glycine molecule in water by FPO method.

Energy-optimal path planning by stochastic dynamically orthogonal level-set optimization

NASA Astrophysics Data System (ADS)

Subramani, Deepak N.; Lermusiaux, Pierre F. J.

2016-04-01

A stochastic optimization methodology is formulated for computing energy-optimal paths from among time-optimal paths of autonomous vehicles navigating in a dynamic flow field. Based on partial differential equations, the methodology rigorously leverages the level-set equation that governs time-optimal reachability fronts for a given relative vehicle-speed function. To set up the energy optimization, the relative vehicle-speed and headings are considered to be stochastic and new stochastic Dynamically Orthogonal (DO) level-set equations are derived. Their solution provides the distribution of time-optimal reachability fronts and corresponding distribution of time-optimal paths. An optimization is then performed on the vehicle's energy-time joint distribution to select the energy-optimal paths for each arrival time, among all stochastic time-optimal paths for that arrival time. Numerical schemes to solve the reduced stochastic DO level-set equations are obtained, and accuracy and efficiency considerations are discussed. These reduced equations are first shown to be efficient at solving the governing stochastic level-sets, in part by comparisons with direct Monte Carlo simulations. To validate the methodology and illustrate its accuracy, comparisons with semi-analytical energy-optimal path solutions are then completed. In particular, we consider the energy-optimal crossing of a canonical steady front and set up its semi-analytical solution using a energy-time nested nonlinear double-optimization scheme. We then showcase the inner workings and nuances of the energy-optimal path planning, considering different mission scenarios. Finally, we study and discuss results of energy-optimal missions in a wind-driven barotropic quasi-geostrophic double-gyre ocean circulation.

Topography-based Flood Planning and Optimization Capability Development Report

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

Judi, David R.; Tasseff, Byron A.; Bent, Russell W.

2014-02-26

Globally, water-related disasters are among the most frequent and costly natural hazards. Flooding inflicts catastrophic damage on critical infrastructure and population, resulting in substantial economic and social costs. NISAC is developing LeveeSim, a suite of nonlinear and network optimization models, to predict optimal barrier placement to protect critical regions and infrastructure during flood events. LeveeSim currently includes a high-performance flood model to simulate overland flow, as well as a network optimization model to predict optimal barrier placement during a flood event. The LeveeSim suite models the effects of flooding in predefined regions. By manipulating a domain’s underlying topography, developers alteredmore » flood propagation to reduce detrimental effects in areas of interest. This numerical altering of a domain’s topography is analogous to building levees, placing sandbags, etc. To induce optimal changes in topography, NISAC used a novel application of an optimization algorithm to minimize flooding effects in regions of interest. To develop LeveeSim, NISAC constructed and coupled hydrodynamic and optimization algorithms. NISAC first implemented its existing flood modeling software to use massively parallel graphics processing units (GPUs), which allowed for the simulation of larger domains and longer timescales. NISAC then implemented a network optimization model to predict optimal barrier placement based on output from flood simulations. As proof of concept, NISAC developed five simple test scenarios, and optimized topographic solutions were compared with intuitive solutions. Finally, as an early validation example, barrier placement was optimized to protect an arbitrary region in a simulation of the historic Taum Sauk dam breach.« less

Computing the optimal path in stochastic dynamical systems

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

Bauver, Martha; Forgoston, Eric, E-mail: eric.forgoston@montclair.edu; Billings, Lora

2016-08-15

In stochastic systems, one is often interested in finding the optimal path that maximizes the probability of escape from a metastable state or of switching between metastable states. Even for simple systems, it may be impossible to find an analytic form of the optimal path, and in high-dimensional systems, this is almost always the case. In this article, we formulate a constructive methodology that is used to compute the optimal path numerically. The method utilizes finite-time Lyapunov exponents, statistical selection criteria, and a Newton-based iterative minimizing scheme. The method is applied to four examples. The first example is a two-dimensionalmore » system that describes a single population with internal noise. This model has an analytical solution for the optimal path. The numerical solution found using our computational method agrees well with the analytical result. The second example is a more complicated four-dimensional system where our numerical method must be used to find the optimal path. The third example, although a seemingly simple two-dimensional system, demonstrates the success of our method in finding the optimal path where other numerical methods are known to fail. In the fourth example, the optimal path lies in six-dimensional space and demonstrates the power of our method in computing paths in higher-dimensional spaces.« less

Data-driven sensor placement from coherent fluid structures

NASA Astrophysics Data System (ADS)

Manohar, Krithika; Kaiser, Eurika; Brunton, Bingni W.; Kutz, J. Nathan; Brunton, Steven L.

2017-11-01

Optimal sensor placement is a central challenge in the prediction, estimation and control of fluid flows. We reinterpret sensor placement as optimizing discrete samples of coherent fluid structures for full state reconstruction. This permits a drastic reduction in the number of sensors required for faithful reconstruction, since complex fluid interactions can often be described by a small number of coherent structures. Our work optimizes point sensors using the pivoted matrix QR factorization to sample coherent structures directly computed from flow data. We apply this sampling technique in conjunction with various data-driven modal identification methods, including the proper orthogonal decomposition (POD) and dynamic mode decomposition (DMD). In contrast to POD-based sensors, DMD demonstrably enables the optimization of sensors for prediction in systems exhibiting multiple scales of dynamics. Finally, reconstruction accuracy from pivot sensors is shown to be competitive with sensors obtained using traditional computationally prohibitive optimization methods.

Development of Decision-Making Automated System for Optimal Placement of Physical Access Control System’s Elements

NASA Astrophysics Data System (ADS)

Danilova, Olga; Semenova, Zinaida

2018-04-01

The objective of this study is a detailed analysis of physical protection systems development for information resources. The optimization theory and decision-making mathematical apparatus is used to formulate correctly and create an algorithm of selection procedure for security systems optimal configuration considering the location of the secured object’s access point and zones. The result of this study is a software implementation scheme of decision-making system for optimal placement of the physical access control system’s elements.

Spatial and temporal optimization in habitat placement for a threatened plant: the case of the western prairie fringed orchid

Treesearch

John Hof; Carolyn Hull Sieg; Michael Bevers

1999-01-01

This paper investigates an optimization approach to determining the placement and timing of habitat protection for the western prairie fringed orchid. This plant’s population dynamics are complex, creating a challenging optimization problem. The sensitivity of the orchid to random climate conditions is handled probabilistically. The plant’s seed, protocorm and above-...

An Effective Mechanism for Virtual Machine Placement using Aco in IAAS Cloud

NASA Astrophysics Data System (ADS)

Shenbaga Moorthy, Rajalakshmi; Fareentaj, U.; Divya, T. K.

2017-08-01

Cloud computing provides an effective way to dynamically provide numerous resources to meet customer demands. A major challenging problem for cloud providers is designing efficient mechanisms for optimal virtual machine Placement (OVMP). Such mechanisms enable the cloud providers to effectively utilize their available resources and obtain higher profits. In order to provide appropriate resources to the clients an optimal virtual machine placement algorithm is proposed. Virtual machine placement is NP-Hard problem. Such NP-Hard problem can be solved using heuristic algorithm. In this paper, Ant Colony Optimization based virtual machine placement is proposed. Our proposed system focuses on minimizing the cost spending in each plan for hosting virtual machines in a multiple cloud provider environment and the response time of each cloud provider is monitored periodically, in such a way to minimize delay in providing the resources to the users. The performance of the proposed algorithm is compared with greedy mechanism. The proposed algorithm is simulated in Eclipse IDE. The results clearly show that the proposed algorithm minimizes the cost, response time and also number of migrations.

Field development planning using simulated annealing - optimal economic well scheduling and placement

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

Beckner, B.L.; Xong, X.

1995-12-31

A method for optimizing the net present value of a full field development by varying the placement and sequence of production wells is presented. This approach is automated and combines an economics package and Mobil`s in-house simulator, PEGASUS, within a simulated annealing optimization engine. A novel framing of the well placement and scheduling problem as a classic {open_quotes}travelling salesman problem{close_quotes} is required before optimization via simulated annealing can be applied practically. An example of a full field development using this technique shows that non-uniform well spacings are optimal (from an NPV standpoint) when the effects of well interference and variablemore » reservoir properties are considered. Examples of optimizing field NPV with variable well costs also show that non-uniform wells spacings are optimal. Project NPV increases of 25 to 30 million dollars were shown using the optimal, nonuniform development versus reasonable, uniform developments. The ability of this technology to deduce these non-uniform well spacings opens up many potential applications that should materially impact the economic performance of field developments.« less

Toward Optimal Target Placement for Neural Prosthetic Devices

PubMed Central

Cunningham, John P.; Yu, Byron M.; Gilja, Vikash; Ryu, Stephen I.; Shenoy, Krishna V.

2008-01-01

Neural prosthetic systems have been designed to estimate continuous reach trajectories (motor prostheses) and to predict discrete reach targets (communication prostheses). In the latter case, reach targets are typically decoded from neural spiking activity during an instructed delay period before the reach begins. Such systems use targets placed in radially symmetric geometries independent of the tuning properties of the neurons available. Here we seek to automate the target placement process and increase decode accuracy in communication prostheses by selecting target locations based on the neural population at hand. Motor prostheses that incorporate intended target information could also benefit from this consideration. We present an optimal target placement algorithm that approximately maximizes decode accuracy with respect to target locations. In simulated neural spiking data fit from two monkeys, the optimal target placement algorithm yielded statistically significant improvements up to 8 and 9% for two and sixteen targets, respectively. For four and eight targets, gains were more modest, as the target layouts found by the algorithm closely resembled the canonical layouts. We trained a monkey in this paradigm and tested the algorithm with experimental neural data to confirm some of the results found in simulation. In all, the algorithm can serve not only to create new target layouts that outperform canonical layouts, but it can also confirm or help select among multiple canonical layouts. The optimal target placement algorithm developed here is the first algorithm of its kind, and it should both improve decode accuracy and help automate target placement for neural prostheses. PMID:18829845

Energy Optimal Path Planning: Integrating Coastal Ocean Modelling with Optimal Control

NASA Astrophysics Data System (ADS)

Subramani, D. N.; Haley, P. J., Jr.; Lermusiaux, P. F. J.

2016-02-01

A stochastic optimization methodology is formulated for computing energy-optimal paths from among time-optimal paths of autonomous vehicles navigating in a dynamic flow field. To set up the energy optimization, the relative vehicle speed and headings are considered to be stochastic, and new stochastic Dynamically Orthogonal (DO) level-set equations that govern their stochastic time-optimal reachability fronts are derived. Their solution provides the distribution of time-optimal reachability fronts and corresponding distribution of time-optimal paths. An optimization is then performed on the vehicle's energy-time joint distribution to select the energy-optimal paths for each arrival time, among all stochastic time-optimal paths for that arrival time. The accuracy and efficiency of the DO level-set equations for solving the governing stochastic level-set reachability fronts are quantitatively assessed, including comparisons with independent semi-analytical solutions. Energy-optimal missions are studied in wind-driven barotropic quasi-geostrophic double-gyre circulations, and in realistic data-assimilative re-analyses of multiscale coastal ocean flows. The latter re-analyses are obtained from multi-resolution 2-way nested primitive-equation simulations of tidal-to-mesoscale dynamics in the Middle Atlantic Bight and Shelbreak Front region. The effects of tidal currents, strong wind events, coastal jets, and shelfbreak fronts on the energy-optimal paths are illustrated and quantified. Results showcase the opportunities for longer-duration missions that intelligently utilize the ocean environment to save energy, rigorously integrating ocean forecasting with optimal control of autonomous vehicles.

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.

Improved spatial coverage for brain 3D PRESS MRSI by automatic placement of outer-volume suppression saturation bands.

PubMed

Ozhinsky, Eugene; Vigneron, Daniel B; Nelson, Sarah J

2011-04-01

To develop a technique for optimizing coverage of brain 3D (1) H magnetic resonance spectroscopic imaging (MRSI) by automatic placement of outer-volume suppression (OVS) saturation bands (sat bands) and to compare the performance for point-resolved spectroscopic sequence (PRESS) MRSI protocols with manual and automatic placement of sat bands. The automated OVS procedure includes the acquisition of anatomic images from the head, obtaining brain and lipid tissue maps, calculating optimal sat band placement, and then using those optimized parameters during the MRSI acquisition. The data were analyzed to quantify brain coverage volume and data quality. 3D PRESS MRSI data were acquired from three healthy volunteers and 29 patients using protocols that included either manual or automatic sat band placement. On average, the automatic sat band placement allowed the acquisition of PRESS MRSI data from 2.7 times larger brain volumes than the conventional method while maintaining data quality. The technique developed helps solve two of the most significant problems with brain PRESS MRSI acquisitions: limited brain coverage and difficulty in prescription. This new method will facilitate routine clinical brain 3D MRSI exams and will be important for performing serial evaluation of response to therapy in patients with brain tumors and other neurological diseases. Copyright © 2011 Wiley-Liss, Inc.

Optimal placement and sizing of wind / solar based DG sources in distribution system

NASA Astrophysics Data System (ADS)

Guan, Wanlin; Guo, Niao; Yu, Chunlai; Chen, Xiaoguang; Yu, Haiyang; Liu, Zhipeng; Cui, Jiapeng

2017-06-01

Proper placement and sizing of Distributed Generation (DG) in distribution system can obtain maximum potential benefits. This paper proposes quantum particle swarm algorithm (QPSO) based wind turbine generation unit (WTGU) and photovoltaic (PV) array placement and sizing approach for real power loss reduction and voltage stability improvement of distribution system. Performance modeling of wind and solar generation system are described and classified into PQ\\PQ (V)\\PI type models in power flow. Considering the WTGU and PV based DGs in distribution system is geographical restrictive, the optimal area and DG capacity limits of each bus in the setting area need to be set before optimization, the area optimization method is proposed . The method has been tested on IEEE 33-bus radial distribution systems to demonstrate the performance and effectiveness of the proposed method.

Wind Farm Turbine Type and Placement Optimization

NASA Astrophysics Data System (ADS)

Graf, Peter; Dykes, Katherine; Scott, George; Fields, Jason; Lunacek, Monte; Quick, Julian; Rethore, Pierre-Elouan

2016-09-01

The layout of turbines in a wind farm is already a challenging nonlinear, nonconvex, nonlinearly constrained continuous global optimization problem. Here we begin to address the next generation of wind farm optimization problems by adding the complexity that there is more than one turbine type to choose from. The optimization becomes a nonlinear constrained mixed integer problem, which is a very difficult class of problems to solve. This document briefly summarizes the algorithm and code we have developed, the code validation steps we have performed, and the initial results for multi-turbine type and placement optimization (TTP_OPT) we have run.

Wind farm turbine type and placement optimization

DOE PAGES

Graf, Peter; Dykes, Katherine; Scott, George; ...

2016-10-03

The layout of turbines in a wind farm is already a challenging nonlinear, nonconvex, nonlinearly constrained continuous global optimization problem. Here we begin to address the next generation of wind farm optimization problems by adding the complexity that there is more than one turbine type to choose from. The optimization becomes a nonlinear constrained mixed integer problem, which is a very difficult class of problems to solve. Furthermore, this document briefly summarizes the algorithm and code we have developed, the code validation steps we have performed, and the initial results for multi-turbine type and placement optimization (TTP_OPT) we have run.

An interactive wire-wrap board layout program

NASA Technical Reports Server (NTRS)

Schlutsmeyer, A.

1987-01-01

An interactive computer-graphics-based tool for specifying the placement of electronic parts on a wire-wrap circuit board is presented. Input is a data file (currently produced by a commercial logic design system) which describes the parts used and their interconnections. Output includes printed reports describing the parts and wire paths, parts counts, placement lists, board drawing, and a tape to send to the wire-wrap vendor. The program should reduce the engineer's layout time by a factor of 3 to 5 as compared to manual methods.

Fast exploration of an optimal path on the multidimensional free energy surface

PubMed Central

Chen, Changjun

2017-01-01

In a reaction, determination of an optimal path with a high reaction rate (or a low free energy barrier) is important for the study of the reaction mechanism. This is a complicated problem that involves lots of degrees of freedom. For simple models, one can build an initial path in the collective variable space by the interpolation method first and then update the whole path constantly in the optimization. However, such interpolation method could be risky in the high dimensional space for large molecules. On the path, steric clashes between neighboring atoms could cause extremely high energy barriers and thus fail the optimization. Moreover, performing simulations for all the snapshots on the path is also time-consuming. In this paper, we build and optimize the path by a growing method on the free energy surface. The method grows a path from the reactant and extends its length in the collective variable space step by step. The growing direction is determined by both the free energy gradient at the end of the path and the direction vector pointing at the product. With fewer snapshots on the path, this strategy can let the path avoid the high energy states in the growing process and save the precious simulation time at each iteration step. Applications show that the presented method is efficient enough to produce optimal paths on either the two-dimensional or the twelve-dimensional free energy surfaces of different small molecules. PMID:28542475

The Effects of Direction of Exertion, Path, and Load Placement in Nursing Cart Pushing and Pulling Tasks: An Electromyographical Study.

PubMed

Kao, Huei Chu; Lin, Chiuhsiang Joe; Lee, Yung Hui; Chen, Su Huang

2015-01-01

The purpose of this study was to explore the effects of direction of exertion (DOE) (pushing, pulling), path (walking in a straight line, turning left, walking uphill), and load placement (LP) (the 18 blocks were indicated by X, Y and Z axis; there were 3 levels on the X axis, 2 levels on the Y axis, and 3 levels on the Z axis) on muscle activity and ratings of perceived exertion in nursing cart pushing and pulling tasks. Ten participants who were female students and not experienced nurses were recruited to participate in the experiment. Each participant performed 108 experimental trials in the study, consisting of 2 directions of exertion (push and pull), 3 paths, and 18 load placements (indicated by X, Y and Z axes). A 23kg load was placed into one load placement. The dependent variables were electromyographic (EMG) data of four muscles collected bilaterally as follows: Left (L) and right (R) trapezius (TR), flexor digitorum superficialis (FDS), extensor digitorum (ED), and erector spinae (ES) and subjective ratings of perceived exertion (RPE). Split-split-plot ANOVA was conducted to analyze significant differences between DOE, path, and LP in the EMG and RPE data. Pulling cart tasks produced a significantly higher activation of the muscles (RTR:54.4%, LTR:50.3%, LFDS:57.0%, LED:63.4%, RES:40.7%, LES:36.7%) than pushing cart tasks (RTR:42.4%, LTR:35.1%, LFDS:32.3%, LED:55.1%, RES:33.3%, LES:32.1%). A significantly greater perceived exertion was found in pulling cart tasks than pushing cart tasks. Significantly higher activation of all muscles and perceived exertion were observed for walking uphill than walking in a straight line and turning left. Significantly lower muscle activity of all muscles and subject ratings were observed for the central position on the X axis, the bottom position on the Y axis, and the posterior position on the Z axis. These findings suggest that nursing staff should adopt forward pushing when moving a nursing cart, instead of backward pulling, and that uphill paths should be avoided in the design of work environments. In terms of distribution of the load in a nursing cart, heavier materials should be positioned at bottom of the cabinet, centered on the horizontal plane and close to the handle, to reduce the physical load of the nursing staff.

The Effects of Direction of Exertion, Path, and Load Placement in Nursing Cart Pushing and Pulling Tasks: An Electromyographical Study

PubMed Central

Kao, Huei Chu; Lin, Chiuhsiang Joe; Lee, Yung Hui; Chen, Su Huang

2015-01-01

The purpose of this study was to explore the effects of direction of exertion (DOE) (pushing, pulling), path (walking in a straight line, turning left, walking uphill), and load placement (LP) (the 18 blocks were indicated by X, Y and Z axis; there were 3 levels on the X axis, 2 levels on the Y axis, and 3 levels on the Z axis) on muscle activity and ratings of perceived exertion in nursing cart pushing and pulling tasks. Ten participants who were female students and not experienced nurses were recruited to participate in the experiment. Each participant performed 108 experimental trials in the study, consisting of 2 directions of exertion (push and pull), 3 paths, and 18 load placements (indicated by X, Y and Z axes). A 23kg load was placed into one load placement. The dependent variables were electromyographic (EMG) data of four muscles collected bilaterally as follows: Left (L) and right (R) trapezius (TR), flexor digitorum superficialis (FDS), extensor digitorum (ED), and erector spinae (ES) and subjective ratings of perceived exertion (RPE). Split-split-plot ANOVA was conducted to analyze significant differences between DOE, path, and LP in the EMG and RPE data. Pulling cart tasks produced a significantly higher activation of the muscles (RTR:54.4%, LTR:50.3%, LFDS:57.0%, LED:63.4%, RES:40.7%, LES:36.7%) than pushing cart tasks (RTR:42.4%, LTR:35.1%, LFDS:32.3%, LED:55.1%, RES:33.3%, LES:32.1%). A significantly greater perceived exertion was found in pulling cart tasks than pushing cart tasks. Significantly higher activation of all muscles and perceived exertion were observed for walking uphill than walking in a straight line and turning left. Significantly lower muscle activity of all muscles and subject ratings were observed for the central position on the X axis, the bottom position on the Y axis, and the posterior position on the Z axis. These findings suggest that nursing staff should adopt forward pushing when moving a nursing cart, instead of backward pulling, and that uphill paths should be avoided in the design of work environments. In terms of distribution of the load in a nursing cart, heavier materials should be positioned at bottom of the cabinet, centered on the horizontal plane and close to the handle, to reduce the physical load of the nursing staff. PMID:26485039

On computing the global time-optimal motions of robotic manipulators in the presence of obstacles

NASA Technical Reports Server (NTRS)

Shiller, Zvi; Dubowsky, Steven

1991-01-01

A method for computing the time-optimal motions of robotic manipulators is presented that considers the nonlinear manipulator dynamics, actuator constraints, joint limits, and obstacles. The optimization problem is reduced to a search for the time-optimal path in the n-dimensional position space. A small set of near-optimal paths is first efficiently selected from a grid, using a branch and bound search and a series of lower bound estimates on the traveling time along a given path. These paths are further optimized with a local path optimization to yield the global optimal solution. Obstacles are considered by eliminating the collision points from the tessellated space and by adding a penalty function to the motion time in the local optimization. The computational efficiency of the method stems from the reduced dimensionality of the searched spaced and from combining the grid search with a local optimization. The method is demonstrated in several examples for two- and six-degree-of-freedom manipulators with obstacles.

Unsteady flow sensing and optimal sensor placement using machine learning

NASA Astrophysics Data System (ADS)

Semaan, Richard

2016-11-01

Machine learning is used to estimate the flow state and to determine the optimal sensor placement over a two-dimensional (2D) airfoil equipped with a Coanda actuator. The analysis is based on flow field data obtained from 2D unsteady Reynolds averaged Navier-Stokes (uRANS) simulations with different jet blowing intensities and actuation frequencies, characterizing different flow separation states. This study shows how the "random forests" algorithm is utilized beyond its typical usage in fluid mechanics estimating the flow state to determine the optimal sensor placement. The results are compared against the current de-facto standard of maximum modal amplitude location and against a brute force approach that scans all possible sensor combinations. The results show that it is possible to simultaneously infer the state of flow and to determine the optimal sensor location without the need to perform proper orthogonal decomposition. Collaborative Research Center (CRC) 880, DFG.

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.

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

Scalable Heuristics for Planning, Placement and Sizing of Flexible AC Transmission System Devices

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

Frolov, Vladmir; Backhaus, Scott N.; Chertkov, Michael

Aiming to relieve transmission grid congestion and improve or extend feasibility domain of the operations, we build optimization heuristics, generalizing standard AC Optimal Power Flow (OPF), for placement and sizing of Flexible Alternating Current Transmission System (FACTS) devices of the Series Compensation (SC) and Static VAR Compensation (SVC) type. One use of these devices is in resolving the case when the AC OPF solution does not exist because of congestion. Another application is developing a long-term investment strategy for placement and sizing of the SC and SVC devices to reduce operational cost and improve power system operation. SC and SVCmore » devices are represented by modification of the transmission line inductances and reactive power nodal corrections respectively. We find one placement and sizing of FACTs devices for multiple scenarios and optimal settings for each scenario simultaneously. Our solution of the nonlinear and nonconvex generalized AC-OPF consists of building a convergent sequence of convex optimizations containing only linear constraints and shows good computational scaling to larger systems. The approach is illustrated on single- and multi-scenario examples of the Matpower case-30 model.« less

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.

JPL-ANTOPT antenna structure optimization program

NASA Technical Reports Server (NTRS)

Strain, D. M.

1994-01-01

New antenna path-length error and pointing-error structure optimization codes were recently added to the MSC/NASTRAN structural analysis computer program. Path-length and pointing errors are important measured of structure-related antenna performance. The path-length and pointing errors are treated as scalar displacements for statics loading cases. These scalar displacements can be subject to constraint during the optimization process. Path-length and pointing-error calculations supplement the other optimization and sensitivity capabilities of NASTRAN. The analysis and design functions were implemented as 'DMAP ALTERs' to the Design Optimization (SOL 200) Solution Sequence of MSC-NASTRAN, Version 67.5.

Genetic evolutionary taboo search for optimal marker placement in infrared patient setup

NASA Astrophysics Data System (ADS)

Riboldi, M.; Baroni, G.; Spadea, M. F.; Tagaste, B.; Garibaldi, C.; Cambria, R.; Orecchia, R.; Pedotti, A.

2007-09-01

In infrared patient setup adequate selection of the external fiducial configuration is required for compensating inner target displacements (target registration error, TRE). Genetic algorithms (GA) and taboo search (TS) were applied in a newly designed approach to optimal marker placement: the genetic evolutionary taboo search (GETS) algorithm. In the GETS paradigm, multiple solutions are simultaneously tested in a stochastic evolutionary scheme, where taboo-based decision making and adaptive memory guide the optimization process. The GETS algorithm was tested on a group of ten prostate patients, to be compared to standard optimization and to randomly selected configurations. The changes in the optimal marker configuration, when TRE is minimized for OARs, were specifically examined. Optimal GETS configurations ensured a 26.5% mean decrease in the TRE value, versus 19.4% for conventional quasi-Newton optimization. Common features in GETS marker configurations were highlighted in the dataset of ten patients, even when multiple runs of the stochastic algorithm were performed. Including OARs in TRE minimization did not considerably affect the spatial distribution of GETS marker configurations. In conclusion, the GETS algorithm proved to be highly effective in solving the optimal marker placement problem. Further work is needed to embed site-specific deformation models in the optimization process.

Three-Dimensional Path Planning for Uninhabited Combat Aerial Vehicle Based on Predator-Prey Pigeon-Inspired Optimization in Dynamic Environment.

PubMed

Zhang, Bo; Duan, Haibin

2017-01-01

Three-dimension path planning of uninhabited combat aerial vehicle (UCAV) is a complicated optimal problem, which mainly focused on optimizing the flight route considering the different types of constrains under complex combating environment. A novel predator-prey pigeon-inspired optimization (PPPIO) is proposed to solve the UCAV three-dimension path planning problem in dynamic environment. Pigeon-inspired optimization (PIO) is a new bio-inspired optimization algorithm. In this algorithm, map and compass operator model and landmark operator model are used to search the best result of a function. The prey-predator concept is adopted to improve global best properties and enhance the convergence speed. The characteristics of the optimal path are presented in the form of a cost function. The comparative simulation results show that our proposed PPPIO algorithm is more efficient than the basic PIO, particle swarm optimization (PSO), and different evolution (DE) in solving UCAV three-dimensional path planning problems.

From the physics of interacting polymers to optimizing routes on the London Underground

PubMed Central

Yeung, Chi Ho; Saad, David; Wong, K. Y. Michael

2013-01-01

Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously. We demonstrate the efficacy of the algorithm by applying it to: (i) random graphs resembling Internet overlay networks, (ii) travel on the London Underground network based on Oyster card data, and (iii) the global airport network. Analytically derived macroscopic properties give rise to insightful new routing phenomena, including phase transitions and scaling laws, that facilitate better understanding of the appropriate operational regimes and their limitations, which are difficult to obtain otherwise. PMID:23898198

From the physics of interacting polymers to optimizing routes on the London Underground.

PubMed

Yeung, Chi Ho; Saad, David; Wong, K Y Michael

2013-08-20

Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously. We demonstrate the efficacy of the algorithm by applying it to: (i) random graphs resembling Internet overlay networks, (ii) travel on the London Underground network based on Oyster card data, and (iii) the global airport network. Analytically derived macroscopic properties give rise to insightful new routing phenomena, including phase transitions and scaling laws, that facilitate better understanding of the appropriate operational regimes and their limitations, which are difficult to obtain otherwise.

Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks

PubMed Central

Robinson, Y. Harold; Rajaram, M.

2015-01-01

Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique. PMID:26819966

Elevator Sizing, Placement, and Control-Relevant Tradeoffs for Hypersonic Vehicles

NASA Technical Reports Server (NTRS)

Dickeson, Jeffrey J.; Rodriguez, Armando A.; Sridharan, Srikanth; Korad, Akshay

2010-01-01

Within this paper, control-relevant vehicle design concepts are examined using a widely used 3 DOF (plus flexibility) nonlinear model for the longitudinal dynamics of a generic carrot-shaped scramjet powered hypersonic vehicle. The impact of elevator size and placement on control-relevant static properties (e.g. level-flight trimmable region, trim controls, Angle of Attack (AOA), thrust margin) and dynamic properties (e.g. instability and right half plane zero associated with flight path angle) are examined. Elevator usage has been examine for a class of typical hypersonic trajectories.

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

The effect of code expanding optimizations on instruction cache design

NASA Technical Reports Server (NTRS)

Chen, William Y.; Chang, Pohua P.; Conte, Thomas M.; Hwu, Wen-Mei W.

1991-01-01

It is shown that code expanding optimizations have strong and non-intuitive implications on instruction cache design. Three types of code expanding optimizations are studied: instruction placement, function inline expansion, and superscalar optimizations. Overall, instruction placement reduces the miss ratio of small caches. Function inline expansion improves the performance for small cache sizes, but degrades the performance of medium caches. Superscalar optimizations increases the cache size required for a given miss ratio. On the other hand, they also increase the sequentiality of instruction access so that a simple load-forward scheme effectively cancels the negative effects. Overall, it is shown that with load forwarding, the three types of code expanding optimizations jointly improve the performance of small caches and have little effect on large caches.

Effect of a limited-enforcement intelligent tutoring system in dermatopathology on student errors, goals and solution paths.

PubMed

Payne, Velma L; Medvedeva, Olga; Legowski, Elizabeth; Castine, Melissa; Tseytlin, Eugene; Jukic, Drazen; Crowley, Rebecca S

2009-11-01

Determine effects of a limited-enforcement intelligent tutoring system in dermatopathology on student errors, goals and solution paths. Determine if limited enforcement in a medical tutoring system inhibits students from learning the optimal and most efficient solution path. Describe the type of deviations from the optimal solution path that occur during tutoring, and how these deviations change over time. Determine if the size of the problem-space (domain scope), has an effect on learning gains when using a tutor with limited enforcement. Analyzed data mined from 44 pathology residents using SlideTutor-a Medical Intelligent Tutoring System in Dermatopathology that teaches histopathologic diagnosis and reporting skills based on commonly used diagnostic algorithms. Two subdomains were included in the study representing sub-algorithms of different sizes and complexities. Effects of the tutoring system on student errors, goal states and solution paths were determined. Students gradually increase the frequency of steps that match the tutoring system's expectation of expert performance. Frequency of errors gradually declines in all categories of error significance. Student performance frequently differs from the tutor-defined optimal path. However, as students continue to be tutored, they approach the optimal solution path. Performance in both subdomains was similar for both errors and goal differences. However, the rate at which students progress toward the optimal solution path differs between the two domains. Tutoring in superficial perivascular dermatitis, the larger and more complex domain was associated with a slower rate of approximation towards the optimal solution path. Students benefit from a limited-enforcement tutoring system that leverages diagnostic algorithms but does not prevent alternative strategies. Even with limited enforcement, students converge toward the optimal solution path.

Optimized scalar promotion with load and splat SIMD instructions

DOEpatents

Eichenberger, Alexander E; Gschwind, Michael K; Gunnels, John A

2013-10-29

Mechanisms for optimizing scalar code executed on a single instruction multiple data (SIMD) engine are provided. Placement of vector operation-splat operations may be determined based on an identification of scalar and SIMD operations in an original code representation. The original code representation may be modified to insert the vector operation-splat operations based on the determined placement of vector operation-splat operations to generate a first modified code representation. Placement of separate splat operations may be determined based on identification of scalar and SIMD operations in the first modified code representation. The first modified code representation may be modified to insert or delete separate splat operations based on the determined placement of the separate splat operations to generate a second modified code representation. SIMD code may be output based on the second modified code representation for execution by the SIMD engine.

Optimized scalar promotion with load and splat SIMD instructions

DOEpatents

Eichenberger, Alexandre E [Chappaqua, NY; Gschwind, Michael K [Chappaqua, NY; Gunnels, John A [Yorktown Heights, NY

2012-08-28

Mechanisms for optimizing scalar code executed on a single instruction multiple data (SIMD) engine are provided. Placement of vector operation-splat operations may be determined based on an identification of scalar and SIMD operations in an original code representation. The original code representation may be modified to insert the vector operation-splat operations based on the determined placement of vector operation-splat operations to generate a first modified code representation. Placement of separate splat operations may be determined based on identification of scalar and SIMD operations in the first modified code representation. The first modified code representation may be modified to insert or delete separate splat operations based on the determined placement of the separate splat operations to generate a second modified code representation. SIMD code may be output based on the second modified code representation for execution by the SIMD engine.

Patient-specific port placement for laparoscopic surgery using atlas-based registration

NASA Astrophysics Data System (ADS)

Enquobahrie, Andinet; Shivaprabhu, Vikas; Aylward, Stephen; Finet, Julien; Cleary, Kevin; Alterovitz, Ron

2013-03-01

Laparoscopic surgery is a minimally invasive surgical approach, in which abdominal surgical procedures are performed through trocars via small incisions. Patients benefit by reduced postoperative pain, shortened hospital stays, improved cosmetic results, and faster recovery times. Optimal port placement can improve surgeon dexterity and avoid the need to move the trocars, which would cause unnecessary trauma to the patient. We are building an intuitive open source visualization system to help surgeons identify ports. Our methodology is based on an intuitive port placement visualization module and atlas-based registration algorithm to transfer port locations to individual patients. The methodology follows three steps:1) Use a port placement visualization module to manually place ports in an abdominal organ atlas. This step generates port-augmented abdominal atlas. This is done only once for a given patient population. 2) Register the atlas data with the patient CT data, to transfer the prescribed ports to the individual patient 3) Review and adjust the transferred port locations using the port placement visualization module. Tool maneuverability and target reachability can be tested using the visualization system. Our methodology would decrease the amount of physician input necessary to optimize port placement for each patient case. In a follow up work, we plan to use the transferred ports as starting point for further optimization of the port locations by formulating a cost function that will take into account factors such as tool dexterity and likelihood of collision between instruments.

An improved multi-paths optimization method for video stabilization

NASA Astrophysics Data System (ADS)

Qin, Tao; Zhong, Sheng

2018-03-01

For video stabilization, the difference between original camera motion path and the optimized one is proportional to the cropping ratio and warping ratio. A good optimized path should preserve the moving tendency of the original one meanwhile the cropping ratio and warping ratio of each frame should be kept in a proper range. In this paper we use an improved warping-based motion representation model, and propose a gauss-based multi-paths optimization method to get a smoothing path and obtain a stabilized video. The proposed video stabilization method consists of two parts: camera motion path estimation and path smoothing. We estimate the perspective transform of adjacent frames according to warping-based motion representation model. It works well on some challenging videos where most previous 2D methods or 3D methods fail for lacking of long features trajectories. The multi-paths optimization method can deal well with parallax, as we calculate the space-time correlation of the adjacent grid, and then a kernel of gauss is used to weigh the motion of adjacent grid. Then the multi-paths are smoothed while minimize the crop ratio and the distortion. We test our method on a large variety of consumer videos, which have casual jitter and parallax, and achieve good results.

Method for measuring target rotation angle by theodolites

NASA Astrophysics Data System (ADS)

Sun, Zelin; Wang, Zhao; Zhai, Huanchun; Yang, Xiaoxu

2013-05-01

To overcome the disadvantage of the current measurement methods using theodolites in an environment with shock and long working hours and so on, this paper proposes a new method for 3D coordinate measurement that is based on an immovable measuring coordinate system. According to the measuring principle, the mathematics model is established and the measurement uncertainty is analysed. The measurement uncertainty of the new method is a function of the theodolite observation angles and their uncertainty, and can be reduced by optimizing the theodolites’ placement. Compared to other methods, this method allows the theodolite positions to be changed in the measuring process, and mutual collimation between the theodolites is not required. The experimental results show that the measurement model and the optimal placement principle are correct, and the measurement error is less than 0.01° after optimizing the theodolites’ placement.

Optimal placement of water-lubricated rubber bearings for vibration reduction of flexible multistage rotor systems

NASA Astrophysics Data System (ADS)

Liu, Shibing; Yang, Bingen

2017-10-01

Flexible multistage rotor systems with water-lubricated rubber bearings (WLRBs) have a variety of engineering applications. Filling a technical gap in the literature, this effort proposes a method of optimal bearing placement that minimizes the vibration amplitude of a WLRB-supported flexible rotor system with a minimum number of bearings. In the development, a new model of WLRBs and a distributed transfer function formulation are used to define a mixed continuous-and-discrete optimization problem. To deal with the case of uncertain number of WLRBs in rotor design, a virtual bearing method is devised. Solution of the optimization problem by a real-coded genetic algorithm yields the locations and lengths of water-lubricated rubber bearings, by which the prescribed operational requirements for the rotor system are satisfied. The proposed method is applicable either to preliminary design of a new rotor system with the number of bearings unforeknown or to redesign of an existing rotor system with a given number of bearings. Numerical examples show that the proposed optimal bearing placement is efficient, accurate and versatile in different design cases.

Minimal invasive epicardial lead implantation: optimizing cardiac resynchronization with a new mapping device for epicardial lead placement.

PubMed

Maessen, J G; Phelps, B; Dekker, A L A J; Dijkman, B

2004-05-01

To optimize resynchronization in biventricular pacing with epicardial leads, mapping to determine the best pacing site, is a prerequisite. A port access surgical mapping technique was developed that allowed multiple pace site selection and reproducible lead evaluation and implantation. Pressure-volume loops analysis was used for real time guidance in targeting epicardial lead placement. Even the smallest changes in lead position revealed significantly different functional results. Optimizing the pacing site with this technique allowed functional improvement up to 40% versus random pace site selection.

Optimal placement of excitations and sensors for verification of large dynamical systems

NASA Technical Reports Server (NTRS)

Salama, M.; Rose, T.; Garba, J.

1987-01-01

The computationally difficult problem of the optimal placement of excitations and sensors to maximize the observed measurements is studied within the framework of combinatorial optimization, and is solved numerically using a variation of the simulated annealing heuristic algorithm. Results of numerical experiments including a square plate and a 960 degrees-of-freedom Control of Flexible Structure (COFS) truss structure, are presented. Though the algorithm produces suboptimal solutions, its generality and simplicity allow the treatment of complex dynamical systems which would otherwise be difficult to handle.

Research on cutting path optimization of sheet metal parts based on ant colony algorithm

NASA Astrophysics Data System (ADS)

Wu, Z. Y.; Ling, H.; Li, L.; Wu, L. H.; Liu, N. B.

2017-09-01

In view of the disadvantages of the current cutting path optimization methods of sheet metal parts, a new method based on ant colony algorithm was proposed in this paper. The cutting path optimization problem of sheet metal parts was taken as the research object. The essence and optimization goal of the optimization problem were presented. The traditional serial cutting constraint rule was improved. The cutting constraint rule with cross cutting was proposed. The contour lines of parts were discretized and the mathematical model of cutting path optimization was established. Thus the problem was converted into the selection problem of contour lines of parts. Ant colony algorithm was used to solve the problem. The principle and steps of the algorithm were analyzed.

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

Reister, D.B.

This paper uses the Pontryagin maximum principle to find time optimal paths for a constant speed unicycle. The time optimal paths consist of sequences of arcs of circles and straight lines. The maximum principle introduced concepts (dual variables, bang-bang solutions, singular solutions, and transversality conditions) that provide important insight into the nature of the time optimal paths. 10 refs., 6 figs.

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.

Research on NC laser combined cutting optimization model of sheet metal parts

NASA Astrophysics Data System (ADS)

Wu, Z. Y.; Zhang, Y. L.; Li, L.; Wu, L. H.; Liu, N. B.

2017-09-01

The optimization problem for NC laser combined cutting of sheet metal parts was taken as the research object in this paper. The problem included two contents: combined packing optimization and combined cutting path optimization. In the problem of combined packing optimization, the method of “genetic algorithm + gravity center NFP + geometric transformation” was used to optimize the packing of sheet metal parts. In the problem of combined cutting path optimization, the mathematical model of cutting path optimization was established based on the parts cutting constraint rules of internal contour priority and cross cutting. The model played an important role in the optimization calculation of NC laser combined cutting.

Tracking with a Cooperatively Controlled Swarm of GMTI Equipped UAVS

DTIC Science & Technology

2008-12-02

with Ground Optimal Placement of GMTI UAVs for ground target tracking Abhijit Sinha°, Thia. Kirubarajana and Yaakov Bar-Shalom6 " Electrical and...Storrs, CT 06269, USA Abstract—With the recent advent of moderate-cost unmanned (or uninhabited) aerial vehicles (UAV) and their success in...the sensor platforms are mobile one has to decide the optimal placement of sensors. With the recent advent of af- fordable unmanned aerial vehicles

Stochastic DG Placement for Conservation Voltage Reduction Based on Multiple Replications Procedure

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

Wang, Zhaoyu; Chen, Bokan; Wang, Jianhui

2015-06-01

Conservation voltage reduction (CVR) and distributed-generation (DG) integration are popular strategies implemented by utilities to improve energy efficiency. This paper investigates the interactions between CVR and DG placement to minimize load consumption in distribution networks, while keeping the lowest voltage level within the predefined range. The optimal placement of DG units is formulated as a stochastic optimization problem considering the uncertainty of DG outputs and load consumptions. A sample average approximation algorithm-based technique is developed to solve the formulated problem effectively. A multiple replications procedure is developed to test the stability of the solution and calculate the confidence interval ofmore » the gap between the candidate solution and optimal solution. The proposed method has been applied to the IEEE 37-bus distribution test system with different scenarios. The numerical results indicate that the implementations of CVR and DG, if combined, can achieve significant energy savings.« less

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.

The Effect of Tow Shearing on Reinforcement Positional Fidelity in the Manufacture of a Continuous Fiber Reinforced Thermoplastic Matrix Composite via Pultrusion-Like Processing of Commingled Feedstock

NASA Astrophysics Data System (ADS)

Warlick, Kent M.

While the addition of short fiber to 3D printed articles has increased structural performance, ultimate gains will only be realized through the introduction of continuous reinforcement placed along pre-planned load paths. Most additive manufacturing research focusing on the addition of continuous reinforcement has revolved around utilization of a prefrabricated composite filament or a fiber and matrix mixed within a hot end prior to deposition on a printing surface such that conventional extrusion based FDM can be applied. Although stronger 3D printed parts can be made in this manner, high quality homogenous composites are not possible due to fiber dominated regions, matrix dominated regions, and voids present between adjacent filaments. Conventional composite manufacturing processes are much better at creating homogeneous composites; however, the layer by layer approach in which they are made is inhibiting the alignment of reinforcement with loads. Automated Fiber Placement techniques utilize in plane bending deformation of the tow to facilitate tow steering. Due to buckling fibers on the inner radius of curves, manufacturers recommend a minimum curvature for path placement with this technique. A method called continuous tow shearing has shown promise to enable the placement of tows in complex patterns without tow buckling, spreading, and separation inherent in conventional forms of automated reinforcement positioning. The current work employs fused deposition modeling hardware and the continuous tow shearing technique to manufacture high quality fiber reinforced composites with high positional fidelity, varying continuous reinforcement orientations within a layer, and plastic elements incorporated enabling the ultimate gains in structural performance possible. A mechanical system combining concepts of additive manufacturing with fiber placement via filament winding was developed. Paths with and without tension inherent in filament winding were analyzed through microscopy in order to examine best and worst case scenarios. High quality fiber reinforced composite materials, in terms of low void content, high fiber volume fractions and homogeneity in microstructure, were manufactured in both of these scenarios. In order to improve fidelity and quality in fiber path transition regions, a forced air cooling manifold was designed, printed, and implemented into the current system. To better understand the composite performance that results from varying pertinent manufacturing parameters, the effect of feed rate, hot end temperature, forced air cooling, and deposition surface (polypropylene and previously deposited glass polypropylene commingled tow) on interply performance, microstructure, and positional fidelity were analyzed. Interply performance, in terms of average maximum load and average peel strength, was quantified through a t-peel test of the bonding quality between two surfaces. With use of forced air cooling, minor decreases in average peel strength were present due to a reduction in tow deposition temperature which was found to be the variable most indicative of performance. Average maximum load was comparable between the forced air cooled and non-air cooled samples. Microstructure was evaluated through characterization of composite area, void content, and flash percentage. Low void contents mostly between five to seven percent were attained. Further reduction of this void content to two percent is possible through higher processing temperatures; however, reduced composite area, low average peel strength performance, and the presence of smoke during manufacturing implied thermal degradation of the polypropylene matrix occurred in these samples with higher processing temperatures. Positional fidelity was measured through calculations of shear angle, shift width, and error of a predefined path. While positional fidelity variation was low with a polypropylene deposition surface, forced air cooling is necessary to achieve fidelity on top of an already deposited tow surface as evident by the fifty-six percent reduction in error tolerance profile achieved. Lastly, proof of concept articles with unique fiber paths and neat plastic elements incorporated were produced to demonstrate fiber placement along pre-planned load paths and the ability to achieve greater structural efficiency through the use of less material. The results show that high positional fidelity and high quality composites can be produced through the use of the tow shearing technique implemented in the developed mechanical system. The implementation of forced air cooling was critical in achieving fidelity and quality in transition regions. Alignment of continuous reinforcement with pre-planned load paths was demonstrated in the proof of concept article with varying fiber orientations within a layer. Combining fused deposition modeling of plastic with the placement of continuous reinforcement enabled a honeycomb composite to be produced with higher specific properties than traditional composites. Thus, the current system demonstrated a greater capability of achieving ultimate gains in structural performance than previously possible.

Surface Navigation Using Optimized Waypoints and Particle Swarm Optimization

NASA Technical Reports Server (NTRS)

Birge, Brian

2013-01-01

The design priority for manned space exploration missions is almost always placed on human safety. Proposed manned surface exploration tasks (lunar, asteroid sample returns, Mars) have the possibility of astronauts traveling several kilometers away from a home base. Deviations from preplanned paths are expected while exploring. In a time-critical emergency situation, there is a need to develop an optimal home base return path. The return path may or may not be similar to the outbound path, and what defines optimal may change with, and even within, each mission. A novel path planning algorithm and prototype program was developed using biologically inspired particle swarm optimization (PSO) that generates an optimal path of traversal while avoiding obstacles. Applications include emergency path planning on lunar, Martian, and/or asteroid surfaces, generating multiple scenarios for outbound missions, Earth-based search and rescue, as well as human manual traversal and/or path integration into robotic control systems. The strategy allows for a changing environment, and can be re-tasked at will and run in real-time situations. Given a random extraterrestrial planetary or small body surface position, the goal was to find the fastest (or shortest) path to an arbitrary position such as a safe zone or geographic objective, subject to possibly varying constraints. The problem requires a workable solution 100% of the time, though it does not require the absolute theoretical optimum. Obstacles should be avoided, but if they cannot be, then the algorithm needs to be smart enough to recognize this and deal with it. With some modifications, it works with non-stationary error topologies as well.

Funnel for localizing biological cell placement and arrangement

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

Soscia, David; Benett, William J.; Mukerjee, Erik V.

2018-03-06

The present disclosure relates to a funnel apparatus for channeling cells onto a plurality of distinct, closely spaced regions of a seeding surface. The funnel apparatus has a body portion having an upper surface and a lower surface. The body portion forms a plurality of flow paths, at least one of which is shaped to have a decreasing cross-sectional area from the upper surface to the lower surface. The flow paths are formed at the lower surface to enable cells deposited into the flow paths at the upper surface of the funnel apparatus to be channeled into a plurality ofmore » distinct, closely spaced regions on the seeding surface positioned adjacent the lower surface.« less

Multi-type sensor placement and response reconstruction for building structures: Experimental investigations

NASA Astrophysics Data System (ADS)

Hu, Rong-Pan; Xu, You-Lin; Zhan, Sheng

2018-01-01

Estimation of lateral displacement and acceleration responses is essential to assess safety and serviceability of high-rise buildings under dynamic loadings including earthquake excitations. However, the measurement information from the limited number of sensors installed in a building structure is often insufficient for the complete structural performance assessment. An integrated multi-type sensor placement and response reconstruction method has thus been proposed by the authors to tackle this problem. To validate the feasibility and effectiveness of the proposed method, an experimental investigation using a cantilever beam with multi-type sensors is performed and reported in this paper. The experimental setup is first introduced. The finite element modelling and model updating of the cantilever beam are then performed. The optimal sensor placement for the best response reconstruction is determined by the proposed method based on the updated FE model of the beam. After the sensors are installed on the physical cantilever beam, a number of experiments are carried out. The responses at key locations are reconstructed and compared with the measured ones. The reconstructed responses achieve a good match with the measured ones, manifesting the feasibility and effectiveness of the proposed method. Besides, the proposed method is also examined for the cases of different excitations and unknown excitation, and the results prove the proposed method to be robust and effective. The superiority of the optimized sensor placement scheme is finally demonstrated through comparison with two other different sensor placement schemes: the accelerometer-only scheme and non-optimal sensor placement scheme. The proposed method can be applied to high-rise buildings for seismic performance assessment.

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.

A global stochastic programming approach for the optimal placement of gas detectors with nonuniform unavailabilities

DOE PAGES

Liu, Jianfeng; Laird, Carl Damon

2017-09-22

Optimal design of a gas detection systems is challenging because of the numerous sources of uncertainty, including weather and environmental conditions, leak location and characteristics, and process conditions. Rigorous CFD simulations of dispersion scenarios combined with stochastic programming techniques have been successfully applied to the problem of optimal gas detector placement; however, rigorous treatment of sensor failure and nonuniform unavailability has received less attention. To improve reliability of the design, this paper proposes a problem formulation that explicitly considers nonuniform unavailabilities and all backup detection levels. The resulting sensor placement problem is a large-scale mixed-integer nonlinear programming (MINLP) problem thatmore » requires a tailored solution approach for efficient solution. We have developed a multitree method which depends on iteratively solving a sequence of upper-bounding master problems and lower-bounding subproblems. The tailored global solution strategy is tested on a real data problem and the encouraging numerical results indicate that our solution framework is promising in solving sensor placement problems. This study was selected for the special issue in JLPPI from the 2016 International Symposium of the MKO Process Safety Center.« less

A global stochastic programming approach for the optimal placement of gas detectors with nonuniform unavailabilities

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

Liu, Jianfeng; Laird, Carl Damon

Optimal design of a gas detection systems is challenging because of the numerous sources of uncertainty, including weather and environmental conditions, leak location and characteristics, and process conditions. Rigorous CFD simulations of dispersion scenarios combined with stochastic programming techniques have been successfully applied to the problem of optimal gas detector placement; however, rigorous treatment of sensor failure and nonuniform unavailability has received less attention. To improve reliability of the design, this paper proposes a problem formulation that explicitly considers nonuniform unavailabilities and all backup detection levels. The resulting sensor placement problem is a large-scale mixed-integer nonlinear programming (MINLP) problem thatmore » requires a tailored solution approach for efficient solution. We have developed a multitree method which depends on iteratively solving a sequence of upper-bounding master problems and lower-bounding subproblems. The tailored global solution strategy is tested on a real data problem and the encouraging numerical results indicate that our solution framework is promising in solving sensor placement problems. This study was selected for the special issue in JLPPI from the 2016 International Symposium of the MKO Process Safety Center.« less

PI controller design of a wind turbine: evaluation of the pole-placement method and tuning using constrained optimization

NASA Astrophysics Data System (ADS)

Mirzaei, Mahmood; Tibaldi, Carlo; Hansen, Morten H.

2016-09-01

PI/PID controllers are the most common wind turbine controllers. Normally a first tuning is obtained using methods such as pole-placement or Ziegler-Nichols and then extensive aeroelastic simulations are used to obtain the best tuning in terms of regulation of the outputs and reduction of the loads. In the traditional tuning approaches, the properties of different open loop and closed loop transfer functions of the system are not normally considered. In this paper, an assessment of the pole-placement tuning method is presented based on robustness measures. Then a constrained optimization setup is suggested to automatically tune the wind turbine controller subject to robustness constraints. The properties of the system such as the maximum sensitivity and complementary sensitivity functions (Ms and Mt ), along with some of the responses of the system, are used to investigate the controller performance and formulate the optimization problem. The cost function is the integral absolute error (IAE) of the rotational speed from a disturbance modeled as a step in wind speed. Linearized model of the DTU 10-MW reference wind turbine is obtained using HAWCStab2. Thereafter, the model is reduced with model order reduction. The trade-off curves are given to assess the tunings of the poles- placement method and a constrained optimization problem is solved to find the best tuning.

AN EVALUATION AND COST-OPTIMIZATION TOOL FOR PLACEMENT OF BMPS

EPA Science Inventory

To assist stormwater management professionals in planning for best management practices (BMPs) implementation, the U.S. Environmental Protection Agency (USEPA) is developing a decision-support system for placement of BMPs at strategic locations in urban watersheds. This tool wil...

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

An engineering optimization method with application to STOL-aircraft approach and landing trajectories

NASA Technical Reports Server (NTRS)

Jacob, H. G.

1972-01-01

An optimization method has been developed that computes the optimal open loop inputs for a dynamical system by observing only its output. The method reduces to static optimization by expressing the inputs as series of functions with parameters to be optimized. Since the method is not concerned with the details of the dynamical system to be optimized, it works for both linear and nonlinear systems. The method and the application to optimizing longitudinal landing paths for a STOL aircraft with an augmented wing are discussed. Noise, fuel, time, and path deviation minimizations are considered with and without angle of attack, acceleration excursion, flight path, endpoint, and other constraints.

Planning minimum-energy paths in an off-road environment with anisotropic traversal costs and motion constraints. Doctoral thesis

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

Ross, R.S.

1989-06-01

For a vehicle operating across arbitrarily-contoured terrain, finding the most fuel-efficient route between two points can be viewed as a high-level global path-planning problem with traversal costs and stability dependent on the direction of travel (anisotropic). The problem assumes a two-dimensional polygonal map of homogeneous cost regions for terrain representation constructed from elevation information. The anisotropic energy cost of vehicle motion has a non-braking component dependent on horizontal distance, a braking component dependent on vertical distance, and a constant path-independent component. The behavior of minimum-energy paths is then proved to be restricted to a small, but optimal set of traversalmore » types. An optimal-path-planning algorithm, using a heuristic search technique, reduces the infinite number of paths between the start and goal points to a finite number by generating sequences of goal-feasible window lists from analyzing the polygonal map and applying pruning criteria. The pruning criteria consist of visibility analysis, heading analysis, and region-boundary constraints. Each goal-feasible window lists specifies an associated convex optimization problem, and the best of all locally-optimal paths through the goal-feasible window lists is the globally-optimal path. These ideas have been implemented in a computer program, with results showing considerably better performance than the exponential average-case behavior predicted.« less

Percutaneous needle placement using laser guidance: a practical solution

NASA Astrophysics Data System (ADS)

Xu, Sheng; Kapoor, Ankur; Abi-Jaoudeh, Nadine; Imbesi, Kimberly; Hong, Cheng William; Mazilu, Dumitru; Sharma, Karun; Venkatesan, Aradhana M.; Levy, Elliot; Wood, Bradford J.

2013-03-01

In interventional radiology, various navigation technologies have emerged aiming to improve the accuracy of device deployment and potentially the clinical outcomes of minimally invasive procedures. While these technologies' performance has been explored extensively, their impact on daily clinical practice remains undetermined due to the additional cost and complexity, modification of standard devices (e.g. electromagnetic tracking), and different levels of experience among physicians. Taking these factors into consideration, a robotic laser guidance system for percutaneous needle placement is developed. The laser guidance system projects a laser guide line onto the skin entry point of the patient, helping the physician to align the needle with the planned path of the preoperative CT scan. To minimize changes to the standard workflow, the robot is integrated with the CT scanner via optical tracking. As a result, no registration between the robot and CT is needed. The robot can compensate for the motion of the equipment and keep the laser guide line aligned with the biopsy path in real-time. Phantom experiments showed that the guidance system can benefit physicians at different skill levels, while clinical studies showed improved accuracy over conventional freehand needle insertion. The technology is safe, easy to use, and does not involve additional disposable costs. It is our expectation that this technology can be accepted by interventional radiologists for CT guided needle placement procedures.

Design and Analysis of Tow-Steered Composite Shells Using Fiber Placement

NASA Technical Reports Server (NTRS)

Wu, K. Chauncey

2008-01-01

In this study, a sub-scale advanced composite shell design is evaluated to determine its potential for use on a future aircraft fuselage. Two composite shells with the same nominal 8-ply [+/-45/+/-Theta](sub s) layup are evaluated, where Theta indicates a tow-steered ply. To build this shell, a fiber placement machine would be used to steer unidirectional prepreg tows as they are placed around the circumference of a 17-inch diameter right circular cylinder. The fiber orientation angle varies continuously from 10 degrees (with respect to the shell axis of revolution) at the crown, to 45 degrees on the side, and back to 10 degrees on the keel. All 24 tows are placed at each point on every fiber path in one structure designated as the shell with overlaps. The resulting pattern of tow overlaps causes the laminate thickness to vary between 8 and 16 plies. The second shell without tow overlaps uses the capability of the fiber placement machine to cut and add tows at any point along the fiber paths to fabricate a shell with a nearly uniform 8-ply laminate thickness. Issues encountered during the design and analysis of these shells are presented and discussed. Static stiffness and buckling loads of shells with tow-steered layups are compared with the performance of a baseline quasi-isotropic shell using both finite element analyses and classical strength of materials theory.

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.

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.

RESEARCH PROJECT -- PERMEABLE REACTIVE BARRIERS FOR REMEDIATION OF CONTAMINATED GROUNDWATERS(SUBSURFACE PROTECTION AND REMEDIATION DIVISION, (NRMRL)

EPA Science Inventory

Permeable reactive barrier (PRB) technology is gradually being accepted as a viable alternative to conventional groundwater remediation systems such as pump and treat. PRB technology involves the placement or formation of a reactive treatment zone in the path of a dissolved conta...

SUSTAIN -AN EVALUATION AND COST-OPTIMIZATION TOOL FOR PLACEMENT OF BMPS

EPA Science Inventory

Since 2003, the U.S. Environmental Protection Agency (USEPA) has been developing a decision support system for placement of best management practices (BMPs) to assist stormwater management professionals in planning for BMPs implementation at strategic locations in urban watershed...

CT scan based determination of optimal bone corridor for atlantoaxial ventral screw fixation in miniature breed dogs.

PubMed

Vizcaíno Revés, Núria; Stahl, Cristina; Stoffel, Michael; Bali, Monty; Forterre, Franck

2013-10-01

To describe the most reliable insertion angle, corridor length and width to place a ventral transarticular atlantoaxial screw in miniature breed dogs. Retrospective CT imaging study. Cervical CT scans of toy breed dogs (n = 21). Dogs were divided into 2 groups--group 1: no atlantoaxial abnormalities; group 2: atlantoaxial instability. Insertion angle in medial to lateral and ventral to dorsal direction was measured in group 1. Corridor length and width were measured in groups 1 and 2. Corridor width was measured at 3 points of the corridor. Each variable was measured 3 times and the mean used for statistical analysis. Mean ± SD optimal transarticular atlantoaxial insertion angle was determined to be 40 ± 1° in medial to lateral direction from the midline and 20 ± 1° in ventral to dorsal direction from the floor of the neural canal of C2. Mean corridor length was 7 mm (range, 4.5-8.0 mm). Significant correlation was found between corridor length, body weight, and age. Mean bone corridor width ranged from 3 to 5 mm. Statistically significant differences were found between individuals, gender and measured side. Optimal placement of a transarticular screw for atlantoaxial joint stabilization is very demanding because the screw path corridor is very narrow. © Copyright 2013 by The American College of Veterinary Surgeons.

Optimal actuator placement in adaptive precision trusses

NASA Technical Reports Server (NTRS)

Baycan, C. M.; Utku, S.; Das, S. K.; Wada, B. K.

1992-01-01

Actuator placement in adaptive truss structures is to cater to two needs: displacement control of precision points and preloading the elements to overcome joint slackness. Due to technological and financial considerations, the number of actuators available is much less than the degrees of freedom of precision points to be controlled and the degree of redundancy of the structure. An approach for optimal actuator location is outlined. Test cases to demonstrate the effectiveness of the scheme are applied to the Precision Segmented Reflector Truss.

Structural acoustic control of plates with variable boundary conditions: design methodology.

PubMed

Sprofera, Joseph D; Cabell, Randolph H; Gibbs, Gary P; Clark, Robert L

2007-07-01

A method for optimizing a structural acoustic control system subject to variations in plate boundary conditions is provided. The assumed modes method is used to build a plate model with varying levels of rotational boundary stiffness to simulate the dynamics of a plate with uncertain edge conditions. A transducer placement scoring process, involving Hankel singular values, is combined with a genetic optimization routine to find spatial locations robust to boundary condition variation. Predicted frequency response characteristics are examined, and theoretically optimized results are discussed in relation to the range of boundary conditions investigated. Modeled results indicate that it is possible to minimize the impact of uncertain boundary conditions in active structural acoustic control by optimizing the placement of transducers with respect to those uncertainties.

Optimal accelerometer placement on a robot arm for pose estimation

NASA Astrophysics Data System (ADS)

Wijayasinghe, Indika B.; Sanford, Joseph D.; Abubakar, Shamsudeen; Saadatzi, Mohammad Nasser; Das, Sumit K.; Popa, Dan O.

2017-05-01

The performance of robots to carry out tasks depends in part on the sensor information they can utilize. Usually, robots are fitted with angle joint encoders that are used to estimate the position and orientation (or the pose) of its end-effector. However, there are numerous situations, such as in legged locomotion, mobile manipulation, or prosthetics, where such joint sensors may not be present at every, or any joint. In this paper we study the use of inertial sensors, in particular accelerometers, placed on the robot that can be used to estimate the robot pose. Studying accelerometer placement on a robot involves many parameters that affect the performance of the intended positioning task. Parameters such as the number of accelerometers, their size, geometric placement and Signal-to-Noise Ratio (SNR) are included in our study of their effects for robot pose estimation. Due to the ubiquitous availability of inexpensive accelerometers, we investigated pose estimation gains resulting from using increasingly large numbers of sensors. Monte-Carlo simulations are performed with a two-link robot arm to obtain the expected value of an estimation error metric for different accelerometer configurations, which are then compared for optimization. Results show that, with a fixed SNR model, the pose estimation error decreases with increasing number of accelerometers, whereas for a SNR model that scales inversely to the accelerometer footprint, the pose estimation error increases with the number of accelerometers. It is also shown that the optimal placement of the accelerometers depends on the method used for pose estimation. The findings suggest that an integration-based method favors placement of accelerometers at the extremities of the robot links, whereas a kinematic-constraints-based method favors a more uniformly distributed placement along the robot links.

Transesophageal Echocardiography-Guided Epicardial Left Ventricular Lead Placement by Video-Assisted Thoracoscopic Surgery in Nonresponders to Biventricular Pacing and Previous Chest Surgery.

PubMed

Schroeder, Carsten; Chung, Jane M; Mackall, Judith A; Cakulev, Ivan T; Patel, Aaron; Patel, Sunny J; Hoit, Brian D; Sahadevan, Jayakumar

2018-06-14

The aim of the study was to study the feasibility, safety, and efficacy of transesophageal echocardiography-guided intraoperative left ventricular lead placement via a video-assisted thoracoscopic surgery approach in patients with failed conventional biventricular pacing. Twelve patients who could not have the left ventricular lead placed conventionally underwent epicardial left ventricular lead placement by video-assisted thoracoscopic surgery. Eight patients had previous chest surgery (66%). Operative positioning was a modified far lateral supine exposure with 30-degree bed tilt, allowing for groin and sternal access. To determine the optimal left ventricular location for lead placement, the left ventricular surface was divided arbitrarily into nine segments. These segments were transpericardially paced using a hand-held malleable pacing probe identifying the optimal site verified by transesophageal echocardiography. The pacing leads were screwed into position via a limited pericardiotomy. The video-assisted thoracoscopic surgery approach was successful in all patients. Biventricular pacing was achieved in all patients and all reported symptomatic benefit with reduction in New York Heart Association class from III to I-II (P = 0.016). Baseline ejection fraction was 23 ± 3%; within 1-year follow-up, the ejection fraction increased to 32 ± 10% (P = 0.05). The mean follow-up was 566 days. The median length of hospital stay was 7 days with chest tube removal between postoperative days 2 and 5. In patients who are nonresponders to conventional biventricular pacing, intraoperative left ventricular lead placement using anatomical and functional characteristics via a video-assisted thoracoscopic surgery approach is effective in improving heart failure symptoms. This optimized left ventricular lead placement is feasible and safe. Previous chest surgery is no longer an exclusion criterion for a video-assisted thoracoscopic surgery approach.

Design of optimally normal minimum gain controllers by continuation method

NASA Technical Reports Server (NTRS)

Lim, K. B.; Juang, J.-N.; Kim, Z. C.

1989-01-01

A measure of the departure from normality is investigated for system robustness. An attractive feature of the normality index is its simplicity for pole placement designs. To allow a tradeoff between system robustness and control effort, a cost function consisting of the sum of a norm of weighted gain matrix and a normality index is minimized. First- and second-order necessary conditions for the constrained optimization problem are derived and solved by a Newton-Raphson algorithm imbedded into a one-parameter family of neighboring zero problems. The method presented allows the direct computation of optimal gains in terms of robustness and control effort for pole placement problems.

Sequential quadratic programming-based fast path planning algorithm subject to no-fly zone constraints

NASA Astrophysics Data System (ADS)

Liu, Wei; Ma, Shunjian; Sun, Mingwei; Yi, Haidong; Wang, Zenghui; Chen, Zengqiang

2016-08-01

Path planning plays an important role in aircraft guided systems. Multiple no-fly zones in the flight area make path planning a constrained nonlinear optimization problem. It is necessary to obtain a feasible optimal solution in real time. In this article, the flight path is specified to be composed of alternate line segments and circular arcs, in order to reformulate the problem into a static optimization one in terms of the waypoints. For the commonly used circular and polygonal no-fly zones, geometric conditions are established to determine whether or not the path intersects with them, and these can be readily programmed. Then, the original problem is transformed into a form that can be solved by the sequential quadratic programming method. The solution can be obtained quickly using the Sparse Nonlinear OPTimizer (SNOPT) package. Mathematical simulations are used to verify the effectiveness and rapidity of the proposed algorithm.

Optimal power flow with optimal placement TCSC device on 500 kV Java-Bali electrical power system using genetic Algorithm-Taguchi method

NASA Astrophysics Data System (ADS)

Apribowo, Chico Hermanu Brillianto; Ibrahim, Muhammad Hamka; Wicaksono, F. X. Rian

2018-02-01

The growing burden of the load and the complexity of the power system has had an impact on the need for optimization of power system operation. Optimal power flow (OPF) with optimal location placement and rating of thyristor controlled series capacitor (TCSC) is an effective solution used to determine the economic cost of operating the plant and regulate the power flow in the power system. The purpose of this study is to minimize the total cost of generation by placing the location and the optimal rating of TCSC using genetic algorithm-design of experiment techniques (GA-DOE). Simulation on Java-Bali system 500 kV with the amount of TCSC used by 5 compensator, the proposed method can reduce the generation cost by 0.89% compared to OPF without using TCSC.

Genetic Algorithm Approaches for Actuator Placement

NASA Technical Reports Server (NTRS)

Crossley, William A.

2000-01-01

This research investigated genetic algorithm approaches for smart actuator placement to provide aircraft maneuverability without requiring hinged flaps or other control surfaces. The effort supported goals of the Multidisciplinary Design Optimization focus efforts in NASA's Aircraft au program. This work helped to properly identify various aspects of the genetic algorithm operators and parameters that allow for placement of discrete control actuators/effectors. An improved problem definition, including better definition of the objective function and constraints, resulted from this research effort. The work conducted for this research used a geometrically simple wing model; however, an increasing number of potential actuator placement locations were incorporated to illustrate the ability of the GA to determine promising actuator placement arrangements. This effort's major result is a useful genetic algorithm-based approach to assist in the discrete actuator/effector placement problem.

Time optimized path-choice in the termite hunting ant Megaponera analis.

PubMed

Frank, Erik T; Hönle, Philipp O; Linsenmair, K Eduard

2018-05-10

Trail network systems among ants have received a lot of scientific attention due to their various applications in problem solving of networks. Recent studies have shown that ants select the fastest available path when facing different velocities on different substrates, rather than the shortest distance. The progress of decision-making by these ants is determined by pheromone-based maintenance of paths, which is a collective decision. However, path optimization through individual decision-making remains mostly unexplored. Here we present the first study of time-optimized path selection via individual decision-making by scout ants. Megaponera analis scouts search for termite foraging sites and lead highly organized raid columns to them. The path of the scout determines the path of the column. Through installation of artificial roads around M. analis nests we were able to influence the pathway choice of the raids. After road installation 59% of all recorded raids took place completely or partly on the road, instead of the direct, i.e. distance-optimized, path through grass from the nest to the termites. The raid velocity on the road was more than double the grass velocity, the detour thus saved 34.77±23.01% of the travel time compared to a hypothetical direct path. The pathway choice of the ants was similar to a mathematical model of least time allowing us to hypothesize the underlying mechanisms regulating the behavior. Our results highlight the importance of individual decision-making in the foraging behavior of ants and show a new procedure of pathway optimization. © 2018. Published by The Company of Biologists Ltd.

Optimal placement of fast cut back units based on the theory of cellular automata and agent

NASA Astrophysics Data System (ADS)

Yan, Jun; Yan, Feng

2017-06-01

The thermal power generation units with the function of fast cut back could serve power for auxiliary system and keep island operation after a major blackout, so they are excellent substitute for the traditional black-start power sources. Different placement schemes for FCB units have different influence on the subsequent restoration process. Considering the locality of the emergency dispatching rules, the unpredictability of specific dispatching instructions and unexpected situations like failure of transmission line energization, a novel deduction model for network reconfiguration based on the theory of cellular automata and agent is established. Several indexes are then defined for evaluating the placement schemes for FCB units. The attribute weights determination method based on subjective and objective integration and grey relational analysis are combinatorically used to determine the optimal placement scheme for FCB unit. The effectiveness of the proposed method is validated by the test results on the New England 10-unit 39-bus power system.

Spatio-Temporal Field Estimation Using Kriged Kalman Filter (KKF) with Sparsity-Enforcing Sensor Placement.

PubMed

Roy, Venkat; Simonetto, Andrea; Leus, Geert

2018-06-01

We propose a sensor placement method for spatio-temporal field estimation based on a kriged Kalman filter (KKF) using a network of static or mobile sensors. The developed framework dynamically designs the optimal constellation to place the sensors. We combine the estimation error (for the stationary as well as non-stationary component of the field) minimization problem with a sparsity-enforcing penalty to design the optimal sensor constellation in an economic manner. The developed sensor placement method can be directly used for a general class of covariance matrices (ill-conditioned or well-conditioned) modelling the spatial variability of the stationary component of the field, which acts as a correlated observation noise, while estimating the non-stationary component of the field. Finally, a KKF estimator is used to estimate the field using the measurements from the selected sensing locations. Numerical results are provided to exhibit the feasibility of the proposed dynamic sensor placement followed by the KKF estimation method.

Smell Detection Agent Based Optimization Algorithm

NASA Astrophysics Data System (ADS)

Vinod Chandra, S. S.

2016-09-01

In this paper, a novel nature-inspired optimization algorithm has been employed and the trained behaviour of dogs in detecting smell trails is adapted into computational agents for problem solving. The algorithm involves creation of a surface with smell trails and subsequent iteration of the agents in resolving a path. This algorithm can be applied in different computational constraints that incorporate path-based problems. Implementation of the algorithm can be treated as a shortest path problem for a variety of datasets. The simulated agents have been used to evolve the shortest path between two nodes in a graph. This algorithm is useful to solve NP-hard problems that are related to path discovery. This algorithm is also useful to solve many practical optimization problems. The extensive derivation of the algorithm can be enabled to solve shortest path problems.

A Parallel Approach To Optimum Actuator Selection With a Genetic Algorithm

NASA Technical Reports Server (NTRS)

Rogers, James L.

2000-01-01

Recent discoveries in smart technologies have created a variety of aerodynamic actuators which have great potential to enable entirely new approaches to aerospace vehicle flight control. For a revolutionary concept such as a seamless aircraft with no moving control surfaces, there is a large set of candidate locations for placing actuators, resulting in a substantially larger number of combinations to examine in order to find an optimum placement satisfying the mission requirements. The placement of actuators on a wing determines the control effectiveness of the airplane. One approach to placement Maximizes the moments about the pitch, roll, and yaw axes, while minimizing the coupling. Genetic algorithms have been instrumental in achieving good solutions to discrete optimization problems, such as the actuator placement problem. As a proof of concept, a genetic has been developed to find the minimum number of actuators required to provide uncoupled pitch, roll, and yaw control for a simplified, untapered, unswept wing model. To find the optimum placement by searching all possible combinations would require 1,100 hours. Formulating the problem and as a multi-objective problem and modifying it to take advantage of the parallel processing capabilities of a multi-processor computer, reduces the optimization time to 22 hours.

Codification of scan path parameters and development of perimeter scan strategies for 3D bowl-shaped laser forming

NASA Astrophysics Data System (ADS)

Tavakoli, A.; Naeini, H. Moslemi; Roohi, Amir H.; Gollo, M. Hoseinpour; Shahabad, Sh. Imani

2018-01-01

In the 3D laser forming process, developing an appropriate laser scan pattern for producing specimens with high quality and uniformity is critical. This study presents certain principles for developing scan paths. Seven scan path parameters are considered, including: (1) combined linear or curved path; (2) type of combined linear path; (3) order of scan sequences; (4) the position of the start point in each scan; (5) continuous or discontinuous scan path; (6) direction of scan path; and (7) angular arrangement of combined linear scan paths. Regarding these path parameters, ten combined linear scan patterns are presented. Numerical simulations show continuous hexagonal, scan pattern, scanning from outer to inner path, is the optimized. In addition, it is observed the position of the start point and the angular arrangement of scan paths is the most effective path parameters. Also, further experimentations show four sequences due to creat symmetric condition enhance the height of the bowl-shaped products and uniformity. Finally, the optimized hexagonal pattern was compared with the similar circular one. In the hexagonal scan path, distortion value and standard deviation rather to edge height of formed specimen is very low, and the edge height despite of decreasing length of scan path increases significantly compared to the circular scan path. As a result, four-sequence hexagonal scan pattern is proposed as the optimized perimeter scan path to produce bowl-shaped product.

Self-organization and solution of shortest-path optimization problems with memristive networks

NASA Astrophysics Data System (ADS)

Pershin, Yuriy V.; Di Ventra, Massimiliano

2013-07-01

We show that memristive networks, namely networks of resistors with memory, can efficiently solve shortest-path optimization problems. Indeed, the presence of memory (time nonlocality) promotes self organization of the network into the shortest possible path(s). We introduce a network entropy function to characterize the self-organized evolution, show the solution of the shortest-path problem and demonstrate the healing property of the solution path. Finally, we provide an algorithm to solve the traveling salesman problem. Similar considerations apply to networks of memcapacitors and meminductors, and networks with memory in various dimensions.

An ACOR-Based Multi-Objective WSN Deployment Example for Lunar Surveying.

PubMed

López-Matencio, Pablo

2016-02-06

Wireless sensor networks (WSNs) can gather in situ real data measurements and work unattended for long periods, even in remote, rough places. A critical aspect of WSN design is node placement, as this determines sensing capacities, network connectivity, network lifetime and, in short, the whole operational capabilities of the WSN. This paper proposes and studies a new node placement algorithm that focus on these aspects. As a motivating example, we consider a network designed to describe the distribution of helium-3 (³He), a potential enabling element for fusion reactors, on the Moon. ³He is abundant on the Moon's surface, and knowledge of its distribution is essential for future harvesting purposes. Previous data are inconclusive, and there is general agreement that on-site measurements, obtained over a long time period, are necessary to better understand the mechanisms involved in the distribution of this element on the Moon. Although a mission of this type is extremely complex, it allows us to illustrate the main challenges involved in a multi-objective WSN placement problem, i.e., selection of optimal observation sites and maximization of the lifetime of the network. To tackle optimization, we use a recent adaptation of the ant colony optimization (ACOR) metaheuristic, extended to continuous domains. Solutions are provided in the form of a Pareto frontier that shows the optimal equilibria. Moreover, we compared our scheme with the four-directional placement (FDP) heuristic, which was outperformed in all cases.

Optimal Path Planning Program for Autonomous Speed Sprayer in Orchard Using Order-Picking Algorithm

NASA Astrophysics Data System (ADS)

Park, T. S.; Park, S. J.; Hwang, K. Y.; Cho, S. I.

This study was conducted to develop a software program which computes optimal path for autonomous navigation in orchard, especially for speed sprayer. Possibilities of autonomous navigation in orchard were shown by other researches which have minimized distance error between planned path and performed path. But, research of planning an optimal path for speed sprayer in orchard is hardly founded. In this study, a digital map and a database for orchard which contains GPS coordinate information (coordinates of trees and boundary of orchard) and entity information (heights and widths of trees, radius of main stem of trees, disease of trees) was designed. An orderpicking algorithm which has been used for management of warehouse was used to calculate optimum path based on the digital map. Database for digital map was created by using Microsoft Access and graphic interface for database was made by using Microsoft Visual C++ 6.0. It was possible to search and display information about boundary of an orchard, locations of trees, daily plan for scattering chemicals and plan optimal path on different orchard based on digital map, on each circumstance (starting speed sprayer in different location, scattering chemicals for only selected trees).

Path optimization with limited sensing ability

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

Kang, Sung Ha, E-mail: kang@math.gatech.edu; Kim, Seong Jun, E-mail: skim396@math.gatech.edu; Zhou, Haomin, E-mail: hmzhou@math.gatech.edu

2015-10-15

We propose a computational strategy to find the optimal path for a mobile sensor with limited coverage to traverse a cluttered region. The goal is to find one of the shortest feasible paths to achieve the complete scan of the environment. We pose the problem in the level set framework, and first consider a related question of placing multiple stationary sensors to obtain the full surveillance of the environment. By connecting the stationary locations using the nearest neighbor strategy, we form the initial guess for the path planning problem of the mobile sensor. Then the path is optimized by reducingmore » its length, via solving a system of ordinary differential equations (ODEs), while maintaining the complete scan of the environment. Furthermore, we use intermittent diffusion, which converts the ODEs into stochastic differential equations (SDEs), to find an optimal path whose length is globally minimal. To improve the computation efficiency, we introduce two techniques, one to remove redundant connecting points to reduce the dimension of the system, and the other to deal with the entangled path so the solution can escape the local traps. Numerical examples are shown to illustrate the effectiveness of the proposed method.« less

Virtual sensors for active noise control in acoustic-structural coupled enclosures using structural sensing: part II--Optimization of structural sensor placement.

PubMed

Halim, Dunant; Cheng, Li; Su, Zhongqing

2011-04-01

The work proposed an optimization approach for structural sensor placement to improve the performance of vibro-acoustic virtual sensor for active noise control applications. The vibro-acoustic virtual sensor was designed to estimate the interior sound pressure of an acoustic-structural coupled enclosure using structural sensors. A spectral-spatial performance metric was proposed, which was used to quantify the averaged structural sensor output energy of a vibro-acoustic system excited by a spatially varying point source. It was shown that (i) the overall virtual sensing error energy was contributed additively by the modal virtual sensing error and the measurement noise energy; (ii) each of the modal virtual sensing error system was contributed by both the modal observability levels for the structural sensing and the target acoustic virtual sensing; and further (iii) the strength of each modal observability level was influenced by the modal coupling and resonance frequencies of the associated uncoupled structural/cavity modes. An optimal design of structural sensor placement was proposed to achieve sufficiently high modal observability levels for certain important panel- and cavity-controlled modes. Numerical analysis on a panel-cavity system demonstrated the importance of structural sensor placement on virtual sensing and active noise control performance, particularly for cavity-controlled modes.

Quad-rotor flight path energy optimization

NASA Astrophysics Data System (ADS)

Kemper, Edward

Quad-Rotor unmanned areal vehicles (UAVs) have been a popular area of research and development in the last decade, especially with the advent of affordable microcontrollers like the MSP 430 and the Raspberry Pi. Path-Energy Optimization is an area that is well developed for linear systems. In this thesis, this idea of path-energy optimization is extended to the nonlinear model of the Quad-rotor UAV. The classical optimization technique is adapted to the nonlinear model that is derived for the problem at hand, coming up with a set of partial differential equations and boundary value conditions to solve these equations. Then, different techniques to implement energy optimization algorithms are tested using simulations in Python. First, a purely nonlinear approach is used. This method is shown to be computationally intensive, with no practical solution available in a reasonable amount of time. Second, heuristic techniques to minimize the energy of the flight path are tested, using Ziegler-Nichols' proportional integral derivative (PID) controller tuning technique. Finally, a brute force look-up table based PID controller is used. Simulation results of the heuristic method show that both reliable control of the system and path-energy optimization are achieved in a reasonable amount of time.

I/O Router Placement and Fine-Grained Routing on Titan to Support Spider II

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

Ezell, Matthew A; Dillow, David; Oral, H Sarp

2014-01-01

The Oak Ridge Leadership Computing Facility (OLCF) introduced the concept of Fine-Grained Routing in 2008 to improve I/O performance between the Jaguar supercomputer and Spider, OLCF s center-wide Lustre file system. Fine-grained routing organizes I/O paths to minimize congestion. Jaguar has since been upgraded to Titan, providing more than a ten-fold improvement in peak performance. To support the center s increased computational capacity and I/O demand, the Spider file system has been replaced with Spider II. Building on the lessons learned from Spider, an improved method for placing LNET routers was developed and implemented for Spider II. The fine-grained routingmore » scripts and configuration have been updated to provide additional optimizations and better match the system setup. This paper presents a brief history of fine-grained routing at OLCF, an introduction to the architectures of Titan and Spider II, methods for placing routers in Titan, and details about the fine-grained routing configuration.« less

Are My Students Like Me? The Path to Color-Blindness and White Racial Identity Development

ERIC Educational Resources Information Center

Bloom, Diane S.; Peters, Terri; Margolin, Marcia; Fragnoli, Kristi

2015-01-01

This study examines the White racial identity (WRI) development of pre-service teachers in diverse and nondiverse student teaching placements. A qualitative design, using constant comparative analysis yielded salient themes/categories. Our results provide evidence that experience in diverse settings might provide opportunities for individuals to…

The Senior Year: Culminating Experiences and Transitions

ERIC Educational Resources Information Center

Hunter, Mary Stuart, Ed.; Keup, Jennifer R., Ed.; Kinzie, Jillian, Ed.; Maietta, Heather, Ed.

2012-01-01

Increasing pressures on colleges and universities to ensure degree completion and job placement as measures of success make it imperative that the path to graduation is clear and that seniors receive the support needed to earn a degree and make a successful transition to life beyond college. This new edited collection describes today's college…

Rate of Change: AP Calculus Students' Understandings and Misconceptions after Completing Different Curricular Paths

ERIC Educational Resources Information Center

Teuscher, Dawn; Reys, Robert E.

2012-01-01

This study examined Advanced Placement Calculus students' mathematical understanding of rate of change, after studying four years of college preparatory (integrated or single-subject) mathematics. Students completed the Precalculus Concept Assessment (PCA) and two open-ended tasks with questions about rates of change. After adjusting for prior…

Search Path Evaluation Incorporating Object Placement Structure

DTIC Science & Technology

2007-12-20

the probability of the set complement of this event: Pr(Ed) = 1 - kP PC (83) (k,t)I iIG Equation (83) provides the probability that if there is an...Networks," to appear in IEEE Transactions on Aerospace and Electronic Systems. 3. B. G. Koopman, Search and Screening: General Principles and Historical

Using Cooperative Education and Work-Integrated Education to Provide Career Clarification

ERIC Educational Resources Information Center

Zegwaard, Karsten E.; Coll, Richard K.

2011-01-01

When students commence university studies they typically choose subjects that are of interest to them, and hold only vague notions of intended career paths. However, some universities offer work-integrated learning degrees (WIL), programs that require students to undertake relevant practical work experience by way of work placements, internships…

A New Path to a College Degree: Match Beyond Helps Low-Income Students Succeed

ERIC Educational Resources Information Center

Marcus, Jon

2017-01-01

Match Beyond, launched in late 2013, offers accelerated degree programs through a pioneering approach that combines online education--provided by a partner, Southern New Hampshire University (SNHU)--with intensive coaching and support, including job-placement counseling. This small-scale strategy exposes the need for flexibility and personal…

A simple customized surgical guide for orthodontic miniplates with tube.

PubMed

Paek, Janghyun; Su, Ming-Jeaun; Kwon, Soon-Yong; Kim, Seong-Hun; Chung, Kyu-Rhim; Nelson, Gerald

2012-09-01

This article reports the use of a customized surgical guide for simple and precise C-tube plate placement with minimized incision. Patients who were planning to have orthodontic miniplate treatment because of narrow interradicular space were recruited for this study. A combined silicone and stainless steel wire surgical guide for the C-tube was fabricated on the cast model. The taller wire of the positioning guide is used to accurately start the incision. The incision guide-wire position is verified by placing the miniplate on the coronal horizontal wire to confirm that the incision will coordinate with the screw holes. Because the miniplate is firmly held in place, there is no risk of the miniplate anchoring screws (diameter, 1.5 mm; length, 4 mm) sliding on the bone surface during placement with a manual hand driver. The surgical guide was placed on the clinical site, and it allowed precise placement of the miniplate with minimum incision and preventing from slippage or path-of-insertion angulation errors that might interfere with accurate placement. Customized surgical guide enables precise planning for miniplate positions in anatomically complex sites.

Differential-Evolution Control Parameter Optimization for Unmanned Aerial Vehicle Path Planning

PubMed Central

Kok, Kai Yit; Rajendran, Parvathy

2016-01-01

The differential evolution algorithm has been widely applied on unmanned aerial vehicle (UAV) path planning. At present, four random tuning parameters exist for differential evolution algorithm, namely, population size, differential weight, crossover, and generation number. These tuning parameters are required, together with user setting on path and computational cost weightage. However, the optimum settings of these tuning parameters vary according to application. Instead of trial and error, this paper presents an optimization method of differential evolution algorithm for tuning the parameters of UAV path planning. The parameters that this research focuses on are population size, differential weight, crossover, and generation number. The developed algorithm enables the user to simply define the weightage desired between the path and computational cost to converge with the minimum generation required based on user requirement. In conclusion, the proposed optimization of tuning parameters in differential evolution algorithm for UAV path planning expedites and improves the final output path and computational cost. PMID:26943630

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.

Dynamic path planning for mobile robot based on particle swarm optimization

NASA Astrophysics Data System (ADS)

Wang, Yong; Cai, Feng; Wang, Ying

2017-08-01

In the contemporary, robots are used in many fields, such as cleaning, medical treatment, space exploration, disaster relief and so on. The dynamic path planning of robot without collision is becoming more and more the focus of people's attention. A new method of path planning is proposed in this paper. Firstly, the motion space model of the robot is established by using the MAKLINK graph method. Then the A* algorithm is used to get the shortest path from the start point to the end point. Secondly, this paper proposes an effective method to detect and avoid obstacles. When an obstacle is detected on the shortest path, the robot will choose the nearest safety point to move. Moreover, calculate the next point which is nearest to the target. Finally, the particle swarm optimization algorithm is used to optimize the path. The experimental results can prove that the proposed method is more effective.

Two-spoke placement optimization under explicit specific absorption rate and power constraints in parallel transmission at ultra-high field.

PubMed

Dupas, Laura; Massire, Aurélien; Amadon, Alexis; Vignaud, Alexandre; Boulant, Nicolas

2015-06-01

The spokes method combined with parallel transmission is a promising technique to mitigate the B1(+) inhomogeneity at ultra-high field in 2D imaging. To date however, the spokes placement optimization combined with the magnitude least squares pulse design has never been done in direct conjunction with the explicit Specific Absorption Rate (SAR) and hardware constraints. In this work, the joint optimization of 2-spoke trajectories and RF subpulse weights is performed under these constraints explicitly and in the small tip angle regime. The problem is first considerably simplified by making the observation that only the vector between the 2 spokes is relevant in the magnitude least squares cost-function, thereby reducing the size of the parameter space and allowing a more exhaustive search. The algorithm starts from a set of initial k-space candidates and performs in parallel for all of them optimizations of the RF subpulse weights and the k-space locations simultaneously, under explicit SAR and power constraints, using an active-set algorithm. The dimensionality of the spoke placement parameter space being low, the RF pulse performance is computed for every location in k-space to study the robustness of the proposed approach with respect to initialization, by looking at the probability to converge towards a possible global minimum. Moreover, the optimization of the spoke placement is repeated with an increased pulse bandwidth in order to investigate the impact of the constraints on the result. Bloch simulations and in vivo T2(∗)-weighted images acquired at 7 T validate the approach. The algorithm returns simulated normalized root mean square errors systematically smaller than 5% in 10 s. Copyright © 2015 Elsevier Inc. All rights reserved.

Optimal multi-type sensor placement for response and excitation reconstruction

NASA Astrophysics Data System (ADS)

Zhang, C. D.; Xu, Y. L.

2016-01-01

The need to perform dynamic response reconstruction always arises as the measurement of structural response is often limited to a few locations, especially for a large civil structure. Besides, it is usually very difficult, if not impossible, to measure external excitations under the operation condition of a structure. This study presents an algorithm for optimal placement of multi-type sensors, including strain gauges, displacement transducers and accelerometers, for the best reconstruction of responses of key structural components where there are no sensors installed and the best estimation of external excitations acting on the structure at the same time. The algorithm is developed in the framework of Kalman filter with unknown excitation, in which minimum-variance unbiased estimates of the generalized state of the structure and the external excitations are obtained by virtue of limited sensor measurements. The structural responses of key locations without sensors can then be reconstructed with the estimated generalized state and excitation. The asymptotic stability feature of the filter is utilized for optimal sensor placement. The number and spatial location of the multi-type sensors are determined by adding the optimal sensor which gains the maximal reduction of the estimation error of reconstructed responses. For the given mode number in response reconstruction and the given locations of external excitations, the optimal multi-sensor placement achieved by the proposed method is independent of the type and time evolution of external excitation. A simply-supported overhanging steel beam under multiple types of excitation is numerically studied to demonstrate the feasibility and superiority of the proposed method, and the experimental work is then carried out to testify the effectiveness of the proposed method.

Directed Diffusion Modelling for Tesso Nilo National Parks Case Study

NASA Astrophysics Data System (ADS)

Yasri, Indra; Safrianti, Ery

2018-01-01

— Directed Diffusion (DD has ability to achieve energy efficiency in Wireless Sensor Network (WSN). This paper proposes Directed Diffusion (DD) modelling for Tesso Nilo National Parks (TNNP) case study. There are 4 stages of scenarios involved in this modelling. It’s started by appointing of sampling area through GPS coordinate. The sampling area is determined by optimization processes from 500m x 500m up to 1000m x 1000m with 100m increment in between. The next stage is sensor node placement. Sensor node is distributed in sampling area with three different quantities i.e. 20 nodes, 30 nodes and 40 nodes. One of those quantities is choose as an optimized sensor node placement. The third stage is to implement all scenarios in stages 1 and stages 2 on DD modelling. In the last stage, the evaluation process to achieve most energy efficient in the combination of optimized sampling area and optimized sensor node placement on Direct Diffusion (DD) routing protocol. The result shows combination between sampling area 500m x 500m and 20 nodes able to achieve energy efficient to support a forest preventive fire system at Tesso Nilo National Parks.

Optimal Placement of Non-Intrusive Waste Heat Recovery Devices in Exhaust Ducts

DTIC Science & Technology

2015-06-01

Reynolds Number and Local Reynolds Number Depression Mixing .............................................................................40  3...57  viii 1.  Counterintuitive Findings Due to Local Reynolds Number Depression ... depression in the secondary recirculation zone enhances heat transfer, and device placement is the dominant factor for maximizing heat transfer in a

A Reduced Order Model of the Linearized Incompressible Navier-Strokes Equations for the Sensor/Actuator Placement Problem

NASA Technical Reports Server (NTRS)

Allan, Brian G.

2000-01-01

A reduced order modeling approach of the Navier-Stokes equations is presented for the design of a distributed optimal feedback kernel. This approach is based oil a Krylov subspace method where significant modes of the flow are captured in the model This model is then used in all optimal feedback control design where sensing and actuation is performed oil tile entire flow field. This control design approach yields all optimal feedback kernel which provides insight into the placement of sensors and actuators in the flow field. As all evaluation of this approach, a two-dimensional shear layer and driven cavity flow are investigated.

Path optimization method for the sign problem

NASA Astrophysics Data System (ADS)

Ohnishi, Akira; Mori, Yuto; Kashiwa, Kouji

2018-03-01

We propose a path optimization method (POM) to evade the sign problem in the Monte-Carlo calculations for complex actions. Among many approaches to the sign problem, the Lefschetz-thimble path-integral method and the complex Langevin method are promising and extensively discussed. In these methods, real field variables are complexified and the integration manifold is determined by the flow equations or stochastically sampled. When we have singular points of the action or multiple critical points near the original integral surface, however, we have a risk to encounter the residual and global sign problems or the singular drift term problem. One of the ways to avoid the singular points is to optimize the integration path which is designed not to hit the singular points of the Boltzmann weight. By specifying the one-dimensional integration-path as z = t +if(t)(f ɛ R) and by optimizing f(t) to enhance the average phase factor, we demonstrate that we can avoid the sign problem in a one-variable toy model for which the complex Langevin method is found to fail. In this proceedings, we propose POM and discuss how we can avoid the sign problem in a toy model. We also discuss the possibility to utilize the neural network to optimize the path.

Design of Quiet Rotorcraft Approach Trajectories

NASA Technical Reports Server (NTRS)

Padula, Sharon L.; Burley, Casey L.; Boyd, D. Douglas, Jr.; Marcolini, Michael A.

2009-01-01

A optimization procedure for identifying quiet rotorcraft approach trajectories is proposed and demonstrated. The procedure employs a multi-objective genetic algorithm in order to reduce noise and create approach paths that will be acceptable to pilots and passengers. The concept is demonstrated by application to two different helicopters. The optimized paths are compared with one another and to a standard 6-deg approach path. The two demonstration cases validate the optimization procedure but highlight the need for improved noise prediction techniques and for additional rotorcraft acoustic data sets.

Converging Towards the Optimal Path to Extinction

DTIC Science & Technology

2011-01-01

the reproductive rate R0 should be greater than but very close to 1. However, most real diseases have R0 larger than 1.5, which translates into a...can analytically find an expression for the action along the optimal path. The expression for the action is a function of k and the reproductive number...the optimal path for a range of values of the reproductive number R0. In contrast to the prior two examples, here the action must be computed

Evaluation of PCC long-term durability using intermediate sized gravels to optimize mix gradations.

DOT National Transportation Integrated Search

2010-04-01

With the implementation of the 2000 Q-MC specification, an incentive is provided to produce an optimized gradation to improve placement characteristics. Also, specifications for slip-formed barrier rail have changed to require an optimized gradation....

Kinship foster care among African American youth: Interaction effects at multiple contextual levels

PubMed Central

Rufa, Anne K.; Fowler, Patrick J.

2016-01-01

This study investigated the effects of kinship foster care on mental health outcomes among African American youth. Longitudinal data were used from a nationally representative sample of children and adolescents who were the subject of child protective services investigation from 1999 to 2000 (n=5,501). The secondary analyses focused on African American youth (n=225) placed into foster care. In structured interviews, current caregivers reported on youth internalizing and externalizing behaviors immediately following placement into out-of-home care and 18-months later. Path analysis tested a theoretical model that compared placements with kin to other formal out-of-home arrangements in context of setting characteristics, including aspects of caregiver and neighborhood disorder. Results suggested significant increases in internalizing symptoms over time for youth with more baseline mental health problems, as well as those placed in more distressed neighborhoods. Increased externalizing symptoms occurred among youth with greater baseline behavior problems, those placed in more problematic neighborhoods, and youth who experienced a placement change between assessments. Additionally, a combination of placement characteristics predicted increases in externalizing problems; youth placed in kinship foster care with older caregivers in poorer health exhibited greater increases in externalizing problems. Findings highlighted important contextual considerations for out-of-home placement among African American youth. PMID:26924865

Unstable child welfare permanent placements and early adolescent physical and mental health: The roles of adverse childhood experiences and post-traumatic stress.

PubMed

Villodas, Miguel T; Cromer, Kelly D; Moses, Jacqueline O; Litrownik, Alan J; Newton, Rae R; Davis, Inger P

2016-12-01

Although researchers have found that child welfare placement disruptions are associated with elevated youth physical and mental health problems, the mechanisms that explain this association have not been previously studied. The present study built on a previous investigation of the physical and behavioral consequences of long-term permanent placement patterns among youth who participated in the Longitudinal Studies of Child Abuse and Neglect (LONGSCAN). The current investigation (n=251) aimed to (a) report the early adolescent living situations of youth with different long-term placement patterns, and (b) to delineate the roles of adverse childhood experiences (ACEs) and post-traumatic stress (PTS) reactions in the association between unstable long-term placement patterns and physical and mental health problems during the transition to adolescence. Information about youth's living situations, ACEs, and physical and mental health was gathered prospectively from child protective services records and biannual caregiver and youth interviews when youth were 4-14 years old. The majority of youth remained with the same caregiver during early adolescence, but youth with chronically unstable permanent placement patterns continued to experience instability. Path analyses revealed that ACEs mediated the association between unstable placement patterns and elevated mental, but not physical, health problems during late childhood. Additionally, late childhood PTS mediated the association between unstable placement patterns and subsequent escalations in physical and mental health problems during the transition to adolescence. Findings highlight the importance of long-term permanency planning for youth who enter the child welfare system and emphasize the importance of trauma-focused assessment and intervention for these youth. Copyright © 2016 Elsevier Ltd. All rights reserved.

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.

Robust Flight Path Determination for Mars Precision Landing Using Genetic Algorithms

NASA Technical Reports Server (NTRS)

Bayard, David S.; Kohen, Hamid

1997-01-01

This paper documents the application of genetic algorithms (GAs) to the problem of robust flight path determination for Mars precision landing. The robust flight path problem is defined here as the determination of the flight path which delivers a low-lift open-loop controlled vehicle to its desired final landing location while minimizing the effect of perturbations due to uncertainty in the atmospheric model and entry conditions. The genetic algorithm was capable of finding solutions which reduced the landing error from 111 km RMS radial (open-loop optimal) to 43 km RMS radial (optimized with respect to perturbations) using 200 hours of computation on an Ultra-SPARC workstation. Further reduction in the landing error is possible by going to closed-loop control which can utilize the GA optimized paths as nominal trajectories for linearization.

In Search of the Optimal Path: How Learners at Task Use an Online Dictionary

ERIC Educational Resources Information Center

Hamel, Marie-Josee

2012-01-01

We have analyzed circa 180 navigation paths followed by six learners while they performed three language encoding tasks at the computer using an online dictionary prototype. Our hypothesis was that learners who follow an "optimal path" while navigating within the dictionary, using its search and look-up functions, would have a high chance of…

A systematic FPGA acceleration design for applications based on convolutional neural networks

NASA Astrophysics Data System (ADS)

Dong, Hao; Jiang, Li; Li, Tianjian; Liang, Xiaoyao

2018-04-01

Most FPGA accelerators for convolutional neural network are designed to optimize the inner acceleration and are ignored of the optimization for the data path between the inner accelerator and the outer system. This could lead to poor performance in applications like real time video object detection. We propose a brand new systematic FPFA acceleration design to solve this problem. This design takes the data path optimization between the inner accelerator and the outer system into consideration and optimizes the data path using techniques like hardware format transformation, frame compression. It also takes fixed-point, new pipeline technique to optimize the inner accelerator. All these make the final system's performance very good, reaching about 10 times the performance comparing with the original system.

Optimal sensors placement and spillover suppression

NASA Astrophysics Data System (ADS)

Hanis, Tomas; Hromcik, Martin

2012-04-01

A new approach to optimal placement of sensors (OSP) in mechanical structures is presented. In contrast to existing methods, the presented procedure enables a designer to seek for a trade-off between the presence of desirable modes in captured measurements and the elimination of influence of those mode shapes that are not of interest in a given situation. An efficient numerical algorithm is presented, developed from an existing routine based on the Fischer information matrix analysis. We consider two requirements in the optimal sensor placement procedure. On top of the classical EFI approach, the sensors configuration should also minimize spillover of unwanted higher modes. We use the information approach to OSP, based on the effective independent method (EFI), and modify the underlying criterion to meet both of our requirements—to maximize useful signals and minimize spillover of unwanted modes at the same time. Performance of our approach is demonstrated by means of examples, and a flexible Blended Wing Body (BWB) aircraft case study related to a running European-level FP7 research project 'ACFA 2020—Active Control for Flexible Aircraft'.

Strain sensors optimal placement for vibration-based structural health monitoring. The effect of damage on the initially optimal configuration

NASA Astrophysics Data System (ADS)

Loutas, T. H.; Bourikas, A.

2017-12-01

We revisit the optimal sensor placement of engineering structures problem with an emphasis on in-plane dynamic strain measurements and to the direction of modal identification as well as vibration-based damage detection for structural health monitoring purposes. The approach utilized is based on the maximization of a norm of the Fisher Information Matrix built with numerically obtained mode shapes of the structure and at the same time prohibit the sensorization of neighbor degrees of freedom as well as those carrying similar information, in order to obtain a satisfactory coverage. A new convergence criterion of the Fisher Information Matrix (FIM) norm is proposed in order to deal with the issue of choosing an appropriate sensor redundancy threshold, a concept recently introduced but not further investigated concerning its choice. The sensor configurations obtained via a forward sequential placement algorithm are sub-optimal in terms of FIM norm values but the selected sensors are not allowed to be placed in neighbor degrees of freedom providing thus a better coverage of the structure and a subsequent better identification of the experimental mode shapes. The issue of how service induced damage affects the initially nominated as optimal sensor configuration is also investigated and reported. The numerical model of a composite sandwich panel serves as a representative aerospace structure upon which our investigations are based.

Patterning control strategies for minimum edge placement error in logic devices

NASA Astrophysics Data System (ADS)

Mulkens, Jan; Hanna, Michael; Slachter, Bram; Tel, Wim; Kubis, Michael; Maslow, Mark; Spence, Chris; Timoshkov, Vadim

2017-03-01

In this paper we discuss the edge placement error (EPE) for multi-patterning semiconductor manufacturing. In a multi-patterning scheme the creation of the final pattern is the result of a sequence of lithography and etching steps, and consequently the contour of the final pattern contains error sources of the different process steps. We describe the fidelity of the final pattern in terms of EPE, which is defined as the relative displacement of the edges of two features from their intended target position. We discuss our holistic patterning optimization approach to understand and minimize the EPE of the final pattern. As an experimental test vehicle we use the 7-nm logic device patterning process flow as developed by IMEC. This patterning process is based on Self-Aligned-Quadruple-Patterning (SAQP) using ArF lithography, combined with line cut exposures using EUV lithography. The computational metrology method to determine EPE is explained. It will be shown that ArF to EUV overlay, CDU from the individual process steps, and local CD and placement of the individual pattern features, are the important contributors. Based on the error budget, we developed an optimization strategy for each individual step and for the final pattern. Solutions include overlay and CD metrology based on angle resolved scatterometry, scanner actuator control to enable high order overlay corrections and computational lithography optimization to minimize imaging induced pattern placement errors of devices and metrology targets.

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.

Research on global path planning based on ant colony optimization for AUV

NASA Astrophysics Data System (ADS)

Wang, Hong-Jian; Xiong, Wei

2009-03-01

Path planning is an important issue for autonomous underwater vehicles (AUVs) traversing an unknown environment such as a sea floor, a jungle, or the outer celestial planets. For this paper, global path planning using large-scale chart data was studied, and the principles of ant colony optimization (ACO) were applied. This paper introduced the idea of a visibility graph based on the grid workspace model. It also brought a series of pheromone updating rules for the ACO planning algorithm. The operational steps of the ACO algorithm are proposed as a model for a global path planning method for AUV. To mimic the process of smoothing a planned path, a cutting operator and an insertion-point operator were designed. Simulation results demonstrated that the ACO algorithm is suitable for global path planning. The system has many advantages, including that the operating path of the AUV can be quickly optimized, and it is shorter, safer, and smoother. The prototype system successfully demonstrated the feasibility of the concept, proving it can be applied to surveys of unstructured unmanned environments.

UAV path planning using artificial potential field method updated by optimal control theory

NASA Astrophysics Data System (ADS)

Chen, Yong-bo; Luo, Guan-chen; Mei, Yue-song; Yu, Jian-qiao; Su, Xiao-long

2016-04-01

The unmanned aerial vehicle (UAV) path planning problem is an important assignment in the UAV mission planning. Based on the artificial potential field (APF) UAV path planning method, it is reconstructed into the constrained optimisation problem by introducing an additional control force. The constrained optimisation problem is translated into the unconstrained optimisation problem with the help of slack variables in this paper. The functional optimisation method is applied to reform this problem into an optimal control problem. The whole transformation process is deduced in detail, based on a discrete UAV dynamic model. Then, the path planning problem is solved with the help of the optimal control method. The path following process based on the six degrees of freedom simulation model of the quadrotor helicopters is introduced to verify the practicability of this method. Finally, the simulation results show that the improved method is more effective in planning path. In the planning space, the length of the calculated path is shorter and smoother than that using traditional APF method. In addition, the improved method can solve the dead point problem effectively.

Optimization of Geothermal Well Placement under Geological Uncertainty

NASA Astrophysics Data System (ADS)

Schulte, Daniel O.; Arnold, Dan; Demyanov, Vasily; Sass, Ingo; Geiger, Sebastian

2017-04-01

Well placement optimization is critical to commercial success of geothermal projects. However, uncertainties of geological parameters prohibit optimization based on a single scenario of the subsurface, particularly when few expensive wells are to be drilled. The optimization of borehole locations is usually based on numerical reservoir models to predict reservoir performance and entails the choice of objectives to optimize (total enthalpy, minimum enthalpy rate, production temperature) and the development options to adjust (well location, pump rate, difference in production and injection temperature). Optimization traditionally requires trying different development options on a single geological realization yet there are many possible different interpretations possible. Therefore, we aim to optimize across a range of representative geological models to account for geological uncertainty in geothermal optimization. We present an approach that uses a response surface methodology based on a large number of geological realizations selected by experimental design to optimize the placement of geothermal wells in a realistic field example. A large number of geological scenarios and design options were simulated and the response surfaces were constructed using polynomial proxy models, which consider both geological uncertainties and design parameters. The polynomial proxies were validated against additional simulation runs and shown to provide an adequate representation of the model response for the cases tested. The resulting proxy models allow for the identification of the optimal borehole locations given the mean response of the geological scenarios from the proxy (i.e. maximizing or minimizing the mean response). The approach is demonstrated on the realistic Watt field example by optimizing the borehole locations to maximize the mean heat extraction from the reservoir under geological uncertainty. The training simulations are based on a comprehensive semi-synthetic data set of a hierarchical benchmark case study for a hydrocarbon reservoir, which specifically considers the interpretational uncertainty in the modeling work flow. The optimal choice of boreholes prolongs the time to cold water breakthrough and allows for higher pump rates and increased water production temperatures.

A Comparison of Risk Sensitive Path Planning Methods for Aircraft Emergency Landing

NASA Technical Reports Server (NTRS)

Meuleau, Nicolas; Plaunt, Christian; Smith, David E.; Smith, Tristan

2009-01-01

Determining the best site to land a damaged aircraft presents some interesting challenges for standard path planning techniques. There are multiple possible locations to consider, the space is 3-dimensional with dynamics, the criteria for a good path is determined by overall risk rather than distance or time, and optimization really matters, since an improved path corresponds to greater expected survival rate. We have investigated a number of different path planning methods for solving this problem, including cell decomposition, visibility graphs, probabilistic road maps (PRMs), and local search techniques. In their pure form, none of these techniques have proven to be entirely satisfactory - some are too slow or unpredictable, some produce highly non-optimal paths or do not find certain types of paths, and some do not cope well with the dynamic constraints when controllability is limited. In the end, we are converging towards a hybrid technique that involves seeding a roadmap with a layered visibility graph, using PRM to extend that roadmap, and using local search to further optimize the resulting paths. We describe the techniques we have investigated, report on our experiments with these techniques, and discuss when and why various techniques were unsatisfactory.

Optimal training for emergency needle thoracostomy placement by prehospital personnel: didactic teaching versus a cadaver-based training program.

PubMed

Grabo, Daniel; Inaba, Kenji; Hammer, Peter; Karamanos, Efstathios; Skiada, Dimitra; Martin, Matthew; Sullivan, Maura; Demetriades, Demetrios

2014-09-01

Tension pneumothorax can rapidly progress to cardiac arrest and death if not promptly recognized and appropriately treated. We sought to evaluate the effectiveness of traditional didactic slide-based lectures (SBLs) as compared with fresh tissue cadaver-based training (CBT) for placement of needle thoracostomy (NT). Forty randomly selected US Navy corpsmen were recruited to participate from incoming classes of the Navy Trauma Training Center at the LAC + USC Medical Center and were then randomized to one of two NT teaching methods. The following outcomes were compared between the two study arms: (1) time required to perform the procedure, (2) correct placement of the needle, and (3) magnitude of deviation from the correct position. During the study period, a total of 40 corpsmen were enrolled, 20 randomized to SBL and 20 to CBT arms. When outcomes were analyzed, time required to NT placement was not different between the two arms. Examination of the location of needle placement revealed marked differences between the two study groups. Only a minority of the SBL group (35%) placed the NT correctly in the second intercostal space. In comparison, the majority of corpsmen assigned to the CBT group demonstrated accurate placement in the second intercostal space (75%). In a CBT module, US Navy corpsmen were better trained to place NT accurately than their traditional didactic SBL counterparts. Further studies are indicated to identify the optimal components of effective simulation training for NT and other emergent interventions.

Optimization of Ultrasound Transducer Positioning for Endotracheal Tube Placement Confirmation in Cadaveric Model.

PubMed

Lonchena, Tiffany; So, Sokpoleak; Ibinson, James; Roolf, Peter; Orebaugh, Steven L

2017-02-01

Sonography has been suggested as a possible means of endotracheal tube (ETT) placement confirmation. However, optimum ultrasound transducer placement has not been established. Using a cadaveric model, ETT placement by the sonographic appearance at the thyroid cartilage, cricoid cartilage, and suprasternal notch in the upper airway was assessed to determine which ultrasound transducer placement offered the most optimal images for ETT confirmation in the airway. One provider intubated 5 cadavers, with the ultrasound transducer at each of the 3 levels, for a total of 30 intubations per specimen, while 2 providers assigned a visual score of 1 (subtle), 2 (clear), or 3 (pronounced) to each sonogram of the ETT in the airway. At the level of the thyroid cartilage, tracheal intubation was detected at a rate of 40%, with a median visualization scale of 1 (subtle movement). At the level of the cricoid cartilage, the visualization scale improved to a median of 2 (clear movement), with a 70% intubation detection rate. At the level of the suprasternal notch, 100% of the tracheal intubations were visualized on sonography, with a median score of 3 (pronounced movement). In comparing sonographic detection of ETT placement at 3 levels of the upper airway in a cadaveric model, our results clearly indicate that visualization was superior at the level of the suprasternal notch, with 100% of intubations detected with the best visualization scores. © 2017 by the American Institute of Ultrasound in Medicine.

Optimal Paths in Gliding Flight

NASA Astrophysics Data System (ADS)

Wolek, Artur

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.

The Study of Intelligent Vehicle Navigation Path Based on Behavior Coordination of Particle Swarm.

PubMed

Han, Gaining; Fu, Weiping; Wang, Wen

2016-01-01

In the behavior dynamics model, behavior competition leads to the shock problem of the intelligent vehicle navigation path, because of the simultaneous occurrence of the time-variant target behavior and obstacle avoidance behavior. Considering the safety and real-time of intelligent vehicle, the particle swarm optimization (PSO) algorithm is proposed to solve these problems for the optimization of weight coefficients of the heading angle and the path velocity. Firstly, according to the behavior dynamics model, the fitness function is defined concerning the intelligent vehicle driving characteristics, the distance between intelligent vehicle and obstacle, and distance of intelligent vehicle and target. Secondly, behavior coordination parameters that minimize the fitness function are obtained by particle swarm optimization algorithms. Finally, the simulation results show that the optimization method and its fitness function can improve the perturbations of the vehicle planning path and real-time and reliability.

The Study of Intelligent Vehicle Navigation Path Based on Behavior Coordination of Particle Swarm

PubMed Central

Han, Gaining; Fu, Weiping; Wang, Wen

2016-01-01

In the behavior dynamics model, behavior competition leads to the shock problem of the intelligent vehicle navigation path, because of the simultaneous occurrence of the time-variant target behavior and obstacle avoidance behavior. Considering the safety and real-time of intelligent vehicle, the particle swarm optimization (PSO) algorithm is proposed to solve these problems for the optimization of weight coefficients of the heading angle and the path velocity. Firstly, according to the behavior dynamics model, the fitness function is defined concerning the intelligent vehicle driving characteristics, the distance between intelligent vehicle and obstacle, and distance of intelligent vehicle and target. Secondly, behavior coordination parameters that minimize the fitness function are obtained by particle swarm optimization algorithms. Finally, the simulation results show that the optimization method and its fitness function can improve the perturbations of the vehicle planning path and real-time and reliability. PMID:26880881

New Approach to Optimize the Apfs Placement Based on Instantaneous Reactive Power Theory by Genetic Algorithm

NASA Astrophysics Data System (ADS)

Hashemi-Dezaki, Hamed; Mohammadalizadeh-Shabestary, Masoud; Askarian-Abyaneh, Hossein; Rezaei-Jegarluei, Mohammad

2014-01-01

In electrical distribution systems, a great amount of power are wasting across the lines, also nowadays power factors, voltage profiles and total harmonic distortions (THDs) of most loads are not as would be desired. So these important parameters of a system play highly important role in wasting money and energy, and besides both consumers and sources are suffering from a high rate of distortions and even instabilities. Active power filters (APFs) are innovative ideas for solving of this adversity which have recently used instantaneous reactive power theory. In this paper, a novel method is proposed to optimize the allocation of APFs. The introduced method is based on the instantaneous reactive power theory in vectorial representation. By use of this representation, it is possible to asses different compensation strategies. Also, APFs proper placement in the system plays a crucial role in either reducing the losses costs and power quality improvement. To optimize the APFs placement, a new objective function has been defined on the basis of five terms: total losses, power factor, voltage profile, THD and cost. Genetic algorithm has been used to solve the optimization problem. The results of applying this method to a distribution network illustrate the method advantages.

Influence of model errors in optimal sensor placement

NASA Astrophysics Data System (ADS)

Vincenzi, Loris; Simonini, Laura

2017-02-01

The paper investigates the role of model errors and parametric uncertainties in optimal or near optimal sensor placements for structural health monitoring (SHM) and modal testing. The near optimal set of measurement locations is obtained by the Information Entropy theory; the results of placement process considerably depend on the so-called covariance matrix of prediction error as well as on the definition of the correlation function. A constant and an exponential correlation function depending on the distance between sensors are firstly assumed; then a proposal depending on both distance and modal vectors is presented. With reference to a simple case-study, the effect of model uncertainties on results is described and the reliability and the robustness of the proposed correlation function in the case of model errors are tested with reference to 2D and 3D benchmark case studies. A measure of the quality of the obtained sensor configuration is considered through the use of independent assessment criteria. In conclusion, the results obtained by applying the proposed procedure on a real 5-spans steel footbridge are described. The proposed method also allows to better estimate higher modes when the number of sensors is greater than the number of modes of interest. In addition, the results show a smaller variation in the sensor position when uncertainties occur.

Optimizing placements of ground-based snow sensors for areal snow cover estimation using a machine-learning algorithm and melt-season snow-LiDAR data

NASA Astrophysics Data System (ADS)

Oroza, C.; Zheng, Z.; Glaser, S. D.; Bales, R. C.; Conklin, M. H.

2016-12-01

We present a structured, analytical approach to optimize ground-sensor placements based on time-series remotely sensed (LiDAR) data and machine-learning algorithms. We focused on catchments within the Merced and Tuolumne river basins, covered by the JPL Airborne Snow Observatory LiDAR program. First, we used a Gaussian mixture model to identify representative sensor locations in the space of independent variables for each catchment. Multiple independent variables that govern the distribution of snow depth were used, including elevation, slope, and aspect. Second, we used a Gaussian process to estimate the areal distribution of snow depth from the initial set of measurements. This is a covariance-based model that also estimates the areal distribution of model uncertainty based on the independent variable weights and autocorrelation. The uncertainty raster was used to strategically add sensors to minimize model uncertainty. We assessed the temporal accuracy of the method using LiDAR-derived snow-depth rasters collected in water-year 2014. In each area, optimal sensor placements were determined using the first available snow raster for the year. The accuracy in the remaining LiDAR surveys was compared to 100 configurations of sensors selected at random. We found the accuracy of the model from the proposed placements to be higher and more consistent in each remaining survey than the average random configuration. We found that a relatively small number of sensors can be used to accurately reproduce the spatial patterns of snow depth across the basins, when placed using spatial snow data. Our approach also simplifies sensor placement. At present, field surveys are required to identify representative locations for such networks, a process that is labor intensive and provides limited guarantees on the networks' representation of catchment independent variables.

Calibration of neural networks using genetic algorithms, with application to optimal path planning

NASA Technical Reports Server (NTRS)

Smith, Terence R.; Pitney, Gilbert A.; Greenwood, Daniel

1987-01-01

Genetic algorithms (GA) are used to search the synaptic weight space of artificial neural systems (ANS) for weight vectors that optimize some network performance function. GAs do not suffer from some of the architectural constraints involved with other techniques and it is straightforward to incorporate terms into the performance function concerning the metastructure of the ANS. Hence GAs offer a remarkably general approach to calibrating ANS. GAs are applied to the problem of calibrating an ANS that finds optimal paths over a given surface. This problem involves training an ANS on a relatively small set of paths and then examining whether the calibrated ANS is able to find good paths between arbitrary start and end points on the surface.

The placement of equipment in the Space Station Freedom using constraint based reasoning

NASA Technical Reports Server (NTRS)

Tanner, Steve; Fennel, Randy

1991-01-01

This paper describes the Rack Equipment Placement and Optimization System. The primary objective of this system is to assist engineers with the placement of equipment into the racks of the modules of Space Station Freedom. It accomplishes this by showing a user where equipment placement is possible and by generating potential layouts. The system uses an explicit representation of integration constraints to search for potential solutions for individual rack equipment items. A simulated annealing process is being evaluated for total solution generation as well. Versions of this system are in use now and are assisting with the development of the Space Station Freedom at the Marshall Space Flight Center in Huntsville, Alabama.

Stochastic Evolutionary Algorithms for Planning Robot Paths

NASA Technical Reports Server (NTRS)

Fink, Wolfgang; Aghazarian, Hrand; Huntsberger, Terrance; Terrile, Richard

2006-01-01

A computer program implements stochastic evolutionary algorithms for planning and optimizing collision-free paths for robots and their jointed limbs. Stochastic evolutionary algorithms can be made to produce acceptably close approximations to exact, optimal solutions for path-planning problems while often demanding much less computation than do exhaustive-search and deterministic inverse-kinematics algorithms that have been used previously for this purpose. Hence, the present software is better suited for application aboard robots having limited computing capabilities (see figure). The stochastic aspect lies in the use of simulated annealing to (1) prevent trapping of an optimization algorithm in local minima of an energy-like error measure by which the fitness of a trial solution is evaluated while (2) ensuring that the entire multidimensional configuration and parameter space of the path-planning problem is sampled efficiently with respect to both robot joint angles and computation time. Simulated annealing is an established technique for avoiding local minima in multidimensional optimization problems, but has not, until now, been applied to planning collision-free robot paths by use of low-power computers.

Path Planning Method in Multi-obstacle Marine Environment

NASA Astrophysics Data System (ADS)

Zhang, Jinpeng; Sun, Hanxv

2017-12-01

In this paper, an improved algorithm for particle swarm optimization is proposed for the application of underwater robot in the complex marine environment. Not only did consider to avoid obstacles when path planning, but also considered the current direction and the size effect on the performance of the robot dynamics. The algorithm uses the trunk binary tree structure to construct the path search space and A * heuristic search method is used in the search space to find a evaluation standard path. Then the particle swarm algorithm to optimize the path by adjusting evaluation function, which makes the underwater robot in the current navigation easier to control, and consume less energy.

In-Place Training: Optimizing Rural Health Workforce Outcomes through Rural-Based Education in Australia

ERIC Educational Resources Information Center

May, Jennifer; Brown, Leanne; Burrows, Julie

2018-01-01

The medical workforce shortfall in rural areas is a major issue influencing the nature of undergraduate medical education in Australia. Exposing undergraduates to rural life through rural clinical school (RCS) placements is seen as a key strategy to address workforce imbalances. We investigated the influence of an extended RCS placement and rural…

Trade-offs and efficiencies in optimal budget-constrained multispecies corridor networks

Treesearch

Bistra Dilkina; Rachel Houtman; Carla P. Gomes; Claire A. Montgomery; Kevin S. McKelvey; Katherine Kendall; Tabitha A. Graves; Richard Bernstein; Michael K. Schwartz

2016-01-01

Conservation biologists recognize that a system of isolated protected areas will be necessary but insufficient to meet biodiversity objectives. Current approaches to connecting core conservation areas through corridors consider optimal corridor placement based on a single optimization goal: commonly, maximizing the movement for a target species across a...

Automatic planning of needle placement for robot-assisted percutaneous procedures.

PubMed

Belbachir, Esia; Golkar, Ehsan; Bayle, Bernard; Essert, Caroline

2018-04-18

Percutaneous procedures allow interventional radiologists to perform diagnoses or treatments guided by an imaging device, typically a computed tomography (CT) scanner with a high spatial resolution. To reduce exposure to radiations and improve accuracy, robotic assistance to needle insertion is considered in the case of X-ray guided procedures. We introduce a planning algorithm that computes a needle placement compatible with both the patient's anatomy and the accessibility of the robot within the scanner gantry. Our preoperative planning approach is based on inverse kinematics, fast collision detection, and bidirectional rapidly exploring random trees coupled with an efficient strategy of node addition. The algorithm computes the allowed needle entry zones over the patient's skin (accessibility map) from 3D models of the patient's anatomy, the environment (CT, bed), and the robot. The result includes the admissible robot joint path to target the prescribed internal point, through the entry point. A retrospective study was performed on 16 patients datasets in different conditions: without robot (WR) and with the robot on the left or the right side of the bed (RL/RR). We provide an accessibility map ensuring a collision-free path of the robot and allowing for a needle placement compatible with the patient's anatomy. The result is obtained in an average time of about 1 min, even in difficult cases. The accessibility maps of RL and RR covered about a half of the surface of WR map in average, which offers a variety of options to insert the needle with the robot. We also measured the average distance between the needle and major obstacles such as the vessels and found that RL and RR produced needle placements almost as safe as WR. The introduced planning method helped us prove that it is possible to use such a "general purpose" redundant manipulator equipped with a dedicated tool to perform percutaneous interventions in cluttered spaces like a CT gantry.

Real-time Collision Avoidance and Path Optimizer for Semi-autonomous UAVs.

NASA Astrophysics Data System (ADS)

Hawary, A. F.; Razak, N. A.

2018-05-01

Whilst UAV offers a potentially cheaper and more localized observation platform than current satellite or land-based approaches, it requires an advance path planner to reveal its true potential, particularly in real-time missions. Manual control by human will have limited line-of-sights and prone to errors due to careless and fatigue. A good alternative solution is to equip the UAV with semi-autonomous capabilities that able to navigate via a pre-planned route in real-time fashion. In this paper, we propose an easy-and-practical path optimizer based on the classical Travelling Salesman Problem and adopts a brute force search method to re-optimize the route in the event of collisions using range finder sensor. The former utilizes a Simple Genetic Algorithm and the latter uses Nearest Neighbour algorithm. Both algorithms are combined to optimize the route and avoid collision at once. Although many researchers proposed various path planning algorithms, we find that it is difficult to integrate on a basic UAV model and often lacks of real-time collision detection optimizer. Therefore, we explore a practical benefit from this approach using on-board Arduino and Ardupilot controllers by manually emulating the motion of an actual UAV model prior to test on the flying site. The result showed that the range finder sensor provides a real-time data to the algorithm to find a collision-free path and eventually optimized the route successfully.

Directed Self-Placement and Digital Literacy: Helping At-Risk Students Negotiate the Transition to College Communication

ERIC Educational Resources Information Center

Knievel, Michael S.

2016-01-01

Even though a first-year writing course remains a near-standard component of the college experience, its "content" and the "path" students take to enroll in it are not so standard. Two recent changes at a public, land-grant institution with a selective admission policy and an undergraduate population of approximately 10,000…

Precision instrument placement using a 4-DOF robot with integrated fiducials for minimally invasive interventions

NASA Astrophysics Data System (ADS)

Stenzel, Roland; Lin, Ralph; Cheng, Peng; Kronreif, Gernot; Kornfeld, Martin; Lindisch, David; Wood, Bradford J.; Viswanathan, Anand; Cleary, Kevin

2007-03-01

Minimally invasive procedures are increasingly attractive to patients and medical personnel because they can reduce operative trauma, recovery times, and overall costs. However, during these procedures, the physician has a very limited view of the interventional field and the exact position of surgical instruments. We present an image-guided platform for precision placement of surgical instruments based upon a small four degree-of-freedom robot (B-RobII; ARC Seibersdorf Research GmbH, Vienna, Austria). This platform includes a custom instrument guide with an integrated spiral fiducial pattern as the robot's end-effector, and it uses intra-operative computed tomography (CT) to register the robot to the patient directly before the intervention. The physician can then use a graphical user interface (GUI) to select a path for percutaneous access, and the robot will automatically align the instrument guide along this path. Potential anatomical targets include the liver, kidney, prostate, and spine. This paper describes the robotic platform, workflow, software, and algorithms used by the system. To demonstrate the algorithmic accuracy and suitability of the custom instrument guide, we also present results from experiments as well as estimates of the maximum error between target and instrument tip.

A serious game for learning ultrasound-guided needle placement skills.

PubMed

Chan, Wing-Yin; Qin, Jing; Chui, Yim-Pan; Heng, Pheng-Ann

2012-11-01

Ultrasound-guided needle placement is a key step in a lot of radiological intervention procedures such as biopsy, local anesthesia and fluid drainage. To help training future intervention radiologists, we develop a serious game to teach the skills involved. We introduce novel techniques for realistic simulation and integrate game elements for active and effective learning. This game is designed in the context of needle placement training based on the some essential characteristics of serious games. Training scenarios are interactively generated via a block-based construction scheme. A novel example-based texture synthesis technique is proposed to simulate corresponding ultrasound images. Game levels are defined based on the difficulties of the generated scenarios. Interactive recommendation of desirable insertion paths is provided during the training as an adaptation mechanism. We also develop a fast physics-based approach to reproduce the shadowing effect of needles in ultrasound images. Game elements such as time-attack tasks, hints and performance evaluation tools are also integrated in our system. Extensive experiments are performed to validate its feasibility for training.

Method of interplanetary trajectory optimization for the spacecraft with low thrust and swing-bys

NASA Astrophysics Data System (ADS)

Konstantinov, M. S.; Thein, M.

2017-07-01

The method developed to avoid the complexity of solving the multipoint boundary value problem while optimizing interplanetary trajectories of the spacecraft with electric propulsion and a sequence of swing-bys is presented in the paper. This method is based on the use of the preliminary problem solutions for the impulsive trajectories. The preliminary problem analyzed at the first stage of the study is formulated so that the analysis and optimization of a particular flight path is considered as the unconstrained minimum in the space of the selectable parameters. The existing methods can effectively solve this problem and make it possible to identify rational flight paths (the sequence of swing-bys) to receive the initial approximation for the main characteristics of the flight path (dates, values of the hyperbolic excess velocity, etc.). These characteristics can be used to optimize the trajectory of the spacecraft with electric propulsion. The special feature of the work is the introduction of the second (intermediate) stage of the research. At this stage some characteristics of the analyzed flight path (e.g. dates of swing-bys) are fixed and the problem is formulated so that the trajectory of the spacecraft with electric propulsion is optimized on selected sites of the flight path. The end-to-end optimization is carried out at the third (final) stage of the research. The distinctive feature of this stage is the analysis of the full set of optimal conditions for the considered flight path. The analysis of the characteristics of the optimal flight trajectories to Jupiter with Earth, Venus and Mars swing-bys for the spacecraft with electric propulsion are presented. The paper shows that the spacecraft weighing more than 7150 kg can be delivered into the vicinity of Jupiter along the trajectory with two Earth swing-bys by use of the space transportation system based on the "Angara A5" rocket launcher, the chemical upper stage "KVTK" and the electric propulsion system with input electrical power of 100 kW.

Establishing the ferret as a gyrencephalic animal model of traumatic brain injury: Optimization of controlled cortical impact procedures.

PubMed

Schwerin, Susan C; Hutchinson, Elizabeth B; Radomski, Kryslaine L; Ngalula, Kapinga P; Pierpaoli, Carlo M; Juliano, Sharon L

2017-06-15

Although rodent TBI studies provide valuable information regarding the effects of injury and recovery, an animal model with neuroanatomical characteristics closer to humans may provide a more meaningful basis for clinical translation. The ferret has a high white/gray matter ratio, gyrencephalic neocortex, and ventral hippocampal location. Furthermore, ferrets are amenable to behavioral training, have a body size compatible with pre-clinical MRI, and are cost-effective. We optimized the surgical procedure for controlled cortical impact (CCI) using 9 adult male ferrets. We used subject-specific brain/skull morphometric data from anatomical MRIs to overcome across-subject variability for lesion placement. We also reflected the temporalis muscle, closed the craniotomy, and used antibiotics. We then gathered MRI, behavioral, and immunohistochemical data from 6 additional animals using the optimized surgical protocol: 1 control, 3 mild, and 1 severely injured animals (surviving one week) and 1 moderately injured animal surviving sixteen weeks. The optimized surgical protocol resulted in consistent injury placement. Astrocytic reactivity increased with injury severity showing progressively greater numbers of astrocytes within the white matter. The density and morphological changes of microglia amplified with injury severity or time after injury. Motor and cognitive impairments scaled with injury severity. The optimized surgical methods differ from those used in the rodent, and are integral to success using a ferret model. We optimized ferret CCI surgery for consistent injury placement. The ferret is an excellent animal model to investigate pathophysiological and behavioral changes associated with TBI. Published by Elsevier B.V.

Research on Taxiway Path Optimization Based on Conflict Detection

PubMed Central

Zhou, Hang; Jiang, Xinxin

2015-01-01

Taxiway path planning is one of the effective measures to make full use of the airport resources, and the optimized paths can ensure the safety of the aircraft during the sliding process. In this paper, the taxiway path planning based on conflict detection is considered. Specific steps are shown as follows: firstly, make an improvement on A * algorithm, the conflict detection strategy is added to search for the shortest and safe path in the static taxiway network. Then, according to the sliding speed of aircraft, a time table for each node is determined and the safety interval is treated as the constraint to judge whether there is a conflict or not. The intelligent initial path planning model is established based on the results. Finally, make an example in an airport simulation environment, detect and relieve the conflict to ensure the safety. The results indicate that the model established in this paper is effective and feasible. Meanwhile, make comparison with the improved A*algorithm and other intelligent algorithms, conclude that the improved A*algorithm has great advantages. It could not only optimize taxiway path, but also ensure the safety of the sliding process and improve the operational efficiency. PMID:26226485

Research on Taxiway Path Optimization Based on Conflict Detection.

PubMed

Zhou, Hang; Jiang, Xinxin

2015-01-01

Taxiway path planning is one of the effective measures to make full use of the airport resources, and the optimized paths can ensure the safety of the aircraft during the sliding process. In this paper, the taxiway path planning based on conflict detection is considered. Specific steps are shown as follows: firstly, make an improvement on A * algorithm, the conflict detection strategy is added to search for the shortest and safe path in the static taxiway network. Then, according to the sliding speed of aircraft, a time table for each node is determined and the safety interval is treated as the constraint to judge whether there is a conflict or not. The intelligent initial path planning model is established based on the results. Finally, make an example in an airport simulation environment, detect and relieve the conflict to ensure the safety. The results indicate that the model established in this paper is effective and feasible. Meanwhile, make comparison with the improved A*algorithm and other intelligent algorithms, conclude that the improved A*algorithm has great advantages. It could not only optimize taxiway path, but also ensure the safety of the sliding process and improve the operational efficiency.

Cardiac MR in robotic heart surgery for preoperative identification of the target vessel and precise port placement--a theoretical model.

PubMed

Bergmann, P; Huber, S; Segl, H; Maechler, H; Reiter, U; Reiter, G; Rienmueller, R; Oberwalder, P; Rigler, B

2003-08-01

The identification of the ideal anastomosis site and the proper port placement are critical for the success of closed-chest robotic surgery. We investigated a new systematic procedure for precise port placement for TECABs. We used trigonometry and a human thoracic model to determine the optimal working angles between anastomotic plane, instruments, and endoscope. We then applied the results to seven human subjects as follows: 1. A navigation grid was located extrathoracically before cardiac MR examination. 2. The ideal anastomosis site was defined with the MR. Intrathoracic distances and angles were computed with cardiac MR software and projected onto the thorax. 3. The ideal port placement points were marked on the thorax. The optimal working angle between endoscope and instruments was 35 degrees. 0 degrees and 90 degrees angles were associated with a significant reduction in visualization, technical ease, quality and anastomosis time. The course of the LAD was identified in all seven volunteers with MR. Mean deviation of the endoscope port from the medioclavicular line was 4.3+/-2.1 cm and of the instrument ports from the anterior axillary line 8.4+/-2.4 cm. Cardiac MR in combination with the navigation grid proved suitable for the visualization of coronary vessels for individually calculating port placement points on the thorax.

Optimal placement of actuators and sensors in control augmented structural optimization

NASA Technical Reports Server (NTRS)

Sepulveda, A. E.; Schmit, L. A., Jr.

1990-01-01

A control-augmented structural synthesis methodology is presented in which actuator and sensor placement is treated in terms of (0,1) variables. Structural member sizes and control variables are treated simultaneously as design variables. A multiobjective utopian approach is used to obtain a compromise solution for inherently conflicting objective functions such as strucutal mass control effort and number of actuators. Constraints are imposed on transient displacements, natural frequencies, actuator forces and dynamic stability as well as controllability and observability of the system. The combinatorial aspects of the mixed - (0,1) continuous variable design optimization problem are made tractable by combining approximation concepts with branch and bound techniques. Some numerical results for example problems are presented to illustrate the efficacy of the design procedure set forth.

Optimizing Virtual Network Functions Placement in Virtual Data Center Infrastructure Using Machine Learning

NASA Astrophysics Data System (ADS)

Bolodurina, I. P.; Parfenov, D. I.

2018-01-01

We have elaborated a neural network model of virtual network flow identification based on the statistical properties of flows circulating in the network of the data center and characteristics that describe the content of packets transmitted through network objects. This enabled us to establish the optimal set of attributes to identify virtual network functions. We have established an algorithm for optimizing the placement of virtual data functions using the data obtained in our research. Our approach uses a hybrid method of visualization using virtual machines and containers, which enables to reduce the infrastructure load and the response time in the network of the virtual data center. The algorithmic solution is based on neural networks, which enables to scale it at any number of the network function copies.

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.

OPTIMIZING BMP PLACEMENT AT WATERSHED-SCALE USING SUSTAIN

EPA Science Inventory

Watershed and stormwater managers need modeling tools to evaluate alternative plans for environmental quality restoration and protection needs in urban and developing areas. A watershed-scale decision-support system, based on cost optimization, provides an essential tool to suppo...

Estimating Snow Water Equivalent over the American River in the Sierra Nevada Basin Using Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Welch, S. C.; Kerkez, B.; Glaser, S. D.; Bales, R. C.; Rice, R.

2011-12-01

We have designed a basin-scale (>2000 km2) instrument cluster, made up of 20 local-scale (1-km footprint) wireless sensor networks (WSNs), to measure patterns of snow depth and snow water equivalent (SWE) across the main snowmelt producing area within the American River basin. Each of the 20 WSNs has on the order of 25 wireless nodes, with over 10 nodes actively sensing snow depth, and thus snow accumulation and melt. When combined with existing snow density measurements and full-basin satellite snowcover data, these measurements are designed to provide dense ground-truth snow properties for research and real-time SWE for water management. The design of this large-scale network is based on rigorous testing of previous, smaller-scale studies, permitting for the development of methods to significantly, and efficiently scale up network operations. Recent advances in WSN technology have resulted in a modularized strategy that permits rapid future network deployment. To select network and sensor locations, various sensor placement approaches were compared, including random placement, placement of WSNs in locations that have captured the historical basin mean, as well as a placement algorithm leveraging the covariance structure of the SWE distribution. We show that that the optimal network locations do not exhibit a uniform grid, but rather follow strategic patterns based on physiographic terrain parameters. Uncertainty estimates are also provided to assess the confidence in the placement approach. To ensure near-optimal coverage of the full basin, we validated each placement approach with a multi-year record of SWE derived from reconstruction of historical satellite measurements.

Optimal placement of multiple types of communicating sensors with availability and coverage redundancy constraints

NASA Astrophysics Data System (ADS)

Vecherin, Sergey N.; Wilson, D. Keith; Pettit, Chris L.

2010-04-01

Determination of an optimal configuration (numbers, types, and locations) of a sensor network is an important practical problem. In most applications, complex signal propagation effects and inhomogeneous coverage preferences lead to an optimal solution that is highly irregular and nonintuitive. The general optimization problem can be strictly formulated as a binary linear programming problem. Due to the combinatorial nature of this problem, however, its strict solution requires significant computational resources (NP-complete class of complexity) and is unobtainable for large spatial grids of candidate sensor locations. For this reason, a greedy algorithm for approximate solution was recently introduced [S. N. Vecherin, D. K. Wilson, and C. L. Pettit, "Optimal sensor placement with terrain-based constraints and signal propagation effects," Unattended Ground, Sea, and Air Sensor Technologies and Applications XI, SPIE Proc. Vol. 7333, paper 73330S (2009)]. Here further extensions to the developed algorithm are presented to include such practical needs and constraints as sensor availability, coverage by multiple sensors, and wireless communication of the sensor information. Both communication and detection are considered in a probabilistic framework. Communication signal and signature propagation effects are taken into account when calculating probabilities of communication and detection. Comparison of approximate and strict solutions on reduced-size problems suggests that the approximate algorithm yields quick and good solutions, which thus justifies using that algorithm for full-size problems. Examples of three-dimensional outdoor sensor placement are provided using a terrain-based software analysis tool.

Process Modeling and Validation for Metal Big Area Additive Manufacturing

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

Simunovic, Srdjan; Nycz, Andrzej; Noakes, Mark W.

Metal Big Area Additive Manufacturing (mBAAM) is a new additive manufacturing (AM) technology based on the metal arc welding. A continuously fed metal wire is melted by an electric arc that forms between the wire and the substrate, and deposited in the form of a bead of molten metal along the predetermined path. Objects are manufactured one layer at a time starting from the base plate. The final properties of the manufactured object are dependent on its geometry and the metal deposition path, in addition to depending on the basic welding process parameters. Computational modeling can be used to acceleratemore » the development of the mBAAM technology as well as a design and optimization tool for the actual manufacturing process. We have developed a finite element method simulation framework for mBAAM using the new features of software ABAQUS. The computational simulation of material deposition with heat transfer is performed first, followed by the structural analysis based on the temperature history for predicting the final deformation and stress state. In this formulation, we assume that two physics phenomena are coupled in only one direction, i.e. the temperatures are driving the deformation and internal stresses, but their feedback on the temperatures is negligible. The experiment instrumentation (measurement types, sensor types, sensor locations, sensor placements, measurement intervals) and the measurements are presented. The temperatures and distortions from the simulations show good correlation with experimental measurements. Ongoing modeling work is also briefly discussed.« less

Epicardial left ventricular lead placement for cardiac resynchronization therapy: optimal pace site selection with pressure-volume loops.

PubMed

Dekker, A L A J; Phelps, B; Dijkman, B; van der Nagel, T; van der Veen, F H; Geskes, G G; Maessen, J G

2004-06-01

Patients in heart failure with left bundle branch block benefit from cardiac resynchronization therapy. Usually the left ventricular pacing lead is placed by coronary sinus catheterization; however, this procedure is not always successful, and patients may be referred for surgical epicardial lead placement. The objective of this study was to develop a method to guide epicardial lead placement in cardiac resynchronization therapy. Eleven patients in heart failure who were eligible for cardiac resynchronization therapy were referred for surgery because of failed coronary sinus left ventricular lead implantation. Minithoracotomy or thoracoscopy was performed, and a temporary epicardial electrode was used for biventricular pacing at various sites on the left ventricle. Pressure-volume loops with the conductance catheter were used to select the best site for each individual patient. Relative to the baseline situation, biventricular pacing with an optimal left ventricular lead position significantly increased stroke volume (+39%, P =.01), maximal left ventricular pressure derivative (+20%, P =.02), ejection fraction (+30%, P =.007), and stroke work (+66%, P =.006) and reduced end-systolic volume (-6%, P =.04). In contrast, biventricular pacing at a suboptimal site did not significantly change left ventricular function and even worsened it in some cases. To optimize cardiac resynchronization therapy with epicardial leads, mapping to determine the best pace site is a prerequisite. Pressure-volume loops offer real-time guidance for targeting epicardial lead placement during minimal invasive surgery.

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.

Thermal and Structural Performance of Woven Carbon Cloth For Adaptive Deployable Entry and Placement Technology

NASA Technical Reports Server (NTRS)

Arnold, James O.; Peterson, Keith H.; Yount, Bryan C.; Schneider, Nigel; Chavez-Garcia, Jose

2013-01-01

Arcjet testing and analysis of a three-dimensional (3D) woven carbon fabric has shown that it can be used as a thermal protection system and as a load bearing structural component for a low ballistic coefficient hypersonic decelerator called ADEPT (Adaptive Deployable Entry and Placement Technology). Results of arcjet tests proved that the 3D woven carbon fabric can withstand flight-like heating while under flight-like biaxial mechanical loads representative of those encountered during shallow entry flight path angles into the atmosphere of Venus. Importantly, the arcjet test results have been used to extend a preliminary material thermal response model based on previous testing of the same 3D woven carbon fabric under uni-axial mechanical loading.

Effects of trap design and placement on capture of emerald ash borer, Agrilus planipennis

Treesearch

Joseph A. Francese; Jason B. Oliver; Ivich Fraser; Nadeer Youssef; David R. Lance; Damon J. Crook; Victor C. Mastro

2007-01-01

The ongoing objective of this research is to develop a trap that can improve the sensitivity and efficiency of emerald ash borer, Agrilus planipennis (Coleoptera: Buprestidae) Fairmaire (EAB) survey and aid the overall program in achieving its goals. As part of this work, we sought to determine the optimal location for trap placement. First we placed...

Observability-Based Guidance and Sensor Placement

NASA Astrophysics Data System (ADS)

Hinson, Brian T.

Control system performance is highly dependent on the quality of sensor information available. In a growing number of applications, however, the control task must be accomplished with limited sensing capabilities. This thesis addresses these types of problems from a control-theoretic point-of-view, leveraging system nonlinearities to improve sensing performance. Using measures of observability as an information quality metric, guidance trajectories and sensor distributions are designed to improve the quality of sensor information. An observability-based sensor placement algorithm is developed to compute optimal sensor configurations for a general nonlinear system. The algorithm utilizes a simulation of the nonlinear system as the source of input data, and convex optimization provides a scalable solution method. The sensor placement algorithm is applied to a study of gyroscopic sensing in insect wings. The sensor placement algorithm reveals information-rich areas on flexible insect wings, and a comparison to biological data suggests that insect wings are capable of acting as gyroscopic sensors. An observability-based guidance framework is developed for robotic navigation with limited inertial sensing. Guidance trajectories and algorithms are developed for range-only and bearing-only navigation that improve navigation accuracy. Simulations and experiments with an underwater vehicle demonstrate that the observability measure allows tuning of the navigation uncertainty.

Optimal sensor placement for active guided wave interrogation of complex metallic components

NASA Astrophysics Data System (ADS)

Coelho, Clyde K.; Kim, Seung Bum; Chattopadhyay, Aditi

2011-04-01

With research in structural health monitoring (SHM) moving towards increasingly complex structures for damage interrogation, the placement of sensors is becoming a key issue in the performance of the damage detection methodologies. For ultrasonic wave based approaches, this is especially important because of the sensitivity of the travelling Lamb waves to material properties, geometry and boundary conditions that may obscure the presence of damage if they are not taken into account during sensor placement. The framework proposed in this paper defines a sensing region for a pair of piezoelectric transducers in a pitch-catch damage detection approach by taking into account the material attenuation and probability of false alarm. Using information about the region interrogated by a sensoractuator pair, a simulated annealing optimization framework was implemented in order to place sensors on complex metallic geometries such that a selected minimum damage type and size could be detected with an acceptable probability of false alarm anywhere on the structure. This approach was demonstrated on a lug joint to detect a crack and on a large Naval SHM test bed and resulted in a placement of sensors that was able to interrogate all parts of the structure using the minimum number of transducers.

OPTIMAL WELL LOCATOR (OWL): A SCREENING TOOL FOR EVALUATING LOCATIONS OF MONITORING WELLS

EPA Science Inventory

The Optimal Well Locator ( OWL) program was designed and developed by USEPA to be a screening tool to evaluate and optimize the placement of wells in long term monitoring networks at small sites. The first objective of the OWL program is to allow the user to visualize the change ...

An EGO-like optimization framework for sensor placement optimization in modal analysis

NASA Astrophysics Data System (ADS)

Morlier, Joseph; Basile, Aniello; Chiplunkar, Ankit; Charlotte, Miguel

2018-07-01

In aircraft design, ground/flight vibration tests are conducted to extract aircraft’s modal parameters (natural frequencies, damping ratios and mode shapes) also known as the modal basis. The main problem in aircraft modal identification is the large number of sensors needed, which increases operational time and costs. The goal of this paper is to minimize the number of sensors by optimizing their locations in order to reconstruct a truncated modal basis of N mode shapes with a high level of accuracy in the reconstruction. There are several methods to solve sensors placement optimization (SPO) problems, but for this case an original approach has been established based on an iterative process for mode shapes reconstruction through an adaptive Kriging metamodeling approach so called efficient global optimization (EGO)-SPO. The main idea in this publication is to solve an optimization problem where the sensors locations are variables and the objective function is defined by maximizing the trace of criteria so called AutoMAC. The results on a 2D wing demonstrate a reduction of sensors by 30% using our EGO-SPO strategy.

The approach for shortest paths in fire succor based on component GIS technology

NASA Astrophysics Data System (ADS)

Han, Jie; Zhao, Yong; Dai, K. W.

2007-06-01

Fire safety is an important issue for the national economy and people's living. Efficiency and exactness of fire department succor directly relate to safety of peoples' lives and property. Many disadvantages of the traditional fire system have been emerged in practical applications. The preparation of pumpers is guided by wireless communication or wire communication, so its real-time and accurate performances are much poorer. The information about the reported fire, such as the position, disaster and map, et al., for alarm and command was processed by persons, which slows the reaction speed and delays the combat opportunity. In order to solve these disadvantages, it has an important role to construct a modern fire command center based on high technology. The construction of modern fire command center can realize the modernization and automation of fire command and management. It will play a great role in protecting safety of peoples' lives and property. The center can enhance battle ability and can reduce the direct and indirect loss of fire damage at most. With the development of science technology, Geographic Information System (GIS) has becoming a new information industry for hardware production, software development, data collection, space analysis and counseling. With the popularization of computers and the development of GIS, GIS has gained increasing broad applications for its strong functionality. Network analysis is one of the most important functions of GIS, and the most elementary and pivotal issue of network analysis is the calculation of shortest paths. The shortest paths are mostly applied to some emergent systems such as 119 fire alarms. These systems mainly require that the computation time of the optimal path should be 1-3 seconds. And during traveling, the next running path of the vehicles should be calculated in time. So the implement of the shortest paths must have a high efficiency. In this paper, the component GIS technology was applied to collect and record the data information (such as, the situation of this disaster, map and road status et al) of the reported fire firstly. The ant colony optimization was used to calculate the shortest path of fire succor secondly. The optimization results were sent to the pumpers, which can let pumpers choose the shortest paths intelligently and come to fire position with least time. The programming method for shortest paths is proposed in section 3. There are three parts in this section. The elementary framework of the proposed programming method is presented in part one. The systematic framework of GIS component is described in part two. The ant colony optimization employed is presented in part three. In section 4, a simple application instance was presented to demonstrate the proposed programming method. There are three parts in this section. The distributed Web application based on component GIS was described in part one. The optimization results without traffic constraint were presented in part two. The optimization results with traffic constraint were presented in part three. The contributions of this paper can be summarized as follows. (1) It proposed an effective approach for shortest paths in fire succor based on component GIS technology. This proposed approach can achieve the real-time decisions of shortest paths for fire succor. (2) It applied the ant colony optimization to implement the shortest path decision. The traffic information was considered in the shortest path decision using ant colony optimization. The final application instance suggests that the proposed approach is feasible, correct and valid.

Neighboring extremals of dynamic optimization problems with path equality constraints

NASA Technical Reports Server (NTRS)

Lee, A. Y.

1988-01-01

Neighboring extremals of dynamic optimization problems with path equality constraints and with an unknown parameter vector are considered in this paper. With some simplifications, the problem is reduced to solving a linear, time-varying two-point boundary-value problem with integral path equality constraints. A modified backward sweep method is used to solve this problem. Two example problems are solved to illustrate the validity and usefulness of the solution technique.

Optimization in multi-implant placement for immediate loading in edentulous arches using a modified surgical template and prototyping: a case report.

PubMed

Jayme, Sérgio J; Muglia, Valdir A; de Oliveira, Rafael R; Novaes, Arthur B Júnior

2008-01-01

Immediate loading of dental implants shortens the treatment time and makes it possible to give the patient an esthetic appearance throughout the treatment period. Placement of dental implants requires precise planning that accounts for anatomic limitations and restorative goals. Diagnosis can be made with the assistance of computerized tomographic scanning, but transfer of planning to the surgical field is limited. Recently, novel CAD/CAM techniques such as stereolithographic rapid prototyping have been developed to build surgical guides in an attempt to improve precision of implant placement. The aim of this case report was to show a modified surgical template used throughout implant placement as an alternative to a conventional surgical guide.

Optimization of COS/FUV Spectrum Placement at Lifetime Position 4

NASA Astrophysics Data System (ADS)

De Rosa, Gisella

2017-08-01

We give a summary of the rationale, structure and preliminary analysis of the Lifetime Position 4 (LP4) special calibration program 14841, aimed at determining the optimal placement of the spectra at LP4. The program obtained deep (S/N = 60 per resel) exposures of the standard star WD0308-565 with G130M/1291 and G130M/1222 settings at -2.52" below LP3 in the cross dispersion direction. These particular settings were chosen because they have the widest footprints on the detectors. Science spectra were successfully extracted at this position without any contamination due to gain-sag at LP3.

Cooperative path planning for multi-USV based on improved artificial bee colony algorithm

NASA Astrophysics Data System (ADS)

Cao, Lu; Chen, Qiwei

2018-03-01

Due to the complex constraints, more uncertain factors and critical real-time demand of path planning for multiple unmanned surface vehicle (multi-USV), an improved artificial bee colony (I-ABC) algorithm were proposed to solve the model of cooperative path planning for multi-USV. First the Voronoi diagram of battle field space is conceived to generate the optimal area of USVs paths. Then the chaotic searching algorithm is used to initialize the collection of paths, which is regard as foods of the ABC algorithm. With the limited data, the initial collection can search the optimal area of paths perfectly. Finally simulations of the multi-USV path planning under various threats have been carried out. Simulation results verify that the I-ABC algorithm can improve the diversity of nectar source and the convergence rate of algorithm. It can increase the adaptability of dynamic battlefield and unexpected threats for USV.

Fabrication, characterization, and heuristic trade space exploration of magnetically actuated Miura-Ori origami structures

NASA Astrophysics Data System (ADS)

Cowan, Brett; von Lockette, Paris R.

2017-04-01

The authors develop magnetically actuated Miura-Ori structures through observation, experiment, and computation using an initially heuristic strategy followed by trade space visualization and optimization. The work is novel, especially within origami engineering, in that beyond final target shape approximation, Miura-Ori structures in this work are additionally evaluated for the shape approximation while folding and for their efficient use of their embedded actuators. The structures consisted of neodymium magnets placed on the panels of silicone elastomer substrates cast in the Miura-Ori folding pattern. Initially four configurations, arrangements of magnets on the panels, were selected based on heuristic arguments that (1) maximized the amount of magnetic torque applied to the creases and (2) reduced the number of magnets needed to affect all creases in the pattern. The results of experimental and computational performance metrics were used in a weighted sum model to predict the optimum configuration, which was then fabricated and experimentally characterized for comparison to the initial prototypes. As expected, optimization of magnet placement and orientation was effective at increasing the degree of theoretical useful work. Somewhat unexpectedly, however, trade space results showed that even after optimization, the configuration with the most number of magnets was least effective, per magnet, at directing its actuation to the structure’s creases. Overall, though the winning configuration experimentally outperformed its initial, non-optimal counterparts, results showed that the choice of optimum configuration was heavily dependent on the weighting factors. These results highlight both the ability of the Miura-Ori to be actuated with external magnetic stimuli, the effectiveness of a heuristic design approach that focuses on the actuation mechanism, and the need to address path-dependent metrics in assessing performance in origami folding structures.

Extended shortest path selection for package routing of complex networks

NASA Astrophysics Data System (ADS)

Ye, Fan; Zhang, Lei; Wang, Bing-Hong; Liu, Lu; Zhang, Xing-Yi

The routing strategy plays a very important role in complex networks such as Internet system and Peer-to-Peer networks. However, most of the previous work concentrates only on the path selection, e.g. Flooding and Random Walk, or finding the shortest path (SP) and rarely considering the local load information such as SP and Distance Vector Routing. Flow-based Routing mainly considers load balance and still cannot achieve best optimization. Thus, in this paper, we propose a novel dynamic routing strategy on complex network by incorporating the local load information into SP algorithm to enhance the traffic flow routing optimization. It was found that the flow in a network is greatly affected by the waiting time of the network, so we should not consider only choosing optimized path for package transformation but also consider node congestion. As a result, the packages should be transmitted with a global optimized path with smaller congestion and relatively short distance. Analysis work and simulation experiments show that the proposed algorithm can largely enhance the network flow with the maximum throughput within an acceptable calculating time. The detailed analysis of the algorithm will also be provided for explaining the efficiency.

Simulation based optimized beam velocity in additive manufacturing

NASA Astrophysics Data System (ADS)

Vignat, Frédéric; Béraud, Nicolas; Villeneuve, François

2017-08-01

Manufacturing good parts with additive technologies rely on melt pool dimension and temperature and are controlled by manufacturing strategies often decided on machine side. Strategies are built on beam path and variable energy input. Beam path are often a mix of contour and hatching strategies filling the contours at each slice. Energy input depend on beam intensity and speed and is determined from simple thermal models to control melt pool dimensions and temperature and ensure porosity free material. These models take into account variation in thermal environment such as overhanging surfaces or back and forth hatching path. However not all the situations are correctly handled and precision is limited. This paper proposes new method to determine energy input from full built chamber 3D thermal simulation. Using the results of the simulation, energy is modified to keep melt pool temperature in a predetermined range. The paper present first an experimental method to determine the optimal range of temperature. In a second part the method to optimize the beam speed from the simulation results is presented. Finally, the optimized beam path is tested in the EBM machine and built part are compared with part built with ordinary beam path.

Generalized gradient algorithm for trajectory optimization

NASA Technical Reports Server (NTRS)

Zhao, Yiyuan; Bryson, A. E.; Slattery, R.

1990-01-01

The generalized gradient algorithm presented and verified as a basis for the solution of trajectory optimization problems improves the performance index while reducing path equality constraints, and terminal equality constraints. The algorithm is conveniently divided into two phases, of which the first, 'feasibility' phase yields a solution satisfying both path and terminal constraints, while the second, 'optimization' phase uses the results of the first phase as initial guesses.

A Method to Analyze and Optimize the Load Sharing of Split Path Transmissions

NASA Technical Reports Server (NTRS)

Krantz, Timothy L.

1996-01-01

Split-path transmissions are promising alternatives to the common planetary transmissions for rotorcraft. Heretofore, split-path designs proposed for or used in rotorcraft have featured load-sharing devices that add undesirable weight and complexity to the designs. A method was developed to analyze and optimize the load sharing in split-path transmissions without load-sharing devices. The method uses the clocking angle as a design parameter to optimize for equal load sharing. In addition, the clocking angle tolerance necessary to maintain acceptable load sharing can be calculated. The method evaluates the effects of gear-shaft twisting and bending, tooth bending, Hertzian deformations within bearings, and movement of bearing supports on load sharing. It was used to study the NASA split-path test gearbox and the U.S. Army's Comanche helicopter main rotor gearbox. Acceptable load sharing was found to be achievable and maintainable by using proven manufacturing processes. The analytical results compare favorably to available experimental data.

On the Design of Smart Parking Networks in the Smart Cities: An Optimal Sensor Placement Model

PubMed Central

Bagula, Antoine; Castelli, Lorenzo; Zennaro, Marco

2015-01-01

Smart parking is a typical IoT application that can benefit from advances in sensor, actuator and RFID technologies to provide many services to its users and parking owners of a smart city. This paper considers a smart parking infrastructure where sensors are laid down on the parking spots to detect car presence and RFID readers are embedded into parking gates to identify cars and help in the billing of the smart parking. Both types of devices are endowed with wired and wireless communication capabilities for reporting to a gateway where the situation recognition is performed. The sensor devices are tasked to play one of the three roles: (1) slave sensor nodes located on the parking spot to detect car presence/absence; (2) master nodes located at one of the edges of a parking lot to detect presence and collect the sensor readings from the slave nodes; and (3) repeater sensor nodes, also called “anchor” nodes, located strategically at specific locations in the parking lot to increase the coverage and connectivity of the wireless sensor network. While slave and master nodes are placed based on geographic constraints, the optimal placement of the relay/anchor sensor nodes in smart parking is an important parameter upon which the cost and efficiency of the parking system depends. We formulate the optimal placement of sensors in smart parking as an integer linear programming multi-objective problem optimizing the sensor network engineering efficiency in terms of coverage and lifetime maximization, as well as its economic gain in terms of the number of sensors deployed for a specific coverage and lifetime. We propose an exact solution to the node placement problem using single-step and two-step solutions implemented in the Mosel language based on the Xpress-MPsuite of libraries. Experimental results reveal the relative efficiency of the single-step compared to the two-step model on different performance parameters. These results are consolidated by simulation results, which reveal that our solution outperforms a random placement in terms of both energy consumption, delay and throughput achieved by a smart parking network. PMID:26134104

On the Design of Smart Parking Networks in the Smart Cities: An Optimal Sensor Placement Model.

PubMed

Bagula, Antoine; Castelli, Lorenzo; Zennaro, Marco

2015-06-30

Smart parking is a typical IoT application that can benefit from advances in sensor, actuator and RFID technologies to provide many services to its users and parking owners of a smart city. This paper considers a smart parking infrastructure where sensors are laid down on the parking spots to detect car presence and RFID readers are embedded into parking gates to identify cars and help in the billing of the smart parking. Both types of devices are endowed with wired and wireless communication capabilities for reporting to a gateway where the situation recognition is performed. The sensor devices are tasked to play one of the three roles: (1) slave sensor nodes located on the parking spot to detect car presence/absence; (2) master nodes located at one of the edges of a parking lot to detect presence and collect the sensor readings from the slave nodes; and (3) repeater sensor nodes, also called "anchor" nodes, located strategically at specific locations in the parking lot to increase the coverage and connectivity of the wireless sensor network. While slave and master nodes are placed based on geographic constraints, the optimal placement of the relay/anchor sensor nodes in smart parking is an important parameter upon which the cost and efficiency of the parking system depends. We formulate the optimal placement of sensors in smart parking as an integer linear programming multi-objective problem optimizing the sensor network engineering efficiency in terms of coverage and lifetime maximization, as well as its economic gain in terms of the number of sensors deployed for a specific coverage and lifetime. We propose an exact solution to the node placement problem using single-step and two-step solutions implemented in the Mosel language based on the Xpress-MPsuite of libraries. Experimental results reveal the relative efficiency of the single-step compared to the two-step model on different performance parameters. These results are consolidated by simulation results, which reveal that our solution outperforms a random placement in terms of both energy consumption, delay and throughput achieved by a smart parking network.

Evaluation of a New Backtrack Free Path Planning Algorithm for Manipulators

NASA Astrophysics Data System (ADS)

Islam, Md. Nazrul; Tamura, Shinsuke; Murata, Tomonari; Yanase, Tatsuro

This paper evaluates a newly proposed backtrack free path planning algorithm (BFA) for manipulators. BFA is an exact algorithm, i.e. it is resolution complete. Different from existing resolution complete algorithms, its computation time and memory space are proportional to the number of arms. Therefore paths can be calculated within practical and predetermined time even for manipulators with many arms, and it becomes possible to plan complicated motions of multi-arm manipulators in fully automated environments. The performance of BFA is evaluated for 2-dimensional environments while changing the number of arms and obstacle placements. Its performance under locus and attitude constraints is also evaluated. Evaluation results show that the computation volume of the algorithm is almost the same as the theoretical one, i.e. it increases linearly with the number of arms even in complicated environments. Moreover BFA achieves the constant performance independent of environments.

Singular-Arc Time-Optimal Trajectory of Aircraft in Two-Dimensional Wind Field

NASA Technical Reports Server (NTRS)

Nguyen, Nhan

2006-01-01

This paper presents a study of a minimum time-to-climb trajectory analysis for aircraft flying in a two-dimensional altitude dependent wind field. The time optimal control problem possesses a singular control structure when the lift coefficient is taken as a control variable. A singular arc analysis is performed to obtain an optimal control solution on the singular arc. Using a time-scale separation with the flight path angle treated as a fast state, the dimensionality of the optimal control solution is reduced by eliminating the lift coefficient control. A further singular arc analysis is used to decompose the original optimal control solution into the flight path angle solution and a trajectory solution as a function of the airspeed and altitude. The optimal control solutions for the initial and final climb segments are computed using a shooting method with known starting values on the singular arc The numerical results of the shooting method show that the optimal flight path angle on the initial and final climb segments are constant. The analytical approach provides a rapid means for analyzing a time optimal trajectory for aircraft performance.

Online POMDP Algorithms for Very Large Observation Spaces

DTIC Science & Technology

2017-06-06

stochastic optimization: From sets to paths." In Advances in Neural Information Processing Systems, pp. 1585- 1593 . 2015. • Luo, Yuanfu, Haoyu Bai...and Wee Sun Lee. "Adaptive stochastic optimization: From sets to paths." In Advances in Neural Information Processing Systems, pp. 1585- 1593 . 2015

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.

Robust Path Planning and Feedback Design Under Stochastic Uncertainty

NASA Technical Reports Server (NTRS)

Blackmore, Lars

2008-01-01

Autonomous vehicles require optimal path planning algorithms to achieve mission goals while avoiding obstacles and being robust to uncertainties. The uncertainties arise from exogenous disturbances, modeling errors, and sensor noise, which can be characterized via stochastic models. Previous work defined a notion of robustness in a stochastic setting by using the concept of chance constraints. This requires that mission constraint violation can occur with a probability less than a prescribed value.In this paper we describe a novel method for optimal chance constrained path planning with feedback design. The approach optimizes both the reference trajectory to be followed and the feedback controller used to reject uncertainty. Our method extends recent results in constrained control synthesis based on convex optimization to solve control problems with nonconvex constraints. This extension is essential for path planning problems, which inherently have nonconvex obstacle avoidance constraints. Unlike previous approaches to chance constrained path planning, the new approach optimizes the feedback gain as wellas the reference trajectory.The key idea is to couple a fast, nonconvex solver that does not take into account uncertainty, with existing robust approaches that apply only to convex feasible regions. By alternating between robust and nonrobust solutions, the new algorithm guarantees convergence to a global optimum. We apply the new method to an unmanned aircraft and show simulation results that demonstrate the efficacy of the approach.

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.

Path Searching Based Fault Automated Recovery Scheme for Distribution Grid with DG

NASA Astrophysics Data System (ADS)

Xia, Lin; Qun, Wang; Hui, Xue; Simeng, Zhu

2016-12-01

Applying the method of path searching based on distribution network topology in setting software has a good effect, and the path searching method containing DG power source is also applicable to the automatic generation and division of planned islands after the fault. This paper applies path searching algorithm in the automatic division of planned islands after faults: starting from the switch of fault isolation, ending in each power source, and according to the line load that the searching path traverses and the load integrated by important optimized searching path, forming optimized division scheme of planned islands that uses each DG as power source and is balanced to local important load. Finally, COBASE software and distribution network automation software applied are used to illustrate the effectiveness of the realization of such automatic restoration program.

Optimism and depression: a new look at social support as a mediator among women at risk for breast cancer.

PubMed

Garner, Melissa J; McGregor, Bonnie A; Murphy, Karly M; Koenig, Alex L; Dolan, Emily D; Albano, Denise

2015-12-01

Breast cancer risk is a chronic stressor associated with depression. Optimism is associated with lower levels of depression among breast cancer survivors. However, to our knowledge, no studies have explored the relationship between optimism and depression among women at risk for breast cancer. We hypothesized that women at risk for breast cancer who have higher levels of optimism would report lower levels of depression and that social support would mediate this relationship. Participants (N = 199) with elevated distress were recruited from the community and completed self-report measures of depression, optimism, and social support. Participants were grouped based on their family history of breast cancer. Path analysis was used to examine the cross-sectional relationship between optimism, social support, and depressive symptoms in each group. Results indicated that the variance in depressive symptoms was partially explained through direct paths from optimism and social support among women with a family history of breast cancer. The indirect path from optimism to depressive symptoms via social support was significant (β = -.053; 90% CI = -.099 to -.011, p = .037) in this group. However, among individuals without a family history of breast cancer, the indirect path from optimism to depressive symptoms via social support was not significant. These results suggest that social support partially mediates the relationship between optimism and depression among women at risk for breast cancer. Social support may be an important intervention target to reduce depression among women at risk for breast cancer. Copyright © 2015 John Wiley & Sons, Ltd.

An improved hierarchical A * algorithm in the optimization of parking lots

NASA Astrophysics Data System (ADS)

Wang, Yong; Wu, Junjuan; Wang, Ying

2017-08-01

In the parking lot parking path optimization, the traditional evaluation index is the shortest distance as the best index and it does not consider the actual road conditions. Now, the introduction of a more practical evaluation index can not only simplify the hardware design of the boot system but also save the software overhead. Firstly, we establish the parking lot network graph RPCDV mathematical model and all nodes in the network is divided into two layers which were constructed using different evaluation function base on the improved hierarchical A * algorithm which improves the time optimal path search efficiency and search precision of the evaluation index. The final results show that for different sections of the program attribute parameter algorithm always faster the time to find the optimal path.

Study on the optimum tilted angle of solar panels in Hainan tropical photovoltaic facility agricultural system

NASA Astrophysics Data System (ADS)

Wang, Jingxuan; Ge, Zhiwu; Yang, Xiaoyan; Ye, Chunhua; Lin, Yanxia

2017-04-01

Photovoltaic facility agriculture system can effectively alleviate the contradiction between limited land and Photovoltaic power generation. It’s flexible to create suitable environment for crop growth, and generate electricity over the same land at the same time. It’s necessary to set appropriate solar panel angle to get more solar energy. Through detailed analysis and comparison, we chose the Hay’s model as solar radiation model. Based on the official meteorological data got from Haikou Meteorological Bureau, and by comparing the amount of radiation obtained at different tilted angles per month, the optimal placement angle of PV panels at different seasons in Haikou was obtained through calculation, and the optimal placement angle from April to October was also obtained. Through optimized angle and arrangement of solar photovoltaic panels, we can get greater power efficiency.

OPTIMAL WELL LOCATOR (OWL): A SCREENING TOOL FOR EVALUATING LOCATIONS OF MONITORING WELLS: USER'S GUIDE VERSION 1.2

EPA Science Inventory

The Optimal Well Locator ( OWL) program was designed and developed by USEPA to be a screening tool to evaluate and optimize the placement of wells in long term monitoring networks at small sites. The first objective of the OWL program is to allow the user to visualize the change ...

Comparison of Genetic Algorithm and Hill Climbing for Shortest Path Optimization Mapping

NASA Astrophysics Data System (ADS)

Fronita, Mona; Gernowo, Rahmat; Gunawan, Vincencius

2018-02-01

Traveling Salesman Problem (TSP) is an optimization to find the shortest path to reach several destinations in one trip without passing through the same city and back again to the early departure city, the process is applied to the delivery systems. This comparison is done using two methods, namely optimization genetic algorithm and hill climbing. Hill Climbing works by directly selecting a new path that is exchanged with the neighbour's to get the track distance smaller than the previous track, without testing. Genetic algorithms depend on the input parameters, they are the number of population, the probability of crossover, mutation probability and the number of generations. To simplify the process of determining the shortest path supported by the development of software that uses the google map API. Tests carried out as much as 20 times with the number of city 8, 16, 24 and 32 to see which method is optimal in terms of distance and time computation. Based on experiments conducted with a number of cities 3, 4, 5 and 6 producing the same value and optimal distance for the genetic algorithm and hill climbing, the value of this distance begins to differ with the number of city 7. The overall results shows that these tests, hill climbing are more optimal to number of small cities and the number of cities over 30 optimized using genetic algorithms.

Optimal sensor placement for modal testing on wind turbines

NASA Astrophysics Data System (ADS)

Schulze, Andreas; Zierath, János; Rosenow, Sven-Erik; Bockhahn, Reik; Rachholz, Roman; Woernle, Christoph

2016-09-01

The mechanical design of wind turbines requires a profound understanding of the dynamic behaviour. Even though highly detailed simulation models are already in use to support wind turbine design, modal testing on a real prototype is irreplaceable to identify site-specific conditions such as the stiffness of the tower foundation. Correct identification of the mode shapes of a complex mechanical structure much depends on the placement of the sensors. For operational modal analysis of a 3 MW wind turbine with a 120 m rotor on a 100 m tower developed by W2E Wind to Energy, algorithms for optimal placement of acceleration sensors are applied. The mode shapes used for the optimisation are calculated by means of a detailed flexible multibody model of the wind turbine. Among the three algorithms in this study, the genetic algorithm with weighted off-diagonal criterion yields the sensor configuration with the highest quality. The ongoing measurements on the prototype will be the basis for the development of optimised wind turbine designs.

Automated Fiber Placement of PEEK/IM7 Composites with Film Interleaf Layers

NASA Technical Reports Server (NTRS)

Hulcher, A. Bruce; Banks, William I., III; Pipes, R. Byron; Tiwari, Surendra N.; Cano, Roberto J.; Johnston, Norman J.; Clinton, R. G., Jr. (Technical Monitor)

2001-01-01

The incorporation of thin discrete layers of resin between plies (interleafing) has been shown to improve fatigue and impact properties of structural composite materials. Furthermore, interleafing could be used to increase the barrier properties of composites used as structural materials for cryogenic propellant storage. In this work, robotic heated-head tape placement of PEEK/IM7 composites containing a PEEK polymer film interleaf was investigated. These experiments were carried out at the NASA Langley Research Center automated fiber placement facility. Using the robotic equipment, an optimal fabrication process was developed for the composite without the interleaf. Preliminary interleaf processing trials indicated that a two-stage process was necessary; the film had to be tacked to the partially-placed laminate then fully melted in a separate operation. Screening experiments determined the relative influence of the various robotic process variables on the peel strength of the film-composite interface. Optimization studies were performed in which peel specimens were fabricated at various compaction loads and roller temperatures at each of three film melt processing rates. The resulting data were fitted with quadratic response surfaces. Additional specimens were fabricated at placement parameters predicted by the response surface models to yield high peel strength in an attempt to gage the accuracy of the predicted response and assess the repeatability of the process. The overall results indicate that quality PEEK/lM7 laminates having film interleaves can be successfully and repeatability fabricated by heated head automated fiber placement.

A risk-based multi-objective model for optimal placement of sensors in water distribution system

NASA Astrophysics Data System (ADS)

Naserizade, Sareh S.; Nikoo, Mohammad Reza; Montaseri, Hossein

2018-02-01

In this study, a new stochastic model based on Conditional Value at Risk (CVaR) and multi-objective optimization methods is developed for optimal placement of sensors in water distribution system (WDS). This model determines minimization of risk which is caused by simultaneous multi-point contamination injection in WDS using CVaR approach. The CVaR considers uncertainties of contamination injection in the form of probability distribution function and calculates low-probability extreme events. In this approach, extreme losses occur at tail of the losses distribution function. Four-objective optimization model based on NSGA-II algorithm is developed to minimize losses of contamination injection (through CVaR of affected population and detection time) and also minimize the two other main criteria of optimal placement of sensors including probability of undetected events and cost. Finally, to determine the best solution, Preference Ranking Organization METHod for Enrichment Evaluation (PROMETHEE), as a subgroup of Multi Criteria Decision Making (MCDM) approach, is utilized to rank the alternatives on the trade-off curve among objective functions. Also, sensitivity analysis is done to investigate the importance of each criterion on PROMETHEE results considering three relative weighting scenarios. The effectiveness of the proposed methodology is examined through applying it to Lamerd WDS in the southwestern part of Iran. The PROMETHEE suggests 6 sensors with suitable distribution that approximately cover all regions of WDS. Optimal values related to CVaR of affected population and detection time as well as probability of undetected events for the best optimal solution are equal to 17,055 persons, 31 mins and 0.045%, respectively. The obtained results of the proposed methodology in Lamerd WDS show applicability of CVaR-based multi-objective simulation-optimization model for incorporating the main uncertainties of contamination injection in order to evaluate extreme value of losses in WDS.

A new optimal seam method for seamless image stitching

NASA Astrophysics Data System (ADS)

Xue, Jiale; Chen, Shengyong; Cheng, Xu; Han, Ying; Zhao, Meng

2017-07-01

A novel optimal seam method which aims to stitch those images with overlapping area more seamlessly has been propos ed. Considering the traditional gradient domain optimal seam method and fusion algorithm result in bad color difference measurement and taking a long time respectively, the input images would be converted to HSV space and a new energy function is designed to seek optimal stitching path. To smooth the optimal stitching path, a simplified pixel correction and weighted average method are utilized individually. The proposed methods exhibit performance in eliminating the stitching seam compared with the traditional gradient optimal seam and high efficiency with multi-band blending algorithm.

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

Metal Big Area Additive Manufacturing: Process Modeling and Validation

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

Simunovic, Srdjan; Nycz, Andrzej; Noakes, Mark W

Metal Big Area Additive Manufacturing (mBAAM) is a new additive manufacturing (AM) technology for printing large-scale 3D objects. mBAAM is based on the gas metal arc welding process and uses a continuous feed of welding wire to manufacture an object. An electric arc forms between the wire and the substrate, which melts the wire and deposits a bead of molten metal along the predetermined path. In general, the welding process parameters and local conditions determine the shape of the deposited bead. The sequence of the bead deposition and the corresponding thermal history of the manufactured object determine the long rangemore » effects, such as thermal-induced distortions and residual stresses. Therefore, the resulting performance or final properties of the manufactured object are dependent on its geometry and the deposition path, in addition to depending on the basic welding process parameters. Physical testing is critical for gaining the necessary knowledge for quality prints, but traversing the process parameter space in order to develop an optimized build strategy for each new design is impractical by pure experimental means. Computational modeling and optimization may accelerate development of a build process strategy and saves time and resources. Because computational modeling provides these opportunities, we have developed a physics-based Finite Element Method (FEM) simulation framework and numerical models to support the mBAAM process s development and design. In this paper, we performed a sequentially coupled heat transfer and stress analysis for predicting the final deformation of a small rectangular structure printed using the mild steel welding wire. Using the new simulation technologies, material was progressively added into the FEM simulation as the arc weld traversed the build path. In the sequentially coupled heat transfer and stress analysis, the heat transfer was performed to calculate the temperature evolution, which was used in a stress analysis to evaluate the residual stresses and distortions. In this formulation, we assume that physics is directionally coupled, i.e. the effect of stress of the component on the temperatures is negligible. The experiment instrumentation (measurement types, sensor types, sensor locations, sensor placements, measurement intervals) and the measurements are presented. The temperatures and distortions from the simulations show good correlation with experimental measurements. Ongoing modeling work is also briefly discussed.« less

The Role of Echocardiography in the Optimization of Cardiac Resynchronization Therapy: Current Evidence and Future Perspectives.

PubMed

Spartalis, Michael; Tzatzaki, Eleni; Spartalis, Eleftherios; Damaskos, Christos; Athanasiou, Antonios; Livanis, Efthimios; Voudris, Vassilis

2017-01-01

Cardiac resynchronization therapy (CRT) has become a mainstay in the management of heart failure. Up to one-third of patients who received resynchronization devices do not experience the full benefits of CRT. The clinical factors influencing the likelihood to respond to the therapy are wide QRS complex, left bundle branch block, female gender, non-ischaemic cardiomyopathy (highest responders), male gender, ischaemic cardiomyopathy (moderate responders) and narrow QRS complex, non-left bundle branch block (lowest, non-responders). This review provides a conceptual description of the role of echocardiography in the optimization of CRT. A literature survey was performed using PubMed database search to gather information regarding CRT and echocardiography. A total of 70 studies met selection criteria for inclusion in the review. Echocardiography helps in the initial selection of the patients with dyssynchrony, which will benefit the most from optimal biventricular pacing and provides a guide to left ventricular (LV) lead placement during implantation. Different echocardiographic parameters have shown promise and can offer the possibility of patient selection, response prediction, lead placement optimization strategies and optimization of device configurations. LV ejection fraction along with specific electrocardiographic criteria remains the cornerstone of CRT patient selection. Echocardiography is a non-invasive, cost-effective, highly reproducible method with certain limitations and accuracy that is affected by measurement errors. Echocardiography can assist with the identification of the appropriate electromechanical substrate of CRT response and LV lead placement. The targeted approach can improve the haemodynamic response, as also the patient-specific parameters estimation.

The Role of Echocardiography in the Optimization of Cardiac Resynchronization Therapy: Current Evidence and Future Perspectives

PubMed Central

Spartalis, Michael; Tzatzaki, Eleni; Spartalis, Eleftherios; Damaskos, Christos; Athanasiou, Antonios; Livanis, Efthimios; Voudris, Vassilis

2017-01-01

Background: Cardiac resynchronization therapy (CRT) has become a mainstay in the management of heart failure. Up to one-third of patients who received resynchronization devices do not experience the full benefits of CRT. The clinical factors influencing the likelihood to respond to the therapy are wide QRS complex, left bundle branch block, female gender, non-ischaemic cardiomyopathy (highest responders), male gender, ischaemic cardiomyopathy (moderate responders) and narrow QRS complex, non-left bundle branch block (lowest, non-responders). Objective: This review provides a conceptual description of the role of echocardiography in the optimization of CRT. Method: A literature survey was performed using PubMed database search to gather information regarding CRT and echocardiography. Results: A total of 70 studies met selection criteria for inclusion in the review. Echocardiography helps in the initial selection of the patients with dyssynchrony, which will benefit the most from optimal biventricular pacing and provides a guide to left ventricular (LV) lead placement during implantation. Different echocardiographic parameters have shown promise and can offer the possibility of patient selection, response prediction, lead placement optimization strategies and optimization of device configurations. Conclusion: LV ejection fraction along with specific electrocardiographic criteria remains the cornerstone of CRT patient selection. Echocardiography is a non-invasive, cost-effective, highly reproducible method with certain limitations and accuracy that is affected by measurement errors. Echocardiography can assist with the identification of the appropriate electromechanical substrate of CRT response and LV lead placement. The targeted approach can improve the haemodynamic response, as also the patient-specific parameters estimation. PMID:29387277

Formulation and Optimization of Robust Sensor Placement Problems for Drinking Water Contamination Warning Systems

DOE PAGES

Watson, Jean-Paul; Murray, Regan; Hart, William E.

2009-11-13

We report that the sensor placement problem in contamination warning system design for municipal water distribution networks involves maximizing the protection level afforded by limited numbers of sensors, typically quantified as the expected impact of a contamination event; the issue of how to mitigate against high-consequence events is either handled implicitly or ignored entirely. Consequently, expected-case sensor placements run the risk of failing to protect against high-consequence 9/11-style attacks. In contrast, robust sensor placements address this concern by focusing strictly on high-consequence events and placing sensors to minimize the impact of these events. We introduce several robust variations of themore » sensor placement problem, distinguished by how they quantify the potential damage due to high-consequence events. We explore the nature of robust versus expected-case sensor placements on three real-world large-scale distribution networks. We find that robust sensor placements can yield large reductions in the number and magnitude of high-consequence events, with only modest increases in expected impact. Finally, the ability to trade-off between robust and expected-case impacts is a key unexplored dimension in contamination warning system design.« less

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.

Modified dwell time optimization model and its applications in subaperture polishing.

PubMed

Dong, Zhichao; Cheng, Haobo; Tam, Hon-Yuen

2014-05-20

The optimization of dwell time is an important procedure in deterministic subaperture polishing. We present a modified optimization model of dwell time by iterative and numerical method, assisted by extended surface forms and tool paths for suppressing the edge effect. Compared with discrete convolution and linear equation models, the proposed model has essential compatibility with arbitrary tool paths, multiple tool influence functions (TIFs) in one optimization, and asymmetric TIFs. The emulational fabrication of a Φ200  mm workpiece by the proposed model yields a smooth, continuous, and non-negative dwell time map with a root-mean-square (RMS) convergence rate of 99.6%, and the optimization costs much less time. By the proposed model, influences of TIF size and path interval to convergence rate and polishing time are optimized, respectively, for typical low and middle spatial-frequency errors. Results show that (1) the TIF size is nonlinear inversely proportional to convergence rate and polishing time. A TIF size of ~1/7 workpiece size is preferred; (2) the polishing time is less sensitive to path interval, but increasing the interval markedly reduces the convergence rate. A path interval of ~1/8-1/10 of the TIF size is deemed to be appropriate. The proposed model is deployed on a JR-1800 and MRF-180 machine. Figuring results of Φ920  mm Zerodur paraboloid and Φ100  mm Zerodur plane by them yield RMS of 0.016λ and 0.013λ (λ=632.8  nm), respectively, and thereby validate the feasibility of proposed dwell time model used for subaperture polishing.

Data centers as dispatchable loads to harness stranded power

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

Kim, Kibaek; Yang, Fan; Zavala, Victor M.

Here, we analyze how traditional data center placement and optimal placement of dispatchable data centers affect power grid efficiency. We use detailed network models, stochastic optimization formulations, and diverse renewable generation scenarios to perform our analysis. Our results reveal that significant spillage and stranded power will persist in power grids as wind power levels are increased. A counter-intuitive finding is that collocating data centers with inflexible loads next to wind farms has limited impacts on renewable portfolio standard (RPS) goals because it provides limited system-level flexibility. Such an approach can, in fact, increase stranded power and fossil-fueled generation. In contrast,more » optimally placing data centers that are dispatchable provides system-wide flexibility, reduces stranded power, and improves efficiency. In short, optimally placed dispatchable computing loads can enable better scaling to high RPS. In our case study, we find that these dispatchable computing loads are powered to 60-80% of their requested capacity, indicating that there are significant economic incentives provided by stranded power.« less

Data centers as dispatchable loads to harness stranded power

DOE PAGES

Kim, Kibaek; Yang, Fan; Zavala, Victor M.; ...

2016-07-20

Here, we analyze how traditional data center placement and optimal placement of dispatchable data centers affect power grid efficiency. We use detailed network models, stochastic optimization formulations, and diverse renewable generation scenarios to perform our analysis. Our results reveal that significant spillage and stranded power will persist in power grids as wind power levels are increased. A counter-intuitive finding is that collocating data centers with inflexible loads next to wind farms has limited impacts on renewable portfolio standard (RPS) goals because it provides limited system-level flexibility. Such an approach can, in fact, increase stranded power and fossil-fueled generation. In contrast,more » optimally placing data centers that are dispatchable provides system-wide flexibility, reduces stranded power, and improves efficiency. In short, optimally placed dispatchable computing loads can enable better scaling to high RPS. In our case study, we find that these dispatchable computing loads are powered to 60-80% of their requested capacity, indicating that there are significant economic incentives provided by stranded power.« less

ACTS Ka-band Propagation Research in a Spatially Diversified Network with Two USAT Ground Stations

NASA Technical Reports Server (NTRS)

Kalu, Alex; Acousta, R.; Durand, S.; Emrich, Carol; Ventre, G.; Wilson, W.

1999-01-01

Congestion in the radio spectrum below 18 GHz is stimulating greater interest in the Ka (20/30 GHz) frequency band. Transmission at these shorter wavelengths is greatly influenced by rain resulting in signal attenuation and decreased link availability. The size and projected cost of Ultra Small Aperture Terminals (USATS) make site diversity methodology attractive for rain fade compensation. Separation distances between terminals must be small to be of interest commercially. This study measures diversity gain at a separation distance <5 km and investigates utilization of S-band weather radar reflectivity in predicting diversity gain. Two USAT ground stations, separated by 2.43 km for spatial diversity, received a continuous Ka-band tone sent from NASA Glenn Research Center via the Advanced Communications Technology Satellite (ACTS) steerable antenna beam. Received signal power and rainfall were measured, and Weather Surveillance Radar-1998 Doppler (WSR-88D) data were obtained as a measure of precipitation along the USAT-to-ACTS slant path. Signal attenuation was compared for the two sites, and diversity gain was calculated for fades measured on eleven days. Correlation of WSR-88D S-band reflectivity with measured Ka-band attenuation consisted of locating radar volume elements along each slant path, converting reflectivity to Ka-band attenuation with rain rate calculation as an intermediate step. Specific attenuation for each associated path segment was summed, resulting in total attenuation along the slant path. Derived Ka-band attenuation did not correlate closely with empirical data (r = 0.239), but a measured signal fade could be matched with an increase in radar reflectivity in all fade events. Applying a low pass filter to radar reflectivity prior to deriving Ka-band attenuation improved the correlation between measured and derived signal attenuation (r = 0.733). Results indicate that site diversity at small separation distances is a viable means of rain fade compensation, and that existing models underestimate diversity gain for a subtropical climate such as Florida. Also, filtered WSR-88D reflectivity can be used for optimizing diversity terminal placement by comparing derived Ka- band attenuation between the diversity sites.

Optimal Robust Motion Controller Design Using Multiobjective Genetic Algorithm

PubMed Central

Svečko, Rajko

2014-01-01

This paper describes the use of a multiobjective genetic algorithm for robust motion controller design. Motion controller structure is based on a disturbance observer in an RIC framework. The RIC approach is presented in the form with internal and external feedback loops, in which an internal disturbance rejection controller and an external performance controller must be synthesised. This paper involves novel objectives for robustness and performance assessments for such an approach. Objective functions for the robustness property of RIC are based on simple even polynomials with nonnegativity conditions. Regional pole placement method is presented with the aims of controllers' structures simplification and their additional arbitrary selection. Regional pole placement involves arbitrary selection of central polynomials for both loops, with additional admissible region of the optimized pole location. Polynomial deviation between selected and optimized polynomials is measured with derived performance objective functions. A multiobjective function is composed of different unrelated criteria such as robust stability, controllers' stability, and time-performance indexes of closed loops. The design of controllers and multiobjective optimization procedure involve a set of the objectives, which are optimized simultaneously with a genetic algorithm—differential evolution. PMID:24987749

Robust Video Stabilization Using Particle Keypoint Update and l1-Optimized Camera Path

PubMed Central

Jeon, Semi; Yoon, Inhye; Jang, Jinbeum; Yang, Seungji; Kim, Jisung; Paik, Joonki

2017-01-01

Acquisition of stabilized video is an important issue for various type of digital cameras. This paper presents an adaptive camera path estimation method using robust feature detection to remove shaky artifacts in a video. The proposed algorithm consists of three steps: (i) robust feature detection using particle keypoints between adjacent frames; (ii) camera path estimation and smoothing; and (iii) rendering to reconstruct a stabilized video. As a result, the proposed algorithm can estimate the optimal homography by redefining important feature points in the flat region using particle keypoints. In addition, stabilized frames with less holes can be generated from the optimal, adaptive camera path that minimizes a temporal total variation (TV). The proposed video stabilization method is suitable for enhancing the visual quality for various portable cameras and can be applied to robot vision, driving assistant systems, and visual surveillance systems. PMID:28208622

Optimization of carbon mitigation paths in the power sector of Shenzhen, China

NASA Astrophysics Data System (ADS)

Li, Xin; Hu, Guangxiao; Duan, Ying; Ji, Junping

2017-08-01

This paper studied the carbon mitigation paths of the power sector in Shenzhen, China from a supply-side perspective. We investigated the carbon mitigation potentials and investments of seventeen mitigation technologies in the power sector, and employed a linear programming method to optimize the mitigation paths. The results show that: 1) The total carbon mitigation potential is 5.95 MtCO2 in 2020 in which the adjustment of power supply structure, technical improvements of existing coal- and gas-fired power plant account for 87.5%,6.5% and 6.0%, respectively. 2) In the optimal path, the avoided carbon dioxide to meet the local government’s mitigation goal in power sector is 1.26 MtCO2.The adjustment of power supply structure and technical improvement of the coal-fired power plants are the driving factors of carbon mitigation, with contributions to total carbon mitigation are 72.6% and 27.4%, respectively.

A medical/vocational case coordination system for persons with brain injury: an evaluation of employment outcomes.

PubMed

Malec, J F; Buffington, A L; Moessner, A M; Degiorgio, L

2000-08-01

To evaluate initial placement and 1-year employment outcomes of a Medical/Vocational Case Coordination System (MVCCS) for persons with brain injury (BI) that provides: (1) early case identification and coordination, (2) appropriate medical and vocational rehabilitation interventions, (3) work trials, and (4) supported employment interventions including job coaching. One hundred fourteen Minnesota residents, ages 18 to 65 years, with acquired BI. Five levels of Vocational Independence Scale (VIS). Preinjury employment status (VIS) and years of education, severity of initial injury, time since injury, current impairment/disability as measured by the Rasch-analyzed Staff Mayo-Portland Adaptability Inventory (MPAI), and impaired self-awareness measured by staff rating and the difference between Staff MPAI and Survivor MPAI. At placement, 46% in independent work; 25% in transitional placements; 9% in long-term supported employment; 10% in sheltered work; and 10% not placed. At 1-year follow-up (n = 101), 53% in independent work; 19% in transitional placement; 9% in supported work; 6% in sheltered work; and 13% unemployed. Regression analyses showed time since injury and Rasch Staff MPAI predicted VIS at placement; only VIS at placement independently predicted VIS at 1-year follow-up; Rasch Staff MPAI and preinjury education level predicted time to placement. The MVCCS optimized vocational outcome after BI. Time since injury and impairment/disability best predicted vocational placement. Level of initial placement best predicted employment status at follow-up. Persons with greater disability required more extended time and more extensive rehabilitation services before placement.

Predictor laws for pictorial flight displays

NASA Technical Reports Server (NTRS)

Grunwald, A. J.

1985-01-01

Two predictor laws are formulated and analyzed: (1) a circular path law based on constant accelerations perpendicular to the path and (2) a predictor law based on state transition matrix computations. It is shown that for both methods the predictor provides the essential lead zeros for the path-following task. However, in contrast to the circular path law, the state transition matrix law furnishes the system with additional zeros that entirely cancel out the higher-frequency poles of the vehicle dynamics. On the other hand, the circular path law yields a zero steady-state error in following a curved trajectory with a constant radius. A combined predictor law is suggested that utilizes the advantages of both methods. A simple analysis shows that the optimal prediction time mainly depends on the level of precision required in the path-following task, and guidelines for determining the optimal prediction time are given.

Multi-hop path tracing of mobile robot with multi-range image

NASA Astrophysics Data System (ADS)

Choudhury, Ramakanta; Samal, Chandrakanta; Choudhury, Umakanta

2010-02-01

It is well known that image processing depends heavily upon image representation technique . This paper intends to find out the optimal path of mobile robots for a specified area where obstacles are predefined as well as modified. Here the optimal path is represented by using the Quad tree method. Since there has been rising interest in the use of quad tree, we have tried to use the successive subdivision of images into quadrants from which the quad tree is developed. In the quad tree, obstacles-free area and the partial filled area are represented with different notations. After development of quad tree the algorithm is used to find the optimal path by employing neighbor finding technique, with a view to move the robot from the source to destination. The algorithm, here , permeates through the entire tree, and tries to locate the common ancestor for computation. The computation and the algorithm, aim at easing the ability of the robot to trace the optimal path with the help of adjacencies between the neighboring nodes as well as determining such adjacencies in the horizontal, vertical and diagonal directions. In this paper efforts have been made to determine the movement of the adjacent block in the quad tree and to detect the transition between the blocks equal size and finally generate the result.

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.

Finite element analysis and genetic algorithm optimization design for the actuator placement on a large adaptive structure

NASA Astrophysics Data System (ADS)

Sheng, Lizeng

The dissertation focuses on one of the major research needs in the area of adaptive/intelligent/smart structures, the development and application of finite element analysis and genetic algorithms for optimal design of large-scale adaptive structures. We first review some basic concepts in finite element method and genetic algorithms, along with the research on smart structures. Then we propose a solution methodology for solving a critical problem in the design of a next generation of large-scale adaptive structures---optimal placements of a large number of actuators to control thermal deformations. After briefly reviewing the three most frequently used general approaches to derive a finite element formulation, the dissertation presents techniques associated with general shell finite element analysis using flat triangular laminated composite elements. The element used here has three nodes and eighteen degrees of freedom and is obtained by combining a triangular membrane element and a triangular plate bending element. The element includes the coupling effect between membrane deformation and bending deformation. The membrane element is derived from the linear strain triangular element using Cook's transformation. The discrete Kirchhoff triangular (DKT) element is used as the plate bending element. For completeness, a complete derivation of the DKT is presented. Geometrically nonlinear finite element formulation is derived for the analysis of adaptive structures under the combined thermal and electrical loads. Next, we solve the optimization problems of placing a large number of piezoelectric actuators to control thermal distortions in a large mirror in the presence of four different thermal loads. We then extend this to a multi-objective optimization problem of determining only one set of piezoelectric actuator locations that can be used to control the deformation in the same mirror under the action of any one of the four thermal loads. A series of genetic algorithms, GA Version 1, 2 and 3, were developed to find the optimal locations of piezoelectric actuators from the order of 1021 ˜ 1056 candidate placements. Introducing a variable population approach, we improve the flexibility of selection operation in genetic algorithms. Incorporating mutation and hill climbing into micro-genetic algorithms, we are able to develop a more efficient genetic algorithm. Through extensive numerical experiments, we find that the design search space for the optimal placements of a large number of actuators is highly multi-modal and that the most distinct nature of genetic algorithms is their robustness. They give results that are random but with only a slight variability. The genetic algorithms can be used to get adequate solution using a limited number of evaluations. To get the highest quality solution, multiple runs including different random seed generators are necessary. The investigation time can be significantly reduced using a very coarse grain parallel computing. Overall, the methodology of using finite element analysis and genetic algorithm optimization provides a robust solution approach for the challenging problem of optimal placements of a large number of actuators in the design of next generation of adaptive structures.

Interactive Learning Environment for Bio-Inspired Optimization Algorithms for UAV Path Planning

ERIC Educational Resources Information Center

Duan, Haibin; Li, Pei; Shi, Yuhui; Zhang, Xiangyin; Sun, Changhao

2015-01-01

This paper describes the development of BOLE, a MATLAB-based interactive learning environment, that facilitates the process of learning bio-inspired optimization algorithms, and that is dedicated exclusively to unmanned aerial vehicle path planning. As a complement to conventional teaching methods, BOLE is designed to help students consolidate the…

Optimizing Retransmission Threshold in Wireless Sensor Networks

PubMed Central

Bi, Ran; Li, Yingshu; Tan, Guozhen; Sun, Liang

2016-01-01

The retransmission threshold in wireless sensor networks is critical to the latency of data delivery in the networks. However, existing works on data transmission in sensor networks did not consider the optimization of the retransmission threshold, and they simply set the same retransmission threshold for all sensor nodes in advance. The method did not take link quality and delay requirement into account, which decreases the probability of a packet passing its delivery path within a given deadline. This paper investigates the problem of finding optimal retransmission thresholds for relay nodes along a delivery path in a sensor network. The object of optimizing retransmission thresholds is to maximize the summation of the probability of the packet being successfully delivered to the next relay node or destination node in time. A dynamic programming-based distributed algorithm for finding optimal retransmission thresholds for relay nodes along a delivery path in the sensor network is proposed. The time complexity is OnΔ·max1≤i≤n{ui}, where ui is the given upper bound of the retransmission threshold of sensor node i in a given delivery path, n is the length of the delivery path and Δ is the given upper bound of the transmission delay of the delivery path. If Δ is greater than the polynomial, to reduce the time complexity, a linear programming-based (1+pmin)-approximation algorithm is proposed. Furthermore, when the ranges of the upper and lower bounds of retransmission thresholds are big enough, a Lagrange multiplier-based distributed O(1)-approximation algorithm with time complexity O(1) is proposed. Experimental results show that the proposed algorithms have better performance. PMID:27171092

Depth Optimization Study

DOE Data Explorer

Kawase, Mitsuhiro

2009-11-22

The zipped file contains a directory of data and routines used in the NNMREC turbine depth optimization study (Kawase et al., 2011), and calculation results thereof. For further info, please contact Mitsuhiro Kawase at kawase@uw.edu. Reference: Mitsuhiro Kawase, Patricia Beba, and Brian Fabien (2011), Finding an Optimal Placement Depth for a Tidal In-Stream Conversion Device in an Energetic, Baroclinic Tidal Channel, NNMREC Technical Report.

Application of cellular automatons and ant algorithms in avionics

NASA Astrophysics Data System (ADS)

Kuznetsov, A. V.; Selvesiuk, N. I.; Platoshin, G. A.; Semenova, E. V.

2018-03-01

The paper considers two algorithms for searching quasi-optimal solutions of discrete optimization problems with regard to the tasks of avionics placing. The first one solves the problem of optimal placement of devices by installation locations, the second one is for the problem of finding the shortest route between devices. Solutions are constructed using a cellular automaton and the ant colony algorithm.

Optimal Magnetic Sensor Vests for Cardiac Source Imaging

PubMed Central

Lau, Stephan; Petković, Bojana; Haueisen, Jens

2016-01-01

Magnetocardiography (MCG) non-invasively provides functional information about the heart. New room-temperature magnetic field sensors, specifically magnetoresistive and optically pumped magnetometers, have reached sensitivities in the ultra-low range of cardiac fields while allowing for free placement around the human torso. Our aim is to optimize positions and orientations of such magnetic sensors in a vest-like arrangement for robust reconstruction of the electric current distributions in the heart. We optimized a set of 32 sensors on the surface of a torso model with respect to a 13-dipole cardiac source model under noise-free conditions. The reconstruction robustness was estimated by the condition of the lead field matrix. Optimization improved the condition of the lead field matrix by approximately two orders of magnitude compared to a regular array at the front of the torso. Optimized setups exhibited distributions of sensors over the whole torso with denser sampling above the heart at the front and back of the torso. Sensors close to the heart were arranged predominantly tangential to the body surface. The optimized sensor setup could facilitate the definition of a standard for sensor placement in MCG and the development of a wearable MCG vest for clinical diagnostics. PMID:27231910

Robust Accurate Non-Invasive Analyte Monitor

DOEpatents

Robinson, Mark R.

1998-11-03

An improved method and apparatus for determining noninvasively and in vivo one or more unknown values of a known characteristic, particularly the concentration of an analyte in human tissue. The method includes: (1) irradiating the tissue with infrared energy (400 nm-2400 nm) having at least several wavelengths in a given range of wavelengths so that there is differential absorption of at least some of the wavelengths by the tissue as a function of the wavelengths and the known characteristic, the differential absorption causeing intensity variations of the wavelengths incident from the tissue; (2) providing a first path through the tissue; (3) optimizing the first path for a first sub-region of the range of wavelengths to maximize the differential absorption by at least some of the wavelengths in the first sub-region; (4) providing a second path through the tissue; and (5) optimizing the second path for a second sub-region of the range, to maximize the differential absorption by at least some of the wavelengths in the second sub-region. In the preferred embodiment a third path through the tissue is provided for, which path is optimized for a third sub-region of the range. With this arrangement, spectral variations which are the result of tissue differences (e.g., melanin and temperature) can be reduced. At least one of the paths represents a partial transmission path through the tissue. This partial transmission path may pass through the nail of a finger once and, preferably, twice. Also included are apparatus for: (1) reducing the arterial pulsations within the tissue; and (2) maximizing the blood content i the tissue.

Linear quadratic regulators with eigenvalue placement in a horizontal strip

NASA Technical Reports Server (NTRS)

Shieh, Leang S.; Dib, Hani M.; Ganesan, Sekar

1987-01-01

A method for optimally shifting the imaginary parts of the open-loop poles of a multivariable control system to the desirable closed-loop locations is presented. The optimal solution with respect to a quadratic performance index is obtained by solving a linear matrix Liapunov equation.

A heuristic for deriving the optimal number and placement of reconnaissance sensors

NASA Astrophysics Data System (ADS)

Nanda, S.; Weeks, J.; Archer, M.

2008-04-01

A key to mastering asymmetric warfare is the acquisition of accurate intelligence on adversaries and their assets in urban and open battlefields. To achieve this, one needs adequate numbers of tactical sensors placed in locations to optimize coverage, where optimality is realized by covering a given area of interest with the least number of sensors, or covering the largest possible subsection of an area of interest with a fixed set of sensors. Unfortunately, neither problem admits a polynomial time algorithm as a solution, and therefore, the placement of such sensors must utilize intelligent heuristics instead. In this paper, we present a scheme implemented on parallel SIMD processing architectures to yield significantly faster results, and that is highly scalable with respect to dynamic changes in the area of interest. Furthermore, the solution to the first problem immediately translates to serve as a solution to the latter if and when any sensors are rendered inoperable.

On the placement of active members in adaptive truss structures for vibration control

NASA Technical Reports Server (NTRS)

Lu, L.-Y.; Utku, S.; Wada, B. K.

1992-01-01

The problem of optimal placement of active members which are used for vibration control in adaptive truss structures is investigated. The control scheme is based on the method of eigenvalue assignment as a means of shaping the transient response of the controlled adaptive structures, and the minimization of required control action is considered as the optimization criterion. To this end, a performance index which measures the control strokes of active members is formulated in an efficient way. In order to reduce the computation burden, particularly for the case where the locations of active members have to be selected from a large set of available sites, several heuristic searching schemes are proposed for obtaining the near-optimal locations. The proposed schemes significantly reduce the computational complexity of placing multiple active members to the order of that when a single active member is placed.

Placement of implantable cardioverter-defibrillators in paediatric and congenital heart defect patients: a pipeline for model generation and simulation prediction of optimal configurations

PubMed Central

Rantner, Lukas J; Vadakkumpadan, Fijoy; Spevak, Philip J; Crosson, Jane E; Trayanova, Natalia A

2013-01-01

There is currently no reliable way of predicting the optimal implantable cardioverter-defibrillator (ICD) placement in paediatric and congenital heart defect (CHD) patients. This study aimed to: (1) develop a new image processing pipeline for constructing patient-specific heart–torso models from clinical magnetic resonance images (MRIs); (2) use the pipeline to determine the optimal ICD configuration in a paediatric tricuspid valve atresia patient; (3) establish whether the widely used criterion of shock-induced extracellular potential (Φe) gradients ≥5 V cm−1 in ≥95% of ventricular volume predicts defibrillation success. A biophysically detailed heart–torso model was generated from patient MRIs. Because transvenous access was impossible, three subcutaneous and three epicardial lead placement sites were identified along with five ICD scan locations. Ventricular fibrillation was induced, and defibrillation shocks were applied from 11 ICD configurations to determine defibrillation thresholds (DFTs). Two configurations with epicardial leads resulted in the lowest DFTs overall and were thus considered optimal. Three configurations shared the lowest DFT among subcutaneous lead ICDs. The Φe gradient criterion was an inadequate predictor of defibrillation success, as defibrillation failed in numerous instances even when 100% of the myocardium experienced such gradients. In conclusion, we have developed a new image processing pipeline and applied it to a CHD patient to construct the first active heart–torso model from clinical MRIs. PMID:23798492

A quantitative method for optimized placement of continuous air monitors.

PubMed

Whicker, Jeffrey J; Rodgers, John C; Moxley, John S

2003-11-01

Alarming continuous air monitors (CAMs) are a critical component for worker protection in facilities that handle large amounts of hazardous materials. In nuclear facilities, continuous air monitors alarm when levels of airborne radioactive materials exceed alarm thresholds, thus prompting workers to exit the room to reduce inhalation exposures. To maintain a high level of worker protection, continuous air monitors are required to detect radioactive aerosol clouds quickly and with good sensitivity. This requires that there are sufficient numbers of continuous air monitors in a room and that they are well positioned. Yet there are no published methodologies to quantitatively determine the optimal number and placement of continuous air monitors in a room. The goal of this study was to develop and test an approach to quantitatively determine optimal number and placement of continuous air monitors in a room. The method we have developed uses tracer aerosol releases (to simulate accidental releases) and the measurement of the temporal and spatial aspects of the dispersion of the tracer aerosol through the room. The aerosol dispersion data is then analyzed to optimize continuous air monitor utilization based on simulated worker exposure. This method was tested in a room within a Department of Energy operated plutonium facility at the Savannah River Site in South Carolina, U.S. Results from this study show that the value of quantitative airflow and aerosol dispersion studies is significant and that worker protection can be significantly improved while balancing the costs associated with CAM programs.

Fabrication of Thermoplastic Composite Laminates Having Film Interleaves By Automated Fiber Placement

NASA Technical Reports Server (NTRS)

Hulcher, A. B.; Tiwari, S. N.; Marchello, J. M.; Johnston, Norman J. (Technical Monitor)

2001-01-01

Experiments were carried out at the NASA Langley Research Center automated Fiber placement facility to determine an optimal process for the fabrication of composite materials having polymer film interleaves. A series of experiments was conducted to determine an optimal process for the composite prior to investigation of a process to fabricate laminates with polymer films. The results of the composite tests indicated that a well-consolidated, void-free laminate could be attained. Preliminary interleaf processing trials were then conducted to establish some broad guidelines for film processing. The primary finding of these initial studies was that a two-stage process was necessary in order to process these materials adequately. A screening experiment was then performed to determine the relative influence of the process variables on the quality of the film interface as determined by the wedge peel test method. Parameters that were found to be of minor influence on specimen quality were subsequently held at fixed values enabling a more rapid determination of an optimal process. Optimization studies were then performed by varying the remaining parameters at three film melt processing rates. The resulting peel data were fitted with quadratic response surfaces. Additional specimens were fabricated at levels of high peel strength as predicted by the regression models in an attempt to gage the accuracy of the predicted response and to assess the repeatability of the process. The overall results indicate that quality laminates having film interleaves can be successfully and repeatably fabricated by automated fiber placement.

Selection and placement of best management practices used to reduce water quality degradation in Lincoln Lake watershed

NASA Astrophysics Data System (ADS)

Rodriguez, Hector German; Popp, Jennie; Maringanti, Chetan; Chaubey, Indrajeet

2011-01-01

An increased loss of agricultural nutrients is a growing concern for water quality in Arkansas. Several studies have shown that best management practices (BMPs) are effective in controlling water pollution. However, those affected with water quality issues need water management plans that take into consideration BMPs selection, placement, and affordability. This study used a nondominated sorting genetic algorithm (NSGA-II). This multiobjective algorithm selects and locates BMPs that minimize nutrients pollution cost-effectively by providing trade-off curves (optimal fronts) between pollutant reduction and total net cost increase. The usefulness of this optimization framework was evaluated in the Lincoln Lake watershed. The final NSGA-II optimization model generated a number of near-optimal solutions by selecting from 35 BMPs (combinations of pasture management, buffer zones, and poultry litter application practices). Selection and placement of BMPs were analyzed under various cost solutions. The NSGA-II provides multiple solutions that could fit the water management plan for the watershed. For instance, by implementing all the BMP combinations recommended in the lowest-cost solution, total phosphorous (TP) could be reduced by at least 76% while increasing cost by less than 2% in the entire watershed. This value represents an increase in cost of 5.49 ha-1 when compared to the baseline. Implementing all the BMP combinations proposed with the medium- and the highest-cost solutions could decrease TP drastically but will increase cost by 24,282 (7%) and $82,306 (25%), respectively.

A triaxial accelerometer monkey algorithm for optimal sensor placement in structural health monitoring

NASA Astrophysics Data System (ADS)

Jia, Jingqing; Feng, Shuo; Liu, Wei

2015-06-01

Optimal sensor placement (OSP) technique is a vital part of the field of structural health monitoring (SHM). Triaxial accelerometers have been widely used in the SHM of large-scale structures in recent years. Triaxial accelerometers must be placed in such a way that all of the important dynamic information is obtained. At the same time, the sensor configuration must be optimal, so that the test resources are conserved. The recommended practice is to select proper degrees of freedom (DOF) based upon several criteria and the triaxial accelerometers are placed at the nodes corresponding to these DOFs. This results in non-optimal placement of many accelerometers. A ‘triaxial accelerometer monkey algorithm’ (TAMA) is presented in this paper to solve OSP problems of triaxial accelerometers. The EFI3 measurement theory is modified and involved in the objective function to make it more adaptable in the OSP technique of triaxial accelerometers. A method of calculating the threshold value based on probability theory is proposed to improve the healthy rate of monkeys in a troop generation process. Meanwhile, the processes of harmony ladder climb and scanning watch jump are proposed and given in detail. Finally, Xinghai NO.1 Bridge in Dalian is implemented to demonstrate the effectiveness of TAMA. The final results obtained by TAMA are compared with those of the original monkey algorithm and EFI3 measurement, which show that TAMA can improve computational efficiency and get a better sensor configuration.

The use of self-expanding silicone stents in esophageal cancer care: optimal pre-, peri-, and postoperative care.

PubMed

Martin, Robert; Duvall, Ryan; Ellis, Susan; Scoggins, Charles R

2009-03-01

Preoperative nutritional supplementation, management of esophageal leaks, and postoperative anastomotic strictures still remain common problems in the management of esophageal cancer. Jejunal feeding tubes, total parenteral nutrition (TPN) with nasogastric suction, and repeated esophageal dilations remain the most common treatments, respectively. The aim of this study was to evaluate the use of removable silicone stents in (1) the preoperative nutritional optimization during neoadjuvant therapy, (2) the management of perioperative anastomotic leak, and (3) the management of postoperative anastomotic strictures. Review of our prospectively maintained esophageal database identified 15 patients who had removable self-expanding silicone stents placed in the management of one of these three management problems from July 2004 to August 2006. Preoperative therapy: Five patients underwent initial stent placement in preparation for neoadjuvant therapy. Dysphagia relief was seen in 100% of patients, with optimal caloric needs taken within 24 h of placement. All patients tolerated neoadjuvant therapy without delay from dehydration or malnutrition. One stent migration was found at the time of operation, which was removed without sequelae. Perioperative therapy: Five patients developed delayed (>10 days) esophageal leaks that were managed with removable esophageal stent and percutaneous drainage (in three patients). All patients had successful exclusion of the leak on the day of the procedure with resumption of oral intake on the evening of procedure. All five healed leaks without sequelae. Postoperative therapy: Five patients developed postoperative anastomotic strictures that required dilation and placement of removable esophageal stent. The median number of dilations was 1 (range 1-2), with all stents placed for approximate 3 months duration. All patients had immediate dysphagia relief after stent placement. Removable esophageal stents are novel treatment option to optimize relief of symptoms and return the patients back to a more normal oral intake. Continued evaluation is needed to consider stent use as first-line therapy.

Co-optimization of lithographic and patterning processes for improved EPE performance

NASA Astrophysics Data System (ADS)

Maslow, Mark J.; Timoshkov, Vadim; Kiers, Ton; Jee, Tae Kwon; de Loijer, Peter; Morikita, Shinya; Demand, Marc; Metz, Andrew W.; Okada, Soichiro; Kumar, Kaushik A.; Biesemans, Serge; Yaegashi, Hidetami; Di Lorenzo, Paolo; Bekaert, Joost P.; Mao, Ming; Beral, Christophe; Larivière, Stephane

2017-03-01

Complimentary lithography is already being used for advanced logic patterns. The tight pitches for 1D Metal layers are expected to be created using spacer based multiple patterning ArF-i exposures and the more complex cut/block patterns are made using EUV exposures. At the same time, control requirements of CDU, pattern shift and pitch-walk are approaching sub-nanometer levels to meet edge placement error (EPE) requirements. Local variability, such as Line Edge Roughness (LER), Local CDU, and Local Placement Error (LPE), are dominant factors in the total Edge Placement error budget. In the lithography process, improving the imaging contrast when printing the core pattern has been shown to improve the local variability. In the etch process, it has been shown that the fusion of atomic level etching and deposition can also improve these local variations. Co-optimization of lithography and etch processing is expected to further improve the performance over individual optimizations alone. To meet the scaling requirements and keep process complexity to a minimum, EUV is increasingly seen as the platform for delivering the exposures for both the grating and the cut/block patterns beyond N7. In this work, we evaluated the overlay and pattern fidelity of an EUV block printed in a negative tone resist on an ArF-i SAQP grating. High-order Overlay modeling and corrections during the exposure can reduce overlay error after development, a significant component of the total EPE. During etch, additional degrees of freedom are available to improve the pattern placement error in single layer processes. Process control of advanced pitch nanoscale-multi-patterning techniques as described above is exceedingly complicated in a high volume manufacturing environment. Incorporating potential patterning optimizations into both design and HVM controls for the lithography process is expected to bring a combined benefit over individual optimizations. In this work we will show the EPE performance improvement for a 32nm pitch SAQP + block patterned Metal 2 layer by cooptimizing the lithography and etch processes. Recommendations for further improvements and alternative processes will be given.

Kinetic constrained optimization of the golf swing hub path.

PubMed

Nesbit, Steven M; McGinnis, Ryan S

2014-12-01

This study details an optimization of the golf swing, where the hand path and club angular trajectories are manipulated. The optimization goal was to maximize club head velocity at impact within the interaction kinetic limitations (force, torque, work, and power) of the golfer as determined through the analysis of a typical swing using a two-dimensional dynamic model. The study was applied to four subjects with diverse swing capabilities and styles. It was determined that it is possible for all subjects to increase their club head velocity at impact within their respective kinetic limitations through combined modifications to their respective hand path and club angular trajectories. The manner of the modifications, the degree of velocity improvement, the amount of kinetic reduction, and the associated kinetic limitation quantities were subject dependent. By artificially minimizing selected kinetic inputs within the optimization algorithm, it was possible to identify swing trajectory characteristics that indicated relative kinetic weaknesses of a subject. Practical implications are offered based upon the findings of the study. Key PointsThe hand path trajectory is an important characteristic of the golf swing and greatly affects club head velocity and golfer/club energy transfer.It is possible to increase the energy transfer from the golfer to the club by modifying the hand path and swing trajectories without increasing the kinetic output demands on the golfer.It is possible to identify relative kinetic output strengths and weakness of a golfer through assessment of the hand path and swing trajectories.Increasing any one of the kinetic outputs of the golfer can potentially increase the club head velocity at impact.The hand path trajectory has important influences over the club swing trajectory.

Kinetic Constrained Optimization of the Golf Swing Hub Path

PubMed Central

Nesbit, Steven M.; McGinnis, Ryan S.

2014-01-01

This study details an optimization of the golf swing, where the hand path and club angular trajectories are manipulated. The optimization goal was to maximize club head velocity at impact within the interaction kinetic limitations (force, torque, work, and power) of the golfer as determined through the analysis of a typical swing using a two-dimensional dynamic model. The study was applied to four subjects with diverse swing capabilities and styles. It was determined that it is possible for all subjects to increase their club head velocity at impact within their respective kinetic limitations through combined modifications to their respective hand path and club angular trajectories. The manner of the modifications, the degree of velocity improvement, the amount of kinetic reduction, and the associated kinetic limitation quantities were subject dependent. By artificially minimizing selected kinetic inputs within the optimization algorithm, it was possible to identify swing trajectory characteristics that indicated relative kinetic weaknesses of a subject. Practical implications are offered based upon the findings of the study. Key Points The hand path trajectory is an important characteristic of the golf swing and greatly affects club head velocity and golfer/club energy transfer. It is possible to increase the energy transfer from the golfer to the club by modifying the hand path and swing trajectories without increasing the kinetic output demands on the golfer. It is possible to identify relative kinetic output strengths and weakness of a golfer through assessment of the hand path and swing trajectories. Increasing any one of the kinetic outputs of the golfer can potentially increase the club head velocity at impact. The hand path trajectory has important influences over the club swing trajectory. PMID:25435779

Using the Gurobi Solvers on the Peregrine System | High-Performance

Science.gov Websites

Peregrine System Gurobi Optimizer is a suite of solvers for mathematical programming. It is licensed for ('GRB_MATLAB_PATH') >> path(path,grb) Gurobi and GAMS GAMS is a high-level modeling system for mathematical

Accounting for connectivity and spatial correlation in the optimal placement of wildlife habitat

Treesearch

John Hof; Curtis H. Flather

1996-01-01

This paper investigates optimization approaches to simultaneously modelling habitat fragmentation and spatial correlation between patch populations. The problem is formulated with habitat connectivity affecting population means and variances, with spatial correlations accounted for in covariance calculations. Population with a pre-specifled confidence level is then...

An Optimization-Driven Analysis Pipeline to Uncover Biomarkers and Signaling Paths: Cervix Cancer.

PubMed

Lorenzo, Enery; Camacho-Caceres, Katia; Ropelewski, Alexander J; Rosas, Juan; Ortiz-Mojer, Michael; Perez-Marty, Lynn; Irizarry, Juan; Gonzalez, Valerie; Rodríguez, Jesús A; Cabrera-Rios, Mauricio; Isaza, Clara

2015-06-01

Establishing how a series of potentially important genes might relate to each other is relevant to understand the origin and evolution of illnesses, such as cancer. High-throughput biological experiments have played a critical role in providing information in this regard. A special challenge, however, is that of trying to conciliate information from separate microarray experiments to build a potential genetic signaling path. This work proposes a two-step analysis pipeline, based on optimization, to approach meta-analysis aiming to build a proxy for a genetic signaling path.

Optimal Patrol to Detect Attacks at Dispersed Heterogeneous Locations

DTIC Science & Technology

2013-12-01

path with one revisit SPR2 Shortest path with two revisits SPR3 Shortest path with three revisits TSP Traveling salesman problem UAV Unmanned aerial...path patrol pattern. Finding the shortest-path patrol pattern is an example of solving a traveling salesman problem , as described in Section 16.5 of...use of patrol paths based on the traveling salesman prob- lem (TSP), where patrollers follow the shortest Hamiltonian cycle in a graph in order to

Untitled

Cancer.gov

A collaborative study on colposcopic biopsy with aims to study cervical disease on the lesion level, optimize criteria for biopsy placement, and analyze the incremental benefit of taking multiple biopsies

Corrections to scaling for watersheds, optimal path cracks, and bridge lines

NASA Astrophysics Data System (ADS)

Fehr, E.; Schrenk, K. J.; Araújo, N. A. M.; Kadau, D.; Grassberger, P.; Andrade, J. S., Jr.; Herrmann, H. J.

2012-07-01

We study the corrections to scaling for the mass of the watershed, the bridge line, and the optimal path crack in two and three dimensions (2D and 3D). We disclose that these models have numerically equivalent fractal dimensions and leading correction-to-scaling exponents. We conjecture all three models to possess the same fractal dimension, namely, df=1.2168±0.0005 in 2D and df=2.487±0.003 in 3D, and the same exponent of the leading correction, Ω=0.9±0.1 and Ω=1.0±0.1, respectively. The close relations between watersheds, optimal path cracks in the strong disorder limit, and bridge lines are further supported by either heuristic or exact arguments.

Modeling of tool path for the CNC sheet cutting machines

NASA Astrophysics Data System (ADS)

Petunin, Aleksandr A.

2015-11-01

In the paper the problem of tool path optimization for CNC (Computer Numerical Control) cutting machines is considered. The classification of the cutting techniques is offered. We also propose a new classification of toll path problems. The tasks of cost minimization and time minimization for standard cutting technique (Continuous Cutting Problem, CCP) and for one of non-standard cutting techniques (Segment Continuous Cutting Problem, SCCP) are formalized. We show that the optimization tasks can be interpreted as discrete optimization problem (generalized travel salesman problem with additional constraints, GTSP). Formalization of some constraints for these tasks is described. For the solution GTSP we offer to use mathematical model of Prof. Chentsov based on concept of a megalopolis and dynamic programming.

The war at home: affective economics and transnationally adoptive families in the United States.

PubMed

Stryker, Rachael

2011-01-01

The question of how to best conduct post-placement interventions for transnationally adoptive families at risk of dissolution (legal annulment) is an emerging issue in the United States. The current popular trend for adoptive families to pursue biomedical post-placement interventions, despite a lack of proof that such interventions actually work to keep the adoptive family intact, suggests the need for a more phenomenological approach to understanding both adoptive parents’ and transnational adoptees’ post-placement experiences. This study examines the empirical experiences of adoptive families at risk of dissolution in the United States who attempt to define and navigate the path toward family stability after adopting. From the coding of this data set emerge some routes through and by which emotions circulate between adoptive parents and transnational adoptees through the family body and the family social. Particularly, it investigates one post-placement “affective economy” at work in which adoptive parents attempt, through the expression of particular forms of parental love, to align adoptees as subjects of the private, nuclear American family, while adoptees more often attempt to create space for more heterogeneous forms of family, ones that include birth parents and other kin-like relations in their countries of origin. Ultimately, it illuminates some vastly different and sometimes contradictory ways that adoptive parents and adoptees can interpret family through emotional lenses, ones that can prevent a smooth post-placement transition for adoption actors. An understanding of these differences and how they shape, and are shaped by, the post-placement affective economy within families at risk of dissolution may aid in locating indicators for adoption dissolution, and possibly, designing more effective post-placement interventions for families struggling in the aftermath of adoption. It may also help scholars begin to think about the construction and impact of affective economies in the realm of adoption more generally.

Exploring chemical reaction mechanisms through harmonic Fourier beads path optimization.

PubMed

Khavrutskii, Ilja V; Smith, Jason B; Wallqvist, Anders

2013-10-28

Here, we apply the harmonic Fourier beads (HFB) path optimization method to study chemical reactions involving covalent bond breaking and forming on quantum mechanical (QM) and hybrid QM∕molecular mechanical (QM∕MM) potential energy surfaces. To improve efficiency of the path optimization on such computationally demanding potentials, we combined HFB with conjugate gradient (CG) optimization. The combined CG-HFB method was used to study two biologically relevant reactions, namely, L- to D-alanine amino acid inversion and alcohol acylation by amides. The optimized paths revealed several unexpected reaction steps in the gas phase. For example, on the B3LYP∕6-31G(d,p) potential, we found that alanine inversion proceeded via previously unknown intermediates, 2-iminopropane-1,1-diol and 3-amino-3-methyloxiran-2-ol. The CG-HFB method accurately located transition states, aiding in the interpretation of complex reaction mechanisms. Thus, on the B3LYP∕6-31G(d,p) potential, the gas phase activation barriers for the inversion and acylation reactions were 50.5 and 39.9 kcal∕mol, respectively. These barriers determine the spontaneous loss of amino acid chirality and cleavage of peptide bonds in proteins. We conclude that the combined CG-HFB method further advances QM and QM∕MM studies of reaction mechanisms.

Multistructural microiteration technique for geometry optimization and reaction path calculation in large systems.

PubMed

Suzuki, Kimichi; Morokuma, Keiji; Maeda, Satoshi

2017-10-05

We propose a multistructural microiteration (MSM) method for geometry optimization and reaction path calculation in large systems. MSM is a simple extension of the geometrical microiteration technique. In conventional microiteration, the structure of the non-reaction-center (surrounding) part is optimized by fixing atoms in the reaction-center part before displacements of the reaction-center atoms. In this method, the surrounding part is described as the weighted sum of multiple surrounding structures that are independently optimized. Then, geometric displacements of the reaction-center atoms are performed in the mean field generated by the weighted sum of the surrounding parts. MSM was combined with the QM/MM-ONIOM method and applied to chemical reactions in aqueous solution or enzyme. In all three cases, MSM gave lower reaction energy profiles than the QM/MM-ONIOM-microiteration method over the entire reaction paths with comparable computational costs. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

Avoiding Pitfalls of Tibiotalocalcaneal Nail Malposition With Internal Rotation Axial Heel View.

PubMed

Callahan, Ryan; Juliano, Paul; Aydogan, Umur; Clayton, Justin

2018-04-01

Tibiotalocalcaneal (TTC) nails are often used for complex hind foot arthrodesis and deformity correction. The natural valgus alignment of the hindfoot creates a challenge to optimum placement of the guidewire and eventual nail with a straight or valgus-curved nail. Five fresh frozen cadavers were used for placement of a TTC guidewire with standard anterior-posterior (AP), lateral, and Harris axial heel views as a reference for proper placement. The limb was then rotated 15°, 30°, and 45° both internally and externally to evaluate the perceived amount of osseous purchase within the calcaneus. The TTC nail was then inserted and dissection was performed to demonstrate proximity of the nail to the sustentaculum tali and neurovascular structures. A 30° internal rotation Harris axial heel view demonstrated the most accurate representation of osseous purchase within the calcaneus with the guidewire and nail placement. When the guidewire was placed with standard imaging the nail was often ultimately placed in close proximity to the sustentaculum tali and neurovascular structures. Careful placement of the guidewire prior to reaming and nail placement should be undertaken to avoid neurovascular injury and to increase osseous purchase. For optimal guidewire placement, the authors suggest using appropriate anatomic landmarks and using a 30° internally rotated Harris axial heel view to verify correct placement. Level V: Expert opinion.

TU-G-BRB-01: Continuous Path Optimization for Non-Coplanar Variant SAD IMRT Delivery Using C-Arm Machines.

PubMed

Ruan, D; Dong, P; Low, D; Sheng, K

2012-06-01

To develop and investigate a continuous path optimization methodology to traverse prescribed non-coplanar IMRT beams with variant SADs, by orchestrating the couch and gantry movement with zero-collision, minimal patient motion consequence and machine travel time. We convert the given collision zone definition and the prescribed beam location/angles to a tumor-centric coordinate, and represent the traversing path as a continuous open curve. We proceed to optimize a composite objective function consisting of (1) a strong attraction energy to ensure all prescribed beams are en-route, (2) a penalty for patient-motion inducing couch motion, and (3) a penalty for travel-time inducing overall path-length. Feasibility manifold is defined as complement to collision zone and the optimization is performed with a level set representation evolved with variational flows. The proposed method has been implemented and tested on clinically derived data. In the absence of any existing solutions for the same problem, we validate by: (1) visual inspecting the generated path rendered in the 3D tumor-centric coordinates, and (2) comparing with a traveling-salesman (TSP) solution obtained from relaxing the variant SADs and continuous collision-avoidance requirement. The proposed method has generated delivery paths that are smooth and intuitively appealing. Under relaxed settings, our results outperform the generic TSP solutions and agree with specially tuned versions. We have proposed a novel systematic approach that automatically determines the continuous path to cover non-coplanar, varying SAD IMRT beams. The proposed approach accommodates patient-specific collision zone definition and ensures its avoidance continuously. The differential penalty to couch and gantry motions allows customizable tradeoff between patient geometry stability and delivery efficiency. This development paves the path to achieve safe, accurate and efficient non-coplanar IMRT delivery with the advanced robotic controls in new-generation C-arm systems, enabling practical harvesting of the dose benefit offered by non-coplanar, variant SAD IMRT treatment. © 2012 American Association of Physicists in Medicine.

Test Scheduling for Core-Based SOCs Using Genetic Algorithm Based Heuristic Approach

NASA Astrophysics Data System (ADS)

Giri, Chandan; Sarkar, Soumojit; Chattopadhyay, Santanu

This paper presents a Genetic algorithm (GA) based solution to co-optimize test scheduling and wrapper design for core based SOCs. Core testing solutions are generated as a set of wrapper configurations, represented as rectangles with width equal to the number of TAM (Test Access Mechanism) channels and height equal to the corresponding testing time. A locally optimal best-fit heuristic based bin packing algorithm has been used to determine placement of rectangles minimizing the overall test times, whereas, GA has been utilized to generate the sequence of rectangles to be considered for placement. Experimental result on ITC'02 benchmark SOCs shows that the proposed method provides better solutions compared to the recent works reported in the literature.

Outcome of the third cloud retrieval evaluation workshop

NASA Astrophysics Data System (ADS)

Roebeling, Rob; Baum, Bryan; Bennartz, Ralf; Hamann, Ulrich; Heidinger, Andy; Thoss, Anke; Walther, Andi

2013-05-01

Accurate measurements of global distributions of cloud parameters and their diurnal, seasonal, and interannual variations are needed to improve understanding of the role of clouds in the weather and climate system, and to monitor their time-space variations. Cloud properties retrieved from satellite observations, such as cloud vertical placement, cloud water path and cloud particle size, play an important role for such studies. In order to give climate and weather researchers more confidence in the quality of these retrievals their validity needs to be determined and their error characteristics must be quantified. The purpose of the Cloud Retrieval Evaluation Workshop (CREW), held from 15-18 Nov. 2011 in Madison, Wisconsin, USA, is to enhance knowledge on state-of-art cloud properties retrievals from passive imaging satellites, and pave the path towards optimizing these retrievals for climate monitoring as well as for the analysis of cloud parameterizations in climate and weather models. CREW also seeks to observe and understand methods used to prepare daily and monthly cloud parameter climatologies. An important workshop component is discussion on results of the algorithm and sensor comparisons and validation studies. Hereto a common database with about 12 different cloud properties retrievals from passive imagers (MSG, MODIS, AVHRR, POLDER and/or AIRS), complemented with cloud measurements that serve as a reference (CLOUDSAT, CALIPSO, AMSU, MISR), was prepared for a number of "golden days". The passive imager cloud property retrievals were inter-compared and validated against Cloudsat, Calipso and AMSU observations. In our presentation we summarize the outcome of the inter-comparison and validation work done in the framework of CREW, and elaborate on reasons for observed differences. More in depth discussions were held on retrieval principles and validation, and utilization of cloud parameters for climate research. This was done in parallel breakout sessions on cloud vertical placement, cloud physical properties, and cloud climatologies. We present the recommendations of these sessions, propose a way forward to establish international partnerships on cloud research, and summarize actions defined to tailor CREW activities to missions of international programs, such as the Global Energy and Water Cycle Experiment (GEWEX) and Sustained, Co-Ordinated Processing of Environmental Satellite Data for Climate Monitoring (SCOPE-CM). Finally, attention is given to increase the traceability and uniformity of different longterm and homogeneous records of cloud parameters.

Improvement of in-hospital telemetry monitoring in coronary care units: an intervention study for achieving optimal electrode placement and attachment, hygiene and delivery of critical information to patients.

PubMed

Pettersen, Trond R; Fålun, Nina; Norekvål, Tone M

2014-12-01

In-hospital telemetry monitoring is important for diagnosis and treatment of patients at risk of developing life-threatening arrhythmias. It is widely used in critical and non-critical care wards. Nurses are responsible for correct electrode placement, thus ensuring optimal quality of the monitoring. The aims of this study were to determine whether a complex educational intervention improves (a) optimal electrode placement, (b) hygiene, and (c) delivery of critical information to patients (reason for monitoring, limitations in cellular phone use, and not to leave the ward without informing a member of staff). A prospective interventional study design was used, with data collection occurring over two six-week periods: before implementation of the intervention (n=201) and after the intervention (n=165). Standard abstraction forms were used to obtain data on patients' clinical characteristics, and 10 variables related to electrode placement and attachment, hygiene and delivery of critical information. At pre-intervention registration, 26% of the electrodes were misplaced. Twelve per cent of the patients received information about limiting their cellular phone use while monitored, 70% were informed of the purpose of monitoring, and 71% used a protective cover for their unit. Post-intervention, outcome measures for the three variables improved significantly: use of protective cover (p<0.001), information about the purpose of monitoring (p=0.005) and information about limitations in cellular phone use (p=0.003). Nonetheless, 23% of the electrodes were still misplaced. The study highlights the need for better, continued education for in-hospital telemetry monitoring in coronary care units, and other units that monitor patients with telemetry. © The European Society of Cardiology 2013.

Optical network unit placement in Fiber-Wireless (FiWi) access network by Moth-Flame optimization algorithm

NASA Astrophysics Data System (ADS)

Singh, Puja; Prakash, Shashi

2017-07-01

Hybrid wireless-optical broadband access network (WOBAN) or Fiber-Wireless (FiWi) is the integration of wireless access network and optical network. This hybrid multi-domain network adopts the advantages of wireless and optical domains and serves the demand of technology savvy users. FiWi exhibits the properties of cost effectiveness, robustness, flexibility, high capacity, reliability and is self organized. Optical Network Unit (ONU) placement problem in FiWi contributes in simplifying the network design and enhances the performance in terms of cost efficiency and increased throughput. Several individual-based algorithms, such as Simulated Annealing (SA), Tabu Search, etc. have been suggested for ONU placement, but these algorithms suffer from premature convergence (trapping in a local optima). The present research work undertakes the deployment of FiWi and proposes a novel nature-inspired heuristic paradigm called Moth-Flame optimization (MFO) algorithm for multiple optical network units' placement. MFO is a population based algorithm. Population-based algorithms are better in handling local optima avoidance. The simulation results are compared with the existing Greedy and Simulated Annealing algorithms to optimize the position of ONUs. To the best of our knowledge, MFO algorithm has been used for the first time in this domain, moreover it has been able to provide very promising and competitive results. The performance of MFO algorithm has been analyzed by varying the 'b' parameter. MFO algorithm results in faster convergence than the existing strategies of Greedy and SA and returns a lower value of overall cost function. The results exhibit the dependence of the objective function on the distribution of wireless users also.

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.

Hatch Cover Slides Through Hatch

NASA Technical Reports Server (NTRS)

Alton, Charles; Okane, James H.

1989-01-01

Hatch cover for pressurized vessel provides tight seal but opened quickly from either side. In opening or closing, cover sweeps out relatively little volume within vessel, so it does not hinder movement of people or objects from vessel to outside or placement of people or objects near hatch. Cover uses internal pressure to create seal when closed. Design of cover eliminates leakage paths, and cover immune to hazards of sudden decompression or jamming when bolts and latches fail.

Robust Sensor Placements at Informative and Communication-efficient Locations

DTIC Science & Technology

2010-08-01

tree T ∗ with cost `∗, spanning a setA∗. Then PSPIEL can find a tree T with costO (r dim(V,E))×`∗, spanning a setAwith expected sensing quality F (A...V, E), s, t ∈ V and an (r, γ)-local monotone submodular function F , PSPIEL will find an s− t path P with costO (r dim(V,E))× `∗, spanning a setA with

Optimal exploration systems

NASA Astrophysics Data System (ADS)

Klesh, Andrew T.

This dissertation studies optimal exploration, defined as the collection of information about given objects of interest by a mobile agent (the explorer) using imperfect sensors. The key aspects of exploration are kinematics (which determine how the explorer moves in response to steering commands), energetics (which determine how much energy is consumed by motion and maneuvers), informatics (which determine the rate at which information is collected) and estimation (which determines the states of the objects). These aspects are coupled by the steering decisions of the explorer. We seek to improve exploration by finding trade-offs amongst these couplings and the components of exploration: the Mission, the Path and the Agent. A comprehensive model of exploration is presented that, on one hand, accounts for these couplings and on the other hand is simple enough to allow analysis. This model is utilized to pose and solve several exploration problems where an objective function is to be minimized. Specific functions to be considered are the mission duration and the total energy. These exploration problems are formulated as optimal control problems and necessary conditions for optimality are obtained in the form of two-point boundary value problems. An analysis of these problems reveals characteristics of optimal exploration paths. Several regimes are identified for the optimal paths including the Watchtower, Solar and Drag regime, and several non-dimensional parameters are derived that determine the appropriate regime of travel. The so-called Power Ratio is shown to predict the qualitative features of the optimal paths, provide a metric to evaluate an aircrafts design and determine an aircrafts capability for flying perpetually. Optimal exploration system drivers are identified that provide perspective as to the importance of these various regimes of flight. A bank-to-turn solar-powered aircraft flying at constant altitude on Mars is used as a specific platform for analysis using the coupled model. Flight-paths found with this platform are presented that display the optimal exploration problem characteristics. These characteristics are used to form heuristics, such as a Generalized Traveling Salesman Problem solver, to simplify the exploration problem. These heuristics are used to empirically show the successful completion of an exploration mission by a physical explorer.

A collaborative approach to improving and expanding an experiential education program.

PubMed

Cox, Cheryl E; Lindblad, Adrienne J

2012-04-10

The lessons learned from a collaboration between a faculty of pharmacy and a practice site that involved implementation of an innovative experiential placement model are described, as well as the broader impact of the project on other practice sites, the faculty of pharmacy's experiential education program, and experiential placement capacity. The partnerships and collaborative strategies formed were key to the implementation and evaluation of a pharmacy student clinical teaching unit pilot program and integration of concepts used in the unit into the advanced pharmacy practice experience (APPE) program to enhance capacity and quality. The university-practice partnerships have made it possible to promote the delegation of responsibility and accountability for patient care to students, challenge the anticipated workload burden for preceptors, question the optimal length of an APPE placement, and highlight the value of higher student-to-preceptor ratios that facilitate peer-assisted learning (PAL) and optimize the practice learning experiences for preceptors and students. Collaboration in experiential education between universities and practice sites can provide opportunities to address challenges faced by practitioners and academics alike.

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.

Grey-Theory-Based Optimization Model of Emergency Logistics Considering Time Uncertainty.

PubMed

Qiu, Bao-Jian; Zhang, Jiang-Hua; Qi, Yuan-Tao; Liu, Yang

2015-01-01

Natural disasters occur frequently in recent years, causing huge casualties and property losses. Nowadays, people pay more and more attention to the emergency logistics problems. This paper studies the emergency logistics problem with multi-center, multi-commodity, and single-affected-point. Considering that the path near the disaster point may be damaged, the information of the state of the paths is not complete, and the travel time is uncertainty, we establish the nonlinear programming model that objective function is the maximization of time-satisfaction degree. To overcome these drawbacks: the incomplete information and uncertain time, this paper firstly evaluates the multiple roads of transportation network based on grey theory and selects the reliable and optimal path. Then simplify the original model under the scenario that the vehicle only follows the optimal path from the emergency logistics center to the affected point, and use Lingo software to solve it. The numerical experiments are presented to show the feasibility and effectiveness of the proposed method.

Grey-Theory-Based Optimization Model of Emergency Logistics Considering Time Uncertainty

PubMed Central

Qiu, Bao-Jian; Zhang, Jiang-Hua; Qi, Yuan-Tao; Liu, Yang

2015-01-01

Natural disasters occur frequently in recent years, causing huge casualties and property losses. Nowadays, people pay more and more attention to the emergency logistics problems. This paper studies the emergency logistics problem with multi-center, multi-commodity, and single-affected-point. Considering that the path near the disaster point may be damaged, the information of the state of the paths is not complete, and the travel time is uncertainty, we establish the nonlinear programming model that objective function is the maximization of time-satisfaction degree. To overcome these drawbacks: the incomplete information and uncertain time, this paper firstly evaluates the multiple roads of transportation network based on grey theory and selects the reliable and optimal path. Then simplify the original model under the scenario that the vehicle only follows the optimal path from the emergency logistics center to the affected point, and use Lingo software to solve it. The numerical experiments are presented to show the feasibility and effectiveness of the proposed method. PMID:26417946

Robot-assisted three-dimensional registration for cochlear implant surgery using a common-path swept-source optical coherence tomography probe

NASA Astrophysics Data System (ADS)

Gurbani, Saumya S.; Wilkening, Paul; Zhao, Mingtao; Gonenc, Berk; Cheon, Gyeong Woo; Iordachita, Iulian I.; Chien, Wade; Taylor, Russell H.; Niparko, John K.; Kang, Jin U.

2014-05-01

Cochlear implantation offers the potential to restore sensitive hearing in patients with severe to profound deafness. However, surgical placement of the electrode array within the cochlea can produce trauma to sensorineural components, particularly if the initial turn of the cochlea is not successfully navigated as the array is advanced. In this work, we present a robot-mounted common-path swept-source optical coherence tomography endoscopic platform for three-dimensional (3-D) optical coherence tomography (OCT) registration and preoperative surgical planning for cochlear implant surgery. The platform is composed of a common-path 600-μm diameter fiber optic rotary probe attached to a five degrees of freedom robot capable of 1 μm precision movement. The system is tested on a dry fixed ex vivo human temporal bone, and we demonstrate the feasibility of a 3-D OCT registration of the cochlea to accurately describe the spatial and angular profiles of the canal formed by the scala tympani into the first cochlear turn.

Comparison of some evolutionary algorithms for optimization of the path synthesis problem

NASA Astrophysics Data System (ADS)

Grabski, Jakub Krzysztof; Walczak, Tomasz; Buśkiewicz, Jacek; Michałowska, Martyna

2018-01-01

The paper presents comparison of the results obtained in a mechanism synthesis by means of some selected evolutionary algorithms. The optimization problem considered in the paper as an example is the dimensional synthesis of the path generating four-bar mechanism. In order to solve this problem, three different artificial intelligence algorithms are employed in this study.

Study of Double-Weighted Graph Model and Optimal Path Planning for Tourist Scenic Area Oriented Intelligent Tour Guide

NASA Astrophysics Data System (ADS)

Shi, Y.; Long, Y.; Wi, X. L.

2014-04-01

When tourists visiting multiple tourist scenic spots, the travel line is usually the most effective road network according to the actual tour process, and maybe the travel line is different from planned travel line. For in the field of navigation, a proposed travel line is normally generated automatically by path planning algorithm, considering the scenic spots' positions and road networks. But when a scenic spot have a certain area and have multiple entrances or exits, the traditional described mechanism of single point coordinates is difficult to reflect these own structural features. In order to solve this problem, this paper focuses on the influence on the process of path planning caused by scenic spots' own structural features such as multiple entrances or exits, and then proposes a doubleweighted Graph Model, for the weight of both vertexes and edges of proposed Model can be selected dynamically. And then discusses the model building method, and the optimal path planning algorithm based on Dijkstra algorithm and Prim algorithm. Experimental results show that the optimal planned travel line derived from the proposed model and algorithm is more reasonable, and the travelling order and distance would be further optimized.

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.

Hierarchical heuristic search using a Gaussian mixture model for UAV coverage planning.

PubMed

Lin, Lanny; Goodrich, Michael A

2014-12-01

During unmanned aerial vehicle (UAV) search missions, efficient use of UAV flight time requires flight paths that maximize the probability of finding the desired subject. The probability of detecting the desired subject based on UAV sensor information can vary in different search areas due to environment elements like varying vegetation density or lighting conditions, making it likely that the UAV can only partially detect the subject. This adds another dimension of complexity to the already difficult (NP-Hard) problem of finding an optimal search path. We present a new class of algorithms that account for partial detection in the form of a task difficulty map and produce paths that approximate the payoff of optimal solutions. The algorithms use the mode goodness ratio heuristic that uses a Gaussian mixture model to prioritize search subregions. The algorithms search for effective paths through the parameter space at different levels of resolution. We compare the performance of the new algorithms against two published algorithms (Bourgault's algorithm and LHC-GW-CONV algorithm) in simulated searches with three real search and rescue scenarios, and show that the new algorithms outperform existing algorithms significantly and can yield efficient paths that yield payoffs near the optimal.

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

Hierarchical planning for a surface mounting machine placement.

PubMed

Zeng, You-jiao; Ma, Deng-ze; Jin, Ye; Yan, Jun-qi

2004-11-01

For a surface mounting machine (SMM) in printed circuit board (PCB) assembly line, there are four problems, e.g. CAD data conversion, nozzle selection, feeder assignment and placement sequence determination. A hierarchical planning for them to maximize the throughput rate of an SMM is presented here. To minimize set-up time, a CAD data conversion system was first applied that could automatically generate the data for machine placement from CAD design data files. Then an effective nozzle selection approach implemented to minimize the time of nozzle changing. And then, to minimize picking time, an algorithm for feeder assignment was used to make picking multiple components simultaneously as much as possible. Finally, in order to shorten pick-and-place time, a heuristic algorithm was used to determine optimal component placement sequence according to the decided feeder positions. Experiments were conducted on a four head SMM. The experimental results were used to analyse the assembly line performance.

Optimizing habitat location for black-tailed prairie dogs in southwestern South Dakota

Treesearch

John Hof; Michael Bevers; Daniel W. Uresk; Gregory L. Schenbeck

2002-01-01

A spatial optimization model was formulated and used to maximize black-tailed prairie dog populations in the Badlands National Park and the Buffalo Gap National Grassland in South Dakota. The choice variables involved the strategic placement of limited additional protected habitat. Population dynamics were captured in formulations that reflected exponential population...

Optimal Placement of Dynamic Var Sources by Using Empirical Controllability Covariance

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

Qi, Junjian; Huang, Weihong; Sun, Kai

In this paper, the empirical controllability covariance (ECC), which is calculated around the considered operating condition of a power system, is applied to quantify the degree of controllability of system voltages under specific dynamic var source locations. An optimal dynamic var source placement method addressing fault-induced delayed voltage recovery (FIDVR) issues is further formulated as an optimization problem that maximizes the determinant of ECC. The optimization problem is effectively solved by the NOMAD solver, which implements the mesh adaptive direct search algorithm. The proposed method is tested on an NPCC 140-bus system and the results show that the proposed methodmore » with fault specified ECC can solve the FIDVR issue caused by the most severe contingency with fewer dynamic var sources than the voltage sensitivity index (VSI)-based method. The proposed method with fault unspecified ECC does not depend on the settings of the contingency and can address more FIDVR issues than the VSI method when placing the same number of SVCs under different fault durations. It is also shown that the proposed method can help mitigate voltage collapse.« less

a Walking Disturbance Index Suggestions for Optimized Path Search for the People with Reduced Mobility

NASA Astrophysics Data System (ADS)

Moon, M.; Bang, Y.; Yu, K.; Kim, J.

2015-10-01

Recently, due to the increased penetration of smart devices and the development of geographic information system (GIS) technology, various route guidance services for pedestrians have been developed. However, until now, pedestrian navigation services for the people with reduced mobility (people who experience discomfort in transportation) including wheelchair users, the elderly, and pregnant women have not been provided. In this study, we present a walking disturbance index methodology for searching an optimized path for the people with reduced mobility by defining the factors that affect the walking of the people with reduced mobility and deriving the weights of these factors. In future research, we expect to be able to provide a navigation system that gives an optimized path for the people with reduced mobility using this method.

System and method for optimal load and source scheduling in context aware homes

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

Shetty, Pradeep; Foslien Graber, Wendy; Mangsuli, Purnaprajna R.

A controller for controlling energy consumption in a home includes a constraints engine to define variables for multiple appliances in the home corresponding to various home modes and persona of an occupant of the home. A modeling engine models multiple paths of energy utilization of the multiple appliances to place the home into a desired state from a current context. An optimal scheduler receives the multiple paths of energy utilization and generates a schedule as a function of the multiple paths and a selected persona to place the home in a desired state.

Computed Tomographic Analysis of Ventral Atlantoaxial Optimal Safe Implantation Corridors in 27 Dogs.

PubMed

Leblond, Guillaume; Gaitero, Luis; Moens, Noel M M; Zur Linden, Alex; James, Fiona M K; Monteith, Gabrielle J; Runciman, John

2017-11-01

Objectives  Ventral atlantoaxial stabilization techniques are challenging surgical procedures in dogs. Available surgical guidelines are based upon subjective anatomical landmarks, and limited radiographic and computed tomographic data. The aims of this study were (1) to provide detailed anatomical descriptions of atlantoaxial optimal safe implantation corridors to generate objective recommendations for optimal implant placements and (2) to compare anatomical data obtained in non-affected Toy breed dogs, affected Toy breed dogs suffering from atlantoaxial instability and non-affected Beagle dogs. Methods  Anatomical data were collected from a prospectively recruited population of 27 dogs using a previously validated method of optimal safe implantation corridor analysis using computed tomographic images. Results  Optimal implant positions and three-dimensional numerical data were generated successfully in all cases. Anatomical landmarks could be used to generate objective definitions of optimal insertion points which were applicable across all three groups. Overall the geometrical distribution of all implant sites was similar in all three groups with a few exceptions. Clinical Significance  This study provides extensive anatomical data available to facilitate surgical planning of implant placement for atlantoaxial stabilization. Our data suggest that non-affected Toy breed dogs and non-affected Beagle dogs constitute reasonable research models to study atlantoaxial stabilization constructs. Schattauer GmbH Stuttgart.

Design for Warehouse with Product Flow Type Allocation using Linear Programming: A Case Study in a Textile Industry

NASA Astrophysics Data System (ADS)

Khannan, M. S. A.; Nafisah, L.; Palupi, D. L.

2018-03-01

Sari Warna Co. Ltd, a company engaged in the textile industry, is experiencing problems in the allocation and placement of goods in the warehouse. During this time the company has not implemented the product flow type allocation and product placement to the respective products resulting in a high total material handling cost. Therefore, this study aimed to determine the allocation and placement of goods in the warehouse corresponding to product flow type with minimal total material handling cost. This research is a quantitative research based on the theory of storage and warehouse that uses a mathematical model of optimization problem solving using mathematical optimization model approach belongs to Heragu (2005), aided by software LINGO 11.0 in the calculation of the optimization model. Results obtained from this study is the proportion of the distribution for each functional area is the area of cross-docking at 0.0734, the reserve area at 0.1894, and the forward area at 0.7372. The allocation of product flow type 1 is 5 products, the product flow type 2 is 9 products, the product flow type 3 is 2 products, and the product flow type 4 is 6 products. The optimal total material handling cost by using this mathematical model equal to Rp43.079.510 while it is equal to Rp 49.869.728 by using the company’s existing method. It saves Rp6.790.218 for the total material handling cost. Thus, all of the products can be allocated in accordance with the product flow type with minimal total material handling cost.

Targeted left ventricular lead placement to guide cardiac resynchronization therapy: the TARGET study: a randomized, controlled trial.

PubMed

Khan, Fakhar Z; Virdee, Mumohan S; Palmer, Christopher R; Pugh, Peter J; O'Halloran, Denis; Elsik, Maros; Read, Philip A; Begley, David; Fynn, Simon P; Dutka, David P

2012-04-24

This study sought to assess the impact of targeted left ventricular (LV) lead placement on outcomes of cardiac resynchronization therapy (CRT). Placement of the LV lead to the latest sites of contraction and away from the scar confers the best response to CRT. We conducted a randomized, controlled trial to compare a targeted approach to LV lead placement with usual care. A total of 220 patients scheduled for CRT underwent baseline echocardiographic speckle-tracking 2-dimensional radial strain imaging and were then randomized 1:1 into 2 groups. In group 1 (TARGET [Targeted Left Ventricular Lead Placement to Guide Cardiac Resynchronization Therapy]), the LV lead was positioned at the latest site of peak contraction with an amplitude of >10% to signify freedom from scar. In group 2 (control) patients underwent standard unguided CRT. Patients were classified by the relationship of the LV lead to the optimal site as concordant (at optimal site), adjacent (within 1 segment), or remote (≥2 segments away). The primary endpoint was a ≥15% reduction in LV end-systolic volume at 6 months. Secondary endpoints were clinical response (≥1 improvement in New York Heart Association functional class), all-cause mortality, and combined all-cause mortality and heart failure-related hospitalization. The groups were balanced at randomization. In the TARGET group, there was a greater proportion of responders at 6 months (70% vs. 55%, p = 0.031), giving an absolute difference in the primary endpoint of 15% (95% confidence interval: 2% to 28%). Compared with controls, TARGET patients had a higher clinical response (83% vs. 65%, p = 0.003) and lower rates of the combined endpoint (log-rank test, p = 0.031). Compared with standard CRT treatment, the use of speckle-tracking echocardiography to the target LV lead placement yields significantly improved response and clinical status and lower rates of combined death and heart failure-related hospitalization. (Targeted Left Ventricular Lead Placement to Guide Cardiac Resynchronization Therapy [TARGET] study); ISRCTN19717943). Copyright © 2012 American College of Cardiology Foundation. Published by Elsevier Inc. All rights reserved.

Wavelength converter placement for different RWA algorithms in wavelength-routed all-optical networks

NASA Astrophysics Data System (ADS)

Chu, Xiaowen; Li, Bo; Chlamtac, Imrich

2002-07-01

Sparse wavelength conversion and appropriate routing and wavelength assignment (RWA) algorithms are the two key factors in improving the blocking performance in wavelength-routed all-optical networks. It has been shown that the optimal placement of a limited number of wavelength converters in an arbitrary mesh network is an NP complete problem. There have been various heuristic algorithms proposed in the literature, in which most of them assume that a static routing and random wavelength assignment RWA algorithm is employed. However, the existing work shows that fixed-alternate routing and dynamic routing RWA algorithms can achieve much better blocking performance. Our study in this paper further demonstrates that the wavelength converter placement and RWA algorithms are closely related in the sense that a well designed wavelength converter placement mechanism for a particular RWA algorithm might not work well with a different RWA algorithm. Therefore, the wavelength converter placement and the RWA have to be considered jointly. The objective of this paper is to investigate the wavelength converter placement problem under fixed-alternate routing algorithm and least-loaded routing algorithm. Under the fixed-alternate routing algorithm, we propose a heuristic algorithm called Minimum Blocking Probability First (MBPF) algorithm for wavelength converter placement. Under the least-loaded routing algorithm, we propose a heuristic converter placement algorithm called Weighted Maximum Segment Length (WMSL) algorithm. The objective of the converter placement algorithm is to minimize the overall blocking probability. Extensive simulation studies have been carried out over three typical mesh networks, including the 14-node NSFNET, 19-node EON and 38-node CTNET. We observe that the proposed algorithms not only outperform existing wavelength converter placement algorithms by a large margin, but they also can achieve almost the same performance comparing with full wavelength conversion under the same RWA algorithm.

Multi Infrastructure Control and Optimization Toolkit, Resilient Design Module (MICOT-RDT), version 2.X

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

Bent, Russell; Nagarajan, Harsha; Yamangil, Emre

2016-06-24

MICOT is a tool for optimizing and controlling infrastructure systems. In includes modules for optimizing the operations of an infrastructure structure (for example optimal dispatch), designing infrastructure systems, restoring infrastructures systems, resiliency, preparing for natural disasters, interdicting networks, state estimation, sensor placement, and simulation of infrastructure systems. It implements algorithms developed at LANL that have been published in the academic community. This is a release of the of resilient design module of the MICOT.

UCAV path planning in the presence of radar-guided surface-to-air missile threats

NASA Astrophysics Data System (ADS)

Zeitz, Frederick H., III

This dissertation addresses the problem of path planning for unmanned combat aerial vehicles (UCAVs) in the presence of radar-guided surface-to-air missiles (SAMs). The radars, collocated with SAM launch sites, operate within the structure of an Integrated Air Defense System (IADS) that permits communication and cooperation between individual radars. The problem is formulated in the framework of the interaction between three sub-systems: the aircraft, the IADS, and the missile. The main features of this integrated model are: The aircraft radar cross section (RCS) depends explicitly on both the aspect and bank angles; hence, the RCS and aircraft dynamics are coupled. The probabilistic nature of IADS tracking is accounted for; namely, the probability that the aircraft has been continuously tracked by the IADS depends on the aircraft RCS and range from the perspective of each radar within the IADS. Finally, the requirement to maintain tracking prior to missile launch and during missile flyout are also modeled. Based on this model, the problem of UCAV path planning is formulated as a minimax optimal control problem, with the aircraft bank angle serving as control. Necessary conditions of optimality for this minimax problem are derived. Based on these necessary conditions, properties of the optimal paths are derived. These properties are used to discretize the dynamic optimization problem into a finite-dimensional, nonlinear programming problem that can be solved numerically. Properties of the optimal paths are also used to initialize the numerical procedure. A homotopy method is proposed to solve the finite-dimensional, nonlinear programming problem, and a heuristic method is proposed to improve the discretization during the homotopy process. Based upon the properties of numerical solutions, a method is proposed for parameterizing and storing information for later recall in flight to permit rapid replanning in response to changing threats. Illustrative examples are presented that confirm the standard flying tactics of "denying range, aspect, and aim," by yielding flight paths that "weave" to avoid long exposures of aspects with large RCS.

An Application of Multi-Criteria Shortest Path to a Customizable Hex-Map Environment

DTIC Science & Technology

2015-03-26

forces which could act as intermediate destinations or obstacles to movement through the network. This is similar to a traveling salesman problem ...118 Abstract The shortest path problem of finding the optimal path through a complex network is well-studied in the field of operations research. This...research presents an applica- tion of the shortest path problem to a customizable map with terrain features and enemy engagement risk. The PathFinder

Active thermal control system evolution

NASA Technical Reports Server (NTRS)

Petete, Patricia A.; Ames, Brian E.

1991-01-01

The 'restructured' baseline of the Space Station Freedom (SSF) has eliminated many of the growth options for the Active Thermal Control System (ATCS). Modular addition of baseline technology to increase heat rejection will be extremely difficult. The system design and the available real estate no longer accommodate this type of growth. As the station matures during its thirty years of operation, a demand of up to 165 kW of heat rejection can be expected. The baseline configuration will be able to provide 82.5 kW at Eight Manned Crew Capability (EMCC). The growth paths necessary to reach 165 kW have been identified. Doubling the heat rejection capability of SSF will require either the modification of existing radiator wings or the attachment of growth structure to the baseline truss for growth radiator wing placement. Radiator performance can be improved by enlarging the surface area or by boosting the operating temperature with a heat pump. The optimal solution will require both modifications. The addition of growth structure would permit the addition of a parallel ATCS using baseline technology. This growth system would simplify integration. The feasibility of incorporating these growth options to improve the heat rejection capacity of SSF is under evaluation.

Liouville action as path-integral complexity: from continuous tensor networks to AdS/CFT

NASA Astrophysics Data System (ADS)

Caputa, Pawel; Kundu, Nilay; Miyaji, Masamichi; Takayanagi, Tadashi; Watanabe, Kento

2017-11-01

We propose an optimization procedure for Euclidean path-integrals that evaluate CFT wave functionals in arbitrary dimensions. The optimization is performed by minimizing certain functional, which can be interpreted as a measure of computational complexity, with respect to background metrics for the path-integrals. In two dimensional CFTs, this functional is given by the Liouville action. We also formulate the optimization for higher dimensional CFTs and, in various examples, find that the optimized hyperbolic metrics coincide with the time slices of expected gravity duals. Moreover, if we optimize a reduced density matrix, the geometry becomes two copies of the entanglement wedge and reproduces the holographic entanglement entropy. Our approach resembles a continuous tensor network renormalization and provides a concrete realization of the proposed interpretation of AdS/CFT as tensor networks. The present paper is an extended version of our earlier report arXiv:1703.00456 and includes many new results such as evaluations of complexity functionals, energy stress tensor, higher dimensional extensions and time evolutions of thermofield double states.

Needle path planning and steering in a three-dimensional non-static environment using two-dimensional ultrasound images

PubMed Central

Vrooijink, Gustaaf J.; Abayazid, Momen; Patil, Sachin; Alterovitz, Ron; Misra, Sarthak

2015-01-01

Needle insertion is commonly performed in minimally invasive medical procedures such as biopsy and radiation cancer treatment. During such procedures, accurate needle tip placement is critical for correct diagnosis or successful treatment. Accurate placement of the needle tip inside tissue is challenging, especially when the target moves and anatomical obstacles must be avoided. We develop a needle steering system capable of autonomously and accurately guiding a steerable needle using two-dimensional (2D) ultrasound images. The needle is steered to a moving target while avoiding moving obstacles in a three-dimensional (3D) non-static environment. Using a 2D ultrasound imaging device, our system accurately tracks the needle tip motion in 3D space in order to estimate the tip pose. The needle tip pose is used by a rapidly exploring random tree-based motion planner to compute a feasible needle path to the target. The motion planner is sufficiently fast such that replanning can be performed repeatedly in a closed-loop manner. This enables the system to correct for perturbations in needle motion, and movement in obstacle and target locations. Our needle steering experiments in a soft-tissue phantom achieves maximum targeting errors of 0.86 ± 0.35 mm (without obstacles) and 2.16 ± 0.88 mm (with a moving obstacle). PMID:26279600

Physical Health Problems and Barriers to Optimal Health Care Among Children in Foster Care.

PubMed

Deutsch, Stephanie Anne; Fortin, Kristine

2015-10-01

Children and adolescents in foster care placement represent a unique population with special health care needs, often resulting from pre-placement early adversity and neglected, unaddressed health care needs. High rates of all health problems, including acute and/or chronic physical, mental, and developmental issues prevail. Disparities in health status and access to health care are observed. This article summarizes the physical health problems of children in foster care, who are predisposed to poor health outcomes when complex care needs are unaddressed. Despite recognition of the significant burden of health care need among this unique population, barriers to effective and optimal health care delivery remain. Legislative solutions to overcome obstacles to health care delivery for children in foster care are discussed. Copyright © 2015 Mosby, Inc. All rights reserved.

Patterns of Movement in Foster Care: An Optimal Matching Analysis

PubMed Central

Havlicek, Judy

2011-01-01

Placement instability remains a vexing problem for child welfare agencies across the country. This study uses child welfare administrative data to retrospectively follow the entire placement histories (birth to age 17.5) of 474 foster youth who reached the age of majority in the state of Illinois and to search for patterns in their movement through the child welfare system. Patterns are identified through optimal matching and hierarchical cluster analyses. Multiple logistic regression is used to analyze administrative and survey data in order to examine covariates related to patterns. Five distinct patterns of movement are differentiated: Late Movers, Settled with Kin, Community Care, Institutionalized, and Early Entry. These patterns suggest high but variable rates of movement. Implications for child welfare policy and service provision are discussed. PMID:20873020

Factors affecting Cook Gunther Tulip and Cook Celect inferior vena cava filter retrieval success.

PubMed

Glocker, Roan J; Novak, Zdenek; Matthews, Thomas C; Patterson, Mark A; Jordan, William D; Pearce, Benjamin J; Passman, Marc A

2014-01-01

Success rates vary for the retrieval of inferior vena cava filters (IVCFs). The optimal retrieval time and factors influencing retrieval success remain unproven. This study aims to determine optimal time and evaluate factors related to successful IVCF retrieval. An institutional prospectively maintained database was reviewed for all IVCF retrieval attempts from 2006 to 2012. Patient demographics, comorbidities, indications for procedure, placement technique, IVCF type, presence of angulation, and time to retrieval were evaluated with respect to success or failure of retrieval. Statistical analyses (t-test, χ(2), correlations, and Kaplan-Meier plots) were performed comparing successful and unsuccessful retrievals. Of 121 attempted IVCF retrievals, 92 (76%) were successful and 29 (24%) were unsuccessful. There were no significant differences between the successful and unsuccessful attempts in terms of patient demographics, comorbidities, indications for procedure, placement technique, or IVCF type, which included 93 Celect (77%) and 28 Gunther Tulip (23%). Time since IVCF placement was significantly different (P = .025) between the successful and unsuccessful retrieval groups (medians were 105 [7-368] and 162 [43-379] days, respectively). Time since IVCF placement greater than 117 days correlated significantly with unsuccessful IVCF retrieval (R = 0.218; P = .017; odds ratio, 2.88; P = .02). Angulation greater than 20 degrees on anteroposterior radiograph was noted in seven of 29 (24%) unsuccessful retrievals compared with seven of 92 (8%) successful retrievals and was significant (P = .012). Cook Gunther Tulip and Celect IVCF retrieval is most likely to be successful within 3 to 4 months of placement. Unsuccessful retrieval attempts are more likely to occur when IVCF position is angulated. Copyright © 2014 Society for Vascular Surgery. Published by Elsevier Inc. All rights reserved.

Optimal placement of off-stream water sources for ephemeral stream recovery

USGS Publications Warehouse

Rigge, Matthew B.; Smart, Alexander; Wylie, Bruce

2013-01-01

Uneven and/or inefficient livestock distribution is often a product of an inadequate number and distribution of watering points. Placement of off-stream water practices (OSWP) in pastures is a key consideration in rangeland management plans and is critical to achieving riparian recovery by improving grazing evenness, while improving livestock performance. Effective OSWP placement also minimizes the impacts of livestock use radiating from OSWP, known as the “piosphere.” The objective of this study was to provide land managers with recommendations for the optimum placement of OSWP. Specifically, we aimed to provide minimum offset distances of OSWP to streams and assess the effective range of OSWP using Normalized Difference Vegetation Index (NDVI) values, an indicator of live standing crop. NDVI values were determined from a time-series of Satellite Pour l'Observation de la Terre (SPOT) 20-m images of western South Dakota mixed-grass prairie. The NDVI values in ephemeral stream channels (in-channel) and uplands were extracted from pre- and post-OSWP images taken in 1989 and 2010, respectively. NDVI values were normalized to a reference imagine and subsequently by ecological site to produce nNDVI. Our results demonstrate a significant (P 2 = 0.49, P = 0.05) and increased with average distance to OSWP in a pasture (R2 = 0.43, P = 0.07). Piospheric reduction in nNDVI was observed within 200 m of OSWP, occasionally overlapping in-channel areas. The findings of this study suggest placement of OSWP 200 to 1 250 m from streams to achieve optimal results. These results can be used to increase grazing efficiency by effectively placing OSWP and insure that piospheres do not overlap ecologically important in-channel areas.

A mean field neural network for hierarchical module placement

NASA Technical Reports Server (NTRS)

Unaltuna, M. Kemal; Pitchumani, Vijay

1992-01-01

This paper proposes a mean field neural network for the two-dimensional module placement problem. An efficient coding scheme with only O(N log N) neurons is employed where N is the number of modules. The neurons are evolved in groups of N in log N iteration steps such that the circuit is recursively partitioned in alternating vertical and horizontal directions. In our simulations, the network was able to find optimal solutions to all test problems with up to 128 modules.

Assessment of Masonry Buildings Subjected to Landslide-Induced Settlements: From Load Path Method to Evolutionary Optimization Method

NASA Astrophysics Data System (ADS)

Palmisano, Fabrizio; Elia, Angelo

2017-10-01

One of the main difficulties, when dealing with landslide structural vulnerability, is the diagnosis of the causes of crack patterns. This is also due to the excessive complexity of models based on classical structural mechanics that makes them inappropriate especially when there is the necessity to perform a rapid vulnerability assessment at the territorial scale. This is why, a new approach, based on a ‘simple model’ (i.e. the Load Path Method, LPM), has been proposed by Palmisano and Elia for the interpretation of the behaviour of masonry buildings subjected to landslide-induced settlements. However, the LPM is very useful for rapidly finding the 'most plausible solution' instead of the exact solution. To find the solution, optimization algorithms are necessary. In this scenario, this article aims to show how the Bidirectional Evolutionary Structural Optimization method by Huang and Xie, can be very useful to optimize the strut-and-tie models obtained by using the Load Path Method.

Use of colour Doppler and M-mode ultrasonography to confirm the location of an epidural catheter - a retrospective case series.

PubMed

Elsharkawy, Hesham; Sonny, Abraham; Govindarajan, Srinivasa Raghavan; Chan, Vincent

2017-05-01

Epidural anesthesia and analgesia has a reported failure rate ranging from 13% to 32%. We describe a technique using colour Doppler and M-mode ultrasonography to determine the position of the epidural catheter after placement in adults. This retrospective review included 37 adult patients who received postoperative epidural analgesia and underwent technically difficult epidural catheter placement. The demographic characteristics, type of surgery, use of ultrasonography, method of insertion, intervertebral level, and success of epidural localization using colour Doppler were noted for each patient. Pain scores on postoperative day 1 and the presence of a patchy block were also reviewed. Colour Doppler study helped to indicate the catheter's path from the skin to the epidural space during saline injection in 33 patients (89%). Saline flow within the epidural space (catheter tip confirmation) was successfully detected with colour Doppler in 25 patients (67.5%) and with M-mode ultrasonography in 28 patients (75%). Appropriate dermatomal analgesia was noted in 35 patients (94.5%) during local anesthetic infusion. Our preliminary data suggest the feasibility of using colour Doppler and M-mode ultrasonography to confirm proper epidural catheter placement.

Optimization of MLS receivers for multipath environments

NASA Technical Reports Server (NTRS)

Mcalpine, G. A.; Irwin, S. H.; NELSON; Roleyni, G.

1977-01-01

Optimal design studies of MLS angle-receivers and a theoretical design-study of MLS DME-receivers are reported. The angle-receiver results include an integration of the scan data processor and tracking filter components of the optimal receiver into a unified structure. An extensive simulation study comparing the performance of the optimal and threshold receivers in a wide variety of representative dynamical interference environments was made. The optimal receiver was generally superior. A simulation of the performance of the threshold and delay-and-compare receivers in various signal environments was performed. An analysis of combined errors due to lateral reflections from vertical structures with small differential path delays, specular ground reflections with neglible differential path delays, and thermal noise in the receivers is provided.

Predictive Cache Modeling and Analysis

DTIC Science & Technology

2011-11-01

metaheuristic /bin-packing algorithm to optimize task placement based on task communication characterization. Our previous work on task allocation showed...Cache Miss Minimization Technology To efficiently explore combinations and discover nearly-optimal task-assignment algorithms , we extended to our...it was possible to use our algorithmic techniques to decrease network bandwidth consumption by ~25%. In this effort, we adapted these existing

A Compensatory Approach to Optimal Selection with Mastery Scores. Research Report 94-2.

ERIC Educational Resources Information Center

van der Linden, Wim J.; Vos, Hans J.

This paper presents some Bayesian theories of simultaneous optimization of decision rules for test-based decisions. Simultaneous decision making arises when an institution has to make a series of selection, placement, or mastery decisions with respect to subjects from a population. An obvious example is the use of individualized instruction in…

Actuator placement in prestressed adaptive trusses for vibration control

NASA Technical Reports Server (NTRS)

Jalihal, P.; Utku, Senol; Wada, Ben K.

1993-01-01

This paper describes the optimal location selection of actuators for vibration control in prestressed adaptive trusses. Since prestressed adaptive trusses are statically indeterminate, the actuators to be used for vibration control purposes must work against (1) existing static axial prestressing forces, (2) static axial forces caused by the actuation, and (3) dynamic axial forces caused by the motion of the mass. In statically determinate adaptive trusses (1) and (2) are non - existing. The actuator placement problem in statically indeterminate trusses is therefore governed by the actuation energy and the actuator strength requirements. Assuming output feedback type control of selected vibration modes in autonomous systems, a procedure is given for the placement of vibration controlling actuators in prestressed adaptive trusses.

Planification de trajectoires pour placement automatise de fibres sur surfaces de geometries complexes

NASA Astrophysics Data System (ADS)

Hely, Clement

During the past 50 years, the use of composite materials drastically increase, mainly thanks to the interest of aeronautical industries for these strong and lightweight materials. To improve the productivity of composite materials manufacturing some of the largest aeronautics companies began to develop automated processes such as Automated Fibre Placement (AFP). The AFP workcells currently used by the industry were mainly developed for production of large, nearly flat, plates with low curvatures such as aircraft fuselages. However, the fields of aeronautics and sport goods production begin nowadays to show an interest for manufacturing of smaller and more complex parts. The aim of the project in which this research takes place is to design a new AFP workcell and to develop new techniques allowing production of parts with small size and complex geometry. The work presented in this thesis focuses on the path planning on multi-axial revolution surfaces, e.g. Y-shaped tubes of constant circular cross section. Several path planning algorithms will be presented aiming at the exhaustive coverage of a mandrel with pre-impregnated (prepreg) composite tape. The methodology used in two of these algorithms is to individually cover each branch of the Y-shaped part with paths deriving from a helix. In the first one, the helix will be cut at the boundary between a branch and the junction region (algorithm HD) while in the second (algorithm HA) the pseudo-helix path can be adjusted to follow this boundary. These two methods were shown to have some drawbacks compromising their practical use and possibly leading to parts with diminished mechanical properties. To avoid these drawbacks, two others algorithms were developed with a new methodology. With them, the aim is to cover two branches of the Y-shape with a continuous course (i.e. without cut). The first one uses a well known strategy which defines plies with a constant fibre orientation. Parallel paths are then computed to generate a full and uniform ply covering two branches. Once again this method suffers from a main drawback, namely that it can produce highly curved paths leading to manufacturing defects. To overcome this limitation, a last algorithm is proposed ensuring that the maximal curvature of a trajectory stays below a fixed threshold. However, fulfilling this constraint prevents to predict the complete shape of the path and to ensure a perfectly uniform coverage. It is thus proposed to generate an exhaustive set of trajectories having different shapes and covering all the part. Then, a selection algorithm is used to choose the ones which are best suited according to selection criteria. To help the definition of these criteria, a finite element analysis is conducted to give some insight concerning the best suited shapes for specific loading cases. Finally, simulations were carried out with a workcell constituted by a robotic manipulator associated with a rotary table to verify the feasibility of the paths generated by the different algorithms.

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.

Impulsive noise suppression in color images based on the geodesic digital paths

NASA Astrophysics Data System (ADS)

Smolka, Bogdan; Cyganek, Boguslaw

2015-02-01

In the paper a novel filtering design based on the concept of exploration of the pixel neighborhood by digital paths is presented. The paths start from the boundary of a filtering window and reach its center. The cost of transitions between adjacent pixels is defined in the hybrid spatial-color space. Then, an optimal path of minimum total cost, leading from pixels of the window's boundary to its center is determined. The cost of an optimal path serves as a degree of similarity of the central pixel to the samples from the local processing window. If a pixel is an outlier, then all the paths starting from the window's boundary will have high costs and the minimum one will also be high. The filter output is calculated as a weighted mean of the central pixel and an estimate constructed using the information on the minimum cost assigned to each image pixel. So, first the costs of optimal paths are used to build a smoothed image and in the second step the minimum cost of the central pixel is utilized for construction of the weights of a soft-switching scheme. The experiments performed on a set of standard color images, revealed that the efficiency of the proposed algorithm is superior to the state-of-the-art filtering techniques in terms of the objective restoration quality measures, especially for high noise contamination ratios. The proposed filter, due to its low computational complexity, can be applied for real time image denoising and also for the enhancement of video streams.

The S-Tunnel for tunnelled dialysis catheter: an alternative approach to the prevention of displacement.

PubMed

Jenkins, Glyndwr W; Kelly, Michael; Anwar, Siddiq; Ahmed, Saeed S

2015-01-01

Vascular access has been described in the literature anywhere from the 'Achilles Heel' to the 'Cornerstone' of haemodialysis. Displacement of a central venous catheter is not an uncommon occurrence. We discuss an alternative method of placement for the tunnelled central venous catheter to prevent displacement in those patients with excess anterior chest wall soft tissue. A new surgical technique for placement of a tunnelled central venous catheter was developed in an attempt to reduce the number of displacements. This involved the creation of a second tunnel at a 90° angle to the original retrograde tunnelled path. The authors have currently placed five 'S-Line' tunnelled central venous catheters with no reports of displacement or line infection over a period of 18 months. The 'S-Line' offers a simple, straightforward and most importantly safe method to reduce the incidence of tunnelled right internal jugular central venous catheter displacement.

Effect of reflected and refracted signals on coherent underwater acoustic communication: results from the Kauai experiment (KauaiEx 2003).

PubMed

Rouseff, Daniel; Badiey, Mohsen; Song, Aijun

2009-11-01

The performance of a communications equalizer is quantified in terms of the number of acoustic paths that are treated as usable signal. The analysis uses acoustical and oceanographic data collected off the Hawaiian Island of Kauai. Communication signals were measured on an eight-element vertical array at two different ranges, 1 and 2 km, and processed using an equalizer based on passive time-reversal signal processing. By estimating the Rayleigh parameter, it is shown that all paths reflected by the sea surface at both ranges undergo incoherent scattering. It is demonstrated that some of these incoherently scattered paths are still useful for coherent communications. At range of 1 km, optimal communications performance is achieved when six acoustic paths are retained and all paths with more than one reflection off the sea surface are rejected. Consistent with a model that ignores loss from near-surface bubbles, the performance improves by approximately 1.8 dB when increasing the number of retained paths from four to six. The four-path results though are more stable and require less frequent channel estimation. At range of 2 km, ray refraction is observed and communications performance is optimal when some paths with two sea-surface reflections are retained.

Development of a multiobjective optimization tool for the selection and placement of best management practices for nonpoint source pollution control

NASA Astrophysics Data System (ADS)

Maringanti, Chetan; Chaubey, Indrajeet; Popp, Jennie

2009-06-01

Best management practices (BMPs) are effective in reducing the transport of agricultural nonpoint source pollutants to receiving water bodies. However, selection of BMPs for placement in a watershed requires optimization of the available resources to obtain maximum possible pollution reduction. In this study, an optimization methodology is developed to select and place BMPs in a watershed to provide solutions that are both economically and ecologically effective. This novel approach develops and utilizes a BMP tool, a database that stores the pollution reduction and cost information of different BMPs under consideration. The BMP tool replaces the dynamic linkage of the distributed parameter watershed model during optimization and therefore reduces the computation time considerably. Total pollutant load from the watershed, and net cost increase from the baseline, were the two objective functions minimized during the optimization process. The optimization model, consisting of a multiobjective genetic algorithm (NSGA-II) in combination with a watershed simulation tool (Soil Water and Assessment Tool (SWAT)), was developed and tested for nonpoint source pollution control in the L'Anguille River watershed located in eastern Arkansas. The optimized solutions provided a trade-off between the two objective functions for sediment, phosphorus, and nitrogen reduction. The results indicated that buffer strips were very effective in controlling the nonpoint source pollutants from leaving the croplands. The optimized BMP plans resulted in potential reductions of 33%, 32%, and 13% in sediment, phosphorus, and nitrogen loads, respectively, from the watershed.

Optimal Predictive Control for Path Following of a Full Drive-by-Wire Vehicle at Varying Speeds

NASA Astrophysics Data System (ADS)

SONG, Pan; GAO, Bolin; XIE, Shugang; FANG, Rui

2017-05-01

The current research of the global chassis control problem for the full drive-by-wire vehicle focuses on the control allocation (CA) of the four-wheel-distributed traction/braking/steering systems. However, the path following performance and the handling stability of the vehicle can be enhanced a step further by automatically adjusting the vehicle speed to the optimal value. The optimal solution for the combined longitudinal and lateral motion control (MC) problem is given. First, a new variable step-size spatial transformation method is proposed and utilized in the prediction model to derive the dynamics of the vehicle with respect to the road, such that the tracking errors can be explicitly obtained over the prediction horizon at varying speeds. Second, a nonlinear model predictive control (NMPC) algorithm is introduced to handle the nonlinear coupling between any two directions of the vehicular planar motion and computes the sequence of the optimal motion states for following the desired path. Third, a hierarchical control structure is proposed to separate the motion controller into a NMPC based path planner and a terminal sliding mode control (TSMC) based path follower. As revealed through off-line simulations, the hierarchical methodology brings nearly 1700% improvement in computational efficiency without loss of control performance. Finally, the control algorithm is verified through a hardware in-the-loop simulation system. Double-lane-change (DLC) test results show that by using the optimal predictive controller, the root-mean-square (RMS) values of the lateral deviations and the orientation errors can be reduced by 41% and 30%, respectively, comparing to those by the optimal preview acceleration (OPA) driver model with the non-preview speed-tracking method. Additionally, the average vehicle speed is increased by 0.26 km/h with the peak sideslip angle suppressed to 1.9°. This research proposes a novel motion controller, which provides the full drive-by-wire vehicle with better lane-keeping and collision-avoidance capabilities during autonomous driving.

Is addiction a failure of rationality?

PubMed

Ferguson, Brian

2012-01-01

This note argues that addiction itself can be seen as a form of double failure, specifically the failure to stick to a predetermined optimal lifetime consumption path for an addictive commodity, which failure might be the result of bad luck, and the failure to adjust the level of consumption of the addictive commodity once the consumer is off their optimal path, which might be seen as a failure of judgment.

Springback effects during single point incremental forming: Optimization of the tool path

NASA Astrophysics Data System (ADS)

Giraud-Moreau, Laurence; Belchior, Jérémy; Lafon, Pascal; Lotoing, Lionel; Cherouat, Abel; Courtielle, Eric; Guines, Dominique; Maurine, Patrick

2018-05-01

Incremental sheet forming is an emerging process to manufacture sheet metal parts. This process is more flexible than conventional one and well suited for small batch production or prototyping. During the process, the sheet metal blank is clamped by a blank-holder and a small-size smooth-end hemispherical tool moves along a user-specified path to deform the sheet incrementally. Classical three-axis CNC milling machines, dedicated structure or serial robots can be used to perform the forming operation. Whatever the considered machine, large deviations between the theoretical shape and the real shape can be observed after the part unclamping. These deviations are due to both the lack of stiffness of the machine and residual stresses in the part at the end of the forming stage. In this paper, an optimization strategy of the tool path is proposed in order to minimize the elastic springback induced by residual stresses after unclamping. A finite element model of the SPIF process allowing the shape prediction of the formed part with a good accuracy is defined. This model, based on appropriated assumptions, leads to calculation times which remain compatible with an optimization procedure. The proposed optimization method is based on an iterative correction of the tool path. The efficiency of the method is shown by an improvement of the final shape.

Quadcopter Path Following Control Design Using Output Feedback with Command Generator Tracker LOS Based At Square Path

NASA Astrophysics Data System (ADS)

Nugraha, A. T.; Agustinah, T.

2018-01-01

Quadcopter an unstable system, underactuated and nonlinear in quadcopter control research developments become an important focus of attention. In this study, following the path control method for position on the X and Y axis, used structure-Generator Tracker Command (CGT) is tested. Attitude control and position feedback quadcopter is compared using the optimal output. The addition of the H∞ performance optimal output feedback control is used to maintain the stability and robustness of quadcopter. Iterative numerical techniques Linear Matrix Inequality (LMI) is used to find the gain controller. The following path control problems is solved using the method of LQ regulators with output feedback. Simulations show that the control system can follow the paths that have been defined in the form of a reference signal square shape. The result of the simulation suggest that the method which used can bring the yaw angle at the expected value algorithm. Quadcopter can do automatically following path with cross track error mean X=0.5 m and Y=0.2 m.

Nanoscale imaging of clinical specimens using pathology-optimized expansion microscopy

PubMed Central

Zhao, Yongxin; Bucur, Octavian; Irshad, Humayun; Chen, Fei; Weins, Astrid; Stancu, Andreea L.; Oh, Eun-Young; DiStasio, Marcello; Torous, Vanda; Glass, Benjamin; Stillman, Isaac E.; Schnitt, Stuart J.; Beck, Andrew H.; Boyden, Edward S.

2017-01-01

Expansion microscopy (ExM), a method for improving the resolution of light microscopy by physically expanding the specimen, has not been applied to clinical tissue samples. Here we report a clinically optimized form of ExM that supports nanoscale imaging of human tissue specimens that have been fixed with formalin, embedded in paraffin, stained with hematoxylin and eosin (H&E), and/or fresh frozen. The method, which we call expansion pathology (ExPath), converts clinical samples into an ExM-compatible state, then applies an ExM protocol with protein anchoring and mechanical homogenization steps optimized for clinical samples. ExPath enables ~70 nm resolution imaging of diverse biomolecules in intact tissues using conventional diffraction-limited microscopes, and standard antibody and fluorescent DNA in situ hybridization reagents. We use ExPath for optical diagnosis of kidney minimal-change disease, which previously required electron microscopy (EM), and demonstrate high-fidelity computational discrimination between early breast neoplastic lesions that to date have challenged human judgment. ExPath may enable the routine use of nanoscale imaging in pathology and clinical research. PMID:28714966

A star recognition method based on the Adaptive Ant Colony algorithm for star sensors.

PubMed

Quan, Wei; Fang, Jiancheng

2010-01-01

A new star recognition method based on the Adaptive Ant Colony (AAC) algorithm has been developed to increase the star recognition speed and success rate for star sensors. This method draws circles, with the center of each one being a bright star point and the radius being a special angular distance, and uses the parallel processing ability of the AAC algorithm to calculate the angular distance of any pair of star points in the circle. The angular distance of two star points in the circle is solved as the path of the AAC algorithm, and the path optimization feature of the AAC is employed to search for the optimal (shortest) path in the circle. This optimal path is used to recognize the stellar map and enhance the recognition success rate and speed. The experimental results show that when the position error is about 50″, the identification success rate of this method is 98% while the Delaunay identification method is only 94%. The identification time of this method is up to 50 ms.

Nanoscale imaging of clinical specimens using pathology-optimized expansion microscopy.

PubMed

Zhao, Yongxin; Bucur, Octavian; Irshad, Humayun; Chen, Fei; Weins, Astrid; Stancu, Andreea L; Oh, Eun-Young; DiStasio, Marcello; Torous, Vanda; Glass, Benjamin; Stillman, Isaac E; Schnitt, Stuart J; Beck, Andrew H; Boyden, Edward S

2017-08-01

Expansion microscopy (ExM), a method for improving the resolution of light microscopy by physically expanding a specimen, has not been applied to clinical tissue samples. Here we report a clinically optimized form of ExM that supports nanoscale imaging of human tissue specimens that have been fixed with formalin, embedded in paraffin, stained with hematoxylin and eosin, and/or fresh frozen. The method, which we call expansion pathology (ExPath), converts clinical samples into an ExM-compatible state, then applies an ExM protocol with protein anchoring and mechanical homogenization steps optimized for clinical samples. ExPath enables ∼70-nm-resolution imaging of diverse biomolecules in intact tissues using conventional diffraction-limited microscopes and standard antibody and fluorescent DNA in situ hybridization reagents. We use ExPath for optical diagnosis of kidney minimal-change disease, a process that previously required electron microscopy, and we demonstrate high-fidelity computational discrimination between early breast neoplastic lesions for which pathologists often disagree in classification. ExPath may enable the routine use of nanoscale imaging in pathology and clinical research.

Efficient evaluation of atom tunneling combined with electronic structure calculations.

PubMed

Ásgeirsson, Vilhjálmur; Arnaldsson, Andri; Jónsson, Hannes

2018-03-14

Methodology for finding optimal tunneling paths and evaluating tunneling rates for atomic rearrangements is described. First, an optimal JWKB tunneling path for a system with fixed energy is obtained using a line integral extension of the nudged elastic band method. Then, a calculation of the dynamics along the path is used to determine the temperature at which it corresponds to an optimal Feynman path for thermally activated tunneling (instanton) and a harmonic approximation is used to estimate the transition rate. The method is illustrated with calculations for a modified two-dimensional Müller-Brown surface but is efficient enough to be used in combination with electronic structure calculations of the energy and atomic forces in systems containing many atoms. An example is presented where tunneling is the dominant mechanism well above room temperature as an H 3 BNH 3 molecule dissociates to form H 2 . Also, a solid-state example is presented where density functional theory calculations of H atom tunneling in a Ta crystal give close agreement with experimental measurements on hydrogen diffusion over a wide range in temperature.

Cannula Versus Sharp Needle for Placement of Soft Tissue Fillers: An Observational Cadaver Study.

PubMed

van Loghem, Jani A J; Humzah, Dalvi; Kerscher, Martina

2017-12-13

Soft-tissue fillers have become important products for facial rejuvenation. Deep fat compartments and facial bones lose volume during the natural aging process. For the most natural-looking results, deep volumetric injections at strategic sites are therefore preferred. Supraperiosteal placement is performed with a sharp needle or a non-traumatic cannula. The primary objective was to determine whether there is a difference in precision between supraperiosteal placement with a sharp needle compared with a non-traumatic cannula in cadaver specimens. A secondary objective was to analyze the safety profiles of both injection techniques. Cadaver heads were injected with dye material and soft-tissue fillers at multiple aesthetic facial sites on the supraperiosteum and subsequently dissected for observation of dye and filler placement. The non-traumatic cannula technique resulted in product being confined to the deep anatomic layers. In contrast, with the sharp needle technique, material was placed in multiple anatomic layers, from the periosteum to more superficial skin layers. For both techniques results were consistent for all facial sites. Although direct extrapolation from cadavers to the in vivo situation cannot be made, cannulae showed more precision in placement of product. With the sharp needle, the material was injected on the periosteum, and then migrated in a retrograde direction along the trajectory of the needle path, ending up in multiple anatomic layers. The sharp needle technique also showed a higher complication risk with intra-arterial injection occurring, even though the needle tip was positioned on the periosteum and the product was injected with the needle in constant contact with the periosteum. © 2016 The American Society for Aesthetic Plastic Surgery, Inc. Reprints and permission: journals.permissions@oup.com

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.

Image-guided laser projection for port placement in minimally invasive surgery.

PubMed

Marmurek, Jonathan; Wedlake, Chris; Pardasani, Utsav; Eagleson, Roy; Peters, Terry

2006-01-01

We present an application of an augmented reality laser projection system in which procedure-specific optimal incision sites, computed from pre-operative image acquisition, are superimposed on a patient to guide port placement in minimally invasive surgery. Tests were conducted to evaluate the fidelity of computed and measured port configurations, and to validate the accuracy with which a surgical tool-tip can be placed at an identified virtual target. A high resolution volumetric image of a thorax phantom was acquired using helical computed tomography imaging. Oriented within the thorax, a phantom organ with marked targets was visualized in a virtual environment. A graphical interface enabled marking the locations of target anatomy, and calculation of a grid of potential port locations along the intercostal rib lines. Optimal configurations of port positions and tool orientations were determined by an objective measure reflecting image-based indices of surgical dexterity, hand-eye alignment, and collision detection. Intra-operative registration of the computed virtual model and the phantom anatomy was performed using an optical tracking system. Initial trials demonstrated that computed and projected port placement provided direct access to target anatomy with an accuracy of 2 mm.

Therapeutic esophageal interventions for dysphagia and bleeding.

PubMed

Siersema, Peter D

2006-07-01

This article reviews the most notable results of esophageal interventions for dysphagia and bleeding published in 2005. Long-term rubber tube placement was shown to be an interesting treatment option for difficult esophageal strictures. Two studies demonstrated that only 50% of patients who had undergone pneumatic dilation for achalasia were dysphagia-free after long-term follow-up. It was shown that patients with dysphagia from esophageal cancer should be treated by intraluminal radiotherapy (brachytherapy), whereas stent placement was preferable in those with a poor prognosis. Temporary stent placement is an option in patients undergoing radiotherapy for inoperable esophageal cancer to increase the dysphagia-free period. Two studies were published on the successful use of silicone-covered plastic stents for sealing of leaks after surgery of the esophagus. The optimal treatment for bleeding varices was confirmed to be endoscopic band ligation. A meta-analysis demonstrated that adding sclerotherapy to band ligation for secondary prophylaxis of bleeding varices had no effect on clinical outcome. In 2005, new techniques for the treatment of complicated strictures were presented. In addition, expanding indications for stents were reported. Finally, endoscopic band ligation was confirmed to be the most optimal technique for the treatment of varices.

Optimizing the positional relationships between instruments used in laparoscopic simulation using a simple trigonometric method.

PubMed

Lorias Espinoza, Daniel; Ordorica Flores, Ricardo; Minor Martínez, Arturo; Gutiérrez Gnecchi, José Antonio

2014-06-01

Various methods for evaluating laparoscopic skill have been reported, but without detailed information on the configuration used they are difficult to reproduce. Here we present a method based on the trigonometric relationships between the instruments used in a laparoscopic training platform in order to provide a tool to aid in the reproducible assessment of surgical laparoscopic technique. The positions of the instruments were represented using triangles. Basic trigonometry was used to objectively establish the distances among the working ports RL, the placement of the optical port h', and the placement of the surgical target OT. The optimal configuration of a training platform depends on the selected working angles, the intracorporeal/extracorporeal lengths of the instrument, and the depth of the surgical target. We demonstrate that some distances, angles, and positions of the instruments are inappropriate for satisfactory laparoscopy. By applying basic trigonometric principles we can determine the ideal placement of the working ports and the optics in a simple, precise, and objective way. In addition, because the method is based on parameters known to be important in both the performance and quantitative quality of laparoscopy, the results are generalizable to different training platforms and types of laparoscopic surgery.

Path Planning Algorithms for Autonomous Border Patrol Vehicles

NASA Astrophysics Data System (ADS)

Lau, George Tin Lam

This thesis presents an online path planning algorithm developed for unmanned vehicles in charge of autonomous border patrol. In this Pursuit-Evasion game, the unmanned vehicle is required to capture multiple trespassers on its own before any of them reach a target safe house where they are safe from capture. The problem formulation is based on Isaacs' Target Guarding problem, but extended to the case of multiple evaders. The proposed path planning method is based on Rapidly-exploring random trees (RRT) and is capable of producing trajectories within several seconds to capture 2 or 3 evaders. Simulations are carried out to demonstrate that the resulting trajectories approach the optimal solution produced by a nonlinear programming-based numerical optimal control solver. Experiments are also conducted on unmanned ground vehicles to show the feasibility of implementing the proposed online path planning algorithm on physical applications.

Tracking trade transactions in water resource systems: A node-arc optimization formulation

NASA Astrophysics Data System (ADS)

Erfani, Tohid; Huskova, Ivana; Harou, Julien J.

2013-05-01

We formulate and apply a multicommodity network flow node-arc optimization model capable of tracking trade transactions in complex water resource systems. The model uses a simple node to node network connectivity matrix and does not require preprocessing of all possible flow paths in the network. We compare the proposed node-arc formulation with an existing arc-path (flow path) formulation and explain the advantages and difficulties of both approaches. We verify the proposed formulation model on a hypothetical water distribution network. Results indicate the arc-path model solves the problem with fewer constraints, but the proposed formulation allows using a simple network connectivity matrix which simplifies modeling large or complex networks. The proposed algorithm allows converting existing node-arc hydroeconomic models that broadly represent water trading to ones that also track individual supplier-receiver relationships (trade transactions).

Development of a new integrated local trajectory planning and tracking control framework for autonomous ground vehicles

NASA Astrophysics Data System (ADS)

Li, Xiaohui; Sun, Zhenping; Cao, Dongpu; Liu, Daxue; He, Hangen

2017-03-01

This study proposes a novel integrated local trajectory planning and tracking control (ILTPTC) framework for autonomous vehicles driving along a reference path with obstacles avoidance. For this ILTPTC framework, an efficient state-space sampling-based trajectory planning scheme is employed to smoothly follow the reference path. A model-based predictive path generation algorithm is applied to produce a set of smooth and kinematically-feasible paths connecting the initial state with the sampling terminal states. A velocity control law is then designed to assign a speed value at each of the points along the generated paths. An objective function considering both safety and comfort performance is carefully formulated for assessing the generated trajectories and selecting the optimal one. For accurately tracking the optimal trajectory while overcoming external disturbances and model uncertainties, a combined feedforward and feedback controller is developed. Both simulation analyses and vehicle testing are performed to verify the effectiveness of the proposed ILTPTC framework, and future research is also briefly discussed.

Career path to CFO: selection, training, and placement.

PubMed

Sieveking, N; Wood, D L

1994-06-01

Not long ago, chief financial officers (CFOs) in hospitals could focus almost exclusively on financial accounting. Today, however, financial managers must tend diverse tasks of coordination, education, and professional specialization. The authors suggest that those who desire the position of CFO would do well to couple accounting expertise with a capacity to understand ethics and mores, economics, descriptive and predictive statistics, people from diverse socioeconomic and cultural backgrounds, as well as features of disease, its prevention, and course of treatment.

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

Ambulatory estimation of foot placement during walking using inertial sensors.

PubMed

Martin Schepers, H; van Asseldonk, Edwin H F; Baten, Chris T M; Veltink, Peter H

2010-12-01

This study proposes a method to assess foot placement during walking using an ambulatory measurement system consisting of orthopaedic sandals equipped with force/moment sensors and inertial sensors (accelerometers and gyroscopes). Two parameters, lateral foot placement (LFP) and stride length (SL), were estimated for each foot separately during walking with eyes open (EO), and with eyes closed (EC) to analyze if the ambulatory system was able to discriminate between different walking conditions. For validation, the ambulatory measurement system was compared to a reference optical position measurement system (Optotrak). LFP and SL were obtained by integration of inertial sensor signals. To reduce the drift caused by integration, LFP and SL were defined with respect to an average walking path using a predefined number of strides. By varying this number of strides, it was shown that LFP and SL could be best estimated using three consecutive strides. LFP and SL estimated from the instrumented shoe signals and with the reference system showed good correspondence as indicated by the RMS difference between both measurement systems being 6.5 ± 1.0 mm (mean ± standard deviation) for LFP, and 34.1 ± 2.7 mm for SL. Additionally, a statistical analysis revealed that the ambulatory system was able to discriminate between the EO and EC condition, like the reference system. It is concluded that the ambulatory measurement system was able to reliably estimate foot placement during walking. Copyright © 2010 Elsevier Ltd. All rights reserved.

Risk factors for technical failure of endoscopic double self-expandable metallic stent placement by partial stent-in-stent method.

PubMed

Kawakubo, Kazumichi; Kawakami, Hiroshi; Toyokawa, Yoshihide; Otani, Koichi; Kuwatani, Masaki; Abe, Yoko; Kawahata, Shuhei; Kubo, Kimitoshi; Kubota, Yoshimasa; Sakamoto, Naoya

2015-01-01

Endoscopic double self-expandable metallic stent (SEMS) placement by the partial stent-in-stent (PSIS) method has been reported to be useful for the management of unresectable hilar malignant biliary obstruction. However, it is technically challenging, and the optimal SEMS for the procedure remains unknown. The aim of this study was to identify the risk factors for technical failure of endoscopic double SEMS placement for unresectable malignant hilar biliary obstruction (MHBO). Between December 2009 and May 2013, 50 consecutive patients with MHBO underwent endoscopic double SEMS placement by the PSIS method. We retrospectively evaluated the rate of successful double SEMS placement and identified the risk factors for technical failure. The technical success rate for double SEMS placement was 82.0% (95% confidence interval [CI]: 69.2-90.2). On univariate analysis, the rate of technical failure was high in patients with metastatic disease and unilateral placement. Multivariate analysis revealed that metastatic disease was a significant risk factor for technical failure (odds ratio: 9.63, 95% CI: 1.11-105.5). The subgroup analysis after double guidewire insertion showed that the rate of technical success was higher in the laser-cut type SEMS with a large mesh and thick delivery system than in the braided type SEMS with a small mesh and thick delivery system. Metastatic disease was a significant risk factor for technical failure of double SEMS placement for unresectable MHBO. The laser-cut type SEMS with a large mesh and thin delivery system might be preferable for the PSIS procedure. © 2014 Japanese Society of Hepato-Biliary-Pancreatic Surgery.

Enhanced nonlinearity interval mapping scheme for high-performance simulation-optimization of watershed-scale BMP placement

NASA Astrophysics Data System (ADS)

Zou, Rui; Riverson, John; Liu, Yong; Murphy, Ryan; Sim, Youn

2015-03-01

Integrated continuous simulation-optimization models can be effective predictors of a process-based responses for cost-benefit optimization of best management practices (BMPs) selection and placement. However, practical application of simulation-optimization model is computationally prohibitive for large-scale systems. This study proposes an enhanced Nonlinearity Interval Mapping Scheme (NIMS) to solve large-scale watershed simulation-optimization problems several orders of magnitude faster than other commonly used algorithms. An efficient interval response coefficient (IRC) derivation method was incorporated into the NIMS framework to overcome a computational bottleneck. The proposed algorithm was evaluated using a case study watershed in the Los Angeles County Flood Control District. Using a continuous simulation watershed/stream-transport model, Loading Simulation Program in C++ (LSPC), three nested in-stream compliance points (CP)—each with multiple Total Maximum Daily Loads (TMDL) targets—were selected to derive optimal treatment levels for each of the 28 subwatersheds, so that the TMDL targets at all the CP were met with the lowest possible BMP implementation cost. Genetic Algorithm (GA) and NIMS were both applied and compared. The results showed that the NIMS took 11 iterations (about 11 min) to complete with the resulting optimal solution having a total cost of 67.2 million, while each of the multiple GA executions took 21-38 days to reach near optimal solutions. The best solution obtained among all the GA executions compared had a minimized cost of 67.7 million—marginally higher, but approximately equal to that of the NIMS solution. The results highlight the utility for decision making in large-scale watershed simulation-optimization formulations.

Optimal path planning for a mobile robot using cuckoo search algorithm

NASA Astrophysics Data System (ADS)

Mohanty, Prases K.; Parhi, Dayal R.

2016-03-01

The shortest/optimal path planning is essential for efficient operation of autonomous vehicles. In this article, a new nature-inspired meta-heuristic algorithm has been applied for mobile robot path planning in an unknown or partially known environment populated by a variety of static obstacles. This meta-heuristic algorithm is based on the levy flight behaviour and brood parasitic behaviour of cuckoos. A new objective function has been formulated between the robots and the target and obstacles, which satisfied the conditions of obstacle avoidance and target-seeking behaviour of robots present in the terrain. Depending upon the objective function value of each nest (cuckoo) in the swarm, the robot avoids obstacles and proceeds towards the target. The smooth optimal trajectory is framed with this algorithm when the robot reaches its goal. Some simulation and experimental results are presented at the end of the paper to show the effectiveness of the proposed navigational controller.

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

Graf, Peter; Dykes, Katherine; Scott, George

The layout of turbines in a wind farm is already a challenging nonlinear, nonconvex, nonlinearly constrained continuous global optimization problem. Here we begin to address the next generation of wind farm optimization problems by adding the complexity that there is more than one turbine type to choose from. The optimization becomes a nonlinear constrained mixed integer problem, which is a very difficult class of problems to solve. Furthermore, this document briefly summarizes the algorithm and code we have developed, the code validation steps we have performed, and the initial results for multi-turbine type and placement optimization (TTP_OPT) we have run.

Genetic algorithm based task reordering to improve the performance of batch scheduled massively parallel scientific applications

DOE PAGES

Sankaran, Ramanan; Angel, Jordan; Brown, W. Michael

2015-04-08

The growth in size of networked high performance computers along with novel accelerator-based node architectures has further emphasized the importance of communication efficiency in high performance computing. The world's largest high performance computers are usually operated as shared user facilities due to the costs of acquisition and operation. Applications are scheduled for execution in a shared environment and are placed on nodes that are not necessarily contiguous on the interconnect. Furthermore, the placement of tasks on the nodes allocated by the scheduler is sub-optimal, leading to performance loss and variability. Here, we investigate the impact of task placement on themore » performance of two massively parallel application codes on the Titan supercomputer, a turbulent combustion flow solver (S3D) and a molecular dynamics code (LAMMPS). Benchmark studies show a significant deviation from ideal weak scaling and variability in performance. The inter-task communication distance was determined to be one of the significant contributors to the performance degradation and variability. A genetic algorithm-based parallel optimization technique was used to optimize the task ordering. This technique provides an improved placement of the tasks on the nodes, taking into account the application's communication topology and the system interconnect topology. As a result, application benchmarks after task reordering through genetic algorithm show a significant improvement in performance and reduction in variability, therefore enabling the applications to achieve better time to solution and scalability on Titan during production.« less

Motion Planning and Synthesis of Human-Like Characters in Constrained Environments

NASA Astrophysics Data System (ADS)

Zhang, Liangjun; Pan, Jia; Manocha, Dinesh

We give an overview of our recent work on generating naturally-looking human motion in constrained environments with multiple obstacles. This includes a whole-body motion planning algorithm for high DOF human-like characters. The planning problem is decomposed into a sequence of low dimensional sub-problems. We use a constrained coordination scheme to solve the sub-problems in an incremental manner and a local path refinement algorithm to compute collision-free paths in tight spaces and satisfy the statically stable constraint on CoM. We also present a hybrid algorithm to generate plausible motion by combing the motion computed by our planner with mocap data. We demonstrate the performance of our algorithm on a 40 DOF human-like character and generate efficient motion strategies for object placement, bending, walking, and lifting in complex environments.

Minimal entropy probability paths between genome families.

PubMed

Ahlbrandt, Calvin; Benson, Gary; Casey, William

2004-05-01

We develop a metric for probability distributions with applications to biological sequence analysis. Our distance metric is obtained by minimizing a functional defined on the class of paths over probability measures on N categories. The underlying mathematical theory is connected to a constrained problem in the calculus of variations. The solution presented is a numerical solution, which approximates the true solution in a set of cases called rich paths where none of the components of the path is zero. The functional to be minimized is motivated by entropy considerations, reflecting the idea that nature might efficiently carry out mutations of genome sequences in such a way that the increase in entropy involved in transformation is as small as possible. We characterize sequences by frequency profiles or probability vectors, in the case of DNA where N is 4 and the components of the probability vector are the frequency of occurrence of each of the bases A, C, G and T. Given two probability vectors a and b, we define a distance function based as the infimum of path integrals of the entropy function H( p) over all admissible paths p(t), 0 < or = t< or =1, with p(t) a probability vector such that p(0)=a and p(1)=b. If the probability paths p(t) are parameterized as y(s) in terms of arc length s and the optimal path is smooth with arc length L, then smooth and "rich" optimal probability paths may be numerically estimated by a hybrid method of iterating Newton's method on solutions of a two point boundary value problem, with unknown distance L between the abscissas, for the Euler-Lagrange equations resulting from a multiplier rule for the constrained optimization problem together with linear regression to improve the arc length estimate L. Matlab code for these numerical methods is provided which works only for "rich" optimal probability vectors. These methods motivate a definition of an elementary distance function which is easier and faster to calculate, works on non-rich vectors, does not involve variational theory and does not involve differential equations, but is a better approximation of the minimal entropy path distance than the distance //b-a//(2). We compute minimal entropy distance matrices for examples of DNA myostatin genes and amino-acid sequences across several species. Output tree dendograms for our minimal entropy metric are compared with dendograms based on BLAST and BLAST identity scores.

The Optimal Capital Stock and Consumption Evolution for Non Zero Consumers Growth Rate in the Framework of Ramsey Model on Finite Horizon

NASA Astrophysics Data System (ADS)

Bonchiş, N.; Balint, Şt.

2010-09-01

In this paper the Ramsey optimal growth of the capital stock and consumption on finite horizon is analyzed when the growth rate of consumers is strictly positive. The main purpose is to establish the dependence of the optimal capital stock and consumption evolution on the growth rate of consumers. The analysis reveals: for any initial value k0≥0 there exists a unique optimal evolution path of length N+1 for the capital stock; if k0 is strictly positive then all the elements of the optimal capital stock evolution path are strictly positives except the last one which is zero; the optimal capital stock evolution of length N+1 starting from k0≥0 satisfies the Euler equation; the value function VN is strictly increasing, strictly concave and continuous on R+. The family of functions {VN-T}T = 0…N-1 satisfies the Bellman equation and it is the unique solution of this equation which is both continuous and satisfies the transversality condition. The Mangasarian Lemma is also satisfied. For N tending to infinity the optimal evolution path of length N of the capital stock tends to those on the infinite time horizon. For any k0>0 the value function in k0 decreases when the consumers growth rate increases.

A new optimization tool path planning for 3-axis end milling of free-form surfaces based on efficient machining intervals

NASA Astrophysics Data System (ADS)

Vu, Duy-Duc; Monies, Frédéric; Rubio, Walter

2018-05-01

A large number of studies, based on 3-axis end milling of free-form surfaces, seek to optimize tool path planning. Approaches try to optimize the machining time by reducing the total tool path length while respecting the criterion of the maximum scallop height. Theoretically, the tool path trajectories that remove the most material follow the directions in which the machined width is the largest. The free-form surface is often considered as a single machining area. Therefore, the optimization on the entire surface is limited. Indeed, it is difficult to define tool trajectories with optimal feed directions which generate largest machined widths. Another limiting point of previous approaches for effectively reduce machining time is the inadequate choice of the tool. Researchers use generally a spherical tool on the entire surface. However, the gains proposed by these different methods developed with these tools lead to relatively small time savings. Therefore, this study proposes a new method, using toroidal milling tools, for generating toolpaths in different regions on the machining surface. The surface is divided into several regions based on machining intervals. These intervals ensure that the effective radius of the tool, at each cutter-contact points on the surface, is always greater than the radius of the tool in an optimized feed direction. A parallel plane strategy is then used on the sub-surfaces with an optimal specific feed direction for each sub-surface. This method allows one to mill the entire surface with efficiency greater than with the use of a spherical tool. The proposed method is calculated and modeled using Maple software to find optimal regions and feed directions in each region. This new method is tested on a free-form surface. A comparison is made with a spherical cutter to show the significant gains obtained with a toroidal milling cutter. Comparisons with CAM software and experimental validations are also done. The results show the efficiency of the method.

Prognostic benefit of optimum left ventricular lead position in cardiac resynchronization therapy: follow-up of the TARGET Study Cohort (Targeted Left Ventricular Lead Placement to guide Cardiac Resynchronization Therapy).

PubMed

Kydd, Anna C; Khan, Fakhar Z; Watson, William D; Pugh, Peter J; Virdee, Munmohan S; Dutka, David P

2014-06-01

This study was conducted to assess the impact of left ventricular (LV) lead position on longer-term survival after cardiac resynchronization therapy (CRT). An optimal LV lead position in CRT is associated with improved clinical outcome. A strategy of speckle-tracking echocardiography can be used to guide the implanter to the site of latest activation and away from segments of low strain amplitude (scar). Long-term, prospective survival data according to LV lead position in CRT are limited. Data from a follow-up registry of 250 consecutive patients receiving CRT between June 2008 and July 2010 were studied. The study population comprised patients recruited to the derivation group and the subsequent TARGET (Targeted Left Ventricular Lead Placement to guide Cardiac Resynchronization Therapy) randomized, controlled trial. Final LV lead position was described, in relation to the pacing site determined by pre-procedure speckle-tracking echocardiography, as optimal (concordant/adjacent) or suboptimal (remote). All-cause mortality was recorded at follow-up. An optimal LV lead position (n = 202) conferred LV remodeling response superior to that of a suboptimal lead position (change in LV end-systolic volume: -24 ± 15% vs. -12 ± 17% [p < 0.001]; change in ejection fraction: +7 ± 8% vs. +4 ± 7% [p = 0.02]). During long-term follow-up (median: 39 months; range: <1 to 61 months), an optimal LV lead position was associated with improved survival (log-rank p = 0.003). A suboptimal LV lead placement independently predicted all-cause mortality (hazard ratio: 1.8; p = 0.024). An optimal LV lead position at the site of latest mechanical activation, avoiding low strain amplitude (scar), was associated with superior CRT response and improved survival that persisted during follow-up. Copyright © 2014 American College of Cardiology Foundation. Published by Elsevier Inc. All rights reserved.

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.

Optimal base station placement for wireless sensor networks with successive interference cancellation.

PubMed

Shi, Lei; Zhang, Jianjun; Shi, Yi; Ding, Xu; Wei, Zhenchun

2015-01-14

We consider the base station placement problem for wireless sensor networks with successive interference cancellation (SIC) to improve throughput. We build a mathematical model for SIC. Although this model cannot be solved directly, it enables us to identify a necessary condition for SIC on distances from sensor nodes to the base station. Based on this relationship, we propose to divide the feasible region of the base station into small pieces and choose a point within each piece for base station placement. The point with the largest throughput is identified as the solution. The complexity of this algorithm is polynomial. Simulation results show that this algorithm can achieve about 25% improvement compared with the case that the base station is placed at the center of the network coverage area when using SIC.

Guided Immediate Implant Placement with Wound Closure by Computer-Aided Design/Computer-Assisted Manufacture Sealing Socket Abutment: Case Report.

PubMed

Finelle, Gary; Lee, Sang J

Digital technology has been widely used in the field of implant dentistry. From a surgical standpoint, computer-guided surgery can be utilized to enhance primary implant stability and to improve the precision of implant placement. From a prosthetic standpoint, computer-aided design/computer-assisted manufacture (CAD/CAM) technology has brought about various restorative options, including the fabrication of customized abutments through a virtual design based on computer-guided surgical planning. This case report describes a novel technique combining the use of a three-dimensional (3D) printed surgical template for the immediate placement of an implant, with CAD/CAM technology to optimize hard and soft tissue healing after bone grafting with the use of a socket sealing abutment.

The damper placement problem for large flexible space structures

NASA Technical Reports Server (NTRS)

Kincaid, Rex K.

1992-01-01

The damper placement problem for large flexible space truss structures is formulated as a combinatorial optimization problem. The objective is to determine the p truss members of the structure to replace with active (or passive) dampers so that the modal damping ratio is as large as possible for all significant modes of vibration. Equivalently, given a strain energy matrix with rows indexed on the modes and the columns indexed on the truss members, we seek to find the set of p columns such that the smallest row sum, over the p columns, is maximized. We develop a tabu search heuristic for the damper placement problems on the Controls Structures Interaction (CSI) Phase 1 Evolutionary Model (10 modes and 1507 truss members). The resulting solutions are shown to be of high quality.

Verifying placement of small-bore feeding tubes: electromagnetic device images versus abdominal radiographs.

PubMed

Bryant, Vera; Phang, Jean; Abrams, Kevin

2015-11-01

Clinicians are unsure if radiography is needed to confirm correct positioning of feeding tubes inserted with assistance from an electromagnetic system. To compare radiographic reports of feeding tube placement with images generated by an electromagnetic feeding tube placement device. The medical records of 200 consecutive patients who had feeding tubes inserted with assistance from an electromagnetic feeding tube placement device were reviewed retrospectively. Radiographic reports of tube site were compared with images generated by the device. Radiographic evidence of tube sites was available in 188 cases: 184 tubes were located in portions of the gastrointestinal tract. Ninety of the 188 tubes were situated in the optimal site (distal duodenum or jejunum) radiographically. Images generated by the electromagnetic device were available in 176 cases; of these, 52 tubes appeared to end in the expected left lower quadrant. Tubes shown on radiographs to be in other sites also occasionally appeared to end in the left lower quadrant. Nurses using the device did not recognize 4 of the 188 tubes (2.1%) that were inadvertently placed in the lung. No consistent pattern of quadrant distribution was found for tubes positioned in the stomach or proximal duodenum. Images generated by the electromagnetic tube placement device provided inconsistent results regarding tube location. A small percentage of seriously malpositioned tubes were not detected by using the electromagnetic device. These findings do not support eliminating radiographs to confirm correct tube placement following use of an electromagnetic tube placement device. ©2015 American Association of Critical-Care Nurses.

Ancient village fire escape path planning based on improved ant colony algorithm

NASA Astrophysics Data System (ADS)

Xia, Wei; Cao, Kang; Hu, QianChuan

2017-06-01

The roadways are narrow and perplexing in ancient villages, it brings challenges and difficulties for people to choose route to escape when a fire occurs. In this paper, a fire escape path planning method based on ant colony algorithm is presented according to the problem. The factors in the fire environment which influence the escape speed is introduced to improve the heuristic function of the algorithm, optimal transfer strategy, and adjustment pheromone volatile factor to improve pheromone update strategy adaptively, improve its dynamic search ability and search speed. Through simulation, the dynamic adjustment of the optimal escape path is obtained, and the method is proved to be feasible.

Efficient full-chip SRAF placement using machine learning for best accuracy and improved consistency

NASA Astrophysics Data System (ADS)

Wang, Shibing; Baron, Stanislas; Kachwala, Nishrin; Kallingal, Chidam; Sun, Dezheng; Shu, Vincent; Fong, Weichun; Li, Zero; Elsaid, Ahmad; Gao, Jin-Wei; Su, Jing; Ser, Jung-Hoon; Zhang, Quan; Chen, Been-Der; Howell, Rafael; Hsu, Stephen; Luo, Larry; Zou, Yi; Zhang, Gary; Lu, Yen-Wen; Cao, Yu

2018-03-01

Various computational approaches from rule-based to model-based methods exist to place Sub-Resolution Assist Features (SRAF) in order to increase process window for lithography. Each method has its advantages and drawbacks, and typically requires the user to make a trade-off between time of development, accuracy, consistency and cycle time. Rule-based methods, used since the 90 nm node, require long development time and struggle to achieve good process window performance for complex patterns. Heuristically driven, their development is often iterative and involves significant engineering time from multiple disciplines (Litho, OPC and DTCO). Model-based approaches have been widely adopted since the 20 nm node. While the development of model-driven placement methods is relatively straightforward, they often become computationally expensive when high accuracy is required. Furthermore these methods tend to yield less consistent SRAFs due to the nature of the approach: they rely on a model which is sensitive to the pattern placement on the native simulation grid, and can be impacted by such related grid dependency effects. Those undesirable effects tend to become stronger when more iterations or complexity are needed in the algorithm to achieve required accuracy. ASML Brion has developed a new SRAF placement technique on the Tachyon platform that is assisted by machine learning and significantly improves the accuracy of full chip SRAF placement while keeping consistency and runtime under control. A Deep Convolutional Neural Network (DCNN) is trained using the target wafer layout and corresponding Continuous Transmission Mask (CTM) images. These CTM images have been fully optimized using the Tachyon inverse mask optimization engine. The neural network generated SRAF guidance map is then used to place SRAF on full-chip. This is different from our existing full-chip MB-SRAF approach which utilizes a SRAF guidance map (SGM) of mask sensitivity to improve the contrast of optical image at the target pattern edges. In this paper, we demonstrate that machine learning assisted SRAF placement can achieve a superior process window compared to the SGM model-based SRAF method, while keeping the full-chip runtime affordable, and maintain consistency of SRAF placement . We describe the current status of this machine learning assisted SRAF technique and demonstrate its application to full chip mask synthesis and discuss how it can extend the computational lithography roadmap.

Autonomous Control Modes and Optimized Path Guidance for Shipboard Landing in High Sea States

DTIC Science & Technology

2016-04-28

Contract # N00014-14-C-0004 Autonomous Control Modes and Optimized Path Guidance for Shipboard Landing in High Sea States Progress Report...Aviation (ONR BAA12-SN-0028). This project addresses the Sea Based Aviation (SBA) initiative in Advanced Handling Qualities for Rotorcraft. Landing a...and a degraded visual environment, workload during the landing task begins to approach the limits of a human pilot’s capability. It is a similarly

A statistical-based scheduling algorithm in automated data path synthesis

NASA Technical Reports Server (NTRS)

Jeon, Byung Wook; Lursinsap, Chidchanok

1992-01-01

In this paper, we propose a new heuristic scheduling algorithm based on the statistical analysis of the cumulative frequency distribution of operations among control steps. It has a tendency of escaping from local minima and therefore reaching a globally optimal solution. The presented algorithm considers the real world constraints such as chained operations, multicycle operations, and pipelined data paths. The result of the experiment shows that it gives optimal solutions, even though it is greedy in nature.

Light extraction efficiency of GaN-based LED with pyramid texture by using ray path analysis.

PubMed

Pan, Jui-Wen; Wang, Chia-Shen

2012-09-10

We study three different gallium-nitride (GaN) based light emitting diode (LED) cases based on the different locations of the pyramid textures. In case 1, the pyramid texture is located on the sapphire top surface, in case 2, the pyramid texture is locate on the P-GaN top surface, while in case 3, the pyramid texture is located on both the sapphire and P-GaN top surfaces. We study the relationship between the light extraction efficiency (LEE) and angle of slant of the pyramid texture. The optimization of total LEE was highest for case 3 among the three cases. Moreover, the seven escape paths along which most of the escaped photon flux propagated were selected in a simulation of the LEDs. The seven escape paths were used to estimate the slant angle for the optimization of LEE and to precisely analyze the photon escape path.

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.

Comparative study of navigated versus freehand osteochondral graft transplantation of the knee.

PubMed

Koulalis, Dimitrios; Di Benedetto, Paolo; Citak, Mustafa; O'Loughlin, Padhraig; Pearle, Andrew D; Kendoff, Daniel O

2009-04-01

Osteochondral lesions are a common sports-related injury for which osteochondral grafting, including mosaicplasty, is an established treatment. Computer navigation has been gaining popularity in orthopaedic surgery to improve accuracy and precision. Navigation improves angle and depth matching during harvest and placement of osteochondral grafts compared with conventional freehand open technique. Controlled laboratory study. Three cadaveric knees were used. Reference markers were attached to the femur, tibia, and donor/recipient site guides. Fifteen osteochondral grafts were harvested and inserted into recipient sites with computer navigation, and 15 similar grafts were inserted freehand. The angles of graft removal and placement as well as surface congruity (graft depth) were calculated for each surgical group. The mean harvesting angle at the donor site using navigation was 4 degrees (standard deviation, 2.3 degrees ; range, 1 degrees -9 degrees ) versus 12 degrees (standard deviation, 5.5 degrees ; range, 5 degrees -24 degrees ) using freehand technique (P < .0001). The recipient plug removal angle using the navigated technique was 3.3 degrees (standard deviation, 2.1 degrees ; range, 0 degrees -9 degrees ) versus 10.7 degrees (standard deviation, 4.9 degrees ; range, 2 degrees -17 degrees ) in freehand (P < .0001). The mean navigated recipient plug placement angle was 3.6 degrees (standard deviation, 2.0 degrees ; range, 1 degrees -9 degrees ) versus 10.6 degrees (standard deviation, 4.4 degrees ; range, 3 degrees -17 degrees ) with freehand technique (P = .0001). The mean height of plug protrusion under navigation was 0.3 mm (standard deviation, 0.2 mm; range, 0-0.6 mm) versus 0.5 mm (standard deviation, 0.3 mm; range, 0.2-1.1 mm) using a freehand technique (P = .0034). Significantly greater accuracy and precision were observed in harvesting and placement of the osteochondral grafts in the navigated procedures. Clinical studies are needed to establish a benefit in vivo. Improvement in the osteochondral harvest and placement is desirable to optimize clinical outcomes. Navigation shows great potential to improve both harvest and placement precision and accuracy, thus optimizing ultimate surface congruity.

Sentient Structures: Optimising Sensor Layouts for Direct Measurement of Discrete Variables

DTIC Science & Technology

2008-11-01

1 Sentient Structures Optimising Sensor Layouts for Direct Measurement of Discrete Variables Report to US Air Force...TITLE AND SUBTITLE Sentient Structures 5a. CONTRACT NUMBER FA48690714045 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Donald Price...optimal sensor placements is an important requirement for the development of sentient structures. An optimal sensor layout is attained when a limited

Singular vector-based targeted observations of chemical constituents: description and first application of the EURAD-IM-SVA v1.0

NASA Astrophysics Data System (ADS)

Goris, N.; Elbern, H.

2015-12-01

Measurements of the large-dimensional chemical state of the atmosphere provide only sparse snapshots of the state of the system due to their typically insufficient temporal and spatial density. In order to optimize the measurement configurations despite those limitations, the present work describes the identification of sensitive states of the chemical system as optimal target areas for adaptive observations. For this purpose, the technique of singular vector analysis (SVA), which has proven effective for targeted observations in numerical weather prediction, is implemented in the EURAD-IM (EURopean Air pollution and Dispersion - Inverse Model) chemical transport model, yielding the EURAD-IM-SVA v1.0. Besides initial values, emissions are investigated as critical simulation controlling targeting variables. For both variants, singular vectors are applied to determine the optimal placement for observations and moreover to quantify which chemical compounds have to be observed with preference. Based on measurements of the airship based ZEPTER-2 campaign, the EURAD-IM-SVA v1.0 has been evaluated by conducting a comprehensive set of model runs involving different initial states and simulation lengths. For the sake of brevity, we concentrate our attention on the following chemical compounds, O3, NO, NO2, HCHO, CO, HONO, and OH, and focus on their influence on selected O3 profiles. Our analysis shows that the optimal placement for observations of chemical species is not entirely determined by mere transport and mixing processes. Rather, a combination of initial chemical concentrations, chemical conversions, and meteorological processes determines the influence of chemical compounds and regions. We furthermore demonstrate that the optimal placement of observations of emission strengths is highly dependent on the location of emission sources and that the benefit of including emissions as target variables outperforms the value of initial value optimization with growing simulation length. The obtained results confirm the benefit of considering both initial values and emission strengths as target variables and of applying the EURAD-IM-SVA v1.0 for measurement decision guidance with respect to chemical compounds.

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

Robotic path-finding in inverse treatment planning for stereotactic radiosurgery with continuous dose delivery

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

Vandewouw, Marlee M., E-mail: marleev@mie.utoronto

Purpose: Continuous dose delivery in radiation therapy treatments has been shown to decrease total treatment time while improving the dose conformity and distribution homogeneity over the conventional step-and-shoot approach. The authors develop an inverse treatment planning method for Gamma Knife® Perfexion™ that continuously delivers dose along a path in the target. Methods: The authors’ method is comprised of two steps: find a path within the target, then solve a mixed integer optimization model to find the optimal collimator configurations and durations along the selected path. Robotic path-finding techniques, specifically, simultaneous localization and mapping (SLAM) using an extended Kalman filter, aremore » used to obtain a path that travels sufficiently close to selected isocentre locations. SLAM is novelly extended to explore a 3D, discrete environment, which is the target discretized into voxels. Further novel extensions are incorporated into the steering mechanism to account for target geometry. Results: The SLAM method was tested on seven clinical cases and compared to clinical, Hamiltonian path continuous delivery, and inverse step-and-shoot treatment plans. The SLAM approach improved dose metrics compared to the clinical plans and Hamiltonian path continuous delivery plans. Beam-on times improved over clinical plans, and had mixed performance compared to Hamiltonian path continuous plans. The SLAM method is also shown to be robust to path selection inaccuracies, isocentre selection, and dose distribution. Conclusions: The SLAM method for continuous delivery provides decreased total treatment time and increased treatment quality compared to both clinical and inverse step-and-shoot plans, and outperforms existing path methods in treatment quality. It also accounts for uncertainty in treatment planning by accommodating inaccuracies.« less

A two-phase investment model for optimal allocation of phasor measurement units considering transmission switching

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

Mousavian, Seyedamirabbas; Valenzuela, Jorge; Wang, Jianhui

2015-02-01

Ensuring the reliability of an electrical power system requires a wide-area monitoring and full observability of the state variables. Phasor measurement units (PMUs) collect in real time synchronized phasors of voltages and currents which are used for the observability of the power grid. Due to the considerable cost of installing PMUs, it is not possible to equip all buses with PMUs. In this paper, we propose an integer linear programming model to determine the optimal PMU placement plan in two investment phases. In the first phase, PMUs are installed to achieve full observability of the power grid whereas additional PMUsmore » are installed in the second phase to guarantee the N - 1 observability of the power grid. The proposed model also accounts for transmission switching and single contingencies such as failure of a PMU or a transmission line. Results are provided on several IEEE test systems which show that our proposed approach is a promising enhancement to the methods available for the optimal placement of PMUs.« less

Optimal Sparse Upstream Sensor Placement for Hydrokinetic Turbines

NASA Astrophysics Data System (ADS)

Cavagnaro, Robert; Strom, Benjamin; Ross, Hannah; Hill, Craig; Polagye, Brian

2016-11-01

Accurate measurement of the flow field incident upon a hydrokinetic turbine is critical for performance evaluation during testing and setting boundary conditions in simulation. Additionally, turbine controllers may leverage real-time flow measurements. Particle image velocimetry (PIV) is capable of rendering a flow field over a wide spatial domain in a controlled, laboratory environment. However, PIV's lack of suitability for natural marine environments, high cost, and intensive post-processing diminish its potential for control applications. Conversely, sensors such as acoustic Doppler velocimeters (ADVs), are designed for field deployment and real-time measurement, but over a small spatial domain. Sparsity-promoting regression analysis such as LASSO is utilized to improve the efficacy of point measurements for real-time applications by determining optimal spatial placement for a small number of ADVs using a training set of PIV velocity fields and turbine data. The study is conducted in a flume (0.8 m2 cross-sectional area, 1 m/s flow) with laboratory-scale axial and cross-flow turbines. Predicted turbine performance utilizing the optimal sparse sensor network and associated regression model is compared to actual performance with corresponding PIV measurements.

Dijkstra Methode for Optimalize Recommendation System of Garbage Transportation Time in Surakarta City

NASA Astrophysics Data System (ADS)

Hartatik; Purbayu, A.; Triyono, L.

2018-03-01

Major problem that often occurs in waste transportation in each region is the route of garbage transportation. Determination of this route should become a major concern because it affects fuel consumption and also the working time from the employee. Therefore, in this research we will develop an application to optimize with pigeonhole and dijsktra algorithm. Pigeonhole algorithm is used to determine which garbage trucks should be taken in a particular TPS. Time optimization is done by determining the shortest path that can be skipped for each garbage truck. Data generated from Pigeonhole then used to determine the shortest path by using Dijkstra algorithm.

Developing a robust wireless sensor network structure for environmental sensing

NASA Astrophysics Data System (ADS)

Zhang, Z.; Oroza, C.; Glaser, S. D.; Bales, R. C.; Conklin, M. H.

2013-12-01

The American River Hydrologic Observatory is being strategically deployed as a real-time ground-based measurement network that delivers accurate and timely information on snow conditions and other hydrologic attributes with a previously unheard of granularity of time and space. The basin-scale network involves 18 sub-networks set out at physiographically representative locations spanning the seasonally snow-covered half of the 5000 km2 American river basin. Each sub-network, covering about a 1-km2 area, consists of 10 wirelessly networked sensing nodes that continuously measure and telemeter temperature, and snow depth; plus selected locations are equipped with sensors for relative humidity, solar radiation, and soil moisture at several depths. The sensor locations were chosen to maximize the variance sampled for snow depth within the basin. Network design and deployment involves an iterative but efficient process. After sensor-station locations are determined, a robust network of interlinking sensor stations and signal repeaters must be constructed to route sensor data to a central base station with a two-way communicable data uplink. Data can then be uploaded from site to remote servers in real time through satellite and cell modems. Signal repeaters are placed for robustness of a self-healing network with redundant signal paths to the base station. Manual, trial-and-error heuristic approaches for node placement are inefficient and labor intensive. In that approach field personnel must restructure the network in real time and wait for new network statistics to be calculated at the base station before finalizing a placement, acting without knowledge of the global topography or overall network structure. We show how digital elevation plus high-definition aerial photographs to give foliage coverage can optimize planning of signal repeater placements and guarantee a robust network structure prior to the physical deployment. We can also 'stress test' the final network by simulating the failure of an individual node and investigating the effect and the self-healing ability of the stressed network. The resulting sensor network can survive temporary service interruption from a small subset of signal repeaters and sensor stations. The robustness and the resilient of the network performance ensure the integrity of the dataset and the real-time transmissibility during harsh conditions.

Nasoenteral feeding tube placement by nurses using an electromagnetic guidance system (with video).

PubMed

Mathus-Vliegen, Elisabeth M H; Duflou, Ann; Spanier, Marcel B W; Fockens, Paul

2010-04-01

The early institution of feeding in patients who need postpyloric feeding tubes is often hampered by a limited availability of endoscopists experienced in safe tube positioning. To test the feasibility of having nurses place postpyloric feeding tubes by using a universal path finding system device. Prospective study. Academic hospital. The success rate and learning curve of a senior nurse placing postpyloric feeding tubes in 50 patients was studied, followed by a study in 160 patients on the success rates and learning curves of 4 inexperienced nurses instructed by the senior nurse. Finally, the success rate of postpyloric feeding tube placement by the senior nurse in 50 critically ill patients was investigated. Postpyloric feeding tube positioning by nurses using an electromagnetic universal path-finding system device enabling them to follow the path of the tip of the feeding tube on a monitor screen. Success was defined by postpyloric positioning of the feeding tube. The ultimate aim was to reach at least the duodenojejunal flexure. In the first part, the senior nurse was successful in 72% of cases. There was a clear learning curve. In the second part, the 4 newly instructed nurses had a success rate of 89.4% without an evident learning curve. In the third part, successful feeding tube positioning was achieved in 78% of critically ill patients. Of the 217 successfully positioned tubes, 74% reached at least the duodenojejunal flexure. In half of the unsuccessful cases, an explanation for the failure was found at endoscopy. No complications were seen. The generalization to less-specialized hospitals should be investigated. Postpyloric positioning of feeding tubes by nurses at the bedside without endoscopy is feasible and safe. Nurses may take over some of the tasks of doctors in a time of high endoscopic needs. Copyright 2010 American Society for Gastrointestinal Endoscopy. Published by Mosby, Inc. All rights reserved.

Autonomous Rover Traverse and Precise Arm Placement on Remotely Designated Targets

NASA Technical Reports Server (NTRS)

Nesnas, Issa A.; Pivtoraiko, Mihail N.; Kelly, Alonzo; Fleder, Michael

2012-01-01

This software controls a rover platform to traverse rocky terrain autonomously, plan paths, and avoid obstacles using its stereo hazard and navigation cameras. It does so while continuously tracking a target of interest selected from 10 20 m away. The rover drives and tracks the target until it reaches the vicinity of the target. The rover then positions itself to approach the target, deploys its robotic arm, and places the end effector instrument on the designated target to within 2-3-cm accuracy of the originally selected target. This software features continuous navigation in a fairly rocky field in an outdoor environment and the ability to enable the rover to avoid large rocks and traverse over smaller ones. Using point-and-click mouse commands, a scientist designates targets in the initial imagery acquired from the rover s mast cameras. The navigation software uses stereo imaging, traversability analysis, path planning, trajectory generation, and trajectory execution. It also includes visual target tracking of a designated target selected from 10 m away while continuously navigating the rocky terrain. Improvements in this design include steering while driving, which uses continuous curvature paths. There are also several improvements to the traversability analyzer, including improved data fusion of traversability maps that result from pose estimation uncertainties, dealing with boundary effects to enable tighter maneuvers, and handling a wider range of obstacles. This work advances what has been previously developed and integrated on the Mars Exploration Rovers by using algorithms that are capable of traversing more rock-dense terrains, enabling tight, thread-the-needle maneuvers. These algorithms were integrated on the newly refurbished Athena Mars research rover, and were fielded in the JPL Mars Yard. Forty-three runs were conducted with targets at distances ranging from 5 to 15 m, and a success rate of 93% was achieved for placement of the instrument within 2-3 cm of the target.

Dry Ribbon for Heated Head Automated Fiber Placement

NASA Technical Reports Server (NTRS)

Hulcher, A. Bruce; Marchello, Joseph M.; Hinkley, Jeffrey A.; Johnston, Norman J.; Lamontia, Mark A.

2000-01-01

Ply-by-ply in situ processes involving automated heated head deposition are being developed for fabrication of high performance, high temperature composite structures from low volatile content polymer matrices. This technology requires (1) dry carbon fiber towpreg, (2) consolidation of towpreg to quality, placement-grade unidirectional ribbon or tape, and (3) rapid, in situ, accurate, ply-by-ply robotic placement and consolidation of this material to fabricate a composite structure. In this study, the physical properties of a candidate thermoplastic ribbon, PIXA/IM7, were evaluated and screened for suitability in robotic placement. Specifically, towpreg was prepared from PIXA powder. Various conditions (temperatures) were used to convert the powder-coated towpreg to ribbons with varying degrees of processability. Ribbon within preset specifications was fabricated at 3 temperatures: 390, 400 and 410 C. Ribbon was also produced out-of-spec by purposely overheating the material to a processing temperature of 450 C. Automated placement equipment at Cincinnati Milacron and NASA Langley was used to fabricate laminates from these experimental ribbons. Ribbons were placed at 405 and 450 C by both sets of equipment. Double cantilever beam and wedge peel tests were used to determine the quality of the laminates and, especially, the interlaminar bond formed during the placement process. Ribbon made under conditions expected to be non-optimal (overheated) resulted in poor placeability and composites with weak interlaminar bond strengths, regardless of placement conditions. Ribbon made under conditions expected to be ideal showed good processability and produced well-consolidated laminates. Results were consistent from machine to machine and demonstrated the importance of ribbon quality in heated-head placement of dry material forms. Preliminary screening criteria for the development and evaluation of ribbon from new matrix materials were validated.

Fluctuations in the emotional intelligence of therapy students during clinical placements: Implication for educators, supervisors, and students.

PubMed

Gribble, Nigel; Ladyshewsky, Richard K; Parsons, Richard

2017-01-01

This study investigated the changes in emotional intelligence (EI) of occupational therapy, physiotherapy, and speech pathology students (therapy students). Clinical placements have multiple benefits including the development of interprofessional skills, enhancing practice skills and interpersonal skills. Higher EI competencies have been shown to have a positive impact on patient outcomes, teamwork skills, dealing with stress, and patient satisfaction. Data for this study were collected at two time points: before third-year therapy students commenced extended clinical placements (T1 with 261 students) and approximately 7 months later after students had completed one or more clinical placements (T2 with 109 students). EI was measured using the Emotional Quotient Inventory 2.0 (EQ-i 2.0 ). Only one EI score, assertiveness, demonstrated a significant decline. No EI score showed a significant increase. A third or more of the students showed increases of five points or more in self-actualisation, emotional expression, independence, reality testing and optimism. However, of concern were the five EI scores where therapy students' EI scores decreased by more than five points: assertiveness (where 38% of students declined), problem solving (37%), impulse control (35%), self-actualisation (35%), and stress tolerance (33%). With EI scores declining for some students during clinical placements, there are implications for clinical supervisors and interprofessional facilitators as clinical performance may decline concurrently. There is a range of potential reasons that clinical placements could negatively influence the EI competencies of a therapy student, including poor clinical supervision, conflict between a student, and supervisor and failing a clinical placement. The research suggests that interprofessional facilitators and university educators might consider students undertaking EI tests before clinical placements.

Using a computational model to quantify the potential impact of changing the placement of healthy beverages in stores as an intervention to "Nudge" adolescent behavior choice.

PubMed

Wong, Michelle S; Nau, Claudia; Kharmats, Anna Yevgenyevna; Vedovato, Gabriela Milhassi; Cheskin, Lawrence J; Gittelsohn, Joel; Lee, Bruce Y

2015-12-23

Product placement influences consumer choices in retail stores. While sugar sweetened beverage (SSB) manufacturers expend considerable effort and resources to determine how product placement may increase SSB purchases, the information is proprietary and not available to the public health and research community. This study aims to quantify the effect of non-SSB product placement in corner stores on adolescent beverage purchasing behavior. Corner stores are small privately owned retail stores that are important beverage providers in low-income neighborhoods--where adolescents have higher rates of obesity. Using data from a community-based survey in Baltimore and parameters from the marketing literature, we developed a decision-analytic model to simulate and quantify how placement of healthy beverage (placement in beverage cooler closest to entrance, distance from back of the store, and vertical placement within each cooler) affects the probability of adolescents purchasing non-SSBs. In our simulation, non-SSB purchases were 2.8 times higher when placed in the "optimal location"--on the second or third shelves of the front cooler--compared to the worst location on the bottom shelf of the cooler farthest from the entrance. Based on our model results and survey data, we project that moving non-SSBs from the worst to the optional location would result in approximately 5.2 million more non-SSBs purchased by Baltimore adolescents annually. Our study is the first to quantify the potential impact of changing placement of beverages in corner stores. Our findings suggest that this could be a low-cost, yet impactful strategy to nudge this population--highly susceptible to obesity--towards healthier beverage decisions.

Implementation impacts : volume 2, summer 2013.

DOT National Transportation Integrated Search

2013-01-01

Summary of research projects at the Louisiana Transportation Research Center. Projects in this issue include: : LTRC Project No. 06-4B, Optimization of Tack Coat for HMA Placement; : LTRC Project No. 10-2GT, : Geotechnical Information Database, Phase...

Image-guided optimization of the ECG trace in cardiac MRI.

PubMed

Barnwell, James D; Klein, J Larry; Stallings, Cliff; Sturm, Amanda; Gillespie, Michael; Fine, Jason; Hyslop, W Brian

2012-03-01

Improper electrocardiogram (ECG) lead placement resulting in suboptimal gating may lead to reduced image quality in cardiac magnetic resonance imaging (CMR). A patientspecific systematic technique for rapid optimization of lead placement may improve CMR image quality. A rapid 3 dimensional image of the thorax was used to guide the realignment of ECG leads relative to the cardiac axis of the patient in forty consecutive adult patients. Using our novel approach and consensus reading of pre- and post-correction ECG traces, seventy-three percent of patients had a qualitative improvement in their ECG tracings, and no patient had a decrease in quality of their ECG tracing following the correction technique. Statistically significant improvement was observed independent of gender, body mass index, and cardiac rhythm. This technique provides an efficient option to improve the quality of the ECG tracing in patients who have a poor quality ECG with standard techniques.

Multi-projector auto-calibration and placement optimization for non-planar surfaces

NASA Astrophysics Data System (ADS)

Li, Dong; Xie, Jinghui; Zhao, Lu; Zhou, Lijing; Weng, Dongdong

2015-10-01

Non-planar projection has been widely applied in virtual reality and digital entertainment and exhibitions because of its flexible layout and immersive display effects. Compared with planar projection, a non-planar projection is more difficult to achieve because projector calibration and image distortion correction are difficult processes. This paper uses a cylindrical screen as an example to present a new method for automatically calibrating a multi-projector system in a non-planar environment without using 3D reconstruction. This method corrects the geometric calibration error caused by the screen's manufactured imperfections, such as an undulating surface or a slant in the vertical plane. In addition, based on actual projection demand, this paper presents the overall performance evaluation criteria for the multi-projector system. According to these criteria, we determined the optimal placement for the projectors. This method also extends to surfaces that can be parameterized, such as spheres, ellipsoids, and paraboloids, and demonstrates a broad applicability.

Advantages and disadvantages of surgical placement of PD catheters with regard to other methods.

PubMed

Stegmayr, B

2006-01-01

Peritoneal dialysis is underused for various reasons. One reason may be problems with insertion of catheters for access. Another reason is the delayed start (break-in period) of about 2 weeks after operation. This review describes various approaches to the insertion of a peritoneal dialysis catheter. The optimal conditions to strive for are given as is an overview of various techniques. This article favours surgical placement while others might prefer other techniques. Described is the use a 3-purse string suture technique that allows immediate start of dialysis after catheter insertion both for acute dialysis indications as well as for acute start in chronic dialysis patients. A key to lesser complications is to establish a team devoted to the insertions rather than to allow various physicians to perform insertions as a training procedure. An optimal access is one of the important life lines for these patients.

Peritoneal dialysis catheter implantation: avoiding problems and optimizing outcomes.

PubMed

Crabtree, John H

2015-01-01

The success of peritoneal dialysis (PD) as renal replacement therapy is dependent upon the patient having a functional long-term peritoneal access. There are a number of identified best practices that must be adhered to during PD catheter placement to achieve a durable and infection-resistant access. The clinical setting, available resources, and the employed catheter insertion method may not always permit complete adherence to these practices; however, an attempt should be made to comply with them as closely as possible. Although omission of any one of the practices can lead to catheter loss, departures from some are committed more frequently, manifesting as commonly occurring clinical problems, such as drain pain, catheter tip migration, omental entrapment, pericatheter leaks and hernias, and poor exit-site location. Understanding the technical pitfalls in PD catheter placement that lead to these problems, enable the provider to modify practice habits to avoid them and optimize outcomes. © 2014 Wiley Periodicals, Inc.

Endoscopic-Assisted Burr Hole Reservoir and Ventricle Catheter Placement.

PubMed

Antes, Sebastian; Tschan, Christoph A; Heckelmann, Michael; Salah, Mohamed; Senger, Sebastian; Linsler, Stefan; Oertel, Joachim

2017-05-01

Accurate positioning of a ventricle catheter is of utmost importance. Various techniques to ensure optimal positioning have been described. Commonly, after catheter placement, additional manipulation is necessary to connect a burr hole reservoir or shunt components. This manipulation can lead to accidental catheter dislocation and should be avoided. Here, we present a new technique that allows direct endoscopic insertion of a burr hole reservoir with an already mounted ventricle catheter. Before insertion, the ventricle catheter was slit at the tip, shortened to the correct length, and connected to the special burr hole reservoir. An intracatheter endoscope was then advanced through the reservoir and the connected catheter. This assemblage allowed using the endoscope as a stylet for shielded ventricular puncture. To confirm correct placement of the ventricle catheter, the endoscope was protruded a few millimeters beyond the catheter tip for inspection. The new technique was applied in 12 procedures. The modified burr hole reservoir was inserted for first-time ventriculoperitoneal shunting (n = 1), cerebrospinal fluid withdrawals and drug administration (n = 2), or different stenting procedures (n = 9). Optimal positioning of the catheter was achieved in 11 of 12 cases. No subcutaneous cerebrospinal fluid collection or fluid leakage through the wound occurred. No parenchymal damage or bleeding appeared. The use of the intracatheter endoscope combined with the modified burr hole reservoir provides a sufficient technique for accurate and safe placement. Connecting the ventricle catheter to the reservoir before the insertion reduces later manipulation and accidental dislocation of the catheter. Copyright © 2017 Elsevier Inc. All rights reserved.

From non-preemptive to preemptive scheduling using synchronization synthesis.

PubMed

Černý, Pavol; Clarke, Edmund M; Henzinger, Thomas A; Radhakrishna, Arjun; Ryzhyk, Leonid; Samanta, Roopsha; Tarrach, Thorsten

2017-01-01

We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of sequences produced under a non-preemptive scheduler. We guarantee that our synthesis does not introduce deadlocks and that the synchronization inserted is optimal w.r.t. a given objective function. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and generation of a set of global constraints over synchronization placements. Each model of the global constraints set corresponds to a correctness-ensuring synchronization placement. The placement that is optimal w.r.t. the given objective function is chosen as the synchronization solution. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient. The implicit specification helped us find one concurrency bug previously missed when model-checking using an explicit, user-provided specification. We implemented objective functions for coarse-grained and fine-grained locking and observed that different synchronization placements are produced for our experiments, favoring a minimal number of synchronization operations or maximum concurrency, respectively.

Autonomous Control Modes and Optimized Path Guidance for Shipboard Landing in High Sea States

DTIC Science & Technology

2016-08-12

Performing Organization: The Pennsylvania State University Department of Aerospace Engineering 231C Hammond Building University Park, PA 16802 Attn...Plant Models Used in the Study The H-60 class model was developed and distributed by ART to both NAVAIR and Penn State research teams. The model...To) 07 109 I 201 4 tD 07 I 08 12016 ’t TITLE AND SUBTITLE Autonomous Control Modes and Optimized Path Guidance for Shipboard Landing in High Sea States

Autonomous Control Modes and Optimized Path Guidance for Shipboard Landing in High Sea States

DTIC Science & Technology

2017-04-15

50 0 50 Singular Values Frequency (rad/s) S in g u la r V a lu e s ( d B ) controller . The non -output variables can be estimated by reliable linear...Contract # N00014-14-C-0004 Autonomous Control Modes and Optimized Path Guidance for Shipboard Landing in High Sea States Progress Report...recovery of a VTOL UAV. There is a clear need for additional levels of stability and control augmentation and, ultimately, fully autonomous landing

Maximal Sensitive Dependence and the Optimal Path to Epidemic Extinction

DTIC Science & Technology

2010-01-01

1996; Elgart and Kamenev, 2004). Instead, in this article, we will employ an eikonal approximation to recast the problem in terms of an effective...a control strategy on the extinction rate can be determined by its effect on the optimal path (Dykman et al., 2008). Through the use of the eikonal ...the solution of Eqs. (6a)–(6b) in the eikonal form (Elgart and Kamenev, 2004; Doering et al., 2005; Kubo et al., 1973; Wentzell, 1976; Gang, 1987

Optimal Base Station Placement for Wireless Sensor Networks with Successive Interference Cancellation

PubMed Central

Shi, Lei; Zhang, Jianjun; Shi, Yi; Ding, Xu; Wei, Zhenchun

2015-01-01

We consider the base station placement problem for wireless sensor networks with successive interference cancellation (SIC) to improve throughput. We build a mathematical model for SIC. Although this model cannot be solved directly, it enables us to identify a necessary condition for SIC on distances from sensor nodes to the base station. Based on this relationship, we propose to divide the feasible region of the base station into small pieces and choose a point within each piece for base station placement. The point with the largest throughput is identified as the solution. The complexity of this algorithm is polynomial. Simulation results show that this algorithm can achieve about 25% improvement compared with the case that the base station is placed at the center of the network coverage area when using SIC. PMID:25594600

Epidemic extinction paths in complex networks

NASA Astrophysics Data System (ADS)

Hindes, Jason; Schwartz, Ira B.

2017-05-01

We study the extinction of long-lived epidemics on finite complex networks induced by intrinsic noise. Applying analytical techniques to the stochastic susceptible-infected-susceptible model, we predict the distribution of large fluctuations, the most probable or optimal path through a network that leads to a disease-free state from an endemic state, and the average extinction time in general configurations. Our predictions agree with Monte Carlo simulations on several networks, including synthetic weighted and degree-distributed networks with degree correlations, and an empirical high school contact network. In addition, our approach quantifies characteristic scaling patterns for the optimal path and distribution of large fluctuations, both near and away from the epidemic threshold, in networks with heterogeneous eigenvector centrality and degree distributions.

Epidemic extinction paths in complex networks.

PubMed

Hindes, Jason; Schwartz, Ira B

2017-05-01

We study the extinction of long-lived epidemics on finite complex networks induced by intrinsic noise. Applying analytical techniques to the stochastic susceptible-infected-susceptible model, we predict the distribution of large fluctuations, the most probable or optimal path through a network that leads to a disease-free state from an endemic state, and the average extinction time in general configurations. Our predictions agree with Monte Carlo simulations on several networks, including synthetic weighted and degree-distributed networks with degree correlations, and an empirical high school contact network. In addition, our approach quantifies characteristic scaling patterns for the optimal path and distribution of large fluctuations, both near and away from the epidemic threshold, in networks with heterogeneous eigenvector centrality and degree distributions.

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

Airway stent complications: the role of follow-up bronchoscopy as a surveillance method

PubMed Central

Labaki, Wassim; Yu, Diana H.; Salwen, Benjamin; Gilbert, Christopher; Schneider, Andrea L. C.; Ortiz, Ricardo; Feller-Kopman, David; Arias, Sixto; Yarmus, Lonny

2017-01-01

Background Airway stenting has become an integral part of the therapeutic endoscopic management of obstructive benign and malignant central airway diseases. Despite increased use of airway stents and frequent stent-associated complications, no clear guidelines for surveillance and maintenance exist. This study aim is to elucidate predictive factors associated with development of stent complications, as well as an optimal surveillance period for follow-up bronchoscopy for early detection and possible prevention of stent-associated complications. Methods Retrospective cohort study of all patients who underwent airway stent placements at our institution from April 2010 to December 2013 for benign and malignant airway diseases. Metallic, silicone (straight, Y stent, T-tube) and hybrid stents were included in the study. Stent complications were analyzed at the time of follow-up bronchoscopy performed four to six weeks after initial stent placement or earlier if patients became symptomatic. Results The study included 134 patients of which 147 stents were placed. Follow-up bronchoscopy was performed in 94 patients. Symptomatic status at the time of follow-up bronchoscopy was not associated with stent complications [odds ratio (OR) =1.88; 95% CI: 0.79–4.45; P=0.15]. Patient age, sex, indication for stent placement, and stent location, were not associated with development of complications (all P>0.05). Compared to all other stents, hybrid stents were more likely to migrate (OR =6.60; 95% CI: 2.16–20.2; P=0.001) or obstruct by secretions (OR =2.53; 95% CI: 1.10–5.84; P=0.03). There were no complications associated with surveillance bronchoscopy. Conclusions Surveillance bronchoscopy within 4 to 6 weeks of stent placement may be useful for early detection of complications and their subsequent management, regardless of symptomatic status and indication for stent placement. Prospective multicenter studies are needed to compare optimal surveillance methods and the impact on patient mortality, morbidity and healthcare costs. PMID:29268534

Employment and residential characteristics in relation to automated external defibrillator locations

PubMed Central

Griffis, Heather M.; Band, Roger A; Ruther, Matthew; Harhay, Michael; Asch, David A.; Hershey, John C.; Hill, Shawndra; Nadkarni, Lindsay; Kilaru, Austin; Branas, Charles C.; Shofer, Frances; Nichol, Graham; Becker, Lance B.; Merchant, Raina M.

2015-01-01

Background Survival from out-of-hospital cardiac arrest (OHCA) is generally poor and varies by geography. Variability in automated external defibrillator (AED) locations may be a contributing factor. To inform optimal placement of AEDs, we investigated AED access in a major US city relative to demographic and employment characteristics. Methods and Results This was a retrospective analysis of a Philadelphia AED registry (2,559 total AEDs). The 2010 US Census and the Local Employment Dynamics (LED) database by ZIP code was used. AED access was calculated as the weighted areal percentage of each ZIP code covered by a 400 meter radius around each AED. Of 47 ZIP codes, only 9%(4) were high AED service areas. In 26%(12) of ZIP codes, less than 35% of the area was covered by AED service areas. Higher AED access ZIP codes were more likely to have a moderately populated residential area (p=0.032), higher median household income (p=0.006), and higher paying jobs (p=008). Conclusions The locations of AEDs vary across specific ZIP codes; select residential and employment characteristics explain some variation. Further work on evaluating OHCA locations, AED use and availability, and OHCA outcomes could inform AED placement policies. Optimizing the placement of AEDs through this work may help to increase survival. PMID:26856232

Asphyxia due to laryngeal spasm as a severe complication of awake deep brain stimulation for Parkinson's disease: a case report.

PubMed

von Eckardstein, Kajetan L; Sixel-Döring, Friederike; Kazmaier, Stephan; Trenkwalder, Claudia; Hoover, Jason M; Rohde, Veit

2016-11-08

In accordance with German neurosurgical and neurological consensus recommendations, lead placements for deep brain stimulation (DBS) in patients with Parkinson's disease (PD) are usually performed with the patient awake and in "medication off" state. This allows for optimal lead position adjustment according to the clinical response to intraoperative test stimulation. However, exacerbation of Parkinsonian symptoms after withdrawal of dopaminergic medication may endanger the patient by inducing severe "off" state motor phenomena. In particular, this can be a problem in awake craniotomies utilizing intraoperative airway management and resuscitation. We report the case of a PD patient with progressive orofacial and neck muscle dystonia resulting in laryngeal spasm during DBS lead placement. This led to upper airway compromise and asphyxia, requiring resuscitation. Laryngeal spasms may occur as a rare "off" state motor complication in patients with PD. Other potential causes of intraoperative difficulties breathing include bilateral vocal cord palsy, positional asphyxia, and silent aspiration. In our practice, we have adjusted our medication regimen and now allow patients to receive their standard dopaminergic medication until the morning of surgery. Neurologists and neurosurgeons performing lead placement procedures for PD should be aware of this rare but unsafe condition to most optimized treatment.

Imaging technique for the complete edentulous patient treated conventionally or with mini implant overdenture

PubMed Central

Meleşcanu Imre, M; Preoteasa, E; Țâncu, AM; Preoteasa, CT

2013-01-01

Rationale. The imaging methods are more and more used in the clinical process of modern dentistry. Once the implant based treatment alternatives are nowadays seen as being the standard of care in edentulous patients, these techniques must be integrated in the complete denture treatment. Aim. The study presents some evaluation techniques for the edentulous patient treated by conventional dentures or mini dental implants (mini SKY Bredent) overdentures, using the profile teleradiography. These offer data useful for an optimal positioning of the artificial teeth and the mini dental implants, favoring to obtain an esthetic and functional treatment outcome. We proposed also a method to conceive a simple surgical guide that allows the prosthetically driven implants placement. Material and method. Clinical case reports were made, highlighting the importance of cephalometric evaluation on lateral teleradiographs in complete edentulous patients. A clinical case that gradually reports the surgical guide preparation (Bredent silicon radio opaque), in order to place the mini dental implants in the best prosthetic and anatomic conditions, was presented. Conclusions. The profile teleradiograph is a useful tool for the practitioner. It allows establishing the optimal site for implant placement, in a good relation with the overdenture. The conventional denture can be easily and relatively costless transformed in a surgical guide used during implant placement. PMID:23599828

Interactive computation of coverage regions for indoor wireless communication

NASA Astrophysics Data System (ADS)

Abbott, A. Lynn; Bhat, Nitin; Rappaport, Theodore S.

1995-12-01

This paper describes a system which assists in the strategic placement of rf base stations within buildings. Known as the site modeling tool (SMT), this system allows the user to display graphical floor plans and to select base station transceiver parameters, including location and orientation, interactively. The system then computes and highlights estimated coverage regions for each transceiver, enabling the user to assess the total coverage within the building. For single-floor operation, the user can choose between distance-dependent and partition- dependent path-loss models. Similar path-loss models are also available for the case of multiple floors. This paper describes the method used by the system to estimate coverage for both directional and omnidirectional antennas. The site modeling tool is intended to be simple to use by individuals who are not experts at wireless communication system design, and is expected to be very useful in the specification of indoor wireless systems.

Middle finger length-based tracheal intubation depth improves the rate of appropriate tube placement in children.

PubMed

Zhou, Qing-he; Xiao, Wang-pin; Zhou, Hong-mei

2015-11-01

It is challenging for anesthetists to determine the optimal tracheal intubation depth in children. We hypothesize that a measure three times the length of the middle finger can be used for predicting tracheal tube depth in children. Eighty-six children (4-14 years of age) were included in this study. After the children were anesthetized, a fiberoptic bronchoscope (FOB) was inserted into the trachea, the lengths from the upper incisor teeth to carina and vocal cords were measured, and a suitably sized cuffed tracheal tube was inserted into the trachea. Age-based and middle finger length-based formulas were used to determine the tracheal intubation depth. All 86 children enrolled were included in this study. Compared with the age-based intubation, the rate of appropriate tube placement was higher for middle finger length-based intubation (88.37% vs 66.28%, P = 0.001). The proximal intubation rate was lower in middle finger length-based intubation (4.65% vs 32.56%, P < 0.001). There was only weak evidence for a difference in the distal intubation rate between the two methods (6.97% vs 1.16%, P = 0.054). The correlation coefficient between middle finger length and optimal tracheal tube depth was larger than that between age and optimal tracheal tube depth (0.883 vs 0.845). Our data indicate that the appropriate tube placement rate can be improved by using three times the middle finger length as the tracheal intubation depth in children. © 2015 John Wiley & Sons Ltd.

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.

The optimal location of piezoelectric actuators and sensors for vibration control of plates

NASA Astrophysics Data System (ADS)

Kumar, K. Ramesh; Narayanan, S.

2007-12-01

This paper considers the optimal placement of collocated piezoelectric actuator-sensor pairs on a thin plate using a model-based linear quadratic regulator (LQR) controller. LQR performance is taken as objective for finding the optimal location of sensor-actuator pairs. The problem is formulated using the finite element method (FEM) as multi-input-multi-output (MIMO) model control. The discrete optimal sensor and actuator location problem is formulated in the framework of a zero-one optimization problem. A genetic algorithm (GA) is used to solve the zero-one optimization problem. Different classical control strategies like direct proportional feedback, constant-gain negative velocity feedback and the LQR optimal control scheme are applied to study the control effectiveness.

Optimal short-range trajectories for helicopters

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

Slater, G.L.; Erzberger, H.

1982-12-01

An optimal flight path algorithm using a simplified altitude state model and a priori climb cruise descent flight profile was developed and applied to determine minimum fuel and minimum cost trajectories for a helicopter flying a fixed range trajectory. In addition, a method was developed for obtaining a performance model in simplified form which is based on standard flight manual data and which is applicable to the computation of optimal trajectories. The entire performance optimization algorithm is simple enough that on line trajectory optimization is feasible with a relatively small computer. The helicopter model used is the Silorsky S-61N. Themore » results show that for this vehicle the optimal flight path and optimal cruise altitude can represent a 10% fuel saving on a minimum fuel trajectory. The optimal trajectories show considerable variability because of helicopter weight, ambient winds, and the relative cost trade off between time and fuel. In general, reasonable variations from the optimal velocities and cruise altitudes do not significantly degrade the optimal cost. For fuel optimal trajectories, the optimum cruise altitude varies from the maximum (12,000 ft) to the minimum (0 ft) depending on helicopter weight.« less

Spatial optimization of watershed management practices for nitrogen load reduction using a modeling-optimization framework.

PubMed

Yang, Guoxiang; Best, Elly P H

2015-09-15

Best management practices (BMPs) can be used effectively to reduce nutrient loads transported from non-point sources to receiving water bodies. However, methodologies of BMP selection and placement in a cost-effective way are needed to assist watershed management planners and stakeholders. We developed a novel modeling-optimization framework that can be used to find cost-effective solutions of BMP placement to attain nutrient load reduction targets. This was accomplished by integrating a GIS-based BMP siting method, a WQM-TMDL-N modeling approach to estimate total nitrogen (TN) loading, and a multi-objective optimization algorithm. Wetland restoration and buffer strip implementation were the two BMP categories used to explore the performance of this framework, both differing greatly in complexity of spatial analysis for site identification. Minimizing TN load and BMP cost were the two objective functions for the optimization process. The performance of this framework was demonstrated in the Tippecanoe River watershed, Indiana, USA. Optimized scenario-based load reduction indicated that the wetland subset selected by the minimum scenario had the greatest N removal efficiency. Buffer strips were more effective for load removal than wetlands. The optimized solutions provided a range of trade-offs between the two objective functions for both BMPs. This framework can be expanded conveniently to a regional scale because the NHDPlus catchment serves as its spatial computational unit. The present study demonstrated the potential of this framework to find cost-effective solutions to meet a water quality target, such as a 20% TN load reduction, under different conditions. Copyright © 2015 Elsevier Ltd. All rights reserved.

Optimizing BMP Placement at Watershed-Scale Using SUSTAIN. A presentation

EPA Science Inventory

SUSTAIN is intended to support local and county government engineers/planners, federal/state regulatory reviewers, private consulting engineers, concerned citizens, stakeholders, and academicians in the development of watershed-based management plans. The users are expec...

Automated watershed subdivision for simulations using multi-objective optimization

USDA-ARS?s Scientific Manuscript database

The development of watershed management plans to evaluate placement of conservation practices typically involves application of watershed models. Incorporating spatially variable watershed characteristics into a model often requires subdividing the watershed into small areas to accurately account f...

Optimal Allocation of Restoration Practices Using Indexes for Stream Health

EPA Science Inventory

Methodologies that allocate the placement of agricultural and urban green infrastructure management practices with the intent to achieve both economic and environmental objectives typically use objectives related to individual intermediary environmental outputs, yet guidance is n...

Distributed microscopic actuation analysis of deformable plate membrane mirrors

NASA Astrophysics Data System (ADS)

Lu, Yifan; Yue, Honghao; Deng, Zongquan; Tzou, Hornsen

2018-02-01

To further reduce the areal density of optical mirrors used in space telescopes and other space-borne optical structures, the concept of flexible membrane deformable mirror has been proposed. Because of their high flexibility, poor stiffness and low damping properties, environmental excitations such as orbital maneuver, path changing, and non-uniform heating may induce unexpected vibrations and thus reduce working performance. Therefore, active vibration control is essential for these membrane mirrors. In this paper, two different mirror models, i.e., the plate membrane model and pure membrane model, are studied respectively. In order to investigate the modal vibration characteristics of the mirror, a piezoelectric layer is fully laminated on its non-reflective side to serve as actuators. Dynamic equations of the mirror laminated with piezoelectric actuators are presented first. Then, the actuator induced modal control force is defined. When the actuator area shrinks to infinitesimal, the expressions of microscopic local modal control force and its two components are obtained to predict the spatial microscopic actuation behavior of the mirror. Different membrane pretension forces are also applied to reveal the tension effects on the actuation of the mirror. Analyses indicate that the spatial distribution of modal micro-control forces is exactly the same with the sensing signals distribution of the mirror, which provides crucial guidelines for optimal actuator placement of membrane deformable mirrors.

Temporal laser pulse manipulation using multiple optical ring-cavities

NASA Technical Reports Server (NTRS)

Nguyen, Quang-Viet (Inventor); Kojima, Jun (Inventor)

2010-01-01

An optical pulse stretcher and a mathematical algorithm for the detailed calculation of its design and performance is disclosed. The optical pulse stretcher has a plurality of optical cavities, having multiple optical reflectors such that an optical path length in each of the optical cavities is different. The optical pulse stretcher also has a plurality of beam splitters, each of which intercepts a portion of an input optical beam and diverts the portion into one of the plurality of optical cavities. The input optical beam is stretched and a power of an output beam is reduced after passing through the optical pulse stretcher and the placement of the plurality of optical cavities and beam splitters is optimized through a model that takes into account optical beam divergence and alignment in the pluralities of the optical cavities. The optical pulse stretcher system can also function as a high-repetition-rate (MHz) laser pulse generator, making it suitable for use as a stroboscopic light source for high speed ballistic projectile imaging studies, or it can be used for high speed flow diagnostics using a laser light sheet with digital particle imaging velocimetry. The optical pulse stretcher system can also be implemented using fiber optic components to realize a rugged and compact optical system that is alignment free and easy to use.

Application of GA, PSO, and ACO algorithms to path planning of autonomous underwater vehicles

NASA Astrophysics Data System (ADS)

Aghababa, Mohammad Pourmahmood; Amrollahi, Mohammad Hossein; Borjkhani, Mehdi

2012-09-01

In this paper, an underwater vehicle was modeled with six dimensional nonlinear equations of motion, controlled by DC motors in all degrees of freedom. Near-optimal trajectories in an energetic environment for underwater vehicles were computed using a numerical solution of a nonlinear optimal control problem (NOCP). An energy performance index as a cost function, which should be minimized, was defined. The resulting problem was a two-point boundary value problem (TPBVP). A genetic algorithm (GA), particle swarm optimization (PSO), and ant colony optimization (ACO) algorithms were applied to solve the resulting TPBVP. Applying an Euler-Lagrange equation to the NOCP, a conjugate gradient penalty method was also adopted to solve the TPBVP. The problem of energetic environments, involving some energy sources, was discussed. Some near-optimal paths were found using a GA, PSO, and ACO algorithms. Finally, the problem of collision avoidance in an energetic environment was also taken into account.

Thoracic irrigation prevents retained hemothorax: A prospective propensity scored analysis.

PubMed

Kugler, Nathan W; Carver, Thomas W; Milia, David; Paul, Jasmeet S

2017-12-01

Thoracic trauma resulting in hemothorax (HTx) is typically managed with thoracostomy tube (TT) placement; however, up to 20% of patients develop retained HTx which may necessitate further intervention for definitive management. Although optimal management of retained HTx has been extensively researched, little is known about prevention of this complication. We hypothesized that thoracic irrigation at the time of TT placement would significantly decrease the rate of retained HTx necessitating secondary intervention. A prospective, comparative study of patients with traumatic HTx who underwent bedside TT placement was conducted. The control group consisted of patients who underwent standard TT placement, whereas the irrigation group underwent standard TT placement with immediate irrigation using 1 L of warmed sterile 0.9% saline. Patients who underwent emergency thoracotomy, those with TTs removed within 24 hours, or those who died within 30 days of discharge were excluded. The primary end point was secondary intervention defined by additional TT placement or operative management for retained HTx. A propensity-matched analysis was performed with scores estimated using a logistic regression model based on age, sex, mechanism of injury, Abbreviated Injury Scale chest score, and TT size. In over a 30-month period, a total of 296 patients underwent TT placement for the management of traumatic HTx. Patients were predominantly male (79.6%) at a median age of 40 years and were evenly split between blunt (48.8%) and penetrating (51.2%) mechanisms. Sixty (20%) patients underwent thoracic irrigation at time of initial TT placement. The secondary intervention rate was significantly lower within the study group (5.6% vs. 21.8%; OR, 0.16; p < 0.001). No significant differences in TT duration, ventilator days, or length of stay were noted between the irrigation and control cohort. Thoracic irrigation at the time of initial TT placement for traumatic HTx significantly reduced the need for secondary intervention for retained HTx. Therapeutic Study, Level III.

Economics of a nest-box program for the conservation of an endangered species: a reappraisal

Treesearch

Daniel A. Spring; Michael Bevers; John O.S. Kennedy; Dan Harley

2001-01-01

An optimization model is developed to identify timing and placement strategies for the installation of nest boxes and the harvesting of timber to meet joint timber–wildlife objectives. Optimal management regimes are determined on the basis of their impacts on the local abundance of a threatened species and net present value (NPV) and are identified for a range of NPV...

Trajectory control of robot manipulators with closed-kinematic chain mechanism

NASA Technical Reports Server (NTRS)

Nguyen, Charles C.; Pooran, Farhad J.; Premack, Timothy

1987-01-01

The problem of Cartesian trajectory control of a closed-kinematic chain mechanism robot manipulator, recently built at CAIR to study the assembly of NASA hardware for the future Space Station, is considered. The study is performed by both computer simulation and experimentation for tracking of three different paths: a straight line, a sinusoid, and a circle. Linearization and pole placement methods are employed to design controller gains. Results show that the controllers are robust and there are good agreements between simulation and experimentation. The results also show excellent tracking quality and small overshoots.

Quenching of the Quantum Hall Effect in Graphene with Scrolled Edges

NASA Astrophysics Data System (ADS)

Cresti, Alessandro; Fogler, Michael M.; Guinea, Francisco; Castro Neto, A. H.; Roche, Stephan

2012-04-01

Edge nanoscrolls are shown to strongly influence transport properties of suspended graphene in the quantum Hall regime. The relatively long arclength of the scrolls in combination with their compact transverse size results in formation of many nonchiral transport channels in the scrolls. They short circuit the bulk current paths and inhibit the observation of the quantized two-terminal resistance. Unlike competing theoretical proposals, this mechanism of disrupting the Hall quantization in suspended graphene is not caused by ill-chosen placement of the contacts, singular elastic strains, or a small sample size.

Computational design of environmental sensors for the potent opioid fentanyl

DOE PAGES

Bick, Matthew J.; Greisen, Per J.; Morey, Kevin J.; ...

2017-09-19

Here, we describe the computational design of proteins that bind the potent analgesic fentanyl. Our approach employs a fast docking algorithm to find shape complementary ligand placement in protein scaffolds, followed by design of the surrounding residues to optimize binding affinity. Co-crystal structures of the highest affinity binder reveal a highly preorganized binding site, and an overall architecture and ligand placement in close agreement with the design model. We also use the designs to generate plant sensors for fentanyl by coupling ligand binding to design stability. The method should be generally useful for detecting toxic hydrophobic compounds in the environment.

Computational design of environmental sensors for the potent opioid fentanyl

PubMed Central

Morey, Kevin J; Antunes, Mauricio S; La, David; Sankaran, Banumathi; Reymond, Luc; Johnsson, Kai; Medford, June I

2017-01-01

We describe the computational design of proteins that bind the potent analgesic fentanyl. Our approach employs a fast docking algorithm to find shape complementary ligand placement in protein scaffolds, followed by design of the surrounding residues to optimize binding affinity. Co-crystal structures of the highest affinity binder reveal a highly preorganized binding site, and an overall architecture and ligand placement in close agreement with the design model. We use the designs to generate plant sensors for fentanyl by coupling ligand binding to design stability. The method should be generally useful for detecting toxic hydrophobic compounds in the environment. PMID:28925919

Computational design of environmental sensors for the potent opioid fentanyl

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

Bick, Matthew J.; Greisen, Per J.; Morey, Kevin J.

Here, we describe the computational design of proteins that bind the potent analgesic fentanyl. Our approach employs a fast docking algorithm to find shape complementary ligand placement in protein scaffolds, followed by design of the surrounding residues to optimize binding affinity. Co-crystal structures of the highest affinity binder reveal a highly preorganized binding site, and an overall architecture and ligand placement in close agreement with the design model. We also use the designs to generate plant sensors for fentanyl by coupling ligand binding to design stability. The method should be generally useful for detecting toxic hydrophobic compounds in the environment.

Upconverting nanoparticles for optimizing scintillator based detection systems

DOEpatents

Kross, Brian; McKisson, John E; McKisson, John; Weisenberger, Andrew; Xi, Wenze; Zom, Carl

2013-09-17

An upconverting device for a scintillation detection system is provided. The detection system comprises a scintillator material, a sensor, a light transmission path between the scintillator material and the sensor, and a plurality of upconverting nanoparticles particles positioned in the light transmission path.

On Performance Analysis of Protective Jamming Schemes in Wireless Sensor Networks.

PubMed

Li, Xuran; Dai, Hong-Ning; Wang, Hao; Xiao, Hong

2016-11-24

Wireless sensor networks (WSNs) play an important role in Cyber Physical Social Sensing (CPSS) systems. An eavesdropping attack is one of the most serious threats to WSNs since it is a prerequisite for other malicious attacks. In this paper, we propose a novel anti-eavesdropping mechanism by introducing friendly jammers to wireless sensor networks (WSNs). In particular, we establish a theoretical framework to evaluate the eavesdropping risk of WSNs with friendly jammers and that of WSNs without jammers. Our theoretical model takes into account various channel conditions such as the path loss and Rayleigh fading, the placement schemes of jammers and the power controlling schemes of jammers. Extensive results show that using jammers in WSNs can effectively reduce the eavesdropping risk. Besides, our results also show that the appropriate placement of jammers and the proper assignment of emitting power of jammers can not only mitigate the eavesdropping risk but also may have no significant impairment to the legitimate communications.

On Performance Analysis of Protective Jamming Schemes in Wireless Sensor Networks

PubMed Central

Li, Xuran; Dai, Hong-Ning; Wang, Hao; Xiao, Hong

2016-01-01

Wireless sensor networks (WSNs) play an important role in Cyber Physical Social Sensing (CPSS) systems. An eavesdropping attack is one of the most serious threats to WSNs since it is a prerequisite for other malicious attacks. In this paper, we propose a novel anti-eavesdropping mechanism by introducing friendly jammers to wireless sensor networks (WSNs). In particular, we establish a theoretical framework to evaluate the eavesdropping risk of WSNs with friendly jammers and that of WSNs without jammers. Our theoretical model takes into account various channel conditions such as the path loss and Rayleigh fading, the placement schemes of jammers and the power controlling schemes of jammers. Extensive results show that using jammers in WSNs can effectively reduce the eavesdropping risk. Besides, our results also show that the appropriate placement of jammers and the proper assignment of emitting power of jammers can not only mitigate the eavesdropping risk but also may have no significant impairment to the legitimate communications. PMID:27886154

Optimum sensor placement for microphone arrays

NASA Astrophysics Data System (ADS)

Rabinkin, Daniel V.

Microphone arrays can be used for high-quality sound pickup in reverberant and noisy environments. Sound capture using conventional single microphone methods suffers severe degradation under these conditions. The beamforming capabilities of microphone array systems allow highly directional sound capture, providing enhanced signal-to-noise ratio (SNR) when compared to single microphone performance. The overall performance of an array system is governed by its ability to locate and track sound sources and its ability to capture sound from desired spatial volumes. These abilities are strongly affected by the spatial placement of microphone sensors. A method is needed to optimize placement for a specified number of sensors in a given acoustical environment. The objective of the optimization is to obtain the greatest average system SNR for sound capture in the region of interest. A two-step sound source location method is presented. In the first step, time delay of arrival (TDOA) estimates for select microphone pairs are determined using a modified version of the Omologo-Svaizer cross-power spectrum phase expression. In the second step, the TDOA estimates are used in a least-mean-squares gradient descent search algorithm to obtain a location estimate. Statistics for TDOA estimate error as a function of microphone pair/sound source geometry and acoustic environment are gathered from a set of experiments. These statistics are used to model position estimation accuracy for a given array geometry. The effectiveness of sound source capture is also dependent on array geometry and the acoustical environment. Simple beamforming and time delay compensation (TDC) methods provide spatial selectivity but suffer performance degradation in reverberant environments. Matched filter array (MFA) processing can mitigate the effects of reverberation. The shape and gain advantage of the capture region for these techniques is described and shown to be highly influenced by the placement of array sensors. A procedure is developed to evaluate a given array configuration based on the above-mentioned metrics. Constrained placement optimizations are performed that maximize SNR for both TDC and MFA capture methods. Results are compared for various acoustic environments and various enclosure sizes. General guidelines are presented for placement strategy and bandwidth dependence, as they relate to reverberation levels, ambient noise, and enclosure geometry. An overall performance function is described based on these metrics. Performance of the microphone array system is also constrained by the design limitations of the supporting hardware. Two newly developed hardware architectures are presented that support the described algorithms. A low- cost 8-channel system with off-the-shelf componentry was designed and its performance evaluated. A massively parallel 512-channel custom-built system is in development-its capabilities and the rationale for its design are described.

An imperialist competitive algorithm for virtual machine placement in cloud computing

NASA Astrophysics Data System (ADS)

Jamali, Shahram; Malektaji, Sepideh; Analoui, Morteza

2017-05-01

Cloud computing, the recently emerged revolution in IT industry, is empowered by virtualisation technology. In this paradigm, the user's applications run over some virtual machines (VMs). The process of selecting proper physical machines to host these virtual machines is called virtual machine placement. It plays an important role on resource utilisation and power efficiency of cloud computing environment. In this paper, we propose an imperialist competitive-based algorithm for the virtual machine placement problem called ICA-VMPLC. The base optimisation algorithm is chosen to be ICA because of its ease in neighbourhood movement, good convergence rate and suitable terminology. The proposed algorithm investigates search space in a unique manner to efficiently obtain optimal placement solution that simultaneously minimises power consumption and total resource wastage. Its final solution performance is compared with several existing methods such as grouping genetic and ant colony-based algorithms as well as bin packing heuristic. The simulation results show that the proposed method is superior to other tested algorithms in terms of power consumption, resource wastage, CPU usage efficiency and memory usage efficiency.

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.

Wiring economy and volume exclusion determine neuronal placement in the Drosophila brain.

PubMed

Rivera-Alba, Marta; Vitaladevuni, Shiv N; Mishchenko, Yuriy; Mischenko, Yuriy; Lu, Zhiyuan; Takemura, Shin-Ya; Scheffer, Lou; Meinertzhagen, Ian A; Chklovskii, Dmitri B; de Polavieja, Gonzalo G

2011-12-06

Wiring economy has successfully explained the individual placement of neurons in simple nervous systems like that of Caenorhabditis elegans [1-3] and the locations of coarser structures like cortical areas in complex vertebrate brains [4]. However, it remains unclear whether wiring economy can explain the placement of individual neurons in brains larger than that of C. elegans. Indeed, given the greater number of neuronal interconnections in larger brains, simply minimizing the length of connections results in unrealistic configurations, with multiple neurons occupying the same position in space. Avoiding such configurations, or volume exclusion, repels neurons from each other, thus counteracting wiring economy. Here we test whether wiring economy together with volume exclusion can explain the placement of neurons in a module of the Drosophila melanogaster brain known as lamina cartridge [5-13]. We used newly developed techniques for semiautomated reconstruction from serial electron microscopy (EM) [14] to obtain the shapes of neurons, the location of synapses, and the resultant synaptic connectivity. We show that wiring length minimization and volume exclusion together can explain the structure of the lamina microcircuit. Therefore, even in brains larger than that of C. elegans, at least for some circuits, optimization can play an important role in individual neuron placement. Copyright © 2011 Elsevier Ltd. All rights reserved.

Parametric study of sensor placement for vision-based relative navigation system of multiple spacecraft

NASA Astrophysics Data System (ADS)

Jeong, Junho; Kim, Seungkeun; Suk, Jinyoung

2017-12-01

In order to overcome the limited range of GPS-based techniques, vision-based relative navigation methods have recently emerged as alternative approaches for a high Earth orbit (HEO) or deep space missions. Therefore, various vision-based relative navigation systems use for proximity operations between two spacecraft. For the implementation of these systems, a sensor placement problem can occur on the exterior of spacecraft due to its limited space. To deal with the sensor placement, this paper proposes a novel methodology for a vision-based relative navigation based on multiple position sensitive diode (PSD) sensors and multiple infrared beacon modules. For the proposed method, an iterated parametric study is used based on the farthest point optimization (FPO) and a constrained extended Kalman filter (CEKF). Each algorithm is applied to set the location of the sensors and to estimate relative positions and attitudes according to each combination by the PSDs and beacons. After that, scores for the sensor placement are calculated with respect to parameters: the number of the PSDs, number of the beacons, and accuracy of relative estimates. Then, the best scoring candidate is determined for the sensor placement. Moreover, the results of the iterated estimation show that the accuracy improves dramatically, as the number of the PSDs increases from one to three.

Study on the measuring distance for blood glucose infrared spectral measuring by Monte Carlo simulation

NASA Astrophysics Data System (ADS)

Li, Xiang

2016-10-01

Blood glucose monitoring is of great importance for controlling diabetes procedure and preventing the complications. At present, the clinical blood glucose concentration measurement is invasive and could be replaced by noninvasive spectroscopy analytical techniques. Among various parameters of optical fiber probe used in spectrum measuring, the measurement distance is the key one. The Monte Carlo technique is a flexible method for simulating light propagation in tissue. The simulation is based on the random walks that photons make as they travel through tissue, which are chosen by statistically sampling the probability distributions for step size and angular deflection per scattering event. The traditional method for determine the optimal distance between transmitting fiber and detector is using Monte Carlo simulation to find out the point where most photons come out. But there is a problem. In the epidermal layer there is no artery, vein or capillary vessel. Thus, when photons propagate and interactive with tissue in epidermal layer, no information is given to the photons. A new criterion is proposed to determine the optimal distance, which is named effective path length in this paper. The path length of each photons travelling in dermis is recorded when running Monte-Carlo simulation, which is the effective path length defined above. The sum of effective path length of every photon at each point is calculated. The detector should be place on the point which has most effective path length. Then the optimal measuring distance between transmitting fiber and detector is determined.

Shortest multiple disconnected path for the analysis of entanglements in two- and three-dimensional polymeric systems

NASA Astrophysics Data System (ADS)

Kröger, Martin

2005-06-01

We present an algorithm which returns a shortest path and related number of entanglements for a given configuration of a polymeric system in 2 or 3 dimensions. Rubinstein and Helfand, and later Everaers et al. introduced a concept to extract primitive paths for dense polymeric melts made of linear chains (a multiple disconnected multibead 'path'), where each primitive path is defined as a path connecting the (space-fixed) ends of a polymer under the constraint of non-interpenetration (excluded volume) between primitive paths of different chains, such that the multiple disconnected path fulfills a minimization criterion. The present algorithm uses geometrical operations and provides a—model independent—efficient approximate solution to this challenging problem. Primitive paths are treated as 'infinitely' thin (we further allow for finite thickness to model excluded volume), and tensionless lines rather than multibead chains, excluded volume is taken into account without a force law. The present implementation allows to construct a shortest multiple disconnected path (SP) for 2D systems (polymeric chain within spherical obstacles) and an optimal SP for 3D systems (collection of polymeric chains). The number of entanglements is then simply obtained from the SP as either the number of interior kinks, or from the average length of a line segment. Further, information about structure and potentially also the dynamics of entanglements is immediately available from the SP. We apply the method to study the 'concentration' dependence of the degree of entanglement in phantom chain systems. Program summaryTitle of program:Z Catalogue number:ADVG Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVG Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: Silicon Graphics (Irix), Sun (Solaris), PC (Linux) Operating systems or monitors under which the program has been tested: UNIX, Linux Program language used: USANSI Fortran 77 and Fortran 90 Memory required to execute with typical data: 1 MByte No. of lines in distributed program, including test data, etc.: 10 660 No. of bytes in distributed program, including test data, etc.: 119 551 Distribution formet:tar.gz Nature of physical problem: The problem is to obtain primitive paths substantiating a shortest multiple disconnected path (SP) for a given polymer configuration (chains of particles, with or without additional single particles as obstacles for the 2D case). Primitive paths are here defined as in [M. Rubinstein, E. Helfand, J. Chem. Phys. 82 (1985) 2477; R. Everaers, S.K. Sukumaran, G.S. Grest, C. Svaneborg, A. Sivasubramanian, K. Kremer, Science 303 (2004) 823] as the shortest line (path) respecting 'topological' constraints (from neighboring polymers or point obstacles) between ends of polymers. There is a unique solution for the 2D case. For the 3D case it is unique if we construct a primitive path of a single chain embedded within fixed line obstacles [J.S.B. Mitchell, Geometric shortest paths and network optimization, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, Elsevier, Amsterdam, 2000, pp. 633-701]. For a large 3D configuration made of several chains, short is meant to be the Euclidean shortest multiple disconnected path (SP) where primitive paths are constructed for all chains simultaneously. While the latter problem, in general, does not possess a unique solution, the algorithm must return a locally optimal solution, robust against minor displacements of the disconnected path and chain re-labeling. The problem is solved if the number of kinks (or entanglements Z), explicitly deduced from the SP, is quite insensitive to the exact conformation of the SP which allows to estimate Z with a small error. Efficient method of solution: Primitive paths are constructed from the given polymer configuration (a non-shortest multiple disconnected path, including obstacles, if present) by first replacing each polymer contour by a line with a number of 'kinks' (beads, nodes) and 'segments' (edges). To obtain primitive paths, defined to be uncrossable by any other objects (neighboring primitive paths, line or point obstacles), the algorithm minimizes the length of all primitive paths consecutively, until a final minimum Euclidean length of the SP is reached. Fast geometric operations rather than dynamical methods are used to minimize the contour lengths of the primitive paths. Neighbor lists are used to keep track of potentially intersecting segments of other chains. Periodic boundary conditions are employed. A finite small line thickness is used in order to make sure that entanglements are not 'lost' due to finite precision of representation of numbers. Restrictions on the complexity of the problem: For a single chain embedded within fixed line or point obstacles, the algorithm returns the exact SP. For more complex problems, the algorithm returns a locally optimal SP. Except for exotic, probably rare, configurations it turns out that different locally optimal SPs possess quite an identical number of nodes. In general, the problem constructing the SP is known to be NP-hard [J.S.B. Mitchell, Geometric shortest paths and network optimization, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, Elsevier, Amsterdam, 2000, pp. 633-701], and we offer a solution which should suffice to analyze physical problems, and gives an estimate about the precision and uniqueness of the result (from a standard deviation by varying the parameter: cyclicswitch). The program is NOT restricted to handle systems for which segment lengths of the SP exceed half the box size. Typical running time: Typical running times are approximately two orders of magnitude shorter compared with the ones needed for a corresponding molecular dynamics approach, and scale mostly linearly with system size. We provide a benchmark table.

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.

Optimized path planning for soft tissue resection via laser vaporization

NASA Astrophysics Data System (ADS)

Ross, Weston; Cornwell, Neil; Tucker, Matthew; Mann, Brian; Codd, Patrick

2018-02-01

Robotic and robotic-assisted surgeries are becoming more prevalent with the promise of improving surgical outcomes through increased precision, reduced operating times, and minimally invasive procedures. The handheld laser scalpel in neurosurgery has been shown to provide a more gentle approach to tissue manipulation on or near critical structures over classical tooling, though difficulties of control have prevented large scale adoption of the tool. This paper presents a novel approach to generating a cutting path for the volumetric resection of tissue using a computer-guided laser scalpel. A soft tissue ablation simulator is developed and used in conjunction with an optimization routine to select parameters which maximize the total resection of target tissue while minimizing the damage to surrounding tissue. The simulator predicts the ablative properties of tissue from an interrogation cut for tuning and simulates the removal of a tumorous tissue embedded on the surface of healthy tissue using a laser scalpel. We demonstrate the ability to control depth and smoothness of cut using genetic algorithms to optimize the ablation parameters and cutting path. The laser power level, cutting rate and spacing between cuts are optimized over multiple surface cuts to achieve the desired resection volumes.

Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNs.

PubMed

Liu, Lianggui; Chen, Li; Jia, Huiling

2016-02-19

In large-scale wireless sensor networks (WSNs), in order to enhance network security, it is crucial for a trustor node to perform social milieu oriented routing to a target a trustee node to carry out trust evaluation. This challenging social milieu oriented routing with more than one end-to-end Quality of Trust (QoT) constraint has proved to be NP-complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this challenging problem. However, existing solutions cannot guarantee the efficiency of searching; that is, they can hardly avoid obtaining partial optimal solutions during a searching process. Quantum annealing (QA) uses delocalization and tunneling to avoid falling into local minima without sacrificing execution time. This has been proven a promising way to many optimization problems in recently published literatures. In this paper, for the first time, with the help of a novel approach, that is, configuration path-integral Monte Carlo (CPIMC) simulations, a QA-based optimal social trust path (QA_OSTP) selection algorithm is applied to the extraction of the optimal social trust path in large-scale WSNs. Extensive experiments have been conducted, and the experiment results demonstrate that QA_OSTP outperforms its heuristic opponents.

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.

Sampling-Based Coverage Path Planning for Complex 3D Structures

DTIC Science & Technology

2012-09-01

one such task, in which a single robot must sweep its end effector over the entirety of a known workspace. For two-dimensional environments, optimal...structures. First, we introduce a new algorithm for planning feasible coverage paths. It is more computationally efficient in problems of complex geometry...iteratively shortens and smooths a feasible coverage path; robot configurations are adjusted without violating any coverage con- straints. Third, we propose

Application of ant colony algorithm in path planning of the data center room robot

NASA Astrophysics Data System (ADS)

Wang, Yong; Ma, Jianming; Wang, Ying

2017-05-01

According to the Internet Data Center (IDC) room patrol robot as the background, the robot in the search path of autonomous obstacle avoidance and path planning ability, worked out in advance of the robot room patrol mission. The simulation experimental results show that the improved ant colony algorithm for IDC room patrol robot obstacle avoidance planning, makes the robot along an optimal or suboptimal and safe obstacle avoidance path to reach the target point to complete the task. To prove the feasibility of the method.

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.

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.

Development of the Animal Management and Husbandry Online Placement Tool.

PubMed

Bates, Lucy; Crowther, Emma; Bell, Catriona; Kinnison, Tierney; Baillie, Sarah

2013-01-01

The workplace provides veterinary students with opportunities to develop a range of skills, making workplace learning an important part of veterinary education in many countries. Good preparation for work placements is vital to maximize learning; to this end, our group has developed a series of three computer-aided learning (CAL) packages to support students. The third of this series is the Animal Management and Husbandry Online Placement Tool (AMH OPT). Students need a sound knowledge of animal husbandry and the ability to handle the common domestic species. However, teaching these skills at university is not always practical and requires considerable resources. In the UK, the Royal College of Veterinary Surgeons (RCVS) requires students to complete 12 weeks of pre-clinical animal management and husbandry work placements or extramural studies (EMS). The aims are for students to improve their animal handling skills and awareness of husbandry systems, develop communication skills, and understand their future clients' needs. The AMH OPT is divided into several sections: Preparation, What to Expect, Working with People, Professionalism, Tips, and Frequently Asked Questions. Three stakeholder groups (university EMS coordinators, placement providers, and students) were consulted initially to guide the content and design and later to evaluate previews. Feedback from stakeholders was used in an iterative design process, resulting in a program that aims to facilitate student preparation, optimize the learning opportunities, and improve the experience for both students and placement providers. The CAL is available online and is open-access worldwide to support students during veterinary school.

Treatment of Intra- and Extracranial Arterial Dissections Using Stents and Embolization

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

Joo, Jin Yang; Ahn, Jung Yong, E-mail: jyahn@cha.ac.kr; Chung, Young Sun

2005-06-15

Purpose. To evaluate the safety and efficacy of stent placement for extracranial and intracranial arterial dissections. Methods. Eighteen patients underwent endovascular treatment of carotid and vertebral dissections using intraluminal stent placement. Five patients with arterial dissection were treated, 2 using one insertion of a single stent and 3 using placement of two stents. Patients with a dissecting aneurysm were treated as follows: 7 patients with insertion of one stent, 4 with placement of two stents, and 2 by stent-assisted Guglielmi detachable coil embolization. In the 18 patients in whom stenting was attempted, the overall success in reaching the target lesionmore » was 94.4%. Of the 17 patients treated with stents, stent release and positioning were considered optimal in 16 (94%) and suboptimal in one (6%). In patients who underwent a successful procedure, all parent arteries were preserved. There were no instances of postprocedural ischemic attacks, new neurologic deficits, or new minor or major strokes prior to patient discharge. In follow up, all patients were assessed, using the modified Rankin scale, as functionally improved or of stable clinical status. The reduction in dissection-induced stenosis or pseudoaneurysm, the patency rate obtained at follow-up, and the lack of strokes (ischemic or hemorrhagic) suggest that stent placement offers a viable alternative to complex surgical bypass or reconstructive procedures. The long-term efficacy and durability of stent placement for arterial dissection remain to be determined in a larger series.« less

Homography-based control scheme for mobile robots with nonholonomic and field-of-view constraints.

PubMed

López-Nicolás, Gonzalo; Gans, Nicholas R; Bhattacharya, Sourabh; Sagüés, Carlos; Guerrero, Josechu J; Hutchinson, Seth

2010-08-01

In this paper, we present a visual servo controller that effects optimal paths for a nonholonomic differential drive robot with field-of-view constraints imposed by the vision system. The control scheme relies on the computation of homographies between current and goal images, but unlike previous homography-based methods, it does not use the homography to compute estimates of pose parameters. Instead, the control laws are directly expressed in terms of individual entries in the homography matrix. In particular, we develop individual control laws for the three path classes that define the language of optimal paths: rotations, straight-line segments, and logarithmic spirals. These control laws, as well as the switching conditions that define how to sequence path segments, are defined in terms of the entries of homography matrices. The selection of the corresponding control law requires the homography decomposition before starting the navigation. We provide a controllability and stability analysis for our system and give experimental results.

Effective use of congestion in complex networks

NASA Astrophysics Data System (ADS)

Echagüe, Juan; Cholvi, Vicent; Kowalski, Dariusz R.

2018-03-01

In this paper, we introduce a congestion-aware routing protocol that selects the paths according to the congestion of nodes in the network. The aim is twofold: on one hand, and in order to prevent the networks from collapsing, it provides a good tolerance to nodes' overloads; on the other hand, and in order to guarantee efficient communication, it also incentivize the routes to follow short paths. We analyze the performance of our proposed routing strategy by means of a series of experiments carried out by using simulations. We show that it provides a tolerance to collapse close to the optimal value. Furthermore, the average length of the paths behaves optimally up to the certain value of packet generation rate ρ and it grows in a linear fashion with the increase of ρ.

Optimal guidance with obstacle avoidance for nap-of-the-earth flight

NASA Technical Reports Server (NTRS)

Pekelsma, Nicholas J.

1988-01-01

The development of automatic guidance is discussed for helicopter Nap-of-the-Earth (NOE) and near-NOE flight. It deals with algorithm refinements relating to automated real-time flight path planning and to mission planning. With regard to path planning, it relates rotorcraft trajectory characteristics to the NOE computation scheme and addresses real-time computing issues and both ride quality issues and pilot-vehicle interfaces. The automated mission planning algorithm refinements include route optimization, automatic waypoint generation, interactive applications, and provisions for integrating the results into the real-time path planning software. A microcomputer based mission planning workstation was developed and is described. Further, the application of Defense Mapping Agency (DMA) digital terrain to both the mission planning workstation and to automatic guidance is both discussed and illustrated.

Optimization of Composite Structures with Curved Fiber Trajectories

NASA Astrophysics Data System (ADS)

Lemaire, Etienne; Zein, Samih; Bruyneel, Michael

2014-06-01

This paper studies the problem of optimizing composites shells manufactured using Automated Tape Layup (ATL) or Automated Fiber Placement (AFP) processes. The optimization procedure relies on a new approach to generate equidistant fiber trajectories based on Fast Marching Method. Starting with a (possibly curved) reference fiber direction defined on a (possibly curved) meshed surface, the new method allows determining fibers orientation resulting from a uniform thickness layup. The design variables are the parameters defining the position and the shape of the reference curve which results in very few design variables. Thanks to this efficient parameterization, maximum stiffness optimization numerical applications are proposed. The shape of the design space is discussed, regarding local and global optimal solutions.

Medical student experiences in prison health services and social cognitive career choice: a qualitative study.

PubMed

Brooker, Ron; Hu, Wendy; Reath, Jennifer; Abbott, Penelope

2018-01-02

One of the purposes of undergraduate medical education is to assist students to consider their future career paths in medicine, alongside the needs of the societies in which they will serve. Amongst the most medically underserved groups of society are people in prison and those with a history of incarceration. In this study we examined the experiences of medical students undertaking General Practice placements in a prison health service. We used the theoretical framework of the Social Cognitive Career Theory (SCCT) to explore the potential of these placements to influence the career choices of medical students. Questionnaire and interview data were collected from final year students, comprising pre and post placement questionnaire free text responses and post placement semi-structured interviews. Data were analysed using inductive thematic analysis, with reference to concepts from the SCCT Interest Model to further develop the findings. Clinical education delivered in a prison setting can provide learning that includes exposure to a wide variety of physical and mental health conditions and also has the potential to stimulate career interest in an under-served area. While students identified many challenges in the work of a prison doctor, increased confidence (SCCT- Self-Efficacy) occurred through performance success within challenging consultations and growth in a professional approach to prisoners and people with a history of incarceration. Positive expectations (SCCT- Outcome Expectations) of fulfilling personal values and social justice aims and of achieving public health outcomes, and a greater awareness of work as a prison doctor, including stereotype rejection, promoted student interest in working with people in contact with the criminal justice system. Placements in prison health services can stimulate student interest in working with prisoners and ex-prisoners by either consolidating pre-existing interest or expanding interest into a field they had not previously considered. An important aspect of such learning is the opportunity to overcome negative preconceptions of consultations with prisoners.

Creation of Artificial Landscapes Spatial Systems Optimizing Human Habitat on Southern Coasts of the Russian Far East

NASA Astrophysics Data System (ADS)

Golikov, S. Yu; Petukhov, V. I.; Maiorov, I. S.

2017-11-01

The features of artificial landscapes’ spatial systems created for the optimization of industry facilities and settlements (as well as forest and agricultural crops taking into account the optimality of the existing microclimate and the possibilities for its improvement) are discussed in the paper. They improve the population health (through the optimization of the environment of settlements), the health of farm animals, the state of crops (through optimization of the climate), watercourses and forests reducing catastrophes on the shores and slopes by the proper selection and placement of species for artificial planting. They are achieved by revegetation, greening, garden and landscape design. In general, their purpose is to optimize the human environment.

An educational rationale for deaf students with multiple disabilities.

PubMed

Ewing, Karen M; Jones, Thomas W

2003-01-01

Deaf students with with multiple disabilities have a long history of limited opportunity, including limited access to educational opportunities available to their deaf peers. This article places the individual needs of deaf students with multiple disabilities in the context that guides much of deaf education--the importance of language acquisition. That emphasis provides a basis for placement and curriculum options for deaf students with multiple disabilities. The authors review the evolution of placement options, describe assumptions that should guide placement and curriculum decisions, and recommend practices for optimizing these students' education. Descriptions of three service delivery models--multidisciplinary, interdisciplinary, and transdisciplinary--are provided, as well as an overview of the effectiveness of person-centered planning for deaf students with multiple disabilities. Disability-specific resources are highlighted that relate to mental retardation, autism, visual impairments, learning disabilities, attention deficit hyperactivity disorder, emotional disorders, medical issues, and general resources.

An optimization model for metabolic pathways.

PubMed

Planes, F J; Beasley, J E

2009-10-15

Different mathematical methods have emerged in the post-genomic era to determine metabolic pathways. These methods can be divided into stoichiometric methods and path finding methods. In this paper we detail a novel optimization model, based upon integer linear programming, to determine metabolic pathways. Our model links reaction stoichiometry with path finding in a single approach. We test the ability of our model to determine 40 annotated Escherichia coli metabolic pathways. We show that our model is able to determine 36 of these 40 pathways in a computationally effective manner.

Tool path strategy and cutting process monitoring in intelligent machining

NASA Astrophysics Data System (ADS)

Chen, Ming; Wang, Chengdong; An, Qinglong; Ming, Weiwei

2018-06-01

Intelligent machining is a current focus in advanced manufacturing technology, and is characterized by high accuracy and efficiency. A central technology of intelligent machining—the cutting process online monitoring and optimization—is urgently needed for mass production. In this research, the cutting process online monitoring and optimization in jet engine impeller machining, cranio-maxillofacial surgery, and hydraulic servo valve deburring are introduced as examples of intelligent machining. Results show that intelligent tool path optimization and cutting process online monitoring are efficient techniques for improving the efficiency, quality, and reliability of machining.

Simulation in production of open rotor propellers: from optimal surface geometry to automated control of mechanical treatment

NASA Astrophysics Data System (ADS)

Grinyok, A.; Boychuk, I.; Perelygin, D.; Dantsevich, I.

2018-03-01

A complex method of the simulation and production design of open rotor propellers was studied. An end-to-end diagram was proposed for the evaluating, designing and experimental testing the optimal geometry of the propeller surface, for the machine control path generation as well as for simulating the cutting zone force condition and its relationship with the treatment accuracy which was defined by the propeller elastic deformation. The simulation data provided the realization of the combined automated path control of the cutting tool.

Materials and process optimization for dual-shell satellite antenna reflectors

NASA Astrophysics Data System (ADS)

Balaski, Darcy R.; van Oyen, Hans J.; Nissan, Sorin J.

A comprehensive, design-optimization test program was conducted for satellite antenna reflectors composed of two offset paraboloidal Kevlar-reinforced sandwich shells separated by a circular sandwich structure. In addition to standard mechanical properties testing, coefficient of thermal expansion and hygroscopic tests were conducted to predict reflector surface accuracy in the thermal cycling environment of orbital space. Attention was given to the relative placement of components during assembly, in view of reflector surface measurements.

Validation of the U.S. NRC NGNP evaluation model with the HTTR

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

Saller, T.; Seker, V.; Downar, T.

2012-07-01

The High Temperature Test Reactor (HTTR) was modeled with TRITON/PARCS. Traditional light water reactor (LWR) homogenization methods rely on the short mean free paths of neutrons in LWR. In gas-cooled, graphite-moderated reactors like the HTTR neutrons have much longer mean free paths and penetrate further into neighboring assemblies than in LWRs. Because of this, conventional lattice calculations with a single assembly may not be valid. In addition to difficulties caused by the longer mean free paths, the HTTR presents unique axial and radial heterogeneities that require additional modifications to the single assembly homogenization method. To handle these challenges, the homogenizationmore » domain is decreased while the computational domain is increased. Instead of homogenizing a single hexagonal fuel assembly, the assembly is split into six triangles on the radial plane and five blocks axially in order to account for the placement of burnable poisons. Furthermore, the radial domain is increased beyond a single fuel assembly to account for spectrum effects from neighboring fuel, reflector, and control rod assemblies. A series of five two-dimensional cases, each closer to the full core, were calculated to evaluate the effectiveness of the homogenization method and cross-sections. (authors)« less

ELASTIC NET FOR COX'S PROPORTIONAL HAZARDS MODEL WITH A SOLUTION PATH ALGORITHM.

PubMed

Wu, Yichao

2012-01-01

For least squares regression, Efron et al. (2004) proposed an efficient solution path algorithm, the least angle regression (LAR). They showed that a slight modification of the LAR leads to the whole LASSO solution path. Both the LAR and LASSO solution paths are piecewise linear. Recently Wu (2011) extended the LAR to generalized linear models and the quasi-likelihood method. In this work we extend the LAR further to handle Cox's proportional hazards model. The goal is to develop a solution path algorithm for the elastic net penalty (Zou and Hastie (2005)) in Cox's proportional hazards model. This goal is achieved in two steps. First we extend the LAR to optimizing the log partial likelihood plus a fixed small ridge term. Then we define a path modification, which leads to the solution path of the elastic net regularized log partial likelihood. Our solution path is exact and piecewise determined by ordinary differential equation systems.

Optimisation des trajectoires d'un systeme de gestion de vol d'avions pour la reduction des couts de vol

NASA Astrophysics Data System (ADS)

Sidibe, Souleymane

The implementation and monitoring of operational flight plans is a major occupation for a crew of commercial flights. The purpose of this operation is to set the vertical and lateral trajectories followed by airplane during phases of flight: climb, cruise, descent, etc. These trajectories are subjected to conflicting economical constraints: minimization of flight time and minimization of fuel consumed and environmental constraints. In its task of mission planning, the crew is assisted by the Flight Management System (FMS) which is used to construct the path to follow and to predict the behaviour of the aircraft along the flight plan. The FMS considered in our research, particularly includes an optimization model of flight only by calculating the optimal speed profile that minimizes the overall cost of flight synthesized by a criterion of cost index following a steady cruising altitude. However, the model based solely on optimization of the speed profile is not sufficient. It is necessary to expand the current optimization for simultaneous optimization of the speed and altitude in order to determine an optimum cruise altitude that minimizes the overall cost when the path is flown with the optimal speed profile. Then, a new program was developed. The latter is based on the method of dynamic programming invented by Bellman to solve problems of optimal paths. In addition, the improvement passes through research new patterns of trajectories integrating ascendant cruises and using the lateral plane with the effect of the weather: wind and temperature. Finally, for better optimization, the program takes into account constraint of flight domain of aircrafts which utilize the FMS.

Optimal loop placement and models for length - based vehicle classification and stop - and - go traffic.

DOT National Transportation Integrated Search

2011-01-01

Inductive loops are widely used nationwide for traffic monitoring as a data source for a variety of : needs in generating traffic information for operation and planning analysis, validations of travel : demand models, freight studies, pavement design...

Design and Evaluation of a Dynamic Programming Flight Routing Algorithm Using the Convective Weather Avoidance Model

NASA Technical Reports Server (NTRS)

Ng, Hok K.; Grabbe, Shon; Mukherjee, Avijit

2010-01-01

The optimization of traffic flows in congested airspace with varying convective weather is a challenging problem. One approach is to generate shortest routes between origins and destinations while meeting airspace capacity constraint in the presence of uncertainties, such as weather and airspace demand. This study focuses on development of an optimal flight path search algorithm that optimizes national airspace system throughput and efficiency in the presence of uncertainties. The algorithm is based on dynamic programming and utilizes the predicted probability that an aircraft will deviate around convective weather. It is shown that the running time of the algorithm increases linearly with the total number of links between all stages. The optimal routes minimize a combination of fuel cost and expected cost of route deviation due to convective weather. They are considered as alternatives to the set of coded departure routes which are predefined by FAA to reroute pre-departure flights around weather or air traffic constraints. A formula, which calculates predicted probability of deviation from a given flight path, is also derived. The predicted probability of deviation is calculated for all path candidates. Routes with the best probability are selected as optimal. The predicted probability of deviation serves as a computable measure of reliability in pre-departure rerouting. The algorithm can also be extended to automatically adjust its design parameters to satisfy the desired level of reliability.

Evaluation of Effective Factors on Travel Time in Optimization of Bus Stops Placement Using Genetic Algorithm

NASA Astrophysics Data System (ADS)

Bargegol, Iraj; Ghorbanzadeh, Mahyar; Ghasedi, Meisam; Rastbod, Mohammad

2017-10-01

In congested cities, locating and proper designing of bus stops according to the unequal distribution of passengers is crucial issue economically and functionally, since this subject plays an important role in the use of bus system by passengers. Location of bus stops is a complicated subject; by reducing distances between stops, walking time decreases, but the total travel time may increase. In this paper, a specified corridor in the city of Rasht in north of Iran is studied. Firstly, a new formula is presented to calculate the travel time, by which the number of stops and consequently, the travel time can be optimized. An intended corridor with specified number of stops and distances between them is addressed, the related formulas to travel time are created, and its travel time is calculated. Then the corridor is modelled using a meta-heuristic method in order that the placement and the optimal distances of bus stops for that are determined. It was found that alighting and boarding time along with bus capacity are the most effective factors affecting travel time. Consequently, it is better to have more concentration on indicated factors for improving the efficiency of bus system.

Evolvable Neuronal Paths: A Novel Basis for Information and Search in the Brain

PubMed Central

Fernando, Chrisantha; Vasas, Vera; Szathmáry, Eörs; Husbands, Phil

2011-01-01

We propose a previously unrecognized kind of informational entity in the brain that is capable of acting as the basis for unlimited hereditary variation in neuronal networks. This unit is a path of activity through a network of neurons, analogous to a path taken through a hidden Markov model. To prove in principle the capabilities of this new kind of informational substrate, we show how a population of paths can be used as the hereditary material for a neuronally implemented genetic algorithm, (the swiss-army knife of black-box optimization techniques) which we have proposed elsewhere could operate at somatic timescales in the brain. We compare this to the same genetic algorithm that uses a standard ‘genetic’ informational substrate, i.e. non-overlapping discrete genotypes, on a range of optimization problems. A path evolution algorithm (PEA) is defined as any algorithm that implements natural selection of paths in a network substrate. A PEA is a previously unrecognized type of natural selection that is well suited for implementation by biological neuronal networks with structural plasticity. The important similarities and differences between a standard genetic algorithm and a PEA are considered. Whilst most experiments are conducted on an abstract network model, at the conclusion of the paper a slightly more realistic neuronal implementation of a PEA is outlined based on Izhikevich spiking neurons. Finally, experimental predictions are made for the identification of such informational paths in the brain. PMID:21887266

Sensory feedback in a bump attractor model of path integration.

PubMed

Poll, Daniel B; Nguyen, Khanh; Kilpatrick, Zachary P

2016-04-01

Mammalian spatial navigation systems utilize several different sensory information channels. This information is converted into a neural code that represents the animal's current position in space by engaging place cell, grid cell, and head direction cell networks. In particular, sensory landmark (allothetic) cues can be utilized in concert with an animal's knowledge of its own velocity (idiothetic) cues to generate a more accurate representation of position than path integration provides on its own (Battaglia et al. The Journal of Neuroscience 24(19):4541-4550 (2004)). We develop a computational model that merges path integration with feedback from external sensory cues that provide a reliable representation of spatial position along an annular track. Starting with a continuous bump attractor model, we explore the impact of synaptic spatial asymmetry and heterogeneity, which disrupt the position code of the path integration process. We use asymptotic analysis to reduce the bump attractor model to a single scalar equation whose potential represents the impact of asymmetry and heterogeneity. Such imperfections cause errors to build up when the network performs path integration, but these errors can be corrected by an external control signal representing the effects of sensory cues. We demonstrate that there is an optimal strength and decay rate of the control signal when cues appear either periodically or randomly. A similar analysis is performed when errors in path integration arise from dynamic noise fluctuations. Again, there is an optimal strength and decay of discrete control that minimizes the path integration error.

Estimation of optimal nasotracheal tube depth in adult patients.

PubMed

Ji, Sung-Mi

2017-12-01

The aim of this study was to estimate the optimal depth of nasotracheal tube placement. We enrolled 110 patients scheduled to undergo oral and maxillofacial surgery, requiring nasotracheal intubation. After intubation, the depth of tube insertion was measured. The neck circumference and distances from nares to tragus, tragus to angle of the mandible, and angle of the mandible to sternal notch were measured. To estimate optimal tube depth, correlation and regression analyses were performed using clinical and anthropometric parameters. The mean tube depth was 28.9 ± 1.3 cm in men (n = 62), and 26.6 ± 1.5 cm in women (n = 48). Tube depth significantly correlated with height (r = 0.735, P < 0.001). Distances from nares to tragus, tragus to angle of the mandible, and angle of the mandible to sternal notch correlated with depth of the endotracheal tube (r = 0.363, r = 0.362, and r = 0.546, P < 0.05). The tube depth also correlated with the sum of these distances (r = 0.646, P < 0.001). We devised the following formula for estimating tube depth: 19.856 + 0.267 × sum of the three distances (R 2 = 0.432, P < 0.001). The optimal tube depth for nasotracheally intubated adult patients correlated with height and sum of the distances from nares to tragus, tragus to angle of the mandible, and angle of the mandible to sternal notch. The proposed equation would be a useful guide to determine optimal nasotracheal tube placement.

Targeted Pressure Management During CO 2 Sequestration: Optimization of Well Placement and Brine Extraction

DOE PAGES

Cihan, Abdullah; Birkholzer, Jens; Bianchi, Marco

2014-12-31

Large-scale pressure increases resulting from carbon dioxide (CO 2) injection in the subsurface can potentially impact caprock integrity, induce reactivation of critically stressed faults, and drive CO 2 or brine through conductive features into shallow groundwater. Pressure management involving the extraction of native fluids from storage formations can be used to minimize pressure increases while maximizing CO2 storage. However, brine extraction requires pumping, transportation, possibly treatment, and disposal of substantial volumes of extracted brackish or saline water, all of which can be technically challenging and expensive. This paper describes a constrained differential evolution (CDE) algorithm for optimal well placement andmore » injection/ extraction control with the goal of minimizing brine extraction while achieving predefined pressure contraints. The CDE methodology was tested for a simple optimization problem whose solution can be partially obtained with a gradient-based optimization methodology. The CDE successfully estimated the true global optimum for both extraction well location and extraction rate, needed for the test problem. A more complex example application of the developed strategy was also presented for a hypothetical CO 2 storage scenario in a heterogeneous reservoir consisting of a critically stressed fault nearby an injection zone. Through the CDE optimization algorithm coupled to a numerical vertically-averaged reservoir model, we successfully estimated optimal rates and locations for CO 2 injection and brine extraction wells while simultaneously satisfying multiple pressure buildup constraints to avoid fault activation and caprock fracturing. The study shows that the CDE methodology is a very promising tool to solve also other optimization problems related to GCS, such as reducing ‘Area of Review’, monitoring design, reducing risk of leakage and increasing storage capacity and trapping.« less

Memory-efficient dynamic programming backtrace and pairwise local sequence alignment.

PubMed

Newberg, Lee A

2008-08-15

A backtrace through a dynamic programming algorithm's intermediate results in search of an optimal path, or to sample paths according to an implied probability distribution, or as the second stage of a forward-backward algorithm, is a task of fundamental importance in computational biology. When there is insufficient space to store all intermediate results in high-speed memory (e.g. cache) existing approaches store selected stages of the computation, and recompute missing values from these checkpoints on an as-needed basis. Here we present an optimal checkpointing strategy, and demonstrate its utility with pairwise local sequence alignment of sequences of length 10,000. Sample C++-code for optimal backtrace is available in the Supplementary Materials. Supplementary data is available at Bioinformatics online.

Path Planning For A Class Of Cutting Operations

NASA Astrophysics Data System (ADS)

Tavora, Jose

1989-03-01

Optimizing processing time in some contour-cutting operations requires solving the so-called no-load path problem. This problem is formulated and an approximate resolution method (based on heuristic search techniques) is described. Results for real-life instances (clothing layouts in the apparel industry) are presented and evaluated.

Safe Maritime Autonomous Path Planning in a High Sea State

NASA Technical Reports Server (NTRS)

Ono, Masahiro; Quadrelli, Marco; Huntsberger, Terrance L.

2014-01-01

This paper presents a path planning method for sea surface vehicles that prevents capsizing and bow-diving in a high sea-state. A key idea is to use response amplitude operators (RAOs) or, in control terminology, the transfer functions from a sea state to a vessel's motion, in order to find a set of speeds and headings that results in excessive pitch and roll oscillations. This information is translated to arithmetic constraints on the ship's velocity, which are passed to a model predictive control (MPC)-based path planner to find a safe and optimal path that achieves specified goals. An obstacle avoidance capability is also added to the path planner. The proposed method is demonstrated by simulations.

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.

Visual environment recognition for robot path planning using template matched filters

NASA Astrophysics Data System (ADS)

Orozco-Rosas, Ulises; Picos, Kenia; Díaz-Ramírez, Víctor H.; Montiel, Oscar; Sepúlveda, Roberto

2017-08-01

A visual approach in environment recognition for robot navigation is proposed. This work includes a template matching filtering technique to detect obstacles and feasible paths using a single camera to sense a cluttered environment. In this problem statement, a robot can move from the start to the goal by choosing a single path between multiple possible ways. In order to generate an efficient and safe path for mobile robot navigation, the proposal employs a pseudo-bacterial potential field algorithm to derive optimal potential field functions using evolutionary computation. Simulation results are evaluated in synthetic and real scenes in terms of accuracy of environment recognition and efficiency of path planning computation.

Take me where I want to go: Institutional prestige, advisor sponsorship, and academic career placement preferences.

PubMed

Pinheiro, Diogo L; Melkers, Julia; Newton, Sunni

2017-01-01

Placement in prestigious research institutions for STEM (science, technology, engineering, and mathematics) PhD recipients is generally considered to be optimal. Yet some doctoral recipients are not interested in intensive research careers and instead seek alternative careers, outside but also within academe (for example teaching positions in Liberal Arts Schools). Recent attention to non-academic pathways has expanded our understanding of alternative PhD careers. However, career preferences and placements are also nuanced along the academic pathway. Existing research on academic careers (mostly research-centric) has found that certain factors have a significant impact on the prestige of both the institutional placement and the salary of PhD recipients. We understand less, however, about the functioning of career preferences and related placements outside of the top academic research institutions. Our work builds on prior studies of academic career placement to explore the impact that prestige of PhD-granting institution, advisor involvement, and cultural capital have on the extent to which STEM PhDs are placed in their preferred academic institution types. What determines whether an individual with a preference for research oriented institutions works at a Research Extensive university? Or whether an individual with a preference for teaching works at a Liberal Arts college? Using survey data from a nationally representative sample of faculty in biology, biochemistry, civil engineering and mathematics at four different Carnegie Classified institution types (Research Extensive, Research Intensive, Master's I & II, and Liberal Arts Colleges), we examine the relative weight of different individual and institutional characteristics on institutional type placement. We find that doctoral institutional prestige plays a significant role in matching individuals with their preferred institutional type, but that advisor involvement only has an impact on those with a preference for research oriented institutions. Gender effects are also observed, particularly in the role of the advisor in affecting preferred career placement.

Take me where I want to go: Institutional prestige, advisor sponsorship, and academic career placement preferences

PubMed Central

Pinheiro, Diogo L.; Newton, Sunni

2017-01-01

Placement in prestigious research institutions for STEM (science, technology, engineering, and mathematics) PhD recipients is generally considered to be optimal. Yet some doctoral recipients are not interested in intensive research careers and instead seek alternative careers, outside but also within academe (for example teaching positions in Liberal Arts Schools). Recent attention to non-academic pathways has expanded our understanding of alternative PhD careers. However, career preferences and placements are also nuanced along the academic pathway. Existing research on academic careers (mostly research-centric) has found that certain factors have a significant impact on the prestige of both the institutional placement and the salary of PhD recipients. We understand less, however, about the functioning of career preferences and related placements outside of the top academic research institutions. Our work builds on prior studies of academic career placement to explore the impact that prestige of PhD-granting institution, advisor involvement, and cultural capital have on the extent to which STEM PhDs are placed in their preferred academic institution types. What determines whether an individual with a preference for research oriented institutions works at a Research Extensive university? Or whether an individual with a preference for teaching works at a Liberal Arts college? Using survey data from a nationally representative sample of faculty in biology, biochemistry, civil engineering and mathematics at four different Carnegie Classified institution types (Research Extensive, Research Intensive, Master’s I & II, and Liberal Arts Colleges), we examine the relative weight of different individual and institutional characteristics on institutional type placement. We find that doctoral institutional prestige plays a significant role in matching individuals with their preferred institutional type, but that advisor involvement only has an impact on those with a preference for research oriented institutions. Gender effects are also observed, particularly in the role of the advisor in affecting preferred career placement. PMID:28493914

2D projection-based software application for mobile C-arms optimises wire placement in the proximal femur - An experimental study.

PubMed

Swartman, B; Frere, D; Wei, W; Schnetzke, M; Beisemann, N; Keil, H; Franke, J; Grützner, P A; Vetter, S Y

2017-10-01

A new software application can be used without fixed reference markers or a registration process in wire placement. The aim was to compare placement of Kirschner wires (K-wires) into the proximal femur with the software application versus the conventional method without guiding. As study hypothesis, we assumed less placement attempts, shorter procedure time and shorter fluoroscopy time using the software. The same precision inside a proximal femur bone model using the software application was premised. The software detects a K-wire within the 2D fluoroscopic image. By evaluating its direction and tip location, it superimposes a trajectory on the image, visualizing the intended direction of the K-wire. The K-wire was positioned in 20 artificial bones with the use of software by one surgeon; 20 bones served as conventional controls. A brass thumb tack was placed into the femoral head and its tip targeted with the wire. Number of placement attempts, duration of the procedure, duration of fluoroscopy time and distance to the target in a postoperative 3D scan were recorded. Compared with the conventional method, use of the application showed fewer attempts for optimal wire placement (p=0.026), shorter duration of surgery (p=0.004), shorter fluoroscopy time (p=0.024) and higher precision (p=0.018). Final wire position was achieved in the first attempt in 17 out of 20 cases with the software and in 9 out of 20 cases with the conventional method. The study hypothesis was confirmed. The new application optimised the process of K-wire placement in the proximal femur in an artificial bone model while also improving precision. Benefits lie especially in the reduction of placement attempts and reduction of fluoroscopy time under the aspect of radiation protection. The software runs on a conventional image intensifier and can therefore be easily integrated into the daily surgical routine. Copyright © 2017 Elsevier Ltd. All rights reserved.

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.

Path Planning for Robot based on Chaotic Artificial Potential Field Method

NASA Astrophysics Data System (ADS)

Zhang, Cheng

2018-03-01

Robot path planning in unknown environments is one of the hot research topics in the field of robot control. Aiming at the shortcomings of traditional artificial potential field methods, we propose a new path planning for Robot based on chaotic artificial potential field method. The path planning adopts the potential function as the objective function and introduces the robot direction of movement as the control variables, which combines the improved artificial potential field method with chaotic optimization algorithm. Simulations have been carried out and the results demonstrate that the superior practicality and high efficiency of the proposed method.

Echocardiography and cardiac MRI in mutation-negative hypertrophic cardiomyopathy in an older patient: a case defining the need for ICD.

PubMed

Rodriguez, Fatima; Degnan, Kathleen O; Seidman, Christine E; Mangion, Judy R

2014-08-01

We report the case of a 67-year-old man with hypertrophic cardiomyopathy who presented for a second opinion about implantable cardio-defibrillator (ICD) placement after a witnessed syncopal episode. Despite his older age, being mutation-negative, and having a maximal septal thickness of 2.2 cm on echocardiography, he demonstrated rapid progression of myocardial fibrosis on cardiac MRI, correlating to ventricular tachyarrhythmias and syncope. We review the role of echocardiography and cardiac MRI in optimizing medical care for such patients who may not otherwise meet criteria for an ICD placement or further interventions. © 2014, Wiley Periodicals, Inc.

Planning Image-Based Measurements in Wind Tunnels by Virtual Imaging

NASA Technical Reports Server (NTRS)

Kushner, Laura Kathryn; Schairer, Edward T.

2011-01-01

Virtual imaging is routinely used at NASA Ames Research Center to plan the placement of cameras and light sources for image-based measurements in production wind tunnel tests. Virtual imaging allows users to quickly and comprehensively model a given test situation, well before the test occurs, in order to verify that all optical testing requirements will be met. It allows optimization of the placement of cameras and light sources and leads to faster set-up times, thereby decreasing tunnel occupancy costs. This paper describes how virtual imaging was used to plan optical measurements for three tests in production wind tunnels at NASA Ames.

Optimization of IBF parameters based on adaptive tool-path algorithm

NASA Astrophysics Data System (ADS)

Deng, Wen Hui; Chen, Xian Hua; Jin, Hui Liang; Zhong, Bo; Hou, Jin; Li, An Qi

2018-03-01

As a kind of Computer Controlled Optical Surfacing(CCOS) technology. Ion Beam Figuring(IBF) has obvious advantages in the control of surface accuracy, surface roughness and subsurface damage. The superiority and characteristics of IBF in optical component processing are analyzed from the point of view of removal mechanism. For getting more effective and automatic tool path with the information of dwell time, a novel algorithm is proposed in this thesis. Based on the removal functions made through our IBF equipment and the adaptive tool-path, optimized parameters are obtained through analysis the residual error that would be created in the polishing process. A Φ600 mm plane reflector element was used to be a simulation instance. The simulation result shows that after four combinations of processing, the surface accuracy of PV (Peak Valley) value and the RMS (Root Mean Square) value was reduced to 4.81 nm and 0.495 nm from 110.22 nm and 13.998 nm respectively in the 98% aperture. The result shows that the algorithm and optimized parameters provide a good theoretical for high precision processing of IBF.

Analysis of explicit model predictive control for path-following control

PubMed Central

2018-01-01

In this paper, explicit Model Predictive Control(MPC) is employed for automated lane-keeping systems. MPC has been regarded as the key to handle such constrained systems. However, the massive computational complexity of MPC, which employs online optimization, has been a major drawback that limits the range of its target application to relatively small and/or slow problems. Explicit MPC can reduce this computational burden using a multi-parametric quadratic programming technique(mp-QP). The control objective is to derive an optimal front steering wheel angle at each sampling time so that autonomous vehicles travel along desired paths, including straight, circular, and clothoid parts, at high entry speeds. In terms of the design of the proposed controller, a method of choosing weighting matrices in an optimization problem and the range of horizons for path-following control are described through simulations. For the verification of the proposed controller, simulation results obtained using other control methods such as MPC, Linear-Quadratic Regulator(LQR), and driver model are employed, and CarSim, which reflects the features of a vehicle more realistically than MATLAB/Simulink, is used for reliable demonstration. PMID:29534080

Analysis of explicit model predictive control for path-following control.

PubMed

Lee, Junho; Chang, Hyuk-Jun

2018-01-01

In this paper, explicit Model Predictive Control(MPC) is employed for automated lane-keeping systems. MPC has been regarded as the key to handle such constrained systems. However, the massive computational complexity of MPC, which employs online optimization, has been a major drawback that limits the range of its target application to relatively small and/or slow problems. Explicit MPC can reduce this computational burden using a multi-parametric quadratic programming technique(mp-QP). The control objective is to derive an optimal front steering wheel angle at each sampling time so that autonomous vehicles travel along desired paths, including straight, circular, and clothoid parts, at high entry speeds. In terms of the design of the proposed controller, a method of choosing weighting matrices in an optimization problem and the range of horizons for path-following control are described through simulations. For the verification of the proposed controller, simulation results obtained using other control methods such as MPC, Linear-Quadratic Regulator(LQR), and driver model are employed, and CarSim, which reflects the features of a vehicle more realistically than MATLAB/Simulink, is used for reliable demonstration.

Serial robot for the trajectory optimization and error compensation of TMT mask exchange system

NASA Astrophysics Data System (ADS)

Wang, Jianping; Zhang, Feifan; Zhou, Zengxiang; Zhai, Chao

2015-10-01

Mask exchange system is the main part of Multi-Object Broadband Imaging Echellette (MOBIE) on the Thirty Meter Telescope (TMT). According to the conception of the TMT mask exchange system, the pre-design was introduced in the paper which was based on IRB 140 robot. The stiffness model of IRB 140 in SolidWorks was analyzed under different gravity vectors for further error compensation. In order to find the right location and path planning, the robot and the mask cassette model was imported into MOBIE model to perform different schemes simulation. And obtained the initial installation position and routing. Based on these initial parameters, IRB 140 robot was operated to simulate the path and estimate the mask exchange time. Meanwhile, MATLAB and ADAMS software were used to perform simulation analysis and optimize the route to acquire the kinematics parameters and compare with the experiment results. After simulation and experimental research mentioned in the paper, the theoretical reference was acquired which could high efficient improve the structure of the mask exchange system parameters optimization of the path and precision of the robot position.

Aircraft Trajectory Optimization and Contrails Avoidance in the Presence of Winds

NASA Technical Reports Server (NTRS)

Ng, Hok K.; Chen, Neil Y.

2010-01-01

There are indications that persistent contrails can lead to adverse climate change, although the complete effect on climate forcing is still uncertain. A flight trajectory optimization algorithm with fuel and contrails models, which develops alternative flight paths, provides policy makers the necessary data to make tradeoffs between persistent contrails mitigation and aircraft fuel consumption. This study develops an algorithm that calculates wind-optimal trajectories for cruising aircraft while avoiding the regions of airspace prone to persistent contrails formation. The optimal trajectories are developed by solving a non-linear optimal control problem with path constraints. The regions of airspace favorable to persistent contrails formation are modeled as penalty areas that aircraft should avoid and are adjustable. The tradeoff between persistent contrails formation and additional fuel consumption is investigated, with and without altitude optimization, for 12 city-pairs in the continental United States. Without altitude optimization, the reduction in contrail travel times is gradual with increase in total fuel consumption. When altitude is optimized, a two percent increase in total fuel consumption can reduce the total travel times through contrail regions by more than six times. Allowing further increase in fuel consumption does not seem to result in proportionate decrease in contrail travel times.

An improved artificial bee colony algorithm based on balance-evolution strategy for unmanned combat aerial vehicle path planning.

PubMed

Li, Bai; Gong, Li-gang; Yang, Wen-lun

2014-01-01

Unmanned combat aerial vehicles (UCAVs) have been of great interest to military organizations throughout the world due to their outstanding capabilities to operate in dangerous or hazardous environments. UCAV path planning aims to obtain an optimal flight route with the threats and constraints in the combat field well considered. In this work, a novel artificial bee colony (ABC) algorithm improved by a balance-evolution strategy (BES) is applied in this optimization scheme. In this new algorithm, convergence information during the iteration is fully utilized to manipulate the exploration/exploitation accuracy and to pursue a balance between local exploitation and global exploration capabilities. Simulation results confirm that BE-ABC algorithm is more competent for the UCAV path planning scheme than the conventional ABC algorithm and two other state-of-the-art modified ABC algorithms.

Electronic Attack Platform Placement Optimization

DTIC Science & Technology

2014-09-01

Processing in VBA ...............................................................33 2. Client-Server Using Two Different Excel Application...6 Figure 3. Screenshot of the VBA IDE contained within all Microsoft Office products...application using MS Excel’s Applicatin.OnTime method. .....................................33 Figure 20. WINSOCK API Functions needed to use TCP via VBA

A functionally optimized hot-mix asphalt wearing course : part I : preliminary results.

DOT National Transportation Integrated Search

2009-01-01

The purpose of this report was to highlight the preliminary findings of the design, production, placement, and early life performance of a new generation open-graded surface course (also referred to as porous friction course [PFC]) for use in Virgini...

Optimal placement of point detectors on Virginia's freeways : case studies of Northern Virginia and Richmond.

DOT National Transportation Integrated Search

2008-01-01

In Virginia, point detectors in the Northern Virginia and Hampton Roads regions are placed at approximately 1/2 mile spacing. This density is a product of early requirements for incident detection that have proven ineffective and perhaps unnecessary....

Molecular modeling of calmodulin: a comparison with crystallographic data

NASA Technical Reports Server (NTRS)

McDonald, J. J.; Rein, R.

1989-01-01

Two methods of side-chain placement on a modeled protein have been examined. Two molecular models of calmodulin were constructed that differ in the treatment of side chains prior to optimization of the molecule. A virtual bond analysis program developed by Purisima and Scheraga was used to determine the backbone conformation based on 2.2 angstroms resolution C alpha coordinates for the molecules. In the first model, side chains were initially constructed in an extended conformation. In the second model, a conformational grid search technique was employed. Calcium ions were treated explicitly during energy optimization using CHARMM. The models are compared to a recently published refined crystal structure of calmodulin. The results indicate that the initial choices for side-chains, but also significant effects on the main-chain conformation and supersecondary structure. The conformational differences are discussed. Analysis of these and other methods makes possible the formulation of a methodology for more appropriate side-chain placement in modeled proteins.

Automated Prescription of Oblique Brain 3D MRSI

PubMed Central

Ozhinsky, Eugene; Vigneron, Daniel B.; Chang, Susan M.; Nelson, Sarah J.

2012-01-01

Two major difficulties encountered in implementing Magnetic Resonance Spectroscopic Imaging (MRSI) in a clinical setting are limited coverage and difficulty in prescription. The goal of this project was to completely automate the process of 3D PRESS MRSI prescription, including placement of the selection box, saturation bands and shim volume, while maximizing the coverage of the brain. The automated prescription technique included acquisition of an anatomical MRI image, optimization of the oblique selection box parameters, optimization of the placement of OVS saturation bands, and loading of the calculated parameters into a customized 3D MRSI pulse sequence. To validate the technique and compare its performance with existing protocols, 3D MRSI data were acquired from 6 exams from 3 healthy volunteers. To assess the performance of the automated 3D MRSI prescription for patients with brain tumors, the data were collected from 16 exams from 8 subjects with gliomas. This technique demonstrated robust coverage of the tumor, high consistency of prescription and very good data quality within the T2 lesion. PMID:22692829