Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network Automation”

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 577 records · Page 32

Maximum-impact Adversary Design for Network-based Control System: A Case Study on Grid-interactive Efficient Buildings

The Internet of Things (IoT) technology has dramatically improved the efficiency of today's building operation and management. By connecting controllable devices into a communication network, control signals can be easily passed to the devices, and operating status can be acquired from measurable ends with minimal effort. However, this all-connected configuration could also expose the network-based control system (NBCS) to malicious actions, such as cyberattacks. One of the common NBCSs is the building automation system. With the promotion of grid-interactive efficient buildings (GEBs), there has been increasing attention on securing the buildings from the network perspective. This research proposes a maximum-impact adversary design framework so that the adversary can provide the most adversarial impact on the controlled system while remaining stealthy. The proposed framework is numerically demonstrated on a network-based building energy and control system. The building energy system is built in a Modelica-based simulation environment and controlled by the state-of-the-art ASHRAE Guideline 36 control sequences. The control commands at the supervisory level, generated from the Guideline 36 controller, are assumed to be sent to local devices through communication networks using the BACnet protocol. Simulation results show that the proposed maximum-impact adversary on such a system can stealthily affect the building system's performance to its maximum extent. It is anticipated that results can be used by researchers and practitioners in the building automation industry to design efficient and robust cyber-attack detection algorithms, especially for stealthy attacks.

Chu, Mengyuan↗

Automation and machine learning drive rapid optimization of isoprenol production in Pseudomonas putida

Advances in genome engineering have improved our ability to perturb microbial metabolic networks, yet bioproduction campaigns often struggle with parsing complex metabolic datasets to efficiently enhance product titers. We address this challenge by coupling laboratory automation with machine learning to systematically optimize the production of isoprenol, a sustainable aviation fuel precursor, in Pseudomonas putida. The simultaneous downregulation through CRISPR interference of combinations of up to four gene targets, guided by machine learning, permitted us to increase isoprenol titer 5-fold in six consecutive design-build-test-learn cycles. Moreover, machine learning enabled us to swiftly explore a vast experimental design space of 800,000 possible combinations by strategically recommending approximately 400 priority constructs. High-throughput proteomics allowed us to validate CRISPRi downregulation and identify biological mechanisms driving production increases. Our work demonstrates that ML-driven automated design-build-test-learn cycles, when combined with rigorous data validation, can rapidly enhance titers without specific biological knowledge, suggesting that it can be applied to any host, product, or pathway.

Carruthers, David N↗

Knowledge Engineering for Temporal Dependency Networks as Operations Procedures

This paper presents a case study of the knowledge engineering process employed to support the Link Monitor & Control Operator Assistant (LMCOA). The LMCOA is a prototype system which automates equipment used to support space-ground communication with deep space spacecraft in NASA's Deep Space Network (DSN). The primary knowledge base in the LMCOA is the Temporal Dependency Network (TDN). The paper provides a brief background on the DSN, and describes the evolution of the TDN and supporting knowledge bases, the process used for knowledge engineering, and an analysis of the successes--and problems--of the knowledge engineering effort.

operations↗

Image-Based Fracture Surface Defect Characterization Methods for Additively Manufactured Ti-6Al-4V Tested in Fatigue

Abstract Fatigue initiation in additively manufactured samples/parts often occurs at processed-induced defects such as lack-of-fusion (LoF), keyhole, or other morphological/microstructural defects that have unique characteristics and measurable qualities. Attempts at identifying and minimizing such defects have utilized optimized processing conditions along with in situ and ex situ characterization that includes metallography and/or X-ray computed tomography (XCT). This paper highlights the benefits of using fracture surface analyses to detect and quantify defects that may not be detected by metallography/XCT due to sectioning and resolution limits. In addition to using manual quantification of fatigue initiating LoF and keyhole defects on fracture surfaces, image-based machine learning using convolutional neural networks such as U-Net were also used to automate the process. Statistical analyses were used to identify the extreme cases of defects that initiated and accelerated fatigue and to model the distribution of defect size and shape characteristics to distinguish the type of defect. Initial results show agreement between trained machine learning models and ground truth data in defect segmentation, and the distributions of defect characteristics are distinguishable to particular process-induced defect types.

Materials Science↗

Automated processing of environmental transmission electron microscopy images for quantification of thin film dewetting and carbon nanotube nucleation dynamics

