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 163 records · Page 9

Transfissural Route Used for Preoperative Localization of Small Pulmonary Lesions with a Short Hook Wire and Suture System

PurposeWe retrospectively evaluated the results of the transfissural route for preoperative localization with a short hook wire and suture system for video-assisted thoracoscopic surgery (VATS).MethodsEleven patients with 11 tumors underwent CT-guided transfissural placement of a hook wire before VATS. This route was selected for all patients, because the distance between the tumor and interlobar fissure was much shorter than the required distance traversed using the conventional approach. Complications were evaluated using the National Cancer Institute Common Terminology Criteria for Adverse Events Version 4.0.ResultsThe hook wire was successfully placed using the transfissural route in all but one case. Of these ten successful placements, two tumors needed a second puncture for optimal placement, because the CT scan showed that the first hook wire was not properly placed in the lung. In one patient, we did not attempt replacement after the first placement was incorrect. In ten successful procedures, the mean distance traversed in the parenchyma of the unaffected lung lobe was 27.9 mm. The distance between the pleura and placed hook wire was significantly shorter than the estimated distance between the pleura and hook wire using the conventional route (mean 16.3 vs. 40.9 mm; P = 0.0002). Grade 1 adverse events occurred (11 pneumothoraxes and 4 pulmonary hemorrhages). No grade 2 or higher adverse event was observed.ConclusionsThe transfissural route used for preoperative localization before VATS is useful for selected patients because this route may allow for more limited lung parenchyma resection.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Synthesis of graphene platelets by chemical and electrochemical route

Graphical abstract: A schematic showing the overall reduction process of graphite to reduced graphene platelets by chemical and electrochemical route. - Highlights: • Graphene was prepared by diverse routes viz. chemical and electrochemical methods. • NaBH{sub 4} was effective for removing oxygen functional groups from graphene oxide. • Sodium borohydride reduced graphene oxide (SRGO) showed high specific capacitance. • Electrochemical rendered a cheap route for production of graphene in powder form. - Abstract: Graphene platelets were synthesized from graphene oxide by chemical and electrochemical route. Under the chemical method, sodium borohydride and hydrazine chloride were used as reductants to produce graphene. In this paper, a novel and cost effective electrochemical method, which can simplify the process of reduction on a larger scale, is demonstrated. The electrochemical method proposed in this paper produces graphene in powder form with good yield. The atomic force microscopic images confirmed that the graphene samples prepared by all the routes have multilayers of graphene. The electrochemical process provided a new route to make relatively larger area graphene sheets, which will have interest for further patterning applications. Attempt was made to quantify the quantum of reduction using cyclic voltammetry and choronopotentiometry techniques on reduced graphene samples. As a measure in reading the specific capacitance values, a maximum specific capacitance value of 265.3 F/g was obtained in sodium borohydride reduced graphene oxide.

36 MATERIALS SCIENCE↗

Improving River Routing Using a Differentiable Muskingum‐Cunge Model and Physics‐Informed Machine Learning

Recently, rainfall-runoff simulations in small headwater basins have been improved by methodological advances such as deep neural networks (NNs) and hybrid physics-NN models—particularly, a genre called differentiable modeling that intermingles NNs with physics to learn relationships between variables. However, hydrologic routing simulations, necessary for simulating floods in stem rivers downstream of large heterogeneous basins, had not yet benefited from these advances and it was unclear if the routing process could be improved via coupled NNs. We present a novel differentiable routing method (δMC-Juniata-hydroDL2) that mimics the classical Muskingum-Cunge routing model over a river network but embeds an NN to infer parameterizations for Manning's roughness (n) and channel geometries from raw reach-scale attributes like catchment areas and sinuosity. The NN was trained solely on downstream hydrographs. Synthetic experiments show that while the channel geometry parameter was unidentifiable, n can be identified with moderate precision. With real-world data, the trained differentiable routing model produced more accurate long-term routing results for both the training gage and untrained inner gages for larger subbasins (>2,000 km2) than either a machine learning model assuming homogeneity, or simply using the sum of runoff from subbasins. The n parameterization trained on short periods gave high performance in other periods, despite significant errors in runoff inputs. The learned n pattern was consistent with literature expectations, demonstrating the framework's potential for knowledge discovery, but the absolute values can vary depending on training periods. The trained n parameterization can be coupled with traditional models to improve national-scale hydrologic flood simulations.

