Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network analysis”

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 775 records · Page 43

At the Perphery of the Amidohydrolase Superfamily: Bh0493 from Bacillus halodurans Catalyzes the Isomerization of D-Galacturonate to D-Tagaturonate

The amidohydrolase superfamily is a functionally diverse set of enzymes that catalyzes predominantly hydrolysis reactions involving sugars, nucleic acids, amino acids, and organophosphate esters. One of the most divergent members of this superfamily, uronate isomerase from Escherichia coli, catalyzes the isomerization of d-glucuronate to d-fructuronate and d-galacturonate to d-tagaturonate and is the only uronate isomerase in this organism. A gene encoding a putative uronate isomerase in Bacillus halodurans (Bh0705) was identified based on sequence similarity to uronate isomerases from other organisms. Kinetic evidence indicates that Bh0705 is relatively specific for the isomerization of d-glucuronate to d-fructuronate, confirming this functional assignment. Despite a low sequence identity to all other characterized uronate isomerases, phylogenetic and network-based analysis suggests that a second gene in this organism, Bh0493, is also a uronate isomerase, although it is an outlier in the group, with <20% sequence identity to any other characterized uronate isomerase from another species. The elucidation of the X-ray structure at a resolution of 2.0 Angstroms confirms that Bh0493 is a member of the amidohydrolase superfamily with conserved residues common to other members of the uronate isomerase family. Functional characterization of this protein shows that unlike Bh0705, Bh0493 can utilize both d-glucuronate and d-galacturonate as substrates. In B. halodurans, Bh0705 is found in an operon for the metabolism of d-glucuronate, whereas Bh0493 is in an operon for the metabolism of d-galacturonate. These results provide the first identification of a uronate isomerase that operates in a pathway distinct from that for d-glucuronate. While most organisms that contain this pathway have only one gene for a uronate isomerase, sequence analysis and operon context show that five other organisms also appear to have two genes and one organism appears to have three genes for this activity.

59 BASIC BIOLOGICAL SCIENCES↗

Precursor reaction pathway leading to BiFeO 3 formation: insights from text-mining and chemical reaction network analyses

BiFeO 3 (BFO) is a next-generation non-toxic multiferroic material with applications in sensors, memory devices, and spintronics, where its crystallinity and crystal structure directly influence its functional properties. Designing sol–gel syntheses that result in phase-pure BFO remains a challenge due to the complex interactions between metal complexes in the precursor solution. Here, we combine text-mined data and chemical reaction network (CRN) analysis to obtain novel insight into BFO sol–gel precursor chemistry. We perform text-mining analysis of 340 synthesis recipes with the emphasis on phase-pure BFO and identify trends in the use of precursor materials, including that nitrates are the preferred metal salts, 2-methoxyethanol (2 ME) is the dominant solvent, and adding citric acid as a chelating agent frequently leads to phase-pure BFO. Our CRN analysis reveals that the thermodynamically favored reaction mechanism between bismuth nitrate and 2ME interaction involves partial solvation followed by dimerization, contradicting assumptions in previous literature. We suggest that further oligomerization, facilitated by nitrite ion bridging, is critical for achieving the pure BFO phase.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Solving the P–O/P–OH riddle: direct synthesis and neutron diffraction characterization of dianionic dithiophosphonates

Here, we report the first definitive neutron diffraction study aimed at resolving the P–OH/P$=$O structural ambiguity in metal dithiophosphonates. The small NH 4 counterion forces a rare syn-configuration via an extended hydrogen-bonding network. Neutron analysis definitively confirmed the fully deprotonated P$=$O moiety, thus confirming the formation of a dianionic dithiophosphonate, a versatile synthon in homoleptic and heteroleptic coordination environments.

