Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network robustness”

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 145 records · Page 8

Architecture Study on Telemetry Coverage for Immediate Post-Separation Phase

This document is the viewgraphs that accompanies a paper that presents the preliminary results of an architecture study that provides continuous telemetry coverage for NASA missions for immediate post-separation phase. After launch when the spacecraft separated from the upper stage, the spacecraft typically executes a number of mission-critical operations prior to the deployment of solar panels and the activation of the primary communication subsystem. JPL, GSFC, and APL have similar design principle statements that require continuous coverage of mission-critical telemetry during the immediate post-separation phase. To conform to these design principles, an architecture that consists of a separate spacecraft transmitter and a robust communication network capable of tracking the spacecraft signals is needed. The main results of this study are as follows: 1) At low altitude (< 10000 km) when most post-separation critical operations are executed, Earth-based network (e.g. Deep Space Network (DSN)) can only provide limited coverage, whereas space-based network (e.g. Space Network (SN)) can provide continuous coverage. 2) Commercial-off-the-shelf SN compatible transmitters are available for small satellite applications. In this paper we present the detailed coverage analysis of Earth-based and Space-based networks. We identify the key functional and performance requirements of the architecture, and describe the proposed selection criteria of the spacecraft transmitter. We conclude the paper with a proposed forward plan.

architecture↗

A Distributive, Non-Destructive, Real-Time Approach to Snowpack Monitoring

This invention is designed to ascertain the snow water equivalence (SWE) of snowpacks with better spatial and temporal resolutions than present techniques. The approach is ground-based, as opposed to some techniques that are air-based. In addition, the approach is compact, non-destructive, and can be communicated with remotely, and thus can be deployed in areas not possible with current methods. Presently there are two principal ground-based techniques for obtaining SWE measurements. The first is manual snow core measurements of the snowpack. This approach is labor-intensive, destructive, and has poor temporal resolution. The second approach is to deploy a large (e.g., 3x3 m) snowpillow, which requires significant infrastructure, is potentially hazardous [uses a approximately equal to 200-gallon (approximately equal to 760-L) antifreeze-filled bladder], and requires deployment in a large, flat area. High deployment costs necessitate few installations, thus yielding poor spatial resolution of data. Both approaches have limited usefulness in complex and/or avalanche-prone terrains. This approach is compact, non-destructive to the snowpack, provides high temporal resolution data, and due to potential low cost, can be deployed with high spatial resolution. The invention consists of three primary components: a robust wireless network and computing platform designed for harsh climates, new SWE sensing strategies, and algorithms for smart sampling, data logging, and SWE computation.

Frolik, Jeff↗

Disaster: would your community bounce back?

What makes some communities or organizations able to quickly bounce back from a disaster, while others take a long time to recover? This question has become very important for emergency planners in federal, state, and local government - particularly since the 9/11 attacks and Hurricane Katrina, which nearly destroyed New Orleans five years ago. These events have made people aware that we can't always prevent disasters, but might be able to improve the ability of communities and regions to respond to and bounce back from major disruptions. Social scientists have found that most communities are, in fact, quite resilient to most disasters. People tend to work together, overcome divisions, identify problems, and develop improvised solutions. This often leads to a greater sense of community and a sense of personal accomplishment. Long-term recovery can be harder, but rebuilding can create jobs and stimulate economies. Communities may even end up better than they were before. But there are some disturbing exceptions to this trend, including Hurricane Katrina. The hurricane killed many people, the federal and local emergency response was not effective, people who could not evacuate were housed in the Superdome and Convention Center in terrible conditions, crime was prevalent, and local government did not appear to have control over the situation. A significant portion of the population was eventually evacuated to other cities. Even five years later, many people have not returned, and large parts of the city have not been rebuilt. Clearly, New Orleans lacked sufficient resilience to overcome a disaster of the magnitude of Katrina. There are four factors that social scientists are beginning to agree are important for community resilience: (1) A strong, diverse economy - Stable jobs, good incomes, diversity of industries, personal savings; (2) Robust social networks - Community members know each other, help each other, and have connections outside the community; (3) Competent organizations - Government, health care, community service, and religious organizations are competent and trustworthy, and have resources to handle community needs; and (4) High-quality infrastructure - Road, power, and water systems (etc.) are in good condition and are designed to provide service even if some connections are destroyed. To explore how these factors make communities resilient, I will tell two stories of disasters. The first is the Buffalo Creek flood, which wiped out a coal mining community in West Virginia in 1972. This is a classic example of community that was not resilient in the aftermath of a disaster. The second example is the Vietnamese immigrant community in the Versailles neighborhood of New Orleans. In spite of being relatively poor and culturally isolated, this community was one of the first to fully rebound following Hurricane Katrina.