54 ENVIRONMENTAL SCIENCES↗

Effect of process route on powder three-dimensional-printing of metal powders

The purpose of this study is to investigate the effect of two unique processing routes (solvent jetting (SJ) and binder jetting (BJ)), on the green density of printed stainless steel 316L (SS316L) and Nickel (Ni) powders. In the SJ processing route, a solvent is jetted unto the powder/binder mixture to selectively activate the binder, layer by layer. In the BJ processing route, a solution of the binder mixture is jetted onto the powder bed to selectively bind powder particles. The effects of printing parameters such as layer height, roller speed, shaker speed and nozzle temperature on the green density of printed components are investigated and compared for both processing routes. Results show that layer height and nozzle temperature affect the relative density of the printed compact for both processing routes. Slightly higher relative densities were achieved via the SJ route, with the overall highest relative density being 42.7% at 100 µ m layer height and 70% nozzle temperature for the SS316L components and 43.7% at 150 µ m layer height and 90% nozzle temperature for the Ni components, respectively. Results also show an increase in the final sintered relative density with an increase in green (printed) relative density of the solvent jetted SS316L components, with the highest relative density being 87.2%. The paper studies the influence of printing parameters on the green density of printed SS316L and Ni samples in an unprecedented effort to provide a comparative understanding of the process-property relationships in BJ and SJ of SS316L and Ni components to the additive manufacturing research community.

Engineering↗

PC-RPL: Joint Control of Routing Topology and Transmission Power in Real Low-Power and Lossy Networks

We present PC-RPL , a transmission power-controlled IPv6 routing protocol for low-power and lossy wireless networks that significantly improves the end-to-end packet delivery performance under heavy traffic compared to the standard RPL. We show through actual design, implementation, and experiments that a multihop wireless network can achieve better throughput and routing stability when transmission power and routing topology are “jointly and adaptively” controlled. Our experiments show that the predominant “fixed and uniform” transmission power strategy with “link quality and hop distance”–based routing topology construction (i.e., RPL) loses significant bandwidth due to hidden terminal and load imbalance problems. We design an adaptive and distributed control mechanism for transmission power and routing topology, named PC-RPL , on top of the standard RPL routing protocol for hidden terminal mitigation and load balancing. We implement PC-RPL on real embedded devices and evaluate its performance on a 49-node multihop testbed. PC-RPL reduces total end-to-end packet losses by approximately sevenfold without increasing hop distance compared to RPL with the highest transmission power, resulting in 17% improvement in aggregate bandwidth and 64% improvement for the worst-case node by successfully alleviating both hidden terminal and load imbalance problems.

Computer Science↗

Factors Affecting Route Selection and Survival of Steelhead Kelts at Snake River Dams in 2012 and 2013

In 2012 and 2013, Pacific Northwest National Laboratory (PNNL) conducted a study that summarized the passage route proportions and route-specific survival rates of steelhead kelts that passed through Federal Columbia River Power System (FCRPS) dams. To accomplish this, a total of 811 steelhead kelts were tagged with Juvenile Salmon Acoustic Telemetry System (JSATS) transmitters. Acoustic receivers, both autonomous and cabled, were deployed throughout the FCRPS to monitor the downstream movements of tagged kelts. Kelts were also tagged with passive integrated transponder tags to monitor passage through juvenile bypass systems (JBS) and detect returning fish. The current study evaluated data collected in 2012 and 2013 to identify environmental, temporal, operational, individual, and behavioral variables that were related to forebay residence time, route of passage, and survival of steelhead kelts at FCRPS dams on the Snake River. Multiple approaches, including 3-D tracking, bivariate and multivariable regression modeling, and decision tree analyses were used to identify the environmental, temporal, operational, individual, and behavioral variables that had the greatest effect on forebay residence time, route of passage, and route-specific and overall dam passage survival probabilities for tagged kelts at Lower Granite (LGR), Little Goose (LGS), and Lower Monumental (LMN) dams. In general, kelt behavior and discharge appeared to work independently to affect forebay residence times. Kelt behavior, primarily approach location, migration depth, and “searching” activities in the forebay, was found to have the greatest influence on their route of passage. The condition of kelts was the single most important factor affecting their survival. The information gathered in this study may be used by dam operators and fisheries managers to identify potential management actions to improve in-river survival of kelts or collection methods for kelt reconditioning programs to aid the recovery of Snake River steelhead populations.

