Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “ROUTING”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2012

Synthesis of monodisperse spherical nanometer ZrO{sub 2} (Y{sub 2}O{sub 3}) powders via the coupling route of w/o emulsion with urea homogenous precipitation

Graphical abstract: In this paper, the weight loss and reaction evolution of ZrO{sub 2} precursor powders are determined by TG-DTA, and 600 Degree-Sign C is the most reasonable calcination temperature of precursor according to the TG-DTA. At the same time, we study the effect of reaction conditions upon the particle sizes, such as concentration of zirconium nitrate solution, reaction temperature and urea content. TEM micrographs of zirconia powders indicated that ZrO{sub 2} nano-powders prepared via the coupling route of w/o emulsion with homogenous precipitation possess spherical shape and excellent dispersing. Highlights: Black-Right-Pointing-Pointer The monodisperse spherical nanometer ZrO{sub 2} (Y{sub 2}O{sub 3}) powders have been prepared via the coupling route of w/o emulsion with urea homogenous precipitation. Black-Right-Pointing-Pointer The principle of the coupling route of emulsion with homogenous precipitation has been studied. Black-Right-Pointing-Pointer The concentration of zirconium nitrate, reaction temperature of water bath and the quantity of urea effect regularly on the average particle size of products. -- Abstract: Using xylol as the oil phase, span-80 as the surfactant, and an aqueous solution containing zirconium (3 mol% Y{sub 2}O{sub 3}) and urea as the water phase, tetragonal phase ZrO{sub 2} nano-powders have been prepared via the coupling route of w/o emulsion with urea homogenous precipitation. The effects of the zirconium concentration, the reaction temperature and the urea content on the average size of the products have been examined. The as-prepared ZrO{sub 2} powders and the precursor powders were characterized by TGA-DTA, XRD, TEM and BET. Experimental results indicate that ZrO{sub 2} powders prepared via the coupling route of w/o emulsion with urea homogenous precipitation possess some excellent characteristics, such as well-rounded spherical shape and excellent dispersing.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Routes and rates of bacterial dispersal impact surface soil microbiome composition and functioning

Abstract Recent evidence suggests that, similar to larger organisms, dispersal is a key driver of microbiome assembly; however, our understanding of the rates and taxonomic composition of microbial dispersal in natural environments is limited. Here, we characterized the rate and composition of bacteria dispersing into surface soil via three dispersal routes (from the air above the vegetation, from nearby vegetation and leaf litter near the soil surface, and from the bulk soil and litter below the top layer). We then quantified the impact of those routes on microbial community composition and functioning in the topmost litter layer. The bacterial dispersal rate onto the surface layer was low (7900 cells/cm2/day) relative to the abundance of the resident community. While bacteria dispersed through all three routes at the same rate, only dispersal from above and near the soil surface impacted microbiome composition, suggesting that the composition, not rate, of dispersal influenced community assembly. Dispersal also impacted microbiome functioning. When exposed to dispersal, leaf litter decomposed faster than when dispersal was excluded, although neither decomposition rate nor litter chemistry differed by route. Overall, we conclude that the dispersal routes transport distinct bacterial communities that differentially influence the composition of the surface soil microbiome.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2019

Near-optimal routing of noisy quantum states

Placement, routing, and scheduling are essential tasks for near-optimal performance of programs for noisy quantum processors. Reliable execution of an arbitrary quantum circuit on current devices requires routing methods that overcome connectivity limitations while meeting data locality requirements. However, current devices also express highly variable noise levels in both the quantum gates and quantum registers. This requires any routing algorithm to be adaptive to both the circuit and the operating conditions. We demonstrate near-optimal routing methods of noisy quantum states that minimize the overall error of data movement while also limiting the computational complexity of routing decisions. We evaluate our methods against the noise characteristics of a 20-qubit superconducting quantum processor.

Sadlier III, Ronald↗
DOE OSTI2021

Sea ice evolution along the Northern Sea Route and implications for trans-Arctic shipping from 2021 through 2060