We report scalable production of carbon nanotubes (CNTs) requires catalysts and reaction conditions that provide high nucleation efficiency. In situ characterization methods such as environmental transmission electron microscopy (ETEM) can reveal fundamental mechanisms of synthesis, but to date have primarily provided qualitative observations on small sample sizes. Here, quantitative analysis is performed using high-resolution, high-rate video capture of ETEM experimentation coupled with automated image processing, involving computer vision algorithms and convolutional neural networks. By this approach, we detect distinct nanoparticle formation from an alumina-supported iron thin film and subsequent CNT nucleation from the nanoparticles. The statistical summary of particles in each video shows that, compared to a H 2 -only atmosphere, pretreatment of the catalyst with carbon added to the H 2 atmosphere results in a smaller average particle diameter, a 2-fold increase in particle density (to 5300 particles/μm 2 ), a 3-fold increase in CNT nucleation efficiency (to 92%), and more than a 5-fold increase in CNT density (to 4800/μm 2 ). Addition of carbon during exposure to H 2 is also more effective than NH 3 at dewetting the catalyst film and increasing the CNT nucleation efficiency, in spite of NH 3 being a stronger reducing agent for iron. Insights from this study are applicable to improving CNT yield and productivity in both batch-style and continuous processes.

25 ENERGY STORAGE↗

Automated imaging of the annihilation of a transverse domain wall in patterned magnetic thin films

Imaging the magnetic domain wall behavior in patterned thin films under external stimuli can enable understanding the underlying energy landscape and the role of local microstructure and defects. We present an automated workflow for in situ Lorentz transmission electron microscopy to image magnetic domain walls at the nanometer length scale and at a time resolution in the sub-millisecond regime—the latter of which is limited by the speed of the available camera. Our workflow is modular and can be broadly applied to various types of in situ experiments, taking us a step closer to the future of autonomous imaging of nanomagnetic films with electron microscopy. Using our workflow, we show the transformation of a transverse domain wall with sub-millisecond time resolution under the application of an in situ transverse magnetic field, a study of whose dynamics are essential in the design of future domain wall mediated spintronic device applications.

Algebraic topology↗

THE RETURN OF THE ANDROMEDIDS METEOR SHOWER

The Andromedid meteor shower underwent spectacular outbursts in 1872 and 1885, producing thousands of visual meteors per hour and described as ''stars fell like rain'' in Chinese records of the time. The shower originates from comet 3D/Biela whose disintegration in the mid-1800's is linked to the outbursts, but the shower has been weak or absent since the late 19th century. This shower returned in 2011 December with a zenithal hourly rate of approximately 50, the strongest return in over a hundred years. Some 122 probable Andromedid orbits were detected by the Canadian Meteor Orbit Radar while one possible brighter Andromedid member was detected by the Southern Ontario Meteor Network and several single station possible Andromedids by the Canadian Automated Meteor Observatory. The shower outburst occurred during 2011 December 3-5. The radiant at R.A. +18 Degree-Sign and decl. +56 Degree-Sign is typical of the ''classical'' Andromedids of the early 1800s, whose radiant was actually in Cassiopeia. Numerical simulations of the shower were necessary to identify it with the Andromedids, as the observed radiant differs markedly from the current radiant associated with that shower. The shower's orbital elements indicate that the material involved was released before 3D/Biela's breakup prior to 1846. The observed shower in 2011 had a slow geocentric speed (V{sub G} = 16 km s{sup -1}) and was comprised of small particles: the mean measured mass from the radar is {approx}5 Multiplication-Sign 10{sup -7} kg, corresponding to radii of 0.5 mm at a bulk density of 1000 kg m{sup -3}. Numerical simulations of the parent comet indicate that the meteoroids of the 2011 return of the Andromedids shower were primarily ejected during 3D/Biela's 1649 perihelion passage. The orbital characteristics, radiant, and timing as well as the absence of large particles in the streamlet are all broadly consistent with simulations. However, simulations of the 1649 perihelion passage necessitate going back five Lyapunov times (which is only 25 yr for the highly perturbed parent). As a result, the stream evolution is somewhat uncertain and some discrepancy with the observations is to be expected: the radiant is 8 Degree-Sign off, the inclination 3 Degree-Sign higher, and the peak of the shower occurs a day earlier than predicted. Predictions are made regarding other appearances of the shower in the years 2000-2047 based on our numerical model. We note that the details of the 2011 return can, in principle, be used to better constrain the orbit of 3D/Biela prior to the comets first recorded return in 1772 and we address this issue briefly as well.

79 ASTRONOMY AND ASTROPHYSICS↗