13 HYDRO ENERGY↗

Adaptive fault-tolerant routing in hypercube multicomputers

A connected hypercube with faulty links and/or nodes is called an injured hypercube. To enable any non-faulty node to communicate with any other non-faulty node, information on component failures has to be made available to non-faulty nodes so as to route messages around the faulty components. A distributed adaptive fault tolerant routing scheme is proposed in which each node is required to know only the condition of its own links. This scheme is shown to be capable of routing messages successfully as long as the number of faulty components is less than n (the dimension of the hypercube), and to route messages via shortest paths with a rather high probability. A second routing scheme based on depth-first search is proposed which works in the presence of an arbitrary number of faulty components; however, the paths chosen by this may not always be the shortest. To guarantee shortest paths, every mode must be given information beyond that on its own links; the additional information to be kept at each node for shortest-path routing is determined. Several examples are given to illustrate the results.

Chen, Ming-Syan↗

Annoyance caused by aircraft en route noise

A laboratory experiment was conducted to quantify the annoyance response of people on the ground to enroute noise generated by aircraft at cruise conditions. The en route noises were ground level recordings of eight advanced turboprop aircraft flyovers and six conventional turbofan flyovers. The eight advanced turboprop enroute noises represented the NASA Propfan Test Assessment aircraft operating at different combinations of altitude, aircraft Mach number, and propeller tip speed. The conventional turbofan en route noises represented six different commercial airliners. The overall durations of the en route noises varied from approximately 40 to 160 sec. In the experiment, 32 subjects judged the annoyance of the en route noises as well as recordings of the takeoff and landing noises of each of 5 conventional turboprop and 5 conventional turbofan aircraft. Each of the noises was presented at three sound pressure levels to the subjects in an anechoic listening room. Analysis of the judgments found small differences in annoyance between three combinations of aircraft type and operation. Current tone and corrections did not significantly improve en route annoyance prediction. The optimum duration-correction magnitude for en route noise was approximately 1 dB per doubling of effective duration.

Mccurdy, David A.↗

Isomorphic routing on a toroidal mesh

We study a routing problem that arises on SIMD parallel architectures whose communication network forms a toroidal mesh. We assume there exists a set of k message descriptors (xi, yi), where (xi, yi) indicates that the ith message's recipient is offset from its sender by xi hops in one mesh dimension, and yi hops in the other. Every processor has k messages to send, and all processors use the same set of message routing descriptors. The SIMD constraint implies that at any routing step, every processor is actively routing messages with the same descriptors as any other processor. We call this isomorphic routing. Our objective is to find the isomorphic routing schedule with least makespan. We consider a number of variations on the problem, yielding complexity results from O(k) to NP-complete. Most of our results follow after we transform the problem into a scheduling problem, where it is related to other well-known scheduling problems.

Mao, Weizhen↗

Evaluating GCM land surface hydrology parameterizations by computing river discharges using a runoff routing model: Application to the Mississippi basin