Arctic surface temperatures warmed at twice the global average in the second half of the 20 th century due to Arctic amplification (AA), a phenomenon predominantly caused by regional polar changes, like the melting of perennial sea ice and reduced sea ice extent (leading to more solar radiation being absorbed by the ocean surface as opposed to being reflected back to space by the ice surface). AA is projected to reach a factor of three even if the climate is stabilized by the mid 21 st century by reduced greenhouse gas emissions. In all emissions scenarios, AA is projected to lead to temperature changes at least 2.4 times larger than global mean surface temperature changes occurring between 2070 and 2100. The ice-albedo feedback, which occurs when the polar-marine surface absorbs more radiation as highly reflective sea ice melts, is reversible such that the premise of a runaway process is no longer accepted as a realistic possibility. No matter what actions are taken to reduce CO 2 concentrations in the atmosphere from now on, two different methods of predicting an ice-free Arctic suggest that perennial sea ice will mostly disappear in September by the year 2050. If there is no reduction in anthropogenic CO 2 and methane emissions, that scenario could occur sooner than 2030. Defining Arctic navigability as safe and economic passage of Polar Class 7 cargo ships without need of an escorting icebreaker, no single trans Arctic ship route will be navigable year-round in the first half of the 21 st century, including in the strong emission scenarios. However, seasonal trans-Arctic navigability will increase this century. An estimate on the number of days per year that the Northern See Route (NSR) will be navigable in the future is beyond the scope of this report. Along Northern Sea Routes 5 and 6, which run close to the Russian coast and Yamal LNG plant, an ARC 7 ice class LNG tanker, the equivalent of a Polar Class 3 (PC3) vessel, will be at low risk in December through April at some point during the current decade. May will continue to entail some risk (more than April) along relatively short segments of these routes through the end of the next decade (2030-2039). Come June, snow rapidly melts away, and thereafter the underlying sea ice begins becomes thinner and less concentrated, greatly reducing risk. However, neither path is desirable for ARC 7 tankers due to shallow bathymetry in Sannikov Strait, and a more desirable path for these ships passes to the north of the New Siberian Islands (route 20, discussed further below). Conventional LNG tankers (i.e., non-ice-strengthened vessels according to the IMO classification), without icebreaker escorts, will continue to encounter dangerous or impassable conditions along many sections of the NSR through the end of this decade for many months of the year. Through 2039, these conventional tankers will be able to operate safely along NSR 6 from August through October. By 2040-2049, the span of safe operation increases to August through November, and by 2050-2059 it increases to July through November, assuming a northward deviation to avoid the Sannikov Strait.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Effect of realistic routing on the social burden metric

The distance people travel to reach critical services is a key input to the Social Burden metric used by Sandia’s Resilient Node Cluster Analysis Tool (ReNCAT) in the optimization’s objective function. By default, ReNCAT utilizes Euclidian distances between population blocks and critical facilities when calculating Social Burden. However, these straight-line distances do not reflect how most residents or goods would travel throughout the area. As distance is a vital input to the burden calculation, a more realistic distance calculation will yield more realistic burden values. This work uses real road networks and calculates the shortest distance path between population centers and critical facilities using a standard graph theory approach. These realistic route distances are then used to compute Social Burden for four areas of study. It was found that distances using real road routes are generally, but not always, longer than the Euclidean distance. The increased length increases the final Social Burden metric, however, the overall burden percent change ranged between 17% and 52%, which means the impact of realistic routes relies heavily upon the area’s road topology. It was found that rural locations within an area may have larger burden increases than urban areas as more dense road networks allow routes to more closely follow a straight-line path. Additionally, using the most straight forward routing algorithms requires high computational effort for areas with large road networks. While it is believed this process can be made more performant, that task is beyond this scope of work.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2012

Multiple, Ligand-Dependent Routes from the Active Site of Cytochrome P450 2C9

