Search NASA⌕ Search

SEARCH · Search NASA

Results for “complex networks”

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 973 records · Page 54

Conservation of Species- and Trait-Based Modeling Network Interactions in Extremely Acidic Microbial Community Assembly

Understanding microbial interactions is essential to decipher the mechanisms of community assembly and their effects on ecosystem functioning, however, the conservation of species- and trait-based network interactions along environmental gradient remains largely unknown. Here, by using the network-based analyses with three paralleled data sets derived from 16S rRNA gene pyrosequencing, functional microarray, and predicted metagenome, we test our hypothesis that the network interactions of traits are more conserved than those of taxonomic measures, with significantly lower variation of network characteristics along the environmental gradient in acid mine drainage. The results showed that although the overall network characteristics remained similar, the structural variation was significantly lower at trait levels. The higher conserved individual node topological properties at trait level rather than at species level indicated that the responses of diverse traits remained relatively consistent even though different species played key roles under different environmental conditions. Additionally, the randomization tests revealed that it could not reject the null hypothesis that species-based correlations were random, while the tests suggested that correlation patterns of traits were non-random. Furthermore, relationships between trait-based network characteristics and environmental properties implied that trait-based networks might be more useful in reflecting the variation of ecosystem function. Taken together, our results suggest that deterministic trait-based community assembly results in greater conservation of network interaction, which may ensure ecosystem function across environmental regimes, emphasizing the potential importance of measuring the complexity and conservation of network interaction in evaluating the ecosystem stability and functioning.

59 BASIC BIOLOGICAL SCIENCES↗

Chemics-Reactors: A Preliminary Python Program for Implementing Network Models of Multiphase Reactors

We discuss the design and implementation of a preliminary software package written in Python 3 that is intended to represent complex multiphase reactors as networks of ideal continuous stirred tank reactors. This software also implements statistical design of experiments, uncertainty quantification, and global sensitivity analysis. These advanced features can provide important qualitative and quantitative insights into the effect of operating conditions and model parameters on predicted reactor performance. We demonstrate the utility of the program by modeling the vapor phase catalytic upgrading of bio-oil in a bubbling fluidized bed reactor.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Rare earth-nickel-indides Dy{sub 5}Ni{sub 2}In{sub 4} and RE{sub 4}Ni{sub 11}In{sub 20} (RE=Gd, Tb, Dy)

The new rare earth metal (RE)-nickel-indides Dy{sub 5}Ni{sub 2}In{sub 4} and RE{sub 4}Ni{sub 11}In{sub 20} (RE=Gd, Tb, Dy) were synthesized from the elements by arc-melting. Well-shaped single crystals were obtained by special annealing sequences. The four indides were investigated by X-ray diffraction on powders and single crystals: Lu{sub 5}Ni{sub 2}In{sub 4} type, Pbam, Z=2, a=1784.2(8), b=787.7(3), c=359.9(1) pm, wR{sub 2}=0.0458, 891 F{sup 2} values, 36 variables for Dy{sub 5}Ni{sub 2}In{sub 4}, U{sub 4}Ni{sub 11}Ga{sub 20} type, C2/m, a=2254.0(9), b=433.8(3), c=1658.5(8) pm, {beta}=124.59(2){sup o}, wR{sub 2}=0.0794, 2154 F{sup 2} values, 108 variables for Gd{sub 4}Ni{sub 11}In{sub 20}, a=2249.9(8), b=432.2(1), c=1657.9(5) pm, {beta}=124.59(2){sup o}, wR{sub 2}=0.0417, 2147 F{sup 2} values, 108 variables for Tb{sub 4}Ni{sub 11}In{sub 20}, and a=2252.2(5), b=430.6(1), c=1659.7(5) pm, {beta}=124.58(2){sup o}, wR{sub 2}=0.0550, 2003 F{sup 2} values, 109 variables for Dy{sub 4}Ni{sub 10.80}In{sub 20.20}. The 2d site in the dysprosium compound shows mixed Ni/In occupancy. Most nickel atoms in both series of compounds exhibit trigonal prismatic coordination by indium and rare earth atoms. Additionally, in the RE{sub 4}Ni{sub 11}In{sub 20} compounds one observes one-dimensional nickel clusters (259 pm Ni{sub 1}-Ni{sub 6} in Dy{sub 4}Ni{sub 10.80}In{sub 20.20}) that are embedded in an indium matrix. While only one short In{sub 1}-In{sub 2} contact at 324 pm is observed in Dy{sub 5}Ni{sub 2}In{sub 4}, the more indium-rich Dy{sub 4}Ni{sub 10.80}In{sub 20.20} structure exhibits a broader range in In-In interactions (291-364 pm). Together the nickel and indium atoms build up polyanionic networks, a two-dimensional one in Dy{sub 5}Ni{sub 2}In{sub 4} and a complex three-dimensional network in Dy{sub 4}Ni{sub 10.80}In{sub 20.20}. These features have a clear consequence on the dysprosium coordination, i.e. a variety of short Dy-Dy contacts (338-379 pm) in Dy{sub 5}Ni{sub 2}In{sub 4}, while the dysprosium atoms are well separated (430 pm shortest Dy-Dy distance) within the distorted hexagonal channels of the [Ni{sub 10.80}In{sub 20.20}] polyanion of Dy{sub 4}Ni{sub 10.80}In{sub 20.20}. The crystal chemistry of both structure types is comparatively discussed. - Graphical abstract: Crystal structure of Dy{sub 5}Ni{sub 2}In{sub 4}.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A series of Cd(II) complexes with {pi}-{pi} stacking and hydrogen bonding interactions: Structural diversities by varying the ligands