99 GENERAL AND MISCELLANEOUS↗

Optimizing squeezing in a coherent quantum feedback network of optical parametric oscillators

Advances in the emerging field of coherent quantum feedback control (CQFC) have led to the development of new capabilities in the areas of quantum control and quantum engineering, with a particular impact on the theory and applications of quantum optical networks. For this study, we consider a CQFC network consisting of two coupled optical parametric oscillators (OPOs) and study the squeezing spectrum of its output field. The performance of this network as a squeezed-light source with desired spectral characteristics is optimized by searching over the space of model parameters with experimentally motivated bounds. We use the QNET package to model the network’s dynamics and the PyGMO package of global optimization algorithms to maximize the degree of squeezing at a selected sideband frequency or the average degree of squeezing over a selected bandwidth. The use of global search methods is critical for identifying the best possible performance of the CQFC network, especially for squeezing at higher-frequency sidebands and higher bandwidths. The results demonstrate that the CQFC network of two coupled OPOs makes it possible to vary the squeezing spectrum, effectively utilize the available pump power, and overall significantly outperform a single OPO. Additionally, the Hessian eigenvalue analysis shows that the squeezing generation performance of the optimally operated CQFC network is robust to small variations of phase parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multiple-objective Reinforcement Learning for Inverse Design and Identification

The aim of inverse chemical design is to develop new molecules with given optimized molecular properties or objectives. Recently, generative deep learning (DL) networks are considered as the state-of-the-art in inverse chemical design and have achieved early success in generating molecular structures with desired properties in the pharmaceutical and material chemistry fields. However, satisfying a large number (> 10 objectives) of molecular objectives is a limitation of current generative models. To improve the model’s ability to handle a large number of molecule design objectives, we developed a Reinforcement Learning (RL) based generative framework to optimize chemical molecule generation. Our use of Curriculum Learning (CL) to fine-tune the pre-trained generative network allowed the model to satisfy up to 21 objectives and increase the generative network’s robustness. The experiments show that the proposed multiple-objective RL-based generative model can correctly identify unknown molecules with an 83% to 100% success rate, compared to the baseline approach of 0%. Additionally, this proposed generative model is not limited to just chemistry research challenges; we anticipate that problems that utilize RL with multiple objectives will benefit from this framework.

reinforcement learning, generative model, inverse ↗

Predicting carcinogenicity of diverse chemicals using probabilistic neural network modeling approaches