High-power transmitter automation

The current status of the transmitter automation development applicable to all transmitters in the deep space network is described. Interface and software designs are described that improve reliability and reduce the time required for subsystem turn-on and klystron saturation to less than 10 minutes.

Gosline, R.↗

Fault detection using a two-model test for changes in the parameters of an autoregressive time series

This article describes an investigation of a statistical hypothesis testing method for detecting changes in the characteristics of an observed time series. The work is motivated by the need for practical automated methods for on-line monitoring of Deep Space Network (DSN) equipment to detect failures and changes in behavior. In particular, on-line monitoring of the motor current in a DSN 34-m beam waveguide (BWG) antenna is used as an example. The algorithm is based on a measure of the information theoretic distance between two autoregressive models: one estimated with data from a dynamic reference window and one estimated with data from a sliding reference window. The Hinkley cumulative sum stopping rule is utilized to detect a change in the mean of this distance measure, corresponding to the detection of a change in the underlying process. The basic theory behind this two-model test is presented, and the problem of practical implementation is addressed, examining windowing methods, model estimation, and detection parameter assignment. Results from the five fault-transition simulations are presented to show the possible limitations of the detection method, and suggestions for future implementation are given.

Scholtz, P.↗

Recognition of partially occluded threat objects using the annealed Hopefield network

Recognition of partially occluded objects has been an important issue to airport security because occlusion causes significant problems in identifying and locating objects during baggage inspection. The neural network approach is suitable for the problems in the sense that the inherent parallelism of neural networks pursues many hypotheses in parallel resulting in high computation rates. Moreover, they provide a greater degree of robustness or fault tolerance than conventional computers. The annealed Hopfield network which is derived from the mean field annealing (MFA) has been developed to find global solutions of a nonlinear system. In the study, it has been proven that the system temperature of MFA is equivalent to the gain of the sigmoid function of a Hopfield network. In our early work, we developed the hybrid Hopfield network (HHN) for fast and reliable matching. However, HHN doesn't guarantee global solutions and yields false matching under heavily occluded conditions because HHN is dependent on initial states by its nature. In this paper, we present the annealed Hopfield network (AHN) for occluded object matching problems. In AHN, the mean field theory is applied to the hybird Hopfield network in order to improve computational complexity of the annealed Hopfield network and provide reliable matching under heavily occluded conditions. AHN is slower than HHN. However, AHN provides near global solutions without initial restrictions and provides less false matching than HHN. In conclusion, a new algorithm based upon a neural network approach was developed to demonstrate the feasibility of the automated inspection of threat objects from x-ray images. The robustness of the algorithm is proved by identifying occluded target objects with large tolerance of their features.

Kim, Jung H.↗

Astronomical data analysis software and systems I; Proceedings of the 1st Annual Conference, Tucson, AZ, Nov. 6-8, 1991

Consideration is given to a definition of a distribution format for X-ray data, the Einstein on-line system, the NASA/IPAC extragalactic database, COBE astronomical databases, Cosmic Background Explorer astronomical databases, the ADAM software environment, the Groningen Image Processing System, search for a common data model for astronomical data analysis systems, deconvolution for real and synthetic apertures, pitfalls in image reconstruction, a direct method for spectral and image restoration, and a discription of a Poisson imagery super resolution algorithm. Also discussed are multivariate statistics on HI and IRAS images, a faint object classification using neural networks, a matched filter for improving SNR of radio maps, automated aperture photometry of CCD images, interactive graphics interpreter, the ROSAT extreme ultra-violet sky survey, a quantitative study of optimal extraction, an automated analysis of spectra, applications of synthetic photometry, an algorithm for extra-solar planet system detection and data reduction facilities for the William Herschel telescope.

Worrall, Diana M.↗

Efficient Web Services Policy Combination