Pillay, Michael N. [National Dong Hwa Univ. (Taiwa↗

Synchronization in networks of spatially extended systems

Synchronization processes in networks of spatially extended dynamical systems are analytically and numerically studied. We focus on the relevant case of networks whose elements (or nodes) are spatially extended dynamical systems, with the nodes being connected with each other by scalar signals. The stability of the synchronous spatio-temporal state for a generic network is analytically assessed by means of an extension of the master stability function approach. We find an excellent agreement between the theoretical predictions and the data obtained by means of numerical calculations. The efficiency and reliability of this method is illustrated numerically with networks of beam-plasma chaotic systems (Pierce diodes). We discuss also how the revealed regularities are expected to take place in other relevant physical and biological circumstances.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An ANFIS-based on B2C electronic commerce transaction

The purpose of this study is to use an adaptive-network-based fuzzy inference system to model a fuzzy logic-based system (FIS) for supporting decision-making process in B2C electronic commerce transaction. Firstly we introduce FIS in B2C electronic commerce transaction and ANFIS. Then we use ANFIS to model FIS with different membership functions(MF). Lastly we give a conclusion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Implementability of two-qubit unitary operations over the butterfly network and the ladder network with free classical communication

We investigate distributed implementation of two-qubit unitary operations over two primitive networks, the butterfly network and the ladder network, as a first step to apply network coding for quantum computation. By classifying two-qubit unitary operations in terms of the Kraus-Cirac number, the number of non-zero parameters describing the global part of two-qubit unitary operations, we analyze which class of two-qubit unitary operations is implementable over these networks with free classical communication. For the butterfly network, we show that two classes of two-qubit unitary operations, which contain all Clifford, controlled-unitary and matchgate operations, are implementable over the network. For the ladder network, we show that two-qubit unitary operations are implementable over the network if and only if their Kraus-Cirac number do not exceed the number of the bridges of the ladder.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Implementing controlled-unitary operations over the butterfly network

We introduce a multiparty quantum computation task over a network in a situation where the capacities of both the quantum and classical communication channels of the network are limited and a bottleneck occurs. Using a resource setting introduced by Hayashi [1], we present an efficient protocol for performing controlled-unitary operations between two input nodes and two output nodes over the butterfly network, one of the most fundamental networks exhibiting the bottleneck problem. This result opens the possibility of developing a theory of quantum network coding for multiparty quantum computation, whereas the conventional network coding only treats multiparty quantum communication.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Phase multistability in a dynamical small world network

The effect of phase multistability is explored in a small world network of periodic oscillators with diffusive couplings. The structure of the network represents a ring with additional non-local links, which spontaneously arise and vanish between arbitrary nodes. The dynamics of random couplings is modeled by “birth” and “death” stochastic processes by means of the cellular automate approach. The evolution of the network under gradual increasing of the number of random couplings goes through stages of phases fluctuations and spatial cluster formation. Finally, in the presence of non-local couplings the phase multistability “dies” and only the in-phase regime survives.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic approximation methods-Powerful tools for simulation and optimization: A survey of some recent work on multi-agent systems and cyber-physical systems

Stochastic approximation methods have found extensive and diversified applications. Recent emergence of networked systems and cyber-physical systems has generated renewed interest in advancing stochastic approximation into a general framework to support algorithm development for information processing and decisions in such systems. This paper presents a survey on some recent developments in stochastic approximation methods and their applications. Using connected vehicles in platoon formation and coordination as a platform, we highlight some traditional and new methodologies of stochastic approximation algorithms and explain how they can be used to capture essential features in networked systems. Distinct features of networked systems with randomly switching topologies, dynamically evolving parameters, and unknown delays are presented, and control strategies are provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Recovering network topologies via Taylor expansion and compressive sensing

Gaining knowledge of the intrinsic topology of a complex dynamical network is the precondition to understand its evolutionary mechanisms and to control its dynamical and functional behaviors. In this article, a general framework is developed to recover topologies of complex networks with completely unknown node dynamics based on Taylor expansion and compressive sensing. Numerical simulations illustrate the feasibility and effectiveness of the proposed method. Moreover, this method is found to have good robustness to weak stochastic perturbations. Finally, the impact of two major factors on the topology identification performance is evaluated. This method provides a natural and direct point to reconstruct network topologies from measurable data, which is likely to have potential applicability in a wide range of fields.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Coarse-grained model of water diffusion and proton conductivity in hydrated polyelectrolyte membrane

Using dissipative particle dynamics (DPD), we simulate nanoscale segregation, water diffusion, and proton conductivity in hydrated sulfonated polystyrene (sPS). We employ a novel model [Lee et al. J. Chem. Theory Comput. 11(9), 4395-4403 (2015)] that incorporates protonation/deprotonation equilibria into DPD simulations. The polymer and water are modeled by coarse-grained beads interacting via short-range soft repulsion and smeared charge electrostatic potentials. The proton is introduced as a separate charged bead that forms dissociable Morse bonds with the base beads representing water and sulfonate anions. Morse bond formation and breakup artificially mimics the Grotthuss mechanism of proton hopping between the bases. The DPD model is parameterized by matching the proton mobility in bulk water, dissociation constant of benzenesulfonic acid, and liquid-liquid equilibrium of water-ethylbenzene solutions. The DPD simulations semi-quantitatively predict nanoscale segregation in the hydrated sPS into hydrophobic and hydrophilic subphases, water self-diffusion, and proton mobility. As the hydration level increases, the hydrophilic subphase exhibits a percolation transition from isolated water clusters to a 3D network. The analysis of hydrophilic subphase connectivity and water diffusion demonstrates the importance of the dynamic percolation effect of formation and breakup of temporary junctions between water clusters. The proposed DPD model qualitatively predicts the ratio of proton to water self-diffusion and its dependence on the hydration level that is in reasonable agreement with experiments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Design and verification of distributed logic controllers with application of Petri nets

The paper deals with the designing and verification of distributed logic controllers. The control system is initially modelled with Petri nets and formally verified against structural and behavioral properties with the application of the temporal logic and model checking technique. After that it is decomposed into separate sequential automata that are working concurrently. Each of them is re-verified and if the validation is successful, the system can be finally implemented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic averaging and sensitivity analysis for two scale reaction networks

In the presence of multiscale dynamics in a reaction network, direct simulation methods become inefficient as they can only advance the system on the smallest scale. This work presents stochastic averaging techniques to accelerate computations for obtaining estimates of expected values and sensitivities with respect to the steady state distribution. A two-time-scale formulation is used to establish bounds on the bias induced by the averaging method. Further, this formulation provides a framework to create an accelerated “averaged” version of most single-scale sensitivity estimation methods. In particular, we propose the use of a centered ergodic likelihood ratio method for steady state estimation and show how one can adapt it to accelerated simulations of multiscale systems. Lastly, we develop an adaptive “batch-means” stopping rule for determining when to terminate the micro-equilibration process.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Self-consistent hopping theory of activated relaxation and diffusion of dilute penetrants in dense crosslinked polymer networks

We generalize a microscopic statistical mechanical theory of the activated dynamics of dilute spherical penetrants in glass-forming liquids to study the influence of crosslinking in polymer networks on the penetrant relaxation time and diffusivity over a wide range of temperature and crosslink fraction (f n ). Our calculations are relevant to recent experimental studies of a nm-sized molecule diffusing in poly-(n-butyl methacrylate) networks. The theory predicts the penetrant relaxation time increases exponentially with the glass transition temperature, T g (f n ), which grows roughly linearly with the square root of fn due to the coupling of local hopping to longer-range collective elasticity. Moreover, T g is also found to be proportional to a geometric confinement parameter defined as the ratio of the penetrant diameter to the mean network mesh size. The decoupling ratio of the penetrant and Kuhn segment alpha times displays a complex non-monotonic dependence on f n and temperature that is well collapsed based on the variable T g (f n )/T. A model for the penetrant diffusion constant that combines activated relaxation and entropic mesh confinement is proposed, which results in a significantly stronger suppression of mass transport with degree of effective supercooling than predicted for the penetrant alpha time. Furthermore, this behavior corresponds to a new network-based type of “decoupling” of diffusion and relaxation. In contrast to the diffusion of larger nanoparticles in high temperature rubbery networks, our analysis in the supercooled regime suggests that for the penetrants studied the mesh confinement effects are of secondary importance relative to the consequences of crosslink-induced slowing down of activated hopping of glassy physics origin.

Chemistry↗

Closed locally minimal nets on tetrahedra

Closed locally minimal networks are in a sense a generalization of closed geodesics. A complete classification is known of closed locally minimal networks on regular (and generally any equihedral) tetrahedra. In the present paper certain necessary and certain sufficient conditions are given for at least one closed locally minimal network to exist on a given non-equihedral tetrahedron. Bibliography: 6 titles.

97 MATHEMATICS AND COMPUTING↗

Stabilization of a locally minimal forest

The method of partial stabilization of locally minimal networks, which was invented by Ivanov and Tuzhilin to construct examples of shortest trees with given topology, is developed. According to this method, boundary vertices of degree 2 are not added to all edges of the original locally minimal tree, but only to some of them. The problem of partial stabilization of locally minimal trees in a finite-dimensional Euclidean space is solved completely in the paper, that is, without any restrictions imposed on the number of edges remaining free of subdivision. A criterion for the realizability of such stabilization is established. In addition, the general problem of searching for the shortest forest connecting a finite family of boundary compact sets in an arbitrary metric space is formalized; it is shown that such forests exist for any family of compact sets if and only if for any finite subset of the ambient space there exists a shortest tree connecting it. The theory developed here allows us to establish further generalizations of the stabilization theorem both for arbitrary metric spaces and for metric spaces with some special properties. Bibliography: 10 titles.

97 MATHEMATICS AND COMPUTING↗