Robust global models capable of discriminating positive and non-positive carcinogens; and predicting carcinogenic potency of chemicals in rodents were developed. The dataset of 834 structurally diverse chemicals extracted from Carcinogenic Potency Database (CPDB) was used which contained 466 positive and 368 non-positive carcinogens. Twelve non-quantum mechanical molecular descriptors were derived. Structural diversity of the chemicals and nonlinearity in the data were evaluated using Tanimoto similarity index and Brock–Dechert–Scheinkman statistics. Probabilistic neural network (PNN) and generalized regression neural network (GRNN) models were constructed for classification and function optimization problems using the carcinogenicity end point in rat. Validation of the models was performed using the internal and external procedures employing a wide series of statistical checks. PNN constructed using five descriptors rendered classification accuracy of 92.09% in complete rat data. The PNN model rendered classification accuracies of 91.77%, 80.70% and 92.08% in mouse, hamster and pesticide data, respectively. The GRNN constructed with nine descriptors yielded correlation coefficient of 0.896 between the measured and predicted carcinogenic potency with mean squared error (MSE) of 0.44 in complete rat data. The rat carcinogenicity model (GRNN) applied to the mouse and hamster data yielded correlation coefficient and MSE of 0.758, 0.71 and 0.760, 0.46, respectively. The results suggest for wide applicability of the inter-species models in predicting carcinogenic potency of chemicals. Both the PNN and GRNN (inter-species) models constructed here can be useful tools in predicting the carcinogenicity of new chemicals for regulatory purposes. - Graphical abstract: Figure (a) shows classification accuracies (positive and non-positive carcinogens) in rat, mouse, hamster, and pesticide data yielded by optimal PNN model. Figure (b) shows generalization and predictive abilities of the interspecies GRNN model to predict the carcinogenic potency of diverse chemicals. - Highlights: • Global robust models constructed for carcinogenicity prediction of diverse chemicals. • Tanimoto/BDS test revealed structural diversity of chemicals and nonlinearity in data. • PNN/GRNN successfully predicted carcinogenicity/carcinogenic potency of chemicals. • Developed interspecies PNN/GRNN models for carcinogenicity prediction. • Proposed models can be used as tool to predict carcinogenicity of new chemicals.

60 APPLIED LIFE SCIENCES↗

A symmetric address translation approach for a network layer moving target defense to secure power grid networks

This paper will suggest a robust method for a network layer Moving Target Defense (MTD) using symmetric packet scheduling rules. The MTD is implemented and tested on a Supervisory Control and Data Acquisition (SCADA) network testbed. This method is shown to be efficient while providing security benefits to the issues faced by the static nature of SCADA networks. The proposed method is an automated tool that may provide defense in depth when be used in conjunction with other MTDs and traditional security devices.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Distributionally Robust Resilience Enhancement Strategy for Distribution Networks Considering Decision-Dependent Contingencies

When performing the resilience enhancement for distribution networks, there are two obstacles to reliably model the uncertain contingencies: 1) decision-dependent uncertainty (DDU) due to various line hardening decisions, and 2) distributional ambiguity due to limited outage information during extreme weather events (EWEs). Here, to address these two challenges, this paper develops scenario-wise decision-dependent ambiguity sets (SWDD-ASs), where the DDU and distributional ambiguity inherent in EWE-induced contingencies are simultaneously captured for each possible EWE scenario. Then, a two-stage tri-level decision-dependent distributionally robust resilient enhancement (DD-DRRE) model is formulated, whose outputs include the optimal line hardening, distributed generation (DG) allocation, and proactive network reconfiguration strategy under the worst-case distributions in SWDD-ASs. Subsequently, the DD-DRRE model is equivalently recast to a mixed-integer linear programming (MILP)-based master problem and multiple scenario-wise subproblems, facilitating the adoption of a customized column-and-constraint generation (C&CG) algorithm. Finally, case studies demonstrate a remarkable improvement in the out-of-sample performance of our model, compared to its prevailing stochastic and robust counterparts. Moreover, the potential values of incorporating the ambiguity and distributional information are quantitatively estimated, providing a useful reference for planners with different budgets and risk-aversion levels.

decision-dependent uncertainty↗

OpenFlow arbitrated programmable network channels for managing quantum metadata

Quantum networks must classically exchange complex metadata between devices in order to carry out information for protocols such as teleportation, super-dense coding, and quantum key distribution. Demonstrating the integration of these new communication methods with existing network protocols, channels, and data forwarding mechanisms remains an open challenge. Software-defined networking (SDN) offers robust and flexible strategies for managing diverse network devices and uses. We adapt the principles of SDN to the deployment of quantum networks, which are composed from unique devices that operate according to the laws of quantum mechanics. We show how quantum metadata can be managed within a software-defined network using the OpenFlow protocol, and we describe how OpenFlow management of classical optical channels is compatible with emerging quantum communication protocols. We next give an example specification of the metadata needed to manage and control quantum physical layer (QPHY) behavior and we extend the OpenFlow interface to accommodate this quantum metadata. Here, we conclude by discussing near-term experimental efforts that can realize SDN’s principles for quantum communication.