The active site of liver-specific, drug-metabolizing cytochrome P450 (CYP) monooxygenases is deeply buried in the protein and is connected to the protein surface through multiple tunnels, many of which were found open in different CYP crystal structures. It has been shown that different tunnels could serve as ligand passage routes in different CYPs. However, it is not understood whether one CYP uses multiple routes for substrate access and product release and whether these routes depend on ligand properties. From 300 ns of molecular dynamics simulations of CYP2C9, the second most abundant CYP in the human liver we found four main ligand exit routes, the occurrence of each depending on the ligand type and the conformation of the F-G loop, which is likely to be affected by the CYP-membrane interaction. A non-helical F-G loop favored exit towards the putative membrane-embedded region. Important protein features that direct ligand exit include aromatic residues that divide the active site and whose motions control access to two pathways. The ligands interacted with positively charged residues on the protein surface through hydrogen bonds that appear to select for acidic substrates. The observation of multiple, ligand-dependent routes in a CYP aids understanding of how CYP mutations affect drug metabolism and provides new possibilities for CYP inhibition.

Environmental Molecular Sciences Laboratory↗
DOE OSTI2024

Enhancing Acute Migraine Treatment: Exploring Solid Lipid Nanoparticles and Nanostructured Lipid Carriers for the Nose-to-Brain Route

Migraine has a high prevalence worldwide and is one of the main disabling neurological diseases in individuals under the age of 50. In general, treatment includes the use of oral analgesics or non-steroidal anti-inflammatory drugs (NSAIDs) for mild attacks, and, for moderate or severe attacks, triptans or 5-HT1B/1D receptor agonists. However, the administration of antimigraine drugs in conventional oral pharmaceutical dosage forms is a challenge, since many molecules have difficulty crossing the blood-brain barrier (BBB) to reach the brain, which leads to bioavailability problems. Efforts have been made to find alternative delivery systems and/or routes for antimigraine drugs. In vivo studies have shown that it is possible to administer drugs directly into the brain via the intranasal (IN) or the nose-to-brain route, thus avoiding the need for the molecules to cross the BBB. In this field, the use of lipid nanoparticles, in particular solid lipid nanoparticles (SLN) and nanostructured lipid carriers (NLC), has shown promising results, since they have several advantages for drugs administered via the IN route, including increased absorption and reduced enzymatic degradation, improving bioavailability. Furthermore, SLN and NLC are capable of co-encapsulating drugs, promoting their simultaneous delivery to the site of therapeutic action, which can be a promising approach for the acute migraine treatment. This review highlights the potential of using SLN and NLC to improve the treatment of acute migraine via the nose-to-brain route. First sections describe the pathophysiology and the currently available pharmacological treatment for acute migraine, followed by an outline of the mechanisms underlying the nose-to-brain route. Afterwards, the main features of SLN and NLC and the most recent in vivo studies investigating the use of these nanoparticles for the treatment of acute migraine are presented.

Torres, Joana (ORCID:0000000327276229)↗
NASA NTRS1987

Automatic routing module

Automatic Routing Module (ARM) is a tool to partially automate Air Launched Cruise Missile (ALCM) routing. For any accessible launch point or target pair, ARM creates flyable routes that, within the fidelity of the models, are optimal in terms of threat avoidance, clobber avoidance, and adherence to vehicle and planning constraints. Although highly algorithmic, ARM is an expert system. Because of the heuristics applied, ARM generated routes closely resemble manually generated routes in routine cases. In more complex cases, ARM's ability to accumulate and assess threat danger in three dimensions and trade that danger off with the probability of ground clobber results in the safest path around or through difficult areas. The tools available prior to ARM did not provide the planner with enough information or present it in such a way that ensured he would select the safest path.

Malin, Janice A.↗
NASA NTRS1987

Route planning in a four-dimensional environment

Robots must be able to function in the real world. The real world involves processes and agents that move independently of the actions of the robot, sometimes in an unpredictable manner. A real-time integrated route planning and spatial representation system for planning routes through dynamic domains is presented. The system will find the safest most efficient route through space-time as described by a set of user defined evaluation functions. Because the route planning algorthims is highly parallel and can run on an SIMD machine in O(p) time (p is the length of a path), the system will find real-time paths through unpredictable domains when used in an incremental mode. Spatial representation, an SIMD algorithm for route planning in a dynamic domain, and results from an implementation on a traditional computer architecture are discussed.

