Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network generation”

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 217 records · Page 12

Inducing Order from Disordered Copolymers: On Demand Generation of Triblock Morphologies Including Networks

Disordered block copolymers are generally impractical in nanopatterning applications due to their inability to self-assemble into well-defined nanostructures. However, inducing order in low molecular weight disordered systems permits the design of periodic structures with smaller characteristic sizes. Here, we have induced nanoscale phase separation from disordered triblock copolymer melts to form well-ordered lamellae, hexagonally packed cylinders, and a triply periodic gyroid network structure, using a copolymer/homopolymer blending approach, which incorporates constituent homopolymers into selective block domains. This versatile blending approach allows one to precisely target multiple nanostructures from a single disordered material and can be applied to a wide variety of triblock copolymer systems for nanotemplating and nanoscale separation applications requiring nanoscale feature sizes and/or high areal feature densities.

Tureau, Maëva S.↗

Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems

We investigate a generalised version of the recently proposed ordinal partition time series to network transformation algorithm. First, we introduce a fixed time lag for the elements of each partition that is selected using techniques from traditional time delay embedding. The resulting partitions define regions in the embedding phase space that are mapped to nodes in the network space. Edges are allocated between nodes based on temporal succession thus creating a Markov chain representation of the time series. We then apply this new transformation algorithm to time series generated by the Rössler system and find that periodic dynamics translate to ring structures whereas chaotic time series translate to band or tube-like structures—thereby indicating that our algorithm generates networks whose structure is sensitive to system dynamics. Furthermore, we demonstrate that simple network measures including the mean out degree and variance of out degrees can track changes in the dynamical behaviour in a manner comparable to the largest Lyapunov exponent. We also apply the same analysis to experimental time series generated by a diode resonator circuit and show that the network size, mean shortest path length, and network diameter are highly sensitive to the interior crisis captured in this particular data set.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bottlenecks and Hubs in Inferred Networks Are Important for Virulence in Salmonella typhimurium

Recent advances in experimental methods have provided sufficient data to consider systems as large networks of interconnected components. High-throughput determination of protein-protein interaction networks has led to the observation that topological bottlenecks, that is proteins defined by high centrality in the network, are enriched in proteins with systems-level phenotypes such as essentiality. Global transcriptional profiling by microarray analysis has been used extensively to characterize systems, for example, cellular response to environmental conditions and genetic mutations. These transcriptomic datasets have been used to infer regulatory and functional relationship networks based on co-regulation. We use the context likelihood of relatedness (CLR) method to infer networks from two datasets gathered from the pathogen Salmonella typhimurium; one under a range of environmental culture conditions and the other from deletions of 15 regulators found to be essential in virulence. Bottleneck nodes were identified from these inferred networks and we show that these nodes are significantly more likely to be essential for virulence than their non-bottleneck counterparts. A network generated using Pearson correlation did not display this behavior. Overall this study demonstrates that topology of networks inferred from global transcriptional profiles provides information about the systems-level roles of bottleneck genes. Analysis of the differences between the two CLR-derived networks suggests that the bottleneck nodes are either mediators of transitions between system states or sentinels that reflect the dynamics of these transitions.

59 BASIC BIOLOGICAL SCIENCES↗

Local rewiring algorithms to increase clustering and grow a small world

Abstract Many real-world networks have high clustering among vertices: vertices that share neighbours are often also directly connected to each other. A network’s clustering can be a useful indicator of its connectedness and community structure. Algorithms for generating networks with high clustering have been developed, but typically rely on adding or removing edges and nodes, sometimes from a completely empty network. Here, we introduce algorithms that create a highly clustered network by starting with an existing network and rearranging edges, without adding or removing them; these algorithms can preserve other network properties even as the clustering increases. They rely on local rewiring rules, in which a single edge changes one of its vertices in a way that is guaranteed to increase clustering. This greedy step can be applied iteratively to transform a random network into a form with much higher clustering. Additionally, the algorithms presented grow a network’s clustering faster than they increase its path length, meaning that network enters a regime of comparatively high clustering and low path length: a small world. These algorithms may be a basis for how real-world networks rearrange themselves organically to achieve or maintain high clustering and small-world structure.