97 MATHEMATICS AND COMPUTING↗

Towards a robust out-of-the-box neural network model for genomic data

The accurate prediction of biological features from genomic data is paramount for precision medicine and sustainable agriculture. For decades, neural network models have been widely popular in fields like computer vision, astrophysics and targeted marketing given their prediction accuracy and their robust performance under big data settings. Yet neural network models have not made a successful transition into the medical and biological world due to the ubiquitous characteristics of biological data such as modest sample sizes, sparsity, and extreme heterogeneity. Here, we investigate the robustness, generalization potential and prediction accuracy of widely used convolutional neural network and natural language processing models with a variety of heterogeneous genomic datasets. Mainly, recurrent neural network models outperform convolutional neural network models in terms of prediction accuracy, overfitting and transferability across the datasets under study. While the perspective of a robust out-of-the-box neural network model is out of reach, we identify certain model characteristics that translate well across datasets and could serve as a baseline model for translational researchers.

59 BASIC BIOLOGICAL SCIENCES↗

Robust hierarchical dispatch for residential distribution network management considering home thermal flexibility and model predictive control

In the transactive energy (TE) paradigm, the devices of participative consumers, or prosumers, may be aggregated and employed to drive operational objectives at the network level. Home heating, ventilation and air-conditioning (HVAC) systems in particular are well-suited to modulate their behaviours based on both home thermal flexibility and requests from the utility grid. This paper develops a robust, hierarchical power dispatch scheme in the context of a residential distribution network. The formulation couples a unique, multiphase linear distribution optimal power flow (OPF) at the upper level with model predictive control (MPC)-based HVAC fleet controllers at the lower level. The proposed approach is tested on nearly 2000 homes with a three-phase distribution network in an intraday market setting, where two major applications are explored and analysed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Blending Ionic and Coordinate Bonds in Hybrid Semiconductor Materials: A General Approach toward Robust and Solution-Processable Covalent/Coordinate Network Structures

Inorganic semiconductor materials are best known for their superior physical properties, as well as their structural rigidity and stability. However, the poor solubility and solution-processability of these covalently bonded network structures has long been a serious drawback that limits their use in many important applications. Here, we present a unique and general approach to synthesize robust, solution-processable, and highly luminescent hybrid materials built on periodic and infinite inorganic modules. Structure analysis confirms that all compounds are composed of one-dimensional anionic chains of copper iodide (Cu m I m+2 2- ) coordinated to cationic organic ligands via Cu-N bonds. The choice of ligands plays an important role in the coordination mode (μ 1 -MC or μ 2 -DC) and Cu-N bond strength. Greatly suppressed nonradiative decay is achieved for the μ 2 -DC structures. Record high quantum yields of 85% (λ ex = 360 nm) and 76% (λ ex = 450 nm) are obtained for an orange-emitting 1D-Cu 4 I 6 (L 6 ). Temperature dependent PL measurements suggest that both phosphorescence and thermally activated delayed fluorescence contribute to the emission of these 1D-AIO compounds, and that the extent of nonradiative decay of the μ 2 -DC structures is much less than that of the μ1 -DC structures. More significantly, all compounds are remarkably soluble in polar aprotic solvents, distinctly different from previously reported CuI based hybrid materials made of charge-neutral Cu m X m (X = Cl, Br, I), which are totally insoluble in all common solvents. Finally, the greatly enhanced solubility is a result of incorporation of ionic bonds into extended covalent/coordinate network structures, making it possible to fabricate large scale thin films by solution processes

36 MATERIALS SCIENCE↗

Recipes for when physics fails: recovering robust learning of physics informed neural networks