Slack, M. G.↗
NASA NTRS1990

Depth-first search approach for fault-tolerant routing in hypercube multicomputers

Using depth-first search, the authors develop and analyze the performance of a routing scheme for hypercube multicomputers in the presence of an arbitrary number of faulty components. They derive an exact expression for the probability of routing messages by way of optimal paths (of length equal to the Hamming distance between the corresponding pair of nodes) from the source node to an obstructed node. The obstructed node is defined as the first node encountered by the message that finds no optimal path to the destination node. It is noted that the probability of routing messages over an optimal path between any two nodes is a special case of the present results and can be obtained by replacing the obstructed node with the destination node. Numerical examples are given to illustrate the results, and they show that, in the presence of component failures, depth-first search routing can route a message to its destination by means of an optimal path with a very high probability.

Chen, Ming-Syan↗
NASA NTRS1992

Optimal routing and buffer allocation for a class of finite capacity queueing systems

The problem of routing jobs to K parallel queues with identical exponential servers and unequal finite buffer capacities is considered. Routing decisions are taken by a controller which has buffering space available to it and may delay routing of a customer to a queue. Using ideas from weak majorization, it is shown that the shorter nonfull queue delayed (SNQD) policy minimizes both the total number of customers in the system at any time and the number of customers that are rejected by that time. The SNQD policy always delays routing decisions as long as all servers are busy. Only when all the buffers at the controller are occupied is a customer routed to the queue with the shortest queue length that is not at capacity. Moreover, it is shown that, if a fixed number of buffers is to be distributed among the K queues, then the optimal allocation scheme is the one in which the difference between the maximum and minimum queue capacities is minimized, i.e., becomes either 0 or 1.

Towsley, Don↗
NASA NTRS1993

Strategic planning for aircraft noise route impact analysis: A three dimensional approach

The strategic routing of aircraft through navigable and controlled airspace to minimize adverse noise impact over sensitive areas is critical in the proper management and planning of the U.S. based airport system. A major objective of this phase of research is to identify, inventory, characterize, and analyze the various environmental, land planning, and regulatory data bases, along with potential three dimensional software and hardware systems that can be potentially applied for an impact assessment of any existing or planned air route. There are eight data bases that have to be assembled and developed in order to develop three dimensional aircraft route impact methodology. These data bases which cover geographical information systems, sound metrics, land use, airspace operational control measures, federal regulations and advisories, census data, and environmental attributes have been examined and aggregated. A three dimensional format is necessary for planning, analyzing space and possible noise impact, and formulating potential resolutions. The need to develop this three dimensional approach is essential due to the finite capacity of airspace for managing and planning a route system, including airport facilities. It appears that these data bases can be integrated effectively into a strategic aircraft noise routing system which should be developed as soon as possible, as part of a proactive plan applied to our FAA controlled navigable airspace for the United States.

Bragdon, C. R.↗
NASA NTRS2004

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the shortest route updates the edges in its path.

Alena, Richard I.↗
NASA NTRS1999

En route Spacing Tool: Efficient Conflict-free Spacing to Flow-Restricted Airspace

This paper describes the Air Traffic Management (ATM) problem within the U.S. of flow-restricted en route airspace, an assessment of its impact on airspace users, and a set of near-term tools and procedures to resolve the problem. The FAA is committed, over the next few years, to deploy the first generation of modem ATM decision support tool (DST) technology under the Free-Flight Phase-1 (FFp1) program. The associated en route tools include the User Request Evaluation Tool (URET) and the Traffic Management Advisor (TMA). URET is an initial conflict probe (ICP) capability that assists controllers with the detection and resolution of conflicts in en route airspace. TMA orchestrates arrivals transitioning into high-density terminal airspace by providing controllers with scheduled times of arrival (STA) and delay feedback advisories to assist with STA conformance. However, these FFPl capabilities do not mitigate the en route Miles-In-Trail (MIT) restrictions that are dynamically applied to mitigate airspace congestion. National statistics indicate that en route facilities (Centers) apply Miles-In-Trail (MIT) restrictions for approximately 5000 hours per month. Based on results from this study, an estimated 45,000 flights are impacted by these restrictions each month. Current-day practices for implementing these restrictions result in additional controller workload and an economic impact of which the fuel penalty alone may approach several hundred dollars per flight. To mitigate much of the impact of these restrictions on users and controller workload, a DST and procedures are presented. The DST is based on a simple derivative of FFP1 technology that is designed to introduce a set of simple tools for flow-rate (spacing) conformance and integrate them with conflict-probe capabilities. The tool and associated algorithms are described based on a concept prototype implemented within the CTAS baseline in 1995. A traffic scenario is used to illustrate the controller's use of the tool, and potential display options are presented for future controller evaluation.

