WorldWideScience

Sample records for two-dimensional network parallel

  1. Incorrectness of conventional one-dimensional parallel thermal resistance circuit model for two-dimensional circular composite pipes

    International Nuclear Information System (INIS)

    Wong, K.-L.; Hsien, T.-L.; Chen, W.-L.; Yu, S.-J.

    2008-01-01

    This study is to prove that two-dimensional steady state heat transfer problems of composite circular pipes cannot be appropriately solved by the conventional one-dimensional parallel thermal resistance circuits (PTRC) model because its interface temperatures are not unique. Thus, the PTRC model is definitely different from its conventional recognized analogy, parallel electrical resistance circuits (PERC) model, which has unique node electric voltages. Two typical composite circular pipe examples are solved by CFD software, and the numerical results are compared with those obtained by the PTRC model. This shows that the PTRC model generates large error. Thus, this conventional model, introduced in most heat transfer text books, cannot be applied to two-dimensional composite circular pipes. On the contrary, an alternative one-dimensional separately series thermal resistance circuit (SSTRC) model is proposed and applied to a two-dimensional composite circular pipe with isothermal boundaries, and acceptable results are returned

  2. The inaccuracy of conventional one-dimensional parallel thermal resistance circuit model for two-dimensional composite walls

    International Nuclear Information System (INIS)

    Wong, K.-L.; Hsien, T.-L.; Hsiao, M.-C.; Chen, W.-L.; Lin, K.-C.

    2008-01-01

    This investigation is to show that two-dimensional steady state heat transfer problems of composite walls should not be solved by the conventionally one-dimensional parallel thermal resistance circuits (PTRC) model because the interface temperatures are not unique. Thus PTRC model cannot be used like its conventional recognized analogy, parallel electrical resistance circuits (PERC) model which has the unique node electric voltage. Two typical composite wall examples, solved by CFD software, are used to demonstrate the incorrectness. The numerical results are compared with those obtained by PTRC model, and very large differences are observed between their results. This proves that the application of conventional heat transfer PTRC model to two-dimensional composite walls, introduced in most heat transfer text book, is totally incorrect. An alternative one-dimensional separately series thermal resistance circuit (SSTRC) model is proposed and applied to the two-dimensional composite walls with isothermal boundaries. Results with acceptable accuracy can be obtained by the new model

  3. A parallel algorithm for solving linear equations arising from one-dimensional network problems

    International Nuclear Information System (INIS)

    Mesina, G.L.

    1991-01-01

    One-dimensional (1-D) network problems, such as those arising from 1- D fluid simulations and electrical circuitry, produce systems of sparse linear equations which are nearly tridiagonal and contain a few non-zero entries outside the tridiagonal. Most direct solution techniques for such problems either do not take advantage of the special structure of the matrix or do not fully utilize parallel computer architectures. We describe a new parallel direct linear equation solution algorithm, called TRBR, which is especially designed to take advantage of this structure on MIMD shared memory machines. The new method belongs to a family of methods which split the coefficient matrix into the sum of a tridiagonal matrix T and a matrix comprised of the remaining coefficients R. Efficient tridiagonal methods are used to algebraically simplify the linear system. A smaller auxiliary subsystem is created and solved and its solution is used to calculate the solution of the original system. The newly devised BR method solves the subsystem. The serial and parallel operation counts are given for the new method and related earlier methods. TRBR is shown to have the smallest operation count in this class of direct methods. Numerical results are given. Although the algorithm is designed for one-dimensional networks, it has been applied successfully to three-dimensional problems as well. 20 refs., 2 figs., 4 tabs

  4. Parallel processing of two-dimensional Sn transport calculations

    International Nuclear Information System (INIS)

    Uematsu, M.

    1997-01-01

    A parallel processing method for the two-dimensional S n transport code DOT3.5 has been developed to achieve a drastic reduction in computation time. In the proposed method, parallelization is achieved with angular domain decomposition and/or space domain decomposition. The calculational speed of parallel processing by angular domain decomposition is largely influenced by frequent communications between processing elements. To assess parallelization efficiency, sample problems with up to 32 x 32 spatial meshes were solved with a Sun workstation using the PVM message-passing library. As a result, parallel calculation using 16 processing elements, for example, was found to be nine times as fast as that with one processing element. As for parallel processing by geometry segmentation, the influence of processing element communications on computation time is small; however, discontinuity at the segment boundary degrades convergence speed. To accelerate the convergence, an alternate sweep of angular flux in conjunction with space domain decomposition and a two-step rescaling method consisting of segmentwise rescaling and ordinary pointwise rescaling have been developed. By applying the developed method, the number of iterations needed to obtain a converged flux solution was reduced by a factor of 2. As a result, parallel calculation using 16 processing elements was found to be 5.98 times as fast as the original DOT3.5 calculation

  5. Type Synthesis of Parallel Mechanisms with the First Class GF Sets and Two-Dimensional Rotations

    Directory of Open Access Journals (Sweden)

    Jialun Yang

    2012-09-01

    Full Text Available The novel design of parallel mechanisms plays a key role in the potential application of parallel mechanisms. In this paper, the type synthesis of parallel mechanisms with the first class GF sets and two-dimensional rotations is studied. The rule of two-dimensional rotations is given, which lays the theoretical foundation for the intersection operations of specific GF sets. Next, kinematic limbs with specific characteristics are designed according to the 2-D and 3-D axes movement theorems. Finally, several synthesized parallel mechanisms with the first class GF sets and two-dimensional rotations are illustrated to show the effectiveness of the proposed methodology.

  6. Quantum Communication Through a Two-Dimensional Spin Network

    International Nuclear Information System (INIS)

    Wang Zhaoming; Gu Yongjian

    2012-01-01

    We investigate the state or entanglement transfer through a two-dimensional spin network. We show that for state transfer, better fidelity can be gained along the diagonal direction but for entanglement transfer, when the initial entanglement is created along the boundary, the concurrence is more inclined to propagate along the boundary. This behavior is produced by quantum mechanical interference and the communication quality depends on the precise size of the network. For some number of sites, the fidelity in a two-dimensional channel is higher than one-dimensional case. This is an important result for realizing quantum communication through high dimension spin chain networks.

  7. Conduction in rectangular quasi-one-dimensional and two-dimensional random resistor networks away from the percolation threshold.

    Science.gov (United States)

    Kiefer, Thomas; Villanueva, Guillermo; Brugger, Jürgen

    2009-08-01

    In this study we investigate electrical conduction in finite rectangular random resistor networks in quasione and two dimensions far away from the percolation threshold p(c) by the use of a bond percolation model. Various topologies such as parallel linear chains in one dimension, as well as square and triangular lattices in two dimensions, are compared as a function of the geometrical aspect ratio. In particular we propose a linear approximation for conduction in two-dimensional systems far from p(c), which is useful for engineering purposes. We find that the same scaling function, which can be used for finite-size scaling of percolation thresholds, also applies to describe conduction away from p(c). This is in contrast to the quasi-one-dimensional case, which is highly nonlinear. The qualitative analysis of the range within which the linear approximation is legitimate is given. A brief link to real applications is made by taking into account a statistical distribution of the resistors in the network. Our results are of potential interest in fields such as nanostructured or composite materials and sensing applications.

  8. Tunable strain gauges based on two-dimensional silver nanowire networks

    International Nuclear Information System (INIS)

    Ho, Xinning; Cheng, Chek Kweng; Tey, Ju Nie; Wei, Jun

    2015-01-01

    Strain gauges are used in various applications such as wearable strain gauges and strain gauges in airplanes or structural health monitoring. Sensitivity of the strain gauge required varies, depending on the application of the strain gauge. This paper reports a tunable strain gauge based on a two-dimensional percolative network of silver nanowires. By varying the surface coverage of the nanowire network and the waviness of the nanowires in the network, the sensitivity of the strain gauge can be controlled. Hence, a tunable strain gauge can be engineered, based on demands of the application. A few applications are demonstrated. The strain gauge can be adhered to the human neck to detect throat movements and a glove integrated with such a strain gauge can detect the bending of the forefinger. Other classes of two-dimensional percolative networks of one-dimensional materials are also expected to exhibit similar tunable properties. (paper)

  9. Functional Parallel Factor Analysis for Functions of One- and Two-dimensional Arguments.

    Science.gov (United States)

    Choi, Ji Yeh; Hwang, Heungsun; Timmerman, Marieke E

    2018-03-01

    Parallel factor analysis (PARAFAC) is a useful multivariate method for decomposing three-way data that consist of three different types of entities simultaneously. This method estimates trilinear components, each of which is a low-dimensional representation of a set of entities, often called a mode, to explain the maximum variance of the data. Functional PARAFAC permits the entities in different modes to be smooth functions or curves, varying over a continuum, rather than a collection of unconnected responses. The existing functional PARAFAC methods handle functions of a one-dimensional argument (e.g., time) only. In this paper, we propose a new extension of functional PARAFAC for handling three-way data whose responses are sequenced along both a two-dimensional domain (e.g., a plane with x- and y-axis coordinates) and a one-dimensional argument. Technically, the proposed method combines PARAFAC with basis function expansion approximations, using a set of piecewise quadratic finite element basis functions for estimating two-dimensional smooth functions and a set of one-dimensional basis functions for estimating one-dimensional smooth functions. In a simulation study, the proposed method appeared to outperform the conventional PARAFAC. We apply the method to EEG data to demonstrate its empirical usefulness.

  10. Bistatic scattering from a three-dimensional object above a two-dimensional randomly rough surface modeled with the parallel FDTD approach.

    Science.gov (United States)

    Guo, L-X; Li, J; Zeng, H

    2009-11-01

    We present an investigation of the electromagnetic scattering from a three-dimensional (3-D) object above a two-dimensional (2-D) randomly rough surface. A Message Passing Interface-based parallel finite-difference time-domain (FDTD) approach is used, and the uniaxial perfectly matched layer (UPML) medium is adopted for truncation of the FDTD lattices, in which the finite-difference equations can be used for the total computation domain by properly choosing the uniaxial parameters. This makes the parallel FDTD algorithm easier to implement. The parallel performance with different number of processors is illustrated for one rough surface realization and shows that the computation time of our parallel FDTD algorithm is dramatically reduced relative to a single-processor implementation. Finally, the composite scattering coefficients versus scattered and azimuthal angle are presented and analyzed for different conditions, including the surface roughness, the dielectric constants, the polarization, and the size of the 3-D object.

  11. Chimera patterns in two-dimensional networks of coupled neurons

    Science.gov (United States)

    Schmidt, Alexander; Kasimatis, Theodoros; Hizanidis, Johanne; Provata, Astero; Hövel, Philipp

    2017-03-01

    We discuss synchronization patterns in networks of FitzHugh-Nagumo and leaky integrate-and-fire oscillators coupled in a two-dimensional toroidal geometry. A common feature between the two models is the presence of fast and slow dynamics, a typical characteristic of neurons. Earlier studies have demonstrated that both models when coupled nonlocally in one-dimensional ring networks produce chimera states for a large range of parameter values. In this study, we give evidence of a plethora of two-dimensional chimera patterns of various shapes, including spots, rings, stripes, and grids, observed in both models, as well as additional patterns found mainly in the FitzHugh-Nagumo system. Both systems exhibit multistability: For the same parameter values, different initial conditions give rise to different dynamical states. Transitions occur between various patterns when the parameters (coupling range, coupling strength, refractory period, and coupling phase) are varied. Many patterns observed in the two models follow similar rules. For example, the diameter of the rings grows linearly with the coupling radius.

  12. Parallel Factor-Based Model for Two-Dimensional Direction Estimation

    Directory of Open Access Journals (Sweden)

    Nizar Tayem

    2017-01-01

    Full Text Available Two-dimensional (2D Direction-of-Arrivals (DOA estimation for elevation and azimuth angles assuming noncoherent, mixture of coherent and noncoherent, and coherent sources using extended three parallel uniform linear arrays (ULAs is proposed. Most of the existing schemes have drawbacks in estimating 2D DOA for multiple narrowband incident sources as follows: use of large number of snapshots, estimation failure problem for elevation and azimuth angles in the range of typical mobile communication, and estimation of coherent sources. Moreover, the DOA estimation for multiple sources requires complex pair-matching methods. The algorithm proposed in this paper is based on first-order data matrix to overcome these problems. The main contributions of the proposed method are as follows: (1 it avoids estimation failure problem using a new antenna configuration and estimates elevation and azimuth angles for coherent sources; (2 it reduces the estimation complexity by constructing Toeplitz data matrices, which are based on a single or few snapshots; (3 it derives parallel factor (PARAFAC model to avoid pair-matching problems between multiple sources. Simulation results demonstrate the effectiveness of the proposed algorithm.

  13. Parallel and Multivalued Logic by the Two-Dimensional Photon-Echo Response of a Rhodamine–DNA Complex

    Science.gov (United States)

    2015-01-01

    Implementing parallel and multivalued logic operations at the molecular scale has the potential to improve the miniaturization and efficiency of a new generation of nanoscale computing devices. Two-dimensional photon-echo spectroscopy is capable of resolving dynamical pathways on electronic and vibrational molecular states. We experimentally demonstrate the implementation of molecular decision trees, logic operations where all possible values of inputs are processed in parallel and the outputs are read simultaneously, by probing the laser-induced dynamics of populations and coherences in a rhodamine dye mounted on a short DNA duplex. The inputs are provided by the bilinear interactions between the molecule and the laser pulses, and the output values are read from the two-dimensional molecular response at specific frequencies. Our results highlights how ultrafast dynamics between multiple molecular states induced by light–matter interactions can be used as an advantage for performing complex logic operations in parallel, operations that are faster than electrical switching. PMID:25984269

  14. Large Scale Parallel DNA Detection by Two-Dimensional Solid-State Multipore Systems.

    Science.gov (United States)

    Athreya, Nagendra Bala Murali; Sarathy, Aditya; Leburton, Jean-Pierre

    2018-04-23

    We describe a scalable device design of a dense array of multiple nanopores made from nanoscale semiconductor materials to detect and identify translocations of many biomolecules in a massively parallel detection scheme. We use molecular dynamics coupled to nanoscale device simulations to illustrate the ability of this device setup to uniquely identify DNA parallel translocations. We show that the transverse sheet currents along membranes are immune to the crosstalk effects arising from simultaneous translocations of biomolecules through multiple pores, due to their ability to sense only the local potential changes. We also show that electronic sensing across the nanopore membrane offers a higher detection resolution compared to ionic current blocking technique in a multipore setup, irrespective of the irregularities that occur while fabricating the nanopores in a two-dimensional membrane.

  15. Chimera states in two-dimensional networks of locally coupled oscillators

    Science.gov (United States)

    Kundu, Srilena; Majhi, Soumen; Bera, Bidesh K.; Ghosh, Dibakar; Lakshmanan, M.

    2018-02-01

    Chimera state is defined as a mixed type of collective state in which synchronized and desynchronized subpopulations of a network of coupled oscillators coexist and the appearance of such anomalous behavior has strong connection to diverse neuronal developments. Most of the previous studies on chimera states are not extensively done in two-dimensional ensembles of coupled oscillators by taking neuronal systems with nonlinear coupling function into account while such ensembles of oscillators are more realistic from a neurobiological point of view. In this paper, we report the emergence and existence of chimera states by considering locally coupled two-dimensional networks of identical oscillators where each node is interacting through nonlinear coupling function. This is in contrast with the existence of chimera states in two-dimensional nonlocally coupled oscillators with rectangular kernel in the coupling function. We find that the presence of nonlinearity in the coupling function plays a key role to produce chimera states in two-dimensional locally coupled oscillators. We analytically verify explicitly in the case of a network of coupled Stuart-Landau oscillators in two dimensions that the obtained results using Ott-Antonsen approach and our analytical finding very well matches with the numerical results. Next, we consider another type of important nonlinear coupling function which exists in neuronal systems, namely chemical synaptic function, through which the nearest-neighbor (locally coupled) neurons interact with each other. It is shown that such synaptic interacting function promotes the emergence of chimera states in two-dimensional lattices of locally coupled neuronal oscillators. In numerical simulations, we consider two paradigmatic neuronal oscillators, namely Hindmarsh-Rose neuron model and Rulkov map for each node which exhibit bursting dynamics. By associating various spatiotemporal behaviors and snapshots at particular times, we study the chimera

  16. A parallel algorithm for the two-dimensional time fractional diffusion equation with implicit difference method.

    Science.gov (United States)

    Gong, Chunye; Bao, Weimin; Tang, Guojian; Jiang, Yuewen; Liu, Jie

    2014-01-01

    It is very time consuming to solve fractional differential equations. The computational complexity of two-dimensional fractional differential equation (2D-TFDE) with iterative implicit finite difference method is O(M(x)M(y)N(2)). In this paper, we present a parallel algorithm for 2D-TFDE and give an in-depth discussion about this algorithm. A task distribution model and data layout with virtual boundary are designed for this parallel algorithm. The experimental results show that the parallel algorithm compares well with the exact solution. The parallel algorithm on single Intel Xeon X5540 CPU runs 3.16-4.17 times faster than the serial algorithm on single CPU core. The parallel efficiency of 81 processes is up to 88.24% compared with 9 processes on a distributed memory cluster system. We do think that the parallel computing technology will become a very basic method for the computational intensive fractional applications in the near future.

  17. Globally homochiral assembly of two-dimensional molecular networks triggered by co-absorbers.

    Science.gov (United States)

    Chen, Ting; Yang, Wen-Hong; Wang, Dong; Wan, Li-Jun

    2013-01-01

    Understanding the chirality induction and amplification processes, and the construction of globally homochiral surfaces, represent essential challenges in surface chirality studies. Here we report the induction of global homochirality in two-dimensional enantiomorphous networks of achiral molecules via co-assembly with chiral co-absorbers. The scanning tunnelling microscopy investigations and molecular mechanics simulations demonstrate that the point chirality of the co-absorbers transfers to organizational chirality of the assembly units via enantioselective supramolecular interactions, and is then hierarchically amplified to the global homochirality of two-dimensional networks. The global homochirality of the network assembly shows nonlinear dependence on the enantiomeric excess of chiral co-absorber in the solution phase, demonstrating, for the first time, the validation of the 'majority rules' for the homochirality control of achiral molecules at the liquid/solid interface. Such an induction and nonlinear chirality amplification effect promises a new approach towards two-dimensional homochirality control and may reveal important insights into asymmetric heterogeneous catalysis, chiral separation and chiral crystallization.

  18. Applications of the parallel computing system using network

    International Nuclear Information System (INIS)

    Ido, Shunji; Hasebe, Hiroki

    1994-01-01

    Parallel programming is applied to multiple processors connected in Ethernet. Data exchanges between tasks located in each processing element are realized by two ways. One is socket which is standard library on recent UNIX operating systems. Another is a network connecting software, named as Parallel Virtual Machine (PVM) which is a free software developed by ORNL, to use many workstations connected to network as a parallel computer. This paper discusses the availability of parallel computing using network and UNIX workstations and comparison between specialized parallel systems (Transputer and iPSC/860) in a Monte Carlo simulation which generally shows high parallelization ratio. (author)

  19. Metabolic profiling based on two-dimensional J-resolved 1H NMR data and parallel factor analysis

    DEFF Research Database (Denmark)

    Yilmaz, Ali; Nyberg, Nils T; Jaroszewski, Jerzy W.

    2011-01-01

    the intensity variances along the chemical shift axis are taken into account. Here, we describe the use of parallel factor analysis (PARAFAC) as a tool to preprocess a set of two-dimensional J-resolved spectra with the aim of keeping the J-coupling information intact. PARAFAC is a mathematical decomposition......-model was done automatically by evaluating amount of explained variance and core consistency values. Score plots showing the distribution of objects in relation to each other, and loading plots in the form of two-dimensional pseudo-spectra with the same appearance as the original J-resolved spectra...

  20. Topotactic transformations of superstructures: from thin films to two-dimensional networks to nested two-dimensional networks.

    Science.gov (United States)

    Guo, Chuan Fei; Cao, Sihai; Zhang, Jianming; Tang, Haoying; Guo, Shengming; Tian, Ye; Liu, Qian

    2011-06-01

    Design and synthesis of super-nanostructures is one of the key and prominent topics in nanotechnology. Here we propose a novel methodology for synthesizing complex hierarchical superstructures using sacrificial templates composed of ordered two-dimensional (2D) nanostructures through lattice-directed topotactic transformations. The fabricated superstructures are nested 2D orthogonal Bi(2)S(3) networks composed of nanorods. Further investigation indicates that the lattice matching between the product and sacrificial template is the dominant mechanism for the formation of the superstructures, which agrees well with the simulation results based on an anisotropic nucleation and growth analysis. Our approach may provide a promising way toward a lattice-directed nonlithographic nanofabrication technique for making functional porous nanoarchitectures and electronic devices. © 2011 American Chemical Society

  1. Two-dimensional evaluation of an ion plasma produced by pulsed lasers extracted by non-parallel collectors

    International Nuclear Information System (INIS)

    Mahdieh, M H; Gavili, A

    2003-01-01

    Two-dimensional hydrodynamics of ion extraction from quasi-neutral plasmas has been calculated numerically for non-parallel ion extractors, and the results compared with those for the parallel case. The ions were assumed to be initially uniform with a very steep density profile at the boundaries, and held between two non-parallel metal plates as cathode and anode with fixed potentials. Experimentally, tunable pulsed lasers through stepwise photo-excitation and photo-ionization or multi-photo-ionization processes can produce such plasma. Poisson's equation was solved simultaneously with the equations of mass and momentum, assuming the Maxwell-Boltzmann distribution for electrons. Ordinary Cartesian co-ordinates are not suitable for the rotated extractor geometry; therefore using the 'algebraic method' a transformation from the physical domain into the computational rectangular plane is applied for analysing the irregular boundaries. Such a technique provides adequate resolution for the boundary layer. Using a first-order explicit upwind differencing in an appropriate transformed Cartesian co-ordinate system, the hydrodynamics of the plasma ions between the two non-parallel electrodes was evaluated. In these calculations electric potential, ion density between the two electrodes, and the extraction time were assessed, considering three separate regions for the plasma, i.e. the ion sheath where (n i >>n e ∼0), the transition region (pre-sheath) (n i = n e ), and the quasi-neutral plasma (n i -n e i ). The results were compared with those for parallel electrodes. A significant discrepancy was found between the two results. From the calculation, the non-uniform asymmetric potential contour, and the ion density contour across the plasma, were obtained for the non-parallel electrodes. For comparison with the parallel extractors, we have also obtained almost the same extraction time for the non-parallel extractors

  2. Functional Parallel Factor Analysis for Functions of One- and Two-dimensional Arguments

    NARCIS (Netherlands)

    Choi, Ji Yeh; Hwang, Heungsun; Timmerman, Marieke

    Parallel factor analysis (PARAFAC) is a useful multivariate method for decomposing three-way data that consist of three different types of entities simultaneously. This method estimates trilinear components, each of which is a low-dimensional representation of a set of entities, often called a mode,

  3. How to cluster in parallel with neural networks

    Science.gov (United States)

    Kamgar-Parsi, Behzad; Gualtieri, J. A.; Devaney, Judy E.; Kamgar-Parsi, Behrooz

    1988-01-01

    Partitioning a set of N patterns in a d-dimensional metric space into K clusters - in a way that those in a given cluster are more similar to each other than the rest - is a problem of interest in astrophysics, image analysis and other fields. As there are approximately K(N)/K (factorial) possible ways of partitioning the patterns among K clusters, finding the best solution is beyond exhaustive search when N is large. Researchers show that this problem can be formulated as an optimization problem for which very good, but not necessarily optimal solutions can be found by using a neural network. To do this the network must start from many randomly selected initial states. The network is simulated on the MPP (a 128 x 128 SIMD array machine), where researchers use the massive parallelism not only in solving the differential equations that govern the evolution of the network, but also by starting the network from many initial states at once, thus obtaining many solutions in one run. Researchers obtain speedups of two to three orders of magnitude over serial implementations and the promise through Analog VLSI implementations of speedups comensurate with human perceptual abilities.

  4. Separation prediction in two dimensional boundary layer flows using artificial neural networks

    International Nuclear Information System (INIS)

    Sabetghadam, F.; Ghomi, H.A.

    2003-01-01

    In this article, the ability of artificial neural networks in prediction of separation in steady two dimensional boundary layer flows is studied. Data for network training is extracted from numerical solution of an ODE obtained from Von Karman integral equation with approximate one parameter Pohlhousen velocity profile. As an appropriate neural network, a two layer radial basis generalized regression artificial neural network is used. The results shows good agreements between the overall behavior of the flow fields predicted by the artificial neural network and the actual flow fields for some cases. The method easily can be extended to unsteady separation and turbulent as well as compressible boundary layer flows. (author)

  5. MEDUSA - An overset grid flow solver for network-based parallel computer systems

    Science.gov (United States)

    Smith, Merritt H.; Pallis, Jani M.

    1993-01-01

    Continuing improvement in processing speed has made it feasible to solve the Reynolds-Averaged Navier-Stokes equations for simple three-dimensional flows on advanced workstations. Combining multiple workstations into a network-based heterogeneous parallel computer allows the application of programming principles learned on MIMD (Multiple Instruction Multiple Data) distributed memory parallel computers to the solution of larger problems. An overset-grid flow solution code has been developed which uses a cluster of workstations as a network-based parallel computer. Inter-process communication is provided by the Parallel Virtual Machine (PVM) software. Solution speed equivalent to one-third of a Cray-YMP processor has been achieved from a cluster of nine commonly used engineering workstation processors. Load imbalance and communication overhead are the principal impediments to parallel efficiency in this application.

  6. Fractal geometry of two-dimensional fracture networks at Yucca Mountain, southwestern Nevada: proceedings

    International Nuclear Information System (INIS)

    Barton, C.C.; Larsen, E.

    1985-01-01

    Fracture traces exposed on three 214- to 260-m 2 pavements in the same Miocene ash-flow tuff at Yucca Mountain, southwestern Nevada, have been mapped at a scale of 1:50. The maps are two-dimensional sections through the three-dimensional network of strata-bound fractures. All fractures with trace lengths greater than 0.20 m were mapped. The distribution of fracture-trace lengths is log-normal. The fractures do not exhibit well-defined sets based on orientation. Since fractal characterization of such complex fracture-trace networks may prove useful for modeling fracture flow and mechanical responses of fractured rock, an analysis of each of the three maps was done to test whether such networks are fractal. These networks proved to be fractal and the fractal dimensions (D) are tightly clustered (1.12, 1.14, 1.16) for three laterally separated pavements, even though visually the fracture networks appear quite different. The fractal analysis also indicates that the network patterns are scale independent over two orders of magnitude for trace lengths ranging from 0.20 to 25 m. 7 refs., 7 figs

  7. Parallel processing data network of master and slave transputers controlled by a serial control network

    Science.gov (United States)

    Crosetto, Dario B.

    1996-01-01

    The present device provides for a dynamically configurable communication network having a multi-processor parallel processing system having a serial communication network and a high speed parallel communication network. The serial communication network is used to disseminate commands from a master processor (100) to a plurality of slave processors (200) to effect communication protocol, to control transmission of high density data among nodes and to monitor each slave processor's status. The high speed parallel processing network is used to effect the transmission of high density data among nodes in the parallel processing system. Each node comprises a transputer (104), a digital signal processor (114), a parallel transfer controller (106), and two three-port memory devices. A communication switch (108) within each node (100) connects it to a fast parallel hardware channel (70) through which all high density data arrives or leaves the node.

  8. Parallel Implementation of Triangular Cellular Automata for Computing Two-Dimensional Elastodynamic Response on Arbitrary Domains

    Science.gov (United States)

    Leamy, Michael J.; Springer, Adam C.

    In this research we report parallel implementation of a Cellular Automata-based simulation tool for computing elastodynamic response on complex, two-dimensional domains. Elastodynamic simulation using Cellular Automata (CA) has recently been presented as an alternative, inherently object-oriented technique for accurately and efficiently computing linear and nonlinear wave propagation in arbitrarily-shaped geometries. The local, autonomous nature of the method should lead to straight-forward and efficient parallelization. We address this notion on symmetric multiprocessor (SMP) hardware using a Java-based object-oriented CA code implementing triangular state machines (i.e., automata) and the MPI bindings written in Java (MPJ Express). We use MPJ Express to reconfigure our existing CA code to distribute a domain's automata to cores present on a dual quad-core shared-memory system (eight total processors). We note that this message passing parallelization strategy is directly applicable to computer clustered computing, which will be the focus of follow-on research. Results on the shared memory platform indicate nearly-ideal, linear speed-up. We conclude that the CA-based elastodynamic simulator is easily configured to run in parallel, and yields excellent speed-up on SMP hardware.

  9. Tunneling between parallel two-dimensional electron liquids

    Czech Academy of Sciences Publication Activity Database

    Jungwirth, Tomáš; MacDonald, A. H.

    361/362, - (1996), s. 167-170 ISSN 0039-6028. [International Conference on the Electronic Properties of Two Dimensional Systems /11./. Nottingham, 07.08.1995-11.08.1995] R&D Projects: GA ČR GA202/94/1278 Grant - others:INT(XX) 9106888 Impact factor: 2.783, year: 1996

  10. Parallel computation of aerodynamic influence coefficients for aeroelastic analysis on a transputer network

    Science.gov (United States)

    Janetzke, D. C.; Murthy, D. V.

    1991-01-01

    Aeroelastic analysis is mult-disciplinary and computationally expensive. Hence, it can greatly benefit from parallel processing. As part of an effort to develop an aeroelastic analysis capability on a distributed-memory transputer network, a parallel algorithm for the computation of aerodynamic influence coefficients is implemented on a network of 32 transputers. The aerodynamic influence coefficients are calculated using a three-dimensional unsteady aerodynamic model and a panel discretization. Efficiencies up to 85 percent are demonstrated using 32 processors. The effects of subtask ordering, problem size and network topology are presented. A comparison to results on a shared-memory computer indicates that higher speedup is achieved on the distributed-memory system.

  11. Parallel computing and networking; Heiretsu keisanki to network

    Energy Technology Data Exchange (ETDEWEB)

    Asakawa, E; Tsuru, T [Japan National Oil Corp., Tokyo (Japan); Matsuoka, T [Japan Petroleum Exploration Co. Ltd., Tokyo (Japan)

    1996-05-01

    This paper describes the trend of parallel computers used in geophysical exploration. Around 1993 was the early days when the parallel computers began to be used for geophysical exploration. Classification of these computers those days was mainly MIMD (multiple instruction stream, multiple data stream), SIMD (single instruction stream, multiple data stream) and the like. Parallel computers were publicized in the 1994 meeting of the Geophysical Exploration Society as a `high precision imaging technology`. Concerning the library of parallel computers, there was a shift to PVM (parallel virtual machine) in 1993 and to MPI (message passing interface) in 1995. In addition, the compiler of FORTRAN90 was released with support implemented for data parallel and vector computers. In 1993, networks used were Ethernet, FDDI, CDDI and HIPPI. In 1995, the OC-3 products under ATM began to propagate. However, ATM remains to be an interoffice high speed network because the ATM service has not spread yet for the public network. 1 ref.

  12. Two-dimensional superconducting state of monolayer Pb films grown on GaAs(110) in a strong parallel magnetic field.

    Science.gov (United States)

    Sekihara, Takayuki; Masutomi, Ryuichi; Okamoto, Tohru

    2013-08-02

    Two-dimensional (2D) superconductivity was studied by magnetotransport measurements on single-atomic-layer Pb films on a cleaved GaAs(110) surface. The superconducting transition temperature shows only a weak dependence on the parallel magnetic field up to 14T, which is higher than the Pauli paramagnetic limit. Furthermore, the perpendicular-magnetic-field dependence of the sheet resistance is almost independent of the presence of the parallel field component. These results are explained in terms of an inhomogeneous superconducting state predicted for 2D metals with a large Rashba spin splitting.

  13. Parallel consensual neural networks.

    Science.gov (United States)

    Benediktsson, J A; Sveinsson, J R; Ersoy, O K; Swain, P H

    1997-01-01

    A new type of a neural-network architecture, the parallel consensual neural network (PCNN), is introduced and applied in classification/data fusion of multisource remote sensing and geographic data. The PCNN architecture is based on statistical consensus theory and involves using stage neural networks with transformed input data. The input data are transformed several times and the different transformed data are used as if they were independent inputs. The independent inputs are first classified using the stage neural networks. The output responses from the stage networks are then weighted and combined to make a consensual decision. In this paper, optimization methods are used in order to weight the outputs from the stage networks. Two approaches are proposed to compute the data transforms for the PCNN, one for binary data and another for analog data. The analog approach uses wavelet packets. The experimental results obtained with the proposed approach show that the PCNN outperforms both a conjugate-gradient backpropagation neural network and conventional statistical methods in terms of overall classification accuracy of test data.

  14. Parallel SN transport calculations on a transputer network

    International Nuclear Information System (INIS)

    Kim, Yong Hee; Cho, Nam Zin

    1994-01-01

    A parallel computing algorithm for the neutron transport problems has been implemented on a transputer network and two reactor benchmark problems (a fixed-source problem and an eigenvalue problem) are solved. We have shown that the parallel calculations provided significant reduction in execution time over the sequential calculations

  15. Mining nutrigenetics patterns related to obesity: use of parallel multifactor dimensionality reduction.

    Science.gov (United States)

    Karayianni, Katerina N; Grimaldi, Keith A; Nikita, Konstantina S; Valavanis, Ioannis K

    2015-01-01

    This paper aims to enlighten the complex etiology beneath obesity by analysing data from a large nutrigenetics study, in which nutritional and genetic factors associated with obesity were recorded for around two thousand individuals. In our previous work, these data have been analysed using artificial neural network methods, which identified optimised subsets of factors to predict one's obesity status. These methods did not reveal though how the selected factors interact with each other in the obtained predictive models. For that reason, parallel Multifactor Dimensionality Reduction (pMDR) was used here to further analyse the pre-selected subsets of nutrigenetic factors. Within pMDR, predictive models using up to eight factors were constructed, further reducing the input dimensionality, while rules describing the interactive effects of the selected factors were derived. In this way, it was possible to identify specific genetic variations and their interactive effects with particular nutritional factors, which are now under further study.

  16. [Three-dimensional parallel collagen scaffold promotes tendon extracellular matrix formation].

    Science.gov (United States)

    Zheng, Zefeng; Shen, Weiliang; Le, Huihui; Dai, Xuesong; Ouyang, Hongwei; Chen, Weishan

    2016-03-01

    To investigate the effects of three-dimensional parallel collagen scaffold on the cell shape, arrangement and extracellular matrix formation of tendon stem cells. Parallel collagen scaffold was fabricated by unidirectional freezing technique, while random collagen scaffold was fabricated by freeze-drying technique. The effects of two scaffolds on cell shape and extracellular matrix formation were investigated in vitro by seeding tendon stem/progenitor cells and in vivo by ectopic implantation. Parallel and random collagen scaffolds were produced successfully. Parallel collagen scaffold was more akin to tendon than random collagen scaffold. Tendon stem/progenitor cells were spindle-shaped and unified orientated in parallel collagen scaffold, while cells on random collagen scaffold had disorder orientation. Two weeks after ectopic implantation, cells had nearly the same orientation with the collagen substance. In parallel collagen scaffold, cells had parallel arrangement, and more spindly cells were observed. By contrast, cells in random collagen scaffold were disorder. Parallel collagen scaffold can induce cells to be in spindly and parallel arrangement, and promote parallel extracellular matrix formation; while random collagen scaffold can induce cells in random arrangement. The results indicate that parallel collagen scaffold is an ideal structure to promote tendon repairing.

  17. A solution for two-dimensional mazes with use of chaotic dynamics in a recurrent neural network model.

    Science.gov (United States)

    Suemitsu, Yoshikazu; Nara, Shigetoshi

    2004-09-01

    Chaotic dynamics introduced into a neural network model is applied to solving two-dimensional mazes, which are ill-posed problems. A moving object moves from the position at t to t + 1 by simply defined motion function calculated from firing patterns of the neural network model at each time step t. We have embedded several prototype attractors that correspond to the simple motion of the object orienting toward several directions in two-dimensional space in our neural network model. Introducing chaotic dynamics into the network gives outputs sampled from intermediate state points between embedded attractors in a state space, and these dynamics enable the object to move in various directions. System parameter switching between a chaotic and an attractor regime in the state space of the neural network enables the object to move to a set target in a two-dimensional maze. Results of computer simulations show that the success rate for this method over 300 trials is higher than that of random walk. To investigate why the proposed method gives better performance, we calculate and discuss statistical data with respect to dynamical structure.

  18. The parallel implementation of a backpropagation neural network and its applicability to SPECT image reconstruction

    Energy Technology Data Exchange (ETDEWEB)

    Kerr, John Patrick [Iowa State Univ., Ames, IA (United States)

    1992-01-01

    The objective of this study was to determine the feasibility of using an Artificial Neural Network (ANN), in particular a backpropagation ANN, to improve the speed and quality of the reconstruction of three-dimensional SPECT (single photon emission computed tomography) images. In addition, since the processing elements (PE)s in each layer of an ANN are independent of each other, the speed and efficiency of the neural network architecture could be better optimized by implementing the ANN on a massively parallel computer. The specific goals of this research were: to implement a fully interconnected backpropagation neural network on a serial computer and a SIMD parallel computer, to identify any reduction in the time required to train these networks on the parallel machine versus the serial machine, to determine if these neural networks can learn to recognize SPECT data by training them on a section of an actual SPECT image, and to determine from the knowledge obtained in this research if full SPECT image reconstruction by an ANN implemented on a parallel computer is feasible both in time required to train the network, and in quality of the images reconstructed.

  19. A Two-dimensional Version of the Niblett-Bostick Transformation for Magnetotelluric Interpretations

    Science.gov (United States)

    Esparza, F.

    2005-05-01

    An imaging technique for two-dimensional magnetotelluric interpretations is developed following the well known Niblett-Bostick transformation for one-dimensional profiles. The algorithm uses a Hopfield artificial neural network to process series and parallel magnetotelluric impedances along with their analytical influence functions. The adaptive, weighted average approximation preserves part of the nonlinearity of the original problem. No initial model in the usual sense is required for the recovery of a functional model. Rather, the built-in relationship between model and data considers automatically, all at the same time, many half spaces whose electrical conductivities vary according to the data. The use of series and parallel impedances, a self-contained pair of invariants of the impedance tensor, avoids the need to decide on best angles of rotation for TE and TM separations. Field data from a given profile can thus be fed directly into the algorithm without much processing. The solutions offered by the Hopfield neural network correspond to spatial averages computed through rectangular windows that can be chosen at will. Applications of the algorithm to simple synthetic models and to the COPROD2 data set illustrate the performance of the approximation.

  20. Parallelization of a three-dimensional whole core transport code DeCART

    Energy Technology Data Exchange (ETDEWEB)

    Jin Young, Cho; Han Gyu, Joo; Ha Yong, Kim; Moon-Hee, Chang [Korea Atomic Energy Research Institute, Yuseong-gu, Daejon (Korea, Republic of)

    2003-07-01

    Parallelization of the DeCART (deterministic core analysis based on ray tracing) code is presented that reduces the computational burden of the tremendous computing time and memory required in three-dimensional whole core transport calculations. The parallelization employs the concept of MPI grouping and the MPI/OpenMP mixed scheme as well. Since most of the computing time and memory are used in MOC (method of characteristics) and the multi-group CMFD (coarse mesh finite difference) calculation in DeCART, variables and subroutines related to these two modules are the primary targets for parallelization. Specifically, the ray tracing module was parallelized using a planar domain decomposition scheme and an angular domain decomposition scheme. The parallel performance of the DeCART code is evaluated by solving a rodded variation of the C5G7MOX three dimensional benchmark problem and a simplified three-dimensional SMART PWR core problem. In C5G7MOX problem with 24 CPUs, a speedup of maximum 21 is obtained on an IBM Regatta machine and 22 on a LINUX Cluster in the MOC kernel, which indicates good parallel performance of the DeCART code. In the simplified SMART problem, the memory requirement of about 11 GBytes in the single processor cases reduces to 940 Mbytes with 24 processors, which means that the DeCART code can now solve large core problems with affordable LINUX clusters. (authors)

  1. Graphene-based field effect transistor in two-dimensional paper networks

    Energy Technology Data Exchange (ETDEWEB)

    Cagang, Aldrine Abenoja; Abidi, Irfan Haider; Tyagi, Abhishek [Department of Chemical and Biomolecular Engineering, Hong Kong University of Science and Technology, Clear Water Bay (Hong Kong); Hu, Jie; Xu, Feng [Bioinspired Engineering and Biomechanics Center (BEBC), Xi' an Jiaotong University, Xi' an 710049 (China); The Key Laboratory of Biomedical Information Engineering of Ministry of Education, School of Life Science and Technology, Xi' an Jiaotong University, Xi' an 710049 (China); Lu, Tian Jian [Bioinspired Engineering and Biomechanics Center (BEBC), Xi' an Jiaotong University, Xi' an 710049 (China); Luo, Zhengtang, E-mail: keztluo@ust.hk [Department of Chemical and Biomolecular Engineering, Hong Kong University of Science and Technology, Clear Water Bay (Hong Kong)

    2016-04-21

    We demonstrate the fabrication of a graphene-based field effect transistor (GFET) incorporated in a two-dimensional paper network format (2DPNs). Paper serves as both a gate dielectric and an easy-to-fabricate vessel for holding the solution with the target molecules in question. The choice of paper enables a simpler alternative approach to the construction of a GFET device. The fabricated device is shown to behave similarly to a solution-gated GFET device with electron and hole mobilities of ∼1256 cm{sup 2} V{sup −1} s{sup −1} and ∼2298 cm{sup 2} V{sup −1} s{sup −1} respectively and a Dirac point around ∼1 V. When using solutions of ssDNA and glucose it was found that the added molecules induce negative electrolytic gating effects shifting the conductance minimum to the right, concurrent with increasing carrier concentrations which results to an observed increase in current response correlated to the concentration of the solution used. - Highlights: • A graphene-based field effect transistor sensor was fabricated for two-dimensional paper network formats. • The constructed GFET on 2DPN was shown to behave similarly to solution-gated GFETs. • Electrolyte gating effects have more prominent effect over adsorption effects on the behavior of the device. • The GFET incorporated on 2DPN was shown to yield linear response to presence of glucose and ssDNA soaked inside the paper.

  2. Graphene-based field effect transistor in two-dimensional paper networks

    International Nuclear Information System (INIS)

    Cagang, Aldrine Abenoja; Abidi, Irfan Haider; Tyagi, Abhishek; Hu, Jie; Xu, Feng; Lu, Tian Jian; Luo, Zhengtang

    2016-01-01

    We demonstrate the fabrication of a graphene-based field effect transistor (GFET) incorporated in a two-dimensional paper network format (2DPNs). Paper serves as both a gate dielectric and an easy-to-fabricate vessel for holding the solution with the target molecules in question. The choice of paper enables a simpler alternative approach to the construction of a GFET device. The fabricated device is shown to behave similarly to a solution-gated GFET device with electron and hole mobilities of ∼1256 cm 2  V −1  s −1 and ∼2298 cm 2  V −1  s −1 respectively and a Dirac point around ∼1 V. When using solutions of ssDNA and glucose it was found that the added molecules induce negative electrolytic gating effects shifting the conductance minimum to the right, concurrent with increasing carrier concentrations which results to an observed increase in current response correlated to the concentration of the solution used. - Highlights: • A graphene-based field effect transistor sensor was fabricated for two-dimensional paper network formats. • The constructed GFET on 2DPN was shown to behave similarly to solution-gated GFETs. • Electrolyte gating effects have more prominent effect over adsorption effects on the behavior of the device. • The GFET incorporated on 2DPN was shown to yield linear response to presence of glucose and ssDNA soaked inside the paper.

  3. Transfer of optical signals around bends in two-dimensional linear photonic networks

    International Nuclear Information System (INIS)

    Nikolopoulos, G M

    2015-01-01

    The ability to navigate light signals in two-dimensional networks of waveguide arrays is a prerequisite for the development of all-optical integrated circuits for information processing and networking. In this article, we present a theoretical analysis of bending losses in linear photonic lattices with engineered couplings, and discuss possible ways for their minimization. In contrast to previous work in the field, the lattices under consideration operate in the linear regime, in the sense that discrete solitons cannot exist. The present results suggest that the functionality of linear waveguide networks can be extended to operations that go beyond the recently demonstrated point-to-point transfer of signals, such as blocking, routing, logic functions, etc. (paper)

  4. Calculating electronic tunnel currents in networks of disordered irregularly shaped nanoparticles by mapping networks to arrays of parallel nonlinear resistors

    Energy Technology Data Exchange (ETDEWEB)

    Aghili Yajadda, Mir Massoud [CSIRO Manufacturing Flagship, P.O. Box 218, Lindfield NSW 2070 (Australia)

    2014-10-21

    We have shown both theoretically and experimentally that tunnel currents in networks of disordered irregularly shaped nanoparticles (NPs) can be calculated by considering the networks as arrays of parallel nonlinear resistors. Each resistor is described by a one-dimensional or a two-dimensional array of equal size nanoparticles that the tunnel junction gaps between nanoparticles in each resistor is assumed to be equal. The number of tunnel junctions between two contact electrodes and the tunnel junction gaps between nanoparticles are found to be functions of Coulomb blockade energies. In addition, the tunnel barriers between nanoparticles were considered to be tilted at high voltages. Furthermore, the role of thermal expansion coefficient of the tunnel junction gaps on the tunnel current is taken into account. The model calculations fit very well to the experimental data of a network of disordered gold nanoparticles, a forest of multi-wall carbon nanotubes, and a network of few-layer graphene nanoplates over a wide temperature range (5-300 K) at low and high DC bias voltages (0.001 mV–50 V). Our investigations indicate, although electron cotunneling in networks of disordered irregularly shaped NPs may occur, non-Arrhenius behavior at low temperatures cannot be described by the cotunneling model due to size distribution in the networks and irregular shape of nanoparticles. Non-Arrhenius behavior of the samples at zero bias voltage limit was attributed to the disorder in the samples. Unlike the electron cotunneling model, we found that the crossover from Arrhenius to non-Arrhenius behavior occurs at two temperatures, one at a high temperature and the other at a low temperature.

  5. Parallel numerical modeling of hybrid-dimensional compositional non-isothermal Darcy flows in fractured porous media

    Science.gov (United States)

    Xing, F.; Masson, R.; Lopez, S.

    2017-09-01

    This paper introduces a new discrete fracture model accounting for non-isothermal compositional multiphase Darcy flows and complex networks of fractures with intersecting, immersed and non-immersed fractures. The so called hybrid-dimensional model using a 2D model in the fractures coupled with a 3D model in the matrix is first derived rigorously starting from the equi-dimensional matrix fracture model. Then, it is discretized using a fully implicit time integration combined with the Vertex Approximate Gradient (VAG) finite volume scheme which is adapted to polyhedral meshes and anisotropic heterogeneous media. The fully coupled systems are assembled and solved in parallel using the Single Program Multiple Data (SPMD) paradigm with one layer of ghost cells. This strategy allows for a local assembly of the discrete systems. An efficient preconditioner is implemented to solve the linear systems at each time step and each Newton type iteration of the simulation. The numerical efficiency of our approach is assessed on different meshes, fracture networks, and physical settings in terms of parallel scalability, nonlinear convergence and linear convergence.

  6. Estimating the hydraulic conductivity of two-dimensional fracture networks

    Science.gov (United States)

    Leung, C. T.; Zimmerman, R. W.

    2010-12-01

    Most oil and gas reservoirs, as well as most potential sites for nuclear waste disposal, are naturally fractured. In these sites, the network of fractures will provide the main path for fluid to flow through the rock mass. In many cases, the fracture density is so high as to make it impractical to model it with a discrete fracture network (DFN) approach. For such rock masses, it would be useful to have recourse to analytical, or semi-analytical, methods to estimate the macroscopic hydraulic conductivity of the fracture network. We have investigated single-phase fluid flow through stochastically generated two-dimensional fracture networks. The centres and orientations of the fractures are uniformly distributed, whereas their lengths follow either a lognormal distribution or a power law distribution. We have considered the case where the fractures in the network each have the same aperture, as well as the case where the aperture of each fracture is directly proportional to the fracture length. The discrete fracture network flow and transport simulator NAPSAC, developed by Serco (Didcot, UK), is used to establish the “true” macroscopic hydraulic conductivity of the network. We then attempt to match this conductivity using a simple estimation method that does not require extensive computation. For our calculations, fracture networks are represented as networks composed of conducting segments (bonds) between nodes. Each bond represents the region of a single fracture between two adjacent intersections with other fractures. We assume that the bonds are arranged on a kagome lattice, with some fraction of the bonds randomly missing. The conductance of each bond is then replaced with some effective conductance, Ceff, which we take to be the arithmetic mean of the individual conductances, averaged over each bond, rather than over each fracture. This is in contrast to the usual approximation used in effective medium theories, wherein the geometric mean is used. Our

  7. Modelling Altitude Information in Two-Dimensional Traffic Networks for Electric Mobility Simulation

    Directory of Open Access Journals (Sweden)

    Diogo Santos

    2016-06-01

    Full Text Available Elevation data is important for electric vehicle simulation. However, traffic simulators are often two-dimensional and do not offer the capability of modelling urban networks taking elevation into account. Specifically, SUMO - Simulation of Urban Mobility, a popular microscopic traffic simulator, relies on networks previously modelled with elevation data as to provide this information during simulations. This work tackles the problem of adding elevation data to urban network models - particularly for the case of the Porto urban network, in Portugal. With this goal in mind, a comparison between different altitude information retrieval approaches is made and a simple tool to annotate network models with altitude data is proposed. The work starts by describing the methodological approach followed during research and development, then describing and analysing its main findings. This description includes an in-depth explanation of the proposed tool. Lastly, this work reviews some related work to the subject.

  8. Toward two-dimensional search engines

    International Nuclear Information System (INIS)

    Ermann, L; Shepelyansky, D L; Chepelianskii, A D

    2012-01-01

    We study the statistical properties of various directed networks using ranking of their nodes based on the dominant vectors of the Google matrix known as PageRank and CheiRank. On average PageRank orders nodes proportionally to a number of ingoing links, while CheiRank orders nodes proportionally to a number of outgoing links. In this way, the ranking of nodes becomes two dimensional which paves the way for the development of two-dimensional search engines of a new type. Statistical properties of information flow on the PageRank–CheiRank plane are analyzed for networks of British, French and Italian universities, Wikipedia, Linux Kernel, gene regulation and other networks. A special emphasis is done for British universities networks using the large database publicly available in the UK. Methods of spam links control are also analyzed. (paper)

  9. Parallel Computation of Unsteady Flows on a Network of Workstations

    Science.gov (United States)

    1997-01-01

    Parallel computation of unsteady flows requires significant computational resources. The utilization of a network of workstations seems an efficient solution to the problem where large problems can be treated at a reasonable cost. This approach requires the solution of several problems: 1) the partitioning and distribution of the problem over a network of workstation, 2) efficient communication tools, 3) managing the system efficiently for a given problem. Of course, there is the question of the efficiency of any given numerical algorithm to such a computing system. NPARC code was chosen as a sample for the application. For the explicit version of the NPARC code both two- and three-dimensional problems were studied. Again both steady and unsteady problems were investigated. The issues studied as a part of the research program were: 1) how to distribute the data between the workstations, 2) how to compute and how to communicate at each node efficiently, 3) how to balance the load distribution. In the following, a summary of these activities is presented. Details of the work have been presented and published as referenced.

  10. Fourier analysis of parallel block-Jacobi splitting with transport synthetic acceleration in two-dimensional geometry

    International Nuclear Information System (INIS)

    Rosa, M.; Warsa, J. S.; Chang, J. H.

    2007-01-01

    A Fourier analysis is conducted in two-dimensional (2D) Cartesian geometry for the discrete-ordinates (SN) approximation of the neutron transport problem solved with Richardson iteration (Source Iteration) and Richardson iteration preconditioned with Transport Synthetic Acceleration (TSA), using the Parallel Block-Jacobi (PBJ) algorithm. The results for the un-accelerated algorithm show that convergence of PBJ can degrade, leading in particular to stagnation of GMRES(m) in problems containing optically thin sub-domains. The results for the accelerated algorithm indicate that TSA can be used to efficiently precondition an iterative method in the optically thin case when implemented in the 'modified' version MTSA, in which only the scattering in the low order equations is reduced by some non-negative factor β<1. (authors)

  11. A method of paralleling computer calculation for two-dimensional kinetic plasma model

    International Nuclear Information System (INIS)

    Brazhnik, V.A.; Demchenko, V.V.; Dem'yanov, V.G.; D'yakov, V.E.; Ol'shanskij, V.V.; Panchenko, V.I.

    1987-01-01

    A method for parallel computer calculation and OSIRIS program complex realizing it and designed for numerical plasma simulation by the macroparticle method are described. The calculation can be carried out either with one or simultaneously with two computers BESM-6, that is provided by some package of interacting programs functioning in every computer. Program interaction in every computer is based on event techniques realized in OS DISPAK. Parallel computer calculation with two BESM-6 computers allows to accelerate the computation 1.5 times

  12. Two-dimensional thermofield bosonization

    International Nuclear Information System (INIS)

    Amaral, R.L.P.G.; Belvedere, L.V.; Rothe, K.D.

    2005-01-01

    The main objective of this paper was to obtain an operator realization for the bosonization of fermions in 1 + 1 dimensions, at finite, non-zero temperature T. This is achieved in the framework of the real-time formalism of Thermofield Dynamics. Formally, the results parallel those of the T = 0 case. The well-known two-dimensional Fermion-Boson correspondences at zero temperature are shown to hold also at finite temperature. To emphasize the usefulness of the operator realization for handling a large class of two-dimensional quantum field-theoretic problems, we contrast this global approach with the cumbersome calculation of the fermion-current two-point function in the imaginary-time formalism and real-time formalisms. The calculations also illustrate the very different ways in which the transmutation from Fermi-Dirac to Bose-Einstein statistics is realized

  13. Two dimensional CCD [charged coupled device] arrays as parallel detectors in electron energy loss and x-ray wavelength dispersive spectroscopy

    International Nuclear Information System (INIS)

    Zaluzec, N.J.

    1988-08-01

    Parallel detection systems for spectroscopy have generally been based upon linear detector arrays. Replacing the linear arrays with two dimensional systems yields more complicated devices; however, there are corresponding benefits which can be realized for both x-ray and electron energy loss spectroscopy. The operational design of these systems, as well as preliminary results from the construction of such a device used for electron spectroscopy, are presented. 10 refs., 8 figs

  14. Decoupling Principle Analysis and Development of a Parallel Three-Dimensional Force Sensor.

    Science.gov (United States)

    Zhao, Yanzhi; Jiao, Leihao; Weng, Dacheng; Zhang, Dan; Zheng, Rencheng

    2016-09-15

    In the development of the multi-dimensional force sensor, dimension coupling is the ubiquitous factor restricting the improvement of the measurement accuracy. To effectively reduce the influence of dimension coupling on the parallel multi-dimensional force sensor, a novel parallel three-dimensional force sensor is proposed using a mechanical decoupling principle, and the influence of the friction on dimension coupling is effectively reduced by making the friction rolling instead of sliding friction. In this paper, the mathematical model is established by combining with the structure model of the parallel three-dimensional force sensor, and the modeling and analysis of mechanical decoupling are carried out. The coupling degree (ε) of the designed sensor is defined and calculated, and the calculation results show that the mechanical decoupling parallel structure of the sensor possesses good decoupling performance. A prototype of the parallel three-dimensional force sensor was developed, and FEM analysis was carried out. The load calibration and data acquisition experiment system are built, and then calibration experiments were done. According to the calibration experiments, the measurement accuracy is less than 2.86% and the coupling accuracy is less than 3.02%. The experimental results show that the sensor system possesses high measuring accuracy, which provides a basis for the applied research of the parallel multi-dimensional force sensor.

  15. Dimensionality of social networks using motifs and eigenvalues.

    Directory of Open Access Journals (Sweden)

    Anthony Bonato

    Full Text Available We consider the dimensionality of social networks, and develop experiments aimed at predicting that dimension. We find that a social network model with nodes and links sampled from an m-dimensional metric space with power-law distributed influence regions best fits samples from real-world networks when m scales logarithmically with the number of nodes of the network. This supports a logarithmic dimension hypothesis, and we provide evidence with two different social networks, Facebook and LinkedIn. Further, we employ two different methods for confirming the hypothesis: the first uses the distribution of motif counts, and the second exploits the eigenvalue distribution.

  16. Parallelization of applications for networks with homogeneous and heterogeneous processors

    International Nuclear Information System (INIS)

    Colombet, L.

    1994-01-01

    The aim of this thesis is to study and develop efficient methods for parallelization of scientific applications on parallel computers with distributed memory. The first part presents two libraries of PVM (Parallel Virtual Machine) and MPI (Message Passing Interface) communication tools. They allow implementation of programs on most parallel machines, but also on heterogeneous computer networks. This chapter illustrates the problems faced when trying to evaluate performances of networks with heterogeneous processors. To evaluate such performances, the concepts of speed-up and efficiency have been modified and adapted to account for heterogeneity. The second part deals with a study of parallel application libraries such as ScaLAPACK and with the development of communication masking techniques. The general concept is based on communication anticipation, in particular by pipelining message sending operations. Experimental results on Cray T3D and IBM SP1 machines validates the theoretical studies performed on basic algorithms of the libraries discussed above. Two examples of scientific applications are given: the first is a model of young stars for astrophysics and the other is a model of photon trajectories in the Compton effect. (J.S.). 83 refs., 65 figs., 24 tabs

  17. Parallel Framework for Dimensionality Reduction of Large-Scale Datasets

    Directory of Open Access Journals (Sweden)

    Sai Kiranmayee Samudrala

    2015-01-01

    Full Text Available Dimensionality reduction refers to a set of mathematical techniques used to reduce complexity of the original high-dimensional data, while preserving its selected properties. Improvements in simulation strategies and experimental data collection methods are resulting in a deluge of heterogeneous and high-dimensional data, which often makes dimensionality reduction the only viable way to gain qualitative and quantitative understanding of the data. However, existing dimensionality reduction software often does not scale to datasets arising in real-life applications, which may consist of thousands of points with millions of dimensions. In this paper, we propose a parallel framework for dimensionality reduction of large-scale data. We identify key components underlying the spectral dimensionality reduction techniques, and propose their efficient parallel implementation. We show that the resulting framework can be used to process datasets consisting of millions of points when executed on a 16,000-core cluster, which is beyond the reach of currently available methods. To further demonstrate applicability of our framework we perform dimensionality reduction of 75,000 images representing morphology evolution during manufacturing of organic solar cells in order to identify how processing parameters affect morphology evolution.

  18. A two-dimensional Zn coordination polymer with a three-dimensional supramolecular architecture

    Directory of Open Access Journals (Sweden)

    Fuhong Liu

    2017-10-01

    Full Text Available The title compound, poly[bis{μ2-4,4′-bis[(1,2,4-triazol-1-ylmethyl]biphenyl-κ2N4:N4′}bis(nitrato-κOzinc(II], [Zn(NO32(C18H16N62]n, is a two-dimensional zinc coordination polymer constructed from 4,4′-bis[(1H-1,2,4-triazol-1-ylmethyl]-1,1′-biphenyl units. It was synthesized and characterized by elemental analysis and single-crystal X-ray diffraction. The ZnII cation is located on an inversion centre and is coordinated by two O atoms from two symmetry-related nitrate groups and four N atoms from four symmetry-related 4,4′-bis[(1H-1,2,4-triazol-1-ylmethyl]-1,1′-biphenyl ligands, forming a distorted octahedral {ZnN4O2} coordination geometry. The linear 4,4′-bis[(1H-1,2,4-triazol-1-ylmethyl]-1,1′-biphenyl ligand links two ZnII cations, generating two-dimensional layers parallel to the crystallographic (132 plane. The parallel layers are connected by C—H...O, C—H...N, C—H...π and π–π stacking interactions, resulting in a three-dimensional supramolecular architecture.

  19. A study on optimal task decomposition of networked parallel computing using PVM

    International Nuclear Information System (INIS)

    Seong, Kwan Jae; Kim, Han Gyoo

    1998-01-01

    A numerical study is performed to investigate the effect of task decomposition on networked parallel processes using Parallel Virtual Machine (PVM). In our study, a PVM program distributed over a network of workstations is used in solving a finite difference version of a one dimensional heat equation, where natural choice of PVM programming structure would be the master-slave paradigm, with the aim of finding an optimal configuration resulting in least computing time including communication overhead among machines. Given a set of PVM tasks comprised of one master and five slave programs, it is found that there exists a pseudo-optimal number of machines, which does not necessarily coincide with the number of tasks, that yields the best performance when the network is under a light usage. Increasing the number of machines beyond this optimal one does not improve computing performance since increase in communication overhead among the excess number of machines offsets the decrease in CPU time obtained by distributing the PVM tasks among these machines. However, when the network traffic is heavy, the results exhibit a more random characteristic that is explained by the random nature of data transfer time

  20. Graph Grammar-Based Multi-Frontal Parallel Direct Solver for Two-Dimensional Isogeometric Analysis

    KAUST Repository

    Kuźnik, Krzysztof

    2012-06-02

    This paper introduces the graph grammar based model for developing multi-thread multi-frontal parallel direct solver for two dimensional isogeometric finite element method. Execution of the solver algorithm has been expressed as the sequence of graph grammar productions. At the beginning productions construct the elimination tree with leaves corresponding to finite elements. Following sequence of graph grammar productions generates element frontal matri-ces at leaf nodes, merges matrices at parent nodes and eliminates rows corresponding to fully assembled degrees of freedom. Finally, there are graph grammar productions responsible for root problem solution and recursive backward substitutions. Expressing the solver algorithm by graph grammar productions allows us to explore the concurrency of the algorithm. The graph grammar productions are grouped into sets of independent tasks that can be executed concurrently. The resulting concurrent multi-frontal solver algorithm is implemented and tested on NVIDIA GPU, providing O(NlogN) execution time complexity where N is the number of degrees of freedom. We have confirmed this complexity by solving up to 1 million of degrees of freedom with 448 cores GPU.

  1. A Green's function method for two-dimensional reactive solute transport in a parallel fracture-matrix system

    Science.gov (United States)

    Chen, Kewei; Zhan, Hongbin

    2018-06-01

    The reactive solute transport in a single fracture bounded by upper and lower matrixes is a classical problem that captures the dominant factors affecting transport behavior beyond pore scale. A parallel fracture-matrix system which considers the interaction among multiple paralleled fractures is an extension to a single fracture-matrix system. The existing analytical or semi-analytical solution for solute transport in a parallel fracture-matrix simplifies the problem to various degrees, such as neglecting the transverse dispersion in the fracture and/or the longitudinal diffusion in the matrix. The difficulty of solving the full two-dimensional (2-D) problem lies in the calculation of the mass exchange between the fracture and matrix. In this study, we propose an innovative Green's function approach to address the 2-D reactive solute transport in a parallel fracture-matrix system. The flux at the interface is calculated numerically. It is found that the transverse dispersion in the fracture can be safely neglected due to the small scale of fracture aperture. However, neglecting the longitudinal matrix diffusion would overestimate the concentration profile near the solute entrance face and underestimate the concentration profile at the far side. The error caused by neglecting the longitudinal matrix diffusion decreases with increasing Peclet number. The longitudinal matrix diffusion does not have obvious influence on the concentration profile in long-term. The developed model is applied to a non-aqueous-phase-liquid (DNAPL) contamination field case in New Haven Arkose of Connecticut in USA to estimate the Trichloroethylene (TCE) behavior over 40 years. The ratio of TCE mass stored in the matrix and the injected TCE mass increases above 90% in less than 10 years.

  2. Three-dimensional parallel vortex rings in Bose-Einstein condensates

    International Nuclear Information System (INIS)

    Crasovan, Lucian-Cornel; Perez-Garcia, Victor M.; Danaila, Ionut; Mihalache, Dumitru; Torner, Lluis

    2004-01-01

    We construct three-dimensional structures of topological defects hosted in trapped wave fields, in the form of vortex stars, vortex cages, parallel vortex lines, perpendicular vortex rings, and parallel vortex rings, and we show that the latter exist as robust stationary, collective states of nonrotating Bose-Einstein condensates. We discuss the stability properties of excited states containing several parallel vortex rings hosted by the condensate, including their dynamical and structural stability

  3. Equatorial spread F studies using SAMI3 with two-dimensional and three-dimensional electrostatics

    Directory of Open Access Journals (Sweden)

    H. C. Aveiro

    2013-12-01

    Full Text Available This letter presents a study of equatorial F region irregularities using the NRL SAMI3/ESF model, comparing results using a two-dimensional (2-D and a three-dimensional (3-D electrostatic potential solution. For the 3-D potential solution, two cases are considered for parallel plasma transport: (1 transport based on the parallel ambipolar field, and (2 transport based on the parallel electric field. The results show that the growth rate of the generalized Rayleigh–Taylor instability is not affected by the choice of the potential solution. However, differences are observed in the structures of the irregularities between the 2-D and 3-D solutions. Additionally, the plasma velocity along the geomagnetic field computed using the full 3-D solution shows complex structures that are not captured by the simplified model. This points out that only the full 3-D model is able to fully capture the complex physics of the equatorial F region.

  4. A two-dimensional Zn coordination polymer with a three-dimensional supra-molecular architecture.

    Science.gov (United States)

    Liu, Fuhong; Ding, Yan; Li, Qiuyu; Zhang, Liping

    2017-10-01

    The title compound, poly[bis-{μ 2 -4,4'-bis-[(1,2,4-triazol-1-yl)meth-yl]biphenyl-κ 2 N 4 : N 4' }bis-(nitrato-κ O )zinc(II)], [Zn(NO 3 ) 2 (C 18 H 16 N 6 ) 2 ] n , is a two-dimensional zinc coordination polymer constructed from 4,4'-bis-[(1 H -1,2,4-triazol-1-yl)meth-yl]-1,1'-biphenyl units. It was synthesized and characterized by elemental analysis and single-crystal X-ray diffraction. The Zn II cation is located on an inversion centre and is coordinated by two O atoms from two symmetry-related nitrate groups and four N atoms from four symmetry-related 4,4'-bis-[(1 H -1,2,4-triazol-1-yl)meth-yl]-1,1'-biphenyl ligands, forming a distorted octa-hedral {ZnN 4 O 2 } coordination geometry. The linear 4,4'-bis-[(1 H -1,2,4-triazol-1-yl)meth-yl]-1,1'-biphenyl ligand links two Zn II cations, generating two-dimensional layers parallel to the crystallographic (132) plane. The parallel layers are connected by C-H⋯O, C-H⋯N, C-H⋯π and π-π stacking inter-actions, resulting in a three-dimensional supra-molecular architecture.

  5. Parallel Computing Characteristics of Two-Phase Thermal-Hydraulics code, CUPID

    International Nuclear Information System (INIS)

    Lee, Jae Ryong; Yoon, Han Young

    2013-01-01

    Parallelized CUPID code has proved to be able to reproduce multi-dimensional thermal hydraulic analysis by validating with various conceptual problems and experimental data. In this paper, the characteristics of the parallelized CUPID code were investigated. Both single- and two phase simulation are taken into account. Since the scalability of a parallel simulation is known to be better for fine mesh system, two types of mesh system are considered. In addition, the dependency of the preconditioner for matrix solver was also compared. The scalability for the single-phase flow is better than that for two-phase flow due to the less numbers of iterations for solving pressure matrix. The CUPID code was investigated the parallel performance in terms of scalability. The CUPID code was parallelized with domain decomposition method. The MPI library was adopted to communicate the information at the interface cells. As increasing the number of mesh, the scalability is improved. For a given mesh, single-phase flow simulation with diagonal preconditioner shows the best speedup. However, for the two-phase flow simulation, the ILU preconditioner is recommended since it reduces the overall simulation time

  6. Two- and three-dimensional nonlocal density functional theory for inhomogeneous fluids. 1. Algorithms and parallelization

    International Nuclear Information System (INIS)

    Frink, L.J.D.; Salinger, A.G.

    2000-01-01

    Fluids adsorbed near surfaces, near macromolecules, and in porous materials are inhomogeneous, exhibiting spatially varying density distributions. This inhomogeneity in the fluid plays an important role in controlling a wide variety of complex physical phenomena including wetting, self-assembly, corrosion, and molecular recognition. One of the key methods for studying the properties of inhomogeneous fluids in simple geometries has been density functional theory (DFT). However, there has been a conspicuous lack of calculations in complex two- and three-dimensional geometries. The computational difficulty arises from the need to perform nested integrals that are due to nonlocal terms in the free energy functional. These integral equations are expensive both in evaluation time and in memory requirements; however, the expense can be mitigated by intelligent algorithms and the use of parallel computers. This paper details the efforts to develop efficient numerical algorithms so that nonlocal DFT calculations in complex geometries that require two or three dimensions can be performed. The success of this implementation will enable the study of solvation effects at heterogeneous surfaces, in zeolites, in solvated (bio)polymers, and in colloidal suspensions

  7. Convergent fabrication of a nanoporous two-dimensional carbon network from an aldol condensation on metal surfaces

    International Nuclear Information System (INIS)

    Landers, John; De Santis, Maurizio; Bendiab, Nedjma; Magaud, Laurence; Coraux, Johann; Chérioux, Frédéric; Lamare, Simon

    2014-01-01

    We report a convergent surface polymerization reaction scheme on Au(111), based on a triple aldol condensation, yielding a carbon-rich, covalent nanoporous two-dimensional network. The reaction is not self-poisoning and proceeds up to a full surface coverage. The deposited precursor molecules 1, 3, 5-tri(4’-acetylphenyl) first form supramolecular assemblies that are converted to the porous covalent network upon heating. The formation and structure of the network and of the intermediate steps are studied with scanning tunneling microscopy, Raman spectroscopy and density functional theory. (paper)

  8. Parallel Distributed Processing theory in the age of deep networks

    OpenAIRE

    Bowers, Jeffrey

    2017-01-01

    Parallel Distributed Processing (PDP) models in psychology are the precursors of deep networks used in computer science. However, only PDP models are associated with two core psychological claims, namely, that all knowledge is coded in a distributed format, and cognition is mediated by non-symbolic computations. These claims have long been debated within cognitive science, and recent work with deep networks speaks to this debate. Specifically, single-unit recordings show that deep networks le...

  9. Almost two-dimensional treatment of drift wave turbulence

    International Nuclear Information System (INIS)

    Albert, J.M.; Similon, P.L.; Sudan, R.N.

    1990-01-01

    The approximation of two-dimensionality is studied and extended for electrostatic drift wave turbulence in a three-dimensional, magnetized plasma. It is argued on the basis of the direct interaction approximation that in the absence of parallel viscosity, purely 2-D solutions exist for which only modes with k parallel =0 are excited, but that the 2-D spectrum is unstable to perturbations at nonzero k parallel . A 1-D equation for the parallel profile g k perpendicular (k parallel ) of the saturated spectrum at steady state is derived and solved, allowing for parallel viscosity; the spectrum has finite width in k parallel , and hence finite parallel correlation length, as a result of nonlinear coupling. The enhanced energy dissipation rate, a 3-D effect, may be incorporated in the 2-D approximation by a suitable renormalization of the linear dissipation term. An algorithm is presented that reduces the 3-D problem to coupled 1- and 2-D problems. Numerical results from a 2-D spectral direct simulation, thus modified, are compared with the results from the corresponding 3-D (unmodified) simulation for a specific model of drift wave excitation. Damping at high k parallel is included. It is verified that the 1-D solution for g k perpendicular (k parallel ) accurately describes the shape and width of the 3-D spectrum, and that the modified 2-D simulation gives a good estimate of the 3-D energy saturation level and distribution E(k perpendicular )

  10. Parallel and orthogonal stimulus in ultradiluted neural networks

    International Nuclear Information System (INIS)

    Sobral, G. A. Jr.; Vieira, V. M.; Lyra, M. L.; Silva, C. R. da

    2006-01-01

    Extending a model due to Derrida, Gardner, and Zippelius, we have studied the recognition ability of an extreme and asymmetrically diluted version of the Hopfield model for associative memory by including the effect of a stimulus in the dynamics of the system. We obtain exact results for the dynamic evolution of the average network superposition. The stimulus field was considered as proportional to the overlapping of the state of the system with a particular stimulated pattern. Two situations were analyzed, namely, the external stimulus acting on the initialization pattern (parallel stimulus) and the external stimulus acting on a pattern orthogonal to the initialization one (orthogonal stimulus). In both cases, we obtained the complete phase diagram in the parameter space composed of the stimulus field, thermal noise, and network capacity. Our results show that the system improves its recognition ability for parallel stimulus. For orthogonal stimulus two recognition phases emerge with the system locking at the initialization or stimulated pattern. We confront our analytical results with numerical simulations for the noiseless case T=0

  11. Parallel thermal radiation transport in two dimensions

    International Nuclear Information System (INIS)

    Smedley-Stevenson, R.P.; Ball, S.R.

    2003-01-01

    This paper describes the distributed memory parallel implementation of a deterministic thermal radiation transport algorithm in a 2-dimensional ALE hydrodynamics code. The parallel algorithm consists of a variety of components which are combined in order to produce a state of the art computational capability, capable of solving large thermal radiation transport problems using Blue-Oak, the 3 Tera-Flop MPP (massive parallel processors) computing facility at AWE (United Kingdom). Particular aspects of the parallel algorithm are described together with examples of the performance on some challenging applications. (author)

  12. Parallel thermal radiation transport in two dimensions

    Energy Technology Data Exchange (ETDEWEB)

    Smedley-Stevenson, R.P.; Ball, S.R. [AWE Aldermaston (United Kingdom)

    2003-07-01

    This paper describes the distributed memory parallel implementation of a deterministic thermal radiation transport algorithm in a 2-dimensional ALE hydrodynamics code. The parallel algorithm consists of a variety of components which are combined in order to produce a state of the art computational capability, capable of solving large thermal radiation transport problems using Blue-Oak, the 3 Tera-Flop MPP (massive parallel processors) computing facility at AWE (United Kingdom). Particular aspects of the parallel algorithm are described together with examples of the performance on some challenging applications. (author)

  13. Designing a parallel evolutionary algorithm for inferring gene networks on the cloud computing environment.

    Science.gov (United States)

    Lee, Wei-Po; Hsiao, Yu-Ting; Hwang, Wei-Che

    2014-01-16

    To improve the tedious task of reconstructing gene networks through testing experimentally the possible interactions between genes, it becomes a trend to adopt the automated reverse engineering procedure instead. Some evolutionary algorithms have been suggested for deriving network parameters. However, to infer large networks by the evolutionary algorithm, it is necessary to address two important issues: premature convergence and high computational cost. To tackle the former problem and to enhance the performance of traditional evolutionary algorithms, it is advisable to use parallel model evolutionary algorithms. To overcome the latter and to speed up the computation, it is advocated to adopt the mechanism of cloud computing as a promising solution: most popular is the method of MapReduce programming model, a fault-tolerant framework to implement parallel algorithms for inferring large gene networks. This work presents a practical framework to infer large gene networks, by developing and parallelizing a hybrid GA-PSO optimization method. Our parallel method is extended to work with the Hadoop MapReduce programming model and is executed in different cloud computing environments. To evaluate the proposed approach, we use a well-known open-source software GeneNetWeaver to create several yeast S. cerevisiae sub-networks and use them to produce gene profiles. Experiments have been conducted and the results have been analyzed. They show that our parallel approach can be successfully used to infer networks with desired behaviors and the computation time can be largely reduced. Parallel population-based algorithms can effectively determine network parameters and they perform better than the widely-used sequential algorithms in gene network inference. These parallel algorithms can be distributed to the cloud computing environment to speed up the computation. By coupling the parallel model population-based optimization method and the parallel computational framework, high

  14. Large-scale modeling of epileptic seizures: scaling properties of two parallel neuronal network simulation algorithms.

    Science.gov (United States)

    Pesce, Lorenzo L; Lee, Hyong C; Hereld, Mark; Visser, Sid; Stevens, Rick L; Wildeman, Albert; van Drongelen, Wim

    2013-01-01

    Our limited understanding of the relationship between the behavior of individual neurons and large neuronal networks is an important limitation in current epilepsy research and may be one of the main causes of our inadequate ability to treat it. Addressing this problem directly via experiments is impossibly complex; thus, we have been developing and studying medium-large-scale simulations of detailed neuronal networks to guide us. Flexibility in the connection schemas and a complete description of the cortical tissue seem necessary for this purpose. In this paper we examine some of the basic issues encountered in these multiscale simulations. We have determined the detailed behavior of two such simulators on parallel computer systems. The observed memory and computation-time scaling behavior for a distributed memory implementation were very good over the range studied, both in terms of network sizes (2,000 to 400,000 neurons) and processor pool sizes (1 to 256 processors). Our simulations required between a few megabytes and about 150 gigabytes of RAM and lasted between a few minutes and about a week, well within the capability of most multinode clusters. Therefore, simulations of epileptic seizures on networks with millions of cells should be feasible on current supercomputers.

  15. Large-Scale Modeling of Epileptic Seizures: Scaling Properties of Two Parallel Neuronal Network Simulation Algorithms

    Directory of Open Access Journals (Sweden)

    Lorenzo L. Pesce

    2013-01-01

    Full Text Available Our limited understanding of the relationship between the behavior of individual neurons and large neuronal networks is an important limitation in current epilepsy research and may be one of the main causes of our inadequate ability to treat it. Addressing this problem directly via experiments is impossibly complex; thus, we have been developing and studying medium-large-scale simulations of detailed neuronal networks to guide us. Flexibility in the connection schemas and a complete description of the cortical tissue seem necessary for this purpose. In this paper we examine some of the basic issues encountered in these multiscale simulations. We have determined the detailed behavior of two such simulators on parallel computer systems. The observed memory and computation-time scaling behavior for a distributed memory implementation were very good over the range studied, both in terms of network sizes (2,000 to 400,000 neurons and processor pool sizes (1 to 256 processors. Our simulations required between a few megabytes and about 150 gigabytes of RAM and lasted between a few minutes and about a week, well within the capability of most multinode clusters. Therefore, simulations of epileptic seizures on networks with millions of cells should be feasible on current supercomputers.

  16. Visualizing Network Traffic to Understand the Performance of Massively Parallel Simulations

    KAUST Repository

    Landge, A. G.

    2012-12-01

    The performance of massively parallel applications is often heavily impacted by the cost of communication among compute nodes. However, determining how to best use the network is a formidable task, made challenging by the ever increasing size and complexity of modern supercomputers. This paper applies visualization techniques to aid parallel application developers in understanding the network activity by enabling a detailed exploration of the flow of packets through the hardware interconnect. In order to visualize this large and complex data, we employ two linked views of the hardware network. The first is a 2D view, that represents the network structure as one of several simplified planar projections. This view is designed to allow a user to easily identify trends and patterns in the network traffic. The second is a 3D view that augments the 2D view by preserving the physical network topology and providing a context that is familiar to the application developers. Using the massively parallel multi-physics code pF3D as a case study, we demonstrate that our tool provides valuable insight that we use to explain and optimize pF3D-s performance on an IBM Blue Gene/P system. © 1995-2012 IEEE.

  17. DIMACS Workshop on Interconnection Networks and Mapping, and Scheduling Parallel Computations

    CERN Document Server

    Rosenberg, Arnold L; Sotteau, Dominique; NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science; Interconnection networks and mapping and scheduling parallel computations

    1995-01-01

    The interconnection network is one of the most basic components of a massively parallel computer system. Such systems consist of hundreds or thousands of processors interconnected to work cooperatively on computations. One of the central problems in parallel computing is the task of mapping a collection of processes onto the processors and routing network of a parallel machine. Once this mapping is done, it is critical to schedule computations within and communication among processor from universities and laboratories, as well as practitioners involved in the design, implementation, and application of massively parallel systems. Focusing on interconnection networks of parallel architectures of today and of the near future , the book includes topics such as network topologies,network properties, message routing, network embeddings, network emulation, mappings, and efficient scheduling. inputs for a process are available where and when the process is scheduled to be computed. This book contains the refereed pro...

  18. Fault detection for hydraulic pump based on chaotic parallel RBF network

    Directory of Open Access Journals (Sweden)

    Ma Ning

    2011-01-01

    Full Text Available Abstract In this article, a parallel radial basis function network in conjunction with chaos theory (CPRBF network is presented, and applied to practical fault detection for hydraulic pump, which is a critical component in aircraft. The CPRBF network consists of a number of radial basis function (RBF subnets connected in parallel. The number of input nodes for each RBF subnet is determined by different embedding dimension based on chaotic phase-space reconstruction. The output of CPRBF is a weighted sum of all RBF subnets. It was first trained using the dataset from normal state without fault, and then a residual error generator was designed to detect failures based on the trained CPRBF network. Then, failure detection can be achieved by the analysis of the residual error. Finally, two case studies are introduced to compare the proposed CPRBF network with traditional RBF networks, in terms of prediction and detection accuracy.

  19. Exact critical properties of two-dimensional polymer networks from conformal invariance

    International Nuclear Information System (INIS)

    Duplantier, B.

    1988-03-01

    An infinity of exact critical exponents for two-dimensional self-avoiding walks can be derived from conformal invariance and Coulomb gas techniques applied to the O(n) model and to the Potts model. They apply to polymer networks of any topology, for which a general scaling theory is given, valid in any dimension d. The infinite set of exponents has also been calculated to O(ε 2 ), for d=4-ε. The 2D study also includes other universality classes like the dense polymers, the Hamiltonian walks, the polymers at their θ-point. Exact correlation functions can be further given for Hamiltonian walks, and exact winding angle probability distributions for the self-avoiding walks

  20. Parallelization characteristics of a three-dimensional whole-core code DeCART

    International Nuclear Information System (INIS)

    Cho, J. Y.; Joo, H.K.; Kim, H. Y.; Lee, J. C.; Jang, M. H.

    2003-01-01

    Neutron transport calculation for three-dimensional amount of computing time but also huge memory. Therefore, whole-core codes such as DeCART need both also parallel computation and distributed memory capabilities. This paper is to implement such parallel capabilities based on MPI grouping and memory distribution on the DeCART code, and then to evaluate the performance by solving the C5G7 three-dimensional benchmark and a simplified three-dimensional SMART core problem. In C5G7 problem with 24 CPUs, a speedup of maximum 22 is obtained on IBM regatta machine and 21 on a LINUX cluster for the MOC kernel, which indicates good parallel performance of the DeCART code. The simplified SMART problem which need about 11 GBytes memory with one processors requires about 940 MBytes, which means that the DeCART code can now solve large core problems on affordable LINUX clusters

  1. Fencing network direct memory access data transfers in a parallel active messaging interface of a parallel computer

    Science.gov (United States)

    Blocksome, Michael A.; Mamidala, Amith R.

    2015-07-07

    Fencing direct memory access (`DMA`) data transfers in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI including data communications endpoints, each endpoint including specifications of a client, a context, and a task, the endpoints coupled for data communications through the PAMI and through DMA controllers operatively coupled to a deterministic data communications network through which the DMA controllers deliver data communications deterministically, including initiating execution through the PAMI of an ordered sequence of active DMA instructions for DMA data transfers between two endpoints, effecting deterministic DMA data transfers through a DMA controller and the deterministic data communications network; and executing through the PAMI, with no FENCE accounting for DMA data transfers, an active FENCE instruction, the FENCE instruction completing execution only after completion of all DMA instructions initiated prior to execution of the FENCE instruction for DMA data transfers between the two endpoints.

  2. Enabling parallel simulation of large-scale HPC network systems

    International Nuclear Information System (INIS)

    Mubarak, Misbah; Carothers, Christopher D.; Ross, Robert B.; Carns, Philip

    2016-01-01

    Here, with the increasing complexity of today’s high-performance computing (HPC) architectures, simulation has become an indispensable tool for exploring the design space of HPC systems—in particular, networks. In order to make effective design decisions, simulations of these systems must possess the following properties: (1) have high accuracy and fidelity, (2) produce results in a timely manner, and (3) be able to analyze a broad range of network workloads. Most state-of-the-art HPC network simulation frameworks, however, are constrained in one or more of these areas. In this work, we present a simulation framework for modeling two important classes of networks used in today’s IBM and Cray supercomputers: torus and dragonfly networks. We use the Co-Design of Multi-layer Exascale Storage Architecture (CODES) simulation framework to simulate these network topologies at a flit-level detail using the Rensselaer Optimistic Simulation System (ROSS) for parallel discrete-event simulation. Our simulation framework meets all the requirements of a practical network simulation and can assist network designers in design space exploration. First, it uses validated and detailed flit-level network models to provide an accurate and high-fidelity network simulation. Second, instead of relying on serial time-stepped or traditional conservative discrete-event simulations that limit simulation scalability and efficiency, we use the optimistic event-scheduling capability of ROSS to achieve efficient and scalable HPC network simulations on today’s high-performance cluster systems. Third, our models give network designers a choice in simulating a broad range of network workloads, including HPC application workloads using detailed network traces, an ability that is rarely offered in parallel with high-fidelity network simulations

  3. Three-dimensional aromatic networks.

    Science.gov (United States)

    Toyota, Shinji; Iwanaga, Tetsuo

    2014-01-01

    Three-dimensional (3D) networks consisting of aromatic units and linkers are reviewed from various aspects. To understand principles for the construction of such compounds, we generalize the roles of building units, the synthetic approaches, and the classification of networks. As fundamental compounds, cyclophanes with large aromatic units and aromatic macrocycles with linear acetylene linkers are highlighted in terms of transannular interactions between aromatic units, conformational preference, and resolution of chiral derivatives. Polycyclic cage compounds are constructed from building units by linkages via covalent bonds, metal-coordination bonds, or hydrogen bonds. Large cage networks often include a wide range of guest species in their cavity to afford novel inclusion compounds. Topological isomers consisting of two or more macrocycles are formed by cyclization of preorganized species. Some complicated topological networks are constructed by self-assembly of simple building units.

  4. Three-dimensional magnetic field computation on a distributed memory parallel processor

    International Nuclear Information System (INIS)

    Barion, M.L.

    1990-01-01

    The analysis of three-dimensional magnetic fields by finite element methods frequently proves too onerous a task for the computing resource on which it is attempted. When non-linear and transient effects are included, it may become impossible to calculate the field distribution to sufficient resolution. One approach to this problem is to exploit the natural parallelism in the finite element method via parallel processing. This paper reports on an implementation of a finite element code for non-linear three-dimensional low-frequency magnetic field calculation on Intel's iPSC/2

  5. Parallel and distributed processing in two SGBDS: A case study

    OpenAIRE

    Francisco Javier Moreno; Nataly Castrillón Charari; Camilo Taborda Zuluaga

    2017-01-01

    Context: One of the strategies for managing large volumes of data is distributed and parallel computing. Among the tools that allow applying these characteristics are some Data Base Management Systems (DBMS), such as Oracle, DB2, and SQL Server. Method: In this paper we present a case study where we evaluate the performance of an SQL query in two of these DBMS. The evaluation is done through various forms of data distribution in a computer network with different degrees of parallelism. ...

  6. A Depth-Adjustment Deployment Algorithm Based on Two-Dimensional Convex Hull and Spanning Tree for Underwater Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Peng Jiang

    2016-07-01

    Full Text Available Most of the existing node depth-adjustment deployment algorithms for underwater wireless sensor networks (UWSNs just consider how to optimize network coverage and connectivity rate. However, these literatures don’t discuss full network connectivity, while optimization of network energy efficiency and network reliability are vital topics for UWSN deployment. Therefore, in this study, a depth-adjustment deployment algorithm based on two-dimensional (2D convex hull and spanning tree (NDACS for UWSNs is proposed. First, the proposed algorithm uses the geometric characteristics of a 2D convex hull and empty circle to find the optimal location of a sleep node and activate it, minimizes the network coverage overlaps of the 2D plane, and then increases the coverage rate until the first layer coverage threshold is reached. Second, the sink node acts as a root node of all active nodes on the 2D convex hull and then forms a small spanning tree gradually. Finally, the depth-adjustment strategy based on time marker is used to achieve the three-dimensional overall network deployment. Compared with existing depth-adjustment deployment algorithms, the simulation results show that the NDACS algorithm can maintain full network connectivity with high network coverage rate, as well as improved network average node degree, thus increasing network reliability.

  7. Parallel and distributed processing in two SGBDS: A case study

    Directory of Open Access Journals (Sweden)

    Francisco Javier Moreno

    2017-04-01

    Full Text Available Context: One of the strategies for managing large volumes of data is distributed and parallel computing. Among the tools that allow applying these characteristics are some Data Base Management Systems (DBMS, such as Oracle, DB2, and SQL Server. Method: In this paper we present a case study where we evaluate the performance of an SQL query in two of these DBMS. The evaluation is done through various forms of data distribution in a computer network with different degrees of parallelism. Results: The tests of the SQL query evidenced the performance differences between the two DBMS analyzed. However, more thorough testing and a wider variety of queries are needed. Conclusions: The differences in performance between the two DBMSs analyzed show that when evaluating this aspect, it is necessary to consider the particularities of each DBMS and the degree of parallelism of the queries.

  8. Parallel Distributed Processing Theory in the Age of Deep Networks.

    Science.gov (United States)

    Bowers, Jeffrey S

    2017-12-01

    Parallel distributed processing (PDP) models in psychology are the precursors of deep networks used in computer science. However, only PDP models are associated with two core psychological claims, namely that all knowledge is coded in a distributed format and cognition is mediated by non-symbolic computations. These claims have long been debated in cognitive science, and recent work with deep networks speaks to this debate. Specifically, single-unit recordings show that deep networks learn units that respond selectively to meaningful categories, and researchers are finding that deep networks need to be supplemented with symbolic systems to perform some tasks. Given the close links between PDP and deep networks, it is surprising that research with deep networks is challenging PDP theory. Copyright © 2017. Published by Elsevier Ltd.

  9. One weird trick for parallelizing convolutional neural networks

    OpenAIRE

    Krizhevsky, Alex

    2014-01-01

    I present a new way to parallelize the training of convolutional neural networks across multiple GPUs. The method scales significantly better than all alternatives when applied to modern convolutional neural networks.

  10. On a model of three-dimensional bursting and its parallel implementation

    Science.gov (United States)

    Tabik, S.; Romero, L. F.; Garzón, E. M.; Ramos, J. I.

    2008-04-01

    A mathematical model for the simulation of three-dimensional bursting phenomena and its parallel implementation are presented. The model consists of four nonlinearly coupled partial differential equations that include fast and slow variables, and exhibits bursting in the absence of diffusion. The differential equations have been discretized by means of a second-order accurate in both space and time, linearly-implicit finite difference method in equally-spaced grids. The resulting system of linear algebraic equations at each time level has been solved by means of the Preconditioned Conjugate Gradient (PCG) method. Three different parallel implementations of the proposed mathematical model have been developed; two of these implementations, i.e., the MPI and the PETSc codes, are based on a message passing paradigm, while the third one, i.e., the OpenMP code, is based on a shared space address paradigm. These three implementations are evaluated on two current high performance parallel architectures, i.e., a dual-processor cluster and a Shared Distributed Memory (SDM) system. A novel representation of the results that emphasizes the most relevant factors that affect the performance of the paralled implementations, is proposed. The comparative analysis of the computational results shows that the MPI and the OpenMP implementations are about twice more efficient than the PETSc code on the SDM system. It is also shown that, for the conditions reported here, the nonlinear dynamics of the three-dimensional bursting phenomena exhibits three stages characterized by asynchronous, synchronous and then asynchronous oscillations, before a quiescent state is reached. It is also shown that the fast system reaches steady state in much less time than the slow variables.

  11. A Parallel Adaboost-Backpropagation Neural Network for Massive Image Dataset Classification

    Science.gov (United States)

    Cao, Jianfang; Chen, Lichao; Wang, Min; Shi, Hao; Tian, Yun

    2016-01-01

    Image classification uses computers to simulate human understanding and cognition of images by automatically categorizing images. This study proposes a faster image classification approach that parallelizes the traditional Adaboost-Backpropagation (BP) neural network using the MapReduce parallel programming model. First, we construct a strong classifier by assembling the outputs of 15 BP neural networks (which are individually regarded as weak classifiers) based on the Adaboost algorithm. Second, we design Map and Reduce tasks for both the parallel Adaboost-BP neural network and the feature extraction algorithm. Finally, we establish an automated classification model by building a Hadoop cluster. We use the Pascal VOC2007 and Caltech256 datasets to train and test the classification model. The results are superior to those obtained using traditional Adaboost-BP neural network or parallel BP neural network approaches. Our approach increased the average classification accuracy rate by approximately 14.5% and 26.0% compared to the traditional Adaboost-BP neural network and parallel BP neural network, respectively. Furthermore, the proposed approach requires less computation time and scales very well as evaluated by speedup, sizeup and scaleup. The proposed approach may provide a foundation for automated large-scale image classification and demonstrates practical value. PMID:27905520

  12. Two-dimensional quantum repeaters

    Science.gov (United States)

    Wallnöfer, J.; Zwerger, M.; Muschik, C.; Sangouard, N.; Dür, W.

    2016-11-01

    The endeavor to develop quantum networks gave rise to a rapidly developing field with far-reaching applications such as secure communication and the realization of distributed computing tasks. This ultimately calls for the creation of flexible multiuser structures that allow for quantum communication between arbitrary pairs of parties in the network and facilitate also multiuser applications. To address this challenge, we propose a two-dimensional quantum repeater architecture to establish long-distance entanglement shared between multiple communication partners in the presence of channel noise and imperfect local control operations. The scheme is based on the creation of self-similar multiqubit entanglement structures at growing scale, where variants of entanglement swapping and multiparty entanglement purification are combined to create high-fidelity entangled states. We show how such networks can be implemented using trapped ions in cavities.

  13. Parallel state transfer and efficient quantum routing on quantum networks.

    Science.gov (United States)

    Chudzicki, Christopher; Strauch, Frederick W

    2010-12-31

    We study the routing of quantum information in parallel on multidimensional networks of tunable qubits and oscillators. These theoretical models are inspired by recent experiments in superconducting circuits. We show that perfect parallel state transfer is possible for certain networks of harmonic oscillator modes. We extend this to the distribution of entanglement between every pair of nodes in the network, finding that the routing efficiency of hypercube networks is optimal and robust in the presence of dissipation and finite bandwidth.

  14. Sequential and parallel image restoration: neural network implementations.

    Science.gov (United States)

    Figueiredo, M T; Leitao, J N

    1994-01-01

    Sequential and parallel image restoration algorithms and their implementations on neural networks are proposed. For images degraded by linear blur and contaminated by additive white Gaussian noise, maximum a posteriori (MAP) estimation and regularization theory lead to the same high dimension convex optimization problem. The commonly adopted strategy (in using neural networks for image restoration) is to map the objective function of the optimization problem into the energy of a predefined network, taking advantage of its energy minimization properties. Departing from this approach, we propose neural implementations of iterative minimization algorithms which are first proved to converge. The developed schemes are based on modified Hopfield (1985) networks of graded elements, with both sequential and parallel updating schedules. An algorithm supported on a fully standard Hopfield network (binary elements and zero autoconnections) is also considered. Robustness with respect to finite numerical precision is studied, and examples with real images are presented.

  15. Separating figure from ground with a parallel network.

    Science.gov (United States)

    Kienker, P K; Sejnowski, T J; Hinton, G E; Schumacher, L E

    1986-01-01

    The differentiation of figure from ground plays an important role in the perceptual organization of visual stimuli. The rapidity with which we can discriminate the inside from the outside of a figure suggests that at least this step in the process may be performed in visual cortex by a large number of neurons in several different areas working together in parallel. We have attempted to simulate this collective computation by designing a network of simple processing units that receives two types of information: bottom-up input from the image containing the outlines of a figure, which may be incomplete, and a top-down attentional input that biases one part of the image to be the inside of the figure. No presegmentation of the image was assumed. Two methods for performing the computation were explored: gradient descent, which seeks locally optimal states, and simulated annealing, which attempts to find globally optimal states by introducing noise into the computation. For complete outlines, gradient descent was faster, but the range of input parameters leading to successful performance was very narrow. In contrast, simulated annealing was more robust: it worked over a wider range of attention parameters and a wider range of outlines, including incomplete ones. Our network model is too simplified to serve as a model of human performance, but it does demonstrate that one global property of outlines can be computed through local interactions in a parallel network. Some features of the model, such as the role of noise in escaping from nonglobal optima, may generalize to more realistic models.

  16. Magnetohydrodynamics effect on three-dimensional viscous incompressible flow between two horizontal parallel porous plates and heat transfer with periodic injection/suction

    Directory of Open Access Journals (Sweden)

    R. C. Chaudhary

    2004-11-01

    Full Text Available We investigate the hydromagnetic effect on viscous incompressible flow between two horizontal parallel porous flat plates with transverse sinusoidal injection of the fluid at the stationary plate and its corresponding removal by periodic suction through the plate in uniform motion. The flow becomes three dimensional due to this injection/suction velocity. Approximate solutions are obtained for the flow field, the pressure, the skin-friction, the temperature field, and the rate of heat transfer. The dependence of solution on M (Hartmann number and λ (injection/suction is investigated by the graphs and tables.

  17. Dimensional synthesis of a 3-DOF parallel manipulator with full circle rotation

    Science.gov (United States)

    Ni, Yanbing; Wu, Nan; Zhong, Xueyong; Zhang, Biao

    2015-07-01

    Parallel robots are widely used in the academic and industrial fields. In spite of the numerous achievements in the design and dimensional synthesis of the low-mobility parallel robots, few research efforts are directed towards the asymmetric 3-DOF parallel robots whose end-effector can realize 2 translational and 1 rotational(2T1R) motion. In order to develop a manipulator with the capability of full circle rotation to enlarge the workspace, a new 2T1R parallel mechanism is proposed. The modeling approach and kinematic analysis of this proposed mechanism are investigated. Using the method of vector analysis, the inverse kinematic equations are established. This is followed by a vigorous proof that this mechanism attains an annular workspace through its circular rotation and 2 dimensional translations. Taking the first order perturbation of the kinematic equations, the error Jacobian matrix which represents the mapping relationship between the error sources of geometric parameters and the end-effector position errors is derived. With consideration of the constraint conditions of pressure angles and feasible workspace, the dimensional synthesis is conducted with a goal to minimize the global comprehensive performance index. The dimension parameters making the mechanism to have optimal error mapping and kinematic performance are obtained through the optimization algorithm. All these research achievements lay the foundation for the prototype building of such kind of parallel robots.

  18. Scaling Properties of Dimensionality Reduction for Neural Populations and Network Models.

    Directory of Open Access Journals (Sweden)

    Ryan C Williamson

    2016-12-01

    Full Text Available Recent studies have applied dimensionality reduction methods to understand how the multi-dimensional structure of neural population activity gives rise to brain function. It is unclear, however, how the results obtained from dimensionality reduction generalize to recordings with larger numbers of neurons and trials or how these results relate to the underlying network structure. We address these questions by applying factor analysis to recordings in the visual cortex of non-human primates and to spiking network models that self-generate irregular activity through a balance of excitation and inhibition. We compared the scaling trends of two key outputs of dimensionality reduction-shared dimensionality and percent shared variance-with neuron and trial count. We found that the scaling properties of networks with non-clustered and clustered connectivity differed, and that the in vivo recordings were more consistent with the clustered network. Furthermore, recordings from tens of neurons were sufficient to identify the dominant modes of shared variability that generalize to larger portions of the network. These findings can help guide the interpretation of dimensionality reduction outputs in regimes of limited neuron and trial sampling and help relate these outputs to the underlying network structure.

  19. Two port network analysis for three impedance based oscillators

    KAUST Repository

    Said, Lobna A.

    2011-12-01

    Two-port network representations are applied to analyze complex networks which can be dissolved into sub-networks connected in series, parallel or cascade. In this paper, the concept of two-port network has been studied for oscillators. Three impedance oscillator based on two port concept has been analyzed using different impedance structures. The effect of each structure on the oscillation condition and the frequency of oscillation have been introduced. Two different implementations using MOS and BJT have been introduced. © 2011 IEEE.

  20. A Chip-Capillary Hybrid Device for Automated Transfer of Sample Pre-Separated by Capillary Isoelectric Focusing to Parallel Capillary Gel Electrophoresis for Two-Dimensional Protein Separation

    Science.gov (United States)

    Lu, Joann J.; Wang, Shili; Li, Guanbin; Wang, Wei; Pu, Qiaosheng; Liu, Shaorong

    2012-01-01

    In this report, we introduce a chip-capillary hybrid device to integrate capillary isoelectric focusing (CIEF) with parallel capillary sodium dodecyl sulfate – polyacrylamide gel electrophoresis (SDS-PAGE) or capillary gel electrophoresis (CGE) toward automating two-dimensional (2D) protein separations. The hybrid device consists of three chips that are butted together. The middle chip can be moved between two positions to re-route the fluidic paths, which enables the performance of CIEF and injection of proteins partially resolved by CIEF to CGE capillaries for parallel CGE separations in a continuous and automated fashion. Capillaries are attached to the other two chips to facilitate CIEF and CGE separations and to extend the effective lengths of CGE columns. Specifically, we illustrate the working principle of the hybrid device, develop protocols for producing and preparing the hybrid device, and demonstrate the feasibility of using this hybrid device for automated injection of CIEF-separated sample to parallel CGE for 2D protein separations. Potentials and problems associated with the hybrid device are also discussed. PMID:22830584

  1. Multi-petascale highly efficient parallel supercomputer

    Science.gov (United States)

    Asaad, Sameh; Bellofatto, Ralph E.; Blocksome, Michael A.; Blumrich, Matthias A.; Boyle, Peter; Brunheroto, Jose R.; Chen, Dong; Cher, Chen-Yong; Chiu, George L.; Christ, Norman; Coteus, Paul W.; Davis, Kristan D.; Dozsa, Gabor J.; Eichenberger, Alexandre E.; Eisley, Noel A.; Ellavsky, Matthew R.; Evans, Kahn C.; Fleischer, Bruce M.; Fox, Thomas W.; Gara, Alan; Giampapa, Mark E.; Gooding, Thomas M.; Gschwind, Michael K.; Gunnels, John A.; Hall, Shawn A.; Haring, Rudolf A.; Heidelberger, Philip; Inglett, Todd A.; Knudson, Brant L.; Kopcsay, Gerard V.; Kumar, Sameer; Mamidala, Amith R.; Marcella, James A.; Megerian, Mark G.; Miller, Douglas R.; Miller, Samuel J.; Muff, Adam J.; Mundy, Michael B.; O'Brien, John K.; O'Brien, Kathryn M.; Ohmacht, Martin; Parker, Jeffrey J.; Poole, Ruth J.; Ratterman, Joseph D.; Salapura, Valentina; Satterfield, David L.; Senger, Robert M.; Steinmacher-Burow, Burkhard; Stockdell, William M.; Stunkel, Craig B.; Sugavanam, Krishnan; Sugawara, Yutaka; Takken, Todd E.; Trager, Barry M.; Van Oosten, James L.; Wait, Charles D.; Walkup, Robert E.; Watson, Alfred T.; Wisniewski, Robert W.; Wu, Peng

    2018-05-15

    A Multi-Petascale Highly Efficient Parallel Supercomputer of 100 petaflop-scale includes node architectures based upon System-On-a-Chip technology, where each processing node comprises a single Application Specific Integrated Circuit (ASIC). The ASIC nodes are interconnected by a five dimensional torus network that optimally maximize the throughput of packet communications between nodes and minimize latency. The network implements collective network and a global asynchronous network that provides global barrier and notification functions. Integrated in the node design include a list-based prefetcher. The memory system implements transaction memory, thread level speculation, and multiversioning cache that improves soft error rate at the same time and supports DMA functionality allowing for parallel processing message-passing.

  2. Parallel logic gates in synthetic gene networks induced by non-Gaussian noise.

    Science.gov (United States)

    Xu, Yong; Jin, Xiaoqin; Zhang, Huiqing

    2013-11-01

    The recent idea of logical stochastic resonance is verified in synthetic gene networks induced by non-Gaussian noise. We realize the switching between two kinds of logic gates under optimal moderate noise intensity by varying two different tunable parameters in a single gene network. Furthermore, in order to obtain more logic operations, thus providing additional information processing capacity, we obtain in a two-dimensional toggle switch model two complementary logic gates and realize the transformation between two logic gates via the methods of changing different parameters. These simulated results contribute to improve the computational power and functionality of the networks.

  3. Two Dimensional Array Based Overlay Network for Balancing Load of Peer-to-Peer Live Video Streaming

    International Nuclear Information System (INIS)

    Ibrahimy, Abdullah Faruq Ibn; Rafiqul, Islam Md; Anwar, Farhat; Ibrahimy, Muhammad Ibn

    2013-01-01

    The live video data is streaming usually in a tree-based overlay network or in a mesh-based overlay network. In case of departure of a peer with additional upload bandwidth, the overlay network becomes very vulnerable to churn. In this paper, a two dimensional array-based overlay network is proposed for streaming the live video stream data. As there is always a peer or a live video streaming server to upload the live video stream data, so the overlay network is very stable and very robust to churn. Peers are placed according to their upload and download bandwidth, which enhances the balance of load and performance. The overlay network utilizes the additional upload bandwidth of peers to minimize chunk delivery delay and to maximize balance of load. The procedure, which is used for distributing the additional upload bandwidth of the peers, distributes the additional upload bandwidth to the heterogeneous strength peers in a fair treat distribution approach and to the homogeneous strength peers in a uniform distribution approach. The proposed overlay network has been simulated by Qualnet from Scalable Network Technologies and results are presented in this paper

  4. Two Dimensional Array Based Overlay Network for Balancing Load of Peer-to-Peer Live Video Streaming

    Science.gov (United States)

    Faruq Ibn Ibrahimy, Abdullah; Rafiqul, Islam Md; Anwar, Farhat; Ibn Ibrahimy, Muhammad

    2013-12-01

    The live video data is streaming usually in a tree-based overlay network or in a mesh-based overlay network. In case of departure of a peer with additional upload bandwidth, the overlay network becomes very vulnerable to churn. In this paper, a two dimensional array-based overlay network is proposed for streaming the live video stream data. As there is always a peer or a live video streaming server to upload the live video stream data, so the overlay network is very stable and very robust to churn. Peers are placed according to their upload and download bandwidth, which enhances the balance of load and performance. The overlay network utilizes the additional upload bandwidth of peers to minimize chunk delivery delay and to maximize balance of load. The procedure, which is used for distributing the additional upload bandwidth of the peers, distributes the additional upload bandwidth to the heterogeneous strength peers in a fair treat distribution approach and to the homogeneous strength peers in a uniform distribution approach. The proposed overlay network has been simulated by Qualnet from Scalable Network Technologies and results are presented in this paper.

  5. Orbital effect for the Fulde-Ferrell-Larkin-Ovchinnikov phase in a quasi-two-dimensional superconductor in a parallel magnetic field

    Science.gov (United States)

    Lebed, A. G.

    2018-04-01

    We theoretically study the orbital destructive effect against superconductivity in a parallel magnetic field in the Fulde-Ferrell-Larkin-Ovchinnikov (FFLO or LOFF) phase at zero temperature in a quasi-two-dimensional (Q2D) conductor. We demonstrate that at zero temperature a special parameter, λ =l⊥(H ) /d , is responsible for strength of the orbital effect, where l⊥(H ) is a typical "size" of the quasiclassical electron orbit in a magnetic field and d is the interplane distance. We discuss applications of our results to the existing experiments on the FFLO phase in the organic Q2D conductors κ -(ET) 2Cu (NCS) 2 and κ -(ET) 2Cu [N (CN) 2] Cl .

  6. Parallel replica dynamics method for bistable stochastic reaction networks: Simulation and sensitivity analysis

    Science.gov (United States)

    Wang, Ting; Plecháč, Petr

    2017-12-01

    Stochastic reaction networks that exhibit bistable behavior are common in systems biology, materials science, and catalysis. Sampling of stationary distributions is crucial for understanding and characterizing the long-time dynamics of bistable stochastic dynamical systems. However, simulations are often hindered by the insufficient sampling of rare transitions between the two metastable regions. In this paper, we apply the parallel replica method for a continuous time Markov chain in order to improve sampling of the stationary distribution in bistable stochastic reaction networks. The proposed method uses parallel computing to accelerate the sampling of rare transitions. Furthermore, it can be combined with the path-space information bounds for parametric sensitivity analysis. With the proposed methodology, we study three bistable biological networks: the Schlögl model, the genetic switch network, and the enzymatic futile cycle network. We demonstrate the algorithmic speedup achieved in these numerical benchmarks. More significant acceleration is expected when multi-core or graphics processing unit computer architectures and programming tools such as CUDA are employed.

  7. Parallel replica dynamics method for bistable stochastic reaction networks: Simulation and sensitivity analysis.

    Science.gov (United States)

    Wang, Ting; Plecháč, Petr

    2017-12-21

    Stochastic reaction networks that exhibit bistable behavior are common in systems biology, materials science, and catalysis. Sampling of stationary distributions is crucial for understanding and characterizing the long-time dynamics of bistable stochastic dynamical systems. However, simulations are often hindered by the insufficient sampling of rare transitions between the two metastable regions. In this paper, we apply the parallel replica method for a continuous time Markov chain in order to improve sampling of the stationary distribution in bistable stochastic reaction networks. The proposed method uses parallel computing to accelerate the sampling of rare transitions. Furthermore, it can be combined with the path-space information bounds for parametric sensitivity analysis. With the proposed methodology, we study three bistable biological networks: the Schlögl model, the genetic switch network, and the enzymatic futile cycle network. We demonstrate the algorithmic speedup achieved in these numerical benchmarks. More significant acceleration is expected when multi-core or graphics processing unit computer architectures and programming tools such as CUDA are employed.

  8. Flow Interactions of Two- and Three-Dimensional Networked Bio-Inspired Control Elements in an In-Line Arrangement.

    Science.gov (United States)

    Kurt, Melike; Moored, Keith

    2018-04-19

    We present experiments that examine the modes of interaction, the collective performance and the role of three-dimensionality in two pitching propulsors in an in-line arrangement. Both two-dimensional foils and three-dimensional rectangular wings of $AR = 2$ are examined. \\kwm{In contrast to previous work, two interaction modes distinguished as the coherent and branched wake modes are not observed to be directly linked to the propulsive efficiency, although they are linked to peak thrust performance and minimum power consumption as previously described \\cite[]{boschitsch2014propulsive}.} \\kwm{In fact, in closely-spaced propulsors peak propulsive efficiency of the follower occurs near its minimum power and this condition \\kwm{ reveals a} branched wake mode. Alternatively, for propulsors spaced far apart peak propulsive efficiency of the follower occurs near its peak thrust and this condition \\kwm{reveals a} coherent wake mode.} By examining the collective performance, it is discovered that there is an optimal spacing between the propulsors to maximize the collective efficiency. For two-dimensional foils the optimal spacing of $X^* = 0.75$ and the synchrony of $\\phi = 2\\pi /3$ leads to a collective efficiency and thrust enhancement of 50\\% and 32\\%, respectively, as compared to two isolated foils. In comparison, for $AR = 2$ wings the optimal spacing of $X^* = 0.25$ and the synchrony of $\\phi = 7\\pi /6$ leads to a collective efficiency and thrust enhancement of 30\\% and 22\\%, respectively. In addition, at the optimal conditions the collective lateral force coefficients in both the two- and three-dimensional cases are negligible, while operating off these conditions can lead to non-negligible lateral forces. Finally, the peak efficiency of the collective and the follower are shown to have opposite trends with increasing spacing in two- and three-dimensional flows. This is correlated to the breakdown of the impinging vortex on the follower wing in three

  9. Integrated computer network high-speed parallel interface

    International Nuclear Information System (INIS)

    Frank, R.B.

    1979-03-01

    As the number and variety of computers within Los Alamos Scientific Laboratory's Central Computer Facility grows, the need for a standard, high-speed intercomputer interface has become more apparent. This report details the development of a High-Speed Parallel Interface from conceptual through implementation stages to meet current and future needs for large-scle network computing within the Integrated Computer Network. 4 figures

  10. Spectral dimensionality of random superconducting networks

    International Nuclear Information System (INIS)

    Day, A.R.; Xia, W.; Thorpe, M.F.

    1988-01-01

    We compute the spectral dimensionality d of random superconducting-normal networks by directly examining the low-frequency density of states at the percolation threshold. We find that d = 4.1 +- 0.2 and 5.8 +- 0.3 in two and three dimensions, respectively, which confirms the scaling relation d = 2d/(2-s/ν), where s is the superconducting exponent and ν the correlation-length exponent for percolation. We also consider the one-dimensional problem where scaling arguments predict, and our numerical simulations confirm, that d = 0. A simple argument provides an expression for the density of states of the localized high-frequency modes in this special case. We comment on the connection between our calculations and the ''termite'' problem of a random walker on a random superconducting-normal network and point out difficulties in inferring d from simulations of the termite problem

  11. A Parallel Two-fluid Code for Global Magnetic Reconnection Studies

    International Nuclear Information System (INIS)

    Breslau, J.A.; Jardin, S.C.

    2001-01-01

    This paper describes a new algorithm for the computation of two-dimensional resistive magnetohydrodynamic (MHD) and two-fluid studies of magnetic reconnection in plasmas. It has been implemented on several parallel platforms and shows good scalability up to 32 CPUs for reasonable problem sizes. A fixed, nonuniform rectangular mesh is used to resolve the different spatial scales in the reconnection problem. The resistive MHD version of the code uses an implicit/explicit hybrid method, while the two-fluid version uses an alternating-direction implicit (ADI) method. The technique has proven useful for comparing several different theories of collisional and collisionless reconnection

  12. General Voltage Feedback Circuit Model in the Two-Dimensional Networked Resistive Sensor Array

    Directory of Open Access Journals (Sweden)

    JianFeng Wu

    2015-01-01

    Full Text Available To analyze the feature of the two-dimensional networked resistive sensor array, we firstly proposed a general model of voltage feedback circuits (VFCs such as the voltage feedback non-scanned-electrode circuit, the voltage feedback non-scanned-sampling-electrode circuit, and the voltage feedback non-scanned-sampling-electrode circuit. By analyzing the general model, we then gave a general mathematical expression of the effective equivalent resistor of the element being tested in VFCs. Finally, we evaluated the features of VFCs with simulation and test experiment. The results show that the expression is applicable to analyze the VFCs’ performance of parameters such as the multiplexers’ switch resistors, the nonscanned elements, and array size.

  13. Parallel discrete-event simulation of FCFS stochastic queueing networks

    Science.gov (United States)

    Nicol, David M.

    1988-01-01

    Physical systems are inherently parallel. Intuition suggests that simulations of these systems may be amenable to parallel execution. The parallel execution of a discrete-event simulation requires careful synchronization of processes in order to ensure the execution's correctness; this synchronization can degrade performance. Largely negative results were recently reported in a study which used a well-known synchronization method on queueing network simulations. Discussed here is a synchronization method (appointments), which has proven itself to be effective on simulations of FCFS queueing networks. The key concept behind appointments is the provision of lookahead. Lookahead is a prediction on a processor's future behavior, based on an analysis of the processor's simulation state. It is shown how lookahead can be computed for FCFS queueing network simulations, give performance data that demonstrates the method's effectiveness under moderate to heavy loads, and discuss performance tradeoffs between the quality of lookahead, and the cost of computing lookahead.

  14. Comb-like optical transmission spectra generated from one-dimensional two-segment-connected two-material waveguide networks optimized by genetic algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Yu [MOE Key Laboratory of Laser Life Science and Institute of Laser Life Science, College of Biophotonics, South China Normal University, Guangzhou 510631 (China); Yang, Xiangbo, E-mail: xbyang@scnu.edu.cn [MOE Key Laboratory of Laser Life Science and Institute of Laser Life Science, College of Biophotonics, South China Normal University, Guangzhou 510631 (China); School of Physical Education and Sports Science, South China Normal University, Guangzhou 510006 (China); Lu, Jian; Zhang, Guogang [MOE Key Laboratory of Laser Life Science and Institute of Laser Life Science, College of Biophotonics, South China Normal University, Guangzhou 510631 (China); Liu, Chengyi Timon [School of Physical Education and Sports Science, South China Normal University, Guangzhou 510006 (China)

    2014-03-01

    In this Letter, a one-dimensional (1D) two-segment-connected two-material waveguide network (TSCTMWN) is designed to produce comb-like frequency passbands, where each waveguide segment is composed of normal and anomalous dispersion materials and the length ratio of sub-waveguide segments is optimized by genetic algorithm (GA). It is found that 66 comb-like frequency passbands are created in the second frequency unit, maximal relative width difference of which is less than 2×10{sup −5}. It may be useful for the designing of dense wavelength division multiplexings (DWDMs) and multi-channel filters, etc., and provide new applications for GA.

  15. Parallel Simulation of Three-Dimensional Free Surface Fluid Flow Problems

    International Nuclear Information System (INIS)

    BAER, THOMAS A.; SACKINGER, PHILIP A.; SUBIA, SAMUEL R.

    1999-01-01

    Simulation of viscous three-dimensional fluid flow typically involves a large number of unknowns. When free surfaces are included, the number of unknowns increases dramatically. Consequently, this class of problem is an obvious application of parallel high performance computing. We describe parallel computation of viscous, incompressible, free surface, Newtonian fluid flow problems that include dynamic contact fines. The Galerkin finite element method was used to discretize the fully-coupled governing conservation equations and a ''pseudo-solid'' mesh mapping approach was used to determine the shape of the free surface. In this approach, the finite element mesh is allowed to deform to satisfy quasi-static solid mechanics equations subject to geometric or kinematic constraints on the boundaries. As a result, nodal displacements must be included in the set of unknowns. Other issues discussed are the proper constraints appearing along the dynamic contact line in three dimensions. Issues affecting efficient parallel simulations include problem decomposition to equally distribute computational work among a SPMD computer and determination of robust, scalable preconditioners for the distributed matrix systems that must be solved. Solution continuation strategies important for serial simulations have an enhanced relevance in a parallel coquting environment due to the difficulty of solving large scale systems. Parallel computations will be demonstrated on an example taken from the coating flow industry: flow in the vicinity of a slot coater edge. This is a three dimensional free surface problem possessing a contact line that advances at the web speed in one region but transitions to static behavior in another region. As such, a significant fraction of the computational time is devoted to processing boundary data. Discussion focuses on parallel speed ups for fixed problem size, a class of problems of immediate practical importance

  16. High Dimensional Modulation and MIMO Techniques for Access Networks

    DEFF Research Database (Denmark)

    Binti Othman, Maisara

    Exploration of advanced modulation formats and multiplexing techniques for next generation optical access networks are of interest as promising solutions for delivering multiple services to end-users. This thesis addresses this from two different angles: high dimensionality carrierless...... the capacity per wavelength of the femto-cell network. Bit rate up to 1.59 Gbps with fiber-wireless transmission over 1 m air distance is demonstrated. The results presented in this thesis demonstrate the feasibility of high dimensionality CAP in increasing the number of dimensions and their potentially......) optical access network. 2 X 2 MIMO RoF employing orthogonal frequency division multiplexing (OFDM) with 5.6 GHz RoF signaling over all-vertical cavity surface emitting lasers (VCSEL) WDM passive optical networks (PONs). We have employed polarization division multiplexing (PDM) to further increase...

  17. Kubo conductivity of a strongly magnetized two-dimensional plasma.

    Science.gov (United States)

    Montgomery, D.; Tappert, F.

    1971-01-01

    The Kubo formula is used to evaluate the bulk electrical conductivity of a two-dimensional guiding-center plasma in a strong dc magnetic field. The particles interact only electrostatically. An ?anomalous' electrical conductivity is derived for this system, which parallels a recent result of Taylor and McNamara for the coefficient of spatial diffusion.

  18. Spatially structured oscillations in a two-dimensional excitatory neuronal network with synaptic depression

    KAUST Repository

    Kilpatrick, Zachary P.

    2009-10-29

    We study the spatiotemporal dynamics of a two-dimensional excitatory neuronal network with synaptic depression. Coupling between populations of neurons is taken to be nonlocal, while depression is taken to be local and presynaptic. We show that the network supports a wide range of spatially structured oscillations, which are suggestive of phenomena seen in cortical slice experiments and in vivo. The particular form of the oscillations depends on initial conditions and the level of background noise. Given an initial, spatially localized stimulus, activity evolves to a spatially localized oscillating core that periodically emits target waves. Low levels of noise can spontaneously generate several pockets of oscillatory activity that interact via their target patterns. Periodic activity in space can also organize into spiral waves, provided that there is some source of rotational symmetry breaking due to external stimuli or noise. In the high gain limit, no oscillatory behavior exists, but a transient stimulus can lead to a single, outward propagating target wave. © Springer Science + Business Media, LLC 2009.

  19. Spatially structured oscillations in a two-dimensional excitatory neuronal network with synaptic depression

    KAUST Repository

    Kilpatrick, Zachary P.; Bressloff, Paul C.

    2009-01-01

    We study the spatiotemporal dynamics of a two-dimensional excitatory neuronal network with synaptic depression. Coupling between populations of neurons is taken to be nonlocal, while depression is taken to be local and presynaptic. We show that the network supports a wide range of spatially structured oscillations, which are suggestive of phenomena seen in cortical slice experiments and in vivo. The particular form of the oscillations depends on initial conditions and the level of background noise. Given an initial, spatially localized stimulus, activity evolves to a spatially localized oscillating core that periodically emits target waves. Low levels of noise can spontaneously generate several pockets of oscillatory activity that interact via their target patterns. Periodic activity in space can also organize into spiral waves, provided that there is some source of rotational symmetry breaking due to external stimuli or noise. In the high gain limit, no oscillatory behavior exists, but a transient stimulus can lead to a single, outward propagating target wave. © Springer Science + Business Media, LLC 2009.

  20. Spatio-temporal organization of dynamics in a two-dimensional periodically driven vortex flow: A Lagrangian flow network perspective.

    Science.gov (United States)

    Lindner, Michael; Donner, Reik V

    2017-03-01

    We study the Lagrangian dynamics of passive tracers in a simple model of a driven two-dimensional vortex resembling real-world geophysical flow patterns. Using a discrete approximation of the system's transfer operator, we construct a directed network that describes the exchange of mass between distinct regions of the flow domain. By studying different measures characterizing flow network connectivity at different time-scales, we are able to identify the location of dynamically invariant structures and regions of maximum dispersion. Specifically, our approach allows us to delimit co-existing flow regimes with different dynamics. To validate our findings, we compare several network characteristics to the well-established finite-time Lyapunov exponents and apply a receiver operating characteristic analysis to identify network measures that are particularly useful for unveiling the skeleton of Lagrangian chaos.

  1. Efficient construction of two-dimensional cluster states with probabilistic quantum gates

    International Nuclear Information System (INIS)

    Chen Qing; Cheng Jianhua; Wang Kelin; Du Jiangfeng

    2006-01-01

    We propose an efficient scheme for constructing arbitrary two-dimensional (2D) cluster states using probabilistic entangling quantum gates. In our scheme, the 2D cluster state is constructed with starlike basic units generated from 1D cluster chains. By applying parallel operations, the process of generating 2D (or higher-dimensional) cluster states is significantly accelerated, which provides an efficient way to implement realistic one-way quantum computers

  2. Improved Path Loss Simulation Incorporating Three-Dimensional Terrain Model Using Parallel Coprocessors

    Directory of Open Access Journals (Sweden)

    Zhang Bin Loo

    2017-01-01

    Full Text Available Current network simulators abstract out wireless propagation models due to the high computation requirements for realistic modeling. As such, there is still a large gap between the results obtained from simulators and real world scenario. In this paper, we present a framework for improved path loss simulation built on top of an existing network simulation software, NS-3. Different from the conventional disk model, the proposed simulation also considers the diffraction loss computed using Epstein and Peterson’s model through the use of actual terrain elevation data to give an accurate estimate of path loss between a transmitter and a receiver. The drawback of high computation requirements is relaxed by offloading the computationally intensive components onto an inexpensive off-the-shelf parallel coprocessor, which is a NVIDIA GPU. Experiments are performed using actual terrain elevation data provided from United States Geological Survey. As compared to the conventional CPU architecture, the experimental result shows that a speedup of 20x to 42x is achieved by exploiting the parallel processing of GPU to compute the path loss between two nodes using terrain elevation data. The result shows that the path losses between two nodes are greatly affected by the terrain profile between these two nodes. Besides this, the result also suggests that the common strategy to place the transmitter in the highest position may not always work.

  3. Relativistic effects in the energy loss of a fast charged particle moving parallel to a two-dimensional electron gas

    Science.gov (United States)

    Mišković, Zoran L.; Akbari, Kamran; Segui, Silvina; Gervasoni, Juana L.; Arista, Néstor R.

    2018-05-01

    We present a fully relativistic formulation for the energy loss rate of a charged particle moving parallel to a sheet containing two-dimensional electron gas, allowing that its in-plane polarization may be described by different longitudinal and transverse conductivities. We apply our formulation to the case of a doped graphene layer in the terahertz range of frequencies, where excitation of the Dirac plasmon polariton (DPP) in graphene plays a major role. By using the Drude model with zero damping we evaluate the energy loss rate due to excitation of the DPP, and show that the retardation effects are important when the incident particle speed and its distance from graphene both increase. Interestingly, the retarded energy loss rate obtained in this manner may be both larger and smaller than its non-retarded counterpart for different combinations of the particle speed and distance.

  4. Two- to three-dimensional crossover in a dense electron liquid in silicon

    Science.gov (United States)

    Matmon, Guy; Ginossar, Eran; Villis, Byron J.; Kölker, Alex; Lim, Tingbin; Solanki, Hari; Schofield, Steven R.; Curson, Neil J.; Li, Juerong; Murdin, Ben N.; Fisher, Andrew J.; Aeppli, Gabriel

    2018-04-01

    Doping of silicon via phosphine exposures alternating with molecular beam epitaxy overgrowth is a path to Si:P substrates for conventional microelectronics and quantum information technologies. The technique also provides a well-controlled material for systematic studies of two-dimensional lattices with a half-filled band. We show here that for a dense (ns=2.8 ×1014 cm-2) disordered two-dimensional array of P atoms, the full field magnitude and angle-dependent magnetotransport is remarkably well described by classic weak localization theory with no corrections due to interaction. The two- to three-dimensional crossover seen upon warming can also be interpreted using scaling concepts developed for anistropic three-dimensional materials, which work remarkably except when the applied fields are nearly parallel to the conducting planes.

  5. Two dimensional hybrid simulation of a curved bow shock

    International Nuclear Information System (INIS)

    Thomas, V.A.; Winske, D.

    1990-01-01

    Results are presented from two dimensional hybrid simulations of curved collisionless supercritical shocks, retaining both quasi-perpendicular and quasi-parallel sections of the shock in order to study the character and origin of the foreshock ion population. The simulations demonstrate that the foreshock ion population is dominated by ions impinging upon the quasi-parallel side of the shock, while nonlocal transport from the quasi-perpendicular side of the shock into the foreshock region is minimal. Further, it is shown that the ions gain energy by drifting significantly in the direction of the convection electric field through multiple shock encounters

  6. PARALLEL ALGORITHM FOR THREE-DIMENSIONAL STOKES FLOW SIMULATION USING BOUNDARY ELEMENT METHOD

    Directory of Open Access Journals (Sweden)

    D. G. Pribytok

    2016-01-01

    Full Text Available Parallel computing technique for modeling three-dimensional viscous flow (Stokes flow using direct boundary element method is presented. The problem is solved in three phases: sampling and construction of system of linear algebraic equations (SLAE, its decision and finding the velocity of liquid at predetermined points. For construction of the system and finding the velocity, the parallel algorithms using graphics CUDA cards programming technology have been developed and implemented. To solve the system of linear algebraic equations the implemented software libraries are used. A comparison of time consumption for three main algorithms on the example of calculation of viscous fluid motion in three-dimensional cavity is performed.

  7. Two-dimensional transport of tokamak plasmas

    International Nuclear Information System (INIS)

    Hirshman, S.P.; Jardin, S.C.

    1979-01-01

    A reduced set of two-fluid transport equations is obtained from the conservation equations describing the time evolution of the differential particle number, entropy, and magnetic fluxes in an axisymmetric toroidal plasma with nested magnetic surfaces. Expanding in the small ratio of perpendicular to parallel mobilities and thermal conductivities yields as solubility constraints one-dimensional equations for the surface-averaged thermodynamic variables and magnetic fluxes. Since Ohm's law E +u x B =R', where R' accounts for any nonideal effects, only determines the particle flow relative to the diffusing magnetic surfaces, it is necessary to solve a single two-dimensional generalized differential equation, (partial/partialt) delpsi. (delp - J x B) =0, to find the absolute velocity of a magnetic surface enclosing a fixed toroidal flux. This equation is linear but nonstandard in that it involves flux surface averages of the unknown velocity. Specification of R' and the cross-field ion and electron heat fluxes provides a closed system of equations. A time-dependent coordinate transformation is used to describe the diffusion of plasma quantities through magnetic surfaces of changing shape

  8. Logarithmic Superdiffusion in Two Dimensional Driven Lattice Gases

    Science.gov (United States)

    Krug, J.; Neiss, R. A.; Schadschneider, A.; Schmidt, J.

    2018-03-01

    The spreading of density fluctuations in two-dimensional driven diffusive systems is marginally anomalous. Mode coupling theory predicts that the diffusivity in the direction of the drive diverges with time as (ln t)^{2/3} with a prefactor depending on the macroscopic current-density relation and the diffusion tensor of the fluctuating hydrodynamic field equation. Here we present the first numerical verification of this behavior for a particular version of the two-dimensional asymmetric exclusion process. Particles jump strictly asymmetrically along one of the lattice directions and symmetrically along the other, and an anisotropy parameter p governs the ratio between the two rates. Using a novel massively parallel coupling algorithm that strongly reduces the fluctuations in the numerical estimate of the two-point correlation function, we are able to accurately determine the exponent of the logarithmic correction. In addition, the variation of the prefactor with p provides a stringent test of mode coupling theory.

  9. High performance computing of density matrix renormalization group method for 2-dimensional model. Parallelization strategy toward peta computing

    International Nuclear Information System (INIS)

    Yamada, Susumu; Igarashi, Ryo; Machida, Masahiko; Imamura, Toshiyuki; Okumura, Masahiko; Onishi, Hiroaki

    2010-01-01

    We parallelize the density matrix renormalization group (DMRG) method, which is a ground-state solver for one-dimensional quantum lattice systems. The parallelization allows us to extend the applicable range of the DMRG to n-leg ladders i.e., quasi two-dimension cases. Such an extension is regarded to bring about several breakthroughs in e.g., quantum-physics, chemistry, and nano-engineering. However, the straightforward parallelization requires all-to-all communications between all processes which are unsuitable for multi-core systems, which is a mainstream of current parallel computers. Therefore, we optimize the all-to-all communications by the following two steps. The first one is the elimination of the communications between all processes by only rearranging data distribution with the communication data amount kept. The second one is the avoidance of the communication conflict by rescheduling the calculation and the communication. We evaluate the performance of the DMRG method on multi-core supercomputers and confirm that our two-steps tuning is quite effective. (author)

  10. Decentralized Cooperation Strategies in Two-Dimensional Traffic of Cellular Automata

    International Nuclear Information System (INIS)

    Fang Jun; Qin Zheng; Xu Zhaohui; Chen Xiqun; Leng Biao; Jiang Zineng

    2012-01-01

    We study the two-dimensional traffic of cellular automata using computer simulation. We propose two type of decentralized cooperation strategies, which are called stepping aside (CS-SA) and choosing alternative routes (CS-CAR) respectively. We introduce them into an existing two-dimensional cellular automata (CA) model. CS-SA is designed to prohibit a kind of ping-pong jump when two objects standing together try to move in opposite directions. CS-CAR is designed to change the solution of conflict in parallel update. CS-CAR encourages the objects involved in parallel conflicts choose their alternative routes instead of waiting. We also combine the two cooperation strategies (CS-SA-CAR) to test their combined effects. It is found that the system keeps on a partial jam phase with nonzero velocity and flow until the density reaches one. The ratios of the ping-pong jump and the waiting objects involved in conflict are decreased obviously, especially at the free phase. And the average flow is improved by the three cooperation strategies. Although the average travel time is lengthened a bit by CS-CAR, it is shorten by CS-SA and CS-SA-CAR. In addition, we discuss the advantage and applicability of decentralized cooperation modeling.

  11. Entropy resistance analyses of a two-stream parallel flow heat exchanger with viscous heating

    International Nuclear Information System (INIS)

    Cheng Xue-Tao; Liang Xin-Gang

    2013-01-01

    Heat exchangers are widely used in industry, and analyses and optimizations of the performance of heat exchangers are important topics. In this paper, we define the concept of entropy resistance based on the entropy generation analyses of a one-dimensional heat transfer process. With this concept, a two-stream parallel flow heat exchanger with viscous heating is analyzed and discussed. It is found that the minimization of entropy resistance always leads to the maximum heat transfer rate for the discussed two-stream parallel flow heat exchanger, while the minimizations of entropy generation rate, entropy generation numbers, and revised entropy generation number do not always. (general)

  12. Domain decomposition parallel computing for transient two-phase flow of nuclear reactors

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Jae Ryong; Yoon, Han Young [KAERI, Daejeon (Korea, Republic of); Choi, Hyoung Gwon [Seoul National University, Seoul (Korea, Republic of)

    2016-05-15

    KAERI (Korea Atomic Energy Research Institute) has been developing a multi-dimensional two-phase flow code named CUPID for multi-physics and multi-scale thermal hydraulics analysis of Light water reactors (LWRs). The CUPID code has been validated against a set of conceptual problems and experimental data. In this work, the CUPID code has been parallelized based on the domain decomposition method with Message passing interface (MPI) library. For domain decomposition, the CUPID code provides both manual and automatic methods with METIS library. For the effective memory management, the Compressed sparse row (CSR) format is adopted, which is one of the methods to represent the sparse asymmetric matrix. CSR format saves only non-zero value and its position (row and column). By performing the verification for the fundamental problem set, the parallelization of the CUPID has been successfully confirmed. Since the scalability of a parallel simulation is generally known to be better for fine mesh system, three different scales of mesh system are considered: 40000 meshes for coarse mesh system, 320000 meshes for mid-size mesh system, and 2560000 meshes for fine mesh system. In the given geometry, both single- and two-phase calculations were conducted. In addition, two types of preconditioners for a matrix solver were compared: Diagonal and incomplete LU preconditioner. In terms of enhancement of the parallel performance, the OpenMP and MPI hybrid parallel computing for a pressure solver was examined. It is revealed that the scalability of hybrid calculation was enhanced for the multi-core parallel computation.

  13. Sensitivity analysis explains quasi-one-dimensional current transport in two-dimensional materials

    DEFF Research Database (Denmark)

    Boll, Mads; Lotz, Mikkel Rønne; Hansen, Ole

    2014-01-01

    We demonstrate that the quasi-one-dimensional (1D) current transport, experimentally observed in graphene as measured by a collinear four-point probe in two electrode configurations A and B, can be interpreted using the sensitivity functions of the two electrode configurations (configurations...... A and B represents different pairs of electrodes chosen for current sources and potential measurements). The measured sheet resistance in a four-point probe measurement is averaged over an area determined by the sensitivity function. For a two-dimensional conductor, the sensitivity functions for electrode...... configurations A and B are different. But when the current is forced to flow through a percolation network, e.g., graphene with high density of extended defects, the two sensitivity functions become identical. This is equivalent to a four-point measurement on a line resistor, hence quasi-1D transport...

  14. Two-Dimensional Extreme Learning Machine

    Directory of Open Access Journals (Sweden)

    Bo Jia

    2015-01-01

    (BP networks. However, like many other methods, ELM is originally proposed to handle vector pattern while nonvector patterns in real applications need to be explored, such as image data. We propose the two-dimensional extreme learning machine (2DELM based on the very natural idea to deal with matrix data directly. Unlike original ELM which handles vectors, 2DELM take the matrices as input features without vectorization. Empirical studies on several real image datasets show the efficiency and effectiveness of the algorithm.

  15. On the Geometrical Characteristics of Three-Dimensional Wireless Ad Hoc Networks and Their Applications

    Directory of Open Access Journals (Sweden)

    2006-01-01

    Full Text Available In a wireless ad hoc network, messages are transmitted, received, and forwarded in a finite geometrical region and the transmission of messages is highly dependent on the locations of the nodes. Therefore the study of geometrical relationship between nodes in wireless ad hoc networks is of fundamental importance in the network architecture design and performance evaluation. However, most previous works concentrated on the networks deployed in the two-dimensional region or in the infinite three-dimensional space, while in many cases wireless ad hoc networks are deployed in the finite three-dimensional space. In this paper, we analyze the geometrical characteristics of the three-dimensional wireless ad hoc network in a finite space in the framework of random graph and deduce an expression to calculate the distance probability distribution between network nodes that are independently and uniformly distributed in a finite cuboid space. Based on the theoretical result, we present some meaningful results on the finite three-dimensional network performance, including the node degree and the max-flow capacity. Furthermore, we investigate some approximation properties of the distance probability distribution function derived in the paper.

  16. MapReduce Based Parallel Neural Networks in Enabling Large Scale Machine Learning.

    Science.gov (United States)

    Liu, Yang; Yang, Jie; Huang, Yuan; Xu, Lixiong; Li, Siguang; Qi, Man

    2015-01-01

    Artificial neural networks (ANNs) have been widely used in pattern recognition and classification applications. However, ANNs are notably slow in computation especially when the size of data is large. Nowadays, big data has received a momentum from both industry and academia. To fulfill the potentials of ANNs for big data applications, the computation process must be speeded up. For this purpose, this paper parallelizes neural networks based on MapReduce, which has become a major computing model to facilitate data intensive applications. Three data intensive scenarios are considered in the parallelization process in terms of the volume of classification data, the size of the training data, and the number of neurons in the neural network. The performance of the parallelized neural networks is evaluated in an experimental MapReduce computer cluster from the aspects of accuracy in classification and efficiency in computation.

  17. Magnetic structure of two- and three-dimensional supramolecular compounds

    Energy Technology Data Exchange (ETDEWEB)

    Decurtins, S.; Schmalle, H.W.; Pellaux, R. [Zurich Univ. (Switzerland); Fischer, P.; Fauth, F. [Paul Scherrer Inst. (PSI), Villigen (Switzerland); Ouladdiaf, B. [Institut Max von Laue - Paul Langevin, 75 - Paris (France)

    1997-09-01

    Supramolecular chiral networks of oxalato-bridged transition metals show either two- or three-dimensional structural features. The magnetic structures of such compounds have been investigated by means of elastic neutron powder diffraction. (author) 2 figs., 2 refs.

  18. Disordered configurations of the Glauber model in two-dimensional networks

    Science.gov (United States)

    Bačić, Iva; Franović, Igor; Perc, Matjaž

    2017-12-01

    We analyze the ordering efficiency and the structure of disordered configurations for the zero-temperature Glauber model on Watts-Strogatz networks obtained by rewiring 2D regular square lattices. In the small-world regime, the dynamics fails to reach the ordered state in the thermodynamic limit. Due to the interplay of the perturbed regular topology and the energy neutral stochastic state transitions, the stationary state consists of two intertwined domains, manifested as multiclustered states on the original lattice. Moreover, for intermediate rewiring probabilities, one finds an additional source of disorder due to the low connectivity degree, which gives rise to small isolated droplets of spins. We also examine the ordering process in paradigmatic two-layer networks with heterogeneous rewiring probabilities. Comparing the cases of a multiplex network and the corresponding network with random inter-layer connectivity, we demonstrate that the character of the final state qualitatively depends on the type of inter-layer connections.

  19. Neural nets for massively parallel optimization

    Science.gov (United States)

    Dixon, Laurence C. W.; Mills, David

    1992-07-01

    To apply massively parallel processing systems to the solution of large scale optimization problems it is desirable to be able to evaluate any function f(z), z (epsilon) Rn in a parallel manner. The theorem of Cybenko, Hecht Nielsen, Hornik, Stinchcombe and White, and Funahasi shows that this can be achieved by a neural network with one hidden layer. In this paper we address the problem of the number of nodes required in the layer to achieve a given accuracy in the function and gradient values at all points within a given n dimensional interval. The type of activation function needed to obtain nonsingular Hessian matrices is described and a strategy for obtaining accurate minimal networks presented.

  20. MapReduce Based Parallel Neural Networks in Enabling Large Scale Machine Learning

    Directory of Open Access Journals (Sweden)

    Yang Liu

    2015-01-01

    Full Text Available Artificial neural networks (ANNs have been widely used in pattern recognition and classification applications. However, ANNs are notably slow in computation especially when the size of data is large. Nowadays, big data has received a momentum from both industry and academia. To fulfill the potentials of ANNs for big data applications, the computation process must be speeded up. For this purpose, this paper parallelizes neural networks based on MapReduce, which has become a major computing model to facilitate data intensive applications. Three data intensive scenarios are considered in the parallelization process in terms of the volume of classification data, the size of the training data, and the number of neurons in the neural network. The performance of the parallelized neural networks is evaluated in an experimental MapReduce computer cluster from the aspects of accuracy in classification and efficiency in computation.

  1. Parallel trajectory similarity joins in spatial networks

    KAUST Repository

    Shang, Shuo

    2018-04-04

    The matching of similar pairs of objects, called similarity join, is fundamental functionality in data management. We consider two cases of trajectory similarity joins (TS-Joins), including a threshold-based join (Tb-TS-Join) and a top-k TS-Join (k-TS-Join), where the objects are trajectories of vehicles moving in road networks. Given two sets of trajectories and a threshold θ, the Tb-TS-Join returns all pairs of trajectories from the two sets with similarity above θ. In contrast, the k-TS-Join does not take a threshold as a parameter, and it returns the top-k most similar trajectory pairs from the two sets. The TS-Joins target diverse applications such as trajectory near-duplicate detection, data cleaning, ridesharing recommendation, and traffic congestion prediction. With these applications in mind, we provide purposeful definitions of similarity. To enable efficient processing of the TS-Joins on large sets of trajectories, we develop search space pruning techniques and enable use of the parallel processing capabilities of modern processors. Specifically, we present a two-phase divide-and-conquer search framework that lays the foundation for the algorithms for the Tb-TS-Join and the k-TS-Join that rely on different pruning techniques to achieve efficiency. For each trajectory, the algorithms first find similar trajectories. Then they merge the results to obtain the final result. The algorithms for the two joins exploit different upper and lower bounds on the spatiotemporal trajectory similarity and different heuristic scheduling strategies for search space pruning. Their per-trajectory searches are independent of each other and can be performed in parallel, and the mergings have constant cost. An empirical study with real data offers insight in the performance of the algorithms and demonstrates that they are capable of outperforming well-designed baseline algorithms by an order of magnitude.

  2. Parallel trajectory similarity joins in spatial networks

    KAUST Repository

    Shang, Shuo; Chen, Lisi; Wei, Zhewei; Jensen, Christian S.; Zheng, Kai; Kalnis, Panos

    2018-01-01

    The matching of similar pairs of objects, called similarity join, is fundamental functionality in data management. We consider two cases of trajectory similarity joins (TS-Joins), including a threshold-based join (Tb-TS-Join) and a top-k TS-Join (k-TS-Join), where the objects are trajectories of vehicles moving in road networks. Given two sets of trajectories and a threshold θ, the Tb-TS-Join returns all pairs of trajectories from the two sets with similarity above θ. In contrast, the k-TS-Join does not take a threshold as a parameter, and it returns the top-k most similar trajectory pairs from the two sets. The TS-Joins target diverse applications such as trajectory near-duplicate detection, data cleaning, ridesharing recommendation, and traffic congestion prediction. With these applications in mind, we provide purposeful definitions of similarity. To enable efficient processing of the TS-Joins on large sets of trajectories, we develop search space pruning techniques and enable use of the parallel processing capabilities of modern processors. Specifically, we present a two-phase divide-and-conquer search framework that lays the foundation for the algorithms for the Tb-TS-Join and the k-TS-Join that rely on different pruning techniques to achieve efficiency. For each trajectory, the algorithms first find similar trajectories. Then they merge the results to obtain the final result. The algorithms for the two joins exploit different upper and lower bounds on the spatiotemporal trajectory similarity and different heuristic scheduling strategies for search space pruning. Their per-trajectory searches are independent of each other and can be performed in parallel, and the mergings have constant cost. An empirical study with real data offers insight in the performance of the algorithms and demonstrates that they are capable of outperforming well-designed baseline algorithms by an order of magnitude.

  3. MMC with parallel-connected MOSFETs as an alternative to wide bandgap converters for LVDC distribution networks

    Directory of Open Access Journals (Sweden)

    Yanni Zhong

    2017-03-01

    Full Text Available Low-voltage direct-current (LVDC networks offer improved conductor utilisation on existing infrastructure and reduced conversion stages, which can lead to a simpler and more efficient distribution network. However, LVDC networks must continue to support AC loads, requiring efficient, low-distortion DC–AC converters. Additionally, increasing numbers of DC loads on the LVAC network require controlled, low-distortion, unity power factor AC-DC converters with large capacity, and bi-directional capability. An AC–DC/DC–AC converter design is therefore proposed in this study to minimise conversion loss and maximise power quality. Comparative analysis is performed for a conventional IGBT two-level converter, a SiC MOSFET two-level converter, a Si MOSFET modular multi-level converter (MMC and a GaN HEMT MMC, in terms of power loss, reliability, fault tolerance, converter cost and heatsink size. The analysis indicates that the five-level MMC with parallel-connected Si MOSFETs is an efficient, cost-effective converter for low-voltage converter applications. MMC converters suffer negligible switching loss, which enables reduced device switching without loss penalty from increased harmonics and filtering. Optimal extent of parallel-connection for MOSFETs in an MMC is investigated. Experimental results are presented to show the reduction in device stress and electromagnetic interference generating transients through the use of reduced switching and device parallel-connection.

  4. Cylindrical Three-Dimensional Porous Anodic Alumina Networks

    Directory of Open Access Journals (Sweden)

    Pedro M. Resende

    2016-11-01

    Full Text Available The synthesis of a conformal three-dimensional nanostructure based on porous anodic alumina with transversal nanopores on wires is herein presented. The resulting three-dimensional network exhibits the same nanostructure as that obtained on planar geometries, but with a macroscopic cylindrical geometry. The morphological analysis of the nanostructure revealed the effects of the initial defects on the aluminum surface and the mechanical strains on the integrity of the three-dimensional network. The results evidence the feasibility of obtaining 3D porous anodic alumina on non-planar aluminum substrates.

  5. MPIGeneNet: Parallel Calculation of Gene Co-Expression Networks on Multicore Clusters.

    Science.gov (United States)

    Gonzalez-Dominguez, Jorge; Martin, Maria J

    2017-10-10

    In this work we present MPIGeneNet, a parallel tool that applies Pearson's correlation and Random Matrix Theory to construct gene co-expression networks. It is based on the state-of-the-art sequential tool RMTGeneNet, which provides networks with high robustness and sensitivity at the expenses of relatively long runtimes for large scale input datasets. MPIGeneNet returns the same results as RMTGeneNet but improves the memory management, reduces the I/O cost, and accelerates the two most computationally demanding steps of co-expression network construction by exploiting the compute capabilities of common multicore CPU clusters. Our performance evaluation on two different systems using three typical input datasets shows that MPIGeneNet is significantly faster than RMTGeneNet. As an example, our tool is up to 175.41 times faster on a cluster with eight nodes, each one containing two 12-core Intel Haswell processors. Source code of MPIGeneNet, as well as a reference manual, are available at https://sourceforge.net/projects/mpigenenet/.

  6. Computational chaos in massively parallel neural networks

    Science.gov (United States)

    Barhen, Jacob; Gulati, Sandeep

    1989-01-01

    A fundamental issue which directly impacts the scalability of current theoretical neural network models to massively parallel embodiments, in both software as well as hardware, is the inherent and unavoidable concurrent asynchronicity of emerging fine-grained computational ensembles and the possible emergence of chaotic manifestations. Previous analyses attributed dynamical instability to the topology of the interconnection matrix, to parasitic components or to propagation delays. However, researchers have observed the existence of emergent computational chaos in a concurrently asynchronous framework, independent of the network topology. Researcher present a methodology enabling the effective asynchronous operation of large-scale neural networks. Necessary and sufficient conditions guaranteeing concurrent asynchronous convergence are established in terms of contracting operators. Lyapunov exponents are computed formally to characterize the underlying nonlinear dynamics. Simulation results are presented to illustrate network convergence to the correct results, even in the presence of large delays.

  7. Applications of neural networks to the studies of phase transitions of two-dimensional Potts models

    Science.gov (United States)

    Li, C.-D.; Tan, D.-R.; Jiang, F.-J.

    2018-04-01

    We study the phase transitions of two-dimensional (2D) Q-states Potts models on the square lattice, using the first principles Monte Carlo (MC) simulations as well as the techniques of neural networks (NN). We demonstrate that the ideas from NN can be adopted to study these considered phase transitions efficiently. In particular, even with a simple NN constructed in this investigation, we are able to obtain the relevant information of the nature of these phase transitions, namely whether they are first order or second order. Our results strengthen the potential applicability of machine learning in studying various states of matters. Subtlety of applying NN techniques to investigate many-body systems is briefly discussed as well.

  8. Energy Efficient Position-Based Three Dimensional Routing for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jeongdae Kim

    2008-04-01

    Full Text Available In this paper, we focus on an energy efficient position-based three dimensional (3D routing algorithm using distance information, which affects transmission power consumption between nodes as a metric. In wireless sensor networks, energy efficiency is one of the primary objectives of research. In addition, recent interest in sensor networks is extended to the need to understand how to design networks in a 3D space. Generally, most wireless sensor networks are based on two dimensional (2D designs. However, in reality, such networks operate in a 3D space. Since 2D designs are simpler and easier to implement than 3D designs for routing algorithms in wireless sensor networks, the 2D assumption is somewhat justified and usually does not lead to major inaccuracies. However, in some applications such as an airborne to terrestrial sensor networks or sensor networks, which are deployed in mountains, taking 3D designs into consideration is reasonable. In this paper, we propose the Minimum Sum of Square distance (MSoS algorithm as an energy efficient position-based three dimensional routing algorithm. In addition, we evaluate and compare the performance of the proposed routing algorithm with other algorithms through simulation. Finally, the results of the simulation show that the proposed routing algorithm is more energy efficient than other algorithms in a 3D space.

  9. Two-dimensional core calculation research for fuel management optimization based on CPACT code

    International Nuclear Information System (INIS)

    Chen Xiaosong; Peng Lianghui; Gang Zhi

    2013-01-01

    Fuel management optimization process requires rapid assessment for the core layout program, and the commonly used methods include two-dimensional diffusion nodal method, perturbation method, neural network method and etc. A two-dimensional loading patterns evaluation code was developed based on the three-dimensional LWR diffusion calculation program CPACT. Axial buckling introduced to simulate the axial leakage was searched in sub-burnup sections to correct the two-dimensional core diffusion calculation results. Meanwhile, in order to get better accuracy, the weight equivalent volume method of the control rod assembly cross-section was improved. (authors)

  10. Scalable parallel prefix solvers for discrete ordinates transport

    International Nuclear Information System (INIS)

    Pautz, S.; Pandya, T.; Adams, M.

    2009-01-01

    The well-known 'sweep' algorithm for inverting the streaming-plus-collision term in first-order deterministic radiation transport calculations has some desirable numerical properties. However, it suffers from parallel scaling issues caused by a lack of concurrency. The maximum degree of concurrency, and thus the maximum parallelism, grows more slowly than the problem size for sweeps-based solvers. We investigate a new class of parallel algorithms that involves recasting the streaming-plus-collision problem in prefix form and solving via cyclic reduction. This method, although computationally more expensive at low levels of parallelism than the sweep algorithm, offers better theoretical scalability properties. Previous work has demonstrated this approach for one-dimensional calculations; we show how to extend it to multidimensional calculations. Notably, for multiple dimensions it appears that this approach is limited to long-characteristics discretizations; other discretizations cannot be cast in prefix form. We implement two variants of the algorithm within the radlib/SCEPTRE transport code library at Sandia National Laboratories and show results on two different massively parallel systems. Both the 'forward' and 'symmetric' solvers behave similarly, scaling well to larger degrees of parallelism then sweeps-based solvers. We do observe some issues at the highest levels of parallelism (relative to the system size) and discuss possible causes. We conclude that this approach shows good potential for future parallel systems, but the parallel scalability will depend heavily on the architecture of the communication networks of these systems. (authors)

  11. Energy Efficiency Analysis of a Two Dimensional Cooperative Wireless Sensor Network with Relay Selection

    Directory of Open Access Journals (Sweden)

    M. Kakitani

    2013-06-01

    Full Text Available The energy efficiency of non-cooperative and cooperative transmissions are investigated in a two-dimensional wireless sensor network, considering a target outage probability and the same end-to-end throughput for all transmission schemes. The impact of the relay selection method in the cooperative schemes is also analyzed. We show that under non line-of-sight conditions the relay selection method has a greater impact in the energy efficiency than the availability of a return channel. By its turn, under line-of-sight conditions a return channel is more valuable to the energy efficiency of cooperative transmission than the specific relay selection method. Finally, we demonstrate that the energy efficiency advantage of the cooperative over the non-cooperative transmission increases with the distance among nodes and with the nodes density.

  12. Two-dimensional errors

    International Nuclear Information System (INIS)

    Anon.

    1991-01-01

    This chapter addresses the extension of previous work in one-dimensional (linear) error theory to two-dimensional error analysis. The topics of the chapter include the definition of two-dimensional error, the probability ellipse, the probability circle, elliptical (circular) error evaluation, the application to position accuracy, and the use of control systems (points) in measurements

  13. Focused two-dimensional antiscatter grid for mammography

    International Nuclear Information System (INIS)

    Makarova, O.V.; Moldovan, N.; Tang, C.-M.; Mancini, D.C.; Divan, R.; Zyryanov, V.N.; Ryding, D.C.; Yaeger, J.; Liu, C.

    2002-01-01

    We are developing freestanding high-aspect-ratio, focused, two-dimensional antiscatter grids for mammography using deep x-ray lithography and copper electroforming. The exposure is performed using x-rays from bending magnet beamline 2-BM at the Advanced Photon Source (APS) of Argonne National Laboratory. A 2.8-mm-thick prototype freestanding copper antiscatter grid with 25 (micro)m-wide parallel cell walls and 550 (micro)m periodicity has been fabricated. The progress in developing a dynamic double-exposure technique to create the grid with the cell walls aligned to a point x-ray source of the mammography system is discussed

  14. Network patterns in exponentially growing two-dimensional biofilms

    Science.gov (United States)

    Zachreson, Cameron; Yap, Xinhui; Gloag, Erin S.; Shimoni, Raz; Whitchurch, Cynthia B.; Toth, Milos

    2017-10-01

    Anisotropic collective patterns occur frequently in the morphogenesis of two-dimensional biofilms. These patterns are often attributed to growth regulation mechanisms and differentiation based on gradients of diffusing nutrients and signaling molecules. Here, we employ a model of bacterial growth dynamics to show that even in the absence of growth regulation or differentiation, confinement by an enclosing medium such as agar can itself lead to stable pattern formation over time scales that are employed in experiments. The underlying mechanism relies on path formation through physical deformation of the enclosing environment.

  15. Application of the DMRG in two dimensions: a parallel tempering algorithm

    Science.gov (United States)

    Hu, Shijie; Zhao, Jize; Zhang, Xuefeng; Eggert, Sebastian

    The Density Matrix Renormalization Group (DMRG) is known to be a powerful algorithm for treating one-dimensional systems. When the DMRG is applied in two dimensions, however, the convergence becomes much less reliable and typically ''metastable states'' may appear, which are unfortunately quite robust even when keeping a very high number of DMRG states. To overcome this problem we have now successfully developed a parallel tempering DMRG algorithm. Similar to parallel tempering in quantum Monte Carlo, this algorithm allows the systematic switching of DMRG states between different model parameters, which is very efficient for solving convergence problems. Using this method we have figured out the phase diagram of the xxz model on the anisotropic triangular lattice which can be realized by hardcore bosons in optical lattices. SFB Transregio 49 of the Deutsche Forschungsgemeinschaft (DFG) and the Allianz fur Hochleistungsrechnen Rheinland-Pfalz (AHRP).

  16. Parallel protein secondary structure prediction based on neural networks.

    Science.gov (United States)

    Zhong, Wei; Altun, Gulsah; Tian, Xinmin; Harrison, Robert; Tai, Phang C; Pan, Yi

    2004-01-01

    Protein secondary structure prediction has a fundamental influence on today's bioinformatics research. In this work, binary and tertiary classifiers of protein secondary structure prediction are implemented on Denoeux belief neural network (DBNN) architecture. Hydrophobicity matrix, orthogonal matrix, BLOSUM62 and PSSM (position specific scoring matrix) are experimented separately as the encoding schemes for DBNN. The experimental results contribute to the design of new encoding schemes. New binary classifier for Helix versus not Helix ( approximately H) for DBNN produces prediction accuracy of 87% when PSSM is used for the input profile. The performance of DBNN binary classifier is comparable to other best prediction methods. The good test results for binary classifiers open a new approach for protein structure prediction with neural networks. Due to the time consuming task of training the neural networks, Pthread and OpenMP are employed to parallelize DBNN in the hyperthreading enabled Intel architecture. Speedup for 16 Pthreads is 4.9 and speedup for 16 OpenMP threads is 4 in the 4 processors shared memory architecture. Both speedup performance of OpenMP and Pthread is superior to that of other research. With the new parallel training algorithm, thousands of amino acids can be processed in reasonable amount of time. Our research also shows that hyperthreading technology for Intel architecture is efficient for parallel biological algorithms.

  17. Multispectral embedding-based deep neural network for three-dimensional human pose recovery

    Science.gov (United States)

    Yu, Jialin; Sun, Jifeng

    2018-01-01

    Monocular image-based three-dimensional (3-D) human pose recovery aims to retrieve 3-D poses using the corresponding two-dimensional image features. Therefore, the pose recovery performance highly depends on the image representations. We propose a multispectral embedding-based deep neural network (MSEDNN) to automatically obtain the most discriminative features from multiple deep convolutional neural networks and then embed their penultimate fully connected layers into a low-dimensional manifold. This compact manifold can explore not only the optimum output from multiple deep networks but also the complementary properties of them. Furthermore, the distribution of each hierarchy discriminative manifold is sufficiently smooth so that the training process of our MSEDNN can be effectively implemented only using few labeled data. Our proposed network contains a body joint detector and a human pose regressor that are jointly trained. Extensive experiments conducted on four databases show that our proposed MSEDNN can achieve the best recovery performance compared with the state-of-the-art methods.

  18. Parallel Implementation of the Multi-Dimensional Spectral Code SPECT3D on large 3D grids.

    Science.gov (United States)

    Golovkin, Igor E.; Macfarlane, Joseph J.; Woodruff, Pamela R.; Pereyra, Nicolas A.

    2006-10-01

    The multi-dimensional collisional-radiative, spectral analysis code SPECT3D can be used to study radiation from complex plasmas. SPECT3D can generate instantaneous and time-gated images and spectra, space-resolved and streaked spectra, which makes it a valuable tool for post-processing hydrodynamics calculations and direct comparison between simulations and experimental data. On large three dimensional grids, transporting radiation along lines of sight (LOS) requires substantial memory and CPU resources. Currently, the parallel option in SPECT3D is based on parallelization over photon frequencies and allows for a nearly linear speed-up for a variety of problems. In addition, we are introducing a new parallel mechanism that will greatly reduce memory requirements. In the new implementation, spatial domain decomposition will be utilized allowing transport along a LOS to be performed only on the mesh cells the LOS crosses. The ability to operate on a fraction of the grid is crucial for post-processing the results of large-scale three-dimensional hydrodynamics simulations. We will present a parallel implementation of the code and provide a scalability study performed on a Linux cluster.

  19. A new asynchronous parallel algorithm for inferring large-scale gene regulatory networks.

    Directory of Open Access Journals (Sweden)

    Xiangyun Xiao

    Full Text Available The reconstruction of gene regulatory networks (GRNs from high-throughput experimental data has been considered one of the most important issues in systems biology research. With the development of high-throughput technology and the complexity of biological problems, we need to reconstruct GRNs that contain thousands of genes. However, when many existing algorithms are used to handle these large-scale problems, they will encounter two important issues: low accuracy and high computational cost. To overcome these difficulties, the main goal of this study is to design an effective parallel algorithm to infer large-scale GRNs based on high-performance parallel computing environments. In this study, we proposed a novel asynchronous parallel framework to improve the accuracy and lower the time complexity of large-scale GRN inference by combining splitting technology and ordinary differential equation (ODE-based optimization. The presented algorithm uses the sparsity and modularity of GRNs to split whole large-scale GRNs into many small-scale modular subnetworks. Through the ODE-based optimization of all subnetworks in parallel and their asynchronous communications, we can easily obtain the parameters of the whole network. To test the performance of the proposed approach, we used well-known benchmark datasets from Dialogue for Reverse Engineering Assessments and Methods challenge (DREAM, experimentally determined GRN of Escherichia coli and one published dataset that contains more than 10 thousand genes to compare the proposed approach with several popular algorithms on the same high-performance computing environments in terms of both accuracy and time complexity. The numerical results demonstrate that our parallel algorithm exhibits obvious superiority in inferring large-scale GRNs.

  20. A new asynchronous parallel algorithm for inferring large-scale gene regulatory networks.

    Science.gov (United States)

    Xiao, Xiangyun; Zhang, Wei; Zou, Xiufen

    2015-01-01

    The reconstruction of gene regulatory networks (GRNs) from high-throughput experimental data has been considered one of the most important issues in systems biology research. With the development of high-throughput technology and the complexity of biological problems, we need to reconstruct GRNs that contain thousands of genes. However, when many existing algorithms are used to handle these large-scale problems, they will encounter two important issues: low accuracy and high computational cost. To overcome these difficulties, the main goal of this study is to design an effective parallel algorithm to infer large-scale GRNs based on high-performance parallel computing environments. In this study, we proposed a novel asynchronous parallel framework to improve the accuracy and lower the time complexity of large-scale GRN inference by combining splitting technology and ordinary differential equation (ODE)-based optimization. The presented algorithm uses the sparsity and modularity of GRNs to split whole large-scale GRNs into many small-scale modular subnetworks. Through the ODE-based optimization of all subnetworks in parallel and their asynchronous communications, we can easily obtain the parameters of the whole network. To test the performance of the proposed approach, we used well-known benchmark datasets from Dialogue for Reverse Engineering Assessments and Methods challenge (DREAM), experimentally determined GRN of Escherichia coli and one published dataset that contains more than 10 thousand genes to compare the proposed approach with several popular algorithms on the same high-performance computing environments in terms of both accuracy and time complexity. The numerical results demonstrate that our parallel algorithm exhibits obvious superiority in inferring large-scale GRNs.

  1. Method of Parallel-Hierarchical Network Self-Training and its Application for Pattern Classification and Recognition

    Directory of Open Access Journals (Sweden)

    TIMCHENKO, L.

    2012-11-01

    Full Text Available Propositions necessary for development of parallel-hierarchical (PH network training methods are discussed in this article. Unlike already known structures of the artificial neural network, where non-normalized (absolute similarity criteria are used for comparison, the suggested structure uses a normalized criterion. Based on the analysis of training rules, a conclusion is made that application of two training methods with a teacher is optimal for PH network training: error correction-based training and memory-based training. Mathematical models of training and a combined method of PH network training for recognition of static and dynamic patterns are developed.

  2. Three-dimensional neural cultures produce networks that mimic native brain activity.

    Science.gov (United States)

    Bourke, Justin L; Quigley, Anita F; Duchi, Serena; O'Connell, Cathal D; Crook, Jeremy M; Wallace, Gordon G; Cook, Mark J; Kapsa, Robert M I

    2018-02-01

    Development of brain function is critically dependent on neuronal networks organized through three dimensions. Culture of central nervous system neurons has traditionally been limited to two dimensions, restricting growth patterns and network formation to a single plane. Here, with the use of multichannel extracellular microelectrode arrays, we demonstrate that neurons cultured in a true three-dimensional environment recapitulate native neuronal network formation and produce functional outcomes more akin to in vivo neuronal network activity. Copyright © 2017 John Wiley & Sons, Ltd.

  3. Resonance modes in one-dimensional parallel arrays of Josephson junctions

    International Nuclear Information System (INIS)

    Van der Zant, H.S.J.; Delin, K.A.; Bock, R.D.; Berman, D.; Phillips, J.R.; Orlando, T.P.

    1994-01-01

    We investigate both experimentally and numerically the dynamics of discrete one-dimensional parallel arrays of underdamped Josephson junctions. In a magnetic field, measurements show steps in the current-voltage characteristics which are the discrete analogs of Fiske steps in a long Josephson junction. From the position of the steps, one can construct a plot of the dispersion relation ω(k). We observe a sine--dependence in the dispersion relation due to the discrete nature of our arrays. We also observe an additional, smaller gap at a k-value determined by the periodicity of the vortex lattice. Our measurements are supported by numerical simulations of the full dynamics. The Fiske steps provide an experimental method to measure the self-inductance of 1D parallel arrays. (orig.)

  4. ONE-DIMENSIONAL AND TWO-DIMENSIONAL LEADERSHIP STYLES

    Directory of Open Access Journals (Sweden)

    Nikola Stefanović

    2007-06-01

    Full Text Available In order to motivate their group members to perform certain tasks, leaders use different leadership styles. These styles are based on leaders' backgrounds, knowledge, values, experiences, and expectations. The one-dimensional styles, used by many world leaders, are autocratic and democratic styles. These styles lie on the two opposite sides of the leadership spectrum. In order to precisely define the leadership styles on the spectrum between the autocratic leadership style and the democratic leadership style, leadership theory researchers use two dimensional matrices. The two-dimensional matrices define leadership styles on the basis of different parameters. By using these parameters, one can identify two-dimensional styles.

  5. Row—column visibility graph approach to two-dimensional landscapes

    International Nuclear Information System (INIS)

    Xiao Qin; Pan Xue; Li Xin-Li; Stephen Mutua; Yang Hui-Jie; Jiang Yan; Wang Jian-Yong; Zhang Qing-Jun

    2014-01-01

    A new concept, called the row—column visibility graph, is proposed to map two-dimensional landscapes to complex networks. A cluster coverage is introduced to describe the extensive property of node clusters on a Euclidean lattice. Graphs mapped from fractals generated with the probability redistribution model behave scale-free. They have pattern-induced hierarchical organizations and comparatively much more extensive structures. The scale-free exponent has a negative correlation with the Hurst exponent, however, there is no deterministic relation between them. Graphs for fractals generated with the midpoint displacement model are exponential networks. When the Hurst exponent is large enough (e.g., H > 0.5), the degree distribution decays much more slowly, the average coverage becomes significant large, and the initially hierarchical structure at H < 0.5 is destroyed completely. Hence, the row—column visibility graph can be used to detect the pattern-related new characteristics of two-dimensional landscapes. (interdisciplinary physics and related areas of science and technology)

  6. Predicting typhoon-induced storm surge tide with a two-dimensional hydrodynamic model and artificial neural network model

    Science.gov (United States)

    Chen, W.-B.; Liu, W.-C.; Hsu, M.-H.

    2012-12-01

    Precise predictions of storm surges during typhoon events have the necessity for disaster prevention in coastal seas. This paper explores an artificial neural network (ANN) model, including the back propagation neural network (BPNN) and adaptive neuro-fuzzy inference system (ANFIS) algorithms used to correct poor calculations with a two-dimensional hydrodynamic model in predicting storm surge height during typhoon events. The two-dimensional model has a fine horizontal resolution and considers the interaction between storm surges and astronomical tides, which can be applied for describing the complicated physical properties of storm surges along the east coast of Taiwan. The model is driven by the tidal elevation at the open boundaries using a global ocean tidal model and is forced by the meteorological conditions using a cyclone model. The simulated results of the hydrodynamic model indicate that this model fails to predict storm surge height during the model calibration and verification phases as typhoons approached the east coast of Taiwan. The BPNN model can reproduce the astronomical tide level but fails to modify the prediction of the storm surge tide level. The ANFIS model satisfactorily predicts both the astronomical tide level and the storm surge height during the training and verification phases and exhibits the lowest values of mean absolute error and root-mean-square error compared to the simulated results at the different stations using the hydrodynamic model and the BPNN model. Comparison results showed that the ANFIS techniques could be successfully applied in predicting water levels along the east coastal of Taiwan during typhoon events.

  7. Line-plane broadcasting in a data communications network of a parallel computer

    Science.gov (United States)

    Archer, Charles J.; Berg, Jeremy E.; Blocksome, Michael A.; Smith, Brian E.

    2010-06-08

    Methods, apparatus, and products are disclosed for line-plane broadcasting in a data communications network of a parallel computer, the parallel computer comprising a plurality of compute nodes connected together through the network, the network optimized for point to point data communications and characterized by at least a first dimension, a second dimension, and a third dimension, that include: initiating, by a broadcasting compute node, a broadcast operation, including sending a message to all of the compute nodes along an axis of the first dimension for the network; sending, by each compute node along the axis of the first dimension, the message to all of the compute nodes along an axis of the second dimension for the network; and sending, by each compute node along the axis of the second dimension, the message to all of the compute nodes along an axis of the third dimension for the network.

  8. Big Data: A Parallel Particle Swarm Optimization-Back-Propagation Neural Network Algorithm Based on MapReduce.

    Science.gov (United States)

    Cao, Jianfang; Cui, Hongyan; Shi, Hao; Jiao, Lijuan

    2016-01-01

    A back-propagation (BP) neural network can solve complicated random nonlinear mapping problems; therefore, it can be applied to a wide range of problems. However, as the sample size increases, the time required to train BP neural networks becomes lengthy. Moreover, the classification accuracy decreases as well. To improve the classification accuracy and runtime efficiency of the BP neural network algorithm, we proposed a parallel design and realization method for a particle swarm optimization (PSO)-optimized BP neural network based on MapReduce on the Hadoop platform using both the PSO algorithm and a parallel design. The PSO algorithm was used to optimize the BP neural network's initial weights and thresholds and improve the accuracy of the classification algorithm. The MapReduce parallel programming model was utilized to achieve parallel processing of the BP algorithm, thereby solving the problems of hardware and communication overhead when the BP neural network addresses big data. Datasets on 5 different scales were constructed using the scene image library from the SUN Database. The classification accuracy of the parallel PSO-BP neural network algorithm is approximately 92%, and the system efficiency is approximately 0.85, which presents obvious advantages when processing big data. The algorithm proposed in this study demonstrated both higher classification accuracy and improved time efficiency, which represents a significant improvement obtained from applying parallel processing to an intelligent algorithm on big data.

  9. Parallel DSMC Solution of Three-Dimensional Flow Over a Finite Flat Plate

    Science.gov (United States)

    Nance, Robert P.; Wilmoth, Richard G.; Moon, Bongki; Hassan, H. A.; Saltz, Joel

    1994-01-01

    This paper describes a parallel implementation of the direct simulation Monte Carlo (DSMC) method. Runtime library support is used for scheduling and execution of communication between nodes, and domain decomposition is performed dynamically to maintain a good load balance. Performance tests are conducted using the code to evaluate various remapping and remapping-interval policies, and it is shown that a one-dimensional chain-partitioning method works best for the problems considered. The parallel code is then used to simulate the Mach 20 nitrogen flow over a finite-thickness flat plate. It is shown that the parallel algorithm produces results which compare well with experimental data. Moreover, it yields significantly faster execution times than the scalar code, as well as very good load-balance characteristics.

  10. Non-dimensional physics of pulsatile cardiovascular networks and energy efficiency.

    Science.gov (United States)

    Yigit, Berk; Pekkan, Kerem

    2016-01-01

    In Nature, there exist a variety of cardiovascular circulation networks in which the energetic ventricular load has both steady and pulsatile components. Steady load is related to the mean cardiac output (CO) and the haemodynamic resistance of the peripheral vascular system. On the other hand, the pulsatile load is determined by the simultaneous pressure and flow waveforms at the ventricular outlet, which in turn are governed through arterial wave dynamics (transmission) and pulse decay characteristics (windkessel effect). Both the steady and pulsatile contributions of the haemodynamic power load are critical for characterizing/comparing disease states and for predicting the performance of cardiovascular devices. However, haemodynamic performance parameters vary significantly from subject to subject because of body size, heart rate and subject-specific CO. Therefore, a 'normalized' energy dissipation index, as a function of the 'non-dimensional' physical parameters that govern the circulation networks, is needed for comparative/integrative biological studies and clinical decision-making. In this paper, a complete network-independent non-dimensional formulation that incorporates pulsatile flow regimes is developed. Mechanical design variables of cardiovascular flow systems are identified and the Buckingham Pi theorem is formally applied to obtain the corresponding non-dimensional scaling parameter sets. Two scaling approaches are considered to address both the lumped parameter networks and the distributed circulation components. The validity of these non-dimensional number sets is tested extensively through the existing empirical allometric scaling laws of circulation systems. Additional validation studies are performed using a parametric numerical arterial model that represents the transmission and windkessel characteristics, which are adjusted to represent different body sizes and non-dimensional haemodynamic states. Simulations demonstrate that the proposed non-dimensional

  11. Parallel implementation of geometrical shock dynamics for two dimensional converging shock waves

    Science.gov (United States)

    Qiu, Shi; Liu, Kuang; Eliasson, Veronica

    2016-10-01

    Geometrical shock dynamics (GSD) theory is an appealing method to predict the shock motion in the sense that it is more computationally efficient than solving the traditional Euler equations, especially for converging shock waves. However, to solve and optimize large scale configurations, the main bottleneck is the computational cost. Among the existing numerical GSD schemes, there is only one that has been implemented on parallel computers, with the purpose to analyze detonation waves. To extend the computational advantage of the GSD theory to more general applications such as converging shock waves, a numerical implementation using a spatial decomposition method has been coupled with a front tracking approach on parallel computers. In addition, an efficient tridiagonal system solver for massively parallel computers has been applied to resolve the most expensive function in this implementation, resulting in an efficiency of 0.93 while using 32 HPCC cores. Moreover, symmetric boundary conditions have been developed to further reduce the computational cost, achieving a speedup of 19.26 for a 12-sided polygonal converging shock.

  12. Locality-Driven Parallel Static Analysis for Power Delivery Networks

    KAUST Repository

    Zeng, Zhiyu

    2011-06-01

    Large VLSI on-chip Power Delivery Networks (PDNs) are challenging to analyze due to the sheer network complexity. In this article, a novel parallel partitioning-based PDN analysis approach is presented. We use the boundary circuit responses of each partition to divide the full grid simulation problem into a set of independent subgrid simulation problems. Instead of solving exact boundary circuit responses, a more efficient scheme is proposed to provide near-exact approximation to the boundary circuit responses by exploiting the spatial locality of the flip-chip-type power grids. This scheme is also used in a block-based iterative error reduction process to achieve fast convergence. Detailed computational cost analysis and performance modeling is carried out to determine the optimal (or near-optimal) number of partitions for parallel implementation. Through the analysis of several large power grids, the proposed approach is shown to have excellent parallel efficiency, fast convergence, and favorable scalability. Our approach can solve a 16-million-node power grid in 18 seconds on an IBM p5-575 processing node with 16 Power5+ processors, which is 18.8X faster than a state-of-the-art direct solver. © 2011 ACM.

  13. Scattering Analysis of a Compact Dipole Array with Series and Parallel Feed Network including Mutual Coupling Effect

    Directory of Open Access Journals (Sweden)

    H. L. Sneha

    2013-01-01

    Full Text Available The current focus in defense arena is towards the stealth technology with an emphasis to control the radar cross-section (RCS. The scattering from the antennas mounted over the platform is of prime importance especially for a low-observable aerospace vehicle. This paper presents the analysis of the scattering cross section of a uniformly spaced linear dipole array. Two types of feed networks, that is, series and parallel feed networks, are considered. The total RCS of phased array with either kind of feed network is obtained by following the signal as it enters through the aperture and travels through the feed network. The RCS estimation of array is done including the mutual coupling effect between the dipole elements in three configurations, that is, side-by-side, collinear, and parallel-in-echelon. The results presented can be useful while designing a phased array with optimum performance towards low observability.

  14. Portable programming on parallel/networked computers using the Application Portable Parallel Library (APPL)

    Science.gov (United States)

    Quealy, Angela; Cole, Gary L.; Blech, Richard A.

    1993-01-01

    The Application Portable Parallel Library (APPL) is a subroutine-based library of communication primitives that is callable from applications written in FORTRAN or C. APPL provides a consistent programmer interface to a variety of distributed and shared-memory multiprocessor MIMD machines. The objective of APPL is to minimize the effort required to move parallel applications from one machine to another, or to a network of homogeneous machines. APPL encompasses many of the message-passing primitives that are currently available on commercial multiprocessor systems. This paper describes APPL (version 2.3.1) and its usage, reports the status of the APPL project, and indicates possible directions for the future. Several applications using APPL are discussed, as well as performance and overhead results.

  15. A one-dimensional heat transfer model for parallel-plate thermoacoustic heat exchangers

    NARCIS (Netherlands)

    de Jong, Anne; Wijnant, Ysbrand H.; de Boer, Andries

    2014-01-01

    A one-dimensional (1D) laminar oscillating flow heat transfer model is derived and applied to parallel-plate thermoacoustic heat exchangers. The model can be used to estimate the heat transfer from the solid wall to the acoustic medium, which is required for the heat input/output of thermoacoustic

  16. Analytic Approximate Solutions for Unsteady Two-Dimensional and Axisymmetric Squeezing Flows between Parallel Plates

    Directory of Open Access Journals (Sweden)

    Mohammad Mehdi Rashidi

    2008-01-01

    Full Text Available The flow of a viscous incompressible fluid between two parallel plates due to the normal motion of the plates is investigated. The unsteady Navier-Stokes equations are reduced to a nonlinear fourth-order differential equation by using similarity solutions. Homotopy analysis method (HAM is used to solve this nonlinear equation analytically. The convergence of the obtained series solution is carefully analyzed. The validity of our solutions is verified by the numerical results obtained by fourth-order Runge-Kutta.

  17. Two-dimensional NMR spectrometry

    International Nuclear Information System (INIS)

    Farrar, T.C.

    1987-01-01

    This article is the second in a two-part series. In part one (ANALYTICAL CHEMISTRY, May 15) the authors discussed one-dimensional nuclear magnetic resonance (NMR) spectra and some relatively advanced nuclear spin gymnastics experiments that provide a capability for selective sensitivity enhancements. In this article and overview and some applications of two-dimensional NMR experiments are presented. These powerful experiments are important complements to the one-dimensional experiments. As in the more sophisticated one-dimensional experiments, the two-dimensional experiments involve three distinct time periods: a preparation period, t 0 ; an evolution period, t 1 ; and a detection period, t 2

  18. Networks with fourfold connectivity in two dimensions.

    Science.gov (United States)

    Tessier, Frédéric; Boal, David H; Discher, Dennis E

    2003-01-01

    The elastic properties of planar, C4-symmetric networks under stress and at nonzero temperature are determined by simulation and mean field approximations. Attached at fourfold coordinated junction vertices, the networks are self-avoiding in that their elements (or bonds) may not intersect each other. Two different models are considered for the potential energy of the elements: either Hooke's law springs or flexible tethers (square well potential). For certain ranges of stress and temperature, the properties of the networks are captured by one of several models: at large tensions, the networks behave like a uniform system of square plaquettes, while at large compressions or high temperatures, they display many characteristics of an ideal gas. Under less severe conditions, mean field models with more general shapes (parallelograms) reproduce many essential features of both networks. Lastly, the spring network expands without limit at a two-dimensional tension equal to the force constant of the spring; however, it does not appear to collapse under compression, except at zero temperature.

  19. On the effect of memory in one-dimensional K=4 automata on networks

    Science.gov (United States)

    Alonso-Sanz, Ramón; Cárdenas, Juan Pablo

    2008-12-01

    The effect of implementing memory in cells of one-dimensional CA, and on nodes of various types of automata on networks with increasing degrees of random rewiring is studied in this article, paying particular attention to the case of four inputs. As a rule, memory induces a moderation in the rate of changing nodes and in the damage spreading, albeit in the latter case memory turns out to be ineffective in the control of the damage as the wiring network moves away from the ordered structure that features proper one-dimensional CA. This article complements the previous work done in the two-dimensional context.

  20. Measuring effectiveness of a university by a parallel network DEA model

    Science.gov (United States)

    Kashim, Rosmaini; Kasim, Maznah Mat; Rahman, Rosshairy Abd

    2017-11-01

    Universities contribute significantly to the development of human capital and socio-economic improvement of a country. Due to that, Malaysian universities carried out various initiatives to improve their performance. Most studies have used the Data Envelopment Analysis (DEA) model to measure efficiency rather than effectiveness, even though, the measurement of effectiveness is important to realize how effective a university in achieving its ultimate goals. A university system has two major functions, namely teaching and research and every function has different resources based on its emphasis. Therefore, a university is actually structured as a parallel production system with its overall effectiveness is the aggregated effectiveness of teaching and research. Hence, this paper is proposing a parallel network DEA model to measure the effectiveness of a university. This model includes internal operations of both teaching and research functions into account in computing the effectiveness of a university system. In literature, the graduate and the number of program offered are defined as the outputs, then, the employed graduates and the numbers of programs accredited from professional bodies are considered as the outcomes for measuring the teaching effectiveness. Amount of grants is regarded as the output of research, while the different quality of publications considered as the outcomes of research. A system is considered effective if only all functions are effective. This model has been tested using a hypothetical set of data consisting of 14 faculties at a public university in Malaysia. The results show that none of the faculties is relatively effective for the overall performance. Three faculties are effective in teaching and two faculties are effective in research. The potential applications of the parallel network DEA model allow the top management of a university to identify weaknesses in any functions in their universities and take rational steps for improvement.

  1. Derivation of a correlation for Drag coefficient in two-dimensional bounded supercavitating flows, using artificial neural networks

    Energy Technology Data Exchange (ETDEWEB)

    Shafaghat, R.; Hosseinalipour, S.M.; Derakhshani, S.M.E. [Iran University of Science and Technology, Department of Mechanical Engineering, Tehran (Iran)

    2010-07-15

    Artificial neural networks (ANNs) are used as a new approach for the determination of the relations between drag coefficient and Cavitation Number with cavity geometry in supercavitating flows which have been most widely used in the hydrodynamics researches. Also the result of the ANNs as a cost function potentially will be used in an optimization algorithm. Instead of complex differential equations and limited experimental data, faster and simpler solutions were obtained using equations derived from the ANN model. For training of the ANN the numerical results are used that are obtained from a boundary element method (BEM). At this problem, a two-dimensional supercavitation potential inviscid flow pasts a symmetric two-dimensional cavitator, which is placed perpendicular to the flow in a channel of infinite width and immediately a cavity is formed behind the cavitator. It was found that the coefficient of multiple determination (R{sup 2}-value) between the actual and ANN predicted data is equal to about 0.9998 for the drag coefficient and Cavitation number. As seen from the obtained results, the calculated cavity geometry for all drag coefficients and Cavitation Numbers are obviously within acceptable limits. (orig.)

  2. Perfect transfer of arbitrary states in quantum spin networks

    International Nuclear Information System (INIS)

    Christandl, Matthias; Kay, Alastair; Datta, Nilanjana; Dorlas, Tony C.; Ekert, Artur; Landahl, Andrew J.

    2005-01-01

    We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher-dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin networks of identical qubit couplings, we show that 2 log 3 N is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. This paper expands and extends the work done by Christandl et al., Phys. Rev. Lett. 92, 187902 (2004)

  3. Symmetries in eleven dimensional supergravity compactified on a parallelized seven sphere

    CERN Document Server

    Englert, F; Spindel, P

    1983-01-01

    We analyse, in eleven-dimensional supergravity compactified on S7, the spontaneous symmetry breaking induced by a spontaneous parallelization of the sphere. The eight supersymmetries are broken at a common scale and the SO(8) gauge group is reduced to Spin (7). Such a large residual symmetry has a simple geometrical significance revealed through use of octonions; this is explained in elementary terms.

  4. A parallel neural network training algorithm for control of discrete dynamical systems.

    Energy Technology Data Exchange (ETDEWEB)

    Gordillo, J. L.; Hanebutte, U. R.; Vitela, J. E.

    1998-01-20

    In this work we present a parallel neural network controller training code, that uses MPI, a portable message passing environment. A comprehensive performance analysis is reported which compares results of a performance model with actual measurements. The analysis is made for three different load assignment schemes: block distribution, strip mining and a sliding average bin packing (best-fit) algorithm. Such analysis is crucial since optimal load balance can not be achieved because the work load information is not available a priori. The speedup results obtained with the above schemes are compared with those corresponding to the bin packing load balance scheme with perfect load prediction based on a priori knowledge of the computing effort. Two multiprocessor platforms: a SGI/Cray Origin 2000 and a IBM SP have been utilized for this study. It is shown that for the best load balance scheme a parallel efficiency of over 50% for the entire computation is achieved by 17 processors of either parallel computers.

  5. Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors

    Science.gov (United States)

    Banerjee, Prithviraj; Jones, Mark Howard; Sargent, Jeff S.

    1990-01-01

    Two parallel algorithms for standard cell placement using simulated annealing are developed to run on distributed-memory message-passing hypercube multiprocessors. The cells can be mapped in a two-dimensional area of a chip onto processors in an n-dimensional hypercube in two ways, such that both small and large cell exchange and displacement moves can be applied. The computation of the cost function in parallel among all the processors in the hypercube is described, along with a distributed data structure that needs to be stored in the hypercube to support the parallel cost evaluation. A novel tree broadcasting strategy is used extensively for updating cell locations in the parallel environment. A dynamic parallel annealing schedule estimates the errors due to interacting parallel moves and adapts the rate of synchronization automatically. Two novel approaches in controlling error in parallel algorithms are described: heuristic cell coloring and adaptive sequence control.

  6. Medical image segmentation by means of constraint satisfaction neural network

    International Nuclear Information System (INIS)

    Chen, C.T.; Tsao, C.K.; Lin, W.C.

    1990-01-01

    This paper applies the concept of constraint satisfaction neural network (CSNN) to the problem of medical image segmentation. Constraint satisfaction (or constraint propagation), the procedure to achieve global consistency through local computation, is an important paradigm in artificial intelligence. CSNN can be viewed as a three-dimensional neural network, with the two-dimensional image matrix as its base, augmented by various constraint labels for each pixel. These constraint labels can be interpreted as the connections and the topology of the neural network. Through parallel and iterative processes, the CSNN will approach a solution that satisfies the given constraints thus providing segmented regions with global consistency

  7. High-speed all-optical DNA local sequence alignment based on a three-dimensional artificial neural network.

    Science.gov (United States)

    Maleki, Ehsan; Babashah, Hossein; Koohi, Somayyeh; Kavehvash, Zahra

    2017-07-01

    This paper presents an optical processing approach for exploring a large number of genome sequences. Specifically, we propose an optical correlator for global alignment and an extended moiré matching technique for local analysis of spatially coded DNA, whose output is fed to a novel three-dimensional artificial neural network for local DNA alignment. All-optical implementation of the proposed 3D artificial neural network is developed and its accuracy is verified in Zemax. Thanks to its parallel processing capability, the proposed structure performs local alignment of 4 million sequences of 150 base pairs in a few seconds, which is much faster than its electrical counterparts, such as the basic local alignment search tool.

  8. Development of three-dimensional neoclassical transport simulation code with high performance Fortran on a vector-parallel computer

    International Nuclear Information System (INIS)

    Satake, Shinsuke; Okamoto, Masao; Nakajima, Noriyoshi; Takamaru, Hisanori

    2005-11-01

    A neoclassical transport simulation code (FORTEC-3D) applicable to three-dimensional configurations has been developed using High Performance Fortran (HPF). Adoption of computing techniques for parallelization and a hybrid simulation model to the δf Monte-Carlo method transport simulation, including non-local transport effects in three-dimensional configurations, makes it possible to simulate the dynamism of global, non-local transport phenomena with a self-consistent radial electric field within a reasonable computation time. In this paper, development of the transport code using HPF is reported. Optimization techniques in order to achieve both high vectorization and parallelization efficiency, adoption of a parallel random number generator, and also benchmark results, are shown. (author)

  9. Parallel computation with molecular-motor-propelled agents in nanofabricated networks.

    Science.gov (United States)

    Nicolau, Dan V; Lard, Mercy; Korten, Till; van Delft, Falco C M J M; Persson, Malin; Bengtsson, Elina; Månsson, Alf; Diez, Stefan; Linke, Heiner; Nicolau, Dan V

    2016-03-08

    The combinatorial nature of many important mathematical problems, including nondeterministic-polynomial-time (NP)-complete problems, places a severe limitation on the problem size that can be solved with conventional, sequentially operating electronic computers. There have been significant efforts in conceiving parallel-computation approaches in the past, for example: DNA computation, quantum computation, and microfluidics-based computation. However, these approaches have not proven, so far, to be scalable and practical from a fabrication and operational perspective. Here, we report the foundations of an alternative parallel-computation system in which a given combinatorial problem is encoded into a graphical, modular network that is embedded in a nanofabricated planar device. Exploring the network in a parallel fashion using a large number of independent, molecular-motor-propelled agents then solves the mathematical problem. This approach uses orders of magnitude less energy than conventional computers, thus addressing issues related to power consumption and heat dissipation. We provide a proof-of-concept demonstration of such a device by solving, in a parallel fashion, the small instance {2, 5, 9} of the subset sum problem, which is a benchmark NP-complete problem. Finally, we discuss the technical advances necessary to make our system scalable with presently available technology.

  10. High-efficiency one-dimensional atom localization via two parallel standing-wave fields

    International Nuclear Information System (INIS)

    Wang, Zhiping; Wu, Xuqiang; Lu, Liang; Yu, Benli

    2014-01-01

    We present a new scheme of high-efficiency one-dimensional (1D) atom localization via measurement of upper state population or the probe absorption in a four-level N-type atomic system. By applying two classical standing-wave fields, the localization peak position and number, as well as the conditional position probability, can be easily controlled by the system parameters, and the sub-half-wavelength atom localization is also observed. More importantly, there is 100% detecting probability of the atom in the subwavelength domain when the corresponding conditions are satisfied. The proposed scheme may open up a promising way to achieve high-precision and high-efficiency 1D atom localization. (paper)

  11. A stock market forecasting model combining two-directional two-dimensional principal component analysis and radial basis function neural network.

    Science.gov (United States)

    Guo, Zhiqiang; Wang, Huaiqing; Yang, Jie; Miller, David J

    2015-01-01

    In this paper, we propose and implement a hybrid model combining two-directional two-dimensional principal component analysis ((2D)2PCA) and a Radial Basis Function Neural Network (RBFNN) to forecast stock market behavior. First, 36 stock market technical variables are selected as the input features, and a sliding window is used to obtain the input data of the model. Next, (2D)2PCA is utilized to reduce the dimension of the data and extract its intrinsic features. Finally, an RBFNN accepts the data processed by (2D)2PCA to forecast the next day's stock price or movement. The proposed model is used on the Shanghai stock market index, and the experiments show that the model achieves a good level of fitness. The proposed model is then compared with one that uses the traditional dimension reduction method principal component analysis (PCA) and independent component analysis (ICA). The empirical results show that the proposed model outperforms the PCA-based model, as well as alternative models based on ICA and on the multilayer perceptron.

  12. Electronic properties in a two-dimensional disordered electron liquid: Spin-valley interplay

    International Nuclear Information System (INIS)

    Burmistrov, I. S.; Chtchelkatchev, N. M.

    2008-01-01

    We report a detailed study of the influence of the spin and valley splittings on such physical observables of the two-dimensional disordered electron liquid as resistivity and spin and valley susceptibilities. We explain qualitatively the nonmonotonic dependence of the resistivity on temperature in the presence of a parallel magnetic field. In the presence of either spin or valley splitting we predict a temperature dependence of the resistivity with two maximum points

  13. Two-dimensional optoelectronic interconnect-processor and its operational bit error rate

    Science.gov (United States)

    Liu, J. Jiang; Gollsneider, Brian; Chang, Wayne H.; Carhart, Gary W.; Vorontsov, Mikhail A.; Simonis, George J.; Shoop, Barry L.

    2004-10-01

    Two-dimensional (2-D) multi-channel 8x8 optical interconnect and processor system were designed and developed using complementary metal-oxide-semiconductor (CMOS) driven 850-nm vertical-cavity surface-emitting laser (VCSEL) arrays and the photodetector (PD) arrays with corresponding wavelengths. We performed operation and bit-error-rate (BER) analysis on this free-space integrated 8x8 VCSEL optical interconnects driven by silicon-on-sapphire (SOS) circuits. Pseudo-random bit stream (PRBS) data sequence was used in operation of the interconnects. Eye diagrams were measured from individual channels and analyzed using a digital oscilloscope at data rates from 155 Mb/s to 1.5 Gb/s. Using a statistical model of Gaussian distribution for the random noise in the transmission, we developed a method to compute the BER instantaneously with the digital eye-diagrams. Direct measurements on this interconnects were also taken on a standard BER tester for verification. We found that the results of two methods were in the same order and within 50% accuracy. The integrated interconnects were investigated in an optoelectronic processing architecture of digital halftoning image processor. Error diffusion networks implemented by the inherently parallel nature of photonics promise to provide high quality digital halftoned images.

  14. Characterizing information propagation through inter-vehicle communication on a simple network of two parallel roads

    Science.gov (United States)

    2010-10-01

    In this report, we study information propagation via inter-vehicle communication along two parallel : roads. By identifying an inherent Bernoulli process, we are able to derive the mean and variance of : propagation distance. A road separation distan...

  15. Efficient Heuristics for Simulating Population Overflow in Parallel Networks

    NARCIS (Netherlands)

    Zaburnenko, T.S.; Nicola, V.F.

    2006-01-01

    In this paper we propose a state-dependent importance sampling heuristic to estimate the probability of population overflow in networks of parallel queues. This heuristic approximates the “optimal��? state-dependent change of measure without the need for costly optimization involved in other

  16. Balanced sensitivity functions for tuning multi-dimensional Bayesian network classifiers

    NARCIS (Netherlands)

    Bolt, J.H.; van der Gaag, L.C.

    Multi-dimensional Bayesian network classifiers are Bayesian networks of restricted topological structure, which are tailored to classifying data instances into multiple dimensions. Like more traditional classifiers, multi-dimensional classifiers are typically learned from data and may include

  17. Network harness: bundles of routes in public transport networks

    Science.gov (United States)

    Berche, B.; von Ferber, C.; Holovatch, T.

    2009-12-01

    Public transport routes sharing the same grid of streets and tracks are often found to proceed in parallel along shorter or longer sequences of stations. Similar phenomena are observed in other networks built with space consuming links such as cables, vessels, pipes, neurons, etc. In the case of public transport networks (PTNs) this behavior may be easily worked out on the basis of sequences of stations serviced by each route. To quantify this behavior we use the recently introduced notion of network harness. It is described by the harness distribution P(r, s): the number of sequences of s consecutive stations that are serviced by r parallel routes. For certain PTNs that we have analyzed we observe that the harness distribution may be described by power laws. These power laws indicate a certain level of organization and planning which may be driven by the need to minimize the costs of infrastructure and secondly by the fact that points of interest tend to be clustered in certain locations of a city. This effect may be seen as a result of the strong interdependence of the evolutions of both the city and its PTN. To further investigate the significance of the empirical results we have studied one- and two-dimensional models of randomly placed routes modeled by different types of walks. While in one dimension an analytic treatment was successful, the two dimensional case was studied by simulations showing that the empirical results for real PTNs deviate significantly from those expected for randomly placed routes.

  18. Two-dimensional plasmons in lateral carbon nanotube network structures and their effect on the terahertz radiation detection

    International Nuclear Information System (INIS)

    Ryzhii, V.; Otsuji, T.; Ryzhii, M.; Leiman, V. G.; Fedorov, G.; Goltzman, G. N.; Titova, N.; Gayduchenko, I. A.; Coquillat, D.; But, D.; Knap, W.; Mitin, V.; Shur, M. S.

    2016-01-01

    We consider the carrier transport and plasmonic phenomena in the lateral carbon nanotube (CNT) networks forming the device channel with asymmetric electrodes. One electrode is the Ohmic contact to the CNT network and the other contact is the Schottky contact. These structures can serve as detectors of the terahertz (THz) radiation. We develop the device model for collective response of the lateral CNT networks which comprise a mixture of randomly oriented semiconductor CNTs (s-CNTs) and quasi-metal CNTs (m-CNTs). The proposed model includes the concept of the collective two-dimensional (2D) plasmons in relatively dense networks of randomly oriented CNTs (CNT “felt”) and predicts the detector responsivity spectral characteristics exhibiting sharp resonant peaks at the signal frequencies corresponding to the 2D plasmonic resonances. The detection mechanism is the rectification of the ac current due the nonlinearity of the Schottky contact current-voltage characteristics under the conditions of a strong enhancement of the potential drop at this contact associated with the plasmon excitation. The detector responsivity depends on the fractions of the s- and m-CNTs. The burning of the near-contact regions of the m-CNTs or destruction of these CNTs leads to a marked increase in the responsivity in agreement with our experimental data. The resonant THz detectors with sufficiently dense lateral CNT networks can compete and surpass other THz detectors using plasmonic effects at room temperatures.

  19. Two-dimensional plasmons in lateral carbon nanotube network structures and their effect on the terahertz radiation detection

    Energy Technology Data Exchange (ETDEWEB)

    Ryzhii, V. [Research Institute of Electrical Communication, Tohoku University, Sendai 980-8577 (Japan); Institute of Ultra High Frequency Semiconductor Electronics of RAS, Moscow 117105 (Russian Federation); Center for Photonics and Infrared Engineering, Bauman Moscow State Technical University, Moscow 111005 (Russian Federation); Otsuji, T. [Research Institute of Electrical Communication, Tohoku University, Sendai 980-8577 (Japan); Ryzhii, M. [Department of Computer Science and Engineering, University of Aizu, Aizu-Wakamatsu 965-8580 (Japan); Leiman, V. G. [Department of General Physics, Moscow Institute of Physics and Technology, Dolgoprudny, 147100 (Russian Federation); Fedorov, G. [Department of General Physics, Moscow Institute of Physics and Technology, Dolgoprudny, 147100 (Russian Federation); Physics Department, Moscow State Pedagogical University, Moscow 119991 (Russian Federation); Goltzman, G. N.; Titova, N. [Physics Department, Moscow State Pedagogical University, Moscow 119991 (Russian Federation); Gayduchenko, I. A. [Physics Department, Moscow State Pedagogical University, Moscow 119991 (Russian Federation); National Research Center “Kurchatov Institute,” Moscow 123182 (Russian Federation); Coquillat, D.; But, D.; Knap, W. [Laboratoire Charles Coulomb UMR 5221, Universite Montpellier 2 and CNRS, F-34095, Montpellier (France); Mitin, V. [Department of Electrical Engineering, University at Buffalo, Buffalo, New York 1460-1920 (United States); Shur, M. S. [Departments of Electrical, Computer, and Systems Engineering and Physics, Applied Physics, and Astronomy, Rensselaer Polytechnic Institute, Troy, New York 12180 (United States)

    2016-07-28

    We consider the carrier transport and plasmonic phenomena in the lateral carbon nanotube (CNT) networks forming the device channel with asymmetric electrodes. One electrode is the Ohmic contact to the CNT network and the other contact is the Schottky contact. These structures can serve as detectors of the terahertz (THz) radiation. We develop the device model for collective response of the lateral CNT networks which comprise a mixture of randomly oriented semiconductor CNTs (s-CNTs) and quasi-metal CNTs (m-CNTs). The proposed model includes the concept of the collective two-dimensional (2D) plasmons in relatively dense networks of randomly oriented CNTs (CNT “felt”) and predicts the detector responsivity spectral characteristics exhibiting sharp resonant peaks at the signal frequencies corresponding to the 2D plasmonic resonances. The detection mechanism is the rectification of the ac current due the nonlinearity of the Schottky contact current-voltage characteristics under the conditions of a strong enhancement of the potential drop at this contact associated with the plasmon excitation. The detector responsivity depends on the fractions of the s- and m-CNTs. The burning of the near-contact regions of the m-CNTs or destruction of these CNTs leads to a marked increase in the responsivity in agreement with our experimental data. The resonant THz detectors with sufficiently dense lateral CNT networks can compete and surpass other THz detectors using plasmonic effects at room temperatures.

  20. Parallel paving: An algorithm for generating distributed, adaptive, all-quadrilateral meshes on parallel computers

    Energy Technology Data Exchange (ETDEWEB)

    Lober, R.R.; Tautges, T.J.; Vaughan, C.T.

    1997-03-01

    Paving is an automated mesh generation algorithm which produces all-quadrilateral elements. It can additionally generate these elements in varying sizes such that the resulting mesh adapts to a function distribution, such as an error function. While powerful, conventional paving is a very serial algorithm in its operation. Parallel paving is the extension of serial paving into parallel environments to perform the same meshing functions as conventional paving only on distributed, discretized models. This extension allows large, adaptive, parallel finite element simulations to take advantage of paving`s meshing capabilities for h-remap remeshing. A significantly modified version of the CUBIT mesh generation code has been developed to host the parallel paving algorithm and demonstrate its capabilities on both two dimensional and three dimensional surface geometries and compare the resulting parallel produced meshes to conventionally paved meshes for mesh quality and algorithm performance. Sandia`s {open_quotes}tiling{close_quotes} dynamic load balancing code has also been extended to work with the paving algorithm to retain parallel efficiency as subdomains undergo iterative mesh refinement.

  1. High-Dimensional Function Approximation With Neural Networks for Large Volumes of Data.

    Science.gov (United States)

    Andras, Peter

    2018-02-01

    Approximation of high-dimensional functions is a challenge for neural networks due to the curse of dimensionality. Often the data for which the approximated function is defined resides on a low-dimensional manifold and in principle the approximation of the function over this manifold should improve the approximation performance. It has been show that projecting the data manifold into a lower dimensional space, followed by the neural network approximation of the function over this space, provides a more precise approximation of the function than the approximation of the function with neural networks in the original data space. However, if the data volume is very large, the projection into the low-dimensional space has to be based on a limited sample of the data. Here, we investigate the nature of the approximation error of neural networks trained over the projection space. We show that such neural networks should have better approximation performance than neural networks trained on high-dimensional data even if the projection is based on a relatively sparse sample of the data manifold. We also find that it is preferable to use a uniformly distributed sparse sample of the data for the purpose of the generation of the low-dimensional projection. We illustrate these results considering the practical neural network approximation of a set of functions defined on high-dimensional data including real world data as well.

  2. High dimensional ICA analysis detects within-network functional connectivity damage of default mode and sensory motor networks in Alzheimer's disease

    Directory of Open Access Journals (Sweden)

    Ottavia eDipasquale

    2015-02-01

    Full Text Available High dimensional independent component analysis (ICA, compared to low dimensional ICA, allows performing a detailed parcellation of the resting state networks. The purpose of this study was to give further insight into functional connectivity (FC in Alzheimer’s disease (AD using high dimensional ICA. For this reason, we performed both low and high dimensional ICA analyses of resting state fMRI (rfMRI data of 20 healthy controls and 21 AD patients, focusing on the primarily altered default mode network (DMN and exploring the sensory motor network (SMN. As expected, results obtained at low dimensionality were in line with previous literature. Moreover, high dimensional results allowed us to observe either the presence of within-network disconnections and FC damage confined to some of the resting state sub-networks. Due to the higher sensitivity of the high dimensional ICA analysis, our results suggest that high-dimensional decomposition in sub-networks is very promising to better localize FC alterations in AD and that FC damage is not confined to the default mode network.

  3. One-dimensional GIS-based model compared with a two-dimensional model in urban floods simulation.

    Science.gov (United States)

    Lhomme, J; Bouvier, C; Mignot, E; Paquier, A

    2006-01-01

    A GIS-based one-dimensional flood simulation model is presented and applied to the centre of the city of Nîmes (Gard, France), for mapping flow depths or velocities in the streets network. The geometry of the one-dimensional elements is derived from the Digital Elevation Model (DEM). The flow is routed from one element to the next using the kinematic wave approximation. At the crossroads, the flows in the downstream branches are computed using a conceptual scheme. This scheme was previously designed to fit Y-shaped pipes junctions, and has been modified here to fit X-shaped crossroads. The results were compared with the results of a two-dimensional hydrodynamic model based on the full shallow water equations. The comparison shows that good agreements can be found in the steepest streets of the study zone, but differences may be important in the other streets. Some reasons that can explain the differences between the two models are given and some research possibilities are proposed.

  4. CX: A Scalable, Robust Network for Parallel Computing

    Directory of Open Access Journals (Sweden)

    Peter Cappello

    2002-01-01

    Full Text Available CX, a network-based computational exchange, is presented. The system's design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks, eager scheduling, and space-based coordination. The object-oriented API is simple, compact, and cleanly separates application logic from the logic that supports interprocess communication and fault tolerance. Computations, of course, run to completion in the presence of computational hosts that join and leave the ongoing computation. Such hosts, or producers, use task caching and prefetching to overlap computation with interprocessor communication. To break a potential task server bottleneck, a network of task servers is presented. Even though task servers are envisioned as reliable, the self-organizing, scalable network of n- servers, described as a sibling-connected height-balanced fat tree, tolerates a sequence of n-1 server failures. Tasks are distributed throughout the server network via a simple "diffusion" process. CX is intended as a test bed for research on automated silent auctions, reputation services, authentication services, and bonding services. CX also provides a test bed for algorithm research into network-based parallel computation.

  5. Hybrid shared/distributed parallelism for 3D characteristics transport solvers

    International Nuclear Information System (INIS)

    Dahmani, M.; Roy, R.

    2005-01-01

    In this paper, we will present a new hybrid parallel model for solving large-scale 3-dimensional neutron transport problems used in nuclear reactor simulations. Large heterogeneous reactor problems, like the ones that occurs when simulating Candu cores, have remained computationally intensive and impractical for routine applications on single-node or even vector computers. Based on the characteristics method, this new model is designed to solve the transport equation after distributing the calculation load on a network of shared memory multi-processors. The tracks are either generated on the fly at each characteristics sweep or stored in sequential files. The load balancing is taken into account by estimating the calculation load of tracks and by distributing batches of uniform load on each node of the network. Moreover, the communication overhead can be predicted after benchmarking the latency and bandwidth using appropriate network test suite. These models are useful for predicting the performance of the parallel applications and to analyze the scalability of the parallel systems. (authors)

  6. Parallel Void Thread in Long-Reach Ethernet Passive Optical Networks

    KAUST Repository

    Elrasad, Amr; Shihada, Basem

    2015-01-01

    This work investigates void filling (idle periods) in long-reach Ethernet passive optical networks. We focus on reducing grant delays and hence reducing the average packet delay. We introduce a novel approach called parallel void thread (PVT), which

  7. Fluctuations and symmetries in two-dimensional active gels.

    Science.gov (United States)

    Sarkar, N; Basu, A

    2011-04-01

    Motivated by the unique physical properties of biological active matter, e.g., cytoskeletal dynamics in eukaryotic cells, we set up effective two-dimensional (2d) coarse-grained hydrodynamic equations for the dynamics of thin active gels with polar or nematic symmetries. We use the well-known three-dimensional (3d) descriptions (K. Kruse et al., Eur. Phys. J. E 16, 5 (2005); A. Basu et al., Eur. Phys. J. E 27, 149 (2008)) for thin active-gel samples confined between parallel plates with appropriate boundary conditions to derive the effective 2d constitutive relations between appropriate thermodynamic fluxes and generalised forces for small deviations from equilibrium. We consider three distinct cases, characterised by spatial symmetries and boundary conditions, and show how such considerations dictate the structure of the constitutive relations. We use these to study the linear instabilities, calculate the correlation functions and the diffusion constant of a small tagged particle, and elucidate their dependences on the activity or nonequilibrium drive.

  8. MapReduce Based Parallel Bayesian Network for Manufacturing Quality Control

    Science.gov (United States)

    Zheng, Mao-Kuan; Ming, Xin-Guo; Zhang, Xian-Yu; Li, Guo-Ming

    2017-09-01

    Increasing complexity of industrial products and manufacturing processes have challenged conventional statistics based quality management approaches in the circumstances of dynamic production. A Bayesian network and big data analytics integrated approach for manufacturing process quality analysis and control is proposed. Based on Hadoop distributed architecture and MapReduce parallel computing model, big volume and variety quality related data generated during the manufacturing process could be dealt with. Artificial intelligent algorithms, including Bayesian network learning, classification and reasoning, are embedded into the Reduce process. Relying on the ability of the Bayesian network in dealing with dynamic and uncertain problem and the parallel computing power of MapReduce, Bayesian network of impact factors on quality are built based on prior probability distribution and modified with posterior probability distribution. A case study on hull segment manufacturing precision management for ship and offshore platform building shows that computing speed accelerates almost directly proportionally to the increase of computing nodes. It is also proved that the proposed model is feasible for locating and reasoning of root causes, forecasting of manufacturing outcome, and intelligent decision for precision problem solving. The integration of bigdata analytics and BN method offers a whole new perspective in manufacturing quality control.

  9. Application of a parallel 3-dimensional hydrogeochemistry HPF code to a proposed waste disposal site at the Oak Ridge National Laboratory

    International Nuclear Information System (INIS)

    Gwo, Jin-Ping; Yeh, Gour-Tsyh

    1997-01-01

    The objectives of this study are (1) to parallelize a 3-dimensional hydrogeochemistry code and (2) to apply the parallel code to a proposed waste disposal site at the Oak Ridge National Laboratory (ORNL). The 2-dimensional hydrogeochemistry code HYDROGEOCHEM, developed at the Pennsylvania State University for coupled subsurface solute transport and chemical equilibrium processes, was first modified to accommodate 3-dimensional problem domains. A bi-conjugate gradient stabilized linear matrix solver was then incorporated to solve the matrix equation. We chose to parallelize the 3-dimensional code on the Intel Paragons at ORNL by using an HPF (high performance FORTRAN) compiler developed at PGI. The data- and task-parallel algorithms available in the HPF compiler proved to be highly efficient for the geochemistry calculation. This calculation can be easily implemented in HPF formats and is perfectly parallel because the chemical speciation on one finite-element node is virtually independent of those on the others. The parallel code was applied to a subwatershed of the Melton Branch at ORNL. Chemical heterogeneity, in addition to physical heterogeneities of the geological formations, has been identified as one of the major factors that affect the fate and transport of contaminants at ORNL. This study demonstrated an application of the 3-dimensional hydrogeochemistry code on the Melton Branch site. A uranium tailing problem that involved in aqueous complexation and precipitation-dissolution was tested. Performance statistics was collected on the Intel Paragons at ORNL. Implications of these results on the further optimization of the code were discussed

  10. Parallelization of applications for networks with homogeneous and heterogeneous processors; Parallelisation d`applications pour des reseaux de processeurs homogenes ou heterogenes

    Energy Technology Data Exchange (ETDEWEB)

    Colombet, L

    1994-10-07

    The aim of this thesis is to study and develop efficient methods for parallelization of scientific applications on parallel computers with distributed memory. The first part presents two libraries of PVM (Parallel Virtual Machine) and MPI (Message Passing Interface) communication tools. They allow implementation of programs on most parallel machines, but also on heterogeneous computer networks. This chapter illustrates the problems faced when trying to evaluate performances of networks with heterogeneous processors. To evaluate such performances, the concepts of speed-up and efficiency have been modified and adapted to account for heterogeneity. The second part deals with a study of parallel application libraries such as ScaLAPACK and with the development of communication masking techniques. The general concept is based on communication anticipation, in particular by pipelining message sending operations. Experimental results on Cray T3D and IBM SP1 machines validates the theoretical studies performed on basic algorithms of the libraries discussed above. Two examples of scientific applications are given: the first is a model of young stars for astrophysics and the other is a model of photon trajectories in the Compton effect. (J.S.). 83 refs., 65 figs., 24 tabs.

  11. Hydrothermal preparation of nickel(II)/uranium(IV) fluorides with one-, two-, and three-dimensional topologies.

    Science.gov (United States)

    Bean, Amanda C; Sullens, Tyler A; Runde, Wolfgang; Albrecht-Schmitt, Thomas E

    2003-04-21

    A modified compositional diagram for the reactions of Ni(C(2)H(3)O(2))(2).4H(2)O with UO(2)(C(2)H(3)O(2))(2).2H(2)O and HF in aqueous media under mild hydrothermal conditions (200 degrees C) has been completed to yield three Ni(II)/U(IV) fluorides, Ni(H(2)O)(4)UF(6).1.5H(2)O (1), Ni(2)(H(2)O)(6)U(3)F(16).3H(2)O (2), and Ni(H(2)O)(2)UF(6)(H(2)O) (3). The structure of 1 consists of one-dimensional columns constructed from two parallel chains of edge-sharing dodecahedral [UF(8)] units. The sides of the columns are terminated by octahedral Ni(II) units that occur as cis-[Ni(H(2)O)(4)F(2)] polyhedra. In contrast, the crystal structure of 2 reveals a two-dimensional Ni(II)/U(IV) architecture built from edge-sharing tricapped trigonal prismatic [UF(9)] units. The top and bottom of the sheets are capped by fac-[Ni(H(2)O)(3)F(3)] octahedra. The structure of 3 is formed from [UF(8)(H(2)O)] tricapped trigonal prisms that edge share with one another to form one-dimensional chains. These chains are then joined together into a three-dimensional network by corner sharing with trans-[Ni(H(2)O)(2)F(4)] octahedra. Crystallographic data: 1, orthorhombic, space group Cmcm, a = 14.3383(8) A, b = 15.6867(8) A, c = 8.0282(4) A, Z = 8; 2, hexagonal, space group P6(3)/mmc, a = 7.9863(5) A, c = 16.566(1) A, Z = 2; 3, monoclinic, space group C2/c, a = 12.059(1) A, b = 6.8895(6) A, c = 7.9351(7) A, beta = 92.833(2) degrees, Z = 4.

  12. Computational cost estimates for parallel shared memory isogeometric multi-frontal solvers

    KAUST Repository

    Woźniak, Maciej; Kuźnik, Krzysztof M.; Paszyński, Maciej R.; Calo, Victor M.; Pardo, D.

    2014-01-01

    In this paper we present computational cost estimates for parallel shared memory isogeometric multi-frontal solvers. The estimates show that the ideal isogeometric shared memory parallel direct solver scales as O( p2log(N/p)) for one dimensional problems, O(Np2) for two dimensional problems, and O(N4/3p2) for three dimensional problems, where N is the number of degrees of freedom, and p is the polynomial order of approximation. The computational costs of the shared memory parallel isogeometric direct solver are compared with those corresponding to the sequential isogeometric direct solver, being the latest equal to O(N p2) for the one dimensional case, O(N1.5p3) for the two dimensional case, and O(N2p3) for the three dimensional case. The shared memory version significantly reduces both the scalability in terms of N and p. Theoretical estimates are compared with numerical experiments performed with linear, quadratic, cubic, quartic, and quintic B-splines, in one and two spatial dimensions. © 2014 Elsevier Ltd. All rights reserved.

  13. Computational cost estimates for parallel shared memory isogeometric multi-frontal solvers

    KAUST Repository

    Woźniak, Maciej

    2014-06-01

    In this paper we present computational cost estimates for parallel shared memory isogeometric multi-frontal solvers. The estimates show that the ideal isogeometric shared memory parallel direct solver scales as O( p2log(N/p)) for one dimensional problems, O(Np2) for two dimensional problems, and O(N4/3p2) for three dimensional problems, where N is the number of degrees of freedom, and p is the polynomial order of approximation. The computational costs of the shared memory parallel isogeometric direct solver are compared with those corresponding to the sequential isogeometric direct solver, being the latest equal to O(N p2) for the one dimensional case, O(N1.5p3) for the two dimensional case, and O(N2p3) for the three dimensional case. The shared memory version significantly reduces both the scalability in terms of N and p. Theoretical estimates are compared with numerical experiments performed with linear, quadratic, cubic, quartic, and quintic B-splines, in one and two spatial dimensions. © 2014 Elsevier Ltd. All rights reserved.

  14. Mechanical transport in two-dimensional networks of fractures

    International Nuclear Information System (INIS)

    Endo, H.K.

    1984-04-01

    The objectives of this research are to evaluate directional mechanical transport parameters for anisotropic fracture systems, and to determine if fracture systems behave like equivalent porous media. The tracer experiments used to measure directional tortuosity, longitudinal geometric dispersivity, and hydraulic effective porosity are conducted with a uniform flow field and measurements are made from the fluid flowing within a test section where linear length of travel is constant. Since fluid flow and mechanical transport are coupled processes, the directional variations of specific discharge and hydraulic effective porosity are measured in regions with constant hydraulic gradients to evaluate porous medium equivalence for the two processes, respectively. If the fracture region behaves like an equivalent porous medium, the system has the following stable properties: (1) specific discharge is uniform in any direction and can be predicted from a permeability tensor; and (2) hydraulic effective porosity is directionally stable. Fracture systems with two parallel sets of continuous fractures satisfy criterion 1. However, in these systems hydraulic effective porosity is directionally dependent, and thus, criterion 2 is violated. Thus, for some fracture systems, fluid flow can be predicted using porous media assumptions, but it may not be possible to predict transport using porous media assumptions. Two discontinuous fracture systems were studied which satisfied both criteria. Hydraulic effective porosity for both systems has a value between rock effective porosity and total porosity. A length-density analysis (LDS) of Canadian fracture data shows that porous media equivalence for fluid flow and transport is likely when systems have narrow aperture distributions. 54 references, 90 figures, 7 tables

  15. Two-dimensional and relativistic effects in lower-hybrid current drive

    International Nuclear Information System (INIS)

    Hewett, D.; Hizanidis, K.; Krapchev, V.; Bers, A.

    1983-06-01

    We present new numerical and analytic solutions of the two-dimensional Fokker-Planck equation supplemented by a parallel quasilinear diffusion term. The results show a large enhancement of the perpendicular temperature of both the electrons resonant with the applied RF fields and the more energetic electrons in the tail. Both the RF-generated current and power dissipated are substantially increased by the perpendicular energy broadening in the resonant region. In the presence of a small DC electric field the RF current generated is very much enhanced, much more than in a simple additive fashion. In addition, we present a relativistic formulation of the two-dimensional Fokker-Planck quasilinear equation. From conservation equations, based upon this formulation, we derive the characteristics of RF current drive with energetic electrons. These show how the RF-driven current and its figure of merit (I/P/sub d/) increase with the energy of the current-carrying electrons, and that their perpendicular, random momentum must also increase

  16. A Parallel Compact Multi-Dimensional Numerical Algorithm with Aeroacoustics Applications

    Science.gov (United States)

    Povitsky, Alex; Morris, Philip J.

    1999-01-01

    In this study we propose a novel method to parallelize high-order compact numerical algorithms for the solution of three-dimensional PDEs (Partial Differential Equations) in a space-time domain. For this numerical integration most of the computer time is spent in computation of spatial derivatives at each stage of the Runge-Kutta temporal update. The most efficient direct method to compute spatial derivatives on a serial computer is a version of Gaussian elimination for narrow linear banded systems known as the Thomas algorithm. In a straightforward pipelined implementation of the Thomas algorithm processors are idle due to the forward and backward recurrences of the Thomas algorithm. To utilize processors during this time, we propose to use them for either non-local data independent computations, solving lines in the next spatial direction, or local data-dependent computations by the Runge-Kutta method. To achieve this goal, control of processor communication and computations by a static schedule is adopted. Thus, our parallel code is driven by a communication and computation schedule instead of the usual "creative, programming" approach. The obtained parallelization speed-up of the novel algorithm is about twice as much as that for the standard pipelined algorithm and close to that for the explicit DRP algorithm.

  17. Parallel Algorithms for Switching Edges in Heterogeneous Graphs.

    Science.gov (United States)

    Bhuiyan, Hasanuzzaman; Khan, Maleq; Chen, Jiangzhuo; Marathe, Madhav

    2017-06-01

    An edge switch is an operation on a graph (or network) where two edges are selected randomly and one of their end vertices are swapped with each other. Edge switch operations have important applications in graph theory and network analysis, such as in generating random networks with a given degree sequence, modeling and analyzing dynamic networks, and in studying various dynamic phenomena over a network. The recent growth of real-world networks motivates the need for efficient parallel algorithms. The dependencies among successive edge switch operations and the requirement to keep the graph simple (i.e., no self-loops or parallel edges) as the edges are switched lead to significant challenges in designing a parallel algorithm. Addressing these challenges requires complex synchronization and communication among the processors leading to difficulties in achieving a good speedup by parallelization. In this paper, we present distributed memory parallel algorithms for switching edges in massive networks. These algorithms provide good speedup and scale well to a large number of processors. A harmonic mean speedup of 73.25 is achieved on eight different networks with 1024 processors. One of the steps in our edge switch algorithms requires the computation of multinomial random variables in parallel. This paper presents the first non-trivial parallel algorithm for the problem, achieving a speedup of 925 using 1024 processors.

  18. Dimensional Stability of Two Polyvinyl Siloxane Impression Materials in Different Time Intervals

    Directory of Open Access Journals (Sweden)

    Aalaei Sh

    2015-12-01

    Full Text Available Statement of the Problem: Dental prosthesis is usually made indirectly; there- fore dimensional stability of the impression material is very important. Every few years, new impression materials with different manufacturers’ claims regarding their better properties are introduced to the dental markets which require more research to evaluate their true dimensional changes. Objectives: The aim of this study was to evaluate dimensional stability of additional silicone impression material (Panasil® and Affinis® in different time intervals. Materials and Methods: In this experimental study, using two additional silicones (Panasil® and Affinis®, we made sixty impressions of standard die in similar conditions of 23 °C and 59% relative humidity by a special tray. The die included three horizontal and two vertical lines that were parallel. The vertical line crossed the horizontal ones at a point that served as reference for measurement. All impressions were poured with high strength dental stone. The dimensions were measured by stereo-microscope by two examiners in three interval storage times (1, 24 and 168 hours.The data were statistically analyzed using t-test and ANOVA. Results: All of the stone casts were larger than the standard die. Dimensional changes of Panasil and Affinis were 0.07%, 0.24%, 0.27% and 0.02%, 0.07%, 0.16% after 1, 24 and 168 hours, respectively. Dimensional change for two impression materials wasn’t significant in the interval time, expect for Panasil after one week (p = 0.004. Conclusions: According to the limitations of this study, Affinis impressions were dimensionally more stable than Panasil ones, but it was not significant. Dimensional change of Panasil impression showed a statistically significant difference after one week. Dimensional changes of both impression materials were based on ADA standard limitation in all time intervals (< 0.5%; therefore, dimensional stability of this impression was accepted at least

  19. Quantitative evaluation and modeling of two-dimensional neovascular network complexity: the surface fractal dimension

    International Nuclear Information System (INIS)

    Grizzi, Fabio; Russo, Carlo; Colombo, Piergiuseppe; Franceschini, Barbara; Frezza, Eldo E; Cobos, Everardo; Chiriva-Internati, Maurizio

    2005-01-01

    Modeling the complex development and growth of tumor angiogenesis using mathematics and biological data is a burgeoning area of cancer research. Architectural complexity is the main feature of every anatomical system, including organs, tissues, cells and sub-cellular entities. The vascular system is a complex network whose geometrical characteristics cannot be properly defined using the principles of Euclidean geometry, which is only capable of interpreting regular and smooth objects that are almost impossible to find in Nature. However, fractal geometry is a more powerful means of quantifying the spatial complexity of real objects. This paper introduces the surface fractal dimension (D s ) as a numerical index of the two-dimensional (2-D) geometrical complexity of tumor vascular networks, and their behavior during computer-simulated changes in vessel density and distribution. We show that D s significantly depends on the number of vessels and their pattern of distribution. This demonstrates that the quantitative evaluation of the 2-D geometrical complexity of tumor vascular systems can be useful not only to measure its complex architecture, but also to model its development and growth. Studying the fractal properties of neovascularity induces reflections upon the real significance of the complex form of branched anatomical structures, in an attempt to define more appropriate methods of describing them quantitatively. This knowledge can be used to predict the aggressiveness of malignant tumors and design compounds that can halt the process of angiogenesis and influence tumor growth

  20. Atomic structure of a metal-supported two-dimensional germania film

    Science.gov (United States)

    Lewandowski, Adrián Leandro; Schlexer, Philomena; Büchner, Christin; Davis, Earl M.; Burrall, Hannah; Burson, Kristen M.; Schneider, Wolf-Dieter; Heyde, Markus; Pacchioni, Gianfranco; Freund, Hans-Joachim

    2018-03-01

    The growth and microscopic characterization of two-dimensional germania films is presented. Germanium oxide monolayer films were grown on Ru(0001) by physical vapor deposition and subsequent annealing in oxygen. We obtain a comprehensive image of the germania film structure by combining intensity-voltage low-energy electron diffraction (I/V-LEED) and ab initio density functional theory (DFT) analysis with atomic-resolution scanning tunneling microscopy (STM) imaging. For benchmarking purposes, the bare Ru(0001) substrate and the (2 ×2 )3 O covered Ru(0001) were analyzed with I/V-LEED with respect to previous reports. STM topographic images of the germania film reveal a hexagonal network where the oxygen and germanium atom positions appear in different imaging contrasts. For quantitative LEED, the best agreement has been achieved with DFT structures where the germanium atoms are located preferentially on the top and fcc hollow sites of the Ru(0001) substrate. Moreover, in these atomically flat germania films, local site geometries, i.e., tetrahedral building blocks, ring structures, and domain boundaries, have been identified, indicating possible pathways towards two-dimensional amorphous networks.

  1. Optical Neural Network Classifier Architectures

    National Research Council Canada - National Science Library

    Getbehead, Mark

    1998-01-01

    We present an adaptive opto-electronic neural network hardware architecture capable of exploiting parallel optics to realize real-time processing and classification of high-dimensional data for Air...

  2. Parallel Evolutionary Optimization for Neuromorphic Network Training

    Energy Technology Data Exchange (ETDEWEB)

    Schuman, Catherine D [ORNL; Disney, Adam [University of Tennessee (UT); Singh, Susheela [North Carolina State University (NCSU), Raleigh; Bruer, Grant [University of Tennessee (UT); Mitchell, John Parker [University of Tennessee (UT); Klibisz, Aleksander [University of Tennessee (UT); Plank, James [University of Tennessee (UT)

    2016-01-01

    One of the key impediments to the success of current neuromorphic computing architectures is the issue of how best to program them. Evolutionary optimization (EO) is one promising programming technique; in particular, its wide applicability makes it especially attractive for neuromorphic architectures, which can have many different characteristics. In this paper, we explore different facets of EO on a spiking neuromorphic computing model called DANNA. We focus on the performance of EO in the design of our DANNA simulator, and on how to structure EO on both multicore and massively parallel computing systems. We evaluate how our parallel methods impact the performance of EO on Titan, the U.S.'s largest open science supercomputer, and BOB, a Beowulf-style cluster of Raspberry Pi's. We also focus on how to improve the EO by evaluating commonality in higher performing neural networks, and present the result of a study that evaluates the EO performed by Titan.

  3. Discrete-to-continuum modelling of weakly interacting incommensurate two-dimensional lattices.

    Science.gov (United States)

    Español, Malena I; Golovaty, Dmitry; Wilber, J Patrick

    2018-01-01

    In this paper, we derive a continuum variational model for a two-dimensional deformable lattice of atoms interacting with a two-dimensional rigid lattice. The starting point is a discrete atomistic model for the two lattices which are assumed to have slightly different lattice parameters and, possibly, a small relative rotation. This is a prototypical example of a three-dimensional system consisting of a graphene sheet suspended over a substrate. We use a discrete-to-continuum procedure to obtain the continuum model which recovers both qualitatively and quantitatively the behaviour observed in the corresponding discrete model. The continuum model predicts that the deformable lattice develops a network of domain walls characterized by large shearing, stretching and bending deformation that accommodates the misalignment and/or mismatch between the deformable and rigid lattices. Two integer-valued parameters, which can be identified with the components of a Burgers vector, describe the mismatch between the lattices and determine the geometry and the details of the deformation associated with the domain walls.

  4. Reconstruction of three-dimensional porous media using generative adversarial neural networks

    Science.gov (United States)

    Mosser, Lukas; Dubrule, Olivier; Blunt, Martin J.

    2017-10-01

    To evaluate the variability of multiphase flow properties of porous media at the pore scale, it is necessary to acquire a number of representative samples of the void-solid structure. While modern x-ray computer tomography has made it possible to extract three-dimensional images of the pore space, assessment of the variability in the inherent material properties is often experimentally not feasible. We present a method to reconstruct the solid-void structure of porous media by applying a generative neural network that allows an implicit description of the probability distribution represented by three-dimensional image data sets. We show, by using an adversarial learning approach for neural networks, that this method of unsupervised learning is able to generate representative samples of porous media that honor their statistics. We successfully compare measures of pore morphology, such as the Euler characteristic, two-point statistics, and directional single-phase permeability of synthetic realizations with the calculated properties of a bead pack, Berea sandstone, and Ketton limestone. Results show that generative adversarial networks can be used to reconstruct high-resolution three-dimensional images of porous media at different scales that are representative of the morphology of the images used to train the neural network. The fully convolutional nature of the trained neural network allows the generation of large samples while maintaining computational efficiency. Compared to classical stochastic methods of image reconstruction, the implicit representation of the learned data distribution can be stored and reused to generate multiple realizations of the pore structure very rapidly.

  5. Efficient Parallel Statistical Model Checking of Biochemical Networks

    Directory of Open Access Journals (Sweden)

    Paolo Ballarini

    2009-12-01

    Full Text Available We consider the problem of verifying stochastic models of biochemical networks against behavioral properties expressed in temporal logic terms. Exact probabilistic verification approaches such as, for example, CSL/PCTL model checking, are undermined by a huge computational demand which rule them out for most real case studies. Less demanding approaches, such as statistical model checking, estimate the likelihood that a property is satisfied by sampling executions out of the stochastic model. We propose a methodology for efficiently estimating the likelihood that a LTL property P holds of a stochastic model of a biochemical network. As with other statistical verification techniques, the methodology we propose uses a stochastic simulation algorithm for generating execution samples, however there are three key aspects that improve the efficiency: first, the sample generation is driven by on-the-fly verification of P which results in optimal overall simulation time. Second, the confidence interval estimation for the probability of P to hold is based on an efficient variant of the Wilson method which ensures a faster convergence. Third, the whole methodology is designed according to a parallel fashion and a prototype software tool has been implemented that performs the sampling/verification process in parallel over an HPC architecture.

  6. Differences Between Distributed and Parallel Systems

    Energy Technology Data Exchange (ETDEWEB)

    Brightwell, R.; Maccabe, A.B.; Rissen, R.

    1998-10-01

    Distributed systems have been studied for twenty years and are now coming into wider use as fast networks and powerful workstations become more readily available. In many respects a massively parallel computer resembles a network of workstations and it is tempting to port a distributed operating system to such a machine. However, there are significant differences between these two environments and a parallel operating system is needed to get the best performance out of a massively parallel system. This report characterizes the differences between distributed systems, networks of workstations, and massively parallel systems and analyzes the impact of these differences on operating system design. In the second part of the report, we introduce Puma, an operating system specifically developed for massively parallel systems. We describe Puma portals, the basic building blocks for message passing paradigms implemented on top of Puma, and show how the differences observed in the first part of the report have influenced the design and implementation of Puma.

  7. Broadcasting a message in a parallel computer

    Science.gov (United States)

    Berg, Jeremy E [Rochester, MN; Faraj, Ahmad A [Rochester, MN

    2011-08-02

    Methods, systems, and products are disclosed for broadcasting a message in a parallel computer. The parallel computer includes a plurality of compute nodes connected together using a data communications network. The data communications network optimized for point to point data communications and is characterized by at least two dimensions. The compute nodes are organized into at least one operational group of compute nodes for collective parallel operations of the parallel computer. One compute node of the operational group assigned to be a logical root. Broadcasting a message in a parallel computer includes: establishing a Hamiltonian path along all of the compute nodes in at least one plane of the data communications network and in the operational group; and broadcasting, by the logical root to the remaining compute nodes, the logical root's message along the established Hamiltonian path.

  8. Large parallel volumes of finite and compact sets in d-dimensional Euclidean space

    DEFF Research Database (Denmark)

    Kampf, Jürgen; Kiderlen, Markus

    The r-parallel volume V (Cr) of a compact subset C in d-dimensional Euclidean space is the volume of the set Cr of all points of Euclidean distance at most r > 0 from C. According to Steiner’s formula, V (Cr) is a polynomial in r when C is convex. For finite sets C satisfying a certain geometric...

  9. Phase Diagrams of Three-Dimensional Anderson and Quantum Percolation Models Using Deep Three-Dimensional Convolutional Neural Network

    Science.gov (United States)

    Mano, Tomohiro; Ohtsuki, Tomi

    2017-11-01

    The three-dimensional Anderson model is a well-studied model of disordered electron systems that shows the delocalization-localization transition. As in our previous papers on two- and three-dimensional (2D, 3D) quantum phase transitions [J. Phys. Soc. Jpn. 85, 123706 (2016), 86, 044708 (2017)], we used an image recognition algorithm based on a multilayered convolutional neural network. However, in contrast to previous papers in which 2D image recognition was used, we applied 3D image recognition to analyze entire 3D wave functions. We show that a full phase diagram of the disorder-energy plane is obtained once the 3D convolutional neural network has been trained at the band center. We further demonstrate that the full phase diagram for 3D quantum bond and site percolations can be drawn by training the 3D Anderson model at the band center.

  10. Paralelno umrežavanje računara / Parallel networking of the computers

    Directory of Open Access Journals (Sweden)

    Milojko Jevtović

    2007-04-01

    Full Text Available U radu je izložena originalna koncepcija tehničkog rešenja paralelnog umrežavanja računara, kao i lokalnih računarskih mreža (LAN - Local Area Network, odnosno povezivanje i istovremena komunikacija preko više različitih transportnih telekomunikacionih mreža. Opisano je jedno rešenje paralelnog umrežavanja, kojim je omogućen pouzdani prenos multimedijalnog saobraćaja i prenos podataka u realnom vremenu između računara ili LAN istovremeno preko N (N = 1, 2, 3, 4,.. različitih, međusobno nezavisnih mreža širokog prostranstva (WAN - Wide Area Network. Paralelno umrežavanje zasnovano je na korišćenju univerzalnog modema, čije je rešenje, takođe ukratko predstavljeno. / In this paper, new concept for parallel networking of the computers or LANs over different WAN telecommunications networks, is presented. One solution of the parallel networks, which enables reliable transfer of multimedia traffic and data transmission in real time between a computer of LAN via N (N = 1, 2 3, 4,… different inter-connected Wide Area Network. Connections between computers or LANs and wide area networks are realized using universal modems whose solution has also been presented.

  11. FISH: A THREE-DIMENSIONAL PARALLEL MAGNETOHYDRODYNAMICS CODE FOR ASTROPHYSICAL APPLICATIONS

    International Nuclear Information System (INIS)

    Kaeppeli, R.; Whitehouse, S. C.; Scheidegger, S.; Liebendoerfer, M.; Pen, U.-L.

    2011-01-01

    FISH is a fast and simple ideal magnetohydrodynamics code that scales to ∼10,000 processes for a Cartesian computational domain of ∼1000 3 cells. The simplicity of FISH has been achieved by the rigorous application of the operator splitting technique, while second-order accuracy is maintained by the symmetric ordering of the operators. Between directional sweeps, the three-dimensional data are rotated in memory so that the sweep is always performed in a cache-efficient way along the direction of contiguous memory. Hence, the code only requires a one-dimensional description of the conservation equations to be solved. This approach also enables an elegant novel parallelization of the code that is based on persistent communications with MPI for cubic domain decomposition on machines with distributed memory. This scheme is then combined with an additional OpenMP parallelization of different sweeps that can take advantage of clusters of shared memory. We document the detailed implementation of a second-order total variation diminishing advection scheme based on flux reconstruction. The magnetic fields are evolved by a constrained transport scheme. We show that the subtraction of a simple estimate of the hydrostatic gradient from the total gradients can significantly reduce the dissipation of the advection scheme in simulations of gravitationally bound hydrostatic objects. Through its simplicity and efficiency, FISH is as well suited for hydrodynamics classes as for large-scale astrophysical simulations on high-performance computer clusters. In preparation for the release of a public version, we demonstrate the performance of FISH in a suite of astrophysically orientated test cases.

  12. Melting in Two-Dimensional Lennard-Jones Systems: Observation of a Metastable Hexatic Phase

    International Nuclear Information System (INIS)

    Chen, K.; Kaplan, T.; Mostoller, M.

    1995-01-01

    Large scale molecular dynamics simulations of two-dimensional melting have been carried out using a recently revised Parrinello-Rahman scheme on massively parallel supercomputers. A metastable state is observed between the solid and liquid phases in Lennard-Jones systems of 36 864 and 102 400 atoms. This intermediate state shows the characteristics of the hexatic phase predicted by the theory of Kosterlitz, Thouless, Halperin, Nelson, and Young

  13. Multiple scattering of elliptically polarized light in two-dimensional medium with large inhomogeneities

    Energy Technology Data Exchange (ETDEWEB)

    Gorodnichev, E. E., E-mail: gorodn@theor.mephi.ru [National Research Nuclear University MEPhI (Moscow Engineering Physics Institute) (Russian Federation)

    2016-12-15

    For elliptically polarized light incident on a two-dimensional medium with large inhomogeneities, the Stokes parameters of scattered waves are calculated. Multiple scattering is assumed to be sharply anisotropic. The degree of polarization of scattered radiation is shown to be a nonmonotonic function of depth when the incident wave is circularly polarized or its polarization vector is not parallel to the symmetry axis of the inhomogeneities.

  14. Experimental two-dimensional quantum walk on a photonic chip.

    Science.gov (United States)

    Tang, Hao; Lin, Xiao-Feng; Feng, Zhen; Chen, Jing-Yuan; Gao, Jun; Sun, Ke; Wang, Chao-Yue; Lai, Peng-Cheng; Xu, Xiao-Yun; Wang, Yao; Qiao, Lu-Feng; Yang, Ai-Lin; Jin, Xian-Min

    2018-05-01

    Quantum walks, in virtue of the coherent superposition and quantum interference, have exponential superiority over their classical counterpart in applications of quantum searching and quantum simulation. The quantum-enhanced power is highly related to the state space of quantum walks, which can be expanded by enlarging the photon number and/or the dimensions of the evolution network, but the former is considerably challenging due to probabilistic generation of single photons and multiplicative loss. We demonstrate a two-dimensional continuous-time quantum walk by using the external geometry of photonic waveguide arrays, rather than the inner degree of freedoms of photons. Using femtosecond laser direct writing, we construct a large-scale three-dimensional structure that forms a two-dimensional lattice with up to 49 × 49 nodes on a photonic chip. We demonstrate spatial two-dimensional quantum walks using heralded single photons and single photon-level imaging. We analyze the quantum transport properties via observing the ballistic evolution pattern and the variance profile, which agree well with simulation results. We further reveal the transient nature that is the unique feature for quantum walks of beyond one dimension. An architecture that allows a quantum walk to freely evolve in all directions and at a large scale, combining with defect and disorder control, may bring up powerful and versatile quantum walk machines for classically intractable problems.

  15. A Parallel Strategy for Convolutional Neural Network Based on Heterogeneous Cluster for Mobile Information System

    Directory of Open Access Journals (Sweden)

    Jilin Zhang

    2017-01-01

    Full Text Available With the development of the mobile systems, we gain a lot of benefits and convenience by leveraging mobile devices; at the same time, the information gathered by smartphones, such as location and environment, is also valuable for business to provide more intelligent services for customers. More and more machine learning methods have been used in the field of mobile information systems to study user behavior and classify usage patterns, especially convolutional neural network. With the increasing of model training parameters and data scale, the traditional single machine training method cannot meet the requirements of time complexity in practical application scenarios. The current training framework often uses simple data parallel or model parallel method to speed up the training process, which is why heterogeneous computing resources have not been fully utilized. To solve these problems, our paper proposes a delay synchronization convolutional neural network parallel strategy, which leverages the heterogeneous system. The strategy is based on both synchronous parallel and asynchronous parallel approaches; the model training process can reduce the dependence on the heterogeneous architecture in the premise of ensuring the model convergence, so the convolution neural network framework is more adaptive to different heterogeneous system environments. The experimental results show that the proposed delay synchronization strategy can achieve at least three times the speedup compared to the traditional data parallelism.

  16. A Parallel Supercomputer Implementation of a Biological Inspired Neural Network and its use for Pattern Recognition

    International Nuclear Information System (INIS)

    De Ladurantaye, Vincent; Lavoie, Jean; Bergeron, Jocelyn; Parenteau, Maxime; Lu Huizhong; Pichevar, Ramin; Rouat, Jean

    2012-01-01

    A parallel implementation of a large spiking neural network is proposed and evaluated. The neural network implements the binding by synchrony process using the Oscillatory Dynamic Link Matcher (ODLM). Scalability, speed and performance are compared for 2 implementations: Message Passing Interface (MPI) and Compute Unified Device Architecture (CUDA) running on clusters of multicore supercomputers and NVIDIA graphical processing units respectively. A global spiking list that represents at each instant the state of the neural network is described. This list indexes each neuron that fires during the current simulation time so that the influence of their spikes are simultaneously processed on all computing units. Our implementation shows a good scalability for very large networks. A complex and large spiking neural network has been implemented in parallel with success, thus paving the road towards real-life applications based on networks of spiking neurons. MPI offers a better scalability than CUDA, while the CUDA implementation on a GeForce GTX 285 gives the best cost to performance ratio. When running the neural network on the GTX 285, the processing speed is comparable to the MPI implementation on RQCHP's Mammouth parallel with 64 notes (128 cores).

  17. Theoretical investigations on two-phase flow instability in parallel channels under axial non-uniform heating

    International Nuclear Information System (INIS)

    Lu, Xiaodong; Wu, Yingwei; Zhou, Linglan; Tian, Wenxi; Su, Guanghui; Qiu, Suizheng; Zhang, Hong

    2014-01-01

    Highlights: • We developed a model based on homogeneous flow model to analyze two-phase flow instability in parallel channels. • The influence of axial non-uniform heating on the system stability has been investigated. • Influences of various factors on system instability under cosine heat flux have been studied. • The system under top-peaked heat flux is the most stable system. - Abstract: Two-phase flow instability in parallel channels heated by axial non-uniform heat flux has been theoretically studied in this paper. The system control equations of parallel channels were established based on the homogeneous flow model in two-phase region. Semi-implicit finite-difference scheme and staggered mesh method were used to discretize the equations, and the difference equations were solved by chasing method. Cosine, bottom-peaked and top-peaked heat fluxes were used to study the influence of non-uniform heating on two-phase flow instability of the parallel channels system. The marginal stability boundaries (MSB) of parallel channels and three-dimensional instability spaces (or instability reefs) under different heat flux conditions have been obtained. Compared with axial uniform heating, axial non-uniform heating will affect the system stability. Cosine and bottom-peaked heat fluxes can destabilize the system stability in high inlet subcooling region, while the opposite effect can be found in low inlet subcooling region. However, top-peaked heat flux can enhance the system stability in the whole region. In addition, for cosine heat flux, increasing the system pressure or inlet resistance coefficient can strengthen the system stability, and increasing the heating power will destabilize the system stability. The influence of inlet subcooling number on the system stability is multi-valued under cosine heat flux

  18. Three-dimensional chimera patterns in networks of spiking neuron oscillators

    Science.gov (United States)

    Kasimatis, T.; Hizanidis, J.; Provata, A.

    2018-05-01

    We study the stable spatiotemporal patterns that arise in a three-dimensional (3D) network of neuron oscillators, whose dynamics is described by the leaky integrate-and-fire (LIF) model. More specifically, we investigate the form of the chimera states induced by a 3D coupling matrix with nonlocal topology. The observed patterns are in many cases direct generalizations of the corresponding two-dimensional (2D) patterns, e.g., spheres, layers, and cylinder grids. We also find cylindrical and "cross-layered" chimeras that do not have an equivalent in 2D systems. Quantitative measures are calculated, such as the ratio of synchronized and unsynchronized neurons as a function of the coupling range, the mean phase velocities, and the distribution of neurons in mean phase velocities. Based on these measures, the chimeras are categorized in two families. The first family of patterns is observed for weaker coupling and exhibits higher mean phase velocities for the unsynchronized areas of the network. The opposite holds for the second family, where the unsynchronized areas have lower mean phase velocities. The various measures demonstrate discontinuities, indicating criticality as the parameters cross from the first family of patterns to the second.

  19. Kinetic Theory of a Confined Quasi-Two-Dimensional Gas of Hard Spheres

    Directory of Open Access Journals (Sweden)

    J. Javier Brey

    2017-02-01

    Full Text Available The dynamics of a system of hard spheres enclosed between two parallel plates separated a distance smaller than two particle diameters is described at the level of kinetic theory. The interest focuses on the behavior of the quasi-two-dimensional fluid seen when looking at the system from above or below. In the first part, a collisional model for the effective two-dimensional dynamics is analyzed. Although it is able to describe quite well the homogeneous evolution observed in the experiments, it is shown that it fails to predict the existence of non-equilibrium phase transitions, and in particular, the bimodal regime exhibited by the real system. A critical revision analysis of the model is presented , and as a starting point to get a more accurate description, the Boltzmann equation for the quasi-two-dimensional gas has been derived. In the elastic case, the solutions of the equation verify an H-theorem implying a monotonic tendency to a non-uniform steady state. As an example of application of the kinetic equation, here the evolution equations for the vertical and horizontal temperatures of the system are derived in the homogeneous approximation, and the results compared with molecular dynamics simulation results.

  20. Transcriptomic and Proteomic Data Integration and Two-Dimensional Molecular Maps with Regulatory and Functional Linkages: Application to Cell Proliferation and Invasion Networks in Glioblastoma.

    Science.gov (United States)

    Gupta, Manoj Kumar; Jayaram, Savita; Reddy, Divijendra Natha; Polisetty, Ravindra Varma; Sirdeshmukh, Ravi

    2015-12-04

    Glioblastoma multiforme (GBM), the most aggressive primary brain tumor, is characterized by high rates of cell proliferation, migration, and invasion. New therapeutic strategies and targets are being continuously explored with the hope for better outcome. By overlaying transcriptomic and proteomic data from GBM clinical tissues, we identified 317 differentially expressed proteins to be concordant with the messenger RNAs (mRNAs). We used these entities to generate integrated regulatory information at the level of microRNAs (miRNAs) and their mRNA and protein targets using prediction programs or experimentally verified miRNA target mode in the miRWalk database. We observed 60% or even more of the miRNA-target pairs to be consistent with experimentally observed inverse expression of these molecules in GBM. The integrated view of these regulatory cascades in the contexts of cell proliferation and invasion networks revealed two-dimensional molecular interactions with regulatory and functional linkages (miRNAs and their mRNA-protein targets in one dimension; multiple miRNAs associated in a functional network in the second dimension). A total of 28 of the 35 differentially expressed concordant mRNA-protein entities represented in the proliferation network, and 51 of the 59 such entities represented in the invasion network, mapped to altered miRNAs from GBM and conformed to an inverse relationship in their expression. We believe the two-dimensional maps of gene expression changes enhance the strength of the discovery datasets derived from omics-based studies for their applications in GBM as well as tumors in general.

  1. High-performance parallel approaches for three-dimensional light detection and ranging point clouds gridding

    Science.gov (United States)

    Rizki, Permata Nur Miftahur; Lee, Heezin; Lee, Minsu; Oh, Sangyoon

    2017-01-01

    With the rapid advance of remote sensing technology, the amount of three-dimensional point-cloud data has increased extraordinarily, requiring faster processing in the construction of digital elevation models. There have been several attempts to accelerate the computation using parallel methods; however, little attention has been given to investigating different approaches for selecting the most suited parallel programming model for a given computing environment. We present our findings and insights identified by implementing three popular high-performance parallel approaches (message passing interface, MapReduce, and GPGPU) on time demanding but accurate kriging interpolation. The performances of the approaches are compared by varying the size of the grid and input data. In our empirical experiment, we demonstrate the significant acceleration by all three approaches compared to a C-implemented sequential-processing method. In addition, we also discuss the pros and cons of each method in terms of usability, complexity infrastructure, and platform limitation to give readers a better understanding of utilizing those parallel approaches for gridding purposes.

  2. Two-dimensional numerical modeling of the cosmic ray storm

    International Nuclear Information System (INIS)

    Kadokura, A.; Nishida, A.

    1986-01-01

    A numerical model of the cosmic ray storm in the two-dimensional heliosphere is constructed incorporating the drift effect. We estimate the effect of a flare-associated interplanetary shock and the disturbed region behind it (characterized by enhancement in velocity and magnetic field, and decrease in mean free path) on the density and anisotropy of cosmic rays in the heliosphere. As the disturbance propagates outward, a density enhancement appears on the front side, and a density depression region is produced on the rear side. The effect of drift on the cosmic ray storm appears most clearly in the higher-latitude region. For the parallel (antiparallel) state of the solar magnetic field which corresponds to the pre(post-) 1980 period, the density in the higher-latitude region decreases (increases) before the shock arrival. The maximum density depression near the earth for the parallel state is greater than for the antiparallel state, and the energy spectrum of the density depression in percentage is softer for the parallel state than for the antiparallel state. Prior to the arrival of the shock, the phase of solar diurnal anisotropy begins to shift to the earlier hours, and its amplitude becomes greater for both polarity states. North-south anisotropy also becomes greater because of the enhanced drift for both polarity states

  3. A parallel attractor-finding algorithm based on Boolean satisfiability for genetic regulatory networks.

    Directory of Open Access Journals (Sweden)

    Wensheng Guo

    Full Text Available In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network. The interactions of activation and inhibition in the genetic regulatory network are modeled as a set of functions of the Boolean network, while the state transitions in the Boolean network reflect the dynamic property of a genetic regulatory network. A difficult problem for state transition analysis is the finding of attractors. In this paper, we modeled the genetic regulatory network as a Boolean network and proposed a solving algorithm to tackle the attractor finding problem. In the proposed algorithm, we partitioned the Boolean network into several blocks consisting of the strongly connected components according to their gradients, and defined the connection between blocks as decision node. Based on the solutions calculated on the decision nodes and using a satisfiability solving algorithm, we identified the attractors in the state transition graph of each block. The proposed algorithm is benchmarked on a variety of genetic regulatory networks. Compared with existing algorithms, it achieved similar performance on small test cases, and outperformed it on larger and more complex ones, which happens to be the trend of the modern genetic regulatory network. Furthermore, while the existing satisfiability-based algorithms cannot be parallelized due to their inherent algorithm design, the proposed algorithm exhibits a good scalability on parallel computing architectures.

  4. Parallel NGO networks for HIV control: risks and opportunities for NGO contracting.

    Science.gov (United States)

    Zaidi, Shehla; Gul, Xaher; Nishtar, Noureen Aleem

    2012-12-27

    Policy measures for preventive and promotive services are increasingly reliant on contracting of NGOs. Contracting is a neo-liberal response relying on open market competition for service delivery tenders. In contracting of health services a common assumption is a monolithic NGO market. A case study of HIV control in Pakistan shows that in reality the NGO market comprises of parallel NGO networks having widely different service packages, approaches and agendas. These parallel networks had evolved over time due to vertical policy agendas. Contracting of NGOs for provision of HIV services was faced with uneven capacities and turf rivalries across both NGO networks. At the same time contracting helped NGO providers belonging to different clusters to move towards standardized service delivery for HIV prevention. Market based measures such as contracting need to be accompanied with wider policy measures that facilitate in bringing NGOs groups to a shared understanding of health issues and responses.

  5. Equivalence of two-dimensional gravities

    International Nuclear Information System (INIS)

    Mohammedi, N.

    1990-01-01

    The authors find the relationship between the Jackiw-Teitelboim model of two-dimensional gravity and the SL(2,R) induced gravity. These are shown to be related to a two-dimensional gauge theory obtained by dimensionally reducing the Chern-Simons action of the 2 + 1 dimensional gravity. The authors present an explicit solution to the equations of motion of the auxiliary field of the Jackiw-Teitelboim model in the light-cone gauge. A renormalization of the cosmological constant is also given

  6. Research on the parallel load sharing principle of a novel self-decoupled piezoelectric six-dimensional force sensor.

    Science.gov (United States)

    Li, Ying-Jun; Yang, Cong; Wang, Gui-Cong; Zhang, Hui; Cui, Huan-Yong; Zhang, Yong-Liang

    2017-09-01

    This paper presents a novel integrated piezoelectric six-dimensional force sensor which can realize dynamic measurement of multi-dimensional space load. Firstly, the composition of the sensor, the spatial layout of force-sensitive components, and measurement principle are analyzed and designed. There is no interference of piezoelectric six-dimensional force sensor in theoretical analysis. Based on the principle of actual work and deformation compatibility coherence, this paper deduces the parallel load sharing principle of the piezoelectric six-dimensional force sensor. The main effect factors which affect the load sharing ratio are obtained. The finite element model of the piezoelectric six-dimensional force sensor is established. In order to verify the load sharing principle of the sensor, a load sharing test device of piezoelectric force sensor is designed and fabricated. The load sharing experimental platform is set up. The experimental results are in accordance with the theoretical analysis and simulation results. The experiments show that the multi-dimensional and heavy force measurement can be realized by the parallel arrangement of the load sharing ring and the force sensitive element in the novel integrated piezoelectric six-dimensional force sensor. The ideal load sharing effect of the sensor can be achieved by appropriate size parameters. This paper has an important guide for the design of the force measuring device according to the load sharing mode. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

  7. Scalable High-Performance Parallel Design for Network Intrusion Detection Systems on Many-Core Processors

    OpenAIRE

    Jiang, Hayang; Xie, Gaogang; Salamatian, Kavé; Mathy, Laurent

    2013-01-01

    Network Intrusion Detection Systems (NIDSes) face significant challenges coming from the relentless network link speed growth and increasing complexity of threats. Both hardware accelerated and parallel software-based NIDS solutions, based on commodity multi-core and GPU processors, have been proposed to overcome these challenges. Network Intrusion Detection Systems (NIDSes) face significant challenges coming from the relentless network link speed growth and increasing complexity of threats. ...

  8. Research on two-port network of wavelet transform processor using surface acoustic wavelet devices and its application.

    Science.gov (United States)

    Liu, Shoubing; Lu, Wenke; Zhu, Changchun

    2017-11-01

    The goal of this research is to study two-port network of wavelet transform processor (WTP) using surface acoustic wave (SAW) devices and its application. The motive was prompted by the inconvenience of the long research and design cycle and the huge research funding involved with traditional method in this field, which were caused by the lack of the simulation and emulation method of WTP using SAW devices. For this reason, we introduce the two-port network analysis tool, which has been widely used in the design and analysis of SAW devices with uniform interdigital transducers (IDTs). Because the admittance parameters calculation formula of the two-port network can only be used for the SAW devices with uniform IDTs, this analysis tool cannot be directly applied into the design and analysis of the processor using SAW devices, whose input interdigital transducer (IDT) is apodized weighting. Therefore, in this paper, we propose the channel segmentation method, which can convert the WTP using SAW devices into parallel channels, and also provide with the calculation formula of the number of channels, the number of finger pairs and the static capacitance of an interdigital period in each parallel channel firstly. From the parameters given above, we can calculate the admittance parameters of the two port network for each channel, so that we can obtain the admittance parameter of the two-port network of the WTP using SAW devices on the basis of the simplification rule of parallel two-port network. Through this analysis tool, not only can we get the impulse response function of the WTP using SAW devices but we can also get the matching circuit of it. Large numbers of studies show that the parameters of the two-port network obtained by this paper are consistent with those measured by network analyzer E5061A, and the impulse response function obtained by the two-port network analysis tool is also consistent with that measured by network analyzer E5061A, which can meet the

  9. Two-dimensional metamaterial optics

    International Nuclear Information System (INIS)

    Smolyaninov, I I

    2010-01-01

    While three-dimensional photonic metamaterials are difficult to fabricate, many new concepts and ideas in the metamaterial optics can be realized in two spatial dimensions using planar optics of surface plasmon polaritons. In this paper we review recent progress in this direction. Two-dimensional photonic crystals, hyperbolic metamaterials, and plasmonic focusing devices are demonstrated and used in novel microscopy and waveguiding schemes

  10. Parallel Monte Carlo reactor neutronics

    International Nuclear Information System (INIS)

    Blomquist, R.N.; Brown, F.B.

    1994-01-01

    The issues affecting implementation of parallel algorithms for large-scale engineering Monte Carlo neutron transport simulations are discussed. For nuclear reactor calculations, these include load balancing, recoding effort, reproducibility, domain decomposition techniques, I/O minimization, and strategies for different parallel architectures. Two codes were parallelized and tested for performance. The architectures employed include SIMD, MIMD-distributed memory, and workstation network with uneven interactive load. Speedups linear with the number of nodes were achieved

  11. Probing energy transfer events in the light harvesting complex 2 (LH2) of Rhodobacter sphaeroides with two-dimensional spectroscopy.

    Science.gov (United States)

    Fidler, Andrew F; Singh, Ved P; Long, Phillip D; Dahlberg, Peter D; Engel, Gregory S

    2013-10-21

    Excitation energy transfer events in the photosynthetic light harvesting complex 2 (LH2) of Rhodobacter sphaeroides are investigated with polarization controlled two-dimensional electronic spectroscopy. A spectrally broadened pulse allows simultaneous measurement of the energy transfer within and between the two absorption bands at 800 nm and 850 nm. The phased all-parallel polarization two-dimensional spectra resolve the initial events of energy transfer by separating the intra-band and inter-band relaxation processes across the two-dimensional map. The internal dynamics of the 800 nm region of the spectra are resolved as a cross peak that grows in on an ultrafast time scale, reflecting energy transfer between higher lying excitations of the B850 chromophores into the B800 states. We utilize a polarization sequence designed to highlight the initial excited state dynamics which uncovers an ultrafast transfer component between the two bands that was not observed in the all-parallel polarization data. We attribute the ultrafast transfer component to energy transfer from higher energy exciton states to lower energy states of the strongly coupled B850 chromophores. Connecting the spectroscopic signature to the molecular structure, we reveal multiple relaxation pathways including a cyclic transfer of energy between the two rings of the complex.

  12. Probing energy transfer events in the light harvesting complex 2 (LH2) of Rhodobacter sphaeroides with two-dimensional spectroscopy

    Energy Technology Data Exchange (ETDEWEB)

    Fidler, Andrew F.; Singh, Ved P.; Engel, Gregory S. [Department of Chemistry, The Institute for Biophysical Dynamics, and The James Franck Institute, The University of Chicago, Chicago, Illinois 60637 (United States); Long, Phillip D.; Dahlberg, Peter D. [Graduate Program in the Biophysical Sciences, The University of Chicago, Chicago, Illinois 60637 (United States)

    2013-10-21

    Excitation energy transfer events in the photosynthetic light harvesting complex 2 (LH2) of Rhodobacter sphaeroides are investigated with polarization controlled two-dimensional electronic spectroscopy. A spectrally broadened pulse allows simultaneous measurement of the energy transfer within and between the two absorption bands at 800 nm and 850 nm. The phased all-parallel polarization two-dimensional spectra resolve the initial events of energy transfer by separating the intra-band and inter-band relaxation processes across the two-dimensional map. The internal dynamics of the 800 nm region of the spectra are resolved as a cross peak that grows in on an ultrafast time scale, reflecting energy transfer between higher lying excitations of the B850 chromophores into the B800 states. We utilize a polarization sequence designed to highlight the initial excited state dynamics which uncovers an ultrafast transfer component between the two bands that was not observed in the all-parallel polarization data. We attribute the ultrafast transfer component to energy transfer from higher energy exciton states to lower energy states of the strongly coupled B850 chromophores. Connecting the spectroscopic signature to the molecular structure, we reveal multiple relaxation pathways including a cyclic transfer of energy between the two rings of the complex.

  13. Probing energy transfer events in the light harvesting complex 2 (LH2) of Rhodobacter sphaeroides with two-dimensional spectroscopy

    International Nuclear Information System (INIS)

    Fidler, Andrew F.; Singh, Ved P.; Engel, Gregory S.; Long, Phillip D.; Dahlberg, Peter D.

    2013-01-01

    Excitation energy transfer events in the photosynthetic light harvesting complex 2 (LH2) of Rhodobacter sphaeroides are investigated with polarization controlled two-dimensional electronic spectroscopy. A spectrally broadened pulse allows simultaneous measurement of the energy transfer within and between the two absorption bands at 800 nm and 850 nm. The phased all-parallel polarization two-dimensional spectra resolve the initial events of energy transfer by separating the intra-band and inter-band relaxation processes across the two-dimensional map. The internal dynamics of the 800 nm region of the spectra are resolved as a cross peak that grows in on an ultrafast time scale, reflecting energy transfer between higher lying excitations of the B850 chromophores into the B800 states. We utilize a polarization sequence designed to highlight the initial excited state dynamics which uncovers an ultrafast transfer component between the two bands that was not observed in the all-parallel polarization data. We attribute the ultrafast transfer component to energy transfer from higher energy exciton states to lower energy states of the strongly coupled B850 chromophores. Connecting the spectroscopic signature to the molecular structure, we reveal multiple relaxation pathways including a cyclic transfer of energy between the two rings of the complex

  14. Electromagnetically induced two-dimensional grating assisted by incoherent pump

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Yu-Yuan; Liu, Zhuan-Zhuan; Wan, Ren-Gang, E-mail: wrg@snnu.edu.cn

    2017-04-25

    We propose a scheme for realizing electromagnetically induced two-dimensional grating in a double-Λ system driven simultaneously by a coherent field and an incoherent pump field. In such an atomic configuration, the absorption is suppressed owing to the incoherent pumping process and the probe can be even amplified, while the refractivity is mainly attributed to the dynamically induced coherence. With the help of a standing-wave pattern coherent field, we obtain periodically modulated refractive index without or with gain, and therefore phase grating or gain-phase grating which diffracts a probe light into high-order direction efficiently can be formed in the medium via appropriate manipulation of the system parameters. The diffraction efficiency attainable by the present gratings can be controlled by tuning the coherent field intensity or the interaction length. Hence, the two-dimensional grating can be utilized as all-optical splitter or router in optical networking and communication. - Highlights: • Two-dimensional grating is coherently induced in four-level atoms. • Phase and gain-phase gratings are obtained assisted by incoherent pump. • The diffraction power is improved due to the enhanced refraction modulation. • The gratings can be utilized as multi-channel all-optical splitter and router.

  15. A parallel adaptive quantum genetic algorithm for the controllability of arbitrary networks.

    Science.gov (United States)

    Li, Yuhong; Gong, Guanghong; Li, Ni

    2018-01-01

    In this paper, we propose a novel algorithm-parallel adaptive quantum genetic algorithm-which can rapidly determine the minimum control nodes of arbitrary networks with both control nodes and state nodes. The corresponding network can be fully controlled with the obtained control scheme. We transformed the network controllability issue into a combinational optimization problem based on the Popov-Belevitch-Hautus rank condition. A set of canonical networks and a list of real-world networks were experimented. Comparison results demonstrated that the algorithm was more ideal to optimize the controllability of networks, especially those larger-size networks. We demonstrated subsequently that there were links between the optimal control nodes and some network statistical characteristics. The proposed algorithm provides an effective approach to improve the controllability optimization of large networks or even extra-large networks with hundreds of thousands nodes.

  16. A parallel adaptive quantum genetic algorithm for the controllability of arbitrary networks

    Science.gov (United States)

    Li, Yuhong

    2018-01-01

    In this paper, we propose a novel algorithm—parallel adaptive quantum genetic algorithm—which can rapidly determine the minimum control nodes of arbitrary networks with both control nodes and state nodes. The corresponding network can be fully controlled with the obtained control scheme. We transformed the network controllability issue into a combinational optimization problem based on the Popov-Belevitch-Hautus rank condition. A set of canonical networks and a list of real-world networks were experimented. Comparison results demonstrated that the algorithm was more ideal to optimize the controllability of networks, especially those larger-size networks. We demonstrated subsequently that there were links between the optimal control nodes and some network statistical characteristics. The proposed algorithm provides an effective approach to improve the controllability optimization of large networks or even extra-large networks with hundreds of thousands nodes. PMID:29554140

  17. Low-dimensional recurrent neural network-based Kalman filter for speech enhancement.

    Science.gov (United States)

    Xia, Youshen; Wang, Jun

    2015-07-01

    This paper proposes a new recurrent neural network-based Kalman filter for speech enhancement, based on a noise-constrained least squares estimate. The parameters of speech signal modeled as autoregressive process are first estimated by using the proposed recurrent neural network and the speech signal is then recovered from Kalman filtering. The proposed recurrent neural network is globally asymptomatically stable to the noise-constrained estimate. Because the noise-constrained estimate has a robust performance against non-Gaussian noise, the proposed recurrent neural network-based speech enhancement algorithm can minimize the estimation error of Kalman filter parameters in non-Gaussian noise. Furthermore, having a low-dimensional model feature, the proposed neural network-based speech enhancement algorithm has a much faster speed than two existing recurrent neural networks-based speech enhancement algorithms. Simulation results show that the proposed recurrent neural network-based speech enhancement algorithm can produce a good performance with fast computation and noise reduction. Copyright © 2015 Elsevier Ltd. All rights reserved.

  18. Two-stage neural-network-based technique for Urdu character two-dimensional shape representation, classification, and recognition

    Science.gov (United States)

    Megherbi, Dalila B.; Lodhi, S. M.; Boulenouar, A. J.

    2001-03-01

    This work is in the field of automated document processing. This work addresses the problem of representation and recognition of Urdu characters using Fourier representation and a Neural Network architecture. In particular, we show that a two-stage Neural Network scheme is used here to make classification of 36 Urdu characters into seven sub-classes namely subclasses characterized by seven proposed and defined fuzzy features specifically related to Urdu characters. We show that here Fourier Descriptors and Neural Network provide a remarkably simple way to draw definite conclusions from vague, ambiguous, noisy or imprecise information. In particular, we illustrate the concept of interest regions and describe a framing method that provides a way to make the proposed technique for Urdu characters recognition robust and invariant to scaling and translation. We also show that a given character rotation is dealt with by using the Hotelling transform. This transform is based upon the eigenvalue decomposition of the covariance matrix of an image, providing a method of determining the orientation of the major axis of an object within an image. Finally experimental results are presented to show the power and robustness of the proposed two-stage Neural Network based technique for Urdu character recognition, its fault tolerance, and high recognition accuracy.

  19. Estimation of the hydraulic conductivity of a two-dimensional fracture network using effective medium theory and power-law averaging

    Science.gov (United States)

    Zimmerman, R. W.; Leung, C. T.

    2009-12-01

    Most oil and gas reservoirs, as well as most potential sites for nuclear waste disposal, are naturally fractured. In these sites, the network of fractures will provide the main path for fluid to flow through the rock mass. In many cases, the fracture density is so high as to make it impractical to model it with a discrete fracture network (DFN) approach. For such rock masses, it would be useful to have recourse to analytical, or semi-analytical, methods to estimate the macroscopic hydraulic conductivity of the fracture network. We have investigated single-phase fluid flow through generated stochastically two-dimensional fracture networks. The centers and orientations of the fractures are uniformly distributed, whereas their lengths follow a lognormal distribution. The aperture of each fracture is correlated with its length, either through direct proportionality, or through a nonlinear relationship. The discrete fracture network flow and transport simulator NAPSAC, developed by Serco (Didcot, UK), is used to establish the “true” macroscopic hydraulic conductivity of the network. We then attempt to match this value by starting with the individual fracture conductances, and using various upscaling methods. Kirkpatrick’s effective medium approximation, which works well for pore networks on a core scale, generally underestimates the conductivity of the fracture networks. We attribute this to the fact that the conductances of individual fracture segments (between adjacent intersections with other fractures) are correlated with each other, whereas Kirkpatrick’s approximation assumes no correlation. The power-law averaging approach proposed by Desbarats for porous media is able to match the numerical value, using power-law exponents that generally lie between 0 (geometric mean) and 1 (harmonic mean). The appropriate exponent can be correlated with statistical parameters that characterize the fracture density.

  20. Parallel or convergent evolution in human population genomic data revealed by genotype networks.

    Science.gov (United States)

    R Vahdati, Ali; Wagner, Andreas

    2016-08-02

    Genotype networks are representations of genetic variation data that are complementary to phylogenetic trees. A genotype network is a graph whose nodes are genotypes (DNA sequences) with the same broadly defined phenotype. Two nodes are connected if they differ in some minimal way, e.g., in a single nucleotide. We analyze human genome variation data from the 1,000 genomes project, and construct haploid genotype (haplotype) networks for 12,235 protein coding genes. The structure of these networks varies widely among genes, indicating different patterns of variation despite a shared evolutionary history. We focus on those genes whose genotype networks show many cycles, which can indicate homoplasy, i.e., parallel or convergent evolution, on the sequence level. For 42 genes, the observed number of cycles is so large that it cannot be explained by either chance homoplasy or recombination. When analyzing possible explanations, we discovered evidence for positive selection in 21 of these genes and, in addition, a potential role for constrained variation and purifying selection. Balancing selection plays at most a small role. The 42 genes with excess cycles are enriched in functions related to immunity and response to pathogens. Genotype networks are representations of genetic variation data that can help understand unusual patterns of genomic variation.

  1. Direct and iterative algorithms for the parallel solution of the one-dimensional macroscopic Navier-Stokes equations

    International Nuclear Information System (INIS)

    Doster, J.M.; Sills, E.D.

    1986-01-01

    Current efforts are under way to develop and evaluate numerical algorithms for the parallel solution of the large sparse matrix equations associated with the finite difference representation of the macroscopic Navier-Stokes equations. Previous work has shown that these equations can be cast into smaller coupled matrix equations suitable for solution utilizing multiple computer processors operating in parallel. The individual processors themselves may exhibit parallelism through the use of vector pipelines. This wor, has concentrated on the one-dimensional drift flux form of the Navier-Stokes equations. Direct and iterative algorithms that may be suitable for implementation on parallel computer architectures are evaluated in terms of accuracy and overall execution speed. This work has application to engineering and training simulations, on-line process control systems, and engineering workstations where increased computational speeds are required

  2. Bayesian Network Constraint-Based Structure Learning Algorithms: Parallel and Optimized Implementations in the bnlearn R Package

    Directory of Open Access Journals (Sweden)

    Marco Scutari

    2017-03-01

    Full Text Available It is well known in the literature that the problem of learning the structure of Bayesian networks is very hard to tackle: Its computational complexity is super-exponential in the number of nodes in the worst case and polynomial in most real-world scenarios. Efficient implementations of score-based structure learning benefit from past and current research in optimization theory, which can be adapted to the task by using the network score as the objective function to maximize. This is not true for approaches based on conditional independence tests, called constraint-based learning algorithms. The only optimization in widespread use, backtracking, leverages the symmetries implied by the definitions of neighborhood and Markov blanket. In this paper we illustrate how backtracking is implemented in recent versions of the bnlearn R package, and how it degrades the stability of Bayesian network structure learning for little gain in terms of speed. As an alternative, we describe a software architecture and framework that can be used to parallelize constraint-based structure learning algorithms (also implemented in bnlearn and we demonstrate its performance using four reference networks and two real-world data sets from genetics and systems biology. We show that on modern multi-core or multiprocessor hardware parallel implementations are preferable over backtracking, which was developed when single-processor machines were the norm.

  3. A development of two-dimensional birefringence distribution measurement system with a sampling rate of 1.3 MHz

    Science.gov (United States)

    Onuma, Takashi; Otani, Yukitoshi

    2014-03-01

    A two-dimensional birefringence distribution measurement system with a sampling rate of 1.3 MHz is proposed. A polarization image sensor is developed as core device of the system. It is composed of a pixelated polarizer array made from photonic crystal and a parallel read out circuit with a multi-channel analog to digital converter specialized for two-dimensional polarization detection. By applying phase shifting algorism with circularly-polarized incident light, birefringence phase difference and azimuthal angle can be measured. The performance of the system is demonstrated experimentally by measuring actual birefringence distribution and polarization device such as Babinet-Soleil compensator.

  4. Low-dimensional morphospace of topological motifs in human fMRI brain networks

    Directory of Open Access Journals (Sweden)

    Sarah E. Morgan

    2018-06-01

    Full Text Available We present a low-dimensional morphospace of fMRI brain networks, where axes are defined in a data-driven manner based on the network motifs. The morphospace allows us to identify the key variations in healthy fMRI networks in terms of their underlying motifs, and we observe that two principal components (PCs can account for 97% of the motif variability. The first PC of the motif distribution is correlated with efficiency and inversely correlated with transitivity. Hence this axis approximately conforms to the well-known economical small-world trade-off between integration and segregation in brain networks. Finally, we show that the economical clustering generative model proposed by Vértes et al. (2012 can approximately reproduce the motif morphospace of the real fMRI brain networks, in contrast to other generative models. Overall, the motif morphospace provides a powerful way to visualize the relationships between network properties and to investigate generative or constraining factors in the formation of complex human brain functional networks. Motifs have been described as the building blocks of complex networks. Meanwhile, a morphospace allows networks to be placed in a common space and can reveal the relationships between different network properties and elucidate the driving forces behind network topology. We combine the concepts of motifs and morphospaces to create the first motif morphospace of fMRI brain networks. Crucially, the morphospace axes are defined by the motifs, in a data-driven manner. We observe strong correlations between the networks’ positions in morphospace and their global topological properties, suggesting that motif morphospaces are a powerful way to capture the topology of networks in a low-dimensional space and to compare generative models of brain networks. Motif morphospaces could also be used to study other complex networks’ topologies.

  5. Two-dimensional convolution subject to data-spreading algorithm. Report for August 1985-July 1986

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Y C; Wang, H C

    1986-01-01

    An algorithm for two-dimensional convolution is proposed to be highly efficient and suitable for parallel processing, and a hardware of pipeline architecture is implemented to realize the algorithm. The implemented hardware is built on an IBM personal computer and acts as an auxiliary processor of the personal computer. This makes the dream come true that high speed, low-cost image processing is feasible on personal computers. The hardware executes two operations of two-dimensional convolution concurrently on an 256 x 256 image frame in less than 500 miniseconds. Several functions are available to users, and parameters such as weighting coefficients and threshold value are programmable. Various processing results of the image frame can be obtained by changing these parameters. Besides, horizontal and vertical edge detection can also be executed concurrently, with results available at the same time.

  6. Two and Three-Dimensional Nonlocal DFT for Inhomogeneous Fluids I: Algorithms and Parallelization

    Energy Technology Data Exchange (ETDEWEB)

    Frink, Laura J. Douglas; Salinger, Andrew

    1999-08-09

    Fluids adsorbed near surfaces, macromolecules, and in porous materials are inhomogeneous, inhibiting spatially varying density distributions. This inhomogeneity in the fluid plays an important role in controlling a wide variety of complex physical phenomena including wetting, self-assembly, corrosion, and molecular recognition. One of the key methods for studying the properties of inhomogeneous fluids in simple geometries has been density functional theory (DFT). However, there has been a conspicuous lack of calculations in complex 2D and 3D geometries. The computational difficulty arises from the need to perform nested integrals that are due to nonlocal terms in the free energy functional These integral equations are expensive both in evaluation time and in memory requirements; however, the expense can be mitigated by intelligent algorithms and the use of parallel computers. This paper details our efforts to develop efficient numerical algorithms so that no local DFT calculations in complex geometries that require two or three dimensions can be performed. The success of this implementation will enable the study of solvation effects at heterogeneous surfaces, in zeolites, in solvated (bio)polymers, and in colloidal suspensions.

  7. Two-dimensional random arrays for real time volumetric imaging

    DEFF Research Database (Denmark)

    Davidsen, Richard E.; Jensen, Jørgen Arendt; Smith, Stephen W.

    1994-01-01

    real time volumetric imaging system, which employs a wide transmit beam and receive mode parallel processing to increase image frame rate. Depth-of-field comparisons were made from simulated on-axis and off-axis beamplots at ranges from 30 to 160 mm for both coaxial and offset transmit and receive......Two-dimensional arrays are necessary for a variety of ultrasonic imaging techniques, including elevation focusing, 2-D phase aberration correction, and real time volumetric imaging. In order to reduce system cost and complexity, sparse 2-D arrays have been considered with element geometries...... selected ad hoc, by algorithm, or by random process. Two random sparse array geometries and a sparse array with a Mills cross receive pattern were simulated and compared to a fully sampled aperture with the same overall dimensions. The sparse arrays were designed to the constraints of the Duke University...

  8. Measurement model and calibration experiment of over-constrained parallel six-dimensional force sensor based on stiffness characteristics analysis

    International Nuclear Information System (INIS)

    Niu, Zhi; Zhao, Yanzhi; Zhao, Tieshi; Cao, Yachao; Liu, Menghua

    2017-01-01

    An over-constrained, parallel six-dimensional force sensor has various advantages, including its ability to bear heavy loads and provide redundant force measurement information. These advantages render the sensor valuable in important applications in the field of aerospace (space docking tests, etc). The stiffness of each component in the over-constrained structure has a considerable influence on the internal force distribution of the structure. Thus, the measurement model changes when the measurement branches of the sensor are under tensile or compressive force. This study establishes a general measurement model for an over-constrained parallel six-dimensional force sensor considering the different branch tensions and compression stiffness values. Numerical calculations and analyses are performed using practical examples. Based on the parallel mechanism, an over-constrained, orthogonal structure is proposed for a six-dimensional force sensor. Hence, a prototype is designed and developed, and a calibration experiment is conducted. The measurement accuracy of the sensor is improved based on the measurement model under different branch tensions and compression stiffness values. Moreover, the largest class I error is reduced from 5.81 to 2.23% full scale (FS), and the largest class II error is reduced from 3.425 to 1.871% FS. (paper)

  9. Parallel Breadth-First Search on Distributed Memory Systems

    Energy Technology Data Exchange (ETDEWEB)

    Computational Research Division; Buluc, Aydin; Madduri, Kamesh

    2011-04-15

    Data-intensive, graph-based computations are pervasive in several scientific applications, and are known to to be quite challenging to implement on distributed memory systems. In this work, we explore the design space of parallel algorithms for Breadth-First Search (BFS), a key subroutine in several graph algorithms. We present two highly-tuned par- allel approaches for BFS on large parallel systems: a level-synchronous strategy that relies on a simple vertex-based partitioning of the graph, and a two-dimensional sparse matrix- partitioning-based approach that mitigates parallel commu- nication overhead. For both approaches, we also present hybrid versions with intra-node multithreading. Our novel hybrid two-dimensional algorithm reduces communication times by up to a factor of 3.5, relative to a common vertex based approach. Our experimental study identifies execu- tion regimes in which these approaches will be competitive, and we demonstrate extremely high performance on lead- ing distributed-memory parallel systems. For instance, for a 40,000-core parallel execution on Hopper, an AMD Magny- Cours based system, we achieve a BFS performance rate of 17.8 billion edge visits per second on an undirected graph of 4.3 billion vertices and 68.7 billion edges with skewed degree distribution.

  10. Three-dimensional interconnected nickel phosphide networks with hollow microstructures and desulfurization performance

    International Nuclear Information System (INIS)

    Zhang, Shuna; Zhang, Shujuan; Song, Limin; Wu, Xiaoqing; Fang, Sheng

    2014-01-01

    Graphical abstract: Three-dimensional interconnected nickel phosphide networks with hollow microstructures and desulfurization performance. - Highlights: • Three-dimensional Ni 2 P has been prepared using foam nickel as a template. • The microstructures interconnected and formed sponge-like porous networks. • Three-dimensional Ni 2 P shows superior hydrodesulfurization activity. - Abstract: Three-dimensional microstructured nickel phosphide (Ni 2 P) was fabricated by the reaction between foam nickel (Ni) and phosphorus red. The as-prepared Ni 2 P samples, as interconnected networks, maintained the original mesh structure of foamed nickel. The crystal structure and morphology of the as-synthesized Ni 2 P were characterized by X-ray diffraction, scanning electron microscopy, automatic mercury porosimetry and X-ray photoelectron spectroscopy. The SEM study showed adjacent hollow branches were mutually interconnected to form sponge-like networks. The investigation on pore structure provided detailed information for the hollow microstructures. The growth mechanism for the three-dimensionally structured Ni 2 P was postulated and discussed in detail. To investigate its catalytic properties, SiO 2 supported three-dimensional Ni 2 P was prepared successfully and evaluated for the hydrodesulfurization (HDS) of dibenzothiophene (DBT). DBT molecules were mostly hydrogenated and then desulfurized by Ni 2 P/SiO 2

  11. Locating hardware faults in a data communications network of a parallel computer

    Science.gov (United States)

    Archer, Charles J.; Megerian, Mark G.; Ratterman, Joseph D.; Smith, Brian E.

    2010-01-12

    Hardware faults location in a data communications network of a parallel computer. Such a parallel computer includes a plurality of compute nodes and a data communications network that couples the compute nodes for data communications and organizes the compute node as a tree. Locating hardware faults includes identifying a next compute node as a parent node and a root of a parent test tree, identifying for each child compute node of the parent node a child test tree having the child compute node as root, running a same test suite on the parent test tree and each child test tree, and identifying the parent compute node as having a defective link connected from the parent compute node to a child compute node if the test suite fails on the parent test tree and succeeds on all the child test trees.

  12. Optical conductivity of three and two dimensional topological nodal-line semimetals

    Science.gov (United States)

    Barati, Shahin; Abedinpour, Saeed H.

    2017-10-01

    The peculiar shape of the Fermi surface of topological nodal-line semimetals at low carrier concentrations results in their unusual optical and transport properties. We analytically investigate the linear optical responses of three- and two-dimensional nodal-line semimetals using the Kubo formula. The optical conductivity of a three-dimensional nodal-line semimetal is anisotropic. Along the axial direction (i.e., the direction perpendicular to the nodal-ring plane), the Drude weight has a linear dependence on the chemical potential at both low and high carrier dopings. For the radial direction (i.e., the direction parallel to the nodal-ring plane), this dependence changes from linear into quadratic in the transition from low into high carrier concentration. The interband contribution into optical conductivity is also anisotropic. In particular, at large frequencies, it saturates to a constant value for the axial direction and linearly increases with frequency along the radial direction. In two-dimensional nodal-line semimetals, no interband optical transition could be induced and the only contribution to the optical conductivity arises from the intraband excitations. The corresponding Drude weight is independent of the carrier density at low carrier concentrations and linearly increases with chemical potential at high carrier doping.

  13. Tracer particles in two-dimensional elastic networks diffuse logarithmically slow

    International Nuclear Information System (INIS)

    Lizana, Ludvig; Ambjörnsson, Tobias; Lomholt, Michael A

    2017-01-01

    Several experiments on tagged molecules or particles in living systems suggest that they move anomalously slow—their mean squared displacement (MSD) increase slower than linearly with time. Leading models aimed at understanding these experiments predict that the MSD grows as a power law with a growth exponent that is smaller than unity. However, in some experiments the growth is so slow (fitted exponent  ∼0.1–0.2) that they hint towards other mechanisms at play. In this paper, we theoretically demonstrate how in-plane collective modes excited by thermal fluctuations in a two dimensional membrane lead to logarithmic time dependence for the the tracer particle’s MSD. (paper)

  14. FMG, RENUM, LINEL, ELLFMG, ELLP, and DIMES: Chain of programs for calculating and analyzing fluid flow through two-dimensional fracture networks -- theory and design

    International Nuclear Information System (INIS)

    Billaux, D.; Bodea, S.; Long, J.

    1988-02-01

    This report describes some of the programs developed at Lawrence Berkeley Laboratory for network modelling. By themselves, these programs form a complete chain for the study of the equivalent permeability of two-dimensional fracture networks. FMG generates the fractures considered as line discontinuities, with any desired distribution of aperture, length, and orientation. The locations of these fractures on a plane can be either specified or generated randomly. The intersections of these fractures with each other, and with the boundaries of a specified flow region, are determined, and a finite element line network is output. RENUM is a line network optimizer. Nodes very close to each other are merged, dead-ends are removed, and the nodes are then renumbered in order to minimize the bandwidth of the corresponding linear system of equations. LINEL computes the steady state flux through a mesh of line elements previously processed by program RENUM. Equivalent directional permeabilities are output. ELLFMG determines the three components of the permeability tensor which best fits the directional permeabilities output by LINEL. A measure of the goodness fit is also computed. Two plotting programs, DIMES and ELLP, help visualize the outputs of these programs. DIMES plots the line network at various stages of the process. ELLP plots the equivalent permeability results. 14 refs., 25 figs

  15. Two-state ion heating at quasi-parallel shocks

    International Nuclear Information System (INIS)

    Thomsen, M.F.; Gosling, J.T.; Bame, S.J.; Onsager, T.G.; Russell, C.T.

    1990-01-01

    In a previous study of ion heating at quasi-parallel shocks, the authors showed a case in which the ion distributions downstream from the shock alternated between a cooler, denser, core/shoulder type and a hotter, less dense, more Maxwellian type. In this paper they further document the alternating occurrence of two different ion states downstream from several quasi-parallel shocks. Three separate lines of evidence are presented to show that the two states are not related in an evolutionary sense, but rather both are produced alternately at the shock: (1) the asymptotic downstream plasma parameters (density, ion temperature, and flow speed) are intermediate between those characterizing the two different states closer to the shock, suggesting that the asymptotic state is produced by a mixing of the two initial states; (2) examples of apparently interpenetrating (i.e., mixing) distributions can be found during transitions from one state to the other; and (3) examples of both types of distributions can be found at actual crossings of the shock ramp. The alternation between the two different types of ion distribution provides direct observational support for the idea that the dissipative dynamics of at least some quasi-parallel shocks is non-stationary and cyclic in nature, as demonstrated by recent numerical simulations. Typical cycle times between intervals of similar ion heating states are ∼2 upstream ion gyroperiods. Both the simulations and the in situ observations indicate that a process of coherent ion reflection is commonly an important part of the dissipation at quasi-parallel shocks

  16. NMRKIN: Simulating line shapes from two-dimensional spectra of proteins upon ligand binding

    International Nuclear Information System (INIS)

    Guenther, Ulrich L.; Schaffhausen, Brian

    2002-01-01

    The analysis of the shape of signals in NMR spectra is a powerful tool to study exchange and reaction kinetics. Line shapes in two-dimensional spectra of proteins recorded for titrations with ligands provide information about binding rates observed at individual residues. Here we describe a fast method to simulate a series of line shapes derived from two-dimensional spectra of a protein during a ligand titration. This procedure, which takes the mutual effects of two dimensions into account, has been implemented in MATLAB as an add-on to NMRLab (Guenther et al., 2000). In addition, more complex kinetic models, including sequential and parallel reactions, were simulated to demonstrate common features of more complex line shapes which could be encountered in protein-ligand interactions. As an example of this method, we describe its application to line shapes obtained for a titration of the p85 N-SH2 domain of PI3-kinase with a peptide derived from polyomavirus middle T antigen (MT)

  17. HAM solutions on MHD squeezing axisymmetric flow of water nanofluid through saturated porous medium between two parallel disks

    Science.gov (United States)

    Reddy, B. Siva Kumar; Rao, K. V. Surya Narayana; Vijaya, R. Bhuvana

    2017-07-01

    In this paper, we have considered the unsteady magnetohydrodynamic squeezing axi-symmetric flow of water-nanofluid through saturated porous medium between two parallel disks. The equations for the governing flow are solved by Galerkin optimal Homotopy asymptotic method. The effects of non-dimensional parameters on velocity, temperature and concentration have been discussed with the help of graphs. Also we obtained local Nusselt number and computationally discussed with reference to flow parameters.

  18. A parallel finite-difference method for computational aerodynamics

    International Nuclear Information System (INIS)

    Swisshelm, J.M.

    1989-01-01

    A finite-difference scheme for solving complex three-dimensional aerodynamic flow on parallel-processing supercomputers is presented. The method consists of a basic flow solver with multigrid convergence acceleration, embedded grid refinements, and a zonal equation scheme. Multitasking and vectorization have been incorporated into the algorithm. Results obtained include multiprocessed flow simulations from the Cray X-MP and Cray-2. Speedups as high as 3.3 for the two-dimensional case and 3.5 for segments of the three-dimensional case have been achieved on the Cray-2. The entire solver attained a factor of 2.7 improvement over its unitasked version on the Cray-2. The performance of the parallel algorithm on each machine is analyzed. 14 refs

  19. A two-dimensional CdII coordination polymer: poly[diaqua[μ3-5,6-bis(pyridin-2-ylpyrazine-2,3-dicarboxylato-κ5O2:O3:O3,N4,N5]cadmium

    Directory of Open Access Journals (Sweden)

    Monserrat Alfonso

    2016-09-01

    Full Text Available The reaction of 5,6-bis(pyridin-2-ylpyrazine-2,3-dicarboxylic acid with cadmium dichloride leads to the formation of the title two-dimensional coordination polymer, [Cd(C16H8N4O4(H2O2]n. The metal atom is sevenfold coordinated by one pyrazine and one pyridine N atom, two water O atoms, and by two carboxylate O atoms, one of which bridges two CdII atoms to form a Cd2O2 unit situated about a centre of inversion. Hence, the ligand coordinates to the cadmium atom in an N,N′,O-tridentate and an O-monodentate manner. Within the polymer network, there are a number of O—H...O hydrogen bonds present, involving the water molecules and the carboxylate O atoms. There are also C—H...N and C—H...O hydrogen bonds present. In the crystal, the polymer networks lie parallel to the bc plane. They are aligned back-to-back along the a axis with the non-coordinating pyridine rings directed into the space between the networks.

  20. An experimental study of two-phase flow instability on two parallel channel with low steam quality

    International Nuclear Information System (INIS)

    Jiang Shengyao; Wu shaorong; Bo Jinhai; Yao Meisheng; Han Bing; Zhang Youjie

    1988-01-01

    An experimental result of two-phase flow instability on two parallel channel natural circulation with low steam quality is presented. The comparison of instability in the single channel and that in parallel channel is given. The effect of unequal inlet resistance coefficient and unequal power on the parallel channel instability is described and the behaviour of instability with equal exit steam quality in the two channel is investigated

  1. Assembly of one-dimensional supramolecular objects: From monomers to networks

    Science.gov (United States)

    Sayar, Mehmet; Stupp, Samuel I.

    2005-07-01

    One-dimensional supramolecular aggregates can form networks at exceedingly low concentrations. Recent experiments in several laboratories, including our own, have demonstrated the formation of gels by these systems at concentrations well under 1% by weight. The systems of interest in our laboratory form either cylindrical nanofibers or ribbons as a result of strong noncovalent interactions among monomers. The stiffness and interaction energies among these thread-like objects can vary significantly depending on the chemical structure of the monomers used. We have used Monte Carlo simulations to study the structure of the threads and their ability to form networks through bundle formation. The persistence length of the threads was found to be strongly affected not only by stiffness, but also by the strength of attractive two-body interactions among thread segments. The relative values of stiffness and attractive two-body interaction strength determine if threads collapse or create bundles. Only in the presence of sufficiently long threads and bundle formation can these systems assemble into networks of high connectivity.

  2. On the two-dimensional Saigo-Maeda fractional calculus asociated with two-dimensional Aleph TRANSFORM

    Directory of Open Access Journals (Sweden)

    Dinesh Kumar

    2013-11-01

    Full Text Available This paper deals with the study of two-dimensional Saigo-Maeda operators of Weyl type associated with Aleph function defined in this paper. Two theorems on these defined operators are established. Some interesting results associated with the H-functions and generalized Mittag-Leffler functions are deduced from the derived results. One dimensional analog of the derived results is also obtained.

  3. High-speed fan-beam reconstruction using direct two-dimensional Fourier transform method

    International Nuclear Information System (INIS)

    Niki, Noboru; Mizutani, Toshio; Takahashi, Yoshizo; Inouye, Tamon.

    1984-01-01

    Since the first development of X-ray computer tomography (CT), various efforts have been made to obtain high quality of high-speed image. However, the development of high resolution CT and the ultra-high speed CT to be applied to hearts is still desired. The X-ray beam scanning method was already changed from the parallel beam system to the fan-beam system in order to greatly shorten the scanning time. Also, the filtered back projection (DFBP) method has been employed to directly processing fan-beam projection data as reconstruction method. Although the two-dimensional Fourier transform (TFT) method significantly faster than FBP method was proposed, it has not been sufficiently examined for fan-beam projection data. Thus, the ITFT method was investigated, which first executes rebinning algorithm to convert the fan-beam projection data to the parallel beam projection data, thereafter, uses two-dimensional Fourier transform. By this method, although high speed is expected, the reconstructed images might be degraded due to the adoption of rebinning algorithm. Therefore, the effect of the interpolation error of rebinning algorithm on the reconstructed images has been analyzed theoretically, and finally, the result of the employment of spline interpolation which allows the acquisition of high quality images with less errors has been shown by the numerical and visual evaluation based on simulation and actual data. Computation time was reduced to 1/15 for the image matrix of 512 and to 1/30 for doubled matrix. (Wakatsuki, Y.)

  4. Throughput Analysis on 3-Dimensional Underwater Acoustic Network with One-Hop Mobile Relay

    Science.gov (United States)

    Zhong, Xuefeng; Fan, Jiasheng; Guan, Quansheng; Ji, Fei; Yu, Hua

    2018-01-01

    Underwater acoustic communication network (UACN) has been considered as an essential infrastructure for ocean exploitation. Performance analysis of UACN is important in underwater acoustic network deployment and management. In this paper, we analyze the network throughput of three-dimensional randomly deployed transmitter–receiver pairs. Due to the long delay of acoustic channels, complicated networking protocols with heavy signaling overhead may not be appropriate. In this paper, we consider only one-hop or two-hop transmission, to save the signaling cost. That is, we assume the transmitter sends the data packet to the receiver by one-hop direct transmission, or by two-hop transmission via mobile relays. We derive the closed-form formulation of packet delivery rate with respect to the transmission delay and the number of transmitter–receiver pairs. The correctness of the derivation results are verified by computer simulations. Our analysis indicates how to obtain a precise tradeoff between the delay constraint and the network capacity. PMID:29337911

  5. Throughput Analysis on 3-Dimensional Underwater Acoustic Network with One-Hop Mobile Relay.

    Science.gov (United States)

    Zhong, Xuefeng; Chen, Fangjiong; Fan, Jiasheng; Guan, Quansheng; Ji, Fei; Yu, Hua

    2018-01-16

    Underwater acoustic communication network (UACN) has been considered as an essential infrastructure for ocean exploitation. Performance analysis of UACN is important in underwater acoustic network deployment and management. In this paper, we analyze the network throughput of three-dimensional randomly deployed transmitter-receiver pairs. Due to the long delay of acoustic channels, complicated networking protocols with heavy signaling overhead may not be appropriate. In this paper, we consider only one-hop or two-hop transmission, to save the signaling cost. That is, we assume the transmitter sends the data packet to the receiver by one-hop direct transmission, or by two-hop transmission via mobile relays. We derive the closed-form formulation of packet delivery rate with respect to the transmission delay and the number of transmitter-receiver pairs. The correctness of the derivation results are verified by computer simulations. Our analysis indicates how to obtain a precise tradeoff between the delay constraint and the network capacity.

  6. Two-dimensional model of a freely expanding plasma

    International Nuclear Information System (INIS)

    Khalid, Q.

    1975-01-01

    The free expansion of an initially confined plasma is studied by the computer experiment technique. The research is an extension to two dimensions of earlier work on the free expansion of a collisionless plasma in one dimension. In the two-dimensional rod model, developed in this research, the plasma particles, electrons and ions are modeled as infinitely long line charges or rods. The line charges move freely in two dimensions normal to their parallel axes, subject only to a self-consistent electric field. Two approximations, the grid approximation and the periodic boundary condition are made in order to reduce the computation time. In the grid approximation, the space occupied by the plasma at a given time is divided into boxes. The particles are subject to an average electric field calculated for that box assuming that the total charge within each box is located at the center of the box. However, the motion of each particle is exactly followed. The periodic boundary condition allows us to consider only one-fourth of the total number of particles of the plasma, representing the remaining three-fourths of the particles as symmetrically placed images of those whose positions are calculated. This approximation follows from the expected azimuthal symmetry of the plasma. The dynamics of the expansion are analyzed in terms of average ion and electron positions, average velocities, oscillation frequencies and relative distribution of energy between thermal, flow and electric field energies. Comparison is made with previous calculations of one-dimensional models which employed plane, spherical or cylindrical sheets as charged particles. In order to analyze the effect of the grid approximation, the model is solved for two different grid sizes and for each grid size the plasma dynamics is determined. For the initial phase of expansion, the agreement for the two grid sizes is found to be good

  7. Parallel ICA identifies sub-components of resting state networks that covary with behavioral indices.

    Science.gov (United States)

    Meier, Timothy B; Wildenberg, Joseph C; Liu, Jingyu; Chen, Jiayu; Calhoun, Vince D; Biswal, Bharat B; Meyerand, Mary E; Birn, Rasmus M; Prabhakaran, Vivek

    2012-01-01

    Parallel Independent Component Analysis (para-ICA) is a multivariate method that can identify complex relationships between different data modalities by simultaneously performing Independent Component Analysis on each data set while finding mutual information between the two data sets. We use para-ICA to test the hypothesis that spatial sub-components of common resting state networks (RSNs) covary with specific behavioral measures. Resting state scans and a battery of behavioral indices were collected from 24 younger adults. Group ICA was performed and common RSNs were identified by spatial correlation to publically available templates. Nine RSNs were identified and para-ICA was run on each network with a matrix of behavioral measures serving as the second data type. Five networks had spatial sub-components that significantly correlated with behavioral components. These included a sub-component of the temporo-parietal attention network that differentially covaried with different trial-types of a sustained attention task, sub-components of default mode networks that covaried with attention and working memory tasks, and a sub-component of the bilateral frontal network that split the left inferior frontal gyrus into three clusters according to its cytoarchitecture that differentially covaried with working memory performance. Additionally, we demonstrate the validity of para-ICA in cases with unbalanced dimensions using simulated data.

  8. First massively parallel algorithm to be implemented in APOLLO-II code

    International Nuclear Information System (INIS)

    Stankovski, Z.

    1994-01-01

    The collision probability method in neutron transport, as applied to arbitrary 2-dimensional geometries, like the two dimensional transport module in APOLLO-II is very time consuming. Consequently 3-dimensional extension became prohibitive. Fortunately, this method is very suitable for parallelization. Massively parallel computer architectures, especially MIMD machines, bring a new breath to this method. In this paper we present a CM5 implementation of the collision probability method. Parallelization is applied to the energy groups, using the CMMD massage passing library. In our case we used 32 processors for the standard 99-group APOLLIB-II library. The real advantage of this algorithm will appear in the calculation of the future multigroup library (about 8000 groups) of the SAPHYR project with a massively parallel computer (to the order of hundreds of processors). (author). 4 refs., 4 figs., 3 tabs

  9. Vectorization, parallelization and porting of nuclear codes on the VPP500 system (parallelization). Progress report fiscal 1996

    Energy Technology Data Exchange (ETDEWEB)

    Watanabe, Hideo; Kawai, Wataru; Nemoto, Toshiyuki [Fujitsu Ltd., Tokyo (Japan); and others

    1997-12-01

    Several computer codes in the nuclear field have been vectorized, parallelized and transported on the FUJITSU VPP500 system at Center for Promotion of Computational Science and Engineering in Japan Atomic Energy Research Institute. These results are reported in 3 parts, i.e., the vectorization part, the parallelization part and the porting part. In this report, we describe the parallelization. In this parallelization part, the parallelization of 2-Dimensional relativistic electromagnetic particle code EM2D, Cylindrical Direct Numerical Simulation code CYLDNS and molecular dynamics code for simulating radiation damages in diamond crystals DGR are described. In the vectorization part, the vectorization of two and three dimensional discrete ordinates simulation code DORT-TORT, gas dynamics analysis code FLOWGR and relativistic Boltzmann-Uehling-Uhlenbeck simulation code RBUU are described. And then, in the porting part, the porting of reactor safety analysis code RELAP5/MOD3.2 and RELAP5/MOD3.2.1.2, nuclear data processing system NJOY and 2-D multigroup discrete ordinate transport code TWOTRAN-II are described. And also, a survey for the porting of command-driven interactive data analysis plotting program IPLOT are described. (author)

  10. Wave dispersion relation of two-dimensional plasma crystals in a magnetic field

    International Nuclear Information System (INIS)

    Uchida, G.; Konopka, U.; Morfill, G.

    2004-01-01

    The wave dispersion relation in a two-dimensional strongly coupled plasma crystal is studied by theoretical analysis and molecular dynamics simulation taking into account a constant magnetic field parallel to the crystal normal. The expression for the wave dispersion relation clearly shows that high-frequency and low-frequency branches exist as a result of the coupling of longitudinal and transverse modes due to the Lorenz force acting on the dust particles. The high-frequency and the low-frequency branches are found to belong to right-hand and left-hand polarized waves, respectively

  11. Two-dimensional nuclear magnetic resonance spectroscopy

    International Nuclear Information System (INIS)

    Bax, A.; Lerner, L.

    1986-01-01

    Great spectral simplification can be obtained by spreading the conventional one-dimensional nuclear magnetic resonance (NMR) spectrum in two independent frequency dimensions. This so-called two-dimensional NMR spectroscopy removes spectral overlap, facilitates spectral assignment, and provides a wealth of additional information. For example, conformational information related to interproton distances is available from resonance intensities in certain types of two-dimensional experiments. Another method generates 1 H NMR spectra of a preselected fragment of the molecule, suppressing resonances from other regions and greatly simplifying spectral appearance. Two-dimensional NMR spectroscopy can also be applied to the study of 13 C and 15 N, not only providing valuable connectivity information but also improving sensitivity of 13 C and 15 N detection by up to two orders of magnitude. 45 references, 10 figures

  12. Computational Performance of a Parallelized Three-Dimensional High-Order Spectral Element Toolbox

    Science.gov (United States)

    Bosshard, Christoph; Bouffanais, Roland; Clémençon, Christian; Deville, Michel O.; Fiétier, Nicolas; Gruber, Ralf; Kehtari, Sohrab; Keller, Vincent; Latt, Jonas

    In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance evaluation of several aspects with a particular emphasis on the parallel efficiency. The performance evaluation is analyzed with help of a time prediction model based on a parameterization of the application and the hardware resources. A tailor-made CFD computation benchmark case is introduced and used to carry out this review, stressing the particular interest for clusters with up to 8192 cores. Some problems in the parallel implementation have been detected and corrected. The theoretical complexities with respect to the number of elements, to the polynomial degree, and to communication needs are correctly reproduced. It is concluded that this type of code has a nearly perfect speed up on machines with thousands of cores, and is ready to make the step to next-generation petaflop machines.

  13. Streaming Parallel GPU Acceleration of Large-Scale filter-based Spiking Neural Networks

    NARCIS (Netherlands)

    L.P. Slazynski (Leszek); S.M. Bohte (Sander)

    2012-01-01

    htmlabstractThe arrival of graphics processing (GPU) cards suitable for massively parallel computing promises a↵ordable large-scale neural network simulation previously only available at supercomputing facil- ities. While the raw numbers suggest that GPUs may outperform CPUs by at least an order of

  14. On some classes of two-dimensional local models in discrete two-dimensional monatomic FPU lattice with cubic and quartic potential

    International Nuclear Information System (INIS)

    Quan, Xu; Qiang, Tian

    2009-01-01

    This paper discusses the two-dimensional discrete monatomic Fermi–Pasta–Ulam lattice, by using the method of multiple-scale and the quasi-discreteness approach. By taking into account the interaction between the atoms in the lattice and their nearest neighbours, it obtains some classes of two-dimensional local models as follows: two-dimensional bright and dark discrete soliton trains, two-dimensional bright and dark line discrete breathers, and two-dimensional bright and dark discrete breather. (condensed matter: structure, thermal and mechanical properties)

  15. Two-dimensional models

    International Nuclear Information System (INIS)

    Schroer, Bert; Freie Universitaet, Berlin

    2005-02-01

    It is not possible to compactly review the overwhelming literature on two-dimensional models in a meaningful way without a specific viewpoint; I have therefore tacitly added to the above title the words 'as theoretical laboratories for general quantum field theory'. I dedicate this contribution to the memory of J. A. Swieca with whom I have shared the passion of exploring 2-dimensional models for almost one decade. A shortened version of this article is intended as a contribution to the project 'Encyclopedia of mathematical physics' and comments, suggestions and critical remarks are welcome. (author)

  16. Global Anomaly Detection in Two-Dimensional Symmetry-Protected Topological Phases

    Science.gov (United States)

    Bultinck, Nick; Vanhove, Robijn; Haegeman, Jutho; Verstraete, Frank

    2018-04-01

    Edge theories of symmetry-protected topological phases are well known to possess global symmetry anomalies. In this Letter we focus on two-dimensional bosonic phases protected by an on-site symmetry and analyze the corresponding edge anomalies in more detail. Physical interpretations of the anomaly in terms of an obstruction to orbifolding and constructing symmetry-preserving boundaries are connected to the cohomology classification of symmetry-protected phases in two dimensions. Using the tensor network and matrix product state formalism we numerically illustrate our arguments and discuss computational detection schemes to identify symmetry-protected order in a ground state wave function.

  17. Two-dimensional multifractal cross-correlation analysis

    International Nuclear Information System (INIS)

    Xi, Caiping; Zhang, Shuning; Xiong, Gang; Zhao, Huichang; Yang, Yonghong

    2017-01-01

    Highlights: • We study the mathematical models of 2D-MFXPF, 2D-MFXDFA and 2D-MFXDMA. • Present the definition of the two-dimensional N 2 -partitioned multiplicative cascading process. • Do the comparative analysis of 2D-MC by 2D-MFXPF, 2D-MFXDFA and 2D-MFXDMA. • Provide a reference on the choice and parameter settings of these methods in practice. - Abstract: There are a number of situations in which several signals are simultaneously recorded in complex systems, which exhibit long-term power-law cross-correlations. This paper presents two-dimensional multifractal cross-correlation analysis based on the partition function (2D-MFXPF), two-dimensional multifractal cross-correlation analysis based on the detrended fluctuation analysis (2D-MFXDFA) and two-dimensional multifractal cross-correlation analysis based on the detrended moving average analysis (2D-MFXDMA). We apply these methods to pairs of two-dimensional multiplicative cascades (2D-MC) to do a comparative study. Then, we apply the two-dimensional multifractal cross-correlation analysis based on the detrended fluctuation analysis (2D-MFXDFA) to real images and unveil intriguing multifractality in the cross correlations of the material structures. At last, we give the main conclusions and provide a valuable reference on how to choose the multifractal algorithms in the potential applications in the field of SAR image classification and detection.

  18. Drainage network extraction from a high-resolution DEM using parallel programming in the .NET Framework

    Science.gov (United States)

    Du, Chao; Ye, Aizhong; Gan, Yanjun; You, Jinjun; Duan, Qinyun; Ma, Feng; Hou, Jingwen

    2017-12-01

    High-resolution Digital Elevation Models (DEMs) can be used to extract high-accuracy prerequisite drainage networks. A higher resolution represents a larger number of grids. With an increase in the number of grids, the flow direction determination will require substantial computer resources and computing time. Parallel computing is a feasible method with which to resolve this problem. In this paper, we proposed a parallel programming method within the .NET Framework with a C# Compiler in a Windows environment. The basin is divided into sub-basins, and subsequently the different sub-basins operate on multiple threads concurrently to calculate flow directions. The method was applied to calculate the flow direction of the Yellow River basin from 3 arc-second resolution SRTM DEM. Drainage networks were extracted and compared with HydroSHEDS river network to assess their accuracy. The results demonstrate that this method can calculate the flow direction from high-resolution DEMs efficiently and extract high-precision continuous drainage networks.

  19. Two-Dimensional Impact Reconstruction Method for Rail Defect Inspection

    Directory of Open Access Journals (Sweden)

    Jie Zhao

    2014-01-01

    Full Text Available The safety of train operating is seriously menaced by the rail defects, so it is of great significance to inspect rail defects dynamically while the train is operating. This paper presents a two-dimensional impact reconstruction method to realize the on-line inspection of rail defects. The proposed method utilizes preprocessing technology to convert time domain vertical vibration signals acquired by wireless sensor network to space signals. The modern time-frequency analysis method is improved to reconstruct the obtained multisensor information. Then, the image fusion processing technology based on spectrum threshold processing and node color labeling is proposed to reduce the noise, and blank the periodic impact signal caused by rail joints and locomotive running gear. This method can convert the aperiodic impact signals caused by rail defects to partial periodic impact signals, and locate the rail defects. An application indicates that the two-dimensional impact reconstruction method could display the impact caused by rail defects obviously, and is an effective on-line rail defects inspection method.

  20. A two-dimensional mathematical model of percutaneous drug absorption

    Directory of Open Access Journals (Sweden)

    Kubota K

    2004-06-01

    Full Text Available Abstract Background When a drug is applied on the skin surface, the concentration of the drug accumulated in the skin and the amount of the drug eliminated into the blood vessel depend on the value of a parameter, r. The values of r depend on the amount of diffusion and the normalized skin-capillary clearence. It is defined as the ratio of the steady-state drug concentration at the skin-capillary boundary to that at the skin-surface in one-dimensional models. The present paper studies the effect of the parameter values, when the region of contact of the skin with the drug, is a line segment on the skin surface. Methods Though a simple one-dimensional model is often useful to describe percutaneous drug absorption, it may be better represented by multi-dimensional models. A two-dimensional mathematical model is developed for percutaneous absorption of a drug, which may be used when the diffusion of the drug in the direction parallel to the skin surface must be examined, as well as in the direction into the skin, examined in one-dimensional models. This model consists of a linear second-order parabolic equation with appropriate initial conditions and boundary conditions. These boundary conditions are of Dirichlet type, Neumann type or Robin type. A finite-difference method which maintains second-order accuracy in space along the boundary, is developed to solve the parabolic equation. Extrapolation in time is applied to improve the accuracy in time. Solution of the parabolic equation gives the concentration of the drug in the skin at a given time. Results Simulation of the numerical methods described is carried out with various values of the parameter r. The illustrations are given in the form of figures. Conclusion Based on the values of r, conclusions are drawn about (1 the flow rate of the drug, (2 the flux and the cumulative amount of drug eliminated into the receptor cell, (3 the steady-state value of the flux, (4 the time to reach the steady

  1. Two-dimensional beam profiles and one-dimensional projections

    Science.gov (United States)

    Findlay, D. J. S.; Jones, B.; Adams, D. J.

    2018-05-01

    One-dimensional projections of improved two-dimensional representations of transverse profiles of particle beams are proposed for fitting to data from harp-type monitors measuring beam profiles on particle accelerators. Composite distributions, with tails smoothly matched on to a central (inverted) parabola, are shown to give noticeably better fits than single gaussian and single parabolic distributions to data from harp-type beam profile monitors all along the proton beam transport lines to the two target stations on the ISIS Spallation Neutron Source. Some implications for inferring beam current densities on the beam axis are noted.

  2. Linkage mechanisms in the vertebrate skull: Structure and function of three-dimensional, parallel transmission systems.

    Science.gov (United States)

    Olsen, Aaron M; Westneat, Mark W

    2016-12-01

    Many musculoskeletal systems, including the skulls of birds, fishes, and some lizards consist of interconnected chains of mobile skeletal elements, analogous to linkage mechanisms used in engineering. Biomechanical studies have applied linkage models to a diversity of musculoskeletal systems, with previous applications primarily focusing on two-dimensional linkage geometries, bilaterally symmetrical pairs of planar linkages, or single four-bar linkages. Here, we present new, three-dimensional (3D), parallel linkage models of the skulls of birds and fishes and use these models (available as free kinematic simulation software), to investigate structure-function relationships in these systems. This new computational framework provides an accessible and integrated workflow for exploring the evolution of structure and function in complex musculoskeletal systems. Linkage simulations show that kinematic transmission, although a suitable functional metric for linkages with single rotating input and output links, can give misleading results when applied to linkages with substantial translational components or multiple output links. To take into account both linear and rotational displacement we define force mechanical advantage for a linkage (analogous to lever mechanical advantage) and apply this metric to measure transmission efficiency in the bird cranial mechanism. For linkages with multiple, expanding output points we propose a new functional metric, expansion advantage, to measure expansion amplification and apply this metric to the buccal expansion mechanism in fishes. Using the bird cranial linkage model, we quantify the inaccuracies that result from simplifying a 3D geometry into two dimensions. We also show that by combining single-chain linkages into parallel linkages, more links can be simulated while decreasing or maintaining the same number of input parameters. This generalized framework for linkage simulation and analysis can accommodate linkages of differing

  3. Generalized network modeling of capillary-dominated two-phase flow.

    Science.gov (United States)

    Raeini, Ali Q; Bijeljic, Branko; Blunt, Martin J

    2018-02-01

    We present a generalized network model for simulating capillary-dominated two-phase flow through porous media at the pore scale. Three-dimensional images of the pore space are discretized using a generalized network-described in a companion paper [A. Q. Raeini, B. Bijeljic, and M. J. Blunt, Phys. Rev. E 96, 013312 (2017)2470-004510.1103/PhysRevE.96.013312]-which comprises pores that are divided into smaller elements called half-throats and subsequently into corners. Half-throats define the connectivity of the network at the coarsest level, connecting each pore to half-throats of its neighboring pores from their narrower ends, while corners define the connectivity of pore crevices. The corners are discretized at different levels for accurate calculation of entry pressures, fluid volumes, and flow conductivities that are obtained using direct simulation of flow on the underlying image. This paper discusses the two-phase flow model that is used to compute the averaged flow properties of the generalized network, including relative permeability and capillary pressure. We validate the model using direct finite-volume two-phase flow simulations on synthetic geometries, and then present a comparison of the model predictions with a conventional pore-network model and experimental measurements of relative permeability in the literature.

  4. Orientation selective neural network for cosmic muon identification

    International Nuclear Information System (INIS)

    Abramowicz, H.; Tel Aviv Univ.; Horn, D.; Naftaly, U.; Sahar-Pikielny, C.

    1997-01-01

    We discuss a novel method for identification of a linear pattern of pixels on a two-dimensional grid. Motivated by principles employed by the visual cortex, we construct orientation selective neurons in a neural network that performs this task. The method is then applied to a sample of data collected with the ZEUS detector at HERA in order to identify cosmic muons that leave a linear pattern of signals in the segmented uranium-scintillator calorimeter. A two dimensional representation of the relevant part of the detector is used. The algorithm performs well in the presence of noise and pixels with limited efficiency. Given its architecture, this system becomes a good candidate for fast pattern recognition in parallel processing devices. (orig.)

  5. The electronic structure of quasi-one-dimensional disordered systems with parallel multi-chains

    International Nuclear Information System (INIS)

    Liu Xiaoliang; Xu Hui; Deng Chaosheng; Ma Songshan

    2006-01-01

    For the quasi-one-dimensional disordered systems with parallel multi-chains, taking a special method to code the sites and just considering the nearest-neighbor hopping integral, we write the systems' Hamiltonians as precisely symmetric matrixes, which can be transformed into three diagonally symmetric matrixes by using the Householder transformation. The densities of states, the localization lengths and the conductance of the systems are calculated numerically using the minus eigenvalue theory and the transfer matrix method. From the results of quasi-one-dimensional disordered systems with varied chains, we find, the energy band of the systems extends slightly, the energy gaps are observed and the distribution of the density of states changes obviously with the increase of the dimensionality. Especially, for the systems with four, five or six chains, at the energy band center, there exist extended states whose localization lengths are greater than the size of the systems, accordingly, there having great conductance. With the increasing of the number of the chains, the correlated ranges expand and the systems present the similar behavior to that with off-diagonal long-range correlation

  6. FPGA Implementation of one-dimensional and two-dimensional cellular automata

    International Nuclear Information System (INIS)

    D'Antone, I.

    1999-01-01

    This report describes the hardware implementation of one-dimensional and two-dimensional cellular automata (CAs). After a general introduction to the cellular automata, we consider a one-dimensional CA used to implement pseudo-random techniques in built-in self test for VLSI. Due to the increase in digital ASIC complexity, testing is becoming one of the major costs in the VLSI production. The high electronics complexity, used in particle physics experiments, demands higher reliability than in the past time. General criterions are given to evaluate the feasibility of the circuit used for testing and some quantitative parameters are underlined to optimize the architecture of the cellular automaton. Furthermore, we propose a two-dimensional CA that performs a peak finding algorithm in a matrix of cells mapping a sub-region of a calorimeter. As in a two-dimensional filtering process, the peaks of the energy clusters are found in one evolution step. This CA belongs to Wolfram class II cellular automata. Some quantitative parameters are given to optimize the architecture of the cellular automaton implemented in a commercial field programmable gate array (FPGA)

  7. Microelectromechanical filter formed from parallel-connected lattice networks of contour-mode resonators

    Science.gov (United States)

    Wojciechowski, Kenneth E; Olsson, III, Roy H; Ziaei-Moayyed, Maryam

    2013-07-30

    A microelectromechanical (MEM) filter is disclosed which has a plurality of lattice networks formed on a substrate and electrically connected together in parallel. Each lattice network has a series resonant frequency and a shunt resonant frequency provided by one or more contour-mode resonators in the lattice network. Different types of contour-mode resonators including single input, single output resonators, differential resonators, balun resonators, and ring resonators can be used in MEM filter. The MEM filter can have a center frequency in the range of 10 MHz-10 GHz, with a filter bandwidth of up to about 1% when all of the lattice networks have the same series resonant frequency and the same shunt resonant frequency. The filter bandwidth can be increased up to about 5% by using unique series and shunt resonant frequencies for the lattice networks.

  8. Lie algebra contractions on two-dimensional hyperboloid

    International Nuclear Information System (INIS)

    Pogosyan, G. S.; Yakhno, A.

    2010-01-01

    The Inoenue-Wigner contraction from the SO(2, 1) group to the Euclidean E(2) and E(1, 1) group is used to relate the separation of variables in Laplace-Beltrami (Helmholtz) equations for the four corresponding two-dimensional homogeneous spaces: two-dimensional hyperboloids and two-dimensional Euclidean and pseudo-Euclidean spaces. We show how the nine systems of coordinates on the two-dimensional hyperboloids contracted to the four systems of coordinates on E 2 and eight on E 1,1 . The text was submitted by the authors in English.

  9. Quasi-two-dimensional holography

    International Nuclear Information System (INIS)

    Kutzner, J.; Erhard, A.; Wuestenberg, H.; Zimpfer, J.

    1980-01-01

    The acoustical holography with numerical reconstruction by area scanning is memory- and time-intensive. With the experiences by the linear holography we tried to derive a scanning for the evaluating of the two-dimensional flaw-sizes. In most practical cases it is sufficient to determine the exact depth extension of a flaw, whereas the accuracy of the length extension is less critical. For this reason the applicability of the so-called quasi-two-dimensional holography is appropriate. The used sound field given by special probes is divergent in the inclined plane and light focussed in the perpendicular plane using cylindrical lenses. (orig.) [de

  10. Mechanisms of seizure propagation in 2-dimensional centre-surround recurrent networks.

    Directory of Open Access Journals (Sweden)

    David Hall

    Full Text Available Understanding how seizures spread throughout the brain is an important problem in the treatment of epilepsy, especially for implantable devices that aim to avert focal seizures before they spread to, and overwhelm, the rest of the brain. This paper presents an analysis of the speed of propagation in a computational model of seizure-like activity in a 2-dimensional recurrent network of integrate-and-fire neurons containing both excitatory and inhibitory populations and having a difference of Gaussians connectivity structure, an approximation to that observed in cerebral cortex. In the same computational model network, alternative mechanisms are explored in order to simulate the range of seizure-like activity propagation speeds (0.1-100 mm/s observed in two animal-slice-based models of epilepsy: (1 low extracellular [Formula: see text], which creates excess excitation and (2 introduction of gamma-aminobutyric acid (GABA antagonists, which reduce inhibition. Moreover, two alternative connection topologies are considered: excitation broader than inhibition, and inhibition broader than excitation. It was found that the empirically observed range of propagation velocities can be obtained for both connection topologies. For the case of the GABA antagonist model simulation, consistent with other studies, it was found that there is an effective threshold in the degree of inhibition below which waves begin to propagate. For the case of the low extracellular [Formula: see text] model simulation, it was found that activity-dependent reductions in inhibition provide a potential explanation for the emergence of slowly propagating waves. This was simulated as a depression of inhibitory synapses, but it may also be achieved by other mechanisms. This work provides a localised network understanding of the propagation of seizures in 2-dimensional centre-surround networks that can be tested empirically.

  11. Topology optimization of two-dimensional waveguides

    DEFF Research Database (Denmark)

    Jensen, Jakob Søndergaard; Sigmund, Ole

    2003-01-01

    In this work we use the method of topology optimization to design two-dimensional waveguides with low transmission loss.......In this work we use the method of topology optimization to design two-dimensional waveguides with low transmission loss....

  12. Traditional Semiconductors in the Two-Dimensional Limit.

    Science.gov (United States)

    Lucking, Michael C; Xie, Weiyu; Choe, Duk-Hyun; West, Damien; Lu, Toh-Ming; Zhang, S B

    2018-02-23

    Interest in two-dimensional materials has exploded in recent years. Not only are they studied due to their novel electronic properties, such as the emergent Dirac fermion in graphene, but also as a new paradigm in which stacking layers of distinct two-dimensional materials may enable different functionality or devices. Here, through first-principles theory, we reveal a large new class of two-dimensional materials which are derived from traditional III-V, II-VI, and I-VII semiconductors. It is found that in the ultrathin limit the great majority of traditional binary semiconductors studied (a series of 28 semiconductors) are not only kinetically stable in a two-dimensional double layer honeycomb structure, but more energetically stable than the truncated wurtzite or zinc-blende structures associated with three dimensional bulk. These findings both greatly increase the landscape of two-dimensional materials and also demonstrate that in the double layer honeycomb form, even ordinary semiconductors, such as GaAs, can exhibit exotic topological properties.

  13. Sufficient Controllability Condition for Affine Systems with Two-Dimensional Control and Two-Dimensional Zero Dynamics

    Directory of Open Access Journals (Sweden)

    D. A. Fetisov

    2015-01-01

    Full Text Available The controllability conditions are well known if we speak about linear stationary systems: a linear stationary system is controllable if and only if the dimension of the state vector is equal to the rank of the controllability matrix. The concept of the controllability matrix is extended to affine systems, but relations between affine systems controllability and properties of this matrix are more complicated. Various controllability conditions are set for affine systems, but they deal as usual either with systems of some special form or with controllability in some small neighborhood of the concerned point. An affine system is known to be controllable if the system is equivalent to a system of a canonical form, which is defined and regular in the whole space of states. In this case, the system is said to be feedback linearizable in the space of states. However there are examples, which illustrate that a system can be controllable even if it is not feedback linearizable in any open subset in the space of states. In this article we deal with such systems.Affine systems with two-dimensional control are considered. The system in question is assumed to be equivalent to a system of a quasicanonical form with two-dimensional zero dynamics which is defined and regular in the whole space of states. Therefore the controllability of the original system is equivalent to the controllability of the received system of a quasicanonical form. In this article the sufficient condition for an available solution of the terminal problem is proven for systems of a quasicanonical form with two-dimensional control and two-dimensional zero dynamics. The condition is valid in the case of an arbitrary time interval and arbitrary initial and finite states of the system. Therefore the controllability condition is set for systems of a quasicanonical form with two-dimensional control and two-dimensional zero dynamics. An example is given which illustrates how the proved

  14. A Recurrent Probabilistic Neural Network with Dimensionality Reduction Based on Time-series Discriminant Component Analysis.

    Science.gov (United States)

    Hayashi, Hideaki; Shibanoki, Taro; Shima, Keisuke; Kurita, Yuichi; Tsuji, Toshio

    2015-12-01

    This paper proposes a probabilistic neural network (NN) developed on the basis of time-series discriminant component analysis (TSDCA) that can be used to classify high-dimensional time-series patterns. TSDCA involves the compression of high-dimensional time series into a lower dimensional space using a set of orthogonal transformations and the calculation of posterior probabilities based on a continuous-density hidden Markov model with a Gaussian mixture model expressed in the reduced-dimensional space. The analysis can be incorporated into an NN, which is named a time-series discriminant component network (TSDCN), so that parameters of dimensionality reduction and classification can be obtained simultaneously as network coefficients according to a backpropagation through time-based learning algorithm with the Lagrange multiplier method. The TSDCN is considered to enable high-accuracy classification of high-dimensional time-series patterns and to reduce the computation time taken for network training. The validity of the TSDCN is demonstrated for high-dimensional artificial data and electroencephalogram signals in the experiments conducted during the study.

  15. A one-dimensional heat transfer model for parallel-plate thermoacoustic heat exchangers.

    Science.gov (United States)

    de Jong, J A; Wijnant, Y H; de Boer, A

    2014-03-01

    A one-dimensional (1D) laminar oscillating flow heat transfer model is derived and applied to parallel-plate thermoacoustic heat exchangers. The model can be used to estimate the heat transfer from the solid wall to the acoustic medium, which is required for the heat input/output of thermoacoustic systems. The model is implementable in existing (quasi-)1D thermoacoustic codes, such as DeltaEC. Examples of generated results show good agreement with literature results. The model allows for arbitrary wave phasing; however, it is shown that the wave phasing does not significantly influence the heat transfer.

  16. Efficient implementation of multidimensional fast fourier transform on a distributed-memory parallel multi-node computer

    Science.gov (United States)

    Bhanot, Gyan V [Princeton, NJ; Chen, Dong [Croton-On-Hudson, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Steinmacher-Burow, Burkhard D [Mount Kisco, NY; Vranas, Pavlos M [Bedford Hills, NY

    2012-01-10

    The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.

  17. Shape-persistent two-component 2D networks with atomic-size tunability.

    Science.gov (United States)

    Liu, Jia; Zhang, Xu; Wang, Dong; Wang, Jie-Yu; Pei, Jian; Stang, Peter J; Wan, Li-Jun

    2011-09-05

    Over the past few years, two-dimensional (2D) nanoporous networks have attracted great interest as templates for the precise localization and confinement of guest building blocks, such as functional molecules or clusters on the solid surfaces. Herein, a series of two-component molecular networks with a 3-fold symmetry are constructed on graphite using a truxenone derivative and trimesic acid homologues with carboxylic-acid-terminated alkyl chains. The hydrogen-bonding partner-recognition-induced 2D crystallization of alkyl chains makes the flexible alkyl chains act as rigid spacers in the networks to continuously tune the pore size with an accuracy of one carbon atom per step. The two-component networks were found to accommodate and regulate the distribution and aggregation of guest molecules, such as COR and CuPc. This procedure provides a new pathway for the design and fabrication of molecular nanostructures on solid surfaces. Copyright © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  18. Simulation Exploration through Immersive Parallel Planes

    Energy Technology Data Exchange (ETDEWEB)

    Brunhart-Lupo, Nicholas J [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Bush, Brian W [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Gruchalla, Kenny M [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Smith, Steve [Los Alamos Visualization Associates

    2017-05-25

    We present a visualization-driven simulation system that tightly couples systems dynamics simulations with an immersive virtual environment to allow analysts to rapidly develop and test hypotheses in a high-dimensional parameter space. To accomplish this, we generalize the two-dimensional parallel-coordinates statistical graphic as an immersive 'parallel-planes' visualization for multivariate time series emitted by simulations running in parallel with the visualization. In contrast to traditional parallel coordinate's mapping the multivariate dimensions onto coordinate axes represented by a series of parallel lines, we map pairs of the multivariate dimensions onto a series of parallel rectangles. As in the case of parallel coordinates, each individual observation in the dataset is mapped to a polyline whose vertices coincide with its coordinate values. Regions of the rectangles can be 'brushed' to highlight and select observations of interest: a 'slider' control allows the user to filter the observations by their time coordinate. In an immersive virtual environment, users interact with the parallel planes using a joystick that can select regions on the planes, manipulate selection, and filter time. The brushing and selection actions are used to both explore existing data as well as to launch additional simulations corresponding to the visually selected portions of the input parameter space. As soon as the new simulations complete, their resulting observations are displayed in the virtual environment. This tight feedback loop between simulation and immersive analytics accelerates users' realization of insights about the simulation and its output.

  19. Two-dimensional flexible nanoelectronics

    Science.gov (United States)

    Akinwande, Deji; Petrone, Nicholas; Hone, James

    2014-12-01

    2014/2015 represents the tenth anniversary of modern graphene research. Over this decade, graphene has proven to be attractive for thin-film transistors owing to its remarkable electronic, optical, mechanical and thermal properties. Even its major drawback--zero bandgap--has resulted in something positive: a resurgence of interest in two-dimensional semiconductors, such as dichalcogenides and buckled nanomaterials with sizeable bandgaps. With the discovery of hexagonal boron nitride as an ideal dielectric, the materials are now in place to advance integrated flexible nanoelectronics, which uniquely take advantage of the unmatched portfolio of properties of two-dimensional crystals, beyond the capability of conventional thin films for ubiquitous flexible systems.

  20. Self-assembled three dimensional network designs for soft electronics.

    Science.gov (United States)

    Jang, Kyung-In; Li, Kan; Chung, Ha Uk; Xu, Sheng; Jung, Han Na; Yang, Yiyuan; Kwak, Jean Won; Jung, Han Hee; Song, Juwon; Yang, Ce; Wang, Ao; Liu, Zhuangjian; Lee, Jong Yoon; Kim, Bong Hoon; Kim, Jae-Hwan; Lee, Jungyup; Yu, Yongjoon; Kim, Bum Jun; Jang, Hokyung; Yu, Ki Jun; Kim, Jeonghyun; Lee, Jung Woo; Jeong, Jae-Woong; Song, Young Min; Huang, Yonggang; Zhang, Yihui; Rogers, John A

    2017-06-21

    Low modulus, compliant systems of sensors, circuits and radios designed to intimately interface with the soft tissues of the human body are of growing interest, due to their emerging applications in continuous, clinical-quality health monitors and advanced, bioelectronic therapeutics. Although recent research establishes various materials and mechanics concepts for such technologies, all existing approaches involve simple, two-dimensional (2D) layouts in the constituent micro-components and interconnects. Here we introduce concepts in three-dimensional (3D) architectures that bypass important engineering constraints and performance limitations set by traditional, 2D designs. Specifically, open-mesh, 3D interconnect networks of helical microcoils formed by deterministic compressive buckling establish the basis for systems that can offer exceptional low modulus, elastic mechanics, in compact geometries, with active components and sophisticated levels of functionality. Coupled mechanical and electrical design approaches enable layout optimization, assembly processes and encapsulation schemes to yield 3D configurations that satisfy requirements in demanding, complex systems, such as wireless, skin-compatible electronic sensors.

  1. Self-assembled three dimensional network designs for soft electronics

    Science.gov (United States)

    Jang, Kyung-In; Li, Kan; Chung, Ha Uk; Xu, Sheng; Jung, Han Na; Yang, Yiyuan; Kwak, Jean Won; Jung, Han Hee; Song, Juwon; Yang, Ce; Wang, Ao; Liu, Zhuangjian; Lee, Jong Yoon; Kim, Bong Hoon; Kim, Jae-Hwan; Lee, Jungyup; Yu, Yongjoon; Kim, Bum Jun; Jang, Hokyung; Yu, Ki Jun; Kim, Jeonghyun; Lee, Jung Woo; Jeong, Jae-Woong; Song, Young Min; Huang, Yonggang; Zhang, Yihui; Rogers, John A.

    2017-06-01

    Low modulus, compliant systems of sensors, circuits and radios designed to intimately interface with the soft tissues of the human body are of growing interest, due to their emerging applications in continuous, clinical-quality health monitors and advanced, bioelectronic therapeutics. Although recent research establishes various materials and mechanics concepts for such technologies, all existing approaches involve simple, two-dimensional (2D) layouts in the constituent micro-components and interconnects. Here we introduce concepts in three-dimensional (3D) architectures that bypass important engineering constraints and performance limitations set by traditional, 2D designs. Specifically, open-mesh, 3D interconnect networks of helical microcoils formed by deterministic compressive buckling establish the basis for systems that can offer exceptional low modulus, elastic mechanics, in compact geometries, with active components and sophisticated levels of functionality. Coupled mechanical and electrical design approaches enable layout optimization, assembly processes and encapsulation schemes to yield 3D configurations that satisfy requirements in demanding, complex systems, such as wireless, skin-compatible electronic sensors.

  2. Parallel transport of long mean-free-path plasma along open magnetic field lines: Parallel heat flux

    International Nuclear Information System (INIS)

    Guo Zehua; Tang Xianzhu

    2012-01-01

    In a long mean-free-path plasma where temperature anisotropy can be sustained, the parallel heat flux has two components with one associated with the parallel thermal energy and the other the perpendicular thermal energy. Due to the large deviation of the distribution function from local Maxwellian in an open field line plasma with low collisionality, the conventional perturbative calculation of the parallel heat flux closure in its local or non-local form is no longer applicable. Here, a non-perturbative calculation is presented for a collisionless plasma in a two-dimensional flux expander bounded by absorbing walls. Specifically, closures of previously unfamiliar form are obtained for ions and electrons, which relate two distinct components of the species parallel heat flux to the lower order fluid moments such as density, parallel flow, parallel and perpendicular temperatures, and the field quantities such as the magnetic field strength and the electrostatic potential. The plasma source and boundary condition at the absorbing wall enter explicitly in the closure calculation. Although the closure calculation does not take into account wave-particle interactions, the results based on passing orbits from steady-state collisionless drift-kinetic equation show remarkable agreement with fully kinetic-Maxwell simulations. As an example of the physical implications of the theory, the parallel heat flux closures are found to predict a surprising observation in the kinetic-Maxwell simulation of the 2D magnetic flux expander problem, where the parallel heat flux of the parallel thermal energy flows from low to high parallel temperature region.

  3. High temporal resolution magnetic resonance imaging: development of a parallel three dimensional acquisition method for functional neuroimaging

    International Nuclear Information System (INIS)

    Rabrait, C.

    2007-11-01

    Echo Planar Imaging is widely used to perform data acquisition in functional neuroimaging. This sequence allows the acquisition of a set of about 30 slices, covering the whole brain, at a spatial resolution ranging from 2 to 4 mm, and a temporal resolution ranging from 1 to 2 s. It is thus well adapted to the mapping of activated brain areas but does not allow precise study of the brain dynamics. Moreover, temporal interpolation is needed in order to correct for inter-slices delays and 2-dimensional acquisition is subject to vascular in flow artifacts. To improve the estimation of the hemodynamic response functions associated with activation, this thesis aimed at developing a 3-dimensional high temporal resolution acquisition method. To do so, Echo Volume Imaging was combined with reduced field-of-view acquisition and parallel imaging. Indeed, E.V.I. allows the acquisition of a whole volume in Fourier space following a single excitation, but it requires very long echo trains. Parallel imaging and field-of-view reduction are used to reduce the echo train durations by a factor of 4, which allows the acquisition of a 3-dimensional brain volume with limited susceptibility-induced distortions and signal losses, in 200 ms. All imaging parameters have been optimized in order to reduce echo train durations and to maximize S.N.R., so that cerebral activation can be detected with a high level of confidence. Robust detection of brain activation was demonstrated with both visual and auditory paradigms. High temporal resolution hemodynamic response functions could be estimated through selective averaging of the response to the different trials of the stimulation. To further improve S.N.R., the matrix inversions required in parallel reconstruction were regularized, and the impact of the level of regularization on activation detection was investigated. Eventually, potential applications of parallel E.V.I. such as the study of non-stationary effects in the B.O.L.D. response

  4. Two-dimensional small-world networks: Navigation with local information

    International Nuclear Information System (INIS)

    Chen Jianzhen; Liu Wei; Zhu Jianyang

    2006-01-01

    A navigation process is studied on a variant of the Watts-Strogatz small-world network model embedded on a square lattice. With probability p, each vertex sends out a long-range link, and the probability of the other end of this link falling on a vertex at lattice distance r away decays as r -α . Vertices on the network have knowledge of only their nearest neighbors. In a navigation process, messages are forwarded to a designated target. For α 1, a dynamic small world effect is observed, and the behavior of the scaling function at large enough pL is obtained. At α=2 and 3, this kind of scaling breaks down, and different functions of the average actual path length are obtained. For α>3, the average actual path length is nearly linear with network size

  5. Stabilizing and Organizing Bi3 Cu4 and Bi7 Cu12 Nanoclusters in Two-Dimensional Metal-Organic Networks.

    Science.gov (United States)

    Yan, Linghao; Xia, Bowen; Zhang, Qiushi; Kuang, Guowen; Xu, Hu; Liu, Jun; Liu, Pei Nian; Lin, Nian

    2018-04-16

    Multinuclear heterometallic nanoclusters with controllable stoichiometry and structure are anticipated to possess promising catalytic, magnetic, and optical properties. Heterometallic nanoclusters with precise stoichiometry of Bi 3 Cu 4 and Bi 7 Cu 12 can be stabilized in the scaffold of two-dimensional metal-organic networks on a Cu(111) surface through on-surface metallosupramolecular self-assembly processes. The atomic structures of the nanoclusters were resolved using scanning tunneling microscopy and density functional theory calculations. The nanoclusters feature highly symmetric planar hexagonal shapes and core-shell charge modulation. The clusters are arranged as triangular lattices with a periodicity that can be tuned by choosing molecules of different size. This work shows that on-surface metallosupramolecular self-assembly creates unique possibilities for the design and synthesis of multinuclear heterometallic nanoclusters. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

  6. An Implementation of Parallel and Networked Computing Schemes for the Real-Time Image Reconstruction Based on Electrical Tomography

    International Nuclear Information System (INIS)

    Park, Sook Hee

    2001-02-01

    boost the reliability and high computation speed of basic primitive matrix operations. The DLL(Dynamic Link Library) is a good candidate for a Matlab programmer to conveniently call the new library, since the original Matlab code does not need to be changed. The DLL library receives Matlab array represented as mxArray, and converts it into the appropriate C language structure after partitioning the array for the parallel operation. Then the DLL calls Matlab's efficient C language library, which is enabled by creating the definition files as well as including the Matlab library into the Visual C 6.0 project file. Finally, the partial results are merged at the shared memory, so the DLL integrates them to pass the final result to the caller residing in Matlab code. In this procedure, the elimination of the complex Matlab interpreting step, in addition to the parallel programming. According to the implementation described as above, matrix multiplication, inverse, pseudo inverse, and Jacobian are implemented. The first two DLLs speed up the computation by the effect of pure parallel processing. Pseudo inverse can enhance the performance based on the previous parallel procedures if and only if the given matrix is full-rank one, as data dependancy hinders the parallel computing otherwise. The enhancement of Jacobian code owes to eliminating the unnecessary code rather than parallel processing, as the operation contains so much overhead. Also implemented are the network version libraries. However, the speed is not so good as the original code because there is network speed limitation. With the better network interface, the speed up can be expected. The performance of the implemented parallel libraries has been assessed by directly measuring the execution time comparing with the original Matlab code. And the calculating times of matrix multiplications, inverse, and pseudo inverse have been reduced to 59.4 %, 34.8 % and 52 %, respectively. The execution time of Jacobian is

  7. A class of parallel algorithms for computation of the manipulator inertia matrix

    Science.gov (United States)

    Fijany, Amir; Bejczy, Antal K.

    1989-01-01

    Parallel and parallel/pipeline algorithms for computation of the manipulator inertia matrix are presented. An algorithm based on composite rigid-body spatial inertia method, which provides better features for parallelization, is used for the computation of the inertia matrix. Two parallel algorithms are developed which achieve the time lower bound in computation. Also described is the mapping of these algorithms with topological variation on a two-dimensional processor array, with nearest-neighbor connection, and with cardinality variation on a linear processor array. An efficient parallel/pipeline algorithm for the linear array was also developed, but at significantly higher efficiency.

  8. Approximate solutions for the two-dimensional integral transport equation. Solution of complex two-dimensional transport problems

    International Nuclear Information System (INIS)

    Sanchez, Richard.

    1980-11-01

    This work is divided into two parts: the first part deals with the solution of complex two-dimensional transport problems, the second one (note CEA-N-2166) treats the critically mixed methods of resolution. A set of approximate solutions for the isotropic two-dimensional neutron transport problem has been developed using the interface current formalism. The method has been applied to regular lattices of rectangular cells containing a fuel pin, cladding, and water, or homogenized structural material. The cells are divided into zones that are homogeneous. A zone-wise flux expansion is used to formulate a direct collision probability problem within a cell. The coupling of the cells is effected by making extra assumptions on the currents entering and leaving the interfaces. Two codes have been written: CALLIOPE uses a cylindrical cell model and one or three terms for the flux expansion, and NAUSICAA uses a two-dimensional flux representation and does a truly two-dimensional calculation inside each cell. In both codes, one or three terms can be used to make a space-independent expansion of the angular fluxes entering and leaving each side of the cell. The accuracies and computing times achieved with the different approximations are illustrated by numerical studies on two benchmark problems and by calculations performed in the APOLLO multigroup code [fr

  9. Efficient implementation of a multidimensional fast fourier transform on a distributed-memory parallel multi-node computer

    Science.gov (United States)

    Bhanot, Gyan V [Princeton, NJ; Chen, Dong [Croton-On-Hudson, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Steinmacher-Burow, Burkhard D [Mount Kisco, NY; Vranas, Pavlos M [Bedford Hills, NY

    2008-01-01

    The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.

  10. Two-dimensional topological field theories coupled to four-dimensional BF theory

    International Nuclear Information System (INIS)

    Montesinos, Merced; Perez, Alejandro

    2008-01-01

    Four-dimensional BF theory admits a natural coupling to extended sources supported on two-dimensional surfaces or string world sheets. Solutions of the theory are in one to one correspondence with solutions of Einstein equations with distributional matter (cosmic strings). We study new (topological field) theories that can be constructed by adding extra degrees of freedom to the two-dimensional world sheet. We show how two-dimensional Yang-Mills degrees of freedom can be added on the world sheet, producing in this way, an interactive (topological) theory of Yang-Mills fields with BF fields in four dimensions. We also show how a world sheet tetrad can be naturally added. As in the previous case the set of solutions of these theories are contained in the set of solutions of Einstein's equations if one allows distributional matter supported on two-dimensional surfaces. These theories are argued to be exactly quantizable. In the context of quantum gravity, one important motivation to study these models is to explore the possibility of constructing a background-independent quantum field theory where local degrees of freedom at low energies arise from global topological (world sheet) degrees of freedom at the fundamental level

  11. Generalized network modeling of capillary-dominated two-phase flow

    Science.gov (United States)

    Raeini, Ali Q.; Bijeljic, Branko; Blunt, Martin J.

    2018-02-01

    We present a generalized network model for simulating capillary-dominated two-phase flow through porous media at the pore scale. Three-dimensional images of the pore space are discretized using a generalized network—described in a companion paper [A. Q. Raeini, B. Bijeljic, and M. J. Blunt, Phys. Rev. E 96, 013312 (2017), 10.1103/PhysRevE.96.013312]—which comprises pores that are divided into smaller elements called half-throats and subsequently into corners. Half-throats define the connectivity of the network at the coarsest level, connecting each pore to half-throats of its neighboring pores from their narrower ends, while corners define the connectivity of pore crevices. The corners are discretized at different levels for accurate calculation of entry pressures, fluid volumes, and flow conductivities that are obtained using direct simulation of flow on the underlying image. This paper discusses the two-phase flow model that is used to compute the averaged flow properties of the generalized network, including relative permeability and capillary pressure. We validate the model using direct finite-volume two-phase flow simulations on synthetic geometries, and then present a comparison of the model predictions with a conventional pore-network model and experimental measurements of relative permeability in the literature.

  12. The two-dimensional thiophosphate CsCrP2S7

    Directory of Open Access Journals (Sweden)

    Kyounghee Kim

    2010-09-01

    Full Text Available The quaternary title compound, caesium chromium(III heptathiodiphosphate(V, CsCrP2S7, has been synthesized using the reactive halide flux method. It is isotypic with other AMP2S7 (A = alkali metal; M = Cr, V or In structures and consists of two-dimensional ∞2[CrP2S7]− layers extending parallel to (001 which are separated from each other by Cs+ ions (symmetry 2. The layer is built up from slightly distorted octahedral [CrS6] units (symmetry 2 and bent [P2S7] units consisting of two corner-sharing [PS4] tetrahedra. The [CrS6] octahedra share two edges and two corners with the [PS4] tetrahedra. There are only van der Waals interactions present between the layers. The Cs+ ions are located in this van der Waals gap and stabilize the structure through weak ionic interactions. The classical charge balance of the title compound can be expressed as [Cs+][Cr3+][P5+]2[S2−]7.

  13. Stability of parallel flows

    CERN Document Server

    Betchov, R

    2012-01-01

    Stability of Parallel Flows provides information pertinent to hydrodynamical stability. This book explores the stability problems that occur in various fields, including electronics, mechanics, oceanography, administration, economics, as well as naval and aeronautical engineering. Organized into two parts encompassing 10 chapters, this book starts with an overview of the general equations of a two-dimensional incompressible flow. This text then explores the stability of a laminar boundary layer and presents the equation of the inviscid approximation. Other chapters present the general equation

  14. Network-Oblivious Algorithms

    DEFF Research Database (Denmark)

    Bilardi, Gianfranco; Pietracaprina, Andrea; Pucci, Geppino

    2016-01-01

    A framework is proposed for the design and analysis of network-oblivious algorithms, namely algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capabilities. The framework prescribes that a network......-oblivious algorithm be specified on a parallel model of computation where the only parameter is the problem’s input size, and then evaluated on a model with two parameters, capturing parallelism granularity and communication latency. It is shown that for a wide class of network-oblivious algorithms, optimality...... of cache hierarchies, to the realm of parallel computation. Its effectiveness is illustrated by providing optimal network-oblivious algorithms for a number of key problems. Some limitations of the oblivious approach are also discussed....

  15. Spin currents in a normal two-dimensional electron gas in contact with a spin-orbit interaction region

    International Nuclear Information System (INIS)

    Sukhanov, Aleksei A; Sablikov, Vladimir A; Tkach, Yurii Ya

    2009-01-01

    Spin effects in a normal two-dimensional (2D) electron gas in lateral contact with a 2D region with spin-orbit interaction are studied. The peculiarity of this system is the presence of spin-dependent scattering of electrons from the interface. This results in an equilibrium edge spin current and nontrivial spin responses to a particle current. We investigate the spatial distribution of the spin currents and spin density under non-equilibrium conditions caused by a ballistic electron current flowing normal or parallel to the interface. The parallel electron current is found to generate a spin density near the interface and to change the edge spin current. The perpendicular electron current changes the edge spin current proportionally to the electron current and produces a bulk spin current penetrating deep into the normal region. This spin current has two components, one of which is directed normal to the interface and polarized parallel to it, and the second is parallel to the interface and is polarized in the plane perpendicular to the contact line. Both spin currents have a high degree of polarization (∼40-60%).

  16. Beginning Introductory Physics with Two-Dimensional Motion

    Science.gov (United States)

    Huggins, Elisha

    2009-01-01

    During the session on "Introductory College Physics Textbooks" at the 2007 Summer Meeting of the AAPT, there was a brief discussion about whether introductory physics should begin with one-dimensional motion or two-dimensional motion. Here we present the case that by starting with two-dimensional motion, we are able to introduce a considerable…

  17. Two-dimensional x-ray diffraction

    CERN Document Server

    He, Bob B

    2009-01-01

    Written by one of the pioneers of 2D X-Ray Diffraction, this useful guide covers the fundamentals, experimental methods and applications of two-dimensional x-ray diffraction, including geometry convention, x-ray source and optics, two-dimensional detectors, diffraction data interpretation, and configurations for various applications, such as phase identification, texture, stress, microstructure analysis, crystallinity, thin film analysis and combinatorial screening. Experimental examples in materials research, pharmaceuticals, and forensics are also given. This presents a key resource to resea

  18. Neural network control of a parallel hybrid-electric propulsion system for a small unmanned aerial vehicle

    Science.gov (United States)

    Harmon, Frederick G.

    2005-11-01

    Parallel hybrid-electric propulsion systems would be beneficial for small unmanned aerial vehicles (UAVs) used for military, homeland security, and disaster-monitoring missions. The benefits, due to the hybrid and electric-only modes, include increased time-on-station and greater range as compared to electric-powered UAVs and stealth modes not available with gasoline-powered UAVs. This dissertation contributes to the research fields of small unmanned aerial vehicles, hybrid-electric propulsion system control, and intelligent control. A conceptual design of a small UAV with a parallel hybrid-electric propulsion system is provided. The UAV is intended for intelligence, surveillance, and reconnaissance (ISR) missions. A conceptual design reveals the trade-offs that must be considered to take advantage of the hybrid-electric propulsion system. The resulting hybrid-electric propulsion system is a two-point design that includes an engine primarily sized for cruise speed and an electric motor and battery pack that are primarily sized for a slower endurance speed. The electric motor provides additional power for take-off, climbing, and acceleration and also serves as a generator during charge-sustaining operation or regeneration. The intelligent control of the hybrid-electric propulsion system is based on an instantaneous optimization algorithm that generates a hyper-plane from the nonlinear efficiency maps for the internal combustion engine, electric motor, and lithium-ion battery pack. The hyper-plane incorporates charge-depletion and charge-sustaining strategies. The optimization algorithm is flexible and allows the operator/user to assign relative importance between the use of gasoline, electricity, and recharging depending on the intended mission. A MATLAB/Simulink model was developed to test the control algorithms. The Cerebellar Model Arithmetic Computer (CMAC) associative memory neural network is applied to the control of the UAVs parallel hybrid

  19. Parallel S/sub n/ iteration schemes

    International Nuclear Information System (INIS)

    Wienke, B.R.; Hiromoto, R.E.

    1986-01-01

    The iterative, multigroup, discrete ordinates (S/sub n/) technique for solving the linear transport equation enjoys widespread usage and appeal. Serial iteration schemes and numerical algorithms developed over the years provide a timely framework for parallel extension. On the Denelcor HEP, the authors investigate three parallel iteration schemes for solving the one-dimensional S/sub n/ transport equation. The multigroup representation and serial iteration methods are also reviewed. This analysis represents a first attempt to extend serial S/sub n/ algorithms to parallel environments and provides good baseline estimates on ease of parallel implementation, relative algorithm efficiency, comparative speedup, and some future directions. The authors examine ordered and chaotic versions of these strategies, with and without concurrent rebalance and diffusion acceleration. Two strategies efficiently support high degrees of parallelization and appear to be robust parallel iteration techniques. The third strategy is a weaker parallel algorithm. Chaotic iteration, difficult to simulate on serial machines, holds promise and converges faster than ordered versions of the schemes. Actual parallel speedup and efficiency are high and payoff appears substantial

  20. Piezoelectricity in Two-Dimensional Materials

    KAUST Repository

    Wu, Tao

    2015-02-25

    Powering up 2D materials: Recent experimental studies confirmed the existence of piezoelectricity - the conversion of mechanical stress into electricity - in two-dimensional single-layer MoS2 nanosheets. The results represent a milestone towards embedding low-dimensional materials into future disruptive technologies. © 2015 Wiley-VCH Verlag GmbH & Co. KGaA.

  1. Three-dimensional radiative transfer in an isotropically scattering, plane-parallel medium: generalized X- and Y-functions

    International Nuclear Information System (INIS)

    Mueller, D.W.; Crosbie, A.L.

    2005-01-01

    The topic of this work is the generalized X- and Y-functions of multidimensional radiative transfer. The physical problem considered is spatially varying, collimated radiation incident on the upper boundary of an isotropically scattering, plane-parallel medium. An integral transform is used to reduce the three-dimensional transport equation to a one-dimensional form, and a modified Ambarzumian's method is used to derive coupled, integro-differential equations for the source functions at the boundaries of the medium. The resulting equations are said to be in double-integral form because the integration is over both angular variables. Numerical results are presented to illustrate the computational characteristics of the formulation

  2. Two-dimensional confinement of heavy fermions

    International Nuclear Information System (INIS)

    Shishido, Hiroaki; Shibauchi, Takasada; Matsuda, Yuji; Terashima, Takahito

    2010-01-01

    Metallic systems with the strongest electron correlations are realized in certain rare-earth and actinide compounds whose physics are dominated by f-electrons. These materials are known as heavy fermions, so called because the effective mass of the conduction electrons is enhanced via correlation effects up to as much as several hundreds times the free electron mass. To date the electronic structure of all heavy-fermion compounds is essentially three-dimensional. Here we report on the first realization of a two-dimensional heavy-fermion system, where the dimensionality is adjusted in a controllable fashion by fabricating heterostructures using molecular beam epitaxy. The two-dimensional heavy fermion system displays striking deviations from the standard Fermi liquid low-temperature electronic properties. (author)

  3. Two-dimensional hydrogen-bonded polymers in the crystal structures of the ammonium salts of phenoxyacetic acid, (4-fluorophenoxyacetic acid and (4-chloro-2-methylphenoxyacetic acid

    Directory of Open Access Journals (Sweden)

    Graham Smith

    2014-12-01

    Full Text Available The structures of the ammonium salts of phenoxyacetic acid, NH4+·C8H6O3−, (I, (4-fluorophenoxyacetic acid, NH4+·C8H5FO3−, (II, and the herbicidally active (4-chloro-2-methylphenoxyacetic acid (MCPA, NH4+·C9H8ClO3−·0.5H2O, (III have been determined. All have two-dimensional layered structures based on inter-species ammonium N—H...O hydrogen-bonding associations, which give core substructures consisting primarily of conjoined cyclic motifs. The crystals of (I and (II are isomorphous with the core comprising R12(5, R12(4 and centrosymmetric R42(8 ring motifs, giving two-dimensional layers lying parallel to (100. In (III, the water molecule of solvation lies on a crystallographic twofold rotation axis and bridges two carboxyl O atoms in an R44(12 hydrogen-bonded motif, creating two R43(10 rings, which together with a conjoined centrosymmetric R42(8 ring incorporating both ammonium cations, generate two-dimensional layers lying parallel to (100. No π–π ring associations are present in any of the structures.

  4. Two-dimensional topological photonics

    Science.gov (United States)

    Khanikaev, Alexander B.; Shvets, Gennady

    2017-12-01

    Originating from the studies of two-dimensional condensed-matter states, the concept of topological order has recently been expanded to other fields of physics and engineering, particularly optics and photonics. Topological photonic structures have already overturned some of the traditional views on wave propagation and manipulation. The application of topological concepts to guided wave propagation has enabled novel photonic devices, such as reflection-free sharply bent waveguides, robust delay lines, spin-polarized switches and non-reciprocal devices. Discrete degrees of freedom, widely used in condensed-matter physics, such as spin and valley, are now entering the realm of photonics. In this Review, we summarize the latest advances in this highly dynamic field, with special emphasis on the experimental work on two-dimensional photonic topological structures.

  5. Seeing or moving in parallel

    DEFF Research Database (Denmark)

    Christensen, Mark Schram; Ehrsson, H Henrik; Nielsen, Jens Bo

    2013-01-01

    a different network, involving bilateral dorsal premotor cortex (PMd), primary motor cortex, and SMA, was more active when subjects viewed parallel movements while performing either symmetrical or parallel movements. Correlations between behavioral instability and brain activity were present in right lateral...... adduction-abduction movements symmetrically or in parallel with real-time congruent or incongruent visual feedback of the movements. One network, consisting of bilateral superior and middle frontal gyrus and supplementary motor area (SMA), was more active when subjects performed parallel movements, whereas...

  6. Structures of two-dimensional three-body systems

    International Nuclear Information System (INIS)

    Ruan, W.Y.; Liu, Y.Y.; Bao, C.G.

    1996-01-01

    Features of the structure of L = 0 states of a two-dimensional three-body model system have been investigated. Three types of permutation symmetry of the spatial part, namely symmetric, antisymmetric, and mixed, have been considered. A comparison has been made between the two-dimensional system and the corresponding three-dimensional one. The effect of symmetry on microscopic structures is emphasized. (author)

  7. A two-dimensional linear elasticity problem for anisotropic materials, solved with a parallelization code

    Directory of Open Access Journals (Sweden)

    Mihai-Victor PRICOP

    2010-09-01

    Full Text Available The present paper introduces a numerical approach of static linear elasticity equations for anisotropic materials. The domain and boundary conditions are simple, to enhance an easy implementation of the finite difference scheme. SOR and gradient are used to solve the resulting linear system. The simplicity of the geometry is also useful for MPI parallelization of the code.

  8. Identifying failure in a tree network of a parallel computer

    Science.gov (United States)

    Archer, Charles J.; Pinnow, Kurt W.; Wallenfelt, Brian P.

    2010-08-24

    Methods, parallel computers, and products are provided for identifying failure in a tree network of a parallel computer. The parallel computer includes one or more processing sets including an I/O node and a plurality of compute nodes. For each processing set embodiments include selecting a set of test compute nodes, the test compute nodes being a subset of the compute nodes of the processing set; measuring the performance of the I/O node of the processing set; measuring the performance of the selected set of test compute nodes; calculating a current test value in dependence upon the measured performance of the I/O node of the processing set, the measured performance of the set of test compute nodes, and a predetermined value for I/O node performance; and comparing the current test value with a predetermined tree performance threshold. If the current test value is below the predetermined tree performance threshold, embodiments include selecting another set of test compute nodes. If the current test value is not below the predetermined tree performance threshold, embodiments include selecting from the test compute nodes one or more potential problem nodes and testing individually potential problem nodes and links to potential problem nodes.

  9. Three-dimensional graphene networks: synthesis,properties and applications

    Institute of Scientific and Technical Information of China (English)

    Yanfeng Ma; Yongsheng Chen

    2015-01-01

    Recently, three-dimensional graphene/graphene oxide(GO) networks(3DGNs) in the form of foams,sponges and aerogels have atracted much atention. 3D structures provide graphene materials with high speciic surface areas, large pore volumes, strong mechanical strengths and fast mass and electron transport,owing to the combination of the 3D porous structures and the excellent intrinsic properties of graphene.his review focuses on the latest advances in the preparation, properties and potential applications of 3D micro-/nano-architectures made of graphene/GO-based networks, with emphasis on graphene foams and sponges.

  10. Locating hardware faults in a parallel computer

    Science.gov (United States)

    Archer, Charles J.; Megerian, Mark G.; Ratterman, Joseph D.; Smith, Brian E.

    2010-04-13

    Locating hardware faults in a parallel computer, including defining within a tree network of the parallel computer two or more sets of non-overlapping test levels of compute nodes of the network that together include all the data communications links of the network, each non-overlapping test level comprising two or more adjacent tiers of the tree; defining test cells within each non-overlapping test level, each test cell comprising a subtree of the tree including a subtree root compute node and all descendant compute nodes of the subtree root compute node within a non-overlapping test level; performing, separately on each set of non-overlapping test levels, an uplink test on all test cells in a set of non-overlapping test levels; and performing, separately from the uplink tests and separately on each set of non-overlapping test levels, a downlink test on all test cells in a set of non-overlapping test levels.

  11. Research on Two-channel Interleaved Two-stage Paralleled Buck DC-DC Converter for Plasma Cutting Power Supply

    DEFF Research Database (Denmark)

    Yang, Xi-jun; Qu, Hao; Yao, Chen

    2014-01-01

    As for high power plasma power supply, due to high efficiency and flexibility, multi-channel interleaved multi-stage paralleled Buck DC-DC Converter becomes the first choice. In the paper, two-channel interleaved two- stage paralleled Buck DC-DC Converter powered by three-phase AC power supply...

  12. X-ray imaging device for one-dimensional and two-dimensional radioscopy

    International Nuclear Information System (INIS)

    1978-01-01

    The X-ray imaging device for the selectable one-dimensional or two-dimensional pictures of objects illuminated by X-rays, comprising an X-ray source, an X-ray screen, and an opto-electrical picture development device placed behind the screen, is characterized by an anamorphotic optical system, which is positioned with a one-dimensional illumination between the X-ray screen and the opto-electrical device and that a two-dimensional illumination will be developed, and that in view of the lens system which forms part of the opto-electrical device, there is placed an X-ray screen in a specified beam direction so that a magnified image may be formed by equalisation of the distance between the X-ray screen and the lens system. (G.C.)

  13. Simulation Exploration through Immersive Parallel Planes: Preprint

    Energy Technology Data Exchange (ETDEWEB)

    Brunhart-Lupo, Nicholas; Bush, Brian W.; Gruchalla, Kenny; Smith, Steve

    2016-03-01

    We present a visualization-driven simulation system that tightly couples systems dynamics simulations with an immersive virtual environment to allow analysts to rapidly develop and test hypotheses in a high-dimensional parameter space. To accomplish this, we generalize the two-dimensional parallel-coordinates statistical graphic as an immersive 'parallel-planes' visualization for multivariate time series emitted by simulations running in parallel with the visualization. In contrast to traditional parallel coordinate's mapping the multivariate dimensions onto coordinate axes represented by a series of parallel lines, we map pairs of the multivariate dimensions onto a series of parallel rectangles. As in the case of parallel coordinates, each individual observation in the dataset is mapped to a polyline whose vertices coincide with its coordinate values. Regions of the rectangles can be 'brushed' to highlight and select observations of interest: a 'slider' control allows the user to filter the observations by their time coordinate. In an immersive virtual environment, users interact with the parallel planes using a joystick that can select regions on the planes, manipulate selection, and filter time. The brushing and selection actions are used to both explore existing data as well as to launch additional simulations corresponding to the visually selected portions of the input parameter space. As soon as the new simulations complete, their resulting observations are displayed in the virtual environment. This tight feedback loop between simulation and immersive analytics accelerates users' realization of insights about the simulation and its output.

  14. Hamiltonian formalism of two-dimensional Vlasov kinetic equation.

    Science.gov (United States)

    Pavlov, Maxim V

    2014-12-08

    In this paper, the two-dimensional Benney system describing long wave propagation of a finite depth fluid motion and the multi-dimensional Russo-Smereka kinetic equation describing a bubbly flow are considered. The Hamiltonian approach established by J. Gibbons for the one-dimensional Vlasov kinetic equation is extended to a multi-dimensional case. A local Hamiltonian structure associated with the hydrodynamic lattice of moments derived by D. J. Benney is constructed. A relationship between this hydrodynamic lattice of moments and the two-dimensional Vlasov kinetic equation is found. In the two-dimensional case, a Hamiltonian hydrodynamic lattice for the Russo-Smereka kinetic model is constructed. Simple hydrodynamic reductions are presented.

  15. Novel target design algorithm for two-dimensional optical storage (TwoDOS)

    NARCIS (Netherlands)

    Huang, Li; Chong, T.C.; Vijaya Kumar, B.V.K.; Kobori, H.

    2004-01-01

    In this paper we introduce the Hankel transform based channel model of Two-Dimensional Optical Storage (TwoDOS) system. Based on this model, the two-dimensional (2D) minimum mean-square error (MMSE) equalizer has been derived and applied to some simple but common cases. The performance of the 2D

  16. Comparison of Generated Parallel Capillary Arrays to Three-Dimensional Reconstructed Capillary Networks in Modeling Oxygen Transport in Discrete Microvascular Volumes

    Science.gov (United States)

    Fraser, Graham M.; Goldman, Daniel; Ellis, Christopher G.

    2013-01-01

    Objective We compare Reconstructed Microvascular Networks (RMN) to Parallel Capillary Arrays (PCA) under several simulated physiological conditions to determine how the use of different vascular geometry affects oxygen transport solutions. Methods Three discrete networks were reconstructed from intravital video microscopy of rat skeletal muscle (84×168×342 μm, 70×157×268 μm and 65×240×571 μm) and hemodynamic measurements were made in individual capillaries. PCAs were created based on statistical measurements from RMNs. Blood flow and O2 transport models were applied and the resulting solutions for RMN and PCA models were compared under 4 conditions (rest, exercise, ischemia and hypoxia). Results Predicted tissue PO2 was consistently lower in all RMN simulations compared to the paired PCA. PO2 for 3D reconstructions at rest were 28.2±4.8, 28.1±3.5, and 33.0±4.5 mmHg for networks I, II, and III compared to the PCA mean values of 31.2±4.5, 30.6±3.4, and 33.8±4.6 mmHg. Simulated exercise yielded mean tissue PO2 in the RMN of 10.1±5.4, 12.6±5.7, and 19.7±5.7 mmHg compared to 15.3±7.3, 18.8±5.3, and 21.7±6.0 in PCA. Conclusions These findings suggest that volume matched PCA yield different results compared to reconstructed microvascular geometries when applied to O2 transport modeling; the predominant characteristic of this difference being an over estimate of mean tissue PO2. Despite this limitation, PCA models remain important for theoretical studies as they produce PO2 distributions with similar shape and parameter dependence as RMN. PMID:23841679

  17. Reversed thermo-switchable molecular sieving membranes composed of two-dimensional metal-organic nanosheets for gas separation

    Science.gov (United States)

    Wang, Xuerui; Chi, Chenglong; Zhang, Kang; Qian, Yuhong; Gupta, Krishna M.; Kang, Zixi; Jiang, Jianwen; Zhao, Dan

    2017-02-01

    It is highly desirable to reduce the membrane thickness in order to maximize the throughput and break the trade-off limitation for membrane-based gas separation. Two-dimensional membranes composed of atomic-thick graphene or graphene oxide nanosheets have gas transport pathways that are at least three orders of magnitude higher than the membrane thickness, leading to reduced gas permeation flux and impaired separation throughput. Here we present nm-thick molecular sieving membranes composed of porous two-dimensional metal-organic nanosheets. These membranes possess pore openings parallel to gas concentration gradient allowing high gas permeation flux and high selectivity, which are proven by both experiment and molecular dynamics simulation. Furthermore, the gas transport pathways of these membranes exhibit a reversed thermo-switchable feature, which is attributed to the molecular flexibility of the building metal-organic nanosheets.

  18. Two-dimensional ferroelectrics

    Energy Technology Data Exchange (ETDEWEB)

    Blinov, L M; Fridkin, Vladimir M; Palto, Sergei P [A.V. Shubnikov Institute of Crystallography, Russian Academy of Sciences, Moscow, Russian Federaion (Russian Federation); Bune, A V; Dowben, P A; Ducharme, Stephen [Department of Physics and Astronomy, Behlen Laboratory of Physics, Center for Materials Research and Analysis, University of Nebraska-Linkoln, Linkoln, NE (United States)

    2000-03-31

    The investigation of the finite-size effect in ferroelectric crystals and films has been limited by the experimental conditions. The smallest demonstrated ferroelectric crystals had a diameter of {approx}200 A and the thinnest ferroelectric films were {approx}200 A thick, macroscopic sizes on an atomic scale. Langmuir-Blodgett deposition of films one monolayer at a time has produced high quality ferroelectric films as thin as 10 A, made from polyvinylidene fluoride and its copolymers. These ultrathin films permitted the ultimate investigation of finite-size effects on the atomic thickness scale. Langmuir-Blodgett films also revealed the fundamental two-dimensional character of ferroelectricity in these materials by demonstrating that there is no so-called critical thickness; films as thin as two monolayers (1 nm) are ferroelectric, with a transition temperature near that of the bulk material. The films exhibit all the main properties of ferroelectricity with a first-order ferroelectric-paraelectric phase transition: polarization hysteresis (switching); the jump in spontaneous polarization at the phase transition temperature; thermal hysteresis in the polarization; the increase in the transition temperature with applied field; double hysteresis above the phase transition temperature; and the existence of the ferroelectric critical point. The films also exhibit a new phase transition associated with the two-dimensional layers. (reviews of topical problems)

  19. A Bayesian network model for predicting aquatic toxicity mode of action using two dimensional theoretical molecular descriptors

    Energy Technology Data Exchange (ETDEWEB)

    Carriger, John F. [U.S. Environmental Protection Agency, Office of Research and Development, Gulf Ecology Division, Gulf Breeze, FL, 32561 (United States); Martin, Todd M. [U.S. Environmental Protection Agency, Office of Research and Development, Sustainable Technology Division, Cincinnati, OH, 45220 (United States); Barron, Mace G., E-mail: barron.mace@epa.gov [U.S. Environmental Protection Agency, Office of Research and Development, Gulf Ecology Division, Gulf Breeze, FL, 32561 (United States)

    2016-11-15

    Highlights: • A Bayesian network was developed to classify chemical mode of action (MoA). • The network was based on the aquatic toxicity MoA for over 1000 chemicals. • A Markov blanket algorithm selected a subset of theoretical molecular descriptors. • Sensitivity analyses found influential descriptors for classifying the MoAs. • Overall precision of the Bayesian MoA classification model was 80%. - Abstract: The mode of toxic action (MoA) has been recognized as a key determinant of chemical toxicity, but development of predictive MoA classification models in aquatic toxicology has been limited. We developed a Bayesian network model to classify aquatic toxicity MoA using a recently published dataset containing over one thousand chemicals with MoA assignments for aquatic animal toxicity. Two dimensional theoretical chemical descriptors were generated for each chemical using the Toxicity Estimation Software Tool. The model was developed through augmented Markov blanket discovery from the dataset of 1098 chemicals with the MoA broad classifications as a target node. From cross validation, the overall precision for the model was 80.2%. The best precision was for the AChEI MoA (93.5%) where 257 chemicals out of 275 were correctly classified. Model precision was poorest for the reactivity MoA (48.5%) where 48 out of 99 reactive chemicals were correctly classified. Narcosis represented the largest class within the MoA dataset and had a precision and reliability of 80.0%, reflecting the global precision across all of the MoAs. False negatives for narcosis most often fell into electron transport inhibition, neurotoxicity or reactivity MoAs. False negatives for all other MoAs were most often narcosis. A probabilistic sensitivity analysis was undertaken for each MoA to examine the sensitivity to individual and multiple descriptor findings. The results show that the Markov blanket of a structurally complex dataset can simplify analysis and interpretation by

  20. Parallel computation for biological sequence comparison: comparing a portable model to the native model for the Intel Hypercube.

    Science.gov (United States)

    Nadkarni, P M; Miller, P L

    1991-01-01

    A parallel program for inter-database sequence comparison was developed on the Intel Hypercube using two models of parallel programming. One version was built using machine-specific Hypercube parallel programming commands. The other version was built using Linda, a machine-independent parallel programming language. The two versions of the program provide a case study comparing these two approaches to parallelization in an important biological application area. Benchmark tests with both programs gave comparable results with a small number of processors. As the number of processors was increased, the Linda version was somewhat less efficient. The Linda version was also run without change on Network Linda, a virtual parallel machine running on a network of desktop workstations.

  1. Bessel functions: parallel display and processing.

    Science.gov (United States)

    Lohmann, A W; Ojeda-Castañeda, J; Serrano-Heredia, A

    1994-01-01

    We present an optical setup that converts planar binary curves into two-dimensional amplitude distributions, which are proportional, along one axis, to the Bessel function of order n, whereas along the other axis the order n increases. This Bessel displayer can be used for parallel Bessel transformation of a signal. Experimental verifications are included.

  2. Two-Dimensional Materials for Sensing: Graphene and Beyond

    Directory of Open Access Journals (Sweden)

    Seba Sara Varghese

    2015-09-01

    Full Text Available Two-dimensional materials have attracted great scientific attention due to their unusual and fascinating properties for use in electronics, spintronics, photovoltaics, medicine, composites, etc. Graphene, transition metal dichalcogenides such as MoS2, phosphorene, etc., which belong to the family of two-dimensional materials, have shown great promise for gas sensing applications due to their high surface-to-volume ratio, low noise and sensitivity of electronic properties to the changes in the surroundings. Two-dimensional nanostructured semiconducting metal oxide based gas sensors have also been recognized as successful gas detection devices. This review aims to provide the latest advancements in the field of gas sensors based on various two-dimensional materials with the main focus on sensor performance metrics such as sensitivity, specificity, detection limit, response time, and reversibility. Both experimental and theoretical studies on the gas sensing properties of graphene and other two-dimensional materials beyond graphene are also discussed. The article concludes with the current challenges and future prospects for two-dimensional materials in gas sensor applications.

  3. Conformal pure radiation with parallel rays

    International Nuclear Information System (INIS)

    Leistner, Thomas; Paweł Nurowski

    2012-01-01

    We define pure radiation metrics with parallel rays to be n-dimensional pseudo-Riemannian metrics that admit a parallel null line bundle K and whose Ricci tensor vanishes on vectors that are orthogonal to K. We give necessary conditions in terms of the Weyl, Cotton and Bach tensors for a pseudo-Riemannian metric to be conformal to a pure radiation metric with parallel rays. Then, we derive conditions in terms of the tractor calculus that are equivalent to the existence of a pure radiation metric with parallel rays in a conformal class. We also give analogous results for n-dimensional pseudo-Riemannian pp-waves. (paper)

  4. Gravity, two times, tractors, Weyl invariance, and six-dimensional quantum mechanics

    International Nuclear Information System (INIS)

    Bonezzi, R.; Latini, E.; Waldron, A.

    2010-01-01

    Fefferman and Graham showed some time ago that four-dimensional conformal geometries could be analyzed in terms of six-dimensional, ambient, Riemannian geometries admitting a closed homothety. Recently, it was shown how conformal geometry provides a description of physics manifestly invariant under local choices of unit systems. Strikingly, Einstein's equations are then equivalent to the existence of a parallel scale tractor (a six-component vector subject to a certain first order covariant constancy condition at every point in four-dimensional spacetime). These results suggest a six-dimensional description of four-dimensional physics, a viewpoint promulgated by the 2 times physics program of Bars. The Fefferman-Graham construction relies on a triplet of operators corresponding, respectively, to a curved six-dimensional light cone, the dilation generator and the Laplacian. These form an sp(2) algebra which Bars employs as a first class algebra of constraints in a six-dimensional gauge theory. In this article four-dimensional gravity is recast in terms of six-dimensional quantum mechanics by melding the 2 times and tractor approaches. This parent formulation of gravity is built from an infinite set of six-dimensional fields. Successively integrating out these fields yields various novel descriptions of gravity including a new four-dimensional one built from a scalar doublet, a tractor-vector multiplet and a conformal class of metrics.

  5. Linear predictions of supercritical flow instability in two parallel channels

    International Nuclear Information System (INIS)

    Shah, M.

    2008-01-01

    A steady state linear code that can predict thermo-hydraulic instability boundaries in a two parallel channel system under supercritical conditions has been developed. Linear and non-linear solutions of the instability boundary in a two parallel channel system are also compared. The effect of gravity on the instability boundary in a two parallel channel system, by changing the orientation of the system flow from horizontal flow to vertical up-flow and vertical down-flow has been analyzed. Vertical up-flow is found to be more unstable than horizontal flow and vertical down flow is found to be the most unstable configuration. The type of instability present in each flow-orientation of a parallel channel system has been checked and the density wave oscillation type is observed in horizontal flow and vertical up-flow, while the static type of instability is observed in a vertical down-flow for the cases studied here. The parameters affecting the instability boundary, such as the heating power, inlet temperature, inlet and outlet K-factors are varied to assess their effects. This study is important for the design of future Generation IV nuclear reactors in which supercritical light water is proposed as the primary coolant. (author)

  6. Parallel phase model : a programming model for high-end parallel machines with manycores.

    Energy Technology Data Exchange (ETDEWEB)

    Wu, Junfeng (Syracuse University, Syracuse, NY); Wen, Zhaofang; Heroux, Michael Allen; Brightwell, Ronald Brian

    2009-04-01

    This paper presents a parallel programming model, Parallel Phase Model (PPM), for next-generation high-end parallel machines based on a distributed memory architecture consisting of a networked cluster of nodes with a large number of cores on each node. PPM has a unified high-level programming abstraction that facilitates the design and implementation of parallel algorithms to exploit both the parallelism of the many cores and the parallelism at the cluster level. The programming abstraction will be suitable for expressing both fine-grained and coarse-grained parallelism. It includes a few high-level parallel programming language constructs that can be added as an extension to an existing (sequential or parallel) programming language such as C; and the implementation of PPM also includes a light-weight runtime library that runs on top of an existing network communication software layer (e.g. MPI). Design philosophy of PPM and details of the programming abstraction are also presented. Several unstructured applications that inherently require high-volume random fine-grained data accesses have been implemented in PPM with very promising results.

  7. Two-dimensional calculus

    CERN Document Server

    Osserman, Robert

    2011-01-01

    The basic component of several-variable calculus, two-dimensional calculus is vital to mastery of the broader field. This extensive treatment of the subject offers the advantage of a thorough integration of linear algebra and materials, which aids readers in the development of geometric intuition. An introductory chapter presents background information on vectors in the plane, plane curves, and functions of two variables. Subsequent chapters address differentiation, transformations, and integration. Each chapter concludes with problem sets, and answers to selected exercises appear at the end o

  8. Numerical discrepancy between serial and MPI parallel computations

    Directory of Open Access Journals (Sweden)

    Sang Bong Lee

    2016-09-01

    Full Text Available Numerical simulations of 1D Burgers equation and 2D sloshing problem were carried out to study numerical discrepancy between serial and parallel computations. The numerical domain was decomposed into 2 and 4 subdomains for parallel computations with message passing interface. The numerical solution of Burgers equation disclosed that fully explicit boundary conditions used on subdomains of parallel computation was responsible for the numerical discrepancy of transient solution between serial and parallel computations. Two dimensional sloshing problems in a rectangular domain were solved using OpenFOAM. After a lapse of initial transient time sloshing patterns of water were significantly different in serial and parallel computations although the same numerical conditions were given. Based on the histograms of pressure measured at two points near the wall the statistical characteristics of numerical solution was not affected by the number of subdomains as much as the transient solution was dependent on the number of subdomains.

  9. Phase transitions in two-dimensional systems

    International Nuclear Information System (INIS)

    Salinas, S.R.A.

    1983-01-01

    Some experiences are related using synchrotron radiation beams, to characterize solid-liquid (fusion) and commensurate solid-uncommensurate solid transitions in two-dimensional systems. Some ideas involved in the modern theories of two-dimensional fusion are shortly exposed. The systems treated consist of noble gases (Kr,Ar,Xe) adsorbed in the basal plane of graphite and thin films formed by some liquid crystal shells. (L.C.) [pt

  10. Long-range ordering of III-V semiconductor nanostructures by shallowly buried dislocation networks

    International Nuclear Information System (INIS)

    Coelho, J; Patriarche, G; Glas, F; Saint-Girons, G; Sagnes, I

    2004-01-01

    We account for lateral orderings of III-V nanostructures resulting from a GaAs/InAs/InGaAs/GaAs sequence grown on GaAs by metallorganic vapour phase epitaxy at two different temperatures. For both samples, the ordering is induced by the stress field of a periodic dislocation network (DN) shallowly buried and parallel to the surface. This DN is a grain boundary (GB) that forms, between a thin GaAs layer (on which growth was performed) and a GaAs substrate joined together by wafer bonding, in order to accommodate a tilt and a twist between these two crystals; both these misorientations are imposed in a controlled manner. This GB is composed of a one-dimensional network of mixed dislocations and of a one-dimensional network of screw dislocations. For both samples, the nanostructures observed by transmission electron microscopy (TEM) and atomic force microscopy are ordered by the underlying DN observed by TEM since they have same dimensions and orientations as the cells of the DN

  11. Distributed parallel messaging for multiprocessor systems

    Science.gov (United States)

    Chen, Dong; Heidelberger, Philip; Salapura, Valentina; Senger, Robert M; Steinmacher-Burrow, Burhard; Sugawara, Yutaka

    2013-06-04

    A method and apparatus for distributed parallel messaging in a parallel computing system. The apparatus includes, at each node of a multiprocessor network, multiple injection messaging engine units and reception messaging engine units, each implementing a DMA engine and each supporting both multiple packet injection into and multiple reception from a network, in parallel. The reception side of the messaging unit (MU) includes a switch interface enabling writing of data of a packet received from the network to the memory system. The transmission side of the messaging unit, includes switch interface for reading from the memory system when injecting packets into the network.

  12. Vectorization, parallelization and porting of nuclear codes. Vectorization and parallelization. Progress report fiscal 1999

    Energy Technology Data Exchange (ETDEWEB)

    Adachi, Masaaki; Ogasawara, Shinobu; Kume, Etsuo [Japan Atomic Energy Research Inst., Tokai, Ibaraki (Japan). Tokai Research Establishment; Ishizuki, Shigeru; Nemoto, Toshiyuki; Kawasaki, Nobuo; Kawai, Wataru [Fujitsu Ltd., Tokyo (Japan); Yatake, Yo-ichi [Hitachi Ltd., Tokyo (Japan)

    2001-02-01

    Several computer codes in the nuclear field have been vectorized, parallelized and trans-ported on the FUJITSU VPP500 system, the AP3000 system, the SX-4 system and the Paragon system at Center for Promotion of Computational Science and Engineering in Japan Atomic Energy Research Institute. We dealt with 18 codes in fiscal 1999. These results are reported in 3 parts, i.e., the vectorization and the parallelization part on vector processors, the parallelization part on scalar processors and the porting part. In this report, we describe the vectorization and parallelization on vector processors. In this vectorization and parallelization on vector processors part, the vectorization of Relativistic Molecular Orbital Calculation code RSCAT, a microscopic transport code for high energy nuclear collisions code JAM, three-dimensional non-steady thermal-fluid analysis code STREAM, Relativistic Density Functional Theory code RDFT and High Speed Three-Dimensional Nodal Diffusion code MOSRA-Light on the VPP500 system and the SX-4 system are described. (author)

  13. The theory of critical phenomena in two-dimensional systems

    International Nuclear Information System (INIS)

    Olvera de la C, M.

    1981-01-01

    An exposition of the theory of critical phenomena in two-dimensional physical systems is presented. The first six chapters deal with the mean field theory of critical phenomena, scale invariance of the thermodynamic functions, Kadanoff's spin block construction, Wilson's renormalization group treatment of critical phenomena in configuration space, and the two-dimensional Ising model on a triangular lattice. The second part of this work is made of four chapters devoted to the application of the ideas expounded in the first part to the discussion of critical phenomena in superfluid films, two-dimensional crystals and the two-dimensional XY model of magnetic systems. Chapters seven to ten are devoted to the following subjects: analysis of long range order in one, two, and three-dimensional physical systems. Topological defects in the XY model, in superfluid films and in two-dimensional crystals. The Thouless-Kosterlitz iterated mean field theory of the dipole gas. The renormalization group treatment of the XY model, superfluid films and two-dimensional crystal. (author)

  14. Performance evaluations of advanced massively parallel platforms based on gyrokinetic toroidal five-dimensional Eulerian code GT5D

    International Nuclear Information System (INIS)

    Idomura, Yasuhiro; Jolliet, Sebastien

    2010-01-01

    A gyrokinetic toroidal five dimensional Eulerian code GT5D is ported on six advanced massively parallel platforms and comprehensive benchmark tests are performed. A parallelisation technique based on physical properties of the gyrokinetic equation is presented. By extending the parallelisation technique with a hybrid parallel model, the scalability of the code is improved on platforms with multi-core processors. In the benchmark tests, a good salability is confirmed up to several thousands cores on every platforms, and the maximum sustained performance of ∼18.6 Tflops is achieved using 16384 cores of BX900. (author)

  15. Merging Bottom-Up with Top-Down: Continuous Lamellar Networks and Block Copolymer Lithography

    Science.gov (United States)

    Campbell, Ian Patrick

    Block copolymer lithography is an emerging nanopatterning technology with capabilities that may complement and eventually replace those provided by existing optical lithography techniques. This bottom-up process relies on the parallel self-assembly of macromolecules composed of covalently linked, chemically distinct blocks to generate periodic nanostructures. Among the myriad potential morphologies, lamellar structures formed by diblock copolymers with symmetric volume fractions have attracted the most interest as a patterning tool. When confined to thin films and directed to assemble with interfaces perpendicular to the substrate, two-dimensional domains are formed between the free surface and the substrate, and selective removal of a single block creates a nanostructured polymeric template. The substrate exposed between the polymeric features can subsequently be modified through standard top-down microfabrication processes to generate novel nanostructured materials. Despite tremendous progress in our understanding of block copolymer self-assembly, continuous two-dimensional materials have not yet been fabricated via this robust technique, which may enable nanostructured material combinations that cannot be fabricated through bottom-up methods. This thesis aims to study the effects of block copolymer composition and processing on the lamellar network morphology of polystyrene-block-poly(methyl methacrylate) (PS-b-PMMA) and utilize this knowledge to fabricate continuous two-dimensional materials through top-down methods. First, block copolymer composition was varied through homopolymer blending to explore the physical phenomena surrounding lamellar network continuity. After establishing a framework for tuning the continuity, the effects of various processing parameters were explored to engineer the network connectivity via defect annihilation processes. Precisely controlling the connectivity and continuity of lamellar networks through defect engineering and

  16. UNVEILING A NETWORK OF PARALLEL FILAMENTS IN THE INFRARED DARK CLOUD G14.225-0.506

    Energy Technology Data Exchange (ETDEWEB)

    Busquet, Gemma [INAF-Istituto di Astrofisica e Planetologia Spaziali, via Fosso del Cavaliere 100, I-00133 Roma (Italy); Zhang, Qizhou; Ho, Paul T. P. [Harvard-Smithsonian Center for Astrophysics, 60 Garden Street, Cambridge, MA 02138 (United States); Palau, Aina; Girart, Josep M. [Institut de Ciencies de l' Espai (CSIC-IEEC), Campus UAB, Facultat de Ciencies, Torre C-5 parell, E-08193 Bellaterra, Catalunya (Spain); Liu, Hauyu Baobab [Academia Sinica Institute of Astronomy and Astrophysics, Taipei, Taiwan (China); Sanchez-Monge, Alvaro [INAF, Osservatorio Astrofisico di Arcetri, Largo E. Fermi 5, I-05125 Firenze (Italy); Estalella, Robert [Departament d' Astronomia i Meteorologia, Institut de Ciencies del Cosmos (ICC), Universitat de Barcelona (IEEC-UB), Marti i Franques 1, E-08028 Barcelona, Catalunya (Spain); De Gregorio-Monsalvo, Itziar [European Southern Observatory, Karl-Schwarzschild-Strasse 2, D-85748 Garching (Germany); Pillai, Thushara [Caltech Astronomy Department, MC 249-17, 1200 East California Boulevard, Pasadena, CA 91125 (United States); Wyrowski, Friedrich [Max-Planck-Institut fuer Radioastronomie, Auf dem Huegel 69, D-53121 Bonn (Germany); Santos, Fabio P.; Franco, Gabriel A. P., E-mail: gemma.busquet@iaps.inaf.it [Departamento de Fisica-ICEx-UFMG, Caixa Postal 702, 30.123-970 Belo Horizonte-MG (Brazil)

    2013-02-20

    We present the results of combined NH{sub 3} (1,1) and (2,2) line emission observed with the Very Large Array and the Effelsberg 100 m telescope of the infrared dark cloud G14.225-0.506. The NH{sub 3} emission reveals a network of filaments constituting two hub-filament systems. Hubs are associated with gas of rotational temperature T{sub rot} {approx} 15 K, non-thermal velocity dispersion {sigma}{sub NT} {approx} 1 km s{sup -1}, and exhibit signs of star formation, while filaments appear to be more quiescent (T{sub rot} {approx} 11 K and {sigma}{sub NT} {approx} 0.6 km s{sup -1}). Filaments are parallel in projection and distributed mainly along two directions, at P.A. {approx} 10 Degree-Sign and 60 Degree-Sign , and appear to be coherent in velocity. The averaged projected separation between adjacent filaments is between 0.5 pc and 1 pc, and the mean width of filaments is 0.12 pc. Cores within filaments are separated by {approx}0.33 {+-} 0.09 pc, which is consistent with the predicted fragmentation of an isothermal gas cylinder due to the {sup s}ausage{sup -}type instability. The network of parallel filaments observed in G14.225-0.506 is consistent with the gravitational instability of a thin gas layer threaded by magnetic fields. Overall, our data suggest that magnetic fields might play an important role in the alignment of filaments, and polarization measurements in the entire cloud would lend further support to this scenario.

  17. A parallel simulated annealing algorithm for standard cell placement on a hypercube computer

    Science.gov (United States)

    Jones, Mark Howard

    1987-01-01

    A parallel version of a simulated annealing algorithm is presented which is targeted to run on a hypercube computer. A strategy for mapping the cells in a two dimensional area of a chip onto processors in an n-dimensional hypercube is proposed such that both small and large distance moves can be applied. Two types of moves are allowed: cell exchanges and cell displacements. The computation of the cost function in parallel among all the processors in the hypercube is described along with a distributed data structure that needs to be stored in the hypercube to support parallel cost evaluation. A novel tree broadcasting strategy is used extensively in the algorithm for updating cell locations in the parallel environment. Studies on the performance of the algorithm on example industrial circuits show that it is faster and gives better final placement results than the uniprocessor simulated annealing algorithms. An improved uniprocessor algorithm is proposed which is based on the improved results obtained from parallelization of the simulated annealing algorithm.

  18. Conjugate-Gradient Neural Networks in Classification of Multisource and Very-High-Dimensional Remote Sensing Data

    Science.gov (United States)

    Benediktsson, J. A.; Swain, P. H.; Ersoy, O. K.

    1993-01-01

    Application of neural networks to classification of remote sensing data is discussed. Conventional two-layer backpropagation is found to give good results in classification of remote sensing data but is not efficient in training. A more efficient variant, based on conjugate-gradient optimization, is used for classification of multisource remote sensing and geographic data and very-high-dimensional data. The conjugate-gradient neural networks give excellent performance in classification of multisource data, but do not compare as well with statistical methods in classification of very-high-dimentional data.

  19. Speed up of MCACE, a Monte Carlo code for evaluation of shielding safety, by parallel computer, (3)

    International Nuclear Information System (INIS)

    Takano, Makoto; Masukawa, Fumihiro; Naito, Yoshitaka; Onodera, Emi; Imawaka, Tsuneyuki; Yoda, Yoshihisa.

    1993-07-01

    The parallel computing of the MCACE code has been studied on two platforms; 1) Shared Memory Type Vector-Parallel Computer Monte-4 and 2) Networked Several Workstations. On the Monte-4, a disk-file has been allocated to collect all results computed by 4 CPUs in parallel, executing the copy of the MCACE code on each CPU. On the workstations under network environment, two parallel models have been evaluated; 1) a host-node model and 2) the model used on the Monte-4 where no software for parallelization has been employed but only standard FORTRAN language. The measurement of computing times has showed that speed up of about 3 times has been achieved by using 4 CPUs of the Monte-4. Further, connecting 4 workstations by network, the computing speed by parallelization has achieved faster than our scalar main frame computer, FACOM M-780. (author)

  20. A new one-dimensional NiII coordination polymer with a two-dimensional supramolecular architecture

    Directory of Open Access Journals (Sweden)

    Kai-Long Zhong

    2017-02-01

    Full Text Available A new one-dimensional NiII coordination polymer of 1,3,5-tris(imidazol-1-ylmethylbenzene, namely catena-poly[[aqua(sulfato-κOhemi(μ-ethane-1,2-diol-κ2O:O′[μ3-1,3,5-tris(1H-imidazol-1-ylmethylbenzene-κ3N3,N3′,N3′′]nickel(II] ethane-1,2-diol monosolvate monohydrate], {[Ni(SO4(C18H18N6(C2H6O20.5(H2O]·C2H6O2·H2O}n, was synthesized and characterized by elemental analysis, IR spectroscopy and single-crystal X-ray diffraction. The NiII cation is coordinated by three N atoms of three different 1,3,5-tris(imidazol-1-ylmethylbenzene ligands, one O atom of an ethane-1,2-diol molecule, by a sulfate anion and a water molecule, forming a distorted octahedral NiN3O3 coordination geometry. The tripodal 1,3,5-tris(imidazol-1-ylmethylbenzene ligands link the NiII cations, generating metal–organic chains running along the [100] direction. Adjacent chains are further connected by O—H...O hydrogen bonds, resulting in a two-dimensional supermolecular architecture running parallel to the (001 plane. Another water molecule and a second ethane-1,2-diol molecule are non-coordinating and are linked to the coordinating sulfate ions via O—H...O hydrogen bonds.

  1. Performing a local reduction operation on a parallel computer

    Science.gov (United States)

    Blocksome, Michael A.; Faraj, Daniel A.

    2012-12-11

    A parallel computer including compute nodes, each including two reduction processing cores, a network write processing core, and a network read processing core, each processing core assigned an input buffer. Copying, in interleaved chunks by the reduction processing cores, contents of the reduction processing cores' input buffers to an interleaved buffer in shared memory; copying, by one of the reduction processing cores, contents of the network write processing core's input buffer to shared memory; copying, by another of the reduction processing cores, contents of the network read processing core's input buffer to shared memory; and locally reducing in parallel by the reduction processing cores: the contents of the reduction processing core's input buffer; every other interleaved chunk of the interleaved buffer; the copied contents of the network write processing core's input buffer; and the copied contents of the network read processing core's input buffer.

  2. Spectroscopy of charge transfer complexes of four amino acids as organic two-dimensional conductors

    International Nuclear Information System (INIS)

    Padhiyar, Ashvin; Patel, A J; Oza, A T

    2007-01-01

    It is found in this study that four amino acids, namely asparagine, arginine, histidine and glutamine form two-dimensional conducting systems which are charge transfer complexes (CTCs) with organic acceptors like TCNQ, TCNE, chloranil, DDQ, TNF and iodine. It is verified using optical absorption edges that these are 2d conductors like transition metal dichalcogenides obeying absorption functions different from 1d and 3d conductors. This 2d nature is related to the network of intermolecular H-bonding in these complexes, which leads to a global H-bonded network resulting in the absence of local deformation due to the relaxation of strain

  3. Analytical model for vibration prediction of two parallel tunnels in a full-space

    Science.gov (United States)

    He, Chao; Zhou, Shunhua; Guo, Peijun; Di, Honggui; Zhang, Xiaohui

    2018-06-01

    This paper presents a three-dimensional analytical model for the prediction of ground vibrations from two parallel tunnels embedded in a full-space. The two tunnels are modelled as cylindrical shells of infinite length, and the surrounding soil is modelled as a full-space with two cylindrical cavities. A virtual interface is introduced to divide the soil into the right layer and the left layer. By transforming the cylindrical waves into the plane waves, the solution of wave propagation in the full-space with two cylindrical cavities is obtained. The transformations from the plane waves to cylindrical waves are then used to satisfy the boundary conditions on the tunnel-soil interfaces. The proposed model provides a highly efficient tool to predict the ground vibration induced by the underground railway, which accounts for the dynamic interaction between neighbouring tunnels. Analysis of the vibration fields produced over a range of frequencies and soil properties is conducted. When the distance between the two tunnels is smaller than three times the tunnel diameter, the interaction between neighbouring tunnels is highly significant, at times in the order of 20 dB. It is necessary to consider the interaction between neighbouring tunnels for the prediction of ground vibrations induced underground railways.

  4. Functional networks in parallel with cortical development associate with executive functions in children.

    Science.gov (United States)

    Zhong, Jidan; Rifkin-Graboi, Anne; Ta, Anh Tuan; Yap, Kar Lai; Chuang, Kai-Hsiang; Meaney, Michael J; Qiu, Anqi

    2014-07-01

    Children begin performing similarly to adults on tasks requiring executive functions in late childhood, a transition that is probably due to neuroanatomical fine-tuning processes, including myelination and synaptic pruning. In parallel to such structural changes in neuroanatomical organization, development of functional organization may also be associated with cognitive behaviors in children. We examined 6- to 10-year-old children's cortical thickness, functional organization, and cognitive performance. We used structural magnetic resonance imaging (MRI) to identify areas with cortical thinning, resting-state fMRI to identify functional organization in parallel to cortical development, and working memory/response inhibition tasks to assess executive functioning. We found that neuroanatomical changes in the form of cortical thinning spread over bilateral frontal, parietal, and occipital regions. These regions were engaged in 3 functional networks: sensorimotor and auditory, executive control, and default mode network. Furthermore, we found that working memory and response inhibition only associated with regional functional connectivity, but not topological organization (i.e., local and global efficiency of information transfer) of these functional networks. Interestingly, functional connections associated with "bottom-up" as opposed to "top-down" processing were more clearly related to children's performance on working memory and response inhibition, implying an important role for brain systems involved in late childhood. © The Author 2013. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

  5. Two- and three-dimensional CT analysis of ankle fractures

    International Nuclear Information System (INIS)

    Magid, D.; Fishman, E.K.; Ney, D.R.; Kuhlman, J.E.

    1988-01-01

    CT with coronal and sagittal reformatting (two-dimensional CT) and animated volumetric image rendering (three-dimensional CT) was used to assess ankle fractures. Partial volume limits transaxial CT in assessments of horizontally oriented structures. Two-dimensional CT, being orthogonal to the plafond, superior mortise, talar dome, and tibial epiphysis, often provides the most clinically useful images. Two-dimensional CT is most useful in characterizing potentially confusing fractures, such as Tillaux (anterior tubercle), triplane, osteochondral talar dome, or nondisplaced talar neck fractures, and it is the best study to confirm intraarticular fragments. Two-and three-dimensional CT best indicate the percentage of articular surface involvement and best demonstrate postoperative results or complications (hardware migration, residual step-off, delayed union, DJD, AVN, etc). Animated three-dimensional images are the preferred means of integrating the two-dimensional findings for surgical planning, as these images more closely simulate the clinical problem

  6. On two-dimensionalization of three-dimensional turbulence in shell models

    DEFF Research Database (Denmark)

    Chakraborty, Sagar; Jensen, Mogens Høgh; Sarkar, A.

    2010-01-01

    Applying a modified version of the Gledzer-Ohkitani-Yamada (GOY) shell model, the signatures of so-called two-dimensionalization effect of three-dimensional incompressible, homogeneous, isotropic fully developed unforced turbulence have been studied and reproduced. Within the framework of shell m......-similar PDFs for longitudinal velocity differences are also presented for the rotating 3D turbulence case....

  7. Two-dimensional turbulent convection

    Science.gov (United States)

    Mazzino, Andrea

    2017-11-01

    We present an overview of the most relevant, and sometimes contrasting, theoretical approaches to Rayleigh-Taylor and mean-gradient-forced Rayleigh-Bénard two-dimensional turbulence together with numerical and experimental evidences for their support. The main aim of this overview is to emphasize that, despite the different character of these two systems, especially in relation to their steadiness/unsteadiness, turbulent fluctuations are well described by the same scaling relationships originated from the Bolgiano balance. The latter states that inertial terms and buoyancy terms balance at small scales giving rise to an inverse kinetic energy cascade. The main difference with respect to the inverse energy cascade in hydrodynamic turbulence [R. H. Kraichnan, "Inertial ranges in two-dimensional turbulence," Phys. Fluids 10, 1417 (1967)] is that the rate of cascade of kinetic energy here is not constant along the inertial range of scales. Thanks to the absence of physical boundaries, the two systems here investigated turned out to be a natural physical realization of the Kraichnan scaling regime hitherto associated with the elusive "ultimate state of thermal convection" [R. H. Kraichnan, "Turbulent thermal convection at arbitrary Prandtl number," Phys. Fluids 5, 1374-1389 (1962)].

  8. Two-dimensional PIC-MCC simulation of ion extraction

    International Nuclear Information System (INIS)

    Xiong Jiagui; Wang Dewu

    2000-01-01

    To explore more simple and efficient ion extraction methods used in atomic vapor laser isotope separation (AVLIS), two-dimensional (2D) PIC-MCC simulation code is used to simulate and compare several methods: parallel electrode method, II type electrode method, improved M type electrode method, and radio frequency (RF) resonance method. The simulations show that, the RF resonance method without magnetic field is the best among others, then the improved M type electrode method. The result of simulation of II type electrode method is quite different from that calculated by 2D electron equilibrium model. The RF resonance method with or without magnetic field has guide different results. Strong resonance occurs in the simulation without magnetic field, whereas no significant resonance occurs under weak magnetic field. And that is quite different from the strong resonance phenomena occurring in the 1D PIC simulation with weak magnetic field. As for practical applications, the RF resonance method without magnetic field has pros and cons, compared with the M type electrode method

  9. Large photonic band gaps and strong attenuations of two-segment-connected Peano derivative networks

    International Nuclear Information System (INIS)

    Lu, Jian; Yang, Xiangbo; Zhang, Guogang; Cai, Lianzhang

    2011-01-01

    In this Letter, based on ancient Peano curves we construct four kinds of interesting Peano derivative networks composed of one-dimensional (1D) waveguides and investigate the optical transmission spectra and photonic attenuation behavior of electromagnetic (EM) waves in one- and two-segment-connected networks. It is found that for some two-segment-connected networks large photonic band gaps (PBGs) can be created and the widths of large PBGs can be controlled by adjusting the matching ratio of waveguide length and are insensitive to generation number. Diamond- and hexagon-Peano networks are good selectable structures for the designing of optical devices with large PBG(s) and strong attenuation(s). -- Highlights: → Peano and Peano derivative networks composed of 1D waveguides are designed. → Large PBGs with strong attenuations have been created by these fractal networks. → New approach for designing optical devices with large PBGs is proposed. → Diamond- and hexagon-Peano networks with d2:d1=2:1 are good selectable structures.

  10. Massively parallel multicanonical simulations

    Science.gov (United States)

    Gross, Jonathan; Zierenberg, Johannes; Weigel, Martin; Janke, Wolfhard

    2018-03-01

    Generalized-ensemble Monte Carlo simulations such as the multicanonical method and similar techniques are among the most efficient approaches for simulations of systems undergoing discontinuous phase transitions or with rugged free-energy landscapes. As Markov chain methods, they are inherently serial computationally. It was demonstrated recently, however, that a combination of independent simulations that communicate weight updates at variable intervals allows for the efficient utilization of parallel computational resources for multicanonical simulations. Implementing this approach for the many-thread architecture provided by current generations of graphics processing units (GPUs), we show how it can be efficiently employed with of the order of 104 parallel walkers and beyond, thus constituting a versatile tool for Monte Carlo simulations in the era of massively parallel computing. We provide the fully documented source code for the approach applied to the paradigmatic example of the two-dimensional Ising model as starting point and reference for practitioners in the field.

  11. Efficient Heuristics for the Simulation of Buffer Overflow in Series and Parallel Queueing Networks

    NARCIS (Netherlands)

    Nicola, V.F.; Zaburnenko, T.S.

    2006-01-01

    In this paper we propose state-dependent importance sampling heuristics to estimate the probability of population overflow in Markovian networks of series and parallel queues. These heuristics capture state-dependence along the boundaries (when one or more queues are empty) which is critical for

  12. Phase fluctuations in two coaxial quasi-one-dimensional superconducting cylindrical surfaces serving as a model system for superconducting nanowire bundles

    Energy Technology Data Exchange (ETDEWEB)

    Wong, C.H., E-mail: ch.kh.vong@urfu.ru [Institute of Physics and Technology, Ural Federal University, Clear Water Bay, Kowloon (Russian Federation); Wu, R.P.H., E-mail: pak-hong-raymond.wu@connect.polyu.hk [Department of Applied Physics, The Hong Kong Polytechnic University (Hong Kong); Lortz, R., E-mail: lortz@ust.hk [Department of Physics, Hong Kong University of Science and Technology (Hong Kong)

    2017-03-15

    The dimensional crossover from a 1D fluctuating state at high temperatures to a 3D phase coherent state in the low temperature regime in two coaxial weakly-coupled cylindrical surfaces formed by two-dimensional arrays of parallel nanowires is studied via an 8-state 3D-XY model. This system serves as a model for quasi-one-dimensional superconductors in the form of bundles of weakly-coupled superconducting nanowires. A periodic variation of the dimensional crossover temperature T{sub DC} is observed when the inner superconducting cylindrical surface is rotated in the angular plane. T{sub DC} reaches a maximum when the relative angle between the cylinders is 2.81°, which corresponds to the maximum separation of nanowires between the two cylindrical surfaces. We demonstrate that the relative strength of phase fluctuations in this system is controllable by the rotational angle between the two surfaces with a strong suppression of the fluctuation strength at 2.81°. The phase fluctuations are suppressed gradually upon cooling, before they abruptly vanish below T{sub DC}. Our model thus allows us to study how phase fluctuations can be suppressed in quasi-one-dimensional superconductors in order to achieve a global phase coherent state throughout the nanowire array with zero electric resistance.

  13. Combined spatial/angular domain decomposition SN algorithms for shared memory parallel machines

    International Nuclear Information System (INIS)

    Hunter, M.A.; Haghighat, A.

    1993-01-01

    Several parallel processing algorithms on the basis of spatial and angular domain decomposition methods are developed and incorporated into a two-dimensional discrete ordinates transport theory code. These algorithms divide the spatial and angular domains into independent subdomains so that the flux calculations within each subdomain can be processed simultaneously. Two spatial parallel algorithms (Block-Jacobi, red-black), one angular parallel algorithm (η-level), and their combinations are implemented on an eight processor CRAY Y-MP. Parallel performances of the algorithms are measured using a series of fixed source RZ geometry problems. Some of the results are also compared with those executed on an IBM 3090/600J machine. (orig.)

  14. Parallel computers and three-dimensional computational electromagnetics

    International Nuclear Information System (INIS)

    Madsen, N.K.

    1994-01-01

    The authors have continued to enhance their ability to use new massively parallel processing computers to solve time-domain electromagnetic problems. New vectorization techniques have improved the performance of their code DSI3D by factors of 5 to 15, depending on the computer used. New radiation boundary conditions and far-field transformations now allow the computation of radar cross-section values for complex objects. A new parallel-data extraction code has been developed that allows the extraction of data subsets from large problems, which have been run on parallel computers, for subsequent post-processing on workstations with enhanced graphics capabilities. A new charged-particle-pushing version of DSI3D is under development. Finally, DSI3D has become a focal point for several new Cooperative Research and Development Agreement activities with industrial companies such as Lockheed Advanced Development Company, Varian, Hughes Electron Dynamics Division, General Atomic, and Cray

  15. LPIC++. A parallel one-dimensional relativistic electromagnetic particle-in-cell code for simulating laser-plasma-interaction

    International Nuclear Information System (INIS)

    Lichters, R.; Pfund, R.E.W.; Meyer-ter-Vehn, J.

    1997-08-01

    The code LPIC++ presented here, is based on a one-dimensional, electromagnetic, relativistic PIC code that has originally been developed by one of the authors during a PhD thesis at the Max-Planck-Institut fuer Quantenoptik for kinetic simulations of high harmonic generation from overdense plasma surfaces. The code uses essentially the algorithm of Birdsall and Langdon and Villasenor and Bunemann. It is written in C++ in order to be easily extendable and has been parallelized to be able to grow in power linearly with the size of accessable hardware, e.g. massively parallel machines like Cray T3E. The parallel LPIC++ version uses PVM for communication between processors. PVM is public domain software, can be downloaded from the world wide web. A particular strength of LPIC++ lies in its clear program and data structure, which uses chained lists for the organization of grid cells and enables dynamic adjustment of spatial domain sizes in a very convenient way, and therefore easy balancing of processor loads. Also particles belonging to one cell are linked in a chained list and are immediately accessable from this cell. In addition to this convenient type of data organization in a PIC code, the code shows excellent performance in both its single processor and parallel version. (orig.)

  16. High speed VLSI neural network for high energy physics

    NARCIS (Netherlands)

    Masa, P.; Masa, P.; Hoen, K.; Hoen, Klaas; Wallinga, Hans

    1994-01-01

    A CMOS neural network IC is discussed which was designed for very high speed applications. The parallel architecture, analog computing and digital weight storage provides unprecedented computing speed combined with ease of use. The circuit classifies up to 70 dimensional vectors within 20

  17. Multi-perspective views of students’ difficulties with one-dimensional vector and two-dimensional vector

    Science.gov (United States)

    Fauzi, Ahmad; Ratna Kawuri, Kunthi; Pratiwi, Retno

    2017-01-01

    Researchers of students’ conceptual change usually collects data from written tests and interviews. Moreover, reports of conceptual change often simply refer to changes in concepts, such as on a test, without any identification of the learning processes that have taken place. Research has shown that students have difficulties with vectors in university introductory physics courses and high school physics courses. In this study, we intended to explore students’ understanding of one-dimensional and two-dimensional vector in multi perspective views. In this research, we explore students’ understanding through test perspective and interviews perspective. Our research study adopted the mixed-methodology design. The participants of this research were sixty students of third semester of physics education department. The data of this research were collected by testand interviews. In this study, we divided the students’ understanding of one-dimensional vector and two-dimensional vector in two categories, namely vector skills of the addition of one-dimensionaland two-dimensional vector and the relation between vector skills and conceptual understanding. From the investigation, only 44% of students provided correct answer for vector skills of the addition of one-dimensional and two-dimensional vector and only 27% students provided correct answer for the relation between vector skills and conceptual understanding.

  18. Research overview of real-time monitoring system for micro leak of three-dimensional pipe network

    Directory of Open Access Journals (Sweden)

    Shaofeng WANG

    2016-04-01

    Full Text Available Aiming at the key technical problems encountered by domestic and foreign scholars in building the real-time monitoring system for the micro leak of three-dimensional pipe networks, the paper classifies the problems into three aspects: 1 in the extraction of fault signal frequency, how to avoid the effect of the mixed echo stack and improve the delay estimation accuracy of the correlation; 2 in network bifurcation structure, how to discern the signal propagation path, and how to locate the leak source; 3 under the uncertainly delay in transmitting and receiving information data, how to ensure the time synchronization accuracy of the real-time monitoring system for the three-dimensional pipe network leakage. Through the comparison of the monitoring technologies for the pipe network leakage at home and abroad, it shows that the acoustic emission sensor network based three-dimensional pipeline leak real-time monitoring has great advantages in detecting the weak leakage of flammable and explosive gas/liquid transportation pipelines.

  19. Stratified steady and unsteady two-phase flows between two parallel plates

    International Nuclear Information System (INIS)

    Sim, Woo Gun

    2006-01-01

    To understand fluid dynamic forces acting on a structure subjected to two-phase flow, it is essential to get detailed information about the characteristics of two-phase flow. Stratified steady and unsteady two-phase flows between two parallel plates have been studied to investigate the general characteristics of the flow related to flow-induced vibration. Based on the spectral collocation method, a numerical approach has been developed for the unsteady two-phase flow. The method is validated by comparing numerical result to analytical one given for a simple harmonic two-phase flow. The flow parameters for the steady two-phase flow, such as void fraction and two-phase frictional multiplier, are evaluated. The dynamic characteristics of the unsteady two-phase flow, including the void fraction effect on the complex unsteady pressure, are illustrated

  20. Optimizing separations in online comprehensive two-dimensional liquid chromatography.

    Science.gov (United States)

    Pirok, Bob W J; Gargano, Andrea F G; Schoenmakers, Peter J

    2018-01-01

    Online comprehensive two-dimensional liquid chromatography has become an attractive option for the analysis of complex nonvolatile samples found in various fields (e.g. environmental studies, food, life, and polymer sciences). Two-dimensional liquid chromatography complements the highly popular hyphenated systems that combine liquid chromatography with mass spectrometry. Two-dimensional liquid chromatography is also applied to the analysis of samples that are not compatible with mass spectrometry (e.g. high-molecular-weight polymers), providing important information on the distribution of the sample components along chemical dimensions (molecular weight, charge, lipophilicity, stereochemistry, etc.). Also, in comparison with conventional one-dimensional liquid chromatography, two-dimensional liquid chromatography provides a greater separation power (peak capacity). Because of the additional selectivity and higher peak capacity, the combination of two-dimensional liquid chromatography with mass spectrometry allows for simpler mixtures of compounds to be introduced in the ion source at any given time, improving quantitative analysis by reducing matrix effects. In this review, we summarize the rationale and principles of two-dimensional liquid chromatography experiments, describe advantages and disadvantages of combining different selectivities and discuss strategies to improve the quality of two-dimensional liquid chromatography separations. © 2017 The Authors. Journal of Separation Science published by WILEY-VCH Verlag GmbH & Co. KGaA.

  1. Distributed Processing System for Restoration of Electric Power Distribution Network Using Two-Layered Contract Net Protocol

    Science.gov (United States)

    Kodama, Yu; Hamagami, Tomoki

    Distributed processing system for restoration of electric power distribution network using two-layered CNP is proposed. The goal of this study is to develop the restoration system which adjusts to the future power network with distributed generators. The state of the art of this study is that the two-layered CNP is applied for the distributed computing environment in practical use. The two-layered CNP has two classes of agents, named field agent and operating agent in the network. In order to avoid conflicts of tasks, operating agent controls privilege for managers to send the task announcement messages in CNP. This technique realizes the coordination between agents which work asynchronously in parallel with others. Moreover, this study implements the distributed processing system using a de-fact standard multi-agent framework, JADE(Java Agent DEvelopment framework). This study conducts the simulation experiments of power distribution network restoration and compares the proposed system with the previous system. We confirmed the results show effectiveness of the proposed system.

  2. Electron-phonon heat exchange in quasi-two-dimensional nanolayers

    Science.gov (United States)

    Anghel, Dragos-Victor; Cojocaru, Sergiu

    2017-12-01

    We study the heat power P transferred between electrons and phonons in thin metallic films deposited on free-standing dielectric membranes. The temperature range is typically below 1 K, such that the wavelengths of the excited phonon modes in the system is large enough so that the picture of a quasi-two-dimensional phonon gas is applicable. Moreover, due to the quantization of the components of the electron wavevectors perpendicular to the metal film's surface, the electrons spectrum forms also quasi two-dimensional sub-bands, as in a quantum well (QW). We describe in detail the contribution to the electron-phonon energy exchange of different electron scattering channels, as well as of different types of phonon modes. We find that heat flux oscillates strongly with thickness of the film d while having a much smoother variation with temperature (Te for the electrons temperature and Tph for the phonons temperature), so that one obtains a ridge-like landscape in the two coordinates, (d, Te) or (d, Tph), with crests and valleys aligned roughly parallel to the temperature axis. For the valley regions we find P ∝ Te3.5 - Tph3.5. From valley to crest, P increases by more than one order of magnitude and on the crests P cannot be represented by a simple power law. The strong dependence of P on d is indicative of the formation of the QW state and can be useful in controlling the heat transfer between electrons and crystal lattice in nano-electronic devices. Nevertheless, due to the small value of the Fermi wavelength in metals, the surface imperfections of the metallic films can reduce the magnitude of the oscillations of P vs. d, so this effect might be easier to observe experimentally in doped semiconductors.

  3. The dimensionality of ecological networks

    DEFF Research Database (Denmark)

    Eklöf, Anna; Jacob, Ute; Kopp, Jason

    2013-01-01

    How many dimensions (trait-axes) are required to predict whether two species interact? This unanswered question originated with the idea of ecological niches, and yet bears relevance today for understanding what determines network structure. Here, we analyse a set of 200 ecological networks......, including food webs, antagonistic and mutualistic networks, and find that the number of dimensions needed to completely explain all interactions is small (... the most to explaining network structure. We show that accounting for a few traits dramatically improves our understanding of the structure of ecological networks. Matching traits for resources and consumers, for example, fruit size and bill gape, are the most successful combinations. These results link...

  4. IQ imbalance tolerable parallel-channel DMT transmission for coherent optical OFDMA access network

    Science.gov (United States)

    Jung, Sang-Min; Mun, Kyoung-Hak; Jung, Sun-Young; Han, Sang-Kook

    2016-12-01

    Phase diversity of coherent optical communication provides spectrally efficient higher-order modulation for optical communications. However, in-phase/quadrature (IQ) imbalance in coherent optical communication degrades transmission performance by introducing unwanted signal distortions. In a coherent optical orthogonal frequency division multiple access (OFDMA) passive optical network (PON), IQ imbalance-induced signal distortions degrade transmission performance by interferences of mirror subcarriers, inter-symbol interference (ISI), and inter-channel interference (ICI). We propose parallel-channel discrete multitone (DMT) transmission to mitigate transceiver IQ imbalance-induced signal distortions in coherent orthogonal frequency division multiplexing (OFDM) transmissions. We experimentally demonstrate the effectiveness of parallel-channel DMT transmission compared with that of OFDM transmission in the presence of IQ imbalance.

  5. Parallelization characteristics of the DeCART code

    International Nuclear Information System (INIS)

    Cho, J. Y.; Joo, H. G.; Kim, H. Y.; Lee, C. C.; Chang, M. H.; Zee, S. Q.

    2003-12-01

    This report is to describe the parallelization characteristics of the DeCART code and also examine its parallel performance. Parallel computing algorithms are implemented to DeCART to reduce the tremendous computational burden and memory requirement involved in the three-dimensional whole core transport calculation. In the parallelization of the DeCART code, the axial domain decomposition is first realized by using MPI (Message Passing Interface), and then the azimuthal angle domain decomposition by using either MPI or OpenMP. When using the MPI for both the axial and the angle domain decomposition, the concept of MPI grouping is employed for convenient communication in each communication world. For the parallel computation, most of all the computing modules except for the thermal hydraulic module are parallelized. These parallelized computing modules include the MOC ray tracing, CMFD, NEM, region-wise cross section preparation and cell homogenization modules. For the distributed allocation, most of all the MOC and CMFD/NEM variables are allocated only for the assigned planes, which reduces the required memory by a ratio of the number of the assigned planes to the number of all planes. The parallel performance of the DeCART code is evaluated by solving two problems, a rodded variation of the C5G7 MOX three-dimensional benchmark problem and a simplified three-dimensional SMART PWR core problem. In the aspect of parallel performance, the DeCART code shows a good speedup of about 40.1 and 22.4 in the ray tracing module and about 37.3 and 20.2 in the total computing time when using 48 CPUs on the IBM Regatta and 24 CPUs on the LINUX cluster, respectively. In the comparison between the MPI and OpenMP, OpenMP shows a somewhat better performance than MPI. Therefore, it is concluded that the first priority in the parallel computation of the DeCART code is in the axial domain decomposition by using MPI, and then in the angular domain using OpenMP, and finally the angular

  6. Two-dimensional silica opens new perspectives

    Science.gov (United States)

    Büchner, Christin; Heyde, Markus

    2017-12-01

    In recent years, silica films have emerged as a novel class of two-dimensional (2D) materials. Several groups succeeded in epitaxial growth of ultrathin SiO2 layers using different growth methods and various substrates. The structures consist of tetrahedral [SiO4] building blocks in two mirror symmetrical planes, connected via oxygen bridges. This arrangement is called a silica bilayer as it is the thinnest 2D arrangement with the stoichiometry SiO2 known today. With all bonds saturated within the nano-sheet, the interaction with the substrate is based on van der Waals forces. Complex ring networks are observed, including hexagonal honeycomb lattices, point defects and domain boundaries, as well as amorphous domains. The network structures are highly tuneable through variation of the substrate, deposition parameters, cooling procedure, introducing dopants or intercalating small species. The amorphous networks and structural defects were resolved with atomic resolution microscopy and modeled with density functional theory and molecular dynamics. Such data contribute to our understanding of the formation and characteristic motifs of glassy systems. Growth studies and doping with other chemical elements reveal ways to tune ring sizes and defects as well as chemical reactivities. The pristine films have been utilized as molecular sieves and for confining molecules in nanocatalysis. Post growth hydroxylation can be used to tweak the reactivity as well. The electronic properties of silica bilayers are favourable for using silica as insulators in 2D material stacks. Due to the fully saturated atomic structure, the bilayer interacts weakly with the substrate and can be described as quasi-freestanding. Recently, a mm-scale film transfer under structure retention has been demonstrated. The chemical and mechanical stability of silica bilayers is very promising for technological applications in 2D heterostacks. Due to the impact of this bilayer system for glass science

  7. Two-dimensional liquid chromatography

    DEFF Research Database (Denmark)

    Græsbøll, Rune

    -dimensional separation space. Optimization of gradients in online RP×RP is more difficult than in normal HPLC as a result of the increased number of parameters and their influence on each other. Modeling the coverage of the compounds across the two-dimensional chromatogram as a result of a change in gradients could...... be used for optimization purposes, and reduce the time spend on optimization. In this thesis (chapter 6), and manuscript B, a measure of the coverage of the compounds in the twodimensional separation space is defined. It is then shown that this measure can be modeled for changes in the gradient in both...

  8. Two-dimensional simulation of sintering process

    International Nuclear Information System (INIS)

    Vasconcelos, Vanderley de; Pinto, Lucio Carlos Martins; Vasconcelos, Wander L.

    1996-01-01

    The results of two-dimensional simulations are directly applied to systems in which one of the dimensions is much smaller than the others, and to sections of three dimensional models. Moreover, these simulations are the first step of the analysis of more complex three-dimensional systems. In this work, two basic features of the sintering process are studied: the types of particle size distributions related to the powder production processes and the evolution of geometric parameters of the resultant microstructures during the solid-state sintering. Random packing of equal spheres is considered in the sintering simulation. The packing algorithm does not take into account the interactive forces between the particles. The used sintering algorithm causes the densification of the particle set. (author)

  9. Image matrix processor for fast multi-dimensional computations

    Science.gov (United States)

    Roberson, George P.; Skeate, Michael F.

    1996-01-01

    An apparatus for multi-dimensional computation which comprises a computation engine, including a plurality of processing modules. The processing modules are configured in parallel and compute respective contributions to a computed multi-dimensional image of respective two dimensional data sets. A high-speed, parallel access storage system is provided which stores the multi-dimensional data sets, and a switching circuit routes the data among the processing modules in the computation engine and the storage system. A data acquisition port receives the two dimensional data sets representing projections through an image, for reconstruction algorithms such as encountered in computerized tomography. The processing modules include a programmable local host, by which they may be configured to execute a plurality of different types of multi-dimensional algorithms. The processing modules thus include an image manipulation processor, which includes a source cache, a target cache, a coefficient table, and control software for executing image transformation routines using data in the source cache and the coefficient table and loading resulting data in the target cache. The local host processor operates to load the source cache with a two dimensional data set, loads the coefficient table, and transfers resulting data out of the target cache to the storage system, or to another destination.

  10. Chaotic dynamics in two-dimensional noninvertible maps

    CERN Document Server

    Mira, Christian; Cathala, Jean-Claude; Gardini, Laura

    1996-01-01

    This book is essentially devoted to complex properties (Phase plane structure and bifurcations) of two-dimensional noninvertible maps, i.e. maps having either a non-unique inverse, or no real inverse, according to the plane point. They constitute models of sets of discrete dynamical systems encountered in Engineering (Control, Signal Processing, Electronics), Physics, Economics, Life Sciences. Compared to the studies made in the one-dimensional case, the two-dimensional situation remained a long time in an underdeveloped state. It is only since these last years that the interest for this resea

  11. Application of a method for comparing one-dimensional and two-dimensional models of a ground-water flow system

    International Nuclear Information System (INIS)

    Naymik, T.G.

    1978-01-01

    To evaluate the inability of a one-dimensional ground-water model to interact continuously with surrounding hydraulic head gradients, simulations using one-dimensional and two-dimensional ground-water flow models were compared. This approach used two types of models: flow-conserving one-and-two dimensional models, and one-dimensional and two-dimensional models designed to yield two-dimensional solutions. The hydraulic conductivities of controlling features were varied and model comparison was based on the travel times of marker particles. The solutions within each of the two model types compare reasonably well, but a three-dimensional solution is required to quantify the comparison

  12. Two-dimensional distributed-phase-reference protocol for quantum key distribution

    DEFF Research Database (Denmark)

    Bacco, Davide; Christensen, Jesper Bjerge; Usuga Castaneda, Mario A.

    2016-01-01

    10 years, long-distance fiber-based DPR systems have been successfully demonstrated, although fundamental obstacles such as intrinsic channel losses limit their performance. Here, we introduce the first two-dimensional DPR-QKD protocol in which information is encoded in the time and phase of weak......Quantum key distribution (QKD) and quantum communication enable the secure exchange of information between remote parties. Currently, the distributed-phase-reference (DPR) protocols, which are based on weak coherent pulses, are among the most practical solutions for long-range QKD. During the last...... coherent pulses. The ability of extracting two bits of information per detection event, enables a higher secret key rate in specific realistic network scenarios. Moreover, despite the use of more dimensions, the proposed protocol remains simple, practical, and fully integrable....

  13. Two-dimensional distributed-phase-reference protocol for quantum key distribution

    Science.gov (United States)

    Bacco, Davide; Christensen, Jesper Bjerge; Castaneda, Mario A. Usuga; Ding, Yunhong; Forchhammer, Søren; Rottwitt, Karsten; Oxenløwe, Leif Katsuo

    2016-12-01

    Quantum key distribution (QKD) and quantum communication enable the secure exchange of information between remote parties. Currently, the distributed-phase-reference (DPR) protocols, which are based on weak coherent pulses, are among the most practical solutions for long-range QKD. During the last 10 years, long-distance fiber-based DPR systems have been successfully demonstrated, although fundamental obstacles such as intrinsic channel losses limit their performance. Here, we introduce the first two-dimensional DPR-QKD protocol in which information is encoded in the time and phase of weak coherent pulses. The ability of extracting two bits of information per detection event, enables a higher secret key rate in specific realistic network scenarios. Moreover, despite the use of more dimensions, the proposed protocol remains simple, practical, and fully integrable.

  14. An object-oriented programming paradigm for parallelization of computational fluid dynamics

    International Nuclear Information System (INIS)

    Ohta, Takashi.

    1997-03-01

    We propose an object-oriented programming paradigm for parallelization of scientific computing programs, and show that the approach can be a very useful strategy. Generally, parallelization of scientific programs tends to be complicated and unportable due to the specific requirements of each parallel computer or compiler. In this paper, we show that the object-oriented programming design, which separates the parallel processing parts from the solver of the applications, can achieve the large improvement in the maintenance of the codes, as well as the high portability. We design the program for the two-dimensional Euler equations according to the paradigm, and evaluate the parallel performance on IBM SP2. (author)

  15. Parallel ray tracing for one-dimensional discrete ordinate computations

    International Nuclear Information System (INIS)

    Jarvis, R.D.; Nelson, P.

    1996-01-01

    The ray-tracing sweep in discrete-ordinates, spatially discrete numerical approximation methods applied to the linear, steady-state, plane-parallel, mono-energetic, azimuthally symmetric, neutral-particle transport equation can be reduced to a parallel prefix computation. In so doing, the often severe penalty in convergence rate of the source iteration, suffered by most current parallel algorithms using spatial domain decomposition, can be avoided while attaining parallelism in the spatial domain to whatever extent desired. In addition, the reduction implies parallel algorithm complexity limits for the ray-tracing sweep. The reduction applies to all closed, linear, one-cell functional (CLOF) spatial approximation methods, which encompasses most in current popular use. Scalability test results of an implementation of the algorithm on a 64-node nCube-2S hypercube-connected, message-passing, multi-computer are described. (author)

  16. Fast parallel approach for 2-D DHT-based real-valued discrete Gabor transform.

    Science.gov (United States)

    Tao, Liang; Kwan, Hon Keung

    2009-12-01

    Two-dimensional fast Gabor transform algorithms are useful for real-time applications due to the high computational complexity of the traditional 2-D complex-valued discrete Gabor transform (CDGT). This paper presents two block time-recursive algorithms for 2-D DHT-based real-valued discrete Gabor transform (RDGT) and its inverse transform and develops a fast parallel approach for the implementation of the two algorithms. The computational complexity of the proposed parallel approach is analyzed and compared with that of the existing 2-D CDGT algorithms. The results indicate that the proposed parallel approach is attractive for real time image processing.

  17. Two-Dimensional Key Table-Based Group Key Distribution in Advanced Metering Infrastructure

    Directory of Open Access Journals (Sweden)

    Woong Go

    2014-01-01

    Full Text Available A smart grid provides two-way communication by using the information and communication technology. In order to establish two-way communication, the advanced metering infrastructure (AMI is used in the smart grid as the core infrastructure. This infrastructure consists of smart meters, data collection units, maintenance data management systems, and so on. However, potential security problems of the AMI increase owing to the application of the public network. This is because the transmitted information is electricity consumption data for charging. Thus, in order to establish a secure connection to transmit electricity consumption data, encryption is necessary, for which key distribution is required. Further, a group key is more efficient than a pairwise key in the hierarchical structure of the AMI. Therefore, we propose a group key distribution scheme using a two-dimensional key table through the analysis result of the sensor network group key distribution scheme. The proposed scheme has three phases: group key predistribution, selection of group key generation element, and generation of group key.

  18. A novel two-level dynamic parallel data scheme for large 3-D SN calculations

    International Nuclear Information System (INIS)

    Sjoden, G.E.; Shedlock, D.; Haghighat, A.; Yi, C.

    2005-01-01

    We introduce a new dynamic parallel memory optimization scheme for executing large scale 3-D discrete ordinates (Sn) simulations on distributed memory parallel computers. In order for parallel transport codes to be truly scalable, they must use parallel data storage, where only the variables that are locally computed are locally stored. Even with parallel data storage for the angular variables, cumulative storage requirements for large discrete ordinates calculations can be prohibitive. To address this problem, Memory Tuning has been implemented into the PENTRAN 3-D parallel discrete ordinates code as an optimized, two-level ('large' array, 'small' array) parallel data storage scheme. Memory Tuning can be described as the process of parallel data memory optimization. Memory Tuning dynamically minimizes the amount of required parallel data in allocated memory on each processor using a statistical sampling algorithm. This algorithm is based on the integral average and standard deviation of the number of fine meshes contained in each coarse mesh in the global problem. Because PENTRAN only stores the locally computed problem phase space, optimal two-level memory assignments can be unique on each node, depending upon the parallel decomposition used (hybrid combinations of angular, energy, or spatial). As demonstrated in the two large discrete ordinates models presented (a storage cask and an OECD MOX Benchmark), Memory Tuning can save a substantial amount of memory per parallel processor, allowing one to accomplish very large scale Sn computations. (authors)

  19. Two-dimensional analytic weighting functions for limb scattering

    Science.gov (United States)

    Zawada, D. J.; Bourassa, A. E.; Degenstein, D. A.

    2017-10-01

    Through the inversion of limb scatter measurements it is possible to obtain vertical profiles of trace species in the atmosphere. Many of these inversion methods require what is often referred to as weighting functions, or derivatives of the radiance with respect to concentrations of trace species in the atmosphere. Several radiative transfer models have implemented analytic methods to calculate weighting functions, alleviating the computational burden of traditional numerical perturbation methods. Here we describe the implementation of analytic two-dimensional weighting functions, where derivatives are calculated relative to atmospheric constituents in a two-dimensional grid of altitude and angle along the line of sight direction, in the SASKTRAN-HR radiative transfer model. Two-dimensional weighting functions are required for two-dimensional inversions of limb scatter measurements. Examples are presented where the analytic two-dimensional weighting functions are calculated with an underlying one-dimensional atmosphere. It is shown that the analytic weighting functions are more accurate than ones calculated with a single scatter approximation, and are orders of magnitude faster than a typical perturbation method. Evidence is presented that weighting functions for stratospheric aerosols calculated under a single scatter approximation may not be suitable for use in retrieval algorithms under solar backscatter conditions.

  20. Ultrascalable petaflop parallel supercomputer

    Science.gov (United States)

    Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Chiu, George [Cross River, NY; Cipolla, Thomas M [Katonah, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Hall, Shawn [Pleasantville, NY; Haring, Rudolf A [Cortlandt Manor, NY; Heidelberger, Philip [Cortlandt Manor, NY; Kopcsay, Gerard V [Yorktown Heights, NY; Ohmacht, Martin [Yorktown Heights, NY; Salapura, Valentina [Chappaqua, NY; Sugavanam, Krishnan [Mahopac, NY; Takken, Todd [Brewster, NY

    2010-07-20

    A massively parallel supercomputer of petaOPS-scale includes node architectures based upon System-On-a-Chip technology, where each processing node comprises a single Application Specific Integrated Circuit (ASIC) having up to four processing elements. The ASIC nodes are interconnected by multiple independent networks that optimally maximize the throughput of packet communications between nodes with minimal latency. The multiple networks may include three high-speed networks for parallel algorithm message passing including a Torus, collective network, and a Global Asynchronous network that provides global barrier and notification functions. These multiple independent networks may be collaboratively or independently utilized according to the needs or phases of an algorithm for optimizing algorithm processing performance. The use of a DMA engine is provided to facilitate message passing among the nodes without the expenditure of processing resources at the node.

  1. The finite element solution of two-dimensional transverse magnetic scattering problems on the connection machine

    International Nuclear Information System (INIS)

    Hutchinson, S.; Costillo, S.; Dalton, K.; Hensel, E.

    1990-01-01

    A study is conducted of the finite element solution of the partial differential equations governing two-dimensional electromagnetic field scattering problems on a SIMD computer. A nodal assembly technique is introduced which maps a single node to a single processor. The physical domain is first discretized in parallel to yield the node locations of an O-grid mesh. Next, the system of equations is assembled and then solved in parallel using a conjugate gradient algorithm for complex-valued, non-symmetric, non-positive definite systems. Using this technique and Thinking Machines Corporation's Connection Machine-2 (CM-2), problems with more than 250k nodes are solved. Results of electromagnetic scattering, governed by the 2-d scalar Hemoholtz wave equations are presented in this paper. Solutions are demonstrated for a wide range of objects. A summary of performance data is given for the set of test problems

  2. Depth-enhanced three-dimensional-two-dimensional convertible display based on modified integral imaging.

    Science.gov (United States)

    Park, Jae-Hyeung; Kim, Hak-Rin; Kim, Yunhee; Kim, Joohwan; Hong, Jisoo; Lee, Sin-Doo; Lee, Byoungho

    2004-12-01

    A depth-enhanced three-dimensional-two-dimensional convertible display that uses a polymer-dispersed liquid crystal based on the principle of integral imaging is proposed. In the proposed method, a lens array is located behind a transmission-type display panel to form an array of point-light sources, and a polymer-dispersed liquid crystal is electrically controlled to pass or to scatter light coming from these point-light sources. Therefore, three-dimensional-two-dimensional conversion is accomplished electrically without any mechanical movement. Moreover, the nonimaging structure of the proposed method increases the expressible depth range considerably. We explain the method of operation and present experimental results.

  3. Two-dimensional Nonlinear Simulations of Temperature-anisotropy Instabilities with a Proton-alpha Drift

    Science.gov (United States)

    Markovskii, S. A.; Chandran, Benjamin D. G.; Vasquez, Bernard J.

    2018-04-01

    We present two-dimensional hybrid simulations of proton-cyclotron and mirror instabilities in a proton-alpha plasma with particle-in-cell ions and a neutralizing electron fluid. The instabilities are driven by the protons with temperature perpendicular to the background magnetic field larger than the parallel temperature. The alpha particles with initially isotropic temperature have a nonzero drift speed with respect to the protons. The minor ions are known to influence the relative effect of the proton-cyclotron and mirror instabilities. In this paper, we show that the mirror mode can dominate the power spectrum at the nonlinear stage even if its linear growth rate is significantly lower than that of the proton-cyclotron mode. The proton-cyclotron instability combined with the alpha-proton drift is a possible cause of the nonzero magnetic helicity observed in the solar wind for fluctuations propagating nearly parallel to the magnetic field. Our simulations generally confirm this concept but reveal a complex helicity spectrum that is not anticipated from the linear theory of the instability.

  4. Dissipation, Voltage Profile and Levy Dragon in a Special Ladder Network

    Science.gov (United States)

    Ucak, C.

    2009-01-01

    A ladder network constructed by an elementary two-terminal network consisting of a parallel resistor-inductor block in series with a parallel resistor-capacitor block sometimes is said to have a non-dispersive dissipative response. This special ladder network is created iteratively by replacing the elementary two-terminal network in place of the…

  5. UNVEILING A NETWORK OF PARALLEL FILAMENTS IN THE INFRARED DARK CLOUD G14.225–0.506

    International Nuclear Information System (INIS)

    Busquet, Gemma; Zhang, Qizhou; Ho, Paul T. P.; Palau, Aina; Girart, Josep M.; Liu, Hauyu Baobab; Sánchez-Monge, Álvaro; Estalella, Robert; De Gregorio-Monsalvo, Itziar; Pillai, Thushara; Wyrowski, Friedrich; Santos, Fábio P.; Franco, Gabriel A. P.

    2013-01-01

    We present the results of combined NH 3 (1,1) and (2,2) line emission observed with the Very Large Array and the Effelsberg 100 m telescope of the infrared dark cloud G14.225–0.506. The NH 3 emission reveals a network of filaments constituting two hub-filament systems. Hubs are associated with gas of rotational temperature T rot ∼ 15 K, non-thermal velocity dispersion σ NT ∼ 1 km s –1 , and exhibit signs of star formation, while filaments appear to be more quiescent (T rot ∼ 11 K and σ NT ∼ 0.6 km s –1 ). Filaments are parallel in projection and distributed mainly along two directions, at P.A. ∼ 10° and 60°, and appear to be coherent in velocity. The averaged projected separation between adjacent filaments is between 0.5 pc and 1 pc, and the mean width of filaments is 0.12 pc. Cores within filaments are separated by ∼0.33 ± 0.09 pc, which is consistent with the predicted fragmentation of an isothermal gas cylinder due to the s ausage - type instability. The network of parallel filaments observed in G14.225–0.506 is consistent with the gravitational instability of a thin gas layer threaded by magnetic fields. Overall, our data suggest that magnetic fields might play an important role in the alignment of filaments, and polarization measurements in the entire cloud would lend further support to this scenario.

  6. Parallel ecological networks in ecosystems

    Science.gov (United States)

    Olff, Han; Alonso, David; Berg, Matty P.; Eriksson, B. Klemens; Loreau, Michel; Piersma, Theunis; Rooney, Neil

    2009-01-01

    In ecosystems, species interact with other species directly and through abiotic factors in multiple ways, often forming complex networks of various types of ecological interaction. Out of this suite of interactions, predator–prey interactions have received most attention. The resulting food webs, however, will always operate simultaneously with networks based on other types of ecological interaction, such as through the activities of ecosystem engineers or mutualistic interactions. Little is known about how to classify, organize and quantify these other ecological networks and their mutual interplay. The aim of this paper is to provide new and testable ideas on how to understand and model ecosystems in which many different types of ecological interaction operate simultaneously. We approach this problem by first identifying six main types of interaction that operate within ecosystems, of which food web interactions are one. Then, we propose that food webs are structured among two main axes of organization: a vertical (classic) axis representing trophic position and a new horizontal ‘ecological stoichiometry’ axis representing decreasing palatability of plant parts and detritus for herbivores and detrivores and slower turnover times. The usefulness of these new ideas is then explored with three very different ecosystems as test cases: temperate intertidal mudflats; temperate short grass prairie; and tropical savannah. PMID:19451126

  7. Parallel knock-out schemes in networks

    NARCIS (Netherlands)

    Broersma, H.J.; Fomin, F.V.; Woeginger, G.J.

    2004-01-01

    We consider parallel knock-out schemes, a procedure on graphs introduced by Lampert and Slater in 1997 in which each vertex eliminates exactly one of its neighbors in each round. We are considering cases in which after a finite number of rounds, where the minimimum number is called the parallel

  8. Two-dimensional readout system for radiation detector

    International Nuclear Information System (INIS)

    Lee, L.Y.

    1975-01-01

    A two dimensional readout system has been provided for reading out locations of scintillations produced in a scintillation type radiation detector array wherein strips of scintillator material are arranged in a parallel planar array. Two sets of light guides are placed perpendicular to the scintillator strips, one on the top and one on the bottom to extend in alignment across the strips. Both the top and bottom guides are composed of a number of 90 0 triangular prisms with the lateral side forming the hypotenuse equal to twice the width of a scintillator strip. The prism system reflects light from a scintillation along one of the strips back and forth through adjacent strips to light pipes coupled to the outermost strips of the detector array which transmit light pulses to appropriate detectors to determine the scintillation along one axis. Other light pipes are connected to the end portions of the strips to transmit light from the individual strips to appropriate light detectors to indicate the particular strip activated, thereby determining the position of a scintillation along the other axis. The number of light guide pairs may be equal the number of the scintillation strips when equal spatial resolution for each of the two coordinates is desired. When the scintillator array detects an event which produces a scintillation along one of the strips, the emitted light travels along four different paths, two of which are along the strip, and two of which are through the light guide pair perpendicular to the strips until all four beams reach the outer edges of the array where they may be transmitted to light detectors by means of light pipes connected therebetween according to a binary code for direct digital readout. (U.S.)

  9. Functional inks and printing of two-dimensional materials.

    Science.gov (United States)

    Hu, Guohua; Kang, Joohoon; Ng, Leonard W T; Zhu, Xiaoxi; Howe, Richard C T; Jones, Christopher G; Hersam, Mark C; Hasan, Tawfique

    2018-05-08

    Graphene and related two-dimensional materials provide an ideal platform for next generation disruptive technologies and applications. Exploiting these solution-processed two-dimensional materials in printing can accelerate this development by allowing additive patterning on both rigid and conformable substrates for flexible device design and large-scale, high-speed, cost-effective manufacturing. In this review, we summarise the current progress on ink formulation of two-dimensional materials and the printable applications enabled by them. We also present our perspectives on their research and technological future prospects.

  10. A Study on Group Key Agreement in Sensor Network Environments Using Two-Dimensional Arrays

    Science.gov (United States)

    Jang, Seung-Jae; Lee, Young-Gu; Lee, Kwang-Hyung; Kim, Tai-Hoon; Jun, Moon-Seog

    2011-01-01

    These days, with the emergence of the concept of ubiquitous computing, sensor networks that collect, analyze and process all the information through the sensors have become of huge interest. However, sensor network technology fundamentally has wireless communication infrastructure as its foundation and thus has security weakness and limitations such as low computing capacity, power supply limitations and price. In this paper, and considering the characteristics of the sensor network environment, we propose a group key agreement method using a keyset pre-distribution of two-dimension arrays that should minimize the exposure of key and personal information. The key collision problems are resolved by utilizing a polygonal shape’s center of gravity. The method shows that calculating a polygonal shape’s center of gravity only requires a very small amount of calculations from the users. The simple calculation not only increases the group key generation efficiency, but also enhances the sense of security by protecting information between nodes. PMID:22164072

  11. A Study on Group Key Agreement in Sensor Network Environments Using Two-Dimensional Arrays

    Directory of Open Access Journals (Sweden)

    Moon-Seog Jun

    2011-08-01

    Full Text Available These days, with the emergence of the concept of ubiquitous computing, sensor networks that collect, analyze and process all the information through the sensors have become of huge interest. However, sensor network technology fundamentally has wireless communication infrastructure as its foundation and thus has security weakness and limitations such as low computing capacity, power supply limitations and price. In this paper, and considering the characteristics of the sensor network environment, we propose a group key agreement method using a keyset pre-distribution of two-dimension arrays that should minimize the exposure of key and personal information. The key collision problems are resolved by utilizing a polygonal shape’s center of gravity. The method shows that calculating a polygonal shape’s center of gravity only requires a very small amount of calculations from the users. The simple calculation not only increases the group key generation efficiency, but also enhances the sense of security by protecting information between nodes.

  12. Parallel alternating direction preconditioner for isogeometric simulations of explicit dynamics

    KAUST Repository

    Łoś, Marcin

    2015-04-27

    In this paper we present a parallel implementation of the alternating direction preconditioner for isogeometric simulations of explicit dynamics. The Alternating Direction Implicit (ADI) algorithm, belongs to the category of matrix-splitting iterative methods, was proposed almost six decades ago for solving parabolic and elliptic partial differential equations, see [1–4]. The new version of this algorithm has been recently developed for isogeometric simulations of two dimensional explicit dynamics [5] and steady-state diffusion equations with orthotropic heterogenous coefficients [6]. In this paper we present a parallel version of the alternating direction implicit algorithm for three dimensional simulations. The algorithm has been incorporated as a part of PETIGA an isogeometric framework [7] build on top of PETSc [8]. We show the scalability of the parallel algorithm on STAMPEDE linux cluster up to 10,000 processors, as well as the convergence rate of the PCG solver with ADI algorithm as preconditioner.

  13. K-FIX: a computer program for transient, two-dimensional, two-fluid flow. THREED: an extension of the K-FIX code for three-dimensional calculations

    International Nuclear Information System (INIS)

    Rivard, W.C.; Torrey, M.D.

    1978-10-01

    The transient, two-dimensional, two-fluid code K-FIX has been extended to perform three-dimensional calculations. This capability is achieved by adding five modification sets of FORTRAN statements to the basic two-dimensional code. The modifications are listed and described, and a complete listing of the three-dimensional code is provided. Results of an example problem are provided for verification

  14. Network marketing on a small-world network

    Science.gov (United States)

    Kim, Beom Jun; Jun, Tackseung; Kim, Jeong-Yoo; Choi, M. Y.

    2006-02-01

    We investigate a dynamic model of network marketing in a small-world network structure artificially constructed similarly to the Watts-Strogatz network model. Different from the traditional marketing, consumers can also play the role of the manufacturer's selling agents in network marketing, which is stimulated by the referral fee the manufacturer offers. As the wiring probability α is increased from zero to unity, the network changes from the one-dimensional regular directed network to the star network where all but one player are connected to one consumer. The price p of the product and the referral fee r are used as free parameters to maximize the profit of the manufacturer. It is observed that at α=0 the maximized profit is constant independent of the network size N while at α≠0, it increases linearly with N. This is in parallel to the small-world transition. It is also revealed that while the optimal value of p stays at an almost constant level in a broad range of α, that of r is sensitive to a change in the network structure. The consumer surplus is also studied and discussed.

  15. Two-dimensional and three-dimensional analyses of sigma precipitates and porosity in a superaustenitic stainless steel

    DEFF Research Database (Denmark)

    Fonda, Richard Warren; Lauridsen Mejdal, Erik; Ludwig, W.

    2007-01-01

    X-ray micro-tomography revealed not only the true three-dimensional (3-D) distribution, interconnectivity, and morphology of coarse sigma precipitates in an AL-6XN superaustenitic stainless steel, but also the presence of an internal void network associated with these precipitates. The voids were...

  16. Irreversible Conversion of a Water-Ethanol Solution into an Organized Two-Dimensional Network of Alternating Supramolecular Units in a Hydrophobic Zeolite under Pressure.

    Science.gov (United States)

    Arletti, Rossella; Fois, Ettore; Gigli, Lara; Vezzalini, Giovanna; Quartieri, Simona; Tabacchi, Gloria

    2017-02-13

    Turning disorder into organization is a key issue in science. By making use of X-ray powder diffraction and modeling studies, we show herein that high pressures in combination with the shape and space constraints of the hydrophobic all-silica zeolite ferrierite separate an ethanol-water liquid mixture into ethanol dimer wires and water tetramer squares. The confined supramolecular blocks alternate in a binary two-dimensional (2D) architecture that remains stable upon complete pressure release. These results support the combined use of high pressures and porous networks as a viable strategy for driving the organization of molecules or nano-objects towards complex, pre-defined patterns relevant for the realization of novel functional nanocomposites. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

  17. A development framework for parallel CFD applications: TRIOU project

    International Nuclear Information System (INIS)

    Calvin, Ch.

    2003-01-01

    We present in this paper the parallel structure of a thermal-hydraulic framework: Trio-U. This development platform has been designed in order to solve large 3-dimensional structured or unstructured CFD (computational fluid dynamics) problems. The code is intrinsically parallel, and an object-oriented design, UML, is used. The implementation language chosen is C++. All the parallelism management and the communication routines have been encapsulated. Parallel I/O and communication classes over standard I/O streams of C++ have been defined, which allows the developer an easy use of the different modules of the application without dealing with basic parallel process management and communications. Moreover, the encapsulation of the communication routines, guarantees the portability of the application and allows an efficient tuning of basic communication methods in order to achieve the best performances of the target architecture. The speed-up of parallel applications designed using the Trio U framework are very good since we obtained, for instance, on complex turbulent flow Large Eddy Simulation (LES) simulations an efficiency of up to 90% on 20 processors. The efficiencies obtained on direct numerical simulations of two phase flow fluids are similar since the speed-up is nearly equals to 7.5 for a 3-dimensional simulation using a one million element mesh on 8 processors. The purpose of this paper is to focus on the main concepts and their implementation that were the guidelines of the design of the parallel architecture of the code. (author)

  18. Stability and attractive basins of multiple equilibria in delayed two-neuron networks

    International Nuclear Information System (INIS)

    Huang Yu-Jiao; Zhang Hua-Guang; Wang Zhan-Shan

    2012-01-01

    Multiple stability for two-dimensional delayed recurrent neural networks with piecewise linear activation functions of 2r (r ≥ 1) corner points is studied. Sufficient conditions are established for checking the existence of (2r + 1) 2 equilibria in delayed recurrent neural networks. Under these conditions, (r + 1) 2 equilibria are locally exponentially stable, and (2r + 1) 2 — (r + 1) 2 — r 2 equilibria are unstable. Attractive basins of stable equilibria are estimated, which are larger than invariant sets derived by decomposing state space. One example is provided to illustrate the effectiveness of our results. (general)

  19. A queueing network model to analyze the impact of parallelization of care on patient cycle time.

    Science.gov (United States)

    Jiang, Lixiang; Giachetti, Ronald E

    2008-09-01

    The total time a patient spends in an outpatient facility, called the patient cycle time, is a major contributor to overall patient satisfaction. A frequently recommended strategy to reduce the total time is to perform some activities in parallel thereby shortening patient cycle time. To analyze patient cycle time this paper extends and improves upon existing multi-class open queueing network model (MOQN) so that the patient flow in an urgent care center can be modeled. Results of the model are analyzed using data from an urgent care center contemplating greater parallelization of patient care activities. The results indicate that parallelization can reduce the cycle time for those patient classes which require more than one diagnostic and/ or treatment intervention. However, for many patient classes there would be little if any improvement, indicating the importance of tools to analyze business process reengineering rules. The paper makes contributions by implementing an approximation for fork/join queues in the network and by improving the approximation for multiple server queues in both low traffic and high traffic conditions. We demonstrate the accuracy of the MOQN results through comparisons to simulation results.

  20. Two-dimensional critical phenomena

    International Nuclear Information System (INIS)

    Saleur, H.

    1987-09-01

    Two dimensional critical systems are studied using transformation to free fields and conformal invariance methods. The relations between the two approaches are also studied. The analytical results obtained generally depend on universality hypotheses or on renormalization group trajectories which are not established rigorously, so numerical verifications, mainly using the transfer matrix approach, are presented. The exact determination of critical exponents; the partition functions of critical models on toruses; and results as the critical point is approached are discussed [fr

  1. Performance of a fine-grained parallel model for multi-group nodal-transport calculations in three-dimensional pin-by-pin reactor geometry

    International Nuclear Information System (INIS)

    Masahiro, Tatsumi; Akio, Yamamoto

    2003-01-01

    A production code SCOPE2 was developed based on the fine-grained parallel algorithm by the red/black iterative method targeting parallel computing environments such as a PC-cluster. It can perform a depletion calculation in a few hours using a PC-cluster with the model based on a 9-group nodal-SP3 transport method in 3-dimensional pin-by-pin geometry for in-core fuel management of commercial PWRs. The present algorithm guarantees the identical convergence process as that in serial execution, which is very important from the viewpoint of quality management. The fine-mesh geometry is constructed by hierarchical decomposition with introduction of intermediate management layer as a block that is a quarter piece of a fuel assembly in radial direction. A combination of a mesh division scheme forcing even meshes on each edge and a latency-hidden communication algorithm provided simplicity and efficiency to message passing to enhance parallel performance. Inter-processor communication and parallel I/O access were realized using the MPI functions. Parallel performance was measured for depletion calculations by the 9-group nodal-SP3 transport method in 3-dimensional pin-by-pin geometry with 340 x 340 x 26 meshes for full core geometry and 170 x 170 x 26 for quarter core geometry. A PC cluster that consists of 24 Pentium-4 processors connected by the Fast Ethernet was used for the performance measurement. Calculations in full core geometry gave better speedups compared to those in quarter core geometry because of larger granularity. Fine-mesh sweep and feedback calculation parts gave almost perfect scalability since granularity is large enough, while 1-group coarse-mesh diffusion acceleration gave only around 80%. The speedup and parallel efficiency for total computation time were 22.6 and 94%, respectively, for the calculation in full core geometry with 24 processors. (authors)

  2. Software Defined Networking (SDN) controlled all optical switching networks with multi-dimensional switching architecture

    Science.gov (United States)

    Zhao, Yongli; Ji, Yuefeng; Zhang, Jie; Li, Hui; Xiong, Qianjin; Qiu, Shaofeng

    2014-08-01

    Ultrahigh throughout capacity requirement is challenging the current optical switching nodes with the fast development of data center networks. Pbit/s level all optical switching networks need to be deployed soon, which will cause the high complexity of node architecture. How to control the future network and node equipment together will become a new problem. An enhanced Software Defined Networking (eSDN) control architecture is proposed in the paper, which consists of Provider NOX (P-NOX) and Node NOX (N-NOX). With the cooperation of P-NOX and N-NOX, the flexible control of the entire network can be achieved. All optical switching network testbed has been experimentally demonstrated with efficient control of enhanced Software Defined Networking (eSDN). Pbit/s level all optical switching nodes in the testbed are implemented based on multi-dimensional switching architecture, i.e. multi-level and multi-planar. Due to the space and cost limitation, each optical switching node is only equipped with four input line boxes and four output line boxes respectively. Experimental results are given to verify the performance of our proposed control and switching architecture.

  3. Network Reconstruction From High-Dimensional Ordinary Differential Equations.

    Science.gov (United States)

    Chen, Shizhe; Shojaie, Ali; Witten, Daniela M

    2017-01-01

    We consider the task of learning a dynamical system from high-dimensional time-course data. For instance, we might wish to estimate a gene regulatory network from gene expression data measured at discrete time points. We model the dynamical system nonparametrically as a system of additive ordinary differential equations. Most existing methods for parameter estimation in ordinary differential equations estimate the derivatives from noisy observations. This is known to be challenging and inefficient. We propose a novel approach that does not involve derivative estimation. We show that the proposed method can consistently recover the true network structure even in high dimensions, and we demonstrate empirical improvement over competing approaches. Supplementary materials for this article are available online.

  4. Energy dispersion of charged particles decelerated in a two-dimensional electrostatic field of the type x1/n

    International Nuclear Information System (INIS)

    Zashkvara, V.V.; Bok, A.A.

    1992-01-01

    Two components of the spatial dispersion of particles with respect to kinetic energy can be distinguished of the motion of charged particle beams in electrostatic mirros with a two-dimensional field φ(x,y) ans xz symmetry plane. The first is the longitudinal dispersion, which is along the z axis perpendicular to the field; the second is the transverse dispersion, along the x axis parallel to the field vector in the plane of symmetry. The longitudinal dispersion is a basic characteristic of electrostatic mirrors used as energy analyzers. It has been shown that for first-order angular focusing, the longitudinal dispersion, divided by the focal length, is independent of the structure of the two-dimensional field and is a function only of the angle at which the charged particle beam enters the mirror. The transverse dispersion stems from the energy dependence of the penetration depth of the beam as it is decelerated, and it plays an important role when the energy of a charged particle beam is analyzed by the filtering principle, making use of the property of an electrostatic mirror to transmit or reflect charged particles with kinetic energy in a specified interval. This type of dispersion in electrostatic mirrors with two-dimensional fields has not been analyzed systematically. In the present note the authors consider a particular type of two-dimensional electrostatic field which is characterized by a large transverse dispersion, many times larger than in existing electrostatic reflecting filters employing planar and cylindrical fields

  5. Improvements in fast-response flood modeling: desktop parallel computing and domain tracking

    Energy Technology Data Exchange (ETDEWEB)

    Judi, David R [Los Alamos National Laboratory; Mcpherson, Timothy N [Los Alamos National Laboratory; Burian, Steven J [UNIV. OF UTAH

    2009-01-01

    It is becoming increasingly important to have the ability to accurately forecast flooding, as flooding accounts for the most losses due to natural disasters in the world and the United States. Flood inundation modeling has been dominated by one-dimensional approaches. These models are computationally efficient and are considered by many engineers to produce reasonably accurate water surface profiles. However, because the profiles estimated in these models must be superimposed on digital elevation data to create a two-dimensional map, the result may be sensitive to the ability of the elevation data to capture relevant features (e.g. dikes/levees, roads, walls, etc...). Moreover, one-dimensional models do not explicitly represent the complex flow processes present in floodplains and urban environments and because two-dimensional models based on the shallow water equations have significantly greater ability to determine flow velocity and direction, the National Research Council (NRC) has recommended that two-dimensional models be used over one-dimensional models for flood inundation studies. This paper has shown that two-dimensional flood modeling computational time can be greatly reduced through the use of Java multithreading on multi-core computers which effectively provides a means for parallel computing on a desktop computer. In addition, this paper has shown that when desktop parallel computing is coupled with a domain tracking algorithm, significant computation time can be eliminated when computations are completed only on inundated cells. The drastic reduction in computational time shown here enhances the ability of two-dimensional flood inundation models to be used as a near-real time flood forecasting tool, engineering, design tool, or planning tool. Perhaps even of greater significance, the reduction in computation time makes the incorporation of risk and uncertainty/ensemble forecasting more feasible for flood inundation modeling (NRC 2000; Sayers et al

  6. 3D printed soft parallel actuator

    Science.gov (United States)

    Zolfagharian, Ali; Kouzani, Abbas Z.; Khoo, Sui Yang; Noshadi, Amin; Kaynak, Akif

    2018-04-01

    This paper presents a 3-dimensional (3D) printed soft parallel contactless actuator for the first time. The actuator involves an electro-responsive parallel mechanism made of two segments namely active chain and passive chain both 3D printed. The active chain is attached to the ground from one end and constitutes two actuator links made of responsive hydrogel. The passive chain, on the other hand, is attached to the active chain from one end and consists of two rigid links made of polymer. The actuator links are printed using an extrusion-based 3D-Bioplotter with polyelectrolyte hydrogel as printer ink. The rigid links are also printed by a 3D fused deposition modelling (FDM) printer with acrylonitrile butadiene styrene (ABS) as print material. The kinematics model of the soft parallel actuator is derived via transformation matrices notations to simulate and determine the workspace of the actuator. The printed soft parallel actuator is then immersed into NaOH solution with specific voltage applied to it via two contactless electrodes. The experimental data is then collected and used to develop a parametric model to estimate the end-effector position and regulate kinematics model in response to specific input voltage over time. It is observed that the electroactive actuator demonstrates expected behaviour according to the simulation of its kinematics model. The use of 3D printing for the fabrication of parallel soft actuators opens a new chapter in manufacturing sophisticated soft actuators with high dexterity and mechanical robustness for biomedical applications such as cell manipulation and drug release.

  7. Numerical Experiments on Advective Transport in Large Three-Dimensional Discrete Fracture Networks

    Science.gov (United States)

    Makedonska, N.; Painter, S. L.; Karra, S.; Gable, C. W.

    2013-12-01

    Modeling of flow and solute transport in discrete fracture networks is an important approach for understanding the migration of contaminants in impermeable hard rocks such as granite, where fractures provide dominant flow and transport pathways. The discrete fracture network (DFN) model attempts to mimic discrete pathways for fluid flow through a fractured low-permeable rock mass, and may be combined with particle tracking simulations to address solute transport. However, experience has shown that it is challenging to obtain accurate transport results in three-dimensional DFNs because of the high computational burden and difficulty in constructing a high-quality unstructured computational mesh on simulated fractures. An integrated DFN meshing [1], flow, and particle tracking [2] simulation capability that enables accurate flow and particle tracking simulation on large DFNs has recently been developed. The new capability has been used in numerical experiments on advective transport in large DFNs with tens of thousands of fractures and millions of computational cells. The modeling procedure starts from the fracture network generation using a stochastic model derived from site data. A high-quality computational mesh is then generated [1]. Flow is then solved using the highly parallel PFLOTRAN [3] code. PFLOTRAN uses the finite volume approach, which is locally mass conserving and thus eliminates mass balance problems during particle tracking. The flow solver provides the scalar fluxes on each control volume face. From the obtained fluxes the Darcy velocity is reconstructed for each node in the network [4]. Velocities can then be continuously interpolated to any point in the domain of interest, thus enabling random walk particle tracking. In order to describe the flow field on fractures intersections, the control volume cells on intersections are split into four planar polygons, where each polygon corresponds to a piece of a fracture near the intersection line. Thus

  8. Two-dimensional capillary origami

    Energy Technology Data Exchange (ETDEWEB)

    Brubaker, N.D., E-mail: nbrubaker@math.arizona.edu; Lega, J., E-mail: lega@math.arizona.edu

    2016-01-08

    We describe a global approach to the problem of capillary origami that captures all unfolded equilibrium configurations in the two-dimensional setting where the drop is not required to fully wet the flexible plate. We provide bifurcation diagrams showing the level of encapsulation of each equilibrium configuration as a function of the volume of liquid that it contains, as well as plots representing the energy of each equilibrium branch. These diagrams indicate at what volume level the liquid drop ceases to be attached to the endpoints of the plate, which depends on the value of the contact angle. As in the case of pinned contact points, three different parameter regimes are identified, one of which predicts instantaneous encapsulation for small initial volumes of liquid. - Highlights: • Full solution set of the two-dimensional capillary origami problem. • Fluid does not necessarily wet the entire plate. • Global energy approach provides exact differential equations satisfied by minimizers. • Bifurcation diagrams highlight three different regimes. • Conditions for spontaneous encapsulation are identified.

  9. Two-dimensional capillary origami

    International Nuclear Information System (INIS)

    Brubaker, N.D.; Lega, J.

    2016-01-01

    We describe a global approach to the problem of capillary origami that captures all unfolded equilibrium configurations in the two-dimensional setting where the drop is not required to fully wet the flexible plate. We provide bifurcation diagrams showing the level of encapsulation of each equilibrium configuration as a function of the volume of liquid that it contains, as well as plots representing the energy of each equilibrium branch. These diagrams indicate at what volume level the liquid drop ceases to be attached to the endpoints of the plate, which depends on the value of the contact angle. As in the case of pinned contact points, three different parameter regimes are identified, one of which predicts instantaneous encapsulation for small initial volumes of liquid. - Highlights: • Full solution set of the two-dimensional capillary origami problem. • Fluid does not necessarily wet the entire plate. • Global energy approach provides exact differential equations satisfied by minimizers. • Bifurcation diagrams highlight three different regimes. • Conditions for spontaneous encapsulation are identified.

  10. Start-up flow in a three-dimensional lid-driven cavity by means of a massively parallel direction splitting algorithm

    KAUST Repository

    Guermond, J. L.

    2011-05-04

    The purpose of this paper is to validate a new highly parallelizable direction splitting algorithm. The parallelization capabilities of this algorithm are illustrated by providing a highly accurate solution for the start-up flow in a three-dimensional impulsively started lid-driven cavity of aspect ratio 1×1×2 at Reynolds numbers 1000 and 5000. The computations are done in parallel (up to 1024 processors) on adapted grids of up to 2 billion nodes in three space dimensions. Velocity profiles are given at dimensionless times t=4, 8, and 12; at least four digits are expected to be correct at Re=1000. © 2011 John Wiley & Sons, Ltd.

  11. Two-dimensional black holes and non-commutative spaces

    International Nuclear Information System (INIS)

    Sadeghi, J.

    2008-01-01

    We study the effects of non-commutative spaces on two-dimensional black hole. The event horizon of two-dimensional black hole is obtained in non-commutative space up to second order of perturbative calculations. A lower limit for the non-commutativity parameter is also obtained. The observer in that limit in contrast to commutative case see two horizon

  12. A highly efficient parallel algorithm for solving the neutron diffusion nodal equations on shared-memory computers

    International Nuclear Information System (INIS)

    Azmy, Y.Y.; Kirk, B.L.

    1990-01-01

    Modern parallel computer architectures offer an enormous potential for reducing CPU and wall-clock execution times of large-scale computations commonly performed in various applications in science and engineering. Recently, several authors have reported their efforts in developing and implementing parallel algorithms for solving the neutron diffusion equation on a variety of shared- and distributed-memory parallel computers. Testing of these algorithms for a variety of two- and three-dimensional meshes showed significant speedup of the computation. Even for very large problems (i.e., three-dimensional fine meshes) executed concurrently on a few nodes in serial (nonvector) mode, however, the measured computational efficiency is very low (40 to 86%). In this paper, the authors present a highly efficient (∼85 to 99.9%) algorithm for solving the two-dimensional nodal diffusion equations on the Sequent Balance 8000 parallel computer. Also presented is a model for the performance, represented by the efficiency, as a function of problem size and the number of participating processors. The model is validated through several tests and then extrapolated to larger problems and more processors to predict the performance of the algorithm in more computationally demanding situations

  13. Introduction to parallel algorithms and architectures arrays, trees, hypercubes

    CERN Document Server

    Leighton, F Thomson

    1991-01-01

    Introduction to Parallel Algorithms and Architectures: Arrays Trees Hypercubes provides an introduction to the expanding field of parallel algorithms and architectures. This book focuses on parallel computation involving the most popular network architectures, namely, arrays, trees, hypercubes, and some closely related networks.Organized into three chapters, this book begins with an overview of the simplest architectures of arrays and trees. This text then presents the structures and relationships between the dominant network architectures, as well as the most efficient parallel algorithms for

  14. Parallel computing: numerics, applications, and trends

    National Research Council Canada - National Science Library

    Trobec, Roman; Vajteršic, Marián; Zinterhof, Peter

    2009-01-01

    ... and/or distributed systems. The contributions to this book are focused on topics most concerned in the trends of today's parallel computing. These range from parallel algorithmics, programming, tools, network computing to future parallel computing. Particular attention is paid to parallel numerics: linear algebra, differential equations, numerica...

  15. Two-dimensional Navier-Stokes turbulence in bounded domains

    NARCIS (Netherlands)

    Clercx, H.J.H.; van Heijst, G.J.F.

    In this review we will discuss recent experimental and numerical results of quasi-two-dimensional decaying and forced Navier–Stokes turbulence in bounded domains. We will give a concise overview of developments in two-dimensional turbulence research, with emphasis on the progress made during the

  16. Two-dimensional Navier-Stokes turbulence in bounded domains

    NARCIS (Netherlands)

    Clercx, H.J.H.; Heijst, van G.J.F.

    2009-01-01

    In this review we will discuss recent experimental and numerical results of quasi-two-dimensional decaying and forced Navier–Stokes turbulence in bounded domains. We will give a concise overview of developments in two-dimensional turbulence research, with emphasis on the progress made during the

  17. Software Design Challenges in Time Series Prediction Systems Using Parallel Implementation of Artificial Neural Networks

    Directory of Open Access Journals (Sweden)

    Narayanan Manikandan

    2016-01-01

    Full Text Available Software development life cycle has been characterized by destructive disconnects between activities like planning, analysis, design, and programming. Particularly software developed with prediction based results is always a big challenge for designers. Time series data forecasting like currency exchange, stock prices, and weather report are some of the areas where an extensive research is going on for the last three decades. In the initial days, the problems with financial analysis and prediction were solved by statistical models and methods. For the last two decades, a large number of Artificial Neural Networks based learning models have been proposed to solve the problems of financial data and get accurate results in prediction of the future trends and prices. This paper addressed some architectural design related issues for performance improvement through vectorising the strengths of multivariate econometric time series models and Artificial Neural Networks. It provides an adaptive approach for predicting exchange rates and it can be called hybrid methodology for predicting exchange rates. This framework is tested for finding the accuracy and performance of parallel algorithms used.

  18. System performances of optical space code-division multiple-access-based fiber-optic two-dimensional parallel data link.

    Science.gov (United States)

    Nakamura, M; Kitayama, K

    1998-05-10

    Optical space code-division multiple access is a scheme to multiplex and link data between two-dimensional processors such as smart pixels and spatial light modulators or arrays of optical sources like vertical-cavity surface-emitting lasers. We examine the multiplexing characteristics of optical space code-division multiple access by using optical orthogonal signature patterns. The probability density function of interference noise in interfering optical orthogonal signature patterns is calculated. The bit-error rate is derived from the result and plotted as a function of receiver threshold, code length, code weight, and number of users. Furthermore, we propose a prethresholding method to suppress the interference noise, and we experimentally verify that the method works effectively in improving system performance.

  19. Piezoelectricity in Two-Dimensional Materials

    KAUST Repository

    Wu, Tao; Zhang, Hua

    2015-01-01

    Powering up 2D materials: Recent experimental studies confirmed the existence of piezoelectricity - the conversion of mechanical stress into electricity - in two-dimensional single-layer MoS2 nanosheets. The results represent a milestone towards

  20. An algorithm for three-dimensional imaging in the positron camera

    International Nuclear Information System (INIS)

    Chen Kun; Ma Mei; Xu Rongfen; Shen Miaohe

    1986-01-01

    A mathematical algorithm of back-projection filtered for image reconstructions using two-dimensional signals detected from parallel multiwire proportional chambers is described. The approaches of pseudo three-dimensional and full three-dimensional image reconstructions are introduced, and the available point response functions are defined as well. The designing parameters and computation procedure of the full three-dimensional method is presented

  1. Parallel multi-join query optimization algorithm for distributed sensor network in the internet of things

    Science.gov (United States)

    Zheng, Yan

    2015-03-01

    Internet of things (IoT), focusing on providing users with information exchange and intelligent control, attracts a lot of attention of researchers from all over the world since the beginning of this century. IoT is consisted of large scale of sensor nodes and data processing units, and the most important features of IoT can be illustrated as energy confinement, efficient communication and high redundancy. With the sensor nodes increment, the communication efficiency and the available communication band width become bottle necks. Many research work is based on the instance which the number of joins is less. However, it is not proper to the increasing multi-join query in whole internet of things. To improve the communication efficiency between parallel units in the distributed sensor network, this paper proposed parallel query optimization algorithm based on distribution attributes cost graph. The storage information relations and the network communication cost are considered in this algorithm, and an optimized information changing rule is established. The experimental result shows that the algorithm has good performance, and it would effectively use the resource of each node in the distributed sensor network. Therefore, executive efficiency of multi-join query between different nodes could be improved.

  2. Parallelization of 2-D lattice Boltzmann codes

    International Nuclear Information System (INIS)

    Suzuki, Soichiro; Kaburaki, Hideo; Yokokawa, Mitsuo.

    1996-03-01

    Lattice Boltzmann (LB) codes to simulate two dimensional fluid flow are developed on vector parallel computer Fujitsu VPP500 and scalar parallel computer Intel Paragon XP/S. While a 2-D domain decomposition method is used for the scalar parallel LB code, a 1-D domain decomposition method is used for the vector parallel LB code to be vectorized along with the axis perpendicular to the direction of the decomposition. High parallel efficiency of 95.1% by the vector parallel calculation on 16 processors with 1152x1152 grid and 88.6% by the scalar parallel calculation on 100 processors with 800x800 grid are obtained. The performance models are developed to analyze the performance of the LB codes. It is shown by our performance models that the execution speed of the vector parallel code is about one hundred times faster than that of the scalar parallel code with the same number of processors up to 100 processors. We also analyze the scalability in keeping the available memory size of one processor element at maximum. Our performance model predicts that the execution time of the vector parallel code increases about 3% on 500 processors. Although the 1-D domain decomposition method has in general a drawback in the interprocessor communication, the vector parallel LB code is still suitable for the large scale and/or high resolution simulations. (author)

  3. Parallelization of 2-D lattice Boltzmann codes

    Energy Technology Data Exchange (ETDEWEB)

    Suzuki, Soichiro; Kaburaki, Hideo; Yokokawa, Mitsuo

    1996-03-01

    Lattice Boltzmann (LB) codes to simulate two dimensional fluid flow are developed on vector parallel computer Fujitsu VPP500 and scalar parallel computer Intel Paragon XP/S. While a 2-D domain decomposition method is used for the scalar parallel LB code, a 1-D domain decomposition method is used for the vector parallel LB code to be vectorized along with the axis perpendicular to the direction of the decomposition. High parallel efficiency of 95.1% by the vector parallel calculation on 16 processors with 1152x1152 grid and 88.6% by the scalar parallel calculation on 100 processors with 800x800 grid are obtained. The performance models are developed to analyze the performance of the LB codes. It is shown by our performance models that the execution speed of the vector parallel code is about one hundred times faster than that of the scalar parallel code with the same number of processors up to 100 processors. We also analyze the scalability in keeping the available memory size of one processor element at maximum. Our performance model predicts that the execution time of the vector parallel code increases about 3% on 500 processors. Although the 1-D domain decomposition method has in general a drawback in the interprocessor communication, the vector parallel LB code is still suitable for the large scale and/or high resolution simulations. (author).

  4. Dynamic grid refinement for partial differential equations on parallel computers

    International Nuclear Information System (INIS)

    Mccormick, S.; Quinlan, D.

    1989-01-01

    The fast adaptive composite grid method (FAC) is an algorithm that uses various levels of uniform grids to provide adaptive resolution and fast solution of PDEs. An asynchronous version of FAC, called AFAC, that completely eliminates the bottleneck to parallelism is presented. This paper describes the advantage that this algorithm has in adaptive refinement for moving singularities on multiprocessor computers. This work is applicable to the parallel solution of two- and three-dimensional shock tracking problems. 6 refs

  5. Use of a two-dimensional ionization chamber array for proton therapy beam quality assurance

    International Nuclear Information System (INIS)

    Arjomandy, Bijan; Sahoo, Narayan; Ding Xiaoning; Gillin, Michael

    2008-01-01

    Two-dimensional ion chamber arrays are primarily used for conventional and intensity modulated radiotherapy quality assurance. There is no commercial device of such type available on the market that is offered for proton therapy quality assurance. We have investigated suitability of the MatriXX, a commercial two-dimensional ion chamber array detector for proton therapy QA. This device is designed to be used for photon and electron therapy QA. The device is equipped with 32x32 parallel plate ion chambers, each with 4.5 mm diam and 7.62 mm center-to-center separation. A 250 MeV proton beam was used to calibrate the dose measured by this device. The water equivalent thickness of the buildup material was determined to be 3.9 mm using a 160 MeV proton beam. Proton beams of different energies were used to measure the reproducibility of dose output and to evaluate the consistency in the beam flatness and symmetry measured by MatriXX. The output measurement results were compared with the clinical commissioning beam data that were obtained using a 0.6 cc Farmer chamber. The agreement was consistently found to be within 1%. The profiles were compared with film dosimetry and also with ion chamber data in water with an excellent agreement. The device is found to be well suited for quality assurance of proton therapy beams. It provides fast two-dimensional dose distribution information in real time with the accuracy comparable to that of ion chamber measurements and film dosimetry

  6. Solution of the two-dimensional spectral factorization problem

    Science.gov (United States)

    Lawton, W. M.

    1985-01-01

    An approximation theorem is proven which solves a classic problem in two-dimensional (2-D) filter theory. The theorem shows that any continuous two-dimensional spectrum can be uniformly approximated by the squared modulus of a recursively stable finite trigonometric polynomial supported on a nonsymmetric half-plane.

  7. A Simple GPU-Accelerated Two-Dimensional MUSCL-Hancock Solver for Ideal Magnetohydrodynamics

    Science.gov (United States)

    Bard, Christopher; Dorelli, John C.

    2013-01-01

    We describe our experience using NVIDIA's CUDA (Compute Unified Device Architecture) C programming environment to implement a two-dimensional second-order MUSCL-Hancock ideal magnetohydrodynamics (MHD) solver on a GTX 480 Graphics Processing Unit (GPU). Taking a simple approach in which the MHD variables are stored exclusively in the global memory of the GTX 480 and accessed in a cache-friendly manner (without further optimizing memory access by, for example, staging data in the GPU's faster shared memory), we achieved a maximum speed-up of approx. = 126 for a sq 1024 grid relative to the sequential C code running on a single Intel Nehalem (2.8 GHz) core. This speedup is consistent with simple estimates based on the known floating point performance, memory throughput and parallel processing capacity of the GTX 480.

  8. Development of Two-Dimensional NMR

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 20; Issue 11. Development of Two-Dimensional NMR: Strucure Determination of Biomolecules in Solution. Anil Kumar. General Article Volume 20 Issue 11 November 2015 pp 995-1002 ...

  9. ONE-DIMENSIONAL AND TWO-DIMENSIONAL LEADERSHIP STYLES

    OpenAIRE

    Nikola Stefanović

    2007-01-01

    In order to motivate their group members to perform certain tasks, leaders use different leadership styles. These styles are based on leaders' backgrounds, knowledge, values, experiences, and expectations. The one-dimensional styles, used by many world leaders, are autocratic and democratic styles. These styles lie on the two opposite sides of the leadership spectrum. In order to precisely define the leadership styles on the spectrum between the autocratic leadership style and the democratic ...

  10. Real-time solution of the forward kinematics for a parallel haptic device using a numerical approach based on neural networks

    International Nuclear Information System (INIS)

    Liu, Guan Yang; Zhang, Yuru; Wang, Yan; Xie, Zheng

    2015-01-01

    This paper proposes a neural network (NN)-based approach to solve the forward kinematics of a 3-RRR spherical parallel mechanism designed for a haptic device. The proposed algorithm aims to remarkably speed up computation to meet the requirement of high frequency rendering for haptic display. To achieve high accuracy, the workspace of the haptic device is divided into smaller subspaces. The proposed algorithm contains NNs of two different precision levels: a rough estimation NN to identify the index of the subspace and several precise estimation networks with expected accuracy to calculate the forward kinematics. For continuous motion, the algorithm structure is further simplified to save internal memory and increase computing speed, which are critical for a haptic device control system running on an embedded platform. Compared with the mostly used Newton-Raphson method, the proposed algorithm and its simplified version greatly increase the calculation speed by about four times and 10 times, respectively, while achieving the same accuracy level. The proposed approach is of great significance for solving the forward kinematics of parallel mechanism used as haptic devices when high update frequency is needed but hardware resources are limited.

  11. Spin wave steering in three-dimensional magnonic networks

    Science.gov (United States)

    Beginin, E. N.; Sadovnikov, A. V.; Sharaevskaya, A. Yu.; Stognij, A. I.; Nikitov, S. A.

    2018-03-01

    We report the concept of three-dimensional (3D) magnonic structures which are especially promising for controlling and manipulating magnon currents. The approach for fabrication of 3D magnonic crystals (MCs) and 3D magnonic networks is presented. A meander type ferromagnetic film grown at the top of the initially structured substrate can be a candidate for such 3D crystals. Using the finite element method, transfer matrix method, and micromagnetic simulations, we study spin-wave propagation in both isolated and coupled 3D MCs and reconstruct spin-wave dispersion and transmission response to elucidate the mechanism of magnonic bandgap formation. Our results show the possibility of the utilization of proposed structures for fabrication of a 3D magnonic network.

  12. Infrared magneto-spectroscopy of two-dimensional and three-dimensional massless fermions: A comparison

    Energy Technology Data Exchange (ETDEWEB)

    Orlita, M., E-mail: milan.orlita@lncmi.cnrs.fr [Laboratoire National des Champs Magnétiques Intenses, CNRS-UJF-UPS-INSA, 38042 Grenoble (France); Faculty of Mathematics and Physics, Charles University, Ke Karlovu 5, 121 16 Prague 2 (Czech Republic); Faugeras, C.; Barra, A.-L.; Martinez, G.; Potemski, M. [Laboratoire National des Champs Magnétiques Intenses, CNRS-UJF-UPS-INSA, 38042 Grenoble (France); Basko, D. M. [LPMMC UMR 5493, Université Grenoble 1/CNRS, B.P. 166, 38042 Grenoble (France); Zholudev, M. S. [Laboratoire Charles Coulomb (L2C), UMR CNRS 5221, GIS-TERALAB, Université Montpellier II, 34095 Montpellier (France); Institute for Physics of Microstructures, RAS, Nizhny Novgorod GSP-105 603950 (Russian Federation); Teppe, F.; Knap, W. [Laboratoire Charles Coulomb (L2C), UMR CNRS 5221, GIS-TERALAB, Université Montpellier II, 34095 Montpellier (France); Gavrilenko, V. I. [Institute for Physics of Microstructures, RAS, Nizhny Novgorod GSP-105 603950 (Russian Federation); Mikhailov, N. N.; Dvoretskii, S. A. [A.V. Rzhanov Institute of Semiconductor Physics, Siberian Branch, Russian Academy of Sciences, Novosibirsk 630090 (Russian Federation); Neugebauer, P. [Institut für Physikalische Chemie, Universität Stuttgart, Pfaffenwaldring 55, 70569 Stuttgart (Germany); Berger, C. [School of Physics, Georgia Institute of Technology, Atlanta, Georgia 30332 (United States); Institut Néel/CNRS-UJF BP 166, F-38042 Grenoble Cedex 9 (France); Heer, W. A. de [School of Physics, Georgia Institute of Technology, Atlanta, Georgia 30332 (United States)

    2015-03-21

    Here, we report on a magneto-optical study of two distinct systems hosting massless fermions—two-dimensional graphene and three-dimensional HgCdTe tuned to the zero band gap condition at the point of the semiconductor-to-semimetal topological transition. Both materials exhibit, in the quantum regime, a fairly rich magneto-optical response, which is composed from a series of intra- and interband inter-Landau level resonances with for massless fermions typical √(B) dependence. The impact of the system's dimensionality and of the strength of the spin-orbit interaction on the optical response is also discussed.

  13. One-dimensional versus two-dimensional electronic states in vicinal surfaces

    International Nuclear Information System (INIS)

    Ortega, J E; Ruiz-Oses, M; Cordon, J; Mugarza, A; Kuntze, J; Schiller, F

    2005-01-01

    Vicinal surfaces with periodic arrays of steps are among the simplest lateral nanostructures. In particular, noble metal surfaces vicinal to the (1 1 1) plane are excellent test systems to explore the basic electronic properties in one-dimensional superlattices by means of angular photoemission. These surfaces are characterized by strong emissions from free-electron-like surface states that scatter at step edges. Thereby, the two-dimensional surface state displays superlattice band folding and, depending on the step lattice constant d, it splits into one-dimensional quantum well levels. Here we use high-resolution, angle-resolved photoemission to analyse surface states in a variety of samples, in trying to illustrate the changes in surface state bands as a function of d

  14. Densis. Densimetric representation of two-dimensional matrices

    International Nuclear Information System (INIS)

    Los Arcos Merino, J.M.

    1978-01-01

    Densis is a Fortran V program which allows off-line control of a Calcomp digital plotter, to represent a two-dimensional matrix of numerical elements in the form of a variable shading intensity map in two colours. Each matrix element is associated to a square of a grid which is traced over by lines whose number is a function of the element value according to a selected scale. Program features, subroutine structure and running instructions, are described. Some typical results, for gamma-gamma coincidence experimental data and a sampled two-dimensional function, are indicated. (author)

  15. On the Synthesis and Optical Characterization of Zero-Dimensional-Networked Perovskites

    KAUST Repository

    Almutlaq, Jawaher

    2017-04-26

    The three-dimensional perovskites are known for their wide range of interesting properties including spectral tunability, charge carrier mobility, solution-based synthesis and many others. Such properties make them good candidates for photovoltaics and photodetectors. Low-dimensional perovskites, on the other hand, are good as light emitters due to the quantum confinement originating from their nanoparticle size. Another class of low-dimensional perovskites, also called low-dimensional-networked perovskites (L-DN), is recently reemerging. Those interesting materials combine the advantages of the nanocrystals and the stability of the bulk. For example, zero-dimensional-networked perovskite (0-DN), a special class of perovskites and the focus of this work, consists of building blocks of isolated lead-halide octahedra that could be synthesized into mm-size single crystal without losing their confinement. This thesis focuses on the synthesis and investigation of the optical properties of the 0-DN perovskites through experimental, theoretical and computational tools. The recent discovery of the retrograde solubility of the perovskites family (ABX3), the basis of the inverse temperature crystallization (ITC), inspired the reinvestigation of the low-dimensional-networked perovskites. The results of the optical characterization showed that the absorption and the corresponding PL spectra were successfully tuned to cover the visible spectrum from 410 nm for Cs4PbCl6, to 520 nm and 700 m for Cs4PbBr6 and Cs4PbI6, respectively. Interestingly, the exciton binding energies (Eb) of the 0-DNs were found to be in the order of few hundred meV(s), at least five times larger than their three-dimensional counterpart. Such high Eb is coupled with a few nanoseconds lifetime and ultimately yielded a high photoluminesce quantum yield (PLQY). In fact, the PLQY of Cs4PbBr6 powder showed a record of 45%, setting a new benchmark for solid-state luminescent perovskites. Computational methods

  16. Induced superconductivity in Nb/InAs-hybrid structures in parallel and perpendicular magnetic fields

    International Nuclear Information System (INIS)

    Rohlfing, Franziska

    2007-07-01

    The thesis in hand investigates experimentally Josephson contacts based on Nb/InAs-hybrid structures. The experiments discussed here were done on samples of different width of the Josephson contacts (between 500 nm and 2000 nm). They were realized by means of different methods of the semiconductor technology. The length of the Josephson contacts was about 600 nm and, as superconducting material, niobium was used. Both critical current and characteristics in the resistive regime (excess-current and multiple Andreev reflection) are studied as a function of temperature and external magnetic fields. Measurements in perpendicular and parallel magnetic fields with respect to the plain of the two-dimensional electron gas, are presented. The Andreev reflection amplitude determining the supercurrent is calculated by means of the Greens functions of the two-dimensional electron gas beneath the superconductors which is modified by the proximity effect. From the fit to the data with this model, the transparency of the boundary between the superconductor and the two-dimensional electron gas can be estimated to be about 0.1. The transparency of the point contacts in the two-dimensional electrons gas can be determined independently from the Josephson junction width dependence of the normal resistance (T=10 K). This transparency amounts to about 0.8 in the examined samples. The measurements of the critical current in a magnetic field perpendicular to the two-dimensional electron gas show a Fraunhofer pattern. In order to study the transition from perpendicular orientation into parallel orientation, measurements of the critical current as a function of the magnetic field were done for different angles. In the resistive regime, the excess current measurements in the magnetic field show a very interesting behaviour: In parallel magnetic fields, the excess current becomes zero at about 2.5 T. In perpendicular magnetic field however, the excess current is strongly suppressed below 30 m

  17. The language parallel Pascal and other aspects of the massively parallel processor

    Science.gov (United States)

    Reeves, A. P.; Bruner, J. D.

    1982-01-01

    A high level language for the Massively Parallel Processor (MPP) was designed. This language, called Parallel Pascal, is described in detail. A description of the language design, a description of the intermediate language, Parallel P-Code, and details for the MPP implementation are included. Formal descriptions of Parallel Pascal and Parallel P-Code are given. A compiler was developed which converts programs in Parallel Pascal into the intermediate Parallel P-Code language. The code generator to complete the compiler for the MPP is being developed independently. A Parallel Pascal to Pascal translator was also developed. The architecture design for a VLSI version of the MPP was completed with a description of fault tolerant interconnection networks. The memory arrangement aspects of the MPP are discussed and a survey of other high level languages is given.

  18. Par@Graph - a parallel toolbox for the construction and analysis of large complex climate networks

    NARCIS (Netherlands)

    Tantet, A.J.J.

    2015-01-01

    In this paper, we present Par@Graph, a software toolbox to reconstruct and analyze complex climate networks having a large number of nodes (up to at least 106) and edges (up to at least 1012). The key innovation is an efficient set of parallel software tools designed to leverage the inherited hybrid

  19. Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan

    Directory of Open Access Journals (Sweden)

    Cuixia Miao

    2014-01-01

    Full Text Available We consider the bounded parallel-batch scheduling with two models of deterioration, in which the processing time of the first model is pj=aj+αt and of the second model is pj=a+αjt. The objective is to minimize the makespan. We present O(n log n time algorithms for the single-machine problems, respectively. And we propose fully polynomial time approximation schemes to solve the identical-parallel-machine problem and uniform-parallel-machine problem, respectively.

  20. Resonance fluorescence based two- and three-dimensional atom localization

    Science.gov (United States)

    Wahab, Abdul; Rahmatullah; Qamar, Sajid

    2016-06-01

    Two- and three-dimensional atom localization in a two-level atom-field system via resonance fluorescence is suggested. For the two-dimensional localization, the atom interacts with two orthogonal standing-wave fields, whereas for the three-dimensional atom localization, the atom interacts with three orthogonal standing-wave fields. The effect of the detuning and phase shifts associated with the corresponding standing-wave fields is investigated. A precision enhancement in position measurement of the single atom can be noticed via the control of the detuning and phase shifts.

  1. Subjective figure reversal in two- and three-dimensional perceptual space.

    Science.gov (United States)

    Radilová, J; Radil-Weiss, T

    1984-08-01

    A permanently illuminated pattern of Mach's truncated pyramid can be perceived according to the experimental instruction given, either as a three-dimensional reversible figure with spontaneously changing convex and concave interpretation (in one experiment), or as a two-dimensional reversible figure-ground pattern (in another experiment). The reversal rate was about twice as slow, without the subjects being aware of it, if it was perceived as a three-dimensional figure compared to the situation when it was perceived as two-dimensional. It may be hypothetized that in the three-dimensional case, the process of perception requires more sequential steps than in the two-dimensional one.

  2. Three-dimensional parallelization of microfluidic droplet generators for a litre per hour volume production of single emulsions

    KAUST Repository

    Conchouso Gonzalez, David; Castro, David; Khan, Saif; Foulds, Ian G.

    2014-01-01

    are interconnected via through-holes and fed with designated fractal distribution networks. The proposed layers were milled on poly(methylmethacrylate) (PMMA) sheets and the stack was thermo-compression bonded to create a three-dimensional device with a high density

  3. Data-driven forecasting of high-dimensional chaotic systems with long short-term memory networks.

    Science.gov (United States)

    Vlachas, Pantelis R; Byeon, Wonmin; Wan, Zhong Y; Sapsis, Themistoklis P; Koumoutsakos, Petros

    2018-05-01

    We introduce a data-driven forecasting method for high-dimensional chaotic systems using long short-term memory (LSTM) recurrent neural networks. The proposed LSTM neural networks perform inference of high-dimensional dynamical systems in their reduced order space and are shown to be an effective set of nonlinear approximators of their attractor. We demonstrate the forecasting performance of the LSTM and compare it with Gaussian processes (GPs) in time series obtained from the Lorenz 96 system, the Kuramoto-Sivashinsky equation and a prototype climate model. The LSTM networks outperform the GPs in short-term forecasting accuracy in all applications considered. A hybrid architecture, extending the LSTM with a mean stochastic model (MSM-LSTM), is proposed to ensure convergence to the invariant measure. This novel hybrid method is fully data-driven and extends the forecasting capabilities of LSTM networks.

  4. Two multi-dimensional uncertainty relations

    International Nuclear Information System (INIS)

    Skala, L; Kapsa, V

    2008-01-01

    Two multi-dimensional uncertainty relations, one related to the probability density and the other one related to the probability density current, are derived and discussed. Both relations are stronger than the usual uncertainty relations for the coordinates and momentum

  5. Mechanical exfoliation of two-dimensional materials

    Science.gov (United States)

    Gao, Enlai; Lin, Shao-Zhen; Qin, Zhao; Buehler, Markus J.; Feng, Xi-Qiao; Xu, Zhiping

    2018-06-01

    Two-dimensional materials such as graphene and transition metal dichalcogenides have been identified and drawn much attention over the last few years for their unique structural and electronic properties. However, their rise begins only after these materials are successfully isolated from their layered assemblies or adhesive substrates into individual monolayers. Mechanical exfoliation and transfer are the most successful techniques to obtain high-quality single- or few-layer nanocrystals from their native multi-layer structures or their substrate for growth, which involves interfacial peeling and intralayer tearing processes that are controlled by material properties, geometry and the kinetics of exfoliation. This procedure is rationalized in this work through theoretical analysis and atomistic simulations. We propose a criterion to assess the feasibility for the exfoliation of two-dimensional sheets from an adhesive substrate without fracturing itself, and explore the effects of material and interface properties, as well as the geometrical, kinetic factors on the peeling behaviors and the torn morphology. This multi-scale approach elucidates the microscopic mechanism of the mechanical processes, offering predictive models and tools for the design of experimental procedures to obtain single- or few-layer two-dimensional materials and structures.

  6. Two-dimensional parallel array technology as a new approach to automated combinatorial solid-phase organic synthesis

    Science.gov (United States)

    Brennan; Biddison; Frauendorf; Schwarcz; Keen; Ecker; Davis; Tinder; Swayze

    1998-01-01

    An automated, 96-well parallel array synthesizer for solid-phase organic synthesis has been designed and constructed. The instrument employs a unique reagent array delivery format, in which each reagent utilized has a dedicated plumbing system. An inert atmosphere is maintained during all phases of a synthesis, and temperature can be controlled via a thermal transfer plate which holds the injection molded reaction block. The reaction plate assembly slides in the X-axis direction, while eight nozzle blocks holding the reagent lines slide in the Y-axis direction, allowing for the extremely rapid delivery of any of 64 reagents to 96 wells. In addition, there are six banks of fixed nozzle blocks, which deliver the same reagent or solvent to eight wells at once, for a total of 72 possible reagents. The instrument is controlled by software which allows the straightforward programming of the synthesis of a larger number of compounds. This is accomplished by supplying a general synthetic procedure in the form of a command file, which calls upon certain reagents to be added to specific wells via lookup in a sequence file. The bottle position, flow rate, and concentration of each reagent is stored in a separate reagent table file. To demonstrate the utility of the parallel array synthesizer, a small combinatorial library of hydroxamic acids was prepared in high throughput mode for biological screening. Approximately 1300 compounds were prepared on a 10 μmole scale (3-5 mg) in a few weeks. The resulting crude compounds were generally >80% pure, and were utilized directly for high throughput screening in antibacterial assays. Several active wells were found, and the activity was verified by solution-phase synthesis of analytically pure material, indicating that the system described herein is an efficient means for the parallel synthesis of compounds for lead discovery. Copyright 1998 John Wiley & Sons, Inc.

  7. Parallel asynchronous systems and image processing algorithms

    Science.gov (United States)

    Coon, D. D.; Perera, A. G. U.

    1989-01-01

    A new hardware approach to implementation of image processing algorithms is described. The approach is based on silicon devices which would permit an independent analog processing channel to be dedicated to evey pixel. A laminar architecture consisting of a stack of planar arrays of the device would form a two-dimensional array processor with a 2-D array of inputs located directly behind a focal plane detector array. A 2-D image data stream would propagate in neuronlike asynchronous pulse coded form through the laminar processor. Such systems would integrate image acquisition and image processing. Acquisition and processing would be performed concurrently as in natural vision systems. The research is aimed at implementation of algorithms, such as the intensity dependent summation algorithm and pyramid processing structures, which are motivated by the operation of natural vision systems. Implementation of natural vision algorithms would benefit from the use of neuronlike information coding and the laminar, 2-D parallel, vision system type architecture. Besides providing a neural network framework for implementation of natural vision algorithms, a 2-D parallel approach could eliminate the serial bottleneck of conventional processing systems. Conversion to serial format would occur only after raw intensity data has been substantially processed. An interesting challenge arises from the fact that the mathematical formulation of natural vision algorithms does not specify the means of implementation, so that hardware implementation poses intriguing questions involving vision science.

  8. Two-dimensional network formation of cardiac myocytes in agar microculture chip with 1480 nm infrared laser photo-thermal etching.

    Science.gov (United States)

    Kojima, Kensuke; Moriguchi, Hiroyuki; Hattori, Akihiro; Kaneko, Tomoyuki; Yasuda, Kenji

    2003-11-01

    We have developed a new method that enables agar microstructures to be used to cultivate cells and that allows cell network patterns to be controlled. The method makes use of non-contact three-dimensional photo-thermal etching with a 1480 nm infrared focused laser beam, which is strongly absorbed by water and agar gel, to form the shapes of agar microstructures. It allows microstructures to be easily formed in an agar layer within a few minutes, with cell-culture holes formed by the spot heating of a 100 mW laser and tunnels by the tracing of a 100 microm s(-1), 40 mW laser. We cultivated rat cardiac myocytes in adjacent microstructures and observed synchronized beating in them 90 min after they had made physical contact. Our results indicate that the system can make and use microstructures for cell-network cultivation in a minimal amount of time without any expensive microfabrication facilities or complicated procedures.

  9. Multi-scale computational model of three-dimensional hemodynamics within a deformable full-body arterial network

    Energy Technology Data Exchange (ETDEWEB)

    Xiao, Nan [Department of Bioengineering, Stanford University, Stanford, CA 94305 (United States); Department of Biomedical Engineering, King’s College London, London SE1 7EH (United Kingdom); Humphrey, Jay D. [Department of Biomedical Engineering, Yale University, New Haven, CT 06520 (United States); Figueroa, C. Alberto, E-mail: alberto.figueroa@kcl.ac.uk [Department of Biomedical Engineering, King’s College London, London SE1 7EH (United Kingdom)

    2013-07-01

    In this article, we present a computational multi-scale model of fully three-dimensional and unsteady hemodynamics within the primary large arteries in the human. Computed tomography image data from two different patients were used to reconstruct a nearly complete network of the major arteries from head to foot. A linearized coupled-momentum method for fluid–structure-interaction was used to describe vessel wall deformability and a multi-domain method for outflow boundary condition specification was used to account for the distal circulation. We demonstrated that physiologically realistic results can be obtained from the model by comparing simulated quantities such as regional blood flow, pressure and flow waveforms, and pulse wave velocities to known values in the literature. We also simulated the impact of age-related arterial stiffening on wave propagation phenomena by progressively increasing the stiffness of the central arteries and found that the predicted effects on pressure amplification and pulse wave velocity are in agreement with findings in the clinical literature. This work demonstrates the feasibility of three-dimensional techniques for simulating hemodynamics in a full-body compliant arterial network.

  10. cellGPU: Massively parallel simulations of dynamic vertex models

    Science.gov (United States)

    Sussman, Daniel M.

    2017-10-01

    Vertex models represent confluent tissue by polygonal or polyhedral tilings of space, with the individual cells interacting via force laws that depend on both the geometry of the cells and the topology of the tessellation. This dependence on the connectivity of the cellular network introduces several complications to performing molecular-dynamics-like simulations of vertex models, and in particular makes parallelizing the simulations difficult. cellGPU addresses this difficulty and lays the foundation for massively parallelized, GPU-based simulations of these models. This article discusses its implementation for a pair of two-dimensional models, and compares the typical performance that can be expected between running cellGPU entirely on the CPU versus its performance when running on a range of commercial and server-grade graphics cards. By implementing the calculation of topological changes and forces on cells in a highly parallelizable fashion, cellGPU enables researchers to simulate time- and length-scales previously inaccessible via existing single-threaded CPU implementations. Program Files doi:http://dx.doi.org/10.17632/6j2cj29t3r.1 Licensing provisions: MIT Programming language: CUDA/C++ Nature of problem: Simulations of off-lattice "vertex models" of cells, in which the interaction forces depend on both the geometry and the topology of the cellular aggregate. Solution method: Highly parallelized GPU-accelerated dynamical simulations in which the force calculations and the topological features can be handled on either the CPU or GPU. Additional comments: The code is hosted at https://gitlab.com/dmsussman/cellGPU, with documentation additionally maintained at http://dmsussman.gitlab.io/cellGPUdocumentation

  11. Parallel programming practical aspects, models and current limitations

    CERN Document Server

    Tarkov, Mikhail S

    2014-01-01

    Parallel programming is designed for the use of parallel computer systems for solving time-consuming problems that cannot be solved on a sequential computer in a reasonable time. These problems can be divided into two classes: 1. Processing large data arrays (including processing images and signals in real time)2. Simulation of complex physical processes and chemical reactions For each of these classes, prospective methods are designed for solving problems. For data processing, one of the most promising technologies is the use of artificial neural networks. Particles-in-cell method and cellular automata are very useful for simulation. Problems of scalability of parallel algorithms and the transfer of existing parallel programs to future parallel computers are very acute now. An important task is to optimize the use of the equipment (including the CPU cache) of parallel computers. Along with parallelizing information processing, it is essential to ensure the processing reliability by the relevant organization ...

  12. Comparative Evaluation and Case Studies of Shared-Memory and Data-Parallel Execution Patterns

    Directory of Open Access Journals (Sweden)

    Xiaodong Zhang

    1999-01-01

    Full Text Available Shared‐memory and data‐parallel programming models are two important paradigms for scientific applications. Both models provide high‐level program abstractions, and simple and uniform views of network structures. The common features of the two models significantly simplify program coding and debugging for scientific applications. However, the underlining execution and overhead patterns are significantly different between the two models due to their programming constraints, and due to different and complex structures of interconnection networks and systems which support the two models. We performed this experimental study to present implications and comparisons of execution patterns on two commercial architectures. We implemented a standard electromagnetic simulation program (EM and a linear system solver using the shared‐memory model on the KSR‐1 and the data‐parallel model on the CM‐5. Our objectives are to examine the execution pattern changes required for an implementation transformation between the two models; to study memory access patterns; to address scalability issues; and to investigate relative costs and advantages/disadvantages of using the two models for scientific computations. Our results indicate that the EM program tends to become computation‐intensive in the KSR‐1 shared‐memory system, and memory‐demanding in the CM‐5 data‐parallel system when the systems and the problems are scaled. The EM program, a highly data‐parallel program performed extremely well, and the linear system solver, a highly control‐structured program suffered significantly in the data‐parallel model on the CM‐5. Our study provides further evidence that matching execution patterns of algorithms to parallel architectures would achieve better performance.

  13. Pthreads vs MPI Parallel Performance of Angular-Domain Decomposed S

    International Nuclear Information System (INIS)

    Azmy, Y.Y.; Barnett, D.A.

    2000-01-01

    Two programming models for parallelizing the Angular Domain Decomposition (ADD) of the discrete ordinates (S n ) approximation of the neutron transport equation are examined. These are the shared memory model based on the POSIX threads (Pthreads) standard, and the message passing model based on the Message Passing Interface (MPI) standard. These standard libraries are available on most multiprocessor platforms thus making the resulting parallel codes widely portable. The question is: on a fixed platform, and for a particular code solving a given test problem, which of the two programming models delivers better parallel performance? Such comparison is possible on Symmetric Multi-Processors (SMP) architectures in which several CPUs physically share a common memory, and in addition are capable of emulating message passing functionality. Implementation of the two-dimensional,(S n ), Arbitrarily High Order Transport (AHOT) code for solving neutron transport problems using these two parallelization models is described. Measured parallel performance of each model on the COMPAQ AlphaServer 8400 and the SGI Origin 2000 platforms is described, and comparison of the observed speedup for the two programming models is reported. For the case presented in this paper it appears that the MPI implementation scales better than the Pthreads implementation on both platforms

  14. Asymptotics for Two-dimensional Atoms

    DEFF Research Database (Denmark)

    Nam, Phan Thanh; Portmann, Fabian; Solovej, Jan Philip

    2012-01-01

    We prove that the ground state energy of an atom confined to two dimensions with an infinitely heavy nucleus of charge $Z>0$ and $N$ quantum electrons of charge -1 is $E(N,Z)=-{1/2}Z^2\\ln Z+(E^{\\TF}(\\lambda)+{1/2}c^{\\rm H})Z^2+o(Z^2)$ when $Z\\to \\infty$ and $N/Z\\to \\lambda$, where $E^{\\TF}(\\lambd......We prove that the ground state energy of an atom confined to two dimensions with an infinitely heavy nucleus of charge $Z>0$ and $N$ quantum electrons of charge -1 is $E(N,Z)=-{1/2}Z^2\\ln Z+(E^{\\TF}(\\lambda)+{1/2}c^{\\rm H})Z^2+o(Z^2)$ when $Z\\to \\infty$ and $N/Z\\to \\lambda$, where $E......^{\\TF}(\\lambda)$ is given by a Thomas-Fermi type variational problem and $c^{\\rm H}\\approx -2.2339$ is an explicit constant. We also show that the radius of a two-dimensional neutral atom is unbounded when $Z\\to \\infty$, which is contrary to the expected behavior of three-dimensional atoms....

  15. An efficient implementation of a backpropagation learning algorithm on quadrics parallel supercomputer

    International Nuclear Information System (INIS)

    Taraglio, S.; Massaioli, F.

    1995-08-01

    A parallel implementation of a library to build and train Multi Layer Perceptrons via the Back Propagation algorithm is presented. The target machine is the SIMD massively parallel supercomputer Quadrics. Performance measures are provided on three different machines with different number of processors, for two network examples. A sample source code is given

  16. Three-dimensional evidence network plot system: covariate imbalances and effects in network meta-analysis explored using a new software tool.

    Science.gov (United States)

    Batson, Sarah; Score, Robert; Sutton, Alex J

    2017-06-01

    The aim of the study was to develop the three-dimensional (3D) evidence network plot system-a novel web-based interactive 3D tool to facilitate the visualization and exploration of covariate distributions and imbalances across evidence networks for network meta-analysis (NMA). We developed the 3D evidence network plot system within an AngularJS environment using a third party JavaScript library (Three.js) to create the 3D element of the application. Data used to enable the creation of the 3D element for a particular topic are inputted via a Microsoft Excel template spreadsheet that has been specifically formatted to hold these data. We display and discuss the findings of applying the tool to two NMA examples considering multiple covariates. These two examples have been previously identified as having potentially important covariate effects and allow us to document the various features of the tool while illustrating how it can be used. The 3D evidence network plot system provides an immediate, intuitive, and accessible way to assess the similarity and differences between the values of covariates for individual studies within and between each treatment contrast in an evidence network. In this way, differences between the studies, which may invalidate the usual assumptions of an NMA, can be identified for further scrutiny. Hence, the tool facilitates NMA feasibility/validity assessments and aids in the interpretation of NMA results. The 3D evidence network plot system is the first tool designed specifically to visualize covariate distributions and imbalances across evidence networks in 3D. This will be of primary interest to systematic review and meta-analysis researchers and, more generally, those assessing the validity and robustness of an NMA to inform reimbursement decisions. Copyright © 2017 Elsevier Inc. All rights reserved.

  17. Toward Bulk Synchronous Parallel-Based Machine Learning Techniques for Anomaly Detection in High-Speed Big Data Networks

    Directory of Open Access Journals (Sweden)

    Kamran Siddique

    2017-09-01

    Full Text Available Anomaly detection systems, also known as intrusion detection systems (IDSs, continuously monitor network traffic aiming to identify malicious actions. Extensive research has been conducted to build efficient IDSs emphasizing two essential characteristics. The first is concerned with finding optimal feature selection, while another deals with employing robust classification schemes. However, the advent of big data concepts in anomaly detection domain and the appearance of sophisticated network attacks in the modern era require some fundamental methodological revisions to develop IDSs. Therefore, we first identify two more significant characteristics in addition to the ones mentioned above. These refer to the need for employing specialized big data processing frameworks and utilizing appropriate datasets for validating system’s performance, which is largely overlooked in existing studies. Afterwards, we set out to develop an anomaly detection system that comprehensively follows these four identified characteristics, i.e., the proposed system (i performs feature ranking and selection using information gain and automated branch-and-bound algorithms respectively; (ii employs logistic regression and extreme gradient boosting techniques for classification; (iii introduces bulk synchronous parallel processing to cater computational requirements of high-speed big data networks; and; (iv uses the Infromation Security Centre of Excellence, of the University of Brunswick real-time contemporary dataset for performance evaluation. We present experimental results that verify the efficacy of the proposed system.

  18. Parallel treatment of simulation particles in particle-in-cell codes on SUPRENUM

    International Nuclear Information System (INIS)

    Seldner, D.

    1990-02-01

    This report contains the program documentation and description of the program package 2D-PLAS, which has been developed at the Nuclear Research Center Karlsruhe in the Institute for Data Processing in Technology (IDT) under the auspices of the BMFT. 2D-PLAS is a parallel program version of the treatment of the simulation particles of the two-dimensional stationary particle-in-cell code BFCPIC which has been developed at the Nuclear Research Center Karlsruhe. This parallel version has been designed for the parallel computer SUPRENUM. (orig.) [de

  19. Two-dimensional structure of poly[[[μ2-1,4-bis(pyridin-4-ylbutane]bis(μ4-pentanedioatodicopper(II] acetonitrile disolvate

    Directory of Open Access Journals (Sweden)

    Do Nam Lee

    2017-10-01

    Full Text Available In the title compound, {[Cu2(μ4-C5H6O42(μ2-C14H16N2]·2CH3CN}n, the Cu2 dinuclear units are connected by glutartate ligands, forming one-dimensional double chains. These chains, are in turn bridged by 1,4-bis(pyridin-4-ylbutane ligands to form a two-dimensional layer structure parallel to (112. The carboxylate groups of the glutarate ligand bridge two copper(II ions, forming a paddle-wheel-type Cu2(CO24 dinuclear secondary building unit. A crystallographic inversion centre is located midway between two CuII ions, with a Cu...Cu distance of 2.639 (3 Å. The coordination geometry of the unique CuII ion is slightly disorted square pyramidal, formed by four equatorial carboxylate O atoms and an axial pyridyl N atom.

  20. Resistance and Security Index of Networks: Structural Information Perspective of Network Security.

    Science.gov (United States)

    Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

    2016-06-03

    Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks.