Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network solutions”

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 1,279 records · Page 71

POINT: Partially Observable Imitation Network for Traffic Signal Control

Smart traffic signals bring together transportation infrastructure and advance technologies to improve the mobility and efficiency of urban transportation network. Adaptive traffic signal control studies can be categorized into modeling-based approaches and learning-based approaches. In order to take advantages of these two systems, this study developed an offline-online combined Partial Observable Imitation Network for Traffic signal control (POINT). In the offline system, the traffic signal timing optimization problem was formulated as a Mixed Integer Nonlinear Programming (MINLP) given complete traffic information, i.e., second-by-second speeds and locations of all vehicles. Furthermore, the objective of MINLP is to minimize total travel delays considering individual vehicle trajectories under Connected Vehicle (CV) environment. The calculated optimal solutions under various traffic conditions were considered as the ”expert” decisions. In the online system, an imitation neural network model was developed to learn the ”expert” signal plans generated from offline system. Given partial observable traffic conditions in real time, e.g., the aggregate-level of traffic volume, the POINT model can compute the signal timing parameters in the online system. The numerical results demonstrated that the proposed method outperformed other state-of-the-art signal control method under high and unbalanced traffic demand levels in terms of reducing travel delays and queue length.

33 ADVANCED PROPULSION SYSTEMS↗

Risk-based Multiobjective Optimization Model for Bridge Maintenance Planning

Determining the optimal maintenance plan is essential for successful bridge management. The optimization objectives are defined in the forms of minimizing life-cycle cost and maximizing performance indicators. Previous bridge maintenance models assumed the process of bridge deterioration and the estimate of maintenance cost are deterministic, i.e., known with certainty. This assumption, however, is invalid especially with estimates over a long time horizon of bridge life. In this study, we consider the risks associated with bridge deterioration and maintenance cost in determining the optimal maintenance plan. The decisions variables include the strategic choice of essential maintenance (such as silane treatment and cathodic protection), and the intervals between periodic maintenance. A epsilon-constrained Particle Swarm Optimization algorithm is used to approximate the tradeoff between life-cycle cost and performance indicators. During stochastic search for optimal solutions, Monte-Carlo simulation is used to evaluate the impact of risks on the objective values, at an acceptance level of reliability. The proposed model can facilitate decision makers to select the compromised maintenance plan with a group of alternative choices, each of which leads to a different level of performance and life-cycle cost. A numerical example is used to illustrate the proposed model.

97 MATHEMATICS AND COMPUTING↗

Machine Learning-Based Prediction of Distribution Network Voltage and Sensor Allocation

Increasing penetration levels of fast-varying energy resources might negatively affect power system operation. At the same time, sensor deployment throughout distribution networks improves system awareness and enables the development of new and advanced voltage control solutions. Such control techniques rely on accurate prediction in anticipation of voltage violation scenarios. This paper analyzes various approaches to voltage prediction in a distribution system, and it is shown that combining multiple techniques into a single regressor improves its predictive power. Moreover, a two-step regressor is proposed in which initial predictions based on a global regressor are refined by local regressors; in this case, prediction errors decrease significantly. Additionally, a clustering approach is employed to perform sensor allocation so that only the most influential buses are selected for monitoring without diminishing prediction accuracy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Superconducting Hyperdimensional Associative Memory Circuit for Scalable Machine Learning

Here we propose a generalized architecture for the first rapid-single-flux-quantum (RSFQ) associative memory circuit. The circuit employs hyperdimensional computing (HDC), a machine learning (ML) paradigm utilizing vectors with dimensionality in the thousands to represent information. HDC designs have small memory footprints, simple computations, and simple training algorithms compared to superconducting neural network accelerators (SNNAs), making them a better option for scalable SFQ machine learning (ML) solutions. The proposed superconducting HDC (SHDC) circuit uses entirely on-chip RSFQ memory which is tightly integrated with logic, operates at 33.3 GHz, is applicable to general ML tasks, and is manufacturable at practically useful scales given current SFQ fabrication limits. Tailored to a language recognition task, SHDC consists of ~ 2-20 M Josephson junctions (JJs) and consumes up to three times less power than an analogous CMOS HDC circuit while achieving 78-84% higher throughput. SHDC is capable of outperforming the state of the art RSFQ SNNA, SuperNPU, by 48-99% for all benchmark NN architectures tested while occupying up to 90% less area and consuming up to nine times less power. To the best of the authors' knowledge, SHDC is currently the only superconducting ML approach feasible at practically useful scales for real-world ML tasks and capable of online learning.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Joint Fleet Sizing and Charging System Planning for Autonomous Electric Vehicles

This paper studies the joint fleet sizing and charging system planning problem for a company operating a fleet of autonomous electric vehicles (AEVs) for passenger and goods transportation. Most of the relevant published papers focus on intracity scenarios and adopt heuristic approaches, e.g., agent based simulation, which do not guarantee optimality. In contrast, we propose a mixed integer linear programming model for intercity scenarios. This model incorporates comprehensive considerations of 1) limited AEV driving range; 2) optimal AEV routing and relocating operations; 3) time-varying origin-destination transport demands; and 4) differentiated operation cost structure of passenger and goods transportation. The proposed model can be computational expensive when the scale of the transportation network is large. We then exploit the structure of this program to expedite its solution. Numerical experiments are conducted to validate the proposed method. Our experimental results show that AEVs in passenger and goods transportation have remarkable planning and operation differences. We also demonstrate that intelligent routing and relocating operations, charging system and vehicle parameters, e.g., charging power, battery capacity, driving speed etc., can significantly affect the economic efficiency and the planning results of an AEV fleet.

33 ADVANCED PROPULSION SYSTEMS↗

Large-Scale Continuous Subgraph Queries on Streams

Graph pattern matching involves finding exact or approximate matches for a query subgraph in a larger graph. It has been studied extensively and has strong applications in domains such as computer vision, computational biology, social networks, security and finance. The problem of exact graph pattern matching is often described in terms of subgraph isomorphism which is NP-complete. The exponential growth in streaming data from online social networks, news and video streams and the continual need for situational awareness motivates a solution for finding patterns in streaming updates. This is also the prime driver for the real-time analytics market. Development of incremental algorithms for graph pattern matching on streaming inputs to a continually evolving graph is a nascent area of research. Some of the challenges associated with this problem are the same as found in continuous query (CQ) evaluation on streaming databases. This paper reviews some of the representative work from the exhaustively researched field of CQ systems and identifies important semantics, constraints and architectural features that are also appropriate for HPC systems performing real-time graph analytics. For each of these features we present a brief discussion of the challenge encountered in the database realm, the approach to the solution and state their relevance in a high-performance, streaming graph processing framework.

99 GENERAL AND MISCELLANEOUS↗

HBMax: Optimizing Memory Efficiency for Parallel Influence Maximization on Multicore Architectures

The goal of influence maximization is to select k most-influential vertices or seeds in a network, where influence is defined by a given diffusion process. The problem has a number of important applications such as viral marketing, information spread, and epidemic control. Although computing optimal seed set is NP-Hard, due to the submodular nature of the problem efficient approximation algorithms exist. However, even state-of-the-art parallel implementations are limited by a sampling step that incurs large memory footprints. This in turn limits the problem size reach and approximation quality. In this work, we study the memory footprint of the sampling process collecting reverse reachability information in the IMM algorithm over large real-world social networks. We present an adaptive and memory-efficient optimization approach for a state-of-the-art multi-threaded parallel influence maximization algorithm. Our approach,HuffMax, uses a portion of the reverse reachable (RR) sets collected by the algorithm to learn the characteristics of the graph. Then, it compresses the intermediate reverse reachability information with Huffman coding, and queries directly on the compressed data to preserve the memory savings obtained through compression. We also propose an efficient sampling strategy based on the distribution of RR sets, which can further reduce the computation time for typical social networks with long-tail distributions. Considering a NUMA architecture, we scale up our solution on 128-core CPUs and reduce the memory footprint by up to 45.7% with negligible time overhead (or even faster) and without perceivable loss of accuracy.

Chen, Xinyu↗

Preparing Distribution Utilities for the Future - Unlocking Demand-Side Management Potential: A Novel Analytical Framework

The balance of supply and demand in the power systems has traditionally been served solely through generation and network capacity planning and operations. However, with increased requirements for flexibility due to the uptake in variable renewable generation sources such as wind and solar there is a need to increased demand-side flexibility. In addition, there are increased communications and flexibility capabilities emerging on the demand-side from the adoption of advanced metering infrastructures and smart meter deployment and intelligent loads such as smart thermostats and schedulable white goods (e.g. dishwashers and washing machines). Unlocking demand-side flexibility can bring system benefits from peak load reduction bringing about generation capacity and network upgrade deferral, to reducing demand and more efficient utilization of generation and network capacity. Unlocking demand-side flexibility is an evolving process for utilities and solutions must be tailored to each specific customer group. Demand-side management (DSM) is a broad set of tools that can include demand response (both dispatchable and non-dispatchable), energy efficiency and distributed energy resources and demand-side technologies. The National Renewable Energy Laboratory (NREL), in collaboration with BSES Rajdhani Power Ltd. (BRPL) and Deloitte, examined the potential of DSM in BRPL’s service territory, developing detailed information on customer classes and willingness to participate in DSM. The study developed modeling frameworks for load analysis and the analysis tools to assess the potential of time-of-use tariffs in motivating customers to reduce their peak period energy consumption. The study shows that BRPL customers, specifically their domestic customers, are willing to participate in DSM programs and that time-of-use pricing can help BRPL reduce their peak demand and help unlock demand-side flexibility.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Power System Waveform Classification Using Time-Frequency and CNN

Many modern reclosers and circuit breakers have microprocessor relays that record waveforms of system events. In some cases, utilities may record a half-a-dozen event captures for every event. This is thousands of events per year. The industry needs faster, more automated, more conclusive, and easy-to-use systems that can process massive amounts of event recordings without extensive input/support from power system engineers. To address the need for a commercially viable solution that can classify waveform data, energies were directed to develop a universal neural network (NN) structure (deep learning algorithm) that works for a wide variety of system event types. The structure that showed the most promise was one that included the use of spectrograms. The technique has shown positive results in audio engineering, particularly with respect to speech recognition. A waveform signature could be treated as a spoken word like audio waveforms for specific things such as “YES” or “UP”. No two people produce the exact same waveform when speaking each of these words, but audio processing algorithms based on spectrograms and convolutional neural networks (CNN) can still distinguish the word regardless of the speaker. No two circuits produce the exact same waveform for a given event, but the NN can be trained to classify the event type regardless of the circuit or location on the circuit. A Power System Neural Network (PSNN) has been developed to use a CNN to classify events within waveform data for power systems. The waveform is converted to an array of values by way of spectrograms and interpreted as an image. This image is passed into the CNN. The test results on independent simulated test and validation datasets show greater than 99% accuracy. While the results thus far are based on simulated data, the performance of the PSNN is very promising and should work for a wide variety of power system conditions of interest. Ultimately, much of the custom code and tools used today and much of the manual effort expended today may be automated using this PSNN.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A priori examination of reduced chemistry models derived from canonical stirred reactors using three-dimensional direct numerical simulation datasets

Data-driven approaches to construct reduced chemical kinetic models, that rely heavily on thermo-chemical datasets with full chemical kinetics, have been gaining popularity. Datasets from direct numerical simulations (DNS) under three-dimensional (3-D) realistic turbulent flow conditions are desirable but limited to carefully designed parametric conditions due to the computational cost. Constructing datasets from a large ensemble of zero-dimensional stirred reactors like perfectly stirred reactor (PSR) and partially stirred reactor (PaSR) is a computationally efficient solution to consider the turbulence-chemistry interactions and cover a broad range of parametric conditions. In this paper, we derive reduced chemistry models from solutions of a large number of PSR and PaSR reactors using autoencoder (AE) neural networks and principal component analysis (PCA), and conduct a priori examination of the reduced models in three temporally evolving 3-D DNS jet flames featuring local extinction and re-ignition. The results show that the reduced models derived from PaSR datasets, i.e., AE-PaSR and PCA-PaSR, generally show significant improvement over the ones derived from PSR datasets. Among all the reduced models, AE-PaSR shows the best agreement with DNS results on the reconstruction accuracy and the representation of temporally evolving local extinction and re-ignition events.

Zhang, Pei↗

Automatic Échelle Spectrograph Wavelength Calibration

Time-domain astronomy and the increasing number of exoplanet candidates call for reliable, robust, and automatic wavelength calibration. We present an algorithm for wavelength-calibrating échelle spectrographs that uses order-by-order extracted spectra and a list of laboratory wavelengths. Our approach is fully automatic and does not need the pixel locations of certain spectral features with which to anchor the wavelength solution, nor the true order number of each diffraction order. We use spectral features that are duplicated in adjacent orders to establish the scale-invariant component of the wavelength solution. We then match the central wavelengths of spectral features to laboratory wavelengths to establish the scale and higher-order components of the wavelength solution. We demonstrate our method on the four spectrographs of Las Cumbres Observatory’s Network of Robotic Échelle Spectrographs (NRES), on the High Accuracy Radial Velocity Planet Searcher (HARPS) spectrograph, and on synthetic data. We obtain a velocity-equivalent precision of ∼10 m s{sup −1} on NRES. We achieve ∼1 m s{sup −1} on HARPS, which agrees with the precision reported by the HARPS team. On synthetic data, we achieve the velocity precision set by Gaussian centroiding errors. Our algorithm likely holds for a wide range of spectrographs beyond the five presented here. We provide an open-source Python package, xwavecal, which outputs wavelength-calibrated spectra as well as the wavelengths of spectral features.

79 ASTRONOMY AND ASTROPHYSICS↗

Short arc optical survey techniques

The effect of the gravity parameter, mu, the choice and local survey of the fixed origin station, and the choice of initial datum on the results of short arc satellite survey adjustments were investigated using GEOS 1 MOTS optical observations from 13 stations. It is concluded that each of these parameters has an effect on derived network scale on the order of 0.000002 for the nominal variations used. A particular solution using assumed best available values for these parameters is recommended.

Berbert, J. H.↗

Geometric adjustment of the South American satellite densification (PC-1000) network

Reduced normal equations were computed from observation data and combined with reduced normal equations of other satellite networks to provide station coordinates from a single least square adjustment. Terrestrial data, which include base-lines, heights, and survey coordinates, provide the necessary relative position constraints between collocated stations of two satellite networks. Survey information regarding the observation stations is summarized, and constraints used in the solution are given. Geoidal undulations are computed by using the formula and constants shown.

Mueller, I. I.↗

Station coordinates in the standard earth 3 system and radiation-pressure perturbations from ISAGEX camera data

Simultaneous and individual camera observations of GEOS 1, GEOS 2, Pageos, and Midas 4 obtained during the International Satellite Geodesy Experiment are utilized to determine station coordinates. The Smithsonian Astrophysical Observatory Standard Earth III system of coordinates is used to tie the geometrical network to a geocentric system and as a reference for calculating satellite orbits. A solution for coordinates combining geometrical and dynamical methods is obtained, and a comparison between the solutions and terrestrial data is made. The radiation-pressure and earth-albedo perturbations for Pageos are very large, and Pageos' orbits are used to evaluate the analytical treatment of these perturbations. Residual effects, which are probably of interest to aeronomists, remain in the Pageos orbits.

Gaposchkin, E. M.↗

Characteristics procedure for supersonic flows including consideration of viscous contributions to flow rotationality

A characteristics procedure has been developed which includes viscous and conductive transport terms normal to streamlines. By introducing the transport terms as corrections, the equations retain their hyperbolic character. The solutions have been developed using an inverse grid scheme in a streamline-normal network. Inclusion of the transport terms enables tracing of shock waves through the supersonic portion of the boundary layer so that shock reflections are well-located. Excellent agreement is obtained with the results of other characteristics procedures and with the experimental pressure distributions for the waisted body of Winter, Smith and Rotta.