Green, S.↗
NASA NTRS2006

Central East Pacific Flight Routing

With the introduction of the Federal Aviation Administration s Advanced Technology and Oceanic Procedures system at the Oakland Oceanic Center, a level of automation now exists in the oceanic environment to potentially begin accommodating increased user preferred routing requests. This paper presents the results of an initial feasibility assessment which examines the potential benefits of transitioning from the fixed Central East Pacific routes to user preferred routes. As a surrogate for the actual user-provided routing requests, a minimum-travel-time, wind-optimal dynamic programming algorithm was developed and utilized in this paper. After first describing the characteristics (e.g., origin airport, destination airport, vertical distribution and temporal distribution) of the westbound flights utilizing the Central East Pacific routes on Dec. 14-16 and 19-20, the results of both a flight-plan-based simulation and a wind-optimal-based simulation are presented. Whereas the lateral and longitudinal distribution of the aircraft trajectories in these two simulations varied dramatically, the number of simulated first-loss-of-separation events remained relatively constant. One area of concern that was uncovered in this initial analysis was a potential workload issue associated with the redistribution of traffic in the oceanic sectors due to thc prevailing wind patterns.

Grabbe, Shon↗
NASA NTRS2010

Interface Supports Lightweight Subsystem Routing for Flight Applications

A wireless avionics interface exploits the constrained nature of data networks in flight systems to use a lightweight routing method. This simplified routing means that a processor is not required, and the logic can be implemented as an intellectual property (IP) core in a field-programmable gate array (FPGA). The FPGA can be shared with the flight subsystem application. In addition, the router is aware of redundant subsystems, and can be configured to provide hot standby support as part of the interface. This simplifies implementation of flight applications requiring hot stand - by support. When a valid inbound packet is received from the network, the destination node address is inspected to determine whether the packet is to be processed by this node. Each node has routing tables for the next neighbor node to guide the packet to the destination node. If it is to be processed, the final packet destination is inspected to determine whether the packet is to be forwarded to another node, or routed locally. If the packet is local, it is sent to an Applications Data Interface (ADI), which is attached to a local flight application. Under this scheme, an interface can support many applications in a subsystem supporting a high level of subsystem integration. If the packet is to be forwarded to another node, it is sent to the outbound packet router. The outbound packet router receives packets from an ADI or a packet to be forwarded. It then uses a lookup table to determine the next destination for the packet. Upon detecting a remote subsystem failure, the routing table can be updated to autonomously bypass the failed subsystem.

Lux, James P.↗
NASA NTRS2010

Design and Evaluation of a Dynamic Programming Flight Routing Algorithm Using the Convective Weather Avoidance Model

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.

Ng, Hok K.↗
NASA NTRS2012

Near real-time traffic routing

A near real-time physical transportation network routing system comprising: a traffic simulation computing grid and a dynamic traffic routing service computing grid. The traffic simulator produces traffic network travel time predictions for a physical transportation network using a traffic simulation model and common input data. The physical transportation network is divided into a multiple sections. Each section has a primary zone and a buffer zone. The traffic simulation computing grid includes multiple of traffic simulation computing nodes. The common input data includes static network characteristics, an origin-destination data table, dynamic traffic information data and historical traffic data. The dynamic traffic routing service computing grid includes multiple dynamic traffic routing computing nodes and generates traffic route(s) using the traffic network travel time predictions.

Yang, Chaowei↗