97 MATHEMATICS AND COMPUTING↗

Scalable balanced training of conditional generative adversarial neural networks on image data

Here, we propose a distributed approach to train deep convolutional generative adversarial neural network (DC-CGANs) models. Our method reduces the imbalance between generator and discriminator by partitioning the training data according to data labels, and enhances scalability by performing a parallel training where multiple generators are concurrently trained, each one of them focusing on a single data label. Performance is assessed in terms of inception score, Fréchet inception distance, and image quality on MNIST, CIFAR10, CIFAR100, and ImageNet1k datasets, showing a significant improvement in comparison to state-of-the-art techniques to training DC-CGANs. Weak scaling is attained on all the four datasets using up to 1000 processes and 2000 NVIDIA V100 GPUs on the OLCF supercomputer Summit.

97 MATHEMATICS AND COMPUTING↗

Scaling the Earth System Grid to 100Gbps Networks

The SC11 demonstration, titled Scaling the Earth System Grid to 100Gbps Networks, showed the ability to use underlying infrastructure for the movement of climate data over 100Gbps network. Climate change research is one of the critical data intensive sciences, and the amount of data is continuously growing. Climate simulation data is geographically distributed over the world, and it needs to be accessed from many sources for fast and efficient analysis and inter-comparison of simulations. We used a 100Gbps link connecting National Energy Research Scientific Computing Center (NERSC) at Lawrence Berkeley National Laboratory (LBNL), Argonne National Laboratory (ANL) and Oak Ridge National Laboratory (ORNL). In the demo, the Intergovernmental Panel on Climate Change (IPCC) Fourth Assessment Report (AR4) phase 3 of the Coupled Model Intercomparison Project (CMIP-3) dataset was staged into the memory of computing nodes at ANL and ORNL from NERSC over the 100Gbps network for analysis and visualization. In general, climate simulation data consists of relatively small and large files with irregular file size distribution in each dataset. In this demo, we addressed challenges on data management in terms of high bandwidth networks, usability of existing protocols and middleware tools, and how applications can adapt and benefit from next generation networks.

97 MATHEMATICS AND COMPUTING↗

Virtualizing Industrial Control Networks for Cyber Resilience Experiments

Industrial control systems (ICS) networks are undergoing constant shifts to accommodate new security measures. It is challenging to test varying network configurations and security tools with physical systems as they typically include large, expensive equipment. Not only this, but researchers often do not have access to this type of equipment for development of new security tools and techniques. As a solution to these issues, this work presents a set of tools for utilizing GNS3 and Docker as a virtual ICS network. Additionally, the virtual network can be attached to physical devices including network switches, hardware simulations, and intelligent electronic devices (IEDs). Two case studies showcase a relatively complex automatically generated network and an attack on a simple ICS network with an example mitigation.

42 ENGINEERING↗

Carbodiimide‐Driven Toughening of Interpenetrated Polymer Networks

Abstract Recent work has demonstrated that temporary crosslinks in polymer networks generated by chemical “fuels” afford materials with large, transient changes in their mechanical properties. This can be accomplished in carboxylic‐acid‐functionalized polymer hydrogels using carbodiimides, which generate anhydride crosslinks with lifetimes on the order of minutes to hours. Here, the impact of the polymer network architecture on the mechanical properties of transiently crosslinked materials was explored. Single networks (SNs) were compared to interpenetrated networks (IPNs). Notably, semi‐IPN precursors that give IPNs on treatment with carbodiimide give much higher fracture energies (i.e., resistance to fracture) and superior resistance to compressive strain compared to other network architectures. A precursor semi‐IPN material featuring acrylic acid in only the free polymer chains yields, on treatment with carbodiimide, an IPN with a fracture energy of 2400 J/m 2 , a fourfold increase compared to an analogous semi‐IPN precursor that yields a SN. This resistance to fracture enables the formation of macroscopic complex cut patterns, even at high strain, underscoring the pivotal role of polymer architecture in mechanical performance.