To relate general circulation model (GCM) hydrologic output to readily available river hydrographic data, a runoff routing scheme that routes gridded runoffs through regional- or continental-scale river drainage basins is developed. By following the basin overland flow paths, the routing model generates river discharge hydrographs that can be compared to observed river discharges, thus allowing an analysis of the GCM representation of monthly, seasonal, and annual water balances over large regions. The runoff routing model consists of two linear reservoirs, a surface reservoir and a groundwater reservoir, which store and transport water. The water transport mechanisms operating within these two reservoirs are differentiated by their time scales; the groundwater reservoir transports water much more slowly than the surface reservior. The groundwater reservior feeds the corresponding surface store, and the surface stores are connected via the river network. The routing model is implemented over the Global Energy and Water Cycle Experiment (GEWEX) Continental-Scale International Project Mississippi River basin on a rectangular grid of 2 deg X 2.5 deg. Two land surface hydrology parameterizations provide the gridded runoff data required to run the runoff routing scheme: the variable infiltration capacity model, and the soil moisture component of the simple biosphere model. These parameterizations are driven with 4 deg X 5 deg gridded climatological potential evapotranspiration and 1979 First Global Atmospheric Research Program (GARP) Global Experiment precipitation. These investigations have quantified the importance of physically realistic soil moisture holding capacities, evaporation parameters, and runoff mechanisms in land surface hydrology formulations.

Liston, G. E.↗

Route Monopolie and Optimal Nonlinear Pricing

To cope with air traffic growth and congested airports, two solutions are apparent on the supply side: 1) use larger aircraft in the hub and spoke system; or 2) develop new routes through secondary airports. An enlarged route system through secondary airports may increase the proportion of route monopolies in the air transport market.The monopoly optimal non linear pricing policy is well known in the case of one dimension (one instrument, one characteristic) but not in the case of several dimensions. This paper explores the robustness of the one dimensional screening model with respect to increasing the number of instruments and the number of characteristics. The objective of this paper is then to link and fill the gap in both literatures. One of the merits of the screening model has been to show that a great varieD" of economic questions (non linear pricing, product line choice, auction design, income taxation, regulation...) could be handled within the same framework.VCe study a case of non linear pricing (2 instruments (2 routes on which the airline pro_ddes customers with services), 2 characteristics (demand of services on these routes) and two values per characteristic (low and high demand of services on these routes)) and we show that none of the conclusions of the one dimensional analysis remain valid. In particular, upward incentive compatibility constraint may be binding at the optimum. As a consequence, they may be distortion at the top of the distribution. In addition to this, we show that the optimal solution often requires a kind of form of bundling, we explain explicitly distortions and show that it is sometimes optimal for the monopolist to only produce one good (instead of two) or to exclude some buyers from the market. Actually, this means that the monopolist cannot fully apply his monopoly power and is better off selling both goods independently.We then define all the possible solutions in the case of a quadratic cost function for a uniform distribution of agent types and explain the implications for airlines in terms of service differentiation.

Tournut, Jacques↗

Problem Definition and Solution Concept for En Route Constrained Airspace Problems

NASA's AATT Program is investigating potential ground-based decision support tool (DST) development for en route controllers and managers. NASA's previous work in en route DST development has focused on Transition airspace, where aircraft are impacted by constraints associated with the transition of aircraft from en route to terminal airspace. This paper investigates the problems associated with aircraft in non-transitional en route airspace, termed Constrained Airspace. A literature search was performed to catalog previously identified constrained airspace problems. The results of this search were investigated with industry representatives to validate these problems were significant in constrained airspace. Three general problem areas were identified. The first problem area involves negative impacts caused by a loss of airspace (e.g., activation of Special Use Airspace (SUA), weather cell formation, and overloaded sectors). The second problem area is the lack of identifying and taking advantage of gained airspace (e.g., SUA deactivation, weather dissipation, and sector loading reductions). The third problem area is unforeseen negative impacts caused by the acceptance of user routing requests (e.g., a route change into an area of congestion that negated the users intended benefit). Based upon the problems identified, an operational concept was developed for a DST to help handle these problems efficiently. The goal is to strategically identify constrained airspace problems and to provide functionality to support ARTCC TMUs in resolving the identified impacts. The capability lends itself well to TMU and Airline Operations Center (AOC) collaboration.

Green, Steven↗

Direct-To Tool for En Route Controllers

This paper describes a new automation tool for en route air traffic controllers, called the Direct-To Tool. The Tool is designed to reduce the time of flight and fuel consumption for aircraft flying in en route airspace. It provides each controller with the identities of aircraft in his/her sector, which can reduce their time en route by bypassing dog-legged route segments and flying "direct to" a waypoint closer to the destination airport. The Tool uses its build-in conflict probing capability to determine if the improved route is free of conflicts with other aircraft. The Tool's graphical computer interface enables the controller to enter a direct-to clearance by a simple point and click action. Because of its low workload and convenience, this method is strongly favored by controllers The Tool has been running since January with live radar data received at NASA from the Fort Worth Air Route Traffic Control Center. For aircraft operating in the Fort Worth Center, the Tool has the potential to save in excess of 500,000 in-flight minutes per year. A provisional patent application for this Tool has been filed. A field task in planned for the last quarter of this year.

Erzberger, Heinz↗

Space Act Agreement Maker (SAAM) With Electronic Routing System (ERouter) Developed

Members of the Commercial Technology Office at the NASA Glenn Research Center have developed an exciting new tool that greatly reduces the lead time in creating and routing Space Act Agreements. The Space Act Agreement Maker (SAAM) is an e-government Web-based system that automates the initial drafting of Space Act Agreements by technical and program personnel. SAAM also is used for editing and will be used later for maintaining electronic copies of all Space Act Agreements. During the initial drafting, the software prompts NASA personnel proposing an agreement to answer questions regarding the agreement. On the basis of the answers, the software selects from a matrix of NASA standard clauses to produce a first draft of the agreement. The draft agreement and information submitted by the NASA personnel are electronically routed to Glenn s Commercial Technology Office for review and, where necessary, editing. The final version of the agreement, along with any supporting documentation, is then routed for electronic concurrence/approval to the necessary internal review participants using the electronic routing system (e-router). SAAM was developed cooperatively by Glenn s Commercial Technology Office and Glenn s Office of Chief Counsel. Currently, SAAM is being evaluated by the NASA Headquarters General Counsel Office for use at all NASA centers. This system allows for the effective processing of Space Act Agreements for NASA s internal and external customers. Document control is maintained by a database. With SAAM s electronic routing, review times can be reduced significantly, allowing Glenn to more rapidly establish partnerships with industry. Prior to the creation of SAAM, it took several hours to draft a Space Act Agreement. With SAAM in place, the document can be written in about 30 min. Using the e-router also saves time in determining where the agreement is in the routing process. The document can be tracked easily, and delays can be avoided. Important research with industry partners can commence quickly after preliminary discussions have been held. The development of these products is in line with the expanding e-government initiative that is part of the Presidential Management Agenda. By using this product, NASA researchers can secure greater support from industry and academia partners. The Space Act Agreement Maker has been very well received at NASA Headquarters and at some of the other NASA centers as well. We anticipate that the NASA Ames Research Center will have the system in place very soon, and that some of the other centers will use SAAM in the near future. The General Counsel s office at NASA Headquarters has encouraged the Glenn team to develop a similar system for processing patent licenses. Find out more about Glenn's Technology Transfer & Partnership Office http://technology.grc.nasa.gov/.

Stauber, Laurel J.↗

Masked Proportional Routing

Masked proportional routing is an improved procedure for choosing links between adjacent nodes of a network for the purpose of transporting an entity from a source node ("A") to a destination node ("B"). The entity could be, for example, a physical object to be shipped, in which case the nodes would represent waypoints and the links would represent roads or other paths between waypoints. For another example, the entity could be a message or packet of data to be transmitted from A to B, in which case the nodes could be computer-controlled switching stations and the links could be communication channels between the stations. In yet another example, an entity could represent a workpiece while links and nodes could represent, respectively, manufacturing processes and stages in the progress of the workpiece towards a finished product. More generally, the nodes could represent states of an entity and the links could represent allowed transitions of the entity. The purpose of masked proportional routing and of related prior routing procedures is to schedule transitions of entities from their initial states ("A") to their final states ("B") in such a manner as to minimize a cost or to attain some other measure of optimality or efficiency. Masked proportional routing follows a distributed (in the sense of decentralized) approach to probabilistically or deterministically choosing the links. It was developed to satisfy a need for a routing procedure that 1. Does not always choose the same link(s), even for two instances characterized by identical estimated values of associated cost functions; 2. Enables a graceful transition from one set of links to another set of links as the circumstances of operation of the network change over time; 3. Is preferably amenable to separate optimization of different portions of the network; 4. Is preferably usable in a network in which some of the routing decisions are made by one or more other procedure(s); 5. Preferably does not cause an entity to visit the same node twice; and 6. Preferably can be modified so that separate entities moving from A to B do not arrive out of order.