Abstract Physics-informed neural networks (PINNs) have been shown to be effective in solving partial differential equations by capturing the physics induced constraints as a part of the training loss function. This paper shows that a PINN can be sensitive to errors in training data and overfit itself in dynamically propagating these errors over the domain of the solution of the PDE. It also shows how physical regularizations based on continuity criteria and conservation laws fail to address this issue and rather introduce problems of their own causing the deep network to converge to a physics-obeying local minimum instead of the global minimum. We introduce Gaussian process (GP) based smoothing that recovers the performance of a PINN and promises a robust architecture against noise/errors in measurements. Additionally, we illustrate an inexpensive method of quantifying the evolution of uncertainty based on the variance estimation of GPs on boundary data. Robust PINN performance is also shown to be achievable by choice of sparse sets of inducing points based on sparsely induced GPs. We demonstrate the performance of our proposed methods and compare the results from existing benchmark models in literature for time-dependent Schrödinger and Burgers’ equations.

97 MATHEMATICS AND COMPUTING↗

Noise Robustness and Experimental Demonstration of a Quantum Generative Adversarial Network for Continuous Distributions

Abstract The potential advantage of machine learning in quantum computers is a topic of intense discussion in the literature. Theoretical, numerical, and experimental explorations will most likely be required to understand its power. There have been different algorithms proposed to exploit the probabilistic nature of variational quantum circuits for generative modeling. In this paper, a hybrid architecture for quantum generative adversarial networks (QGANs) is employed and their robustness in the presence of noise is studied. A simple way of adding different types of noise to the quantum generator circuit is devised, and the noisy hybrid QGANs (HQGANs) are simulated numerically to learn continuous probability distributions, and to show that the performance of HQGANs remains unaffected. The effect of different parameters on the training time is also investigated to reduce the computational scaling of the algorithm and simplify its deployment on a quantum computer. The training on Rigetti's Aspen‐4‐2Q‐A quantum processing unit is then performed, and the results from the training are presented. The authors' results pave the way for experimental exploration of different quantum machine learning algorithms on noisy intermediate‐scale quantum devices.

Anand, Abhinav↗

Precision Synchronization for Free-Space Quantum Networking

Precision synchronization is vital for robust long-distance quantum networking over fiber and free-space channels for which high-fidelity entanglement swapping between separate sources via an optical Bell state measurement requires temporal overlap of photonic qubits arriving from either source. This challenge is particularly distinct in satellite-based entanglement distribution in which relative motion, channel effects, and propagation delay must be addressed. This work presents a precision synchronization method for free space entanglement distribution, and reports on risk reduction testing in a quantum networking testbed at MIT Lincoln Laboratory. Primary consideration is for a dual-uplink architecture in which photons from entanglement sources at two ground locations interact in an optical Bell-state measurement implemented on a satellite in a low-earth orbit. The control approach uses independent entanglement sources at each ground location supplemented with a synchronization signal for feedback control from a timing discriminant measured at the spacecraft. The approach is being implemented in a laboratory testbed using 1-GHz repetition rate 1550-nm band entanglement sources generating ~10-MHz source entanglement rates with few-ps photon pulse lengths. The paper describes both fundamental architectural considerations and practical implementation details.

quantum↗

Distributionally Robust Bilevel Optimization Model for Distribution Network With Demand Response Under Uncertain Renewables Using Wasserstein Metrics

Here, we consider a distribution network integrating demand response (DR) participants in the presence of uncertain renewable suppliers and outdoor temperatures. A bilevel optimization model is proposed to capture the intricate dynamics between price-incentivized DR participants and distribution system operations, including energy procurement and active/reactive power flows. The model is formulated as a distributional robust bilevel optimization using Wasserstein metrics. We show favorable data-driven properties including out-of-sample guarantee and asymptotic consistency. Furthermore, we present a tractable mixed-integer linear programming reformulation and characterize the worst-case distribution. Computational experiments are conducted on a modified 33-bus system. Our findings underscore the efficacy of the pricing strategies derived from the proposed bilevel optimization model. These strategies not only effectively manage DR participants' behavior but also bring equity considerations among households with various characteristics to light. The results contribute to a deeper understanding of the interplay between distribution system operators and DR participants.

24 POWER TRANSMISSION AND DISTRIBUTION↗