Rajawasam, Chamoni W. H.↗

Carbodiimide‐Driven Toughening of Interpenetrated Polymer Networks

Abstract Recent work has demonstrated that temporary crosslinks in polymer networks generated by chemical “fuels” afford materials with large, transient changes in their mechanical properties. This can be accomplished in carboxylic‐acid‐functionalized polymer hydrogels using carbodiimides, which generate anhydride crosslinks with lifetimes on the order of minutes to hours. Here, the impact of the polymer network architecture on the mechanical properties of transiently crosslinked materials was explored. Single networks (SNs) were compared to interpenetrated networks (IPNs). Notably, semi‐IPN precursors that give IPNs on treatment with carbodiimide give much higher fracture energies (i.e., resistance to fracture) and superior resistance to compressive strain compared to other network architectures. A precursor semi‐IPN material featuring acrylic acid in only the free polymer chains yields, on treatment with carbodiimide, an IPN with a fracture energy of 2400 J/m 2 , a fourfold increase compared to an analogous semi‐IPN precursor that yields a SN. This resistance to fracture enables the formation of macroscopic complex cut patterns, even at high strain, underscoring the pivotal role of polymer architecture in mechanical performance.

Rajawasam, Chamoni W. H.↗

Calorimetry with deep learning: particle simulation and reconstruction for collider physics

Using detailed simulations of calorimeter showers as training data, we investigate the use of deep learning algorithms for the simulation and reconstruction of single isolated particles produced in high-energy physics collisions. We train neural networks on single-particle shower data at the calorimeter-cell level, and show significant improvements for simulation and reconstruction when using these networks compared to methods which rely on currently-used state-of-the-art algorithms. We define two models: an end-to-end reconstruction network which performs simultaneous particle identification and energy regression of particles when given calorimeter shower data, and a generative network which can provide reasonable modeling of calorimeter showers for different particle types at specified angles and energies. We investigate the optimization of our models with hyperparameter scans. Furthermore, we demonstrate the applicability of the reconstruction model to shower inputs from other detector geometries, specifically ATLAS-like and CMS-like geometries. These networks can serve as fast and computationally light methods for particle shower simulation and reconstruction for current and future experiments at particle colliders.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Suppressed Expression of T-Box Transcription Factors is Involved in Senescence in Chronic Obstructive Pulmonary Disease

Chronic obstructive pulmonary disease (COPD) is a major global health problem. The etiology of COPD has been associated with apoptosis, oxidative stress, and inflammation. However, understanding of the molecular interactions that modulate COPD pathogenesis remains only partly resolved. We conducted an exploratory study on COPD etiology to identify the key molecular participants. We used information-theoretic algorithms including Context Likelihood of Relatedness (CLR), Algorithm for the Reconstruction of Accurate Cellular Networks (ARACNE), and Inferelator. We captured direct functional associations among genes, given a compendium of gene expression profiles of human lung epithelial cells. A set of genes differentially expressed in COPD, as reported in a previous study were superposed with the resulting transcriptional regulatory networks. After factoring in the properties of the networks, an established COPD susceptibility locus and domain-domain interactions involving protein products of genes in the generated networks, several molecular candidates were predicted to be involved in the etiology of COPD. These include COL4A3, CFLAR, GULP1, PDCD1, CASP10, PAX3, BOK, HSPD1, PITX2, and PML. Furthermore, T-box (TBX) genes and cyclin-dependent kinase inhibitor 2A (CDKN2A), which are in a direct transcriptional regulatory relationship, emerged as preeminent participants in the etiology of COPD by means of senescence. Contrary to observations in neoplasms, our study reveals that the expression of genes and proteins in the lung samples from patients with COPD indicate an increased tendency towards cellular senescence. The expression of the anti-senescence mediators TBX transcription factors, chromatin modifiers histone deacetylases, and sirtuins was suppressed; while the expression of TBX-regulated cellular senescence markers such as CDKN2A, CDKN1A, and CAV1 was elevated in the peripheral lung tissue samples from patients with COPD. The critical balance between senescence and anti-senescence factors is disrupted towards senescence in COPD lungs.