Wolpert, David↗

Analysis of Convective Weather Impact on Pre-Departure Routing of Flights from Fort Worth Center to New York Center

In response to severe weather conditions, Traffic Managers specify flow constraints and reroutes to route air traffic around affected regions of airspace. Providing analysis and recommendations of available reroute options and associated airspace capacities would assist Traffic Managers in making more efficient decisions in response to convective weather. These recommendations can be developed by examining historical data to determine which previous reroute options were used in similar weather and traffic conditions. This paper describes the initial steps and methodology used towards this goal. The focus of this work is flights departing from Fort Worth Center destined for New York Center. Dominant routing structures used in the absence of convective weather are identified. A method to extract relevant features from the large volume of weather data available to quantify the impact of convective weather on this routing structure over a given time range is presented. Finally, a method of estimating flow rate capacity along commonly used routes during convective weather events is described. Results show that the flow rates drop exponentially as a function of the values of the proposed feature and that convective weather on the final third of the route was found to have a greater impact on the flow rate restriction than other portions of the route.

traffic flow management↗

The Critical Role of the Routing Scheme in Simulating Peak River Discharge in Global Hydrological Models

Global hydrological models (GHMs) have been applied to assess global flood hazards, but their capacity to capture the timing and amplitude of peak river discharge which is crucial in flood simulations has traditionally not been the focus of examination. Here we evaluate to what degree the choice of river routing scheme affects simulations of peak discharge and may help to provide better agreement with observations. To this end we use runoff and discharge simulations of nine GHMs forced by observational climate data (1971-2010) within the ISIMIP2a (Inter-Sectoral Impact Model Intercomparison Project phase 2a) project. The runoff simulations were used as input for the global river routing model CaMa-Flood (Catchment-based Macro-scale Floodplain). The simulated daily discharge was compared to the discharge generated by each GHM using its native river routing scheme. For each GHM both versions of simulated discharge were compared to monthly and daily discharge observations from 1701 GRDC (Global Runoff Data Centre) stations as a benchmark. CaMa-Flood routing shows a general reduction of peak river discharge and a delay of about two to three weeks in its occurrence, likely induced by the buffering capacity of floodplain reservoirs. For a majority of river basins, discharge produced by CaMa-Flood resulted in a better agreement with observations. In particular, maximum daily discharge was adjusted, with a multi-model averaged reduction in bias over about two-thirds of the analysed basin area. The increase in agreement was obtained in both managed and near-natural basins. Overall, this study demonstrates the importance of routing scheme choice in peak discharge simulation, where CaMa-Flood routing accounts for floodplain storage and backwater effects that are not represented in most GHMs. Our study provides important hints that an explicit parameterisation of these processes may be essential in future impact studies.

peak river discharge↗

Exploration of Near-Term Potential Routes and Procedures for Urban Air Mobility

This paper investigates routes and procedures for Urban Air Mobility (UAM), which aims to reduce congestion on the roads and highways by offering air taxi as an alternative to driving. The routes and procedures being explored are current-day helicopter routes along with different communication procedures that are available as tools in the near-term. Three different levels of UAM traffic were evaluated in the Dallas Fort Worth (DFW) area. The current-day helicopter routes were modified to separate them from traditional traffic, and a Letter of Agreement (LOA) was introduced in some of the conditions to reduce verbal communications. We found that modifications to the routes and introduction of LOA helped increase the number of UAM flights that the controllers reported they could manage and reduce their communications, which made controller self-reported workload more operationally acceptable. However, the self-reported workload experienced by busy airport towers cannot be effectively managed via the usage of LOA and modified helicopter routes, suggesting there is an opportunity to re-think roles and responsibilities of the UAM system participants.

Verma, Savita A.↗