Seven new Cd(II) complexes consisting of different phenanthroline derivatives and organic acid ligands, formulated as [Cd(PIP){sub 2}(dnba){sub 2}] (1), [Cd(PIP)(ox)].H{sub 2}O (2), [Cd(PIP)(1,4-bdc)(H{sub 2}O)].4H{sub 2}O (3), [Cd(3-PIP){sub 2}(H{sub 2}O){sub 2}].4H{sub 2}O (4), [Cd{sub 2}(3-PIP){sub 4}(4,4'-bpdc)(H{sub 2}O){sub 2}].5H{sub 2}O (5), [Cd(3-PIP)(nip)(H{sub 2}O)].H{sub 2}O (6), [Cd{sub 2}(TIP){sub 4}(4,4'-bpdc)(H{sub 2}O){sub 2}].3H{sub 2}O (7) (PIP=2-phenylimidazo[4,5-f]1,10-phenanthroline, 3-PIP=2-(3-pyridyl)imidazo[4,5-f]1,10-phenanthroline, TIP=2-(2-thienyl)imidazo[4,5-f]1,10-phenanthroline, Hdnba=3,5-dinitrobenzoic acid, H{sub 2}ox=oxalic acid, 1,4-H{sub 2}bdc=benzene-1,4-dicarboxylic acid, 4,4'-H{sub 2}bpdc=biphenyl-4,4'-dicarboxylic acid, H{sub 2}nip=5-nitroisophthalic acid) have been synthesized under hydrothermal conditions. Complexes 1 and 4 possess mononuclear structures; complexes 5 and 7 are isostructural and have dinuclear structures; complexes 2 and 3 feature 1D chain structures; complex 6 contains 1D double chain, which are further extended to a 3D supramolecular structure by {pi}-{pi} stacking and hydrogen bonding interactions. The N-donor ligands with extended {pi}-system and organic acid ligands play a crucial role in the formation of the final supramolecular frameworks. Moreover, thermal properties and fluorescence of 1-7 are also investigated. -- Graphical abstract: Seven new supramolecular architectures have been successfully isolated under hydrothermal conditions by reactions of different phen derivatives and Cd(II) salts together with organic carboxylate anions auxiliary ligands. Display Omitted Research highlights: {yields} Complexes 1-7 are 0D or 1D polymeric structure, the {pi}-{pi} stacking and H-bonding interactions extend the complexes into 3D supramolecular network. To our knowledge, systematic study on {pi}-{pi} stacking and H-bonding interactions in cadmium(II) complexes are still limited. {yields} The structural differences among the title complexes indicate the importance of N-donor chelating ligands for the creation of molecular architectures. {yields} The thermal and fluorescence properties of title complexes have also been reported.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Time-Based CAN IDS Paper Results Code