Large-scale Web security systems usually involve cooperation between domains with non-identical policies. The network management and Web communication software used by the different organizations presents a stumbling block. Many of the tools used by the various divisions do not have the ability to communicate network management data with each other. At best, this means that manual human intervention into the communication protocols used at various network routers and endpoints is required. Developing practical, sound, and automated ways to compose policies to bridge these differences is a long-standing problem. One of the key subtleties is the need to deal with inconsistencies and defaults where one organization proposes a rule on a particular feature, and another has a different rule or expresses no rule. A general approach is to assign priorities to rules and observe the rules with the highest priorities when there are conflicts. The present methods have inherent inefficiency, which heavily restrict their practical applications. A new, efficient algorithm combines policies utilized for Web services. The method is based on an algorithm that allows an automatic and scalable composition of security policies between multiple organizations. It is based on defeasible policy composition, a promising approach for finding conflicts and resolving priorities between rules. In the general case, policy negotiation is an intractable problem. A promising method, suggested in the literature, is when policies are represented in defeasible logic, and composition is based on rules for non-monotonic inference. In this system, policy writers construct metapolicies describing both the policy that they wish to enforce and annotations describing their composition preferences. These annotations can indicate whether certain policy assertions are required by the policy writer or, if not, under what circumstances the policy writer is willing to compromise and allow other assertions to take precedence. Meta-policies are specified in defeasible logic, a computationally efficient non-monotonic logic developed to model human reasoning. One drawback of this method is that at one point the algorithm starts an exhaustive search of all subsets of the set of conclusions of a defeasible theory. Although the propositional defeasible logic has linear complexity, the set of conclusions here may be large, especially in real-life practical cases. This phenomenon leads to an inefficient exponential explosion of complexity. The current process of getting a Web security policy from combination of two meta-policies consists of two steps. The first is generating a new meta-policy that is a composition of the input meta-policies, and the second is mapping the meta-policy onto a security policy. The new algorithm avoids the exhaustive search in the current algorithm, and provides a security policy that matches all requirements of the involved metapolicies.

Vatan, Farrokh↗

Communication host profiles

The present disclosure pertains to systems and methods for automating the configuration of communication hosts in a software defined network (SDN) associated with an electric power transmission and distribution system. The systems and methods presented herein may utilize communication host profiles to specify various repeatable attributes and customizable attributes that may be utilized to configure the communication host and the SDN. In one embodiment, a system may comprise a communication host profile subsystem configured to select a communication host profile associated with a communication host. The host communication profile subsystem may configure the communication host based on one or more repeatable attributes and on one or more customizable attributes specified in the host communication profile. A traffic routing system may further configure a plurality of communication flows in the SDN based on the communication host based on the host communication profile.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Emulation automation and model checking

A method of automating emulations is provided. The method comprising collecting publicly available network data over a predefined time interval, wherein the collected network data might comprise structured and unstructured data. Any unstructured data is converted into structured data. The original and converted structured data is stored in a database and compared to known network vulnerabilities. An emulated network is created according to the collected network data and the comparison of the structured data with known vulnerabilities. Virtual machines are created to run on the emulated network. Director programs and guest actor programs are run on the virtual machines, wherein the actor programs imitate real user behavior on the emulated network. The director programs deliver task commands to the guest actor programs to imitate real user behavior. The imitated behavior is presented to a user via an interface.

Urias, Vincent↗

Automated Target Acquisition, Recognition and Tracking (ATTRACT)

The primary objective of phase 1 of this research project is to conduct multidisciplinary research that will contribute to fundamental scientific knowledge in several of the USAF critical technology areas. Specifically, neural networks, signal processing techniques, and electro-optic capabilities are utilized to solve problems associated with automated target acquisition, recognition, and tracking. To accomplish the stated objective, several tasks have been identified and were executed.

Abdallah, Mahmoud A.↗

Architecture for Cognitive Networking within NASAs Future Space Communications Infrastructure

Future space mission concepts and designs pose many networking challenges for command, telemetry, and science data applications with diverse end-to-end data delivery needs. For future end-to-end architecture designs, a key challenge is meeting expected application quality of service requirements for multiple simultaneous mission data flows with options to use diverse onboard local data buses, commercial ground networks, and multiple satellite relay constellations in LEO, MEO, GEO, or even deep space relay links. Effectively utilizing a complex network topology requires orchestration and direction that spans the many discrete, individually addressable computer systems, which cause them to act in concert to achieve the overall network goals. The system must be intelligent enough to not only function under nominal conditions, but also adapt to unexpected situations, and reorganize or adapt to perform roles not originally intended for the system or explicitly programmed. This paper describes architecture features of cognitive networking within the future NASA space communications infrastructure, and interacting with the legacy systems and infrastructure in the meantime. The paper begins by discussing the need for increased automation, including inter-system collaboration. This discussion motivates the features of an architecture including cognitive networking for future missions and relays, interoperating with both existing endpoint-based networking models and emerging information-centric models. From this basis, we discuss progress on a proof-of-concept implementation of this architecture as a cognitive networking on-orbit application on the SCaN Testbed attached to the International Space Station.

space networks↗