59 BASIC BIOLOGICAL SCIENCES↗

Classification of River Catchments in the Contiguous United States: Code, Dataset, Similarity Patterns, and Resulting Classes

This dataset serves as supplementary information for the paper by Ciulla F. and Varadharajan C. A Network Approach for Multiscale Catchment Classification using Traits (see reference 1). It contains environmental and physical catchment traits, such as temperatures, precipitation, land use and human interference, from 9067 sites across the contiguous United States (CONUS). The purpose of this dataset is to provide information for a better trait-based categorization of river catchments in the CONUS using networks as an analytical tool. The traits variables match the ones present in the GAGES-II dataset and the preprocessing steps are described in the Methods section (processed_dataset.csv). Additionally we include the topologies (nodes, edges and clusters, also referred as classes) of the catchment network and traits network generated by said dataset (csv and json files). A series of tables support the information carried by the network providing more detailed descriptions of cluster components (SI1.pdf). A summary of all the plots of clusters of catchments with at least 50 nodes is provided (SI2.pdf). The characteristic traits for each cluster of catchments is presented as z-score (traits_categories_zscores_per_catchment_class.csv). The link to the hydrological behavior of clusters of catchments is displayed by boxplots, each describing a particular river discharge index (SI3.pdf). Both csv and json files can be read by common text editors but the data contained into them can be better handled using programming languages like python and database oriented libraries like pandas. Pdf files can be read by any pdf reader software.[02-23-2024] Update: The code and datasets necessary to reproduce the results of the study are available as a zipped repository (code_datasets_catchments_similarity.zip).

54 ENVIRONMENTAL SCIENCES↗

The role of interfacial dislocation networks in high temperature creep of superalloys

The dislocation networks generated during high-temperature creep of several single-crystal nickel-based superalloys are analyzed. The networks continually evolve during creep at relatively low temperatures or eventually reach a more stable configuration at high temperatures. Specifically, the role of these networks in directional coarsening processes are studied, along with their formation kinetics, characteristics, and stability during creep. The results of this study combined with previous findings suggest that the directional coarsening process is strongly influenced by elastic strain energy. The dislocation networks formed during primary creep are found to be stable during all subsequent creep stages. Aspects of these dislocation networks are determined to be a product of both the applied creep stress and coherency strains.

Gabb, T. P.↗

A diffusion-limited aggregation model for the evolution of drainage networks

We propose a modified diffusion-limited aggregation (DLA) model for the evolution of fluvial drainage networks. Random walkers are introduced randomly on a grid, and each two-dimensional random walk proceeds until the walker finds a drainage network on which to accrete. This model for headward growth of drainage networks generates drainage patterns remarkably similar to actual drainages. The model also predicts statistical features which agree with actual networks, including the frequency-order (bifurcation) ratio (R(sub b) = 3.98) and the stream length-order (R(sub r) = 2.09). Using the definition of network fractal dimension D = log R(sub b)/log R(sub r), we find that our DLA model gives D = 1.87, near the observed range of D approximately equal to 1.80 - 1.85.

Masek, Jeffrey G.↗

Integrated Scalable Parallel Firewall and Intrusion Detection System for High-Speed Networks

This project developed a new scalable network firewall and Intrusion Protection System (IPS) that can manage increasing traffic loads, higher network speeds, and strict Quality of Service (QoS) requirements. This new approach provides a strong foundation for next-generation network security technologies and products that address growing and unmet needs in the government and corporate sectors by delivering Optimal Network Security. Controlling access is an essential task for securing networks that are vital to private industry, government agencies, and the military. This access can be granted or denied based on the packet header or payload contents. For example, a simple network firewall enforces a security policy by inspecting and filtering the packet headers. As a complement to the firewall, an Intrusion Detection System (IDS) inspects the packet payload for known threat signatures; for example, virus or worm. Similar to a firewall policy, IDS policies consist of multiple rules that specify an action for matching packets. Each rule can specify different items, such as the signature contents and the signature location within the payload. When the firewall and IDS are merged into one device, the resulting system is referred to as an Intrusion Protection System (IPS), which provides both packet header and payload inspections. Having both types of inspections is very desirable and more manageable in a single device.