Modern vehicles are complex cyber-physical systems made of hundreds of electronic control units (ECUs) that communicate over controller area networks (CANs). This inherited complexity has expanded the CAN attack surface which is vulnerable to message injection attacks. These injections change the overall timing characteristics of messages on the bus, and thus, to detect these malicious messages, time-based intrusion detection systems (IDSs) have been proposed. However, time-based IDSs are usually trained and tested on low-fidelity datasets with unrealistic, labeled attacks. This makes difficult the task of evaluating, comparing, and validating IDSs. Here we detail and benchmark four time-based IDSs against the newly published ROAD dataset, the first open CAN IDS dataset with real (non-simulated) stealthy attacks with physically verified effects. We found that methods that perform hypothesis testing by explicitly estimating message timing distributions have lower performance than methods that seek anomalies in a distribution related statistic. In particular, these “distribution-agnostic” based methods outperform “distribution-based” methods by at least 55% in area under the precision-recall curve (AUC-PR). Our results expand the body of knowledge of CAN time-based IDSs by providing details of these methods and reporting their results when tested on datasets with real advanced attacks. Finally, we develop an after-market plug-in detector using lightweight hardware, which can be used to deploy the best performing IDS method on nearly any vehicle.

Moriano, Pablo [Oak Ridge National Lab. (ORNL), Oa↗

Time-Based CAN Intrusion Detection Benchmark

Modern vehicles are complex cyber-physical systems made of hundreds of electronic control units (ECUs) that communicate over controller area networks (CANs). This inherited complexity has expanded the CAN attack surface by the injection of malicious messages that vary their time-based characteristics. To detect these malicious messages, time-based intrusion detection systems (IDS) have been proposed. However, time-based IDS are usually trained and tested on low-fidelity datasets with unrealistic labeled attacks. This makes difficult the task of evaluating, comparing, and validating IDS. Here we detail and benchmark four time-based IDS in a dataset with real and advanced attacks. We found that methods with strong assumptions regarding the distribution of inter-arrival times have lower performance than distribution agnostic based methods. In particular, distribution agnostic based methods outperform distribution based methods at least on $55\%$ in area under the precision-recall (AUC-PR) curve. Our results expand the body of knowledge of CAN time-based IDS by providing details of these methods and reporting their results when tested on datasets with real and advanced attacks. We describe limitations, open challenges, and how lessons learnt from this research can inform the design of deployable time-based IDS in modern vehicles.

Blevins, Deborah↗

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗

Experimental Observations of the Topology of Convolutional Neural Network Activations

Topological data analysis (TDA) is a branch of computational mathematics, bridging algebraic topology and data science, that provides compact, noise-robust representations of complex structures. Deep neural networks (DNNs) learn millions of parameters associated with a series of transformations defined by the model architecture resulting in high-dimensional, difficult to interpret internal representations of input data. As DNNs become more ubiquitous across multiple sectors of our society, there is increasing recognition that mathematical methods are needed to aid analysts, researchers, and practitioners in understanding and interpreting how these models' internal representations relate to the final classification. In this paper we apply cutting edge techniques from TDA with the goal of gaining insight towards interpretability of convolutional neural networks used for image classification. We use two common TDA approaches to explore several methods for modeling hidden layer activations as high-dimensional point clouds, and provide experimental evidence that these point clouds capture valuable structural information about the model's process. First, we demonstrate that a distance metric based on persistent homology can be used to quantify meaningful differences between layers and discuss these distances in the broader context of existing representational similarity metrics for neural network interpretability. Second, we show that a mapper graph can provide semantic insight as to how these models organize hierarchical class knowledge at each layer. These observations demonstrate that TDA is a useful tool to help deep learning practitioners unlock the hidden structures of their models.

topological data analysis, deep learning↗

Enhanced memory performance thanks to neural network assortativity

The behaviour of many complex dynamical systems has been found to depend crucially on the structure of the underlying networks of interactions. An intriguing feature of empirical networks is their assortativity--i.e., the extent to which the degrees of neighbouring nodes are correlated. However, until very recently it was difficult to take this property into account analytically, most work being exclusively numerical. We get round this problem by considering ensembles of equally correlated graphs and apply this novel technique to the case of attractor neural networks. Assortativity turns out to be a key feature for memory performance in these systems - so much so that for sufficiently correlated topologies the critical temperature diverges. We predict that artificial and biological neural systems could significantly enhance their robustness to noise by developing positive correlations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cloud Classification in Polar and Desert Regions and Smoke Classification from Biomass Burning Using a Hierarchical Neural Network

This research focuses on a new neural network scene classification technique. The task is to identify scene elements in Advanced Very High Resolution Radiometry (AVHRR) data from three scene types: polar, desert and smoke from biomass burning in South America (smoke). The ultimate goal of this research is to design and implement a computer system which will identify the clouds present on a whole-Earth satellite view as a means of tracking global climate changes. Previous research has reported results for rule-based systems (Tovinkere et at 1992, 1993) for standard back propagation (Watters et at. 1993) and for a hierarchical approach (Corwin et al 1994) for polar data. This research uses a hierarchical neural network with don't care conditions and applies this technique to complex scenes. A hierarchical neural network consists of a switching network and a collection of leaf networks. The idea of the hierarchical neural network is that it is a simpler task to classify a certain pattern from a subset of patterns than it is to classify a pattern from the entire set. Therefore, the first task is to cluster the classes into groups. The switching, or decision network, performs an initial classification by selecting a leaf network. The leaf networks contain a reduced set of similar classes, and it is in the various leaf networks that the actual classification takes place. The grouping of classes in the various leaf networks is determined by applying an iterative clustering algorithm. Several clustering algorithms were investigated, but due to the size of the data sets, the exhaustive search algorithms were eliminated. A heuristic approach using a confusion matrix from a lightly trained neural network provided the basis for the clustering algorithm. Once the clusters have been identified, the hierarchical network can be trained. The approach of using don't care nodes results from the difficulty in generating extremely complex surfaces in order to separate one class from all of the others. This approach finds pairwise separating surfaces and forms the more complex separating surface from combinations of simpler surfaces. This technique both reduces training time and improves accuracy over the previously reported results. Accuracies of 97.47%, 95.70%, and 99.05% were achieved for the polar, desert and smoke data sets.

Alexander, June↗

Virtual machine-based simulation platform for mobile ad-hoc network-based cyber infrastructure

In modeling and simulating complex systems such as mobile ad-hoc networks (MANETs) in de-fense communications, it is a major challenge to reconcile multiple important considerations: the rapidity of unavoidable changes to the software (network layers and applications), the difficulty of modeling the critical, implementation-dependent behavioral effects, the need to sustain larger scale scenarios, and the desire for faster simulations. Here we present our approach in success-fully reconciling them using a virtual time-synchronized virtual machine(VM)-based parallel ex-ecution framework that accurately lifts both the devices as well as the network communications to a virtual time plane while retaining full fidelity. At the core of our framework is a scheduling engine that operates at the level of a hypervisor scheduler, offering a unique ability to execute multi-core guest nodes over multi-core host nodes in an accurate, virtual time-synchronized manner. In contrast to other related approaches that suffer from either speed or accuracy issues, our framework provides MANET node-wise scalability, high fidelity of software behaviors, and time-ordering accuracy. The design and development of this framework is presented, and an ac-tual implementation based on the widely used Xen hypervisor system is described. Benchmarks with synthetic and actual applications are used to identify the benefits of our approach. The time inaccuracy of traditional emulation methods is demonstrated, in comparison with the accurate execution of our framework verified by theoretically correct results expected from analytical models of the same scenarios. In the largest high fidelity tests, we are able to perform virtual time-synchronized simulation of 64-node VM-based full-stack, actual software behaviors of MANETs containing a mix of static and mobile (unmanned airborne vehicle) nodes, hosted on a 32-core host, with full fidelity of unmodified ad-hoc routing protocols, unmodified application executables, and user-controllable physical layer effects including inter-device wireless signal strength, reachability, and connectivity.

97 MATHEMATICS AND COMPUTING↗

Uncertainty quantification of graph convolution neural network models of evolving processes

The application of neural network models to scientific machine learning tasks has proliferated in recent years. In particular, neural networks have proved to be adept at modeling processes with spatial–temporal complexity. Nevertheless, these highly parameterized models have garnered skepticism in their ability to produce outputs with quantified error bounds over the regimes of interest. Hence there is a need to find uncertainty quantification methods that are suitable for neural networks. In this work we present comparisons of the parametric uncertainty quantification of neural networks modeling complex spatial–temporal processes with Hamiltonian Monte Carlo and Stein variational gradient descent and its projected variant. Specifically we apply these methods to graph convolutional neural network models of evolving systems modeled with recurrent neural network and neural ordinary differential equations architectures. We show that Stein variational inference is a viable alternative to Monte Carlo methods with some clear advantages for complex neural network models. For our exemplars, Stein variational interference gave similar pushed forward uncertainty profiles through time compared to Hamiltonian Monte Carlo, albeit with generally more generous variance. As a result, projected Stein variational gradient descent also produced similar uncertainty profiles to the non-projected counterpart, but large reductions in the active weight space were confounded by the stability of the neural network predictions and the convoluted likelihood landscape.

36 MATERIALS SCIENCE↗

A programming environment for distributed complex computing. An overview of the Framework for Interdisciplinary Design Optimization (FIDO) project. NASA Langley TOPS exhibit H120b

The Framework for Interdisciplinary Design Optimization (FIDO) is a general programming environment for automating the distribution of complex computing tasks over a networked system of heterogeneous computers. For example, instead of manually passing a complex design problem between its diverse specialty disciplines, the FIDO system provides for automatic interactions between the discipline tasks and facilitates their communications. The FIDO system networks all the computers involved into a distributed heterogeneous computing system, so they have access to centralized data and can work on their parts of the total computation simultaneously in parallel whenever possible. Thus, each computational task can be done by the most appropriate computer. Results can be viewed as they are produced and variables changed manually for steering the process. The software is modular in order to ease migration to new problems: different codes can be substituted for each of the current code modules with little or no effect on the others. The potential for commercial use of FIDO rests in the capability it provides for automatically coordinating diverse computations on a networked system of workstations and computers. For example, FIDO could provide the coordination required for the design of vehicles or electronics or for modeling complex systems.

Townsend, James C.↗

Sign Problem in Tensor-Network Contraction

We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we observe that the approximate contraction of tensor networks with only positive entries has lower computational complexity as compared to tensor networks with general real or complex entries. This raises the question of how this transition in computational complexity manifests itself in the hardness of different tensor-network-contraction schemes. We pursue this question by studying random tensor networks with varying bias toward positive entries. First, we consider contraction via Monte Carlo sampling and find that the transition from hard to easy occurs when the tensor entries become predominantly positive; this can be understood as a tensor-network manifestation of the well-known negative-sign problem in quantum Monte Carlo. Second, we analyze the commonly used contraction based on boundary tensor networks. The performance of this scheme is governed by the number of correlations in contiguous parts of the tensor network (which by analogy can be thought of as entanglement). Remarkably, we find that the transition from hard to easy—i.e., from a volume-law to a boundary-law scaling of entanglement—already occurs for a slight bias of the tensor entries toward a positive mean, scaling inversely with the bond dimension D , and thus the problem becomes easy the earlier the larger D occurs. This is in contrast both to expectations and to the behavior found in Monte Carlo contraction, where the hardness at fixed bias increases with the bond dimension. To provide insight into this early breakdown of computational hardness and the accompanying entanglement transition, we construct an effective classical statistical-mechanical model that predicts a transition at a bias of the tensor entries of 1 / D , confirming our observations. We conclude by investigating the computational difficulty of computing expectation values of tensor-network wave functions (projected entangled-pair states, PEPSs) and find that in this setting, the complexity of entanglement-based contraction always remains low. We explain this by providing a local transformation that maps PEPS expectation values to a positive-valued tensor network. This not only provides insight into the origin of the observed boundary-law entanglement scaling but also suggests new approaches toward PEPS contraction based on positive decompositions. Published by the American Physical Society 2025

Chen, Jielun (ORCID:0000000178411545)↗

Cd(II) complexes with different nuclearity and dimensionality based on 3-hydrazino-4-amino-1,2,4-triazole

A series of zero- to two-dimensional Cd(II) coordination compounds have been synthesized by the reaction of Cd(II) salts and 3-hydrazino-4-amino-1,2,4-triazole di-hydrochloride (HATr·2HCl). [CdCl{sub 2}(HATr){sub 2}] (1) and [Cd{sub 2}Cl{sub 4}(HATr){sub 2}(H{sub 2}O){sub 2}] (2) have discrete mononuclear and binuclear structures, respectively. [Cd(HATr){sub 2}(ClO{sub 4}){sub 2}]{sub n} (3) presents polymeric 1-D chain and [Cd{sub 2}(NO{sub 3}){sub 2}Cl{sub 2}(HATr){sub 2}]{sub n} (4) shows 2-D frameworks. All Cd(II) ions exhibit distorted octahedral configurations in 1–3, whilst both hexa and heptacoordinated Cd(II) are formed in 4. The HATr ligands adopt chelating coordinated mode in 1, while tri-dentate bridging–chelating mode in 2–4. The chloride ion is a mono-coordinated ligand in 1 and 2, but it bridges two adjacent metal ions in 4. Furthermore, thermal behaviors have been investigated and the results reveal that all complexes have good thermal stability. The impact sensitivity test indicates that complex 3 is sensitive to impact stimuli. - Graphical abstract: Four Cd(II) complexes based on 3-hydrazino-4-amino-1,2,4-triazole ligands exhibit diverse structures from mononuclear to 2D networks. - Highlights: • Cd(II) complexes containing 3-hydrazino-4-amino-1,2,4-triazole ligands. • Mononuclear, binuclear, 1-D and 2-D structures. • Good thermal stability. • Thermal decomposition kinetics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scale-Free Networks and Commercial Air Carrier Transportation in the United States

Network science, or the art of describing system structure, may be useful for the analysis and control of large, complex systems. For example, networks exhibiting scale-free structure have been found to be particularly well suited to deal with environmental uncertainty and large demand growth. The National Airspace System may be, at least in part, a scalable network. In fact, the hub-and-spoke structure of the commercial segment of the NAS is an often-cited example of an existing scale-free network After reviewing the nature and attributes of scale-free networks, this assertion is put to the test: is commercial air carrier transportation in the United States well explained by this model? If so, are the positive attributes of these networks, e.g. those of efficiency, flexibility and robustness, fully realized, or could we effect substantial improvement? This paper first outlines attributes of various network types, then looks more closely at the common carrier air transportation network from perspectives of the traveler, the airlines, and Air Traffic Control (ATC). Network models are applied within each paradigm, including discussion of implied strengths and weaknesses of each model. Finally, known limitations of scalable networks are discussed. With an eye towards NAS operations, utilizing the strengths and avoiding the weaknesses of scale-free networks are addressed.

Conway, Sheila R.↗

Neural network kinetics for exploring diffusion multiplicity and chemical ordering in compositionally complex materials

Diffusion involving atom transport from one location to another governs many important processes and behaviors such as precipitation and phase nucleation. The inherent chemical complexity in compositionally complex materials poses challenges for modeling atomic diffusion and the resulting formation of chemically ordered structures. Here, we introduce a neural network kinetics (NNK) scheme that predicts and simulates diffusion-induced chemical and structural evolution in complex concentrated chemical environments. The framework is grounded on efficient on-lattice structure and chemistry representation combined with artificial neural networks, enabling precise prediction of all path-dependent migration barriers and individual atom jumps. To demonstrate the method, we study the temperature-dependent local chemical ordering in a refractory NbMoTa alloy and reveal a critical temperature at which the B2 order reaches a maximum. The atomic jump randomness map exhibits the highest diffusion heterogeneity (multiplicity) in the vicinity of this characteristic temperature, which is closely related to chemical ordering and B2 structure formation. The scalable NNK framework provides a promising new avenue to exploring diffusion-related properties in the vast compositional space within which extraordinary properties are hidden.

36 MATERIALS SCIENCE↗