Anderson, B. H.↗

Electronic neural network for dynamic resource allocation

A VLSI implementable neural network architecture for dynamic assignment is presented. The resource allocation problems involve assigning members of one set (e.g. resources) to those of another (e.g. consumers) such that the global 'cost' of the associations is minimized. The network consists of a matrix of sigmoidal processing elements (neurons), where the rows of the matrix represent resources and columns represent consumers. Unlike previous neural implementations, however, association costs are applied directly to the neurons, reducing connectivity of the network to VLSI-compatible 0 (number of neurons). Each row (and column) has an additional neuron associated with it to independently oversee activations of all the neurons in each row (and each column), providing a programmable 'k-winner-take-all' function. This function simultaneously enforces blocking (excitatory/inhibitory) constraints during convergence to control the number of active elements in each row and column within desired boundary conditions. Simulations show that the network, when implemented in fully parallel VLSI hardware, offers optimal (or near-optimal) solutions within only a fraction of a millisecond, for problems up to 128 resources and 128 consumers, orders of magnitude faster than conventional computing or heuristic search methods.

Thakoor, A. P.↗

Grand challenges in mass storage: A systems integrators perspective

Within today's much ballyhooed supercomputing environment, with its CFLOPS of CPU power, and Gigabit networks, there exists a major roadblock to computing success; that of Mass Storage. The solution to this mass storage problem is considered to be one of the 'Grand Challenges' facing the computer industry today, as well as long into the future. It has become obvious to us, as well as many others in the industry, that there is no clear single solution in sight. The Systems Integrator today is faced with a myriad of quandaries in approaching this challenge. He must first be innovative in approach, second choose hardware solutions that are volumetric efficient; high in signal bandwidth; available from multiple sources; competitively priced, and have forward growth extendibility. In addition he must also comply with a variety of mandated, and often conflicting software standards (GOSIP, POSIX, IEEE, MSRM 4.0, and others), and finally he must deliver a systems solution with the 'most bang for the buck' in terms of cost vs. performance factors. These quandaries challenge the Systems Integrator to 'push the envelope' in terms of his or her ingenuity and innovation on an almost daily basis. This dynamic is explored further, and an attempt to acquaint the audience with rational approaches to this 'Grand Challenge' is made.

Lee, Richard R.↗

Global Plate Velocities from the Global Positioning System

We have analyzed 204 days of Global Positioning System (GPS) data from the global GPS network spanning January 1991 through March 1996. On the basis of these GPS coordinate solutions, we have estimated velocities for 38 sites, mostly located on the interiors of the Africa, Antarctica, Australia, Eurasia, Nazca, North America, Pacific, and South America plates. The uncertainties of the horizontal velocity components range from 1.2 to 5.0 mm/yr. With the exception of sites on the Pacific and Nazca plates, the GPS velocities agree with absolute plate model predictions within 95% confidence. For most of the sites in North America, Antarctica, and Eurasia, the agreement is better than 2 mm/yr. We find no persuasive evidence for significant vertical motions (less than 3 standard deviations), except at four sites. Three of these four were sites constrained to geodetic reference frame velocities. The GPS velocities were then used to estimate angular velocities for eight tectonic plates. Absolute angular velocities derived from the GPS data agree with the no net rotation (NNR) NUVEL-1A model within 95% confidence except for the Pacific plate. Our pole of rotation for the Pacific plate lies 11.5 deg west of the NNR NUVEL-1A pole, with an angular speed 10% faster. Our relative angular velocities agree with NUVEL-1A except for some involving the Pacific plate. While our Pacific-North America angular velocity differs significantly from NUVEL-1A, our model and NUVEL-1A predict very small differences in relative motion along the Pacific-North America plate boundary itself. Our Pacific-Australia and Pacific- Eurasia angular velocities are significantly faster than NUVEL-1A, predicting more rapid convergence at these two plate boundaries. Along the East Pacific Pise, our Pacific-Nazca angular velocity agrees in both rate and azimuth with NUVFL-1A.

Larson, Kristine M.↗