97 MATHEMATICS AND COMPUTING↗

Modeling and Analysis of Eavesdropping Attack in 802.11ad mmWave Wireless Networks

Next generation wireless communication networks utilizing 60 GHz millimeter wave (mmWave) frequency bands are expected to achieve multi-gigabit throughput with the use of highly directional phased-array antennas. These directional signal beams provide enhanced security to the legitimate networks due to the increased difficulties of eavesdropping. However, there still exists significant possibility of eavesdropping since 1) the reflections of the signal beam from ambient reflectors enables opportunistic stationary eavesdropping attacks, and; 2) carefully designed beam exploration strategy enables active nomadic eavesdropping attack. This paper discusses eavesdropper attack strategies for 802.11ad mmWave systems and provides the first analytical model to characterize the success possibility of eavesdropping in both opportunistic stationary attacks and active nomadic attacks. We derive the success probability of eavesdropping considering the ambient reflectors in the environment and errors introduced in the beam exploration strategies of the proposed eavesdropping attacker models. We study the success probability for both opportunistic stationary attack scenario and active nomadic attack scenario through numerical simulations. In addition to numerical simulations, we also evaluate the proposed attacker models using an 802.11ad test bed consisting of commercially available off-the-shelf devices.

99 GENERAL AND MISCELLANEOUS↗

Connecting Network Properties of Rapidly Disseminating Epizoonotics

Background: To effectively control the geographical dissemination of infectious diseases, their properties need to be determined. To test that rapid microbial dispersal requires not only susceptible hosts but also a pre-existing, connecting network, we explored constructs meant to reveal the network properties associated with disease spread, which included the road structure. Methods: Using geo-temporal data collected from epizoonotics in which all hosts were susceptible (mammals infected by Foot-and-mouth disease virus, Uruguay, 2001; birds infected by Avian Influenza virus H5N1, Nigeria, 2006), two models were compared: 1) ‘connectivity’, a model that integrated bio-physical concepts (the agent’s transmission cycle, road topology) into indicators designed to measure networks (‘nodes’ or infected sites with short- and long-range links), and 2) ‘contacts’, which focused on infected individuals but did not assess connectivity. Results: The connectivity model showed five network properties: 1) spatial aggregation of cases (disease clusters), 2) links among similar ‘nodes’ (assortativity), 3) simultaneous activation of similar nodes (synchronicity), 4) disease flows moving from highly to poorly connected nodes (directionality), and 5) a few nodes accounting for most cases (a ‘‘20:800 pattern). In both epizoonotics, 1) not all primary cases were connected but at least one primary case was connected, 2) highly connected, small areas (nodes) accounted for most cases, 3) several classes of nodes were distinguished, and 4) the contact model, which assumed all primary cases were identical, captured half the number of cases identified by the connectivity model. When assessed together, the synchronicity and directionality properties explained when and where an infectious disease spreads. Conclusions: Geo-temporal constructs of Network Theory’s nodes and links were retrospectively validated in rapidly disseminating infectious diseases. They distinguished classes of cases, nodes, and networks, generating information usable to revise theory and optimize control measures. Prospective studies that consider pre-outbreak predictors, such as connecting networks, are recommended.

59 BASIC BIOLOGICAL SCIENCES↗

DistGANS- Distributed Generative Adversarial Neural Networks

DistGANs is a Python package to perform distributed training of conditional generative adversarial neural networks for multi-class labeled image data. DistGANs partitionins the training data according to data labels, and enhances scalability by performing a parallel training where multiple generators are concurrently trained, each one of them focusing on a single data label.

Lupo Pasini, Massimiliano [Oak Ridge National Lab.↗