Passivity Enhancement in RES Based Power Plant with Paralleled Grid-Connected Inverters

DEFF Research Database (Denmark)

Bai, Haofeng; Wang, Xiongfei; Blaabjerg, Frede

2016-01-01

Harmonic instability is threatening the operation of power plants with multiple grid connected converters in parallel. To analyze and improve the stability of the grid connected converters, the passivity of the output admittance converters is first analyzed in this paper. It is shown that the non-passivity...

Cluster Optimization and Parallelization of Simulations with Dynamically Adaptive Grids

KAUST Repository

Schreiber, Martin; Weinzierl, Tobias; Bungartz, Hans-Joachim

2013-01-01

The present paper studies solvers for partial differential equations that work on dynamically adaptive grids stemming from spacetrees. Due to the underlying tree formalism, such grids efficiently can be decomposed into connected grid regions (clusters) on-the-fly. A graph on those clusters classified according to their grid invariancy, workload, multi-core affinity, and further meta data represents the inter-cluster communication. While stationary clusters already can be handled more efficiently than their dynamic counterparts, we propose to treat them as atomic grid entities and introduce a skip mechanism that allows the grid traversal to omit those regions completely. The communication graph ensures that the cluster data nevertheless are kept consistent, and several shared memory parallelization strategies are feasible. A hyperbolic benchmark that has to remesh selected mesh regions iteratively to preserve conforming tessellations acts as benchmark for the present work. We discuss runtime improvements resulting from the skip mechanism and the implications on shared memory performance and load balancing. © 2013 Springer-Verlag.

Characterization of reticulated vitreous carbon foam using a frisch-grid parallel-plate ionization chamber

Science.gov (United States)

Edwards, Nathaniel S.; Conley, Jerrod C.; Reichenberger, Michael A.; Nelson, Kyle A.; Tiner, Christopher N.; Hinson, Niklas J.; Ugorowski, Philip B.; Fronk, Ryan G.; McGregor, Douglas S.

2018-06-01

The propagation of electrons through several linear pore densities of reticulated vitreous carbon (RVC) foam was studied using a Frisch-grid parallel-plate ionization chamber pressurized to 1 psig of P-10 proportional gas. The operating voltages of the electrodes contained within the Frisch-grid parallel-plate ionization chamber were defined by measuring counting curves using a collimated 241Am alpha-particle source with and without a Frisch grid. RVC foam samples with linear pore densities of 5, 10, 20, 30, 45, 80, and 100 pores per linear inch were separately positioned between the cathode and anode. Pulse-height spectra and count rates from a collimated 241Am alpha-particle source positioned between the cathode and each RVC foam sample were measured and compared to a measurement without an RVC foam sample. The Frisch grid was positioned in between the RVC foam sample and the anode. The measured pulse-height spectra were indiscernible from background and resulted in negligible net count rates for all RVC foam samples. The Frisch grid parallel-plate ionization chamber measurement results indicate that electrons do not traverse the bulk of RVC foam and consequently do not produce a pulse.

Schnek: A C++ library for the development of parallel simulation codes on regular grids

Science.gov (United States)

Schmitz, Holger

2018-05-01

A large number of algorithms across the field of computational physics are formulated on grids with a regular topology. We present Schnek, a library that enables fast development of parallel simulations on regular grids. Schnek contains a number of easy-to-use modules that greatly reduce the amount of administrative code for large-scale simulation codes. The library provides an interface for reading simulation setup files with a hierarchical structure. The structure of the setup file is translated into a hierarchy of simulation modules that the developer can specify. The reader parses and evaluates mathematical expressions and initialises variables or grid data. This enables developers to write modular and flexible simulation codes with minimal effort. Regular grids of arbitrary dimension are defined as well as mechanisms for defining physical domain sizes, grid staggering, and ghost cells on these grids. Ghost cells can be exchanged between neighbouring processes using MPI with a simple interface. The grid data can easily be written into HDF5 files using serial or parallel I/O.

Interaction Admittance Based Modeling of Multi-Paralleled Grid-Connected Inverter with LCL-Filter

DEFF Research Database (Denmark)

Lu, Minghui; Blaabjerg, Frede; Wang, Xiongfei

2016-01-01

This paper investigates the mutual interaction and stability issues of multi-parallel LCL-filtered inverters. The stability and power quality of multiple grid-tied inverters are gaining more and more research attention as the penetration of renewables increases. In this paper, interactions...... and coupling effects among the multi-paralleled inverters and power grid are explicitly revealed. An Interaction Admittance concept is introduced to express and model the interaction through the physical admittances of the network. Compared to the existing modeling methods, the proposed analysis provides...

WEKA-G: Parallel data mining on computational grids

Directory of Open Access Journals (Sweden)

PIMENTA, A.

2009-12-01

Full Text Available Data mining is a technology that can extract useful information from large amounts of data. However, mining a database often requires a high computational power. To resolve this problem, this paper presents a tool (Weka-G, which runs in parallel algorithms used in the mining process data. As the environment for doing so, we use a computational grid by adding several features within a WAN.

Framework for Interactive Parallel Dataset Analysis on the Grid

Energy Technology Data Exchange (ETDEWEB)

Alexander, David A.; Ananthan, Balamurali; /Tech-X Corp.; Johnson, Tony; Serbo, Victor; /SLAC

2007-01-10

We present a framework for use at a typical Grid site to facilitate custom interactive parallel dataset analysis targeting terabyte-scale datasets of the type typically produced by large multi-institutional science experiments. We summarize the needs for interactive analysis and show a prototype solution that satisfies those needs. The solution consists of desktop client tool and a set of Web Services that allow scientists to sign onto a Grid site, compose analysis script code to carry out physics analysis on datasets, distribute the code and datasets to worker nodes, collect the results back to the client, and to construct professional-quality visualizations of the results.

Modeling and design of a multivariable control system for multi-paralleled grid-connected inverters with LCL filter

DEFF Research Database (Denmark)

Akhavan, Ali; Mohammadi, Hamid Reza; Guerrero, Josep M.

2018-01-01

The quality of injected current in multi-paralleled grid-connected inverters is a matter of concern. The current controlled grid-connected inverters with LCL filter are widely used in the distributed generation (DG) systems due to their fast dynamic response and better power features. However...... with resonances in the system, damping methods such as passive or active damping is necessary. Secondly and perhaps more importantly, paralleled grid-connected inverters in a microgrid are coupled due to grid impedance. Generally, the coupling effect is not taken into account when designing the control systems...

Provably optimal parallel transport sweeps on regular grids

International Nuclear Information System (INIS)

Adams, M. P.; Adams, M. L.; Hawkins, W. D.; Smith, T.; Rauchwerger, L.; Amato, N. M.; Bailey, T. S.; Falgout, R. D.

2013-01-01

We have found provably optimal algorithms for full-domain discrete-ordinate transport sweeps on regular grids in 3D Cartesian geometry. We describe these algorithms and sketch a 'proof that they always execute the full eight-octant sweep in the minimum possible number of stages for a given P x x P y x P z partitioning. Computational results demonstrate that our optimal scheduling algorithms execute sweeps in the minimum possible stage count. Observed parallel efficiencies agree well with our performance model. An older version of our PDT transport code achieves almost 80% parallel efficiency on 131,072 cores, on a weak-scaling problem with only one energy group, 80 directions, and 4096 cells/core. A newer version is less efficient at present-we are still improving its implementation - but achieves almost 60% parallel efficiency on 393,216 cores. These results conclusively demonstrate that sweeps can perform with high efficiency on core counts approaching 10 6 . (authors)

Provably optimal parallel transport sweeps on regular grids

Energy Technology Data Exchange (ETDEWEB)

Adams, M. P.; Adams, M. L.; Hawkins, W. D. [Dept. of Nuclear Engineering, Texas A and M University, 3133 TAMU, College Station, TX 77843-3133 (United States); Smith, T.; Rauchwerger, L.; Amato, N. M. [Dept. of Computer Science and Engineering, Texas A and M University, 3133 TAMU, College Station, TX 77843-3133 (United States); Bailey, T. S.; Falgout, R. D. [Lawrence Livermore National Laboratory (United States)

2013-07-01

We have found provably optimal algorithms for full-domain discrete-ordinate transport sweeps on regular grids in 3D Cartesian geometry. We describe these algorithms and sketch a 'proof that they always execute the full eight-octant sweep in the minimum possible number of stages for a given P{sub x} x P{sub y} x P{sub z} partitioning. Computational results demonstrate that our optimal scheduling algorithms execute sweeps in the minimum possible stage count. Observed parallel efficiencies agree well with our performance model. An older version of our PDT transport code achieves almost 80% parallel efficiency on 131,072 cores, on a weak-scaling problem with only one energy group, 80 directions, and 4096 cells/core. A newer version is less efficient at present-we are still improving its implementation - but achieves almost 60% parallel efficiency on 393,216 cores. These results conclusively demonstrate that sweeps can perform with high efficiency on core counts approaching 10{sup 6}. (authors)

Multi-objective parallel particle swarm optimization for day-ahead Vehicle-to-Grid scheduling

DEFF Research Database (Denmark)

Soares, Joao; Vale, Zita; Canizes, Bruno

2013-01-01

This paper presents a methodology for multi-objective day-ahead energy resource scheduling for smart grids considering intensive use of distributed generation and Vehicle-To-Grid (V2G). The main focus is the application of weighted Pareto to a multi-objective parallel particle swarm approach aiming...... to solve the dual-objective V2G scheduling: minimizing total operation costs and maximizing V2G income. A realistic mathematical formulation, considering the network constraints and V2G charging and discharging efficiencies is presented and parallel computing is applied to the Pareto weights. AC power flow...

Parallel Reservoir Simulations with Sparse Grid Techniques and Applications to Wormhole Propagation

KAUST Repository

Wu, Yuanqing

2015-09-08

In this work, two topics of reservoir simulations are discussed. The first topic is the two-phase compositional flow simulation in hydrocarbon reservoir. The major obstacle that impedes the applicability of the simulation code is the long run time of the simulation procedure, and thus speeding up the simulation code is necessary. Two means are demonstrated to address the problem: parallelism in physical space and the application of sparse grids in parameter space. The parallel code can gain satisfactory scalability, and the sparse grids can remove the bottleneck of flash calculations. Instead of carrying out the flash calculation in each time step of the simulation, a sparse grid approximation of all possible results of the flash calculation is generated before the simulation. Then the constructed surrogate model is evaluated to approximate the flash calculation results during the simulation. The second topic is the wormhole propagation simulation in carbonate reservoir. In this work, different from the traditional simulation technique relying on the Darcy framework, we propose a new framework called Darcy-Brinkman-Forchheimer framework to simulate wormhole propagation. Furthermore, to process the large quantity of cells in the simulation grid and shorten the long simulation time of the traditional serial code, standard domain-based parallelism is employed, using the Hypre multigrid library. In addition to that, a new technique called “experimenting field approach” to set coefficients in the model equations is introduced. In the 2D dissolution experiments, different configurations of wormholes and a series of properties simulated by both frameworks are compared. We conclude that the numerical results of the DBF framework are more like wormholes and more stable than the Darcy framework, which is a demonstration of the advantages of the DBF framework. The scalability of the parallel code is also evaluated, and good scalability can be achieved. Finally, a mixed

Dynamic stability calculations for power grids employing a parallel computer

Energy Technology Data Exchange (ETDEWEB)

Schmidt, K

1982-06-01

The aim of dynamic contingency calculations in power systems is to estimate the effects of assumed disturbances, such as loss of generation. Due to the large dimensions of the problem these simulations require considerable computing time and costs, to the effect that they are at present only used in a planning state but not for routine checks in power control stations. In view of the homogeneity of the problem, where a multitude of equal generator models, having different parameters, are to be integrated simultaneously, the use of a parallel computer looks very attractive. The results of this study employing a prototype parallel computer (SMS 201) are presented. It consists of up to 128 equal microcomputers bus-connected to a control computer. Each of the modules is programmed to simulate a node of the power grid. Generators with their associated control are represented by models of 13 states each. Passive nodes are complemented by 'phantom'-generators, so that the whole power grid is homogenous, thus removing the need for load-flow-iterations. Programming of microcomputers is essentially performed in FORTRAN.

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.

Decision Optimization for Power Grid Operating Conditions with High- and Low-Voltage Parallel Loops

Directory of Open Access Journals (Sweden)

Dong Yang

2017-05-01

Full Text Available With the development of higher-voltage power grids, the high- and low-voltage parallel loops are emerging, which lead to energy losses and even threaten the security and stability of power systems. The multi-infeed high-voltage direct current (HVDC configurations widely appearing in AC/DC interconnected power systems make this situation even worse. Aimed at energy saving and system security, a decision optimization method for power grid operating conditions with high- and low-voltage parallel loops is proposed in this paper. Firstly, considering hub substation distribution and power grid structure, parallel loop opening schemes are generated with GN (Girvan-Newman algorithms. Then, candidate opening schemes are preliminarily selected from all these generated schemes based on a filtering index. Finally, with the influence on power system security, stability and operation economy in consideration, an evaluation model for candidate opening schemes is founded based on analytic hierarchy process (AHP. And a fuzzy evaluation algorithm is used to find the optimal scheme. Simulation results of a New England 39-bus system and an actual power system validate the effectiveness and superiority of this proposed method.

A fast pulse design for parallel excitation with gridding conjugate gradient.

Science.gov (United States)

Feng, Shuo; Ji, Jim

2013-01-01

Parallel excitation (pTx) is recognized as a crucial technique in high field MRI to address the transmit field inhomogeneity problem. However, it can be time consuming to design pTx pulses which is not desirable. In this work, we propose a pulse design with gridding conjugate gradient (CG) based on the small-tip-angle approximation. The two major time consuming matrix-vector multiplications are substituted by two operators which involves with FFT and gridding only. Simulation results have shown that the proposed method is 3 times faster than conventional method and the memory cost is reduced by 1000 times.

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.

Reduced-Order Structure-Preserving Model for Parallel-Connected Three-Phase Grid-Tied Inverters

Energy Technology Data Exchange (ETDEWEB)

Johnson, Brian B [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Purba, Victor [University of Minnesota; Jafarpour, Saber [University of California Santa-Barbara; Bullo, Francesco [University of California Santa-Barbara; Dhople, Sairaj V. [University of Minnesota

2017-08-21

Next-generation power networks will contain large numbers of grid-connected inverters satisfying a significant fraction of system load. Since each inverter model has a relatively large number of dynamic states, it is impractical to analyze complex system models where the full dynamics of each inverter are retained. To address this challenge, we derive a reduced-order structure-preserving model for parallel-connected grid-tied three-phase inverters. Here, each inverter in the system is assumed to have a full-bridge topology, LCL filter at the point of common coupling, and the control architecture for each inverter includes a current controller, a power controller, and a phase-locked loop for grid synchronization. We outline a structure-preserving reduced-order inverter model with lumped parameters for the setting where the parallel inverters are each designed such that the filter components and controller gains scale linearly with the power rating. By structure preserving, we mean that the reduced-order three-phase inverter model is also composed of an LCL filter, a power controller, current controller, and PLL. We show that the system of parallel inverters can be modeled exactly as one aggregated inverter unit and this equivalent model has the same number of dynamical states as any individual inverter in the system. Numerical simulations validate the reduced-order model.

Reduced-Order Structure-Preserving Model for Parallel-Connected Three-Phase Grid-Tied Inverters: Preprint

Energy Technology Data Exchange (ETDEWEB)

Johnson, Brian B [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Purba, Victor [University of Minnesota; Jafarpour, Saber [University of California, Santa Barbara; Bullo, Francesco [University of California, Santa Barbara; Dhople, Sairaj [University of Minnesota

2017-08-31

Given that next-generation infrastructures will contain large numbers of grid-connected inverters and these interfaces will be satisfying a growing fraction of system load, it is imperative to analyze the impacts of power electronics on such systems. However, since each inverter model has a relatively large number of dynamic states, it would be impractical to execute complex system models where the full dynamics of each inverter are retained. To address this challenge, we derive a reduced-order structure-preserving model for parallel-connected grid-tied three-phase inverters. Here, each inverter in the system is assumed to have a full-bridge topology, LCL filter at the point of common coupling, and the control architecture for each inverter includes a current controller, a power controller, and a phase-locked loop for grid synchronization. We outline a structure-preserving reduced-order inverter model for the setting where the parallel inverters are each designed such that the filter components and controller gains scale linearly with the power rating. By structure preserving, we mean that the reduced-order three-phase inverter model is also composed of an LCL filter, a power controller, current controller, and PLL. That is, we show that the system of parallel inverters can be modeled exactly as one aggregated inverter unit and this equivalent model has the same number of dynamical states as an individual inverter in the paralleled system. Numerical simulations validate the reduced-order models.

Hybrid islanding detection method by using grid impedance estimation in parallel-inverters-based microgrid

DEFF Research Database (Denmark)

Ghzaiel, Walid; Jebali-Ben Ghorbal, Manel; Slama-Belkhodja, Ilhem

2014-01-01

This paper presents a hybrid islanding detection algorithm integrated on the distributed generation unit more close to the point of common coupling of a Microgrid based on parallel inverters where one of them is responsible to control the system. The method is based on resonance excitation under...... parameters, both resistive and inductive parts, from the injected resonance frequency determination. Finally, the inverter will disconnect the microgrid from the faulty grid and reconnect the parallel inverter system to the controllable distributed system in order to ensure high power quality. This paper...... shows that grid impedance variation detection estimation can be an efficient method for islanding detection in microgrid systems. Theoretical analysis and simulation results are presented to validate the proposed method....

Building Input Adaptive Parallel Applications: A Case Study of Sparse Grid Interpolation

KAUST Repository

Murarasu, Alin

2012-12-01

The well-known power wall resulting in multi-cores requires special techniques for speeding up applications. In this sense, parallelization plays a crucial role. Besides standard serial optimizations, techniques such as input specialization can also bring a substantial contribution to the speedup. By identifying common patterns in the input data, we propose new algorithms for sparse grid interpolation that accelerate the state-of-the-art non-specialized version. Sparse grid interpolation is an inherently hierarchical method of interpolation employed for example in computational steering applications for decompressing highdimensional simulation data. In this context, improving the speedup is essential for real-time visualization. Using input specialization, we report a speedup of up to 9x over the nonspecialized version. The paper covers the steps we took to reach this speedup by means of input adaptivity. Our algorithms will be integrated in fastsg, a library for fast sparse grid interpolation. © 2012 IEEE.

Dynamic workload balancing of parallel applications with user-level scheduling on the Grid

CERN Document Server

Korkhov, Vladimir V; Krzhizhanovskaya, Valeria V

2009-01-01

This paper suggests a hybrid resource management approach for efficient parallel distributed computing on the Grid. It operates on both application and system levels, combining user-level job scheduling with dynamic workload balancing algorithm that automatically adapts a parallel application to the heterogeneous resources, based on the actual resource parameters and estimated requirements of the application. The hybrid environment and the algorithm for automated load balancing are described, the influence of resource heterogeneity level is measured, and the speedup achieved with this technique is demonstrated for different types of applications and resources.

BLAST in Gid (BiG): A Grid-Enabled Software Architecture and Implementation of Parallel and Sequential BLAST

International Nuclear Information System (INIS)

Aparicio, G.; Blanquer, I.; Hernandez, V.; Segrelles, D.

2007-01-01

The integration of High-performance computing tools is a key issue in biomedical research. Many computer-based applications have been migrated to High-Performance computers to deal with their computing and storage needs such as BLAST. However, the use of clusters and computing farm presents problems in scalability. The use of a higher layer of parallelism that splits the task into highly independent long jobs that can be executed in parallel can improve the performance maintaining the efficiency. Grid technologies combined with parallel computing resources are an important enabling technology. This work presents a software architecture for executing BLAST in a International Grid Infrastructure that guarantees security, scalability and fault tolerance. The software architecture is modular an adaptable to many other high-throughput applications, both inside the field of bio computing and outside. (Author)

11th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing

CERN Document Server

Barolli, Leonard; Amato, Flora

2017-01-01

P2P, Grid, Cloud and Internet computing technologies have been very fast established as breakthrough paradigms for solving complex problems by enabling aggregation and sharing of an increasing variety of distributed computational resources at large scale. The aim of this volume is to provide latest research findings, innovative research results, methods and development techniques from both theoretical and practical perspectives related to P2P, Grid, Cloud and Internet computing as well as to reveal synergies among such large scale computing paradigms. This proceedings volume presents the results of the 11th International Conference on P2P, Parallel, Grid, Cloud And Internet Computing (3PGCIC-2016), held November 5-7, 2016, at Soonchunhyang University, Asan, Korea.

α spectrometer of parallel plate grid ionization chamber of high energy resolution

International Nuclear Information System (INIS)

Tong Boting; Wang Jianqing; Dong Mingli; Tang Peijia; Wang Xiaorong; Lin Cansheng

2000-01-01

Parallel plate grid ionization chamber with cathode area of 300 cm 2 was developed and applied to detect minimum α-emitters. It consist of a vacuum system, a gas cycle system of the parallel plate grid ionization chamber, electronics (a high voltage supply, a pre-amplifier and a main amplifier) and a computer-multichannel analyzer. The energy resolution is 23 keV FWHM for the 244 Cm electrostatic precipitated source. The integral background is typically 10 counts/h between 4 and 6 MeV. The detector efficiency is 50%. The minimum detecting activity is 3 x 10 -4 Bq (3σ, 30 hours). This spectrometer is suitable for detecting various samples, such as samples of the soil, water, air, bion, food, structural material, geology, archaeology, α-emitters of after processing and measuring α activity of accounting for and control of nuclear material and monitoring the artificial radioactivity nuclides of environment samples around nuclear facilities. The spectrometer is equipped with apparatus for preparing large area α source by using vacuum deposition or ultrasonic pulverization. The operating program of preparing source is simple. The source thickness can be kept in 40-60 μm/cm 2

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.

Resonance Interaction of Multi-Parallel Grid-Connected Inverters with LCL Filter

DEFF Research Database (Denmark)

Lu, Minghui; Wang, Xiongfei; Loh, Poh Chiang

2017-01-01

This letter investigates the resonance characteristics and stability problem caused by the interactions of multiparallel LCL-filtered inverters. Compared to single grid-connected inverter, the multiinverter system presents a more challenging resonance issue, where the inverter interactions may...... excite multiple resonances at various frequencies. This letter proposes a modeling and analysis method based on the current separation scheme. It reveals that an interactive resonant current that circulates between the paralleled three-phase inverters may arise, depending on the current distribution...

Comparative evaluation of passive damping topologies for parallel grid-connected converters with LCL filters

DEFF Research Database (Denmark)

Beres, Remus Narcis; Wang, Xiongfei; Blaabjerg, Frede

2014-01-01

that with grid-side current feedback the stability may be improved in parallel operation while for converter-side feedback, the stability of the current controller is always decreased compared with the single converter case. The proposed stability analysis and experimental tests demonstrates the theoretical......In this paper a comprehensive analysis of three passive damping methods is done under parallel operation of multiple current controlled voltage source converters. One could argue that a well damped LCL filter with no peaking in the output impedance and stable designed controllers will turn...

Passivity Enhancement in Renewable Energy Source Based Power Plant With Paralleled Grid-Connected VSIs

DEFF Research Database (Denmark)

Bai, Haofeng; Wang, Xiongfei; Blaabjerg, Frede

2017-01-01

Harmonic instability is threatening the operation of renewable energy based power plants where multiple gridconnected VSIs are connected in parallel. To analyze and improve the stability of the grid-connected VSIs, the real part of the output admittance of the VSIs is first investigated......-connected VSIs can improve the stability of the renewable power plant....

Decreasing Data Analytics Time: Hybrid Architecture MapReduce-Massive Parallel Processing for a Smart Grid

Directory of Open Access Journals (Sweden)

Abdeslam Mehenni

2017-03-01

Full Text Available As our populations grow in a world of limited resources enterprise seek ways to lighten our load on the planet. The idea of modifying consumer behavior appears as a foundation for smart grids. Enterprise demonstrates the value available from deep analysis of electricity consummation histories, consumers’ messages, and outage alerts, etc. Enterprise mines massive structured and unstructured data. In a nutshell, smart grids result in a flood of data that needs to be analyzed, for better adjust to demand and give customers more ability to delve into their power consumption. Simply put, smart grids will increasingly have a flexible data warehouse attached to them. The key driver for the adoption of data management strategies is clearly the need to handle and analyze the large amounts of information utilities are now faced with. New approaches to data integration are nauseating moment; Hadoop is in fact now being used by the utility to help manage the huge growth in data whilst maintaining coherence of the Data Warehouse. In this paper we define a new Meter Data Management System Architecture repository that differ with three leaders MDMS, where we use MapReduce programming model for ETL and Parallel DBMS in Query statements(Massive Parallel Processing MPP.

Biomedical applications on the GRID efficient management of parallel jobs

CERN Document Server

Moscicki, Jakub T; Lee Hurng Chun; Lin, S C; Pia, Maria Grazia

2004-01-01

Distributed computing based on the Master-Worker and PULL interaction model is applicable to a number of applications in high energy physics, medical physics and bio-informatics. We demonstrate a realistic medical physics use-case of a dosimetric system for brachytherapy using distributed Grid resources. We present the efficient techniques for running parallel jobs in a case of the BLAST, a gene sequencing application, as well as for the Monte Carlo simulation based on Geant4. We present a strategy for improving the runtime performance and robustness of the jobs as well as for the minimization of the development time needed to migrate the applications to a distributed environment.

3D magnetospheric parallel hybrid multi-grid method applied to planet–plasma interactions

Energy Technology Data Exchange (ETDEWEB)

Leclercq, L., E-mail: ludivine.leclercq@latmos.ipsl.fr [LATMOS/IPSL, UVSQ Université Paris-Saclay, UPMC Univ. Paris 06, CNRS, Guyancourt (France); Modolo, R., E-mail: ronan.modolo@latmos.ipsl.fr [LATMOS/IPSL, UVSQ Université Paris-Saclay, UPMC Univ. Paris 06, CNRS, Guyancourt (France); Leblanc, F. [LATMOS/IPSL, UPMC Univ. Paris 06 Sorbonne Universités, UVSQ, CNRS, Paris (France); Hess, S. [ONERA, Toulouse (France); Mancini, M. [LUTH, Observatoire Paris-Meudon (France)

2016-03-15

We present a new method to exploit multiple refinement levels within a 3D parallel hybrid model, developed to study planet–plasma interactions. This model is based on the hybrid formalism: ions are kinetically treated whereas electrons are considered as a inertia-less fluid. Generally, ions are represented by numerical particles whose size equals the volume of the cells. Particles that leave a coarse grid subsequently entering a refined region are split into particles whose volume corresponds to the volume of the refined cells. The number of refined particles created from a coarse particle depends on the grid refinement rate. In order to conserve velocity distribution functions and to avoid calculations of average velocities, particles are not coalesced. Moreover, to ensure the constancy of particles' shape function sizes, the hybrid method is adapted to allow refined particles to move within a coarse region. Another innovation of this approach is the method developed to compute grid moments at interfaces between two refinement levels. Indeed, the hybrid method is adapted to accurately account for the special grid structure at the interfaces, avoiding any overlapping grid considerations. Some fundamental test runs were performed to validate our approach (e.g. quiet plasma flow, Alfven wave propagation). Lastly, we also show a planetary application of the model, simulating the interaction between Jupiter's moon Ganymede and the Jovian plasma.

Parallel SOR methods with a parabolic-diffusion acceleration technique for solving an unstructured-grid Poisson equation on 3D arbitrary geometries

Science.gov (United States)

Zapata, M. A. Uh; Van Bang, D. Pham; Nguyen, K. D.

2016-05-01

This paper presents a parallel algorithm for the finite-volume discretisation of the Poisson equation on three-dimensional arbitrary geometries. The proposed method is formulated by using a 2D horizontal block domain decomposition and interprocessor data communication techniques with message passing interface. The horizontal unstructured-grid cells are reordered according to the neighbouring relations and decomposed into blocks using a load-balanced distribution to give all processors an equal amount of elements. In this algorithm, two parallel successive over-relaxation methods are presented: a multi-colour ordering technique for unstructured grids based on distributed memory and a block method using reordering index following similar ideas of the partitioning for structured grids. In all cases, the parallel algorithms are implemented with a combination of an acceleration iterative solver. This solver is based on a parabolic-diffusion equation introduced to obtain faster solutions of the linear systems arising from the discretisation. Numerical results are given to evaluate the performances of the methods showing speedups better than linear.

Parallel discontinuous Galerkin FEM for computing hyperbolic conservation law on unstructured grids

Science.gov (United States)

Ma, Xinrong; Duan, Zhijian

2018-04-01

High-order resolution Discontinuous Galerkin finite element methods (DGFEM) has been known as a good method for solving Euler equations and Navier-Stokes equations on unstructured grid, but it costs too much computational resources. An efficient parallel algorithm was presented for solving the compressible Euler equations. Moreover, the multigrid strategy based on three-stage three-order TVD Runge-Kutta scheme was used in order to improve the computational efficiency of DGFEM and accelerate the convergence of the solution of unsteady compressible Euler equations. In order to make each processor maintain load balancing, the domain decomposition method was employed. Numerical experiment performed for the inviscid transonic flow fluid problems around NACA0012 airfoil and M6 wing. The results indicated that our parallel algorithm can improve acceleration and efficiency significantly, which is suitable for calculating the complex flow fluid.

Techniques and environments for big data analysis parallel, cloud, and grid computing

CERN Document Server

Dehuri, Satchidananda; Kim, Euiwhan; Wang, Gi-Name

2016-01-01

This volume is aiming at a wide range of readers and researchers in the area of Big Data by presenting the recent advances in the fields of Big Data Analysis, as well as the techniques and tools used to analyze it. The book includes 10 distinct chapters providing a concise introduction to Big Data Analysis and recent Techniques and Environments for Big Data Analysis. It gives insight into how the expensive fitness evaluation of evolutionary learning can play a vital role in big data analysis by adopting Parallel, Grid, and Cloud computing environments.

Short term scheduling of multiple grid-parallel PEM fuel cells for microgrid applications

Energy Technology Data Exchange (ETDEWEB)

El-Sharkh, M.Y.; Rahman, A.; Alam, M.S. [Dept. of Electrical and Computer Engineering, University of South Alabama, Mobile, AL 36688 (United States)

2010-10-15

This paper presents a short term scheduling scheme for multiple grid-parallel PEM fuel cell power plants (FCPPs) connected to supply electrical and thermal energy to a microgrid community. As in the case of regular power plants, short term scheduling of FCPP is also a cost-based optimization problem that includes the cost of operation, thermal power recovery, and the power trade with the local utility grid. Due to the ability of the microgrid community to trade power with the local grid, the power balance constraint is not applicable, other constraints like the real power operating limits of the FCPP, and minimum up and down time are therefore used. To solve the short term scheduling problem of the FCPPs, a hybrid technique based on evolutionary programming (EP) and hill climbing technique (HC) is used. The EP is used to estimate the optimal schedule and the output power from each FCPP. The HC technique is used to monitor the feasibility of the solution during the search process. The short term scheduling problem is used to estimate the schedule and the electrical and thermal power output of five FCPPs supplying a maximum power of 300 kW. (author)

Operation and Control of a Direct-Driven PMSG-Based Wind Turbine System with an Auxiliary Parallel Grid-Side Converter

Directory of Open Access Journals (Sweden)

Jiawei Chu

2013-07-01

Full Text Available In this paper, based on the similarity, in structure and principle, between a grid-connected converter for a direct-driven permanent magnet synchronous generator (D-PMSG and an active power filter (APF, a new D-PMSG-based wind turbine (WT system configuration that includes not only an auxiliary converter in parallel with the grid-side converter, but also a coordinated control strategy, is proposed to enhance the low voltage ride through (LVRT capability and improve power quality. During normal operation, the main grid-side converter maintains the DC-link voltage constant, whereas the auxiliary grid-side converter functions as an APF with harmonic suppression and reactive power compensation to improve the power quality. During grid faults, a hierarchical coordinated control scheme for the generator-side converter, main grid-side converter and auxiliary grid-side converter, depending on the grid voltage sags, is presented to enhance the LVRT capability of the direct-driven PMSG WT. The feasibility and the effectiveness of the proposed system’s topology and hierarchical coordinated control strategy were verified using MATLAB/Simulink simulations.

Efficient job handling in the GRID short deadline, interactivity, fault tolerance and parallelism

CERN Document Server

Moscicki, Jakub

2006-01-01

The major GRID infastructures are designed mainly for batch-oriented computing with coarse-grained jobs and relatively high job turnaround time. However many practical applications in natural and physical sciences may be easily parallelized and run as a set of smaller tasks which require little or no synchronization and which may be scheduled in a more efficient way. The Distributed Analysis Environment Framework (DIANE), is a Master-Worker execution skeleton for applications, which complements the GRID middleware stack. Automatic failure recovery and task dispatching policies enable an easy customization of the behaviour of the framework in a dynamic and non-reliable computing environment. We demonstrate the experience of using the framework with several diverse real-life applications, including Monte Carlo Simulation, Physics Data Analysis and Biotechnology. The interfacing of existing sequential applications from the point of view of non-expert user is made easy, also for legacy applications. We analyze th...

A hybrid damping method for LLCL-filter based grid-tied inverter with a digital filter and an RC parallel passive damper

DEFF Research Database (Denmark)

Wu, Weimin; Lin, Zhe; Sun, Yunjie

2013-01-01

Grid-tied inverters have been widely used to inject the renewable energies into the distributed power generation systems. However, a large variation of the grid impedance challenges the stability of the high-order power filter based grid-tied inverter. Many passive and active damping methods have...... been proposed to overcome this issue. Recently, a composite passive damping method for a high-order power filter based grid-tied inverter with an RC parallel damper and an RL series damper was presented to eliminate this problem, but at the cost of more material and power losses. In this paper...

Grid-based Parallel Data Streaming Implemented for the Gyrokinetic Toroidal Code

International Nuclear Information System (INIS)

Klasky, S.; Ethier, S.; Lin, Z.; Martins, K.; McCune, D.; Samtaney, R.

2003-01-01

We have developed a threaded parallel data streaming approach using Globus to transfer multi-terabyte simulation data from a remote supercomputer to the scientist's home analysis/visualization cluster, as the simulation executes, with negligible overhead. Data transfer experiments show that this concurrent data transfer approach is more favorable compared with writing to local disk and then transferring this data to be post-processed. The present approach is conducive to using the grid to pipeline the simulation with post-processing and visualization. We have applied this method to the Gyrokinetic Toroidal Code (GTC), a 3-dimensional particle-in-cell code used to study microturbulence in magnetic confinement fusion from first principles plasma theory

Spacer grid corner gusset

International Nuclear Information System (INIS)

Larson, J.G.

1984-01-01

There is provided a spacer grid for a bundle of longitudinally extending rods in spaced generally parallel relationship comprising spacing means for holding the rods in spaced generally parallel relationship; the spacing means includes at least one exterior grid strip circumscribing the bundle of rods along the periphery thereof; with at least one exterior grid strip having a first edge defining the boundary of the strip in one longitudinal direction and a second edge defining the boundary of the strip in the other longitudinal direction; with at least one exterior grid strip having at least one band formed therein parallel to the longitudinal direction; a plurality of corner gussets truncating each of a plurality of corners formed by at least one band and the first edge and the second edge

Using Hadoop MapReduce for Parallel Genetic Algorithms: A Comparison of the Global, Grid and Island Models.

Science.gov (United States)

Ferrucci, Filomena; Salza, Pasquale; Sarro, Federica

2017-06-29

The need to improve the scalability of Genetic Algorithms (GAs) has motivated the research on Parallel Genetic Algorithms (PGAs), and different technologies and approaches have been used. Hadoop MapReduce represents one of the most mature technologies to develop parallel algorithms. Based on the fact that parallel algorithms introduce communication overhead, the aim of the present work is to understand if, and possibly when, the parallel GAs solutions using Hadoop MapReduce show better performance than sequential versions in terms of execution time. Moreover, we are interested in understanding which PGA model can be most effective among the global, grid, and island models. We empirically assessed the performance of these three parallel models with respect to a sequential GA on a software engineering problem, evaluating the execution time and the achieved speedup. We also analysed the behaviour of the parallel models in relation to the overhead produced by the use of Hadoop MapReduce and the GAs' computational effort, which gives a more machine-independent measure of these algorithms. We exploited three problem instances to differentiate the computation load and three cluster configurations based on 2, 4, and 8 parallel nodes. Moreover, we estimated the costs of the execution of the experimentation on a potential cloud infrastructure, based on the pricing of the major commercial cloud providers. The empirical study revealed that the use of PGA based on the island model outperforms the other parallel models and the sequential GA for all the considered instances and clusters. Using 2, 4, and 8 nodes, the island model achieves an average speedup over the three datasets of 1.8, 3.4, and 7.0 times, respectively. Hadoop MapReduce has a set of different constraints that need to be considered during the design and the implementation of parallel algorithms. The overhead of data store (i.e., HDFS) accesses, communication, and latency requires solutions that reduce data store

Near-Body Grid Adaption for Overset Grids

Science.gov (United States)

Buning, Pieter G.; Pulliam, Thomas H.

2016-01-01

A solution adaption capability for curvilinear near-body grids has been implemented in the OVERFLOW overset grid computational fluid dynamics code. The approach follows closely that used for the Cartesian off-body grids, but inserts refined grids in the computational space of original near-body grids. Refined curvilinear grids are generated using parametric cubic interpolation, with one-sided biasing based on curvature and stretching ratio of the original grid. Sensor functions, grid marking, and solution interpolation tasks are implemented in the same fashion as for off-body grids. A goal-oriented procedure, based on largest error first, is included for controlling growth rate and maximum size of the adapted grid system. The adaption process is almost entirely parallelized using MPI, resulting in a capability suitable for viscous, moving body simulations. Two- and three-dimensional examples are presented.

Communication technologies in smart grid

Directory of Open Access Journals (Sweden)

Miladinović Nikola

2013-01-01

Full Text Available The role of communication technologies in Smart Grid lies in integration of large number of devices into one telecommunication system. This paper provides an overview of the technologies currently in use in electric power grid, that are not necessarily in compliance with the Smart Grid concept. Considering that the Smart Grid is open to the flow of information in all directions, it is necessary to provide reliability, protection and security of information.

Generalized coupling resonance modeling, analysis, and active damping of multi-parallel inverters in microgrid operating in grid-connected mode

DEFF Research Database (Denmark)

Chen, Zhiyong; Chen, Yandong; Guerrero, Josep M.

2016-01-01

This paper firstly presents an equivalent coupling circuit modeling of multi-parallel inverters in microgrid operating in grid-connected mode. By using the model, the coupling resonance phenomena are explicitly investigated through the mathematical approach, and the intrinsic and extrinsic...

Mapping robust parallel multigrid algorithms to scalable memory architectures

Science.gov (United States)

Overman, Andrea; Vanrosendale, John

1993-01-01

The convergence rate of standard multigrid algorithms degenerates on problems with stretched grids or anisotropic operators. The usual cure for this is the use of line or plane relaxation. However, multigrid algorithms based on line and plane relaxation have limited and awkward parallelism and are quite difficult to map effectively to highly parallel architectures. Newer multigrid algorithms that overcome anisotropy through the use of multiple coarse grids rather than relaxation are better suited to massively parallel architectures because they require only simple point-relaxation smoothers. In this paper, we look at the parallel implementation of a V-cycle multiple semicoarsened grid (MSG) algorithm on distributed-memory architectures such as the Intel iPSC/860 and Paragon computers. The MSG algorithms provide two levels of parallelism: parallelism within the relaxation or interpolation on each grid and across the grids on each multigrid level. Both levels of parallelism must be exploited to map these algorithms effectively to parallel architectures. This paper describes a mapping of an MSG algorithm to distributed-memory architectures that demonstrates how both levels of parallelism can be exploited. The result is a robust and effective multigrid algorithm for distributed-memory machines.

Satin: A high-level and efficient grid programming model

NARCIS (Netherlands)

van Nieuwpoort, R.V.; Wrzesinska, G.; Jacobs, C.J.H.; Bal, H.E.

2010-01-01

Computational grids have an enormous potential to provide compute power. However, this power remains largely unexploited today for most applications, except trivially parallel programs. Developing parallel grid applications simply is too difficult. Grids introduce several problems not encountered

A Parallel Multigrid Solver for Viscous Flows on Anisotropic Structured Grids

Science.gov (United States)

Prieto, Manuel; Montero, Ruben S.; Llorente, Ignacio M.; Bushnell, Dennis M. (Technical Monitor)

2001-01-01

This paper presents an efficient parallel multigrid solver for speeding up the computation of a 3-D model that treats the flow of a viscous fluid over a flat plate. The main interest of this simulation lies in exhibiting some basic difficulties that prevent optimal multigrid efficiencies from being achieved. As the computing platform, we have used Coral, a Beowulf-class system based on Intel Pentium processors and equipped with GigaNet cLAN and switched Fast Ethernet networks. Our study not only examines the scalability of the solver but also includes a performance evaluation of Coral where the investigated solver has been used to compare several of its design choices, namely, the interconnection network (GigaNet versus switched Fast-Ethernet) and the node configuration (dual nodes versus single nodes). As a reference, the performance results have been compared with those obtained with the NAS-MG benchmark.

Grid-Connected Inverter for Distributed Generation in Microgrid

DEFF Research Database (Denmark)

Naderipour, Amirreza; Miveh, Mohammad Reza; Guerrero, Josep M.

for power generation. DGS units can operate in parallel to the main grid or in a Microgrid (MG) mode. An MG is a discrete energy system consisting of DGSs and loads capable of operating in parallel with, or independently from, the main grid. Meanwhile, Grid-Connected Inverters (GCIs) are typically used...

Applications of Parallel Processing in Mobile Banking

Directory of Open Access Journals (Sweden)

2007-01-01

Full Text Available The future of mobile banking will be represented by such applications that support mobile, Internet banking and EFT (Electronic Funds Transfer transactions in a single user interface. In such a way, the mobile banking will be able to cover all the types of applications demanded at the market level. The parallel processing of credit card bank transactions could be performed with the help of a grid network. Excluding some limitations, the grid processing offers huge opportunities to exploit the parallelism. For this reason, a lot of applications of waiting queues in grid processing were developed in the last years. Grid networks represent a distinctive and very modern field of the parallel and distributed processing.

Grid Connected Solar PV System with SEPIC Converter Compared with Parallel Boost Converter Based MPPT

Directory of Open Access Journals (Sweden)

T. Ajith Bosco Raj

2014-01-01

Full Text Available The main objective of this work is to study the behaviour of the solar PV systems and model the efficient Grid-connected solar power system. The DC-DC MPPT circuit using chaotic pulse width modulation has been designed to track maximum power from solar PV module. The conversion efficiency of the proposed MPPT system is increased when CPWM is used as a control scheme. This paper also proposes a simplified multilevel (seven level inverter for a grid-connected photovoltaic system. The primary goal of these systems is to increase the energy injected to the grid by keeping track of the maximum power point of the panel, by reducing the switching frequency, and by providing high reliability. The maximum power has been tracked experimentally. It is compared with parallel boost converter. Also this model is based on mathematical equations and is described through an equivalent circuit including a PV source with MPPT, a diode, a series resistor, a shunt resistor, and dual boost converter with active snubber circuit. This model can extract PV power and boost by using dual boost converter with active snubber. By using this method the overall system efficiency is improved thereby reducing the switching losses and cost.

Parallel Computational Fluid Dynamics 2007 : Implementations and Experiences on Large Scale and Grid Computing

CERN Document Server

2009-01-01

At the 19th Annual Conference on Parallel Computational Fluid Dynamics held in Antalya, Turkey, in May 2007, the most recent developments and implementations of large-scale and grid computing were presented. This book, comprised of the invited and selected papers of this conference, details those advances, which are of particular interest to CFD and CFD-related communities. It also offers the results related to applications of various scientific and engineering problems involving flows and flow-related topics. Intended for CFD researchers and graduate students, this book is a state-of-the-art presentation of the relevant methodology and implementation techniques of large-scale computing.

The MicroGrid: A Scientific Tool for Modeling Computational Grids

Directory of Open Access Journals (Sweden)

H.J. Song

2000-01-01

Full Text Available The complexity and dynamic nature of the Internet (and the emerging Computational Grid demand that middleware and applications adapt to the changes in configuration and availability of resources. However, to the best of our knowledge there are no simulation tools which support systematic exploration of dynamic Grid software (or Grid resource behavior. We describe our vision and initial efforts to build tools to meet these needs. Our MicroGrid simulation tools enable Globus applications to be run in arbitrary virtual grid resource environments, enabling broad experimentation. We describe the design of these tools, and their validation on micro-benchmarks, the NAS parallel benchmarks, and an entire Grid application. These validation experiments show that the MicroGrid can match actual experiments within a few percent (2% to 4%.

Grid computing in large pharmaceutical molecular modeling.

Science.gov (United States)

Claus, Brian L; Johnson, Stephen R

2008-07-01

Most major pharmaceutical companies have employed grid computing to expand their compute resources with the intention of minimizing additional financial expenditure. Historically, one of the issues restricting widespread utilization of the grid resources in molecular modeling is the limited set of suitable applications amenable to coarse-grained parallelization. Recent advances in grid infrastructure technology coupled with advances in application research and redesign will enable fine-grained parallel problems, such as quantum mechanics and molecular dynamics, which were previously inaccessible to the grid environment. This will enable new science as well as increase resource flexibility to load balance and schedule existing workloads.

Parallelization Issues and Particle-In Codes.

Science.gov (United States)

Elster, Anne Cathrine

1994-01-01

"Everything should be made as simple as possible, but not simpler." Albert Einstein. The field of parallel scientific computing has concentrated on parallelization of individual modules such as matrix solvers and factorizers. However, many applications involve several interacting modules. Our analyses of a particle-in-cell code modeling charged particles in an electric field, show that these accompanying dependencies affect data partitioning and lead to new parallelization strategies concerning processor, memory and cache utilization. Our test-bed, a KSR1, is a distributed memory machine with a globally shared addressing space. However, most of the new methods presented hold generally for hierarchical and/or distributed memory systems. We introduce a novel approach that uses dual pointers on the local particle arrays to keep the particle locations automatically partially sorted. Complexity and performance analyses with accompanying KSR benchmarks, have been included for both this scheme and for the traditional replicated grids approach. The latter approach maintains load-balance with respect to particles. However, our results demonstrate it fails to scale properly for problems with large grids (say, greater than 128-by-128) running on as few as 15 KSR nodes, since the extra storage and computation time associated with adding the grid copies, becomes significant. Our grid partitioning scheme, although harder to implement, does not need to replicate the whole grid. Consequently, it scales well for large problems on highly parallel systems. It may, however, require load balancing schemes for non-uniform particle distributions. Our dual pointer approach may facilitate this through dynamically partitioned grids. We also introduce hierarchical data structures that store neighboring grid-points within the same cache -line by reordering the grid indexing. This alignment produces a 25% savings in cache-hits for a 4-by-4 cache. A consideration of the input data's effect on

Tests with films and film-screens using grid-mammography

International Nuclear Information System (INIS)

Wolf, G.; Kallinger, G.

1982-01-01

A comparison was made between mammography using grid-technique with a film-screen-system and mammography without grid, and with film-screens and also using industrial films. The image-quality of grid mammography looks like the same than using conventional techniques and industrial films. The problem of soft tissue grid techniques lies in the dose requirements, which was more than using film-screen-techniques without grid. New and improved recording systems, which reduce radiation dose when using the grid technique were analyzed. (orig.) [de

Analysis of a parallel multigrid algorithm

Science.gov (United States)

Chan, Tony F.; Tuminaro, Ray S.

1989-01-01

The parallel multigrid algorithm of Frederickson and McBryan (1987) is considered. This algorithm uses multiple coarse-grid problems (instead of one problem) in the hope of accelerating convergence and is found to have a close relationship to traditional multigrid methods. Specifically, the parallel coarse-grid correction operator is identical to a traditional multigrid coarse-grid correction operator, except that the mixing of high and low frequencies caused by aliasing error is removed. Appropriate relaxation operators can be chosen to take advantage of this property. Comparisons between the standard multigrid and the new method are made.

Efficient method to design RF pulses for parallel excitation MRI using gridding and conjugate gradient.

Science.gov (United States)

Feng, Shuo; Ji, Jim

2014-04-01

Parallel excitation (pTx) techniques with multiple transmit channels have been widely used in high field MRI imaging to shorten the RF pulse duration and/or reduce the specific absorption rate (SAR). However, the efficiency of pulse design still needs substantial improvement for practical real-time applications. In this paper, we present a detailed description of a fast pulse design method with Fourier domain gridding and a conjugate gradient method. Simulation results of the proposed method show that the proposed method can design pTx pulses at an efficiency 10 times higher than that of the conventional conjugate-gradient based method, without reducing the accuracy of the desirable excitation patterns.

MrGrid: a portable grid based molecular replacement pipeline.

Directory of Open Access Journals (Sweden)

Jason W Schmidberger

Full Text Available BACKGROUND: The crystallographic determination of protein structures can be computationally demanding and for difficult cases can benefit from user-friendly interfaces to high-performance computing resources. Molecular replacement (MR is a popular protein crystallographic technique that exploits the structural similarity between proteins that share some sequence similarity. But the need to trial permutations of search models, space group symmetries and other parameters makes MR time- and labour-intensive. However, MR calculations are embarrassingly parallel and thus ideally suited to distributed computing. In order to address this problem we have developed MrGrid, web-based software that allows multiple MR calculations to be executed across a grid of networked computers, allowing high-throughput MR. METHODOLOGY/PRINCIPAL FINDINGS: MrGrid is a portable web based application written in Java/JSP and Ruby, and taking advantage of Apple Xgrid technology. Designed to interface with a user defined Xgrid resource the package manages the distribution of multiple MR runs to the available nodes on the Xgrid. We evaluated MrGrid using 10 different protein test cases on a network of 13 computers, and achieved an average speed up factor of 5.69. CONCLUSIONS: MrGrid enables the user to retrieve and manage the results of tens to hundreds of MR calculations quickly and via a single web interface, as well as broadening the range of strategies that can be attempted. This high-throughput approach allows parameter sweeps to be performed in parallel, improving the chances of MR success.

Cloud feedback studies with a physics grid

Energy Technology Data Exchange (ETDEWEB)

Dipankar, Anurag [Max Planck Institute for Meteorology Hamburg; Stevens, Bjorn [Max Planck Institute for Meteorology Hamburg

2013-02-07

During this project the investigators implemented a fully parallel version of dual-grid approach in main frame code ICON, implemented a fully conservative first-order interpolation scheme for horizontal remapping, integrated UCLA-LES micro-scale model into ICON to run parallely in selected columns, and did cloud feedback studies on aqua-planet setup to evaluate the classical parameterization on a small domain. The micro-scale model may be run in parallel with the classical parameterization, or it may be run on a "physics grid" independent of the dynamics grid.

A Parallel Multiblock Structured Grid Method with Automated Interblocked Unstructured Grids for Chemically Reacting Flows

Science.gov (United States)

Spiegel, Seth Christian

An automated method for using unstructured grids to patch non- C0 interfaces between structured blocks has been developed in conjunction with a finite-volume method for solving chemically reacting flows on unstructured grids. Although the standalone unstructured solver, FVFLO-NCSU, is capable of resolving flows for high-speed aeropropulsion devices with complex geometries, unstructured-mesh algorithms are inherently inefficient when compared to their structured counterparts. However, the advantages of structured algorithms in developing a flow solution in a timely manner can be negated by the amount of time required to develop a mesh for complex geometries. The global domain can be split up into numerous smaller blocks during the grid-generation process to alleviate some of the difficulties in creating these complex meshes. An even greater abatement can be found by allowing the nodes on abutting block interfaces to be nonmatching or non-C 0 continuous. One code capable of solving chemically reacting flows on these multiblock grids is VULCAN, which uses a nonconservative approach for patching non-C0 block interfaces. The developed automated unstructured-grid patching algorithm has been installed within VULCAN to provide it the capability of a fully conservative approach for patching non-C0 block interfaces. Additionally, the FVFLO-NCSU solver algorithms have been deeply intertwined with the VULCAN source code to solve chemically reacting flows on these unstructured patches. Finally, the CGNS software library was added to the VULCAN postprocessor so structured and unstructured data can be stored in a single compact file. This final upgrade to VULCAN has been successfully installed and verified using test cases with particular interest towards those involving grids with non- C0 block interfaces.

Lincoln Laboratory Grid

Data.gov (United States)

Federal Laboratory Consortium — The Lincoln Laboratory Grid (LLGrid) is an interactive, on-demand parallel computing system that uses a large computing cluster to enable Laboratory researchers to...

Equivalent Simplification Method of Micro-Grid

OpenAIRE

Cai Changchun; Cao Xiangqin

2013-01-01

The paper concentrates on the equivalent simplification method for the micro-grid system connection into distributed network. The equivalent simplification method proposed for interaction study between micro-grid and distributed network. Micro-grid network, composite load, gas turbine synchronous generation, wind generation are equivalent simplification and parallel connect into the point of common coupling. A micro-grid system is built and three phase and single phase grounded faults are per...

Parallel algorithms for interactive manipulation of digital terrain models

Science.gov (United States)

Davis, E. W.; Mcallister, D. F.; Nagaraj, V.

1988-01-01

Interactive three-dimensional graphics applications, such as terrain data representation and manipulation, require extensive arithmetic processing. Massively parallel machines are attractive for this application since they offer high computational rates, and grid connected architectures provide a natural mapping for grid based terrain models. Presented here are algorithms for data movement on the massive parallel processor (MPP) in support of pan and zoom functions over large data grids. It is an extension of earlier work that demonstrated real-time performance of graphics functions on grids that were equal in size to the physical dimensions of the MPP. When the dimensions of a data grid exceed the processing array size, data is packed in the array memory. Windows of the total data grid are interactively selected for processing. Movement of packed data is needed to distribute items across the array for efficient parallel processing. Execution time for data movement was found to exceed that for arithmetic aspects of graphics functions. Performance figures are given for routines written in MPP Pascal.

Non-Galerkin Coarse Grids for Algebraic Multigrid

Energy Technology Data Exchange (ETDEWEB)

Falgout, Robert D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Schroder, Jacob B. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

2014-06-26

Algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. And while AMG has been effectively implemented on large scale parallel machines, challenges remain, especially when moving to exascale. Particularly, stencil sizes (the number of nonzeros in a row) tend to increase further down in the coarse grid hierarchy, and this growth leads to more communication. Therefore, as problem size increases and the number of levels in the hierarchy grows, the overall efficiency of the parallel AMG method decreases, sometimes dramatically. This growth in stencil size is due to the standard Galerkin coarse grid operator, $P^T A P$, where $P$ is the prolongation (i.e., interpolation) operator. For example, the coarse grid stencil size for a simple three-dimensional (3D) seven-point finite differencing approximation to diffusion can increase into the thousands on present day machines, causing an associated increase in communication costs. We therefore consider algebraically truncating coarse grid stencils to obtain a non-Galerkin coarse grid. First, the sparsity pattern of the non-Galerkin coarse grid is determined by employing a heuristic minimal “safe” pattern together with strength-of-connection ideas. Second, the nonzero entries are determined by collapsing the stencils in the Galerkin operator using traditional AMG techniques. The result is a reduction in coarse grid stencil size, overall operator complexity, and parallel AMG solve phase times.

Parallelization of elliptic solver for solving 1D Boussinesq model

Science.gov (United States)

Tarwidi, D.; Adytia, D.

2018-03-01

In this paper, a parallel implementation of an elliptic solver in solving 1D Boussinesq model is presented. Numerical solution of Boussinesq model is obtained by implementing a staggered grid scheme to continuity, momentum, and elliptic equation of Boussinesq model. Tridiagonal system emerging from numerical scheme of elliptic equation is solved by cyclic reduction algorithm. The parallel implementation of cyclic reduction is executed on multicore processors with shared memory architectures using OpenMP. To measure the performance of parallel program, large number of grids is varied from 28 to 214. Two test cases of numerical experiment, i.e. propagation of solitary and standing wave, are proposed to evaluate the parallel program. The numerical results are verified with analytical solution of solitary and standing wave. The best speedup of solitary and standing wave test cases is about 2.07 with 214 of grids and 1.86 with 213 of grids, respectively, which are executed by using 8 threads. Moreover, the best efficiency of parallel program is 76.2% and 73.5% for solitary and standing wave test cases, respectively.

Quasi-Lie algebras and Lie groups

International Nuclear Information System (INIS)

Momo Bangoura

2006-07-01

In this work, we define the quasi-Poisson Lie quasigroups, dual objects to the quasi-Poisson Lie groups and we establish the correspondence between the local quasi-Poisson Lie quasigoups and quasi-Lie bialgebras (up to isomorphism). (author) [fr

Analysis of turbine-grid interaction of grid-connected wind turbine using HHT

Science.gov (United States)

Chen, A.; Wu, W.; Miao, J.; Xie, D.

2018-05-01

This paper processes the output power of the grid-connected wind turbine with the denoising and extracting method based on Hilbert Huang transform (HHT) to discuss the turbine-grid interaction. At first, the detailed Empirical Mode Decomposition (EMD) and the Hilbert Transform (HT) are introduced. Then, on the premise of decomposing the output power of the grid-connected wind turbine into a series of Intrinsic Mode Functions (IMFs), energy ratio and power volatility are calculated to detect the unessential components. Meanwhile, combined with vibration function of turbine-grid interaction, data fitting of instantaneous amplitude and phase of each IMF is implemented to extract characteristic parameters of different interactions. Finally, utilizing measured data of actual parallel-operated wind turbines in China, this work accurately obtains the characteristic parameters of turbine-grid interaction of grid-connected wind turbine.

Grid generation methods

CERN Document Server

Liseikin, Vladimir D

2017-01-01

This new edition provides a description of current developments relating to grid methods, grid codes, and their applications to actual problems. Grid generation methods are indispensable for the numerical solution of differential equations. Adaptive grid-mapping techniques, in particular, are the main focus and represent a promising tool to deal with systems with singularities. This 3rd edition includes three new chapters on numerical implementations (10), control of grid properties (11), and applications to mechanical, fluid, and plasma related problems (13). Also the other chapters have been updated including new topics, such as curvatures of discrete surfaces (3). Concise descriptions of hybrid mesh generation, drag and sweeping methods, parallel algorithms for mesh generation have been included too. This new edition addresses a broad range of readers: students, researchers, and practitioners in applied mathematics, mechanics, engineering, physics and other areas of applications.

A parallel electrostatic Particle-in-Cell method on unstructured tetrahedral grids for large-scale bounded collisionless plasma simulations

Science.gov (United States)

Averkin, Sergey N.; Gatsonis, Nikolaos A.

2018-06-01

An unstructured electrostatic Particle-In-Cell (EUPIC) method is developed on arbitrary tetrahedral grids for simulation of plasmas bounded by arbitrary geometries. The electric potential in EUPIC is obtained on cell vertices from a finite volume Multi-Point Flux Approximation of Gauss' law using the indirect dual cell with Dirichlet, Neumann and external circuit boundary conditions. The resulting matrix equation for the nodal potential is solved with a restarted generalized minimal residual method (GMRES) and an ILU(0) preconditioner algorithm, parallelized using a combination of node coloring and level scheduling approaches. The electric field on vertices is obtained using the gradient theorem applied to the indirect dual cell. The algorithms for injection, particle loading, particle motion, and particle tracking are parallelized for unstructured tetrahedral grids. The algorithms for the potential solver, electric field evaluation, loading, scatter-gather algorithms are verified using analytic solutions for test cases subject to Laplace and Poisson equations. Grid sensitivity analysis examines the L2 and L∞ norms of the relative error in potential, field, and charge density as a function of edge-averaged and volume-averaged cell size. Analysis shows second order of convergence for the potential and first order of convergence for the electric field and charge density. Temporal sensitivity analysis is performed and the momentum and energy conservation properties of the particle integrators in EUPIC are examined. The effects of cell size and timestep on heating, slowing-down and the deflection times are quantified. The heating, slowing-down and the deflection times are found to be almost linearly dependent on number of particles per cell. EUPIC simulations of current collection by cylindrical Langmuir probes in collisionless plasmas show good comparison with previous experimentally validated numerical results. These simulations were also used in a parallelization

Recent trends in grid computing

International Nuclear Information System (INIS)

Miura, Kenichi

2004-01-01

Grid computing is a technology which allows uniform and transparent access to geographically dispersed computational resources, such as computers, databases, experimental and observational equipment etc. via high-speed, high-bandwidth networking. The commonly used analogy is that of electrical power grid, whereby the household electricity is made available from outlets on the wall, and little thought need to be given to where the electricity is generated and how it is transmitted. The usage of grid also includes distributed parallel computing, high through-put computing, data intensive computing (data grid) and collaborative computing. This paper reviews the historical background, software structure, current status and on-going grid projects, including applications of grid technology to nuclear fusion research. (author)

Feasibility and its characteristics of CO2 laser micromachining-based PMMA anti-scattering grid estimated by MCNP code simulation.

Science.gov (United States)

Bae, Jun Woo; Kim, Hee Reyoung

2018-01-01

Anti-scattering grid has been used to improve the image quality. However, applying a commonly used linear or parallel grid would cause image distortion, and focusing grid also requires a precise fabrication technology, which is expensive. To investigate and analyze whether using CO2 laser micromachining-based PMMA anti-scattering grid can improve the performance of the grid at a lower cost. Thus, improvement of grid performance would result in improvement of image quality. The cross-sectional shape of CO2 laser machined PMMA is similar to alphabet 'V'. The performance was characterized by contrast improvement factor (CIF) and Bucky. Four types of grid were tested, which include thin parallel, thick parallel, 'V'-type and 'inverse V'-type of grid. For a Bucky factor of 2.1, the CIF of the grid with both the "V" and inverse "V" had a value of 1.53, while the thick and thick parallel types had values of 1.43 and 1.65, respectively. The 'V' shape grid manufacture by CO2 laser micromachining showed higher CIF than parallel one, which had same shielding material channel width. It was thought that the 'V' shape grid would be replacement to the conventional parallel grid if it is hard to fabricate the high-aspect-ratio grid.

Construction of Difference Equations Using Lie Groups

International Nuclear Information System (INIS)

Axford, R.A.

1998-01-01

The theory of prolongations of the generators of groups of point transformations to the grid point values of dependent variables and grid spacings is developed and applied to the construction of group invariant numerical algorithms. The concepts of invariant difference operators and generalized discrete sources are introduced for the discretization of systems of inhomogeneous differential equations and shown to produce exact difference equations. Invariant numerical flux functions are constructed from the general solutions of first order partial differential equations that come out of the evaluation of the Lie derivatives of conservation forms of difference schemes. It is demonstrated that invariant numerical flux functions with invariant flux or slope limiters can be determined to yield high resolution difference schemes. The introduction of an invariant flux or slope limiter can be done so as not to break the symmetry properties of a numerical flux-function

Semi-coarsening multigrid methods for parallel computing

Energy Technology Data Exchange (ETDEWEB)

Jones, J.E.

1996-12-31

Standard multigrid methods are not well suited for problems with anisotropic coefficients which can occur, for example, on grids that are stretched to resolve a boundary layer. There are several different modifications of the standard multigrid algorithm that yield efficient methods for anisotropic problems. In the paper, we investigate the parallel performance of these multigrid algorithms. Multigrid algorithms which work well for anisotropic problems are based on line relaxation and/or semi-coarsening. In semi-coarsening multigrid algorithms a grid is coarsened in only one of the coordinate directions unlike standard or full-coarsening multigrid algorithms where a grid is coarsened in each of the coordinate directions. When both semi-coarsening and line relaxation are used, the resulting multigrid algorithm is robust and automatic in that it requires no knowledge of the nature of the anisotropy. This is the basic multigrid algorithm whose parallel performance we investigate in the paper. The algorithm is currently being implemented on an IBM SP2 and its performance is being analyzed. In addition to looking at the parallel performance of the basic semi-coarsening algorithm, we present algorithmic modifications with potentially better parallel efficiency. One modification reduces the amount of computational work done in relaxation at the expense of using multiple coarse grids. This modification is also being implemented with the aim of comparing its performance to that of the basic semi-coarsening algorithm.

OGC and Grid Interoperability in enviroGRIDS Project

Science.gov (United States)

Gorgan, Dorian; Rodila, Denisa; Bacu, Victor; Giuliani, Gregory; Ray, Nicolas

2010-05-01

EnviroGRIDS (Black Sea Catchment Observation and Assessment System supporting Sustainable Development) [1] is a 4-years FP7 Project aiming to address the subjects of ecologically unsustainable development and inadequate resource management. The project develops a Spatial Data Infrastructure of the Black Sea Catchment region. The geospatial technologies offer very specialized functionality for Earth Science oriented applications as well as the Grid oriented technology that is able to support distributed and parallel processing. One challenge of the enviroGRIDS project is the interoperability between geospatial and Grid infrastructures by providing the basic and the extended features of the both technologies. The geospatial interoperability technology has been promoted as a way of dealing with large volumes of geospatial data in distributed environments through the development of interoperable Web service specifications proposed by the Open Geospatial Consortium (OGC), with applications spread across multiple fields but especially in Earth observation research. Due to the huge volumes of data available in the geospatial domain and the additional introduced issues (data management, secure data transfer, data distribution and data computation), the need for an infrastructure capable to manage all those problems becomes an important aspect. The Grid promotes and facilitates the secure interoperations of geospatial heterogeneous distributed data within a distributed environment, the creation and management of large distributed computational jobs and assures a security level for communication and transfer of messages based on certificates. This presentation analysis and discusses the most significant use cases for enabling the OGC Web services interoperability with the Grid environment and focuses on the description and implementation of the most promising one. In these use cases we give a special attention to issues such as: the relations between computational grid and

Lie groups and Lie algebras for physicists

CERN Document Server

Das, Ashok

2015-01-01

The book is intended for graduate students of theoretical physics (with a background in quantum mechanics) as well as researchers interested in applications of Lie group theory and Lie algebras in physics. The emphasis is on the inter-relations of representation theories of Lie groups and the corresponding Lie algebras.

Parallel implementation of a dynamic unstructured chimera method in the DLR finite volume TAU-code

Energy Technology Data Exchange (ETDEWEB)

Madrane, A.; Raichle, A.; Stuermer, A. [German Aerospace Center, DLR, Numerical Methods, Inst. of Aerodynamics and Flow Technology, Braunschweig (Germany)]. E-mail: aziz.madrane@dlr.de

2004-07-01

Aerodynamic problems involving moving geometries have many applications, including store separation, high-speed train entering into a tunnel, simulation of full configurations of the helicopter and fast maneuverability. Overset grid method offers the option of calculating these procedures. The solution process uses a grid system that discretizes the problem domain by using separately generated but overlapping unstructured grids that update and exchange boundary information through interpolation. However, such computations are complicated and time consuming. Parallel computing offers a very effective way to improve the productivity in doing computational fluid dynamics (CFD). Therefore the purpose of this study is to develop an efficient parallel computation algorithm for analyzing the flowfield of complex geometries using overset grids method. The strategy adopted in the parallelization of the overset grids method including the use of data structures and communication, is described. Numerical results are presented to demonstrate the efficiency of the resulting parallel overset grids method. (author)

Parallel implementation of a dynamic unstructured chimera method in the DLR finite volume TAU-code

International Nuclear Information System (INIS)

Madrane, A.; Raichle, A.; Stuermer, A.

2004-01-01

Aerodynamic problems involving moving geometries have many applications, including store separation, high-speed train entering into a tunnel, simulation of full configurations of the helicopter and fast maneuverability. Overset grid method offers the option of calculating these procedures. The solution process uses a grid system that discretizes the problem domain by using separately generated but overlapping unstructured grids that update and exchange boundary information through interpolation. However, such computations are complicated and time consuming. Parallel computing offers a very effective way to improve the productivity in doing computational fluid dynamics (CFD). Therefore the purpose of this study is to develop an efficient parallel computation algorithm for analyzing the flowfield of complex geometries using overset grids method. The strategy adopted in the parallelization of the overset grids method including the use of data structures and communication, is described. Numerical results are presented to demonstrate the efficiency of the resulting parallel overset grids method. (author)

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)

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).

New grid-planning and certification approaches for the large-scale offshore-wind farm grid-connection systems

Energy Technology Data Exchange (ETDEWEB)

Heising, C.; Bartelt, R. [Avasition GmbH, Dortmund (Germany); Zadeh, M. Koochack; Lebioda, T.J.; Jung, J. [TenneT Offshore GmbH, Bayreuth (Germany)

2012-07-01

Stable operation of the offshore-wind farms (OWF) and stable grid connection under stationary and dynamic conditions are essential to achieve a stable public power supply. To reach this aim, adequate grid-planning and certification approaches are a major advantage. Within this paper, the fundamental characteristics of the offshore-wind farms and their grid-connection systems are given. The main goal of this research project is to study the stability of the offshore grid especially in terms of subharmonic stability for the likely future extension stage of the offshore grids i.e. having parallel connection of two or more HVDC links and for certain operating scenarios e.g. overload scenario. The current requirements according to the grid code are not the focus of this research project. The goal is to study and define potential additional grid code requirements, simulations, tests and grid planning methods for the future. (orig.)

GRID-BASED EXPLORATION OF COSMOLOGICAL PARAMETER SPACE WITH SNAKE

International Nuclear Information System (INIS)

Mikkelsen, K.; Næss, S. K.; Eriksen, H. K.

2013-01-01

We present a fully parallelized grid-based parameter estimation algorithm for investigating multidimensional likelihoods called Snake, and apply it to cosmological parameter estimation. The basic idea is to map out the likelihood grid-cell by grid-cell according to decreasing likelihood, and stop when a certain threshold has been reached. This approach improves vastly on the 'curse of dimensionality' problem plaguing standard grid-based parameter estimation simply by disregarding grid cells with negligible likelihood. The main advantages of this method compared to standard Metropolis-Hastings Markov Chain Monte Carlo methods include (1) trivial extraction of arbitrary conditional distributions; (2) direct access to Bayesian evidences; (3) better sampling of the tails of the distribution; and (4) nearly perfect parallelization scaling. The main disadvantage is, as in the case of brute-force grid-based evaluation, a dependency on the number of parameters, N par . One of the main goals of the present paper is to determine how large N par can be, while still maintaining reasonable computational efficiency; we find that N par = 12 is well within the capabilities of the method. The performance of the code is tested by comparing cosmological parameters estimated using Snake and the WMAP-7 data with those obtained using CosmoMC, the current standard code in the field. We find fully consistent results, with similar computational expenses, but shorter wall time due to the perfect parallelization scheme

Modeling, analysis, and design of stationary reference frame droop controlled parallel three-phase voltage source inverters

DEFF Research Database (Denmark)

Vasquez, Juan Carlos; Guerrero, Josep M.; Savaghebi, Mehdi

2013-01-01

Power electronics based MicroGrids consist of a number of voltage source inverters (VSIs) operating in parallel. In this paper, the modeling, control design, and stability analysis of parallel connected three-phase VSIs are derived. The proposed voltage and current inner control loops and the mat......Power electronics based MicroGrids consist of a number of voltage source inverters (VSIs) operating in parallel. In this paper, the modeling, control design, and stability analysis of parallel connected three-phase VSIs are derived. The proposed voltage and current inner control loops...... control restores the frequency and amplitude deviations produced by the primary control. Also, a synchronization algorithm is presented in order to connect the MicroGrid to the grid. Experimental results are provided to validate the performance and robustness of the parallel VSI system control...

Grids for Kids gives next-generation IT an early start

CERN Multimedia

2008-01-01

"Grids for Kids gives children a crash course in grid computing," explains co-organiser Anna Cook of the Enabling Grids for E-sciencE project. "We introduce them to concepts such as middleware, parallel processing and supercomputing, and give them opportunities for hands-on learning.

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.)

A Non-static Data Layout Enhancing Parallelism and Vectorization in Sparse Grid Algorithms

KAUST Repository

Buse, Gerrit

2012-06-01

The name sparse grids denotes a highly space-efficient, grid-based numerical technique to approximate high-dimensional functions. Although employed in a broad spectrum of applications from different fields, there have only been few tries to use it in real time visualization (e.g. [1]), due to complex data structures and long algorithm runtime. In this work we present a novel approach inspired by principles of I/0-efficient algorithms. Locally applied coefficient permutations lead to improved cache performance and facilitate the use of vector registers for our sparse grid benchmark problem hierarchization. Based on the compact data structure proposed for regular sparse grids in [2], we developed a new algorithm that outperforms existing implementations on modern multi-core systems by a factor of 37 for a grid size of 127 million points. For larger problems the speedup is even increasing, and with execution times below 1 s, sparse grids are well-suited for visualization applications. Furthermore, we point out how a broad class of sparse grid algorithms can benefit from our approach. © 2012 IEEE.

An Economic Framework for Resource Allocation in Ad-hoc Grids

OpenAIRE

Pourebrahimi, B.

2009-01-01

In this dissertation, we present an economic framework to study and develop different market-based mechanisms for resource allocation in an ad-hoc Grid. Such an economic framework helps to understand the impact of certain choices and explores what are the suitable mechanisms from Grid user/owner perspectives under given circumstances. We focus on resource allocation in a Grid-based environment in the case where some resources are lying idle and could be linked with overloaded nodes in a netwo...

Algorithms for parallel flow solvers on message passing architectures

Science.gov (United States)

Vanderwijngaart, Rob F.

1995-01-01

The purpose of this project has been to identify and test suitable technologies for implementation of fluid flow solvers -- possibly coupled with structures and heat equation solvers -- on MIMD parallel computers. In the course of this investigation much attention has been paid to efficient domain decomposition strategies for ADI-type algorithms. Multi-partitioning derives its efficiency from the assignment of several blocks of grid points to each processor in the parallel computer. A coarse-grain parallelism is obtained, and a near-perfect load balance results. In uni-partitioning every processor receives responsibility for exactly one block of grid points instead of several. This necessitates fine-grain pipelined program execution in order to obtain a reasonable load balance. Although fine-grain parallelism is less desirable on many systems, especially high-latency networks of workstations, uni-partition methods are still in wide use in production codes for flow problems. Consequently, it remains important to achieve good efficiency with this technique that has essentially been superseded by multi-partitioning for parallel ADI-type algorithms. Another reason for the concentration on improving the performance of pipeline methods is their applicability in other types of flow solver kernels with stronger implied data dependence. Analytical expressions can be derived for the size of the dynamic load imbalance incurred in traditional pipelines. From these it can be determined what is the optimal first-processor retardation that leads to the shortest total completion time for the pipeline process. Theoretical predictions of pipeline performance with and without optimization match experimental observations on the iPSC/860 very well. Analysis of pipeline performance also highlights the effect of uncareful grid partitioning in flow solvers that employ pipeline algorithms. If grid blocks at boundaries are not at least as large in the wall-normal direction as those

Research in Parallel Algorithms and Software for Computational Aerosciences

Science.gov (United States)

Domel, Neal D.

1996-01-01

Phase 1 is complete for the development of a computational fluid dynamics CFD) parallel code with automatic grid generation and adaptation for the Euler analysis of flow over complex geometries. SPLITFLOW, an unstructured Cartesian grid code developed at Lockheed Martin Tactical Aircraft Systems, has been modified for a distributed memory/massively parallel computing environment. The parallel code is operational on an SGI network, Cray J90 and C90 vector machines, SGI Power Challenge, and Cray T3D and IBM SP2 massively parallel machines. Parallel Virtual Machine (PVM) is the message passing protocol for portability to various architectures. A domain decomposition technique was developed which enforces dynamic load balancing to improve solution speed and memory requirements. A host/node algorithm distributes the tasks. The solver parallelizes very well, and scales with the number of processors. Partially parallelized and non-parallelized tasks consume most of the wall clock time in a very fine grain environment. Timing comparisons on a Cray C90 demonstrate that Parallel SPLITFLOW runs 2.4 times faster on 8 processors than its non-parallel counterpart autotasked over 8 processors.

GRID-BASED EXPLORATION OF COSMOLOGICAL PARAMETER SPACE WITH SNAKE

Energy Technology Data Exchange (ETDEWEB)

Mikkelsen, K.; Næss, S. K.; Eriksen, H. K., E-mail: kristin.mikkelsen@astro.uio.no [Institute of Theoretical Astrophysics, University of Oslo, P.O. Box 1029, Blindern, NO-0315 Oslo (Norway)

2013-11-10

We present a fully parallelized grid-based parameter estimation algorithm for investigating multidimensional likelihoods called Snake, and apply it to cosmological parameter estimation. The basic idea is to map out the likelihood grid-cell by grid-cell according to decreasing likelihood, and stop when a certain threshold has been reached. This approach improves vastly on the 'curse of dimensionality' problem plaguing standard grid-based parameter estimation simply by disregarding grid cells with negligible likelihood. The main advantages of this method compared to standard Metropolis-Hastings Markov Chain Monte Carlo methods include (1) trivial extraction of arbitrary conditional distributions; (2) direct access to Bayesian evidences; (3) better sampling of the tails of the distribution; and (4) nearly perfect parallelization scaling. The main disadvantage is, as in the case of brute-force grid-based evaluation, a dependency on the number of parameters, N{sub par}. One of the main goals of the present paper is to determine how large N{sub par} can be, while still maintaining reasonable computational efficiency; we find that N{sub par} = 12 is well within the capabilities of the method. The performance of the code is tested by comparing cosmological parameters estimated using Snake and the WMAP-7 data with those obtained using CosmoMC, the current standard code in the field. We find fully consistent results, with similar computational expenses, but shorter wall time due to the perfect parallelization scheme.

Lie Quasi-Bialgebras and Cohomology of Lie algebra

International Nuclear Information System (INIS)

Bangoura, Momo

2010-05-01

Lie quasi-bialgebras are natural generalisations of Lie bialgebras introduced by Drinfeld. To any Lie quasi-bialgebra structure of finite-dimensional (G, μ, γ, φ), corresponds one Lie algebra structure on D = G + G*, called the double of the given Lie quasi-bialgebra. We show that there exist on ΛG, the exterior algebra of G, a D-module structure and we establish an isomorphism of D-modules between ΛD and End(ΛG), D acting on ΛD by the adjoint action. (author) [fr

Building Input Adaptive Parallel Applications: A Case Study of Sparse Grid Interpolation

KAUST Repository

Murarasu, Alin; Weidendorfer, Josef

2012-01-01

bring a substantial contribution to the speedup. By identifying common patterns in the input data, we propose new algorithms for sparse grid interpolation that accelerate the state-of-the-art non-specialized version. Sparse grid interpolation

Compatible Lie Bialgebras

International Nuclear Information System (INIS)

Wu Ming-Zhong; Bai Cheng-Ming

2015-01-01

A compatible Lie algebra is a pair of Lie algebras such that any linear combination of the two Lie brackets is a Lie bracket. We construct a bialgebra theory of compatible Lie algebras as an analogue of a Lie bialgebra. They can also be regarded as a “compatible version” of Lie bialgebras, that is, a pair of Lie bialgebras such that any linear combination of the two Lie bialgebras is still a Lie bialgebra. Many properties of compatible Lie bialgebras as the “compatible version” of the corresponding properties of Lie bialgebras are presented. In particular, there is a coboundary compatible Lie bialgebra theory with a construction from the classical Yang–Baxter equation in compatible Lie algebras as a combination of two classical Yang–Baxter equations in Lie algebras. Furthermore, a notion of compatible pre-Lie algebra is introduced with an interpretation of its close relation with the classical Yang–Baxter equation in compatible Lie algebras which leads to a construction of the solutions of the latter. As a byproduct, the compatible Lie bialgebras fit into the framework to construct non-constant solutions of the classical Yang–Baxter equation given by Golubchik and Sokolov. (paper)

Lie groups, lie algebras, and representations an elementary introduction

CERN Document Server

Hall, Brian

2015-01-01

This textbook treats Lie groups, Lie algebras and their representations in an elementary but fully rigorous fashion requiring minimal prerequisites. In particular, the theory of matrix Lie groups and their Lie algebras is developed using only linear algebra, and more motivation and intuition for proofs is provided than in most classic texts on the subject. In addition to its accessible treatment of the basic theory of Lie groups and Lie algebras, the book is also noteworthy for including: a treatment of the Baker–Campbell–Hausdorff formula and its use in place of the Frobenius theorem to establish deeper results about the relationship between Lie groups and Lie algebras motivation for the machinery of roots, weights and the Weyl group via a concrete and detailed exposition of the representation theory of sl(3;C) an unconventional definition of semisimplicity that allows for a rapid development of the structure theory of semisimple Lie algebras a self-contained construction of the representations of compac...

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.

Application Note: Power Grid Modeling With Xyce.

Energy Technology Data Exchange (ETDEWEB)

Sholander, Peter E. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2015-06-01

This application note describes how to model steady-state power flows and transient events in electric power grids with the SPICE-compatible Xyce TM Parallel Electronic Simulator developed at Sandia National Labs. This application notes provides a brief tutorial on the basic devices (branches, bus shunts, transformers and generators) found in power grids. The focus is on the features supported and assumptions made by the Xyce models for power grid elements. It then provides a detailed explanation, including working Xyce netlists, for simulating some simple power grid examples such as the IEEE 14-bus test case.

JColorGrid: software for the visualization of biological measurements.

OpenAIRE

Joachimiak, Marcin P; Weisman, Jennifer L; May, Barnaby Ch

2006-01-01

Abstract Background Two-dimensional data colourings are an effective medium by which to represent three-dimensional data in two dimensions. Such "color-grid" representations have found increasing use in the biological sciences (e.g. microarray 'heat maps' and bioactivity data) as they are particularly suited to complex data sets and offer an alternative to the graphical representations included in traditional statistical software packages. The effectiveness of color-grids lies in their graphi...

Network Coding Protocols for Smart Grid Communications

DEFF Research Database (Denmark)

Prior, Rui; Roetter, Daniel Enrique Lucani; Phulpin, Yannick

2014-01-01

We propose a robust network coding protocol for enhancing the reliability and speed of data gathering in smart grids. At the heart of our protocol lies the idea of tunable sparse network coding, which adopts the transmission of sparsely coded packets at the beginning of the transmission process b...

Establishment of key grid-connected performance index system for integrated PV-ES system

Science.gov (United States)

Li, Q.; Yuan, X. D.; Qi, Q.; Liu, H. M.

2016-08-01

In order to further promote integrated optimization operation of distributed new energy/ energy storage/ active load, this paper studies the integrated photovoltaic-energy storage (PV-ES) system which is connected with the distribution network, and analyzes typical structure and configuration selection for integrated PV-ES generation system. By combining practical grid- connected characteristics requirements and technology standard specification of photovoltaic generation system, this paper takes full account of energy storage system, and then proposes several new grid-connected performance indexes such as paralleled current sharing characteristic, parallel response consistency, adjusting characteristic, virtual moment of inertia characteristic, on- grid/off-grid switch characteristic, and so on. A comprehensive and feasible grid-connected performance index system is then established to support grid-connected performance testing on integrated PV-ES system.

Visualization system for grid environment in the nuclear field

International Nuclear Information System (INIS)

Suzuki, Yoshio; Matsumoto, Nobuko; Idomura, Yasuhiro; Tani, Masayuki

2006-01-01

An innovative scientific visualization system is needed to integratedly visualize large amount of data which are distributedly generated in remote locations as a result of a large-scale numerical simulation using a grid environment. One of the important functions in such a visualization system is a parallel visualization which enables to visualize data using multiple CPUs of a supercomputer. The other is a distributed visualization which enables to execute visualization processes using a local client computer and remote computers. We have developed a toolkit including these functions in cooperation with the commercial visualization software AVS/Express, called Parallel Support Toolkit (PST). PST can execute visualization processes with three kinds of parallelism (data parallelism, task parallelism and pipeline parallelism) using local and remote computers. We have evaluated PST for large amount of data generated by a nuclear fusion simulation. Here, two supercomputers Altix3700Bx2 and Prism installed in JAEA are used. From the evaluation, it can be seen that PST has a potential to efficiently visualize large amount of data in a grid environment. (author)

Ambiguities in the grid-inefficiency correction for Frisch-Grid Ionization Chambers

International Nuclear Information System (INIS)

Al-Adili, A.; Hambsch, F.-J.; Bencardino, R.; Oberstedt, S.; Pomp, S.

2012-01-01

Ionization chambers with Frisch grids have been very successfully applied to neutron-induced fission-fragment studies during the past 20 years. They are radiation resistant and can be easily adapted to the experimental conditions. The use of Frisch grids has the advantage to remove the angular dependency from the charge induced on the anode plate. However, due to the Grid Inefficiency (GI) in shielding the charges, the anode signal remains slightly angular dependent. The correction for the GI is, however, essential to determine the correct energy of the ionizing particles. GI corrections can amount to a few percent of the anode signal. Presently, two contradicting correction methods are considered in literature. The first method adding the angular-dependent part of the signal to the signal pulse height; the second method subtracting the former from the latter. Both additive and subtractive approaches were investigated in an experiment where a Twin Frisch-Grid Ionization Chamber (TFGIC) was employed to detect the spontaneous fission fragments (FF) emitted by a 252 Cf source. Two parallel-wire grids with different wire spacing (1 and 2 mm, respectively), were used individually, in the same chamber side. All the other experimental conditions were unchanged. The 2 mm grid featured more than double the GI of the 1 mm grid. The induced charge on the anode in both measurements was compared, before and after GI correction. Before GI correction, the 2 mm grid resulted in a lower pulse-height distribution than the 1 mm grid. After applying both GI corrections to both measurements only the additive approach led to consistent grid independent pulse-height distributions. The application of the subtractive correction on the contrary led to inconsistent, grid-dependent results. It is also shown that the impact of either of the correction methods is small on the FF mass distributions of 235 U(n th , f).

Parallel Processing of Images in Mobile Devices using BOINC

Science.gov (United States)

Curiel, Mariela; Calle, David F.; Santamaría, Alfredo S.; Suarez, David F.; Flórez, Leonardo

2018-04-01

Medical image processing helps health professionals make decisions for the diagnosis and treatment of patients. Since some algorithms for processing images require substantial amounts of resources, one could take advantage of distributed or parallel computing. A mobile grid can be an adequate computing infrastructure for this problem. A mobile grid is a grid that includes mobile devices as resource providers. In a previous step of this research, we selected BOINC as the infrastructure to build our mobile grid. However, parallel processing of images in mobile devices poses at least two important challenges: the execution of standard libraries for processing images and obtaining adequate performance when compared to desktop computers grids. By the time we started our research, the use of BOINC in mobile devices also involved two issues: a) the execution of programs in mobile devices required to modify the code to insert calls to the BOINC API, and b) the division of the image among the mobile devices as well as its merging required additional code in some BOINC components. This article presents answers to these four challenges.

Parallel Processing of Images in Mobile Devices using BOINC

Directory of Open Access Journals (Sweden)

Curiel Mariela

2018-04-01

Full Text Available Medical image processing helps health professionals make decisions for the diagnosis and treatment of patients. Since some algorithms for processing images require substantial amounts of resources, one could take advantage of distributed or parallel computing. A mobile grid can be an adequate computing infrastructure for this problem. A mobile grid is a grid that includes mobile devices as resource providers. In a previous step of this research, we selected BOINC as the infrastructure to build our mobile grid. However, parallel processing of images in mobile devices poses at least two important challenges: the execution of standard libraries for processing images and obtaining adequate performance when compared to desktop computers grids. By the time we started our research, the use of BOINC in mobile devices also involved two issues: a the execution of programs in mobile devices required to modify the code to insert calls to the BOINC API, and b the division of the image among the mobile devices as well as its merging required additional code in some BOINC components. This article presents answers to these four challenges.

Lie algebras

CERN Document Server

Jacobson, Nathan

1979-01-01

Lie group theory, developed by M. Sophus Lie in the 19th century, ranks among the more important developments in modern mathematics. Lie algebras comprise a significant part of Lie group theory and are being actively studied today. This book, by Professor Nathan Jacobson of Yale, is the definitive treatment of the subject and can be used as a textbook for graduate courses.Chapter I introduces basic concepts that are necessary for an understanding of structure theory, while the following three chapters present the theory itself: solvable and nilpotent Lie algebras, Carlan's criterion and its

Smart Grid Innovation Management for SME Electricity Companies

DEFF Research Database (Denmark)

Tambo, Torben

2011-01-01

innovation process lies ahead for utility companies in screening, testing, maturing, implementing and operating smart grids. This process is expected to follow the political targets for CO2 reduction stretching forward until 2050. As no proven concepts exists, and as the process is expected to progress many...... years ahead, smart grid represents an excellent case of continuous innovation. The current study use a series of loosely related technological studies of smart grid related technologies in SME electricity companies to highlight critical issues in this innovation process. Major findings...... are that the companies have limited innovation capabilities, they are presented with plenty of technological offerings that eventually have to be rejected, and they suffer from absence of clear objectives....

On-the-fly XMM-Newton Spacecraft Data Reduction on the Grid

Directory of Open Access Journals (Sweden)

A. Ibarra

2006-01-01

Full Text Available We present the results of the first prototype of a XMM-Newton pipeline processing task, parallelized at a CCD level, which can be run in a Grid system. By using the Grid Way application and the XMM-Newton Science Archive system, the processing of the XMM-Newton data is distributed across the Virtual Organization (VO constituted by three different research centres: ESAC (European Space Astronomy Centre, ESTEC (the European Space research and TEchnology Centre and UCM (Complutense University of Madrid. The proposed application workflow adjusts well to the Grid environment, making use of the massive parallel resources in a flexible and adaptive fashion.

Stress fields around a crack lying parallel to a free surface

International Nuclear Information System (INIS)

Higashida, Yutaka; Kamada, K.

1980-12-01

A method of stress analysis for a two dimentional crack, which is subjected to internal gas pressure, and situated parallel to a free surface of a material, is presented. It is based on the concept of continuously distributed edge dislocations of two kinds, i.e. one with Burgers vector normal to the free surface and the other with parallel to it. Stress fields of individual dislocations are chosen so as to satisfy stress free boundary conditions at the free surface, by taking account of image dislocations. Distributions of the both kinds of dislocations in the crack are derived so as to give the internal gas pressure and, at the same time, to satisfy shear stress free boundary condition on the crack surface. Stress fields σsub(xx), σsub(yy) and σsub(xy) in the sub-surface layer are then determined from them. They have square root singularities at the crack-tip. (author)

Accelerating Lattice QCD Multigrid on GPUs Using Fine-Grained Parallelization

Energy Technology Data Exchange (ETDEWEB)

Clark, M. A. [NVIDIA Corp., Santa Clara; Joó, Bálint [Jefferson Lab; Strelchenko, Alexei [Fermilab; Cheng, Michael [Boston U., Ctr. Comp. Sci.; Gambhir, Arjun [William-Mary Coll.; Brower, Richard [Boston U.

2016-12-22

The past decade has witnessed a dramatic acceleration of lattice quantum chromodynamics calculations in nuclear and particle physics. This has been due to both significant progress in accelerating the iterative linear solvers using multi-grid algorithms, and due to the throughput improvements brought by GPUs. Deploying hierarchical algorithms optimally on GPUs is non-trivial owing to the lack of parallelism on the coarse grids, and as such, these advances have not proved multiplicative. Using the QUDA library, we demonstrate that by exposing all sources of parallelism that the underlying stencil problem possesses, and through appropriate mapping of this parallelism to the GPU architecture, we can achieve high efficiency even for the coarsest of grids. Results are presented for the Wilson-Clover discretization, where we demonstrate up to 10x speedup over present state-of-the-art GPU-accelerated methods on Titan. Finally, we look to the future, and consider the software implications of our findings.

Monte Carlo simulation with the Gate software using grid computing

International Nuclear Information System (INIS)

Reuillon, R.; Hill, D.R.C.; Gouinaud, C.; El Bitar, Z.; Breton, V.; Buvat, I.

2009-03-01

Monte Carlo simulations are widely used in emission tomography, for protocol optimization, design of processing or data analysis methods, tomographic reconstruction, or tomograph design optimization. Monte Carlo simulations needing many replicates to obtain good statistical results can be easily executed in parallel using the 'Multiple Replications In Parallel' approach. However, several precautions have to be taken in the generation of the parallel streams of pseudo-random numbers. In this paper, we present the distribution of Monte Carlo simulations performed with the GATE software using local clusters and grid computing. We obtained very convincing results with this large medical application, thanks to the EGEE Grid (Enabling Grid for E-science), achieving in one week computations that could have taken more than 3 years of processing on a single computer. This work has been achieved thanks to a generic object-oriented toolbox called DistMe which we designed to automate this kind of parallelization for Monte Carlo simulations. This toolbox, written in Java is freely available on SourceForge and helped to ensure a rigorous distribution of pseudo-random number streams. It is based on the use of a documented XML format for random numbers generators statuses. (authors)

Digi-Clima Grid: image processing and distributed computing for recovering historical climate data

Directory of Open Access Journals (Sweden)

Sergio Nesmachnow

2015-12-01

Full Text Available This article describes the Digi-Clima Grid project, whose main goals are to design and implement semi-automatic techniques for digitalizing and recovering historical climate records applying parallel computing techniques over distributed computing infrastructures. The specific tool developed for image processing is described, and the implementation over grid and cloud infrastructures is reported. A experimental analysis over institutional and volunteer-based grid/cloud distributed systems demonstrate that the proposed approach is an efficient tool for recovering historical climate data. The parallel implementations allow to distribute the processing load, achieving accurate speedup values.

Hierarchical Controlled Grid-Connected Microgrid based on a Novel Autonomous Current Sharing Controller

DEFF Research Database (Denmark)

Guan, Yajuan; Quintero, Juan Carlos Vasquez; Guerrero, Josep M.

2015-01-01

In this paper, a hierarchical control system based on a novel autonomous current sharing controller for grid-connected microgrids (MGs) is presented. A three-level hierarchical control system is implemented to guarantee the power sharing performance among voltage controlled parallel inverters......, while providing the required active and reactive power to the utility grid. A communication link is used to transmit the control signal from the tertiary and secondary control levels to the primary control. Simulation results from a MG based on two grid-connected parallel inverters are shown in order...

SuperGrid or SmartGrid: Competing strategies for large-scale integration of intermittent renewables?

International Nuclear Information System (INIS)

Blarke, Morten B.; Jenkins, Bryan M.

2013-01-01

This paper defines and compares two strategies for integrating intermittent renewables: SuperGrid and SmartGrid. While conventional energy policy suggests that these strategies may be implemented alongside each other, the paper identifies significant technological and socio-economic conflicts of interest between the two. The article identifies differences between a domestic strategy for the integration of intermittent renewables, vis-à-vis the SmartGrid, and a cross-system strategy, vis-à-vis the SuperGrid. Policy makers and transmission system operators must understand the need for both strategies to evolve in parallel, but in different territories, or with strategic integration, avoiding for one strategy to undermine the feasibility of the other. A strategic zoning strategy is introduced from which attentive societies as well as the global community stand to benefit. The analysis includes a paradigmatic case study from West Denmark which supports the hypothesis that these strategies are mutually exclusive. The case study shows that increasing cross-system transmission capacity jeopardizes the feasibility of SmartGrid technology investments. A political effort is required for establishing dedicated SmartGrid innovation zones, while also redefining infrastructure to avoid the narrow focus on grids and cables. SmartGrid Investment Trusts could be supported from reallocation of planned transmission grid investments to provide for the equitable development of SmartGrid strategies. - Highlights: • Compares SuperGrid and SmartGrid strategies for integrating intermittent renewables. • Identifies technological and socio-economic conflicts of interest between the two. • Proposes a strategic zoning strategy allowing for both strategies to evolve. • Presents a paradigmatic case study showing that strategies are mutually exclusive. • Proposes dedicated SmartGrid innovation zones and SmartGrid investment trusts

Integrating Grid Services into the Cray XT4 Environment

OpenAIRE

Cholia, Shreyas

2009-01-01

The 38640 core Cray XT4 "Franklin" system at the National Energy Research Scientific Computing Center (NERSC) is a massively parallel resource available to Department of Energy researchers that also provides on-demand grid computing to the Open Science Grid. The integration of grid services on Franklin presented various challenges, including fundamental differences between the interactive and compute nodes, a stripped down compute-node operating system without dynamic library support, a share...

A Non-static Data Layout Enhancing Parallelism and Vectorization in Sparse Grid Algorithms

KAUST Repository

Buse, Gerrit; Pfluger, Dirk; Murarasu, Alin; Jacob, Riko

2012-01-01

performance and facilitate the use of vector registers for our sparse grid benchmark problem hierarchization. Based on the compact data structure proposed for regular sparse grids in [2], we developed a new algorithm that outperforms existing implementations

Development of parallel Fokker-Planck code ALLAp

International Nuclear Information System (INIS)

Batishcheva, A.A.; Sigmar, D.J.; Koniges, A.E.

1996-01-01

We report on our ongoing development of the 3D Fokker-Planck code ALLA for a highly collisional scrape-off-layer (SOL) plasma. A SOL with strong gradients of density and temperature in the spatial dimension is modeled. Our method is based on a 3-D adaptive grid (in space, magnitude of the velocity, and cosine of the pitch angle) and a second order conservative scheme. Note that the grid size is typically 100 x 257 x 65 nodes. It was shown in our previous work that only these capabilities make it possible to benchmark a 3D code against a spatially-dependent self-similar solution of a kinetic equation with the Landau collision term. In the present work we show results of a more precise benchmarking against the exact solutions of the kinetic equation using a new parallel code ALLAp with an improved method of parallelization and a modified boundary condition at the plasma edge. We also report first results from the code parallelization using Message Passing Interface for a Massively Parallel CRI T3D platform. We evaluate the ALLAp code performance versus the number of T3D processors used and compare its efficiency against a Work/Data Sharing parallelization scheme and a workstation version

Grupos de Lie

OpenAIRE

Rubio Martí, Vicente

2016-01-01

En el presente proyecto definimos lo que es un grupo de Lie, así como su respectiva álgebra de Lie canónica como aproximación lineal a dicho grupo de Lie. El proceso de linealización, que es hallar el algebra de Lie de un grupo de Lie dado, tiene su

FDTD parallel computational analysis of grid-type scattering filter characteristics for medical X-ray image diagnosis

International Nuclear Information System (INIS)

Takahashi, Koichi; Miyazaki, Yasumitsu; Goto, Nobuo

2007-01-01

X-ray diagnosis depends on the intensity of transmitted and scattered waves in X-ray propagation in biomedical media. X-ray is scattered and absorbed by tissues, such as fat, bone and internal organs. However, image processing for medical diagnosis, based on the scattering and absorption characteristics of these tissues in X-ray spectrum is not so much studied. To obtain precise information of tissues in a living body, the accurate characteristics of scattering and absorption are required. In this paper, X-ray scattering and absorption in biomedical media are studied using 2-dimensional finite difference time domain (FDTD) method. In FDTD method, the size of analysis space is very limited by the performance of available computers. To overcome this limitation, parallel and successive FDTD method is introduced. As a result of computer simulation, the amplitude of transmitted and scattered waves are presented numerically. The fundamental filtering characteristics of grid-type filter are also shown numerically. (author)

Grids for nuclear fuel elements

International Nuclear Information System (INIS)

Nicholson, G.

1980-01-01

This invention relates to grids for nuclear fuel assemblies with the object of providing an improved grid, tending to have greater strength and tending to offer better location of the fuel pins. It comprises sets of generally parallel strips arranged to intersect to define a structure of cellular form, at least some of the intersections including a strip which is keyed to another strip at more than one point. One type of strip may be dimpled along its length and another type of strip may have slots for keying with the dimples. (Auth.)

Parallel Tensor Compression for Large-Scale Scientific Data.

Energy Technology Data Exchange (ETDEWEB)

Kolda, Tamara G. [Sandia National Lab. (SNL-CA), Livermore, CA (United States); Ballard, Grey [Sandia National Lab. (SNL-CA), Livermore, CA (United States); Austin, Woody Nathan [Univ. of Texas, Austin, TX (United States)

2015-10-01

As parallel computing trends towards the exascale, scientific data produced by high-fidelity simulations are growing increasingly massive. For instance, a simulation on a three-dimensional spatial grid with 512 points per dimension that tracks 64 variables per grid point for 128 time steps yields 8 TB of data. By viewing the data as a dense five way tensor, we can compute a Tucker decomposition to find inherent low-dimensional multilinear structure, achieving compression ratios of up to 10000 on real-world data sets with negligible loss in accuracy. So that we can operate on such massive data, we present the first-ever distributed memory parallel implementation for the Tucker decomposition, whose key computations correspond to parallel linear algebra operations, albeit with nonstandard data layouts. Our approach specifies a data distribution for tensors that avoids any tensor data redistribution, either locally or in parallel. We provide accompanying analysis of the computation and communication costs of the algorithms. To demonstrate the compression and accuracy of the method, we apply our approach to real-world data sets from combustion science simulations. We also provide detailed performance results, including parallel performance in both weak and strong scaling experiments.

Ray converter

International Nuclear Information System (INIS)

Reiss, K.H.

1976-01-01

In a radiographic system a converter is used for changing image forming intensity distribution in a bundle of penetrating rays into a flow of electrically charged particles by electrodes located in a gas space and partly latticed (grids) which lie at potentials stepped from cathode to anode. The invention is particularly characterized by the provision of at least two grids extending between and parallel to the cathode and the anode. The electrical field which lies between two electrodes lies at least between the grids located closest to the cathode being to the extent of between 1 and 10 percent, in the average preferably 3 percent below the electrical break down field in the gas in a homogeneous electrical field

Parallel Implementation and Scaling of an Adaptive Mesh Discrete Ordinates Algorithm for Transport

International Nuclear Information System (INIS)

Howell, L H

2004-01-01

Block-structured adaptive mesh refinement (AMR) uses a mesh structure built up out of locally-uniform rectangular grids. In the BoxLib parallel framework used by the Raptor code, each processor operates on one or more of these grids at each refinement level. The decomposition of the mesh into grids and the distribution of these grids among processors may change every few timesteps as a calculation proceeds. Finer grids use smaller timesteps than coarser grids, requiring additional work to keep the system synchronized and ensure conservation between different refinement levels. In a paper for NECDC 2002 I presented preliminary results on implementation of parallel transport sweeps on the AMR mesh, conjugate gradient acceleration, accuracy of the AMR solution, and scalar speedup of the AMR algorithm compared to a uniform fully-refined mesh. This paper continues with a more in-depth examination of the parallel scaling properties of the scheme, both in single-level and multi-level calculations. Both sweeping and setup costs are considered. The algorithm scales with acceptable performance to several hundred processors. Trends suggest, however, that this is the limit for efficient calculations with traditional transport sweeps, and that modifications to the sweep algorithm will be increasingly needed as job sizes in the thousands of processors become common

Toriyeh: the Way of Escaping from Telling Lies to Patients

Directory of Open Access Journals (Sweden)

Ali Reza Alinouri

2015-06-01

Full Text Available Toriyeh means concealing real intention of speech using its parallel and common words so that the listener constructs from speaker's speech a meaning what he/she meant. The purpose of this research is studying jurisprudential dimensions of toriyeh in order to clarify its distinction from lying and related jurisprudential commandments by explanation of the most important discussions about toriyeh. This research was conducted via library method using verses, narratives, jurisprudence sources and decrees by religious authorities. two types of Second type: the speaker`s intention is the outward meaning but the listener misunderstands due to his mental moods. Some of the contemporaries regard the first type as forbidden and they regard the second type to allowable Toriyeh is not equivalent in the meaning with lying and jurists have mentioned narrative-based reasons to prove it. Therefore, in cases of emergency in which man is allowable to tell lie for removing inevitable loss he should use toriyeh as much as possible, and not tell a lie. Of course, toriyeh in the first sense is permissible and if a forbidden thing is conformed to it as a subordinate, it will lose its legality.

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

Cost-effective GPU-grid for genome-wide epistasis calculations.

Science.gov (United States)

Pütz, B; Kam-Thong, T; Karbalai, N; Altmann, A; Müller-Myhsok, B

2013-01-01

Until recently, genotype studies were limited to the investigation of single SNP effects due to the computational burden incurred when studying pairwise interactions of SNPs. However, some genetic effects as simple as coloring (in plants and animals) cannot be ascribed to a single locus but only understood when epistasis is taken into account [1]. It is expected that such effects are also found in complex diseases where many genes contribute to the clinical outcome of affected individuals. Only recently have such problems become feasible computationally. The inherently parallel structure of the problem makes it a perfect candidate for massive parallelization on either grid or cloud architectures. Since we are also dealing with confidential patient data, we were not able to consider a cloud-based solution but had to find a way to process the data in-house and aimed to build a local GPU-based grid structure. Sequential epistatsis calculations were ported to GPU using CUDA at various levels. Parallelization on the CPU was compared to corresponding GPU counterparts with regards to performance and cost. A cost-effective solution was created by combining custom-built nodes equipped with relatively inexpensive consumer-level graphics cards with highly parallel GPUs in a local grid. The GPU method outperforms current cluster-based systems on a price/performance criterion, as a single GPU shows speed performance comparable up to 200 CPU cores. The outlined approach will work for problems that easily lend themselves to massive parallelization. Code for various tasks has been made available and ongoing development of tools will further ease the transition from sequential to parallel algorithms.

Distance-two interpolation for parallel algebraic multigrid

International Nuclear Information System (INIS)

Sterck, H de; Falgout, R D; Nolting, J W; Yang, U M

2007-01-01

In this paper we study the use of long distance interpolation methods with the low complexity coarsening algorithm PMIS. AMG performance and scalability is compared for classical as well as long distance interpolation methods on parallel computers. It is shown that the increased interpolation accuracy largely restores the scalability of AMG convergence factors for PMIS-coarsened grids, and in combination with complexity reducing methods, such as interpolation truncation, one obtains a class of parallel AMG methods that enjoy excellent scalability properties on large parallel computers

Lie sphere transformations and the focal sets of hyper-surfaces

International Nuclear Information System (INIS)

Buyske, S.G.

1988-01-01

Isoparametric hypersurfaces of euclidean or spherical space are those with constant principal curvatures. The image of the hypersurface under a conformal transformation of the ambient space will no longer be isoparametric, but will be Dupin: the principal curvatures will be constant in the principal directions. Dupin hypersurfaces are closely related to taut hypersurfaces, for which almost every distance function is a perfect Morse function (the number of critical points is the minimum for the topology of the hypersurface). A weaker concept is tightness, for which almost every linear height function is required to be a perfect Morse function. Dupin and taut hypersurfaces are preserved not just under conformal, or Moebuius, transformations but also under the more general Lie sphere transformations. Roughly speaking, these are generated by Moebius transformations and parallel transformations. The purpose of this thesis is to study certain taut or Dupin hypersurfaces under Lie sphere transformations including the effect on the focal set. The thesis is divided into four sections. After the introduction, the method of studying hypersurfaces as Lie sphere objects is developed. The third section extends the concepts of tightness and tautness of semi-euclidean space. The final section shows that if a hypersurface is the Lie sphere image of certain standard constructions (tubes, cylinders, and rotations), the resulting family of curvature spheres is taut in the Lie quadric

On enhancing GridFTP and GPFS performances

International Nuclear Information System (INIS)

Cavalli, A; Ciocca, C; Dell'Agnello, L; Ferrari, T; Gregori, D; Martelli, B; Prosperini, A; Ricci, P; Ronchieri, E; Sapunenko, V; Vitlacil, D; Zani, S; Sartirana, A

2010-01-01

One of the most demanding tasks which Computing in High Energy Physics has to deal with is reliable and high throughput transfer of large data volumes. Maximization and optimization of the data throughput are therefore key issues which have to be addressed by detailed investigations of the involved infrastructures and services. In this note, we present some transfer performance tests carried out at the INFN-CNAF Tier-1 center, using SLC4 64-bit Grid File Transfer Protocol (GridFTP) servers and a disk storage system based on the General Parallel File System (GPFS) from IBM. We describe the testbed setup and report the measurements of throughput performances in function of some fundamental variables, such as number of parallel file and number of streams per transfer, concurrent read and write activity and size of data blocks transferred. During this activity, we have verified that a significant improvement in performances of the GridFTP server can be obtained using 64bit version of Operating System and GPFS from IBM.

Resolving Neighbourhood Relations in a Parallel Fluid Dynamic Solver

KAUST Repository

Frisch, Jerome

2012-06-01

Computational Fluid Dynamics simulations require an enormous computational effort if a physically reasonable accuracy should be reached. Therefore, a parallel implementation is inevitable. This paper describes the basics of our implemented fluid solver with a special aspect on the hierarchical data structure, unique cell and grid identification, and the neighbourhood relations in-between grids on different processes. A special server concept keeps track of every grid over all processes while minimising data transfer between the nodes. © 2012 IEEE.

An analysis method for harmonic resonance and stability of multi-paralleled LCL-filtered inverters

DEFF Research Database (Denmark)

Lu, Minghui; Wang, Xiongfei; Blaabjerg, Frede

2015-01-01

Paralleled grid-connected inverters with LCL-filters are coupled through the non-negligible grid impedance. However, the coupling effects among inverters and grid are usually ignored during the design, which may lead to unexpected system resonance and even instability. This paper thus investigates...

A sparse-grid isogeometric solver

KAUST Repository

Beck, Joakim; Sangalli, Giancarlo; Tamellini, Lorenzo

2018-01-01

Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90’s in the context of the approximation of high-dimensional PDEs.The tests that we report show that, in accordance to the literature, a sparse-grid construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

A sparse-grid isogeometric solver

KAUST Repository

Beck, Joakim

2018-02-28

Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90’s in the context of the approximation of high-dimensional PDEs.The tests that we report show that, in accordance to the literature, a sparse-grid construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

Massively parallel evolutionary computation on GPGPUs

CERN Document Server

Tsutsui, Shigeyoshi

2013-01-01

Evolutionary algorithms (EAs) are metaheuristics that learn from natural collective behavior and are applied to solve optimization problems in domains such as scheduling, engineering, bioinformatics, and finance. Such applications demand acceptable solutions with high-speed execution using finite computational resources. Therefore, there have been many attempts to develop platforms for running parallel EAs using multicore machines, massively parallel cluster machines, or grid computing environments. Recent advances in general-purpose computing on graphics processing units (GPGPU) have opened u

Nuclear reactor fuel assembly grid

International Nuclear Information System (INIS)

Alder, J.L.; Kmonk, S.; Racki, F.R.

1981-01-01

A grid for a nuclear reactor fuel assembly which includes intersecting straps arranged to form a structure of egg crate configuration. The cells defined by the intersecting straps are adapted to contain axially extending fuel rods, each of which occupy one cell, while each control rod guide tube or thimble occupies the space of four cells. To effect attachment of each guide thimble to the grid, a short intermediate sleeve is brazed to the strap walls and the guide thimble is then inserted therein and mechanically secured to the sleeve walls. Each sleeve preferably, although not necessarily, is equipped with circumferentially spaced openings useful in adjusting dimples and springs in adjacent cells. To accurately orient each sleeve in position in the grid, the ends of straps extending in one direction project through transversely extending straps and terminate in the wall of the guide sleeve. Other straps positioned at right angles thereto terminate in that portion of the wall of a strap which lies next to a wall of the sleeve

Resistance Fluctuations in GaAs Nanowire Grids

Directory of Open Access Journals (Sweden)

Ivan Marasović

2014-01-01

Full Text Available We present a numerical study on resistance fluctuations in a series of nanowire-based grids. Each grid is made of GaAs nanowires arranged in parallel with metallic contacts crossing all nanowires perpendicularly. Electrical properties of GaAs nanowires known from previous experimental research are used as input parameters in the simulation procedure. Due to the nonhomogeneous doping, the resistivity changes along nanowire. Allowing two possible nanowire orientations (“upwards” or “downwards”, the resulting grid is partially disordered in vertical direction which causes resistance fluctuations. The system is modeled using a two-dimensional random resistor network. Transfer-matrix computation algorithm is used to calculate the total network resistance. It is found that probability density function (PDF of resistance fluctuations for a series of nanowire grids changes from Gaussian behavior towards the Bramwell-Holdsworth-Pinton distribution when both nanowire orientations are equally represented in the grid.

Advances in non-Cartesian parallel magnetic resonance imaging using the GRAPPA operator

International Nuclear Information System (INIS)

Seiberlich, Nicole

2008-01-01

This thesis has presented several new non-Cartesian parallel imaging methods which simplify both gridding and the reconstruction of images from undersampled data. A novel approach which uses the concepts of parallel imaging to grid data sampled along a non-Cartesian trajectory called GRAPPA Operator Gridding (GROG) is described. GROG shifts any acquired k-space data point to its nearest Cartesian location, thereby converting non-Cartesian to Cartesian data. The only requirements for GROG are a multi-channel acquisition and a calibration dataset for the determination of the GROG weights. Then an extension of GRAPPA Operator Gridding, namely Self-Calibrating GRAPPA Operator Gridding (SC-GROG) is discussed. SC-GROG is a method by which non-Cartesian data can be gridded using spatial information from a multi-channel coil array without the need for an additional calibration dataset, as required in standard GROG. Although GROG can be used to grid undersampled datasets, it is important to note that this method uses parallel imaging only for gridding, and not to reconstruct artifact-free images from undersampled data. Thereafter a simple, novel method for performing modified Cartesian GRAPPA reconstructions on undersampled non-Cartesian k-space data gridded using GROG to arrive at a non-aliased image is introduced. Because the undersampled non-Cartesian data cannot be reconstructed using a single GRAPPA kernel, several Cartesian patterns are selected for the reconstruction. Finally a novel method of using GROG to mimic the bunched phase encoding acquisition (BPE) scheme is discussed. In MRI, it is generally assumed that an artifact-free image can be reconstructed only from sampled points which fulfill the Nyquist criterion. However, the BPE reconstruction is based on the Generalized Sampling Theorem of Papoulis, which states that a continuous signal can be reconstructed from sampled points as long as the points are on average sampled at the Nyquist frequency. A novel

Lie superalgebras

International Nuclear Information System (INIS)

Berezin, F.A.

1977-01-01

Generalization of the Laplace-Casimir operator theory on the Lie supergroups is considered. The main result is the formula for radial parts of the Laplace operators under some general assumptions about the Lie supergroup. In particular these assumptions are valid for the Lie suppergroups U(p,g) and C (m,n). The first one is the analogue of the unitary group, the second one is the analogue of the linear group of canonical transformations

A composite passive damping method of the LLCL-filter based grid-tied inverter

DEFF Research Database (Denmark)

Wu, Weimin; Huang, Min; Sun, Yunjie

2012-01-01

This paper investigates the maximum and the minimum gain of the proportional resonant based grid current controller for a grid-tied inverter with a passive damped high-order power filter. It is found that the choice of the controller gain is limited to the local maximum amplitude determined by Q......-factor around the characteristic frequency of the filter and grid impedance. To obtain the Q-factor of a high-order system, an equivalent circuit analysis method is proposed and illustrated through several classical passive damped LCL- and LLCL-filters. It is shown that both the RC parallel damper...... that is in parallel with the capacitor of the LCL-filter or with the Lf-Cf resonant circuit of the LLCL-filter, and the RL series damper in series with the grid-side inductor have their own application limits. Thus, a composite passive damped LLCL-filter for the grid-tied inverter is proposed, which can effectively...

Monitoring the EGEE/WLCG grid services

International Nuclear Information System (INIS)

Duarte, A; Nyczyk, P; Retico, A; Vicinanza, D

2008-01-01

Grids have the potential to revolutionise computing by providing ubiquitous, on demand access to computational services and resources. They promise to allow for on demand access and composition of computational services provided by multiple independent sources. Grids can also provide unprecedented levels of parallelism for high-performance applications. On the other hand, grid characteristics, such as high heterogeneity, complexity and distribution create many new technical challenges. Among these technical challenges, failure management is a key area that demands much progress. A recent survey revealed that fault diagnosis is still a major problem for grid users. When a failure appears at the user screen, it becomes very difficult for the user to identify whether the problem is in the application, somewhere in the grid middleware, or even lower in the fabric that comprises the grid. In this paper we present a tool able to check if a given grid service works as expected for a given set of users (Virtual Organisation) on the different resources available on a grid. Our solution deals with grid services as single components that should produce an expected output to a pre-defined input, what is quite similar to unit testing. The tool, called Service Availability Monitoring or SAM, is being currently used by several different Virtual Organizations to monitor more than 300 grid sites belonging to the largest grids available today. We also discuss how this tool is being used by some of those VOs and how it is helping in the operation of the EGEE/WLCG grid

"Lie to me"-Oxytocin impairs lie detection between sexes.

Science.gov (United States)

Pfundmair, Michaela; Erk, Wiebke; Reinelt, Annika

2017-10-01

The hormone oxytocin modulates various aspects of social behaviors and even seems to lead to a tendency for gullibility. The aim of the current study was to investigate the effect of oxytocin on lie detection. We hypothesized that people under oxytocin would be particularly susceptible to lies told by people of the opposite sex. After administration of oxytocin or a placebo, male and female participants were asked to judge the veracity of statements from same- vs. other-sex actors who either lied or told the truth. Results showed that oxytocin decreased the ability of both male and female participants to correctly classify other-sex statements as truths or lies compared to placebo. This effect was based on a lower ability to detect lies and not a stronger bias to regard truth statements as false. Revealing a new effect of oxytocin, the findings may support assumptions about the hormone working as a catalyst for social adaption. Copyright © 2017. Published by Elsevier Ltd.

Integrating decentralized electrically powered thermal supply systems into a Smart Grid

OpenAIRE

Hasselmann, Maike; Beier, Carsten

2015-01-01

The goal of the project “Smart Region Pellworm” is the establishment and operation of a smart grid with a hybrid energy storage system on the German island of Pellworm. One part of the project is the integration of power-to-heat appliances into the smart grid for demand side management purposes. This paper deals with the prerequisites and lessons learned from the integration of electric night storage heaters into Pellworm's energy management system. Special focus lies on the development of a ...

Probabilistic Learning by Rodent Grid Cells.

Science.gov (United States)

Cheung, Allen

2016-10-01

Mounting evidence shows mammalian brains are probabilistic computers, but the specific cells involved remain elusive. Parallel research suggests that grid cells of the mammalian hippocampal formation are fundamental to spatial cognition but their diverse response properties still defy explanation. No plausible model exists which explains stable grids in darkness for twenty minutes or longer, despite being one of the first results ever published on grid cells. Similarly, no current explanation can tie together grid fragmentation and grid rescaling, which show very different forms of flexibility in grid responses when the environment is varied. Other properties such as attractor dynamics and grid anisotropy seem to be at odds with one another unless additional properties are assumed such as a varying velocity gain. Modelling efforts have largely ignored the breadth of response patterns, while also failing to account for the disastrous effects of sensory noise during spatial learning and recall, especially in darkness. Here, published electrophysiological evidence from a range of experiments are reinterpreted using a novel probabilistic learning model, which shows that grid cell responses are accurately predicted by a probabilistic learning process. Diverse response properties of probabilistic grid cells are statistically indistinguishable from rat grid cells across key manipulations. A simple coherent set of probabilistic computations explains stable grid fields in darkness, partial grid rescaling in resized arenas, low-dimensional attractor grid cell dynamics, and grid fragmentation in hairpin mazes. The same computations also reconcile oscillatory dynamics at the single cell level with attractor dynamics at the cell ensemble level. Additionally, a clear functional role for boundary cells is proposed for spatial learning. These findings provide a parsimonious and unified explanation of grid cell function, and implicate grid cells as an accessible neuronal population

Lie Superalgebras

CERN Document Server

Papi, Paolo; Advances in Lie Superalgebras

2014-01-01

The volume is the outcome of the conference "Lie superalgebras," which was held at the Istituto Nazionale di Alta Matematica, in 2012. The conference gathered many specialists in the subject, and the talks held provided comprehensive insights into the newest trends in research on Lie superalgebras (and related topics like vertex algebras, representation theory and supergeometry). The book contains contributions of many leading esperts in the field and provides a complete account of the newest trends in research on Lie Superalgebras.

Large-Scale Parallel Viscous Flow Computations using an Unstructured Multigrid Algorithm

Science.gov (United States)

Mavriplis, Dimitri J.

1999-01-01

The development and testing of a parallel unstructured agglomeration multigrid algorithm for steady-state aerodynamic flows is discussed. The agglomeration multigrid strategy uses a graph algorithm to construct the coarse multigrid levels from the given fine grid, similar to an algebraic multigrid approach, but operates directly on the non-linear system using the FAS (Full Approximation Scheme) approach. The scalability and convergence rate of the multigrid algorithm are examined on the SGI Origin 2000 and the Cray T3E. An argument is given which indicates that the asymptotic scalability of the multigrid algorithm should be similar to that of its underlying single grid smoothing scheme. For medium size problems involving several million grid points, near perfect scalability is obtained for the single grid algorithm, while only a slight drop-off in parallel efficiency is observed for the multigrid V- and W-cycles, using up to 128 processors on the SGI Origin 2000, and up to 512 processors on the Cray T3E. For a large problem using 25 million grid points, good scalability is observed for the multigrid algorithm using up to 1450 processors on a Cray T3E, even when the coarsest grid level contains fewer points than the total number of processors.

Multilevel Parallelization of AutoDock 4.2

Directory of Open Access Journals (Sweden)

Norgan Andrew P

2011-04-01

Full Text Available Abstract Background Virtual (computational screening is an increasingly important tool for drug discovery. AutoDock is a popular open-source application for performing molecular docking, the prediction of ligand-receptor interactions. AutoDock is a serial application, though several previous efforts have parallelized various aspects of the program. In this paper, we report on a multi-level parallelization of AutoDock 4.2 (mpAD4. Results Using MPI and OpenMP, AutoDock 4.2 was parallelized for use on MPI-enabled systems and to multithread the execution of individual docking jobs. In addition, code was implemented to reduce input/output (I/O traffic by reusing grid maps at each node from docking to docking. Performance of mpAD4 was examined on two multiprocessor computers. Conclusions Using MPI with OpenMP multithreading, mpAD4 scales with near linearity on the multiprocessor systems tested. In situations where I/O is limiting, reuse of grid maps reduces both system I/O and overall screening time. Multithreading of AutoDock's Lamarkian Genetic Algorithm with OpenMP increases the speed of execution of individual docking jobs, and when combined with MPI parallelization can significantly reduce the execution time of virtual screens. This work is significant in that mpAD4 speeds the execution of certain molecular docking workloads and allows the user to optimize the degree of system-level (MPI and node-level (OpenMP parallelization to best fit both workloads and computational resources.

Multilevel Parallelization of AutoDock 4.2.

Science.gov (United States)

Norgan, Andrew P; Coffman, Paul K; Kocher, Jean-Pierre A; Katzmann, David J; Sosa, Carlos P

2011-04-28

Virtual (computational) screening is an increasingly important tool for drug discovery. AutoDock is a popular open-source application for performing molecular docking, the prediction of ligand-receptor interactions. AutoDock is a serial application, though several previous efforts have parallelized various aspects of the program. In this paper, we report on a multi-level parallelization of AutoDock 4.2 (mpAD4). Using MPI and OpenMP, AutoDock 4.2 was parallelized for use on MPI-enabled systems and to multithread the execution of individual docking jobs. In addition, code was implemented to reduce input/output (I/O) traffic by reusing grid maps at each node from docking to docking. Performance of mpAD4 was examined on two multiprocessor computers. Using MPI with OpenMP multithreading, mpAD4 scales with near linearity on the multiprocessor systems tested. In situations where I/O is limiting, reuse of grid maps reduces both system I/O and overall screening time. Multithreading of AutoDock's Lamarkian Genetic Algorithm with OpenMP increases the speed of execution of individual docking jobs, and when combined with MPI parallelization can significantly reduce the execution time of virtual screens. This work is significant in that mpAD4 speeds the execution of certain molecular docking workloads and allows the user to optimize the degree of system-level (MPI) and node-level (OpenMP) parallelization to best fit both workloads and computational resources.

Motivation and Consequences of Lying. A Qualitative Analysis of Everyday Lying

Directory of Open Access Journals (Sweden)

Beata Arcimowicz

2015-09-01

Full Text Available This article presents findings of qualitative analysis of semi-structured interviews with a group of "frequent liars" and another of "rare liars" who provided their subjective perspectives on the phenomenon of lying. Participants in this study previously had maintained a diary of their social interactions and lies over the course of one week, which allowed to assign them to one of the two groups: frequent or rare liars. Thematic analysis of the material followed by elements of theory formulation resulted in an extended lying typology that includes not only the target of the lie (the liar vs. other but also the motivation (protection vs. bringing benefits. We offer an analysis of what prevents from telling the truth, i.e. penalties, relationship losses, distress of the lied-to, and anticipated lack of criticism for telling the truth. We also focus on understanding moderatorsof consequences of lying (significance of the area of life, the type of lie and capacity to understand the liar that can be useful in future studies. URN: http://nbn-resolving.de/urn:nbn:de:0114-fqs1503318

Memory-efficient optimization of Gyrokinetic particle-to-grid interpolation for multicore processors

Energy Technology Data Exchange (ETDEWEB)

Madduri, Kamesh [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Williams, Samuel [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Ethier, Stephane [Princeton Plasma Physics Lab. (PPPL), Princeton, NJ (United States); Oliker, Leonid [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Shalf, John [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Strohmaier, Erich [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Yelicky, Katherine [Univ. of California, Berkeley, CA (United States)

2009-01-01

We present multicore parallelization strategies for the particle-to-grid interpolation step in the Gyrokinetic Toroidal Code (GTC), a 3D particle-in-cell (PIC) application to study turbulent transport in magnetic-confinement fusion devices. Particle-grid interpolation is a known performance bottleneck in several PIC applications. In GTC, this step involves particles depositing charges to a 3D toroidal mesh, and multiple particles may contribute to the charge at a grid point. We design new parallel algorithms for the GTC charge deposition kernel, and analyze their performance on three leading multicore platforms. We implement thirteen different variants for this kernel and identify the best-performing ones given typical PIC parameters such as the grid size, number of particles per cell, and the GTC-specific particle Larmor radius variation. We find that our best strategies can be 2x faster than the reference optimized MPI implementation, and our analysis provides insight into desirable architectural features for high-performance PIC simulation codes.

Parallel computing in genomic research: advances and applications

Directory of Open Access Journals (Sweden)

Ocaña K

2015-11-01

Full Text Available Kary Ocaña,1 Daniel de Oliveira2 1National Laboratory of Scientific Computing, Petrópolis, Rio de Janeiro, 2Institute of Computing, Fluminense Federal University, Niterói, Brazil Abstract: Today's genomic experiments have to process the so-called "biological big data" that is now reaching the size of Terabytes and Petabytes. To process this huge amount of data, scientists may require weeks or months if they use their own workstations. Parallelism techniques and high-performance computing (HPC environments can be applied for reducing the total processing time and to ease the management, treatment, and analyses of this data. However, running bioinformatics experiments in HPC environments such as clouds, grids, clusters, and graphics processing unit requires the expertise from scientists to integrate computational, biological, and mathematical techniques and technologies. Several solutions have already been proposed to allow scientists for processing their genomic experiments using HPC capabilities and parallelism techniques. This article brings a systematic review of literature that surveys the most recently published research involving genomics and parallel computing. Our objective is to gather the main characteristics, benefits, and challenges that can be considered by scientists when running their genomic experiments to benefit from parallelism techniques and HPC capabilities. Keywords: high-performance computing, genomic research, cloud computing, grid computing, cluster computing, parallel computing

Parallel computation of transverse wakes in linear colliders

International Nuclear Information System (INIS)

Zhan, Xiaowei; Ko, Kwok.

1996-11-01

SLAC has proposed the detuned structure (DS) as one possible design to control the emittance growth of long bunch trains due to transverse wakefields in the Next Linear Collider (NLC). The DS consists of 206 cells with tapering from cell to cell of the order of few microns to provide Gaussian detuning of the dipole modes. The decoherence of these modes leads to two orders of magnitude reduction in wakefield experienced by the trailing bunch. To model such a large heterogeneous structure realistically is impractical with finite-difference codes using structured grids. The authors have calculated the wakefield in the DS on a parallel computer with a finite-element code using an unstructured grid. The parallel implementation issues are presented along with simulation results that include contributions from higher dipole bands and wall dissipation

Fast Gridding on Commodity Graphics Hardware

DEFF Research Database (Denmark)

Sørensen, Thomas Sangild; Schaeffter, Tobias; Noe, Karsten Østergaard

2007-01-01

is the far most time consuming of the three steps (Table 1). Modern graphics cards (GPUs) can be utilised as a fast parallel processor provided that algorithms are reformulated in a parallel solution. The purpose of this work is to test the hypothesis, that a non-cartesian reconstruction can be efficiently...... implemented on graphics hardware giving a significant speedup compared to CPU based alternatives. We present a novel GPU implementation of the convolution step that overcomes the problems of memory bandwidth that has limited the speed of previous GPU gridding algorithms [2]....

Parallel computing techniques for rotorcraft aerodynamics

Science.gov (United States)

Ekici, Kivanc

The modification of unsteady three-dimensional Navier-Stokes codes for application on massively parallel and distributed computing environments is investigated. The Euler/Navier-Stokes code TURNS (Transonic Unsteady Rotor Navier-Stokes) was chosen as a test bed because of its wide use by universities and industry. For the efficient implementation of TURNS on parallel computing systems, two algorithmic changes are developed. First, main modifications to the implicit operator, Lower-Upper Symmetric Gauss Seidel (LU-SGS) originally used in TURNS, is performed. Second, application of an inexact Newton method, coupled with a Krylov subspace iterative method (Newton-Krylov method) is carried out. Both techniques have been tried previously for the Euler equations mode of the code. In this work, we have extended the methods to the Navier-Stokes mode. Several new implicit operators were tried because of convergence problems of traditional operators with the high cell aspect ratio (CAR) grids needed for viscous calculations on structured grids. Promising results for both Euler and Navier-Stokes cases are presented for these operators. For the efficient implementation of Newton-Krylov methods to the Navier-Stokes mode of TURNS, efficient preconditioners must be used. The parallel implicit operators used in the previous step are employed as preconditioners and the results are compared. The Message Passing Interface (MPI) protocol has been used because of its portability to various parallel architectures. It should be noted that the proposed methodology is general and can be applied to several other CFD codes (e.g. OVERFLOW).

Optimal scheduling for vehicle-to-grid operation with stochastic connection of plug-in electric vehicles to smart grid

International Nuclear Information System (INIS)

Jian, Linni; Zheng, Yanchong; Xiao, Xinping; Chan, C.C.

2015-01-01

Highlights: • A novel event-triggered scheduling scheme for vehicle-to-grid (V2G) operation is proposed. • New scheme can handle the uncertainty arising from stochastic connection of electric vehicles. • New scheme aims at minimizing the overall load variance of power grid by V2G operation. • Method to evaluate the performance of proposed scheme is elaborated and demonstrated. - Abstract: Vehicle-to-grid (V2G) operation of plug-in electric vehicles (PEVs) is attracting increasing attention since it can assist to improve the efficiency and reliability of power grid, as well as reduce the operating cost and greenhouse gas emission of electric vehicles. Within the scheme of V2G operation, PEVs are expected to serve as a novel distributed energy storage system (ESS) to help achieve the balance between supply and demand of power grid. One of the key difficulties concerning its practical implementation lies in that the availability of PEVs as ESS for grid remains highly uncertain due to their mobility as transportation tools. To address this issue, a novel event-triggered scheduling scheme for V2G operation based on the scenario of stochastic PEV connection to smart grid is proposed in this paper. Firstly, the mathematical model is formulated. Secondly, the preparation of input data for systematic evaluation is introduced and the case study is conducted. Finally, statistic analysis results demonstrate that our proposed V2G scheduling scheme can dramatically smooth out the fluctuation in power load profiles

Lie-Nambu and Lie-Poisson structures in linear and nonlinear quantum mechanics

International Nuclear Information System (INIS)

Czachor, M.

1996-01-01

Space of density matrices in quantum mechanics can be regarded as a Poisson manifold with the dynamics given by certain Lie-Poisson bracket corresponding to an infinite dimensional Lie algebra. The metric structure associated with this Lie algebra is given by a metric tensor which is not equivalent to the Cartan-Killing metric. The Lie-Poisson bracket can be written in a form involving a generalized (Lie-)Nambu bracket. This bracket can be used to generate a generalized, nonlinear and completely integrable dynamics of density matrices. (author)

A non-Lie algebraic framework and its possible merits for symmetry descriptions

International Nuclear Information System (INIS)

Ktorides, C.N.

1975-01-01

A nonassociative algebraic construction is introduced which bears a relation to a Lie algebra L paralleling the relation between an associative enveloping algebra and L. The key ingredient of this algebraic construction is the presence of two parameters which relate it to the enveloping algebra of L. The analog of the Poincare--Birkhoff--Witt theorem is proved for the new algebra. Possibilities of physical relevance are also considered. It is noted that, if fully developed, the mathematical framework suggested by this new algebra should be non-Lie. Subsequently, a certain scheme resulting from specific considerations connected with this (non-Lie) algebraic structure is found to bear striking resemblance to a recent phenomenological theory proposed for explaining CP violation by the K 0 system. Some relevant speculations are also made in view of certain recent trends of thought in elementary particle physics. Finally, in an appendix, a Gell-Mann--Okubo-like mass formula for the new algebra is derived for an SU (3) octet

A new parallelization algorithm of ocean model with explicit scheme

Science.gov (United States)

Fu, X. D.

2017-08-01

This paper will focus on the parallelization of ocean model with explicit scheme which is one of the most commonly used schemes in the discretization of governing equation of ocean model. The characteristic of explicit schema is that calculation is simple, and that the value of the given grid point of ocean model depends on the grid point at the previous time step, which means that one doesn’t need to solve sparse linear equations in the process of solving the governing equation of the ocean model. Aiming at characteristics of the explicit scheme, this paper designs a parallel algorithm named halo cells update with tiny modification of original ocean model and little change of space step and time step of the original ocean model, which can parallelize ocean model by designing transmission module between sub-domains. This paper takes the GRGO for an example to implement the parallelization of GRGO (Global Reduced Gravity Ocean model) with halo update. The result demonstrates that the higher speedup can be achieved at different problem size.

Lie groups, Lie algebras, and some of their applications

CERN Document Server

Gilmore, Robert

1974-01-01

Lie group theory plays an increasingly important role in modern physical theories. Many of its calculations remain fundamentally unchanged from one field of physics to another, altering only in terms of symbols and the language. Using the theory of Lie groups as a unifying vehicle, concepts and results from several fields of physics can be expressed in an extremely economical way. With rigor and clarity, this text introduces upper-level undergraduate students to Lie group theory and its physical applications.An opening discussion of introductory concepts leads to explorations of the classical

Advances in non-Cartesian parallel magnetic resonance imaging using the GRAPPA operator

Energy Technology Data Exchange (ETDEWEB)

Seiberlich, Nicole

2008-07-21

This thesis has presented several new non-Cartesian parallel imaging methods which simplify both gridding and the reconstruction of images from undersampled data. A novel approach which uses the concepts of parallel imaging to grid data sampled along a non-Cartesian trajectory called GRAPPA Operator Gridding (GROG) is described. GROG shifts any acquired k-space data point to its nearest Cartesian location, thereby converting non-Cartesian to Cartesian data. The only requirements for GROG are a multi-channel acquisition and a calibration dataset for the determination of the GROG weights. Then an extension of GRAPPA Operator Gridding, namely Self-Calibrating GRAPPA Operator Gridding (SC-GROG) is discussed. SC-GROG is a method by which non-Cartesian data can be gridded using spatial information from a multi-channel coil array without the need for an additional calibration dataset, as required in standard GROG. Although GROG can be used to grid undersampled datasets, it is important to note that this method uses parallel imaging only for gridding, and not to reconstruct artifact-free images from undersampled data. Thereafter a simple, novel method for performing modified Cartesian GRAPPA reconstructions on undersampled non-Cartesian k-space data gridded using GROG to arrive at a non-aliased image is introduced. Because the undersampled non-Cartesian data cannot be reconstructed using a single GRAPPA kernel, several Cartesian patterns are selected for the reconstruction. Finally a novel method of using GROG to mimic the bunched phase encoding acquisition (BPE) scheme is discussed. In MRI, it is generally assumed that an artifact-free image can be reconstructed only from sampled points which fulfill the Nyquist criterion. However, the BPE reconstruction is based on the Generalized Sampling Theorem of Papoulis, which states that a continuous signal can be reconstructed from sampled points as long as the points are on average sampled at the Nyquist frequency. A novel

JColorGrid: software for the visualization of biological measurements.

Science.gov (United States)

Joachimiak, Marcin P; Weisman, Jennifer L; May, Barnaby Ch

2006-04-27

Two-dimensional data colourings are an effective medium by which to represent three-dimensional data in two dimensions. Such "color-grid" representations have found increasing use in the biological sciences (e.g. microarray 'heat maps' and bioactivity data) as they are particularly suited to complex data sets and offer an alternative to the graphical representations included in traditional statistical software packages. The effectiveness of color-grids lies in their graphical design, which introduces a standard for customizable data representation. Currently, software applications capable of generating limited color-grid representations can be found only in advanced statistical packages or custom programs (e.g. micro-array analysis tools), often associated with steep learning curves and requiring expert knowledge. Here we describe JColorGrid, a Java library and platform independent application that renders color-grid graphics from data. The software can be used as a Java library, as a command-line application, and as a color-grid parameter interface and graphical viewer application. Data, titles, and data labels are input as tab-delimited text files or Microsoft Excel spreadsheets and the color-grid settings are specified through the graphical interface or a text configuration file. JColorGrid allows both user graphical data exploration as well as a means of automatically rendering color-grids from data as part of research pipelines. The program has been tested on Windows, Mac, and Linux operating systems, and the binary executables and source files are available for download at http://jcolorgrid.ucsf.edu.

GSHR-Tree: a spatial index tree based on dynamic spatial slot and hash table in grid environments

Science.gov (United States)

Chen, Zhanlong; Wu, Xin-cai; Wu, Liang

2008-12-01

Computation Grids enable the coordinated sharing of large-scale distributed heterogeneous computing resources that can be used to solve computationally intensive problems in science, engineering, and commerce. Grid spatial applications are made possible by high-speed networks and a new generation of Grid middleware that resides between networks and traditional GIS applications. The integration of the multi-sources and heterogeneous spatial information and the management of the distributed spatial resources and the sharing and cooperative of the spatial data and Grid services are the key problems to resolve in the development of the Grid GIS. The performance of the spatial index mechanism is the key technology of the Grid GIS and spatial database affects the holistic performance of the GIS in Grid Environments. In order to improve the efficiency of parallel processing of a spatial mass data under the distributed parallel computing grid environment, this paper presents a new grid slot hash parallel spatial index GSHR-Tree structure established in the parallel spatial indexing mechanism. Based on the hash table and dynamic spatial slot, this paper has improved the structure of the classical parallel R tree index. The GSHR-Tree index makes full use of the good qualities of R-Tree and hash data structure. This paper has constructed a new parallel spatial index that can meet the needs of parallel grid computing about the magnanimous spatial data in the distributed network. This arithmetic splits space in to multi-slots by multiplying and reverting and maps these slots to sites in distributed and parallel system. Each sites constructs the spatial objects in its spatial slot into an R tree. On the basis of this tree structure, the index data was distributed among multiple nodes in the grid networks by using large node R-tree method. The unbalance during process can be quickly adjusted by means of a dynamical adjusting algorithm. This tree structure has considered the

Direct numerical simulation of turbulent mixing in grid-generated turbulence

International Nuclear Information System (INIS)

Nagata, Kouji; Suzuki, Hiroki; Sakai, Yasuhiko; Kubo, Takashi; Hayase, Toshiyuki

2008-01-01

Turbulent mixing of passive scalar (heat) in grid-generated turbulence (GGT) is simulated by means of direct numerical simulation (DNS). A turbulence-generating grid, on which the velocity components are set to zero, is located downstream of the channel entrance, and it is numerically constructed on the staggered mesh arrangement using the immersed boundary method. The grid types constructed are: (a) square-mesh biplane grid, (b) square-mesh single-plane grid, (c) composite grid consisting of parallel square-bars and (d) fractal grid. Two fluids with different temperatures are provided separately in the upper and lower streams upstream of the turbulence-generating grids, generating the thermal mixing layer behind the grids. For the grid (a), simulations for two different Prandtl numbers of 0.71 and 7.1, corresponding to air and water flows, are conducted to investigate the effect of the Prandtl number. The results show that the typical grid turbulence and shearless mixing layer are generated downstream of the grids. The results of the scalar field show that a typical thermal mixing layer is generated as well, and the effects of the Prandtl numbers on turbulent heat transfer are observed.

Direct numerical simulation of turbulent mixing in grid-generated turbulence

Energy Technology Data Exchange (ETDEWEB)

Nagata, Kouji; Suzuki, Hiroki; Sakai, Yasuhiko; Kubo, Takashi [Department of Mechanical Science and Engineering, Nagoya University, Nagoya 464-8603 (Japan); Hayase, Toshiyuki [Institute of Fluid Science, Tohoku University, Sendai 980-8577 (Japan)], E-mail: nagata@nagoya-u.jp, E-mail: hsuzuki@nagoya-u.jp, E-mail: ysakai@mech.nagoya-u.ac.jp, E-mail: t-kubo@nagoya-u.jp, E-mail: hayase@ifs.tohoku.ac.jp

2008-12-15

Turbulent mixing of passive scalar (heat) in grid-generated turbulence (GGT) is simulated by means of direct numerical simulation (DNS). A turbulence-generating grid, on which the velocity components are set to zero, is located downstream of the channel entrance, and it is numerically constructed on the staggered mesh arrangement using the immersed boundary method. The grid types constructed are: (a) square-mesh biplane grid, (b) square-mesh single-plane grid, (c) composite grid consisting of parallel square-bars and (d) fractal grid. Two fluids with different temperatures are provided separately in the upper and lower streams upstream of the turbulence-generating grids, generating the thermal mixing layer behind the grids. For the grid (a), simulations for two different Prandtl numbers of 0.71 and 7.1, corresponding to air and water flows, are conducted to investigate the effect of the Prandtl number. The results show that the typical grid turbulence and shearless mixing layer are generated downstream of the grids. The results of the scalar field show that a typical thermal mixing layer is generated as well, and the effects of the Prandtl numbers on turbulent heat transfer are observed.

Efficient Eulerian gyrokinetic simulations with block-structured grids

International Nuclear Information System (INIS)

Jarema, Denis

2017-01-01

applied to different Eulerian gyrokinetic simulation codes, as the technique relies on a general approach. We implemented and tested our block-structured grids in GENE (http://genecode.org), a highly parallel and heavily used gyrokinetic code, for which it is crucial to keep the good parallel characteristic of the implementation and allow developers to easily port the code written for the original grid to the block-structured counterpart. The presented scenarios clearly demonstrate benefits of the block-structured grids: a high speedup, a tremendously reduced memory footprint and size of diagnostic output data, and the capability to significantly advance the frontier of feasible simulations.

Efficient Eulerian gyrokinetic simulations with block-structured grids

Energy Technology Data Exchange (ETDEWEB)

Jarema, Denis

2017-01-20

applied to different Eulerian gyrokinetic simulation codes, as the technique relies on a general approach. We implemented and tested our block-structured grids in GENE (http://genecode.org), a highly parallel and heavily used gyrokinetic code, for which it is crucial to keep the good parallel characteristic of the implementation and allow developers to easily port the code written for the original grid to the block-structured counterpart. The presented scenarios clearly demonstrate benefits of the block-structured grids: a high speedup, a tremendously reduced memory footprint and size of diagnostic output data, and the capability to significantly advance the frontier of feasible simulations.

Kids at CERN Grids for Kids programme leads to advanced computing knowledge.

CERN Multimedia

2008-01-01

Children as young as 10 are learning computing skills, such as middleware, parallel processing and supercomputing, at CERN, the European Organisation for Nuclear Research, last week. The initiative for 10 to 12 years olds is part of the Grids for Kids programme, which aims to introduce Grid computing as a tool for research.

Lectures on Lie groups

CERN Document Server

Hsiang, Wu-Yi

2017-01-01

This volume consists of nine lectures on selected topics of Lie group theory. We provide the readers a concise introduction as well as a comprehensive 'tour of revisiting' the remarkable achievements of S Lie, W Killing, É Cartan and H Weyl on structural and classification theory of semi-simple Lie groups, Lie algebras and their representations; and also the wonderful duet of Cartans' theory on Lie groups and symmetric spaces.With the benefit of retrospective hindsight, mainly inspired by the outstanding contribution of H Weyl in the special case of compact connected Lie groups, we develop the above theory via a route quite different from the original methods engaged by most other books.We begin our revisiting with the compact theory which is much simpler than that of the general semi-simple Lie theory; mainly due to the well fittings between the Frobenius-Schur character theory and the maximal tori theorem of É Cartan together with Weyl's reduction (cf. Lectures 1-4). It is a wonderful reality of the Lie t...

Grid-interfacing converter systems with enhanced voltage quality for microgrid application : concept and implementation

NARCIS (Netherlands)

Wang, F.; Duarte, J.L.; Hendrix, M.A.M.

2011-01-01

Grid-interfacing converter systems with enhanced voltage quality are proposed for microgrid application in this paper. By adapting the conventional series-parallel structure, a group of grid-interfacing system topologies are proposed for the purpose of interfacing local generation/microgrid to the

ONIX results: Comparison of grid geometry (BATMAN - ELISE - flat grid)

Science.gov (United States)

Revel, Adrien; Mochalskyy, Serhiy; Wünderlich, Dirk; Fantz, Ursel; Minea, Tiberiu

2017-08-01

The 3D PIC-MCC code ONIX is dedicated to the modelling of negative hydrogen or deuterium ion extraction and the co-extracted electrons from the plasma in radio-frequency driven sources. The extraction process highly depends on the plasma characteristics close to the plasma grid where it is difficult to obtain experimental data. ONIX brings valuable insights on the plasma behavior in this area. In the code, the numerical treatment of the boundaries have been improved in order to describe with more accuracy the potential and the electric field in this vicinity. The computation time has been reduced by a factor of 2 and the parallelization efficiency has been highly improved. The influence of the magnetic field in BATMAN on the plasma behaviour has been investigated by comparing two different configurations of the magnet bars producing the filter field (internal magnets: x = 3 cm; external magnets: x = 9 cm). A flat grid geometry for the PG instead of the usual conical grid geometry has been studied to evaluate its impact on the extracted current, especially for the negative ions emitted from the surface of the PG. Finally, the ONIX code has been used for the first 3D PIC calculations ever performed for the ELISE experiment.

LCL-Filter Design for Robust Active Damping in Grid-Connected Converters

DEFF Research Database (Denmark)

Pena-Alzola, Rafael; Liserre, Marco; Blaabjerg, Frede

2014-01-01

in the grid inductance may compromise system stability, and this problem is more severe for parallel converters. This situation, typical of rural areas with solar and wind resources, calls for robust LCL-filter design. This paper proposes a design procedure with remarkable results under severe grid inductance......Grid-connected converters employ LCL-filters, instead of simple inductors, because they allow lower inductances while reducing cost and size. Active damping, without dissipative elements, is preferred to passive damping for solving the associated stability problems. However, large variations...

A Real Model of a Micro-Grid to Improve Network Stability

Directory of Open Access Journals (Sweden)

Petr Marcon

2017-07-01

Full Text Available This paper discusses the smart energy model of a smart grid using a significant share of renewable energy sources combined with intelligent control that processes information from a smart metering subsystem. An algorithm to manage the microgrid via the demand-response strategy is proposed, accentuating the requirement that the total volume of energy produced from renewable sources is consumed. Thus, the system utilizes the maximum of renewable sources to reduce CO2 emissions. Another major benefit provided by the algorithm lies in applying the current weather forecast to predict the amount of energy in the grid; electricity can then be transferred between the local and the main backup batteries within the grid, and this option enables the control elements to prepare for a condition yet to occur. Individual parts of the grid are described in this research report together with the results provided by the relevant algorithm.

Nuclear reactor spring strip grid spacer

International Nuclear Information System (INIS)

Patterson, J.F.; Flora, B.S.

1980-01-01

An improved and novel grid spacer for maintaining the fuel rods of a nuclear reactor fuel assembly in substantially parallel array is described. The invention provides for spring strips to maintain the fuel elements in their desired orientation which have more positive alignment than previous types while allowing greater flexibility to counterbalance the effects of differential thermal expansion. (UK)

Hydrography-driven coarsening of grid digital elevation models

Science.gov (United States)

Moretti, G.; Orlandini, S.

2017-12-01

A new grid coarsening strategy, denoted as hydrography-driven (HD) coarsening, is developed in the present study. The HD coarsening strategy is designed to retain the essential hydrographic features of surface flow paths observed in high-resolution digital elevation models (DEMs): (1) depressions are filled in the considered high-resolution DEM, (2) the obtained topographic data are used to extract a reference grid network composed of all surface flow paths, (3) the Horton order is assigned to each link of the reference grid network, and (4) within each coarse grid cell, the elevation of the point lying along the highest-order path of the reference grid network and displaying the minimum distance to the cell center is assigned to this coarse grid cell center. The capabilities of the HD coarsening strategy to provide consistent surface flow paths with respect to those observed in high-resolution DEMs are evaluated over a synthetic valley and two real drainage basins located in the Italian Alps and in the Italian Apennines. The HD coarsening is found to yield significantly more accurate surface flow path profiles than the standard nearest neighbor (NN) coarsening. In addition, the proposed strategy is found to reduce drastically the impact of depression-filling procedures in coarsened topographic data. The HD coarsening strategy is therefore advocated for all those cases in which the relief of the extracted drainage network is an important hydrographic feature. The figure below reports DEMs of a synthetic valley and extracted surface flow paths. (a) 10-m grid DEM displaying no depressions and extracted surface flow path (gray line). (b) 1-km grid DEM obtained from NN coarsening. (c) 1-km grid DEM obtained from NN coarsening plus depression-filling and extracted surface flow path (light blue line). (d) 1-km grid DEM obtained from HD coarsening and extracted surface flow path (magenta line).

Dip and anisotropy effects on flow using a vertically skewed model grid.

Science.gov (United States)

Hoaglund, John R; Pollard, David

2003-01-01

Darcy flow equations relating vertical and bedding-parallel flow to vertical and bedding-parallel gradient components are derived for a skewed Cartesian grid in a vertical plane, correcting for structural dip given the principal hydraulic conductivities in bedding-parallel and bedding-orthogonal directions. Incorrect-minus-correct flow error results are presented for ranges of structural dip (0 strike and dip, and a solver that can handle off-diagonal hydraulic conductivity terms.

JColorGrid: software for the visualization of biological measurements

Directory of Open Access Journals (Sweden)

May Barnaby CH

2006-04-01

Full Text Available Abstract Background Two-dimensional data colourings are an effective medium by which to represent three-dimensional data in two dimensions. Such "color-grid" representations have found increasing use in the biological sciences (e.g. microarray 'heat maps' and bioactivity data as they are particularly suited to complex data sets and offer an alternative to the graphical representations included in traditional statistical software packages. The effectiveness of color-grids lies in their graphical design, which introduces a standard for customizable data representation. Currently, software applications capable of generating limited color-grid representations can be found only in advanced statistical packages or custom programs (e.g. micro-array analysis tools, often associated with steep learning curves and requiring expert knowledge. Results Here we describe JColorGrid, a Java library and platform independent application that renders color-grid graphics from data. The software can be used as a Java library, as a command-line application, and as a color-grid parameter interface and graphical viewer application. Data, titles, and data labels are input as tab-delimited text files or Microsoft Excel spreadsheets and the color-grid settings are specified through the graphical interface or a text configuration file. JColorGrid allows both user graphical data exploration as well as a means of automatically rendering color-grids from data as part of research pipelines. Conclusion The program has been tested on Windows, Mac, and Linux operating systems, and the binary executables and source files are available for download at http://jcolorgrid.ucsf.edu.

Reliability assessment of wind farm-connected grids using Monte-Carlo testing

Energy Technology Data Exchange (ETDEWEB)

Belanger, Jean; Dufour, Christian [Opal-RT Technologies Inc., Montreal, QC (Canada); Paquin, Jean-Nicolas [BBA Inc., Mont-Saint-Hilaire, QC (Canada)

2010-07-01

The future of the power grid lies in large scale integration of distributed generation devices with the utility system, at either a medium- or low-voltage level. These new distribued generation technologies can offer benefits and opportunities to manufacturers and utilities in need of supplementary energy sources. However, a large increase in the number of distributed generation interconnections may potentially cause a number of technical concerns relating to the operation of the system in question. Because existing distribution networks were not originally designed to include complex distributed power-electronic systems, detailed testing of existing and future protection and control devices is necessary. The growing use of photovoltaic devices, wind turbines and other complex power electronic systems is changing the nature of distribution systems. The performance and stresses on wind farm and microgrid components will therefore depend on control and protection system reaction. In fact, this new generation of intelligent microgrids is becoming as complex as sophisticated high-voltage AC/DC transmission systems. This paper describes how the Monte Carlo simulation technique and parallel simulators can be used to evaluate worst-case stresses for different fault and operating conditions. (orig.)

Measuring device and method for dimples height differences of 17 x 17 grid

International Nuclear Information System (INIS)

Xu Yilan; Zheng Zhihui; Yan Liwei; Wang Xihe

2001-01-01

There are 264 cell for fastening fuel rods in the grid of 17 x 17 fuel assembly of PWR. The height differences of top and bottom dimples in a grid is an important quality characteristic of the grid. The report deals with measuring machine and method for dimples height differences of the grid. The device has two measuring probes. The Parallel Leaf Spring is used for transmitting the little displacement between two probes. The uncertainty of the device is σ≤4 μm. The measuring method is shown to be practicable

Parallel hyperbolic PDE simulation on clusters: Cell versus GPU

Science.gov (United States)

Rostrup, Scott; De Sterck, Hans

2010-12-01

Increasingly, high-performance computing is looking towards data-parallel computational devices to enhance computational performance. Two technologies that have received significant attention are IBM's Cell Processor and NVIDIA's CUDA programming model for graphics processing unit (GPU) computing. In this paper we investigate the acceleration of parallel hyperbolic partial differential equation simulation on structured grids with explicit time integration on clusters with Cell and GPU backends. The message passing interface (MPI) is used for communication between nodes at the coarsest level of parallelism. Optimizations of the simulation code at the several finer levels of parallelism that the data-parallel devices provide are described in terms of data layout, data flow and data-parallel instructions. Optimized Cell and GPU performance are compared with reference code performance on a single x86 central processing unit (CPU) core in single and double precision. We further compare the CPU, Cell and GPU platforms on a chip-to-chip basis, and compare performance on single cluster nodes with two CPUs, two Cell processors or two GPUs in a shared memory configuration (without MPI). We finally compare performance on clusters with 32 CPUs, 32 Cell processors, and 32 GPUs using MPI. Our GPU cluster results use NVIDIA Tesla GPUs with GT200 architecture, but some preliminary results on recently introduced NVIDIA GPUs with the next-generation Fermi architecture are also included. This paper provides computational scientists and engineers who are considering porting their codes to accelerator environments with insight into how structured grid based explicit algorithms can be optimized for clusters with Cell and GPU accelerators. It also provides insight into the speed-up that may be gained on current and future accelerator architectures for this class of applications. Program summaryProgram title: SWsolver Catalogue identifier: AEGY_v1_0 Program summary URL

Nuclear reactor fuel element assembly spacer grid and method of making

International Nuclear Information System (INIS)

Chetter, J.

1975-01-01

A cellular fuel element assembly spacer grid is described which provides for resilient bracing of fuel pins in the cells of the grid by bow spring locating members projecting inside the cells of the grid to hold the fuel pins against opposed rigid stops also projecting inside the cells of the grid. The grid comprises two tiers each formed from intersecting strip members defining cells which are penetrated by the fuel pins and arranged parallel to one another but spaced apart. The bow spring locating members extend longitudinally between the two tiers and have end ferrules which are a sliding fit on locating members which extend longitudinally from the facing inner edges of the strip members forming the two tiers. The grid tiers are fabricated individually by heat bonding the intersecting strip members prior to assembling the tiers into the spacer grid. (U.S.)

Digital control of grid connected converters for distributed power generation

Energy Technology Data Exchange (ETDEWEB)

Skjellnes, Tore

2008-07-01

Pulse width modulated converters are becoming increasingly popular as their cost decreases and power rating increases. The new trend of small scale power producers, often using renewable energy sources, has created new demands for delivery of energy to the grid. A major advantage of the pulse width modulated converter is the ability to control the output voltage at any point in the voltage period. This enables rapid response to load changes and non-linear loads. In addition it can shape the voltage in response to the output current to create an outward appearance of a source impedance. This is called a virtual impedance. This thesis presents a controller for a voltage controlled three phase pulse width modulated converter. This controller enables operation in standalone mode, in parallel with other converters in a micro grid, and in parallel with a strong main grid. A time varying virtual impedance is presented which mainly attenuates reactive currents. A method of investigating the overall impedance including the virtual impedance is presented. New net standards have been introduced, requiring the converter to operate even during severe dips in the grid voltage. Experiments are presented verifying the operation of the controller during voltage dips. (Author). 37 refs., 65 figs., 10 tabs

Grid impedance estimation based hybrid islanding detection method for AC microgrids

DEFF Research Database (Denmark)

Ghzaiel, Walid; Jebali-Ben Ghorbal, Manel; Slama-Belkhodja, Ilhem

2017-01-01

This paper focuses on a hybrid islanding detection algorithm for parallel-inverters-based microgrids. The proposed algorithm is implemented on the unit ensuring the control of the intelligent bypass switch connecting or disconnecting the microgrid from the utility. This method employs a grid...... to avoid interactions with other units. The selected inverter will be the one closest to the controllable distributed generation system or to a healthy grid side in case of meshed microgrid with multiple-grid connections. The detection algorithm is applied to quickly detect the resonance phenomena, so...

Energy analysis of thermal energy storages with grid configurations

International Nuclear Information System (INIS)

Rezaie, Behnaz; Reddy, Bale V.; Rosen, Marc A.

2014-01-01

Highlights: • Grid configurations of TESs are developed and assessed. • Characteristics of various configurations of TESs are developed as functions of properties. • Functions for the discharge temperature and the discharge energy of the TES are developed. - Abstract: In some thermal networks like district energy systems, there can exist conditions, depending on space availability, economics, project requirements, insulation, storing media type and other issues, for which it may be advantageous to utilize several thermal energy storages (TESs) instead of one. Here, various configurations for multiple TESs are proposed and investigated. Significant parameters for a TES, or a set of TESs, include discharging temperature and recovered energy. First, one TES is modeled to determine the final temperature, energy recovery, and energy efficiency. Next, characteristics for various grid configurations of multiple TESs are developed as functions of TES characteristics (e.g., charging and discharging temperatures and energy quantities). Series, parallel and comprehensive grid TES configurations are considered. In the parallel configuration, the TESs behave independently. This suggests that the TES can consist of different storage media types and sizes, and that there is no restriction on initial temperature of the TES. In the series configuration, the situation is different because the TESs are connected directly or indirectly through a heat exchanger. If there is no heat exchanger between the TESs, the TES storage media should be the same, because the outlet of one TES in the series is the inlet to the next. The initial temperature of the second TES must be smaller than the discharge temperature of the first. There is no restriction on the TES size for series configurations. The general grid configuration is observed to exhibit characteristics of both series and parallel configurations

Improving matrix-vector product performance and multi-level preconditioning for the parallel PCG package

Energy Technology Data Exchange (ETDEWEB)

McLay, R.T.; Carey, G.F.

1996-12-31

In this study we consider parallel solution of sparse linear systems arising from discretized PDE`s. As part of our continuing work on our parallel PCG Solver package, we have made improvements in two areas. The first is improving the performance of the matrix-vector product. Here on regular finite-difference grids, we are able to use the cache memory more efficiently for smaller domains or where there are multiple degrees of freedom. The second problem of interest in the present work is the construction of preconditioners in the context of the parallel PCG solver we are developing. Here the problem is partitioned over a set of processors subdomains and the matrix-vector product for PCG is carried out in parallel for overlapping grid subblocks. For problems of scaled speedup, the actual rate of convergence of the unpreconditioned system deteriorates as the mesh is refined. Multigrid and subdomain strategies provide a logical approach to resolving the problem. We consider the parallel trade-offs between communication and computation and provide a complexity analysis of a representative algorithm. Some preliminary calculations using the parallel package and comparisons with other preconditioners are provided together with parallel performance results.

Lying in business : Insights from Hanna Arendt's 'Lying in Politics'

NARCIS (Netherlands)

Eenkhoorn, P.; Graafland, J.J.

2011-01-01

The political philosopher Hannah Arendt develops several arguments regarding why truthfulness cannot be counted among the political virtues. This article shows that similar arguments apply to lying in business. Based on Hannah Arendt's theory, we distinguish five reasons why lying is a structural

Parallel simulation of tsunami inundation on a large-scale supercomputer

Science.gov (United States)

Oishi, Y.; Imamura, F.; Sugawara, D.

2013-12-01

An accurate prediction of tsunami inundation is important for disaster mitigation purposes. One approach is to approximate the tsunami wave source through an instant inversion analysis using real-time observation data (e.g., Tsushima et al., 2009) and then use the resulting wave source data in an instant tsunami inundation simulation. However, a bottleneck of this approach is the large computational cost of the non-linear inundation simulation and the computational power of recent massively parallel supercomputers is helpful to enable faster than real-time execution of a tsunami inundation simulation. Parallel computers have become approximately 1000 times faster in 10 years (www.top500.org), and so it is expected that very fast parallel computers will be more and more prevalent in the near future. Therefore, it is important to investigate how to efficiently conduct a tsunami simulation on parallel computers. In this study, we are targeting very fast tsunami inundation simulations on the K computer, currently the fastest Japanese supercomputer, which has a theoretical peak performance of 11.2 PFLOPS. One computing node of the K computer consists of 1 CPU with 8 cores that share memory, and the nodes are connected through a high-performance torus-mesh network. The K computer is designed for distributed-memory parallel computation, so we have developed a parallel tsunami model. Our model is based on TUNAMI-N2 model of Tohoku University, which is based on a leap-frog finite difference method. A grid nesting scheme is employed to apply high-resolution grids only at the coastal regions. To balance the computation load of each CPU in the parallelization, CPUs are first allocated to each nested layer in proportion to the number of grid points of the nested layer. Using CPUs allocated to each layer, 1-D domain decomposition is performed on each layer. In the parallel computation, three types of communication are necessary: (1) communication to adjacent neighbours for the

Parallel evolutionary computation in bioinformatics applications.

Science.gov (United States)

Pinho, Jorge; Sobral, João Luis; Rocha, Miguel

2013-05-01

A large number of optimization problems within the field of Bioinformatics require methods able to handle its inherent complexity (e.g. NP-hard problems) and also demand increased computational efforts. In this context, the use of parallel architectures is a necessity. In this work, we propose ParJECoLi, a Java based library that offers a large set of metaheuristic methods (such as Evolutionary Algorithms) and also addresses the issue of its efficient execution on a wide range of parallel architectures. The proposed approach focuses on the easiness of use, making the adaptation to distinct parallel environments (multicore, cluster, grid) transparent to the user. Indeed, this work shows how the development of the optimization library can proceed independently of its adaptation for several architectures, making use of Aspect-Oriented Programming. The pluggable nature of parallelism related modules allows the user to easily configure its environment, adding parallelism modules to the base source code when needed. The performance of the platform is validated with two case studies within biological model optimization. Copyright © 2012 Elsevier Ireland Ltd. All rights reserved.

Parallel Reservoir Simulations with Sparse Grid Techniques and Applications to Wormhole Propagation

KAUST Repository

Wu, Yuanqing

2015-01-01

the traditional simulation technique relying on the Darcy framework, we propose a new framework called Darcy-Brinkman-Forchheimer framework to simulate wormhole propagation. Furthermore, to process the large quantity of cells in the simulation grid and shorten

Politicians lie, so do I.

Science.gov (United States)

Celse, Jérémy; Chang, Kirk

2017-11-30

This research analyzed whether political leaders make people lie via priming experiments. Priming is a non-conscious and implicit memory effect in which exposure to one stimulus affects the response to another. Following priming theories, we proposed an innovative concept that people who perceive leaders to be dishonest (such as liars) are likely to lie themselves. We designed three experiments to analyze and critically discussed the potential influence of prime effect on lying behavior, through the prime effect of French political leaders (including general politicians, presidents and parties). Experiment 1 discovered that participants with non-politician-prime were less likely to lie (compared to politician-prime). Experiment 2A discovered that, compared to Hollande-prime, Sarkozy-prime led to lying behavior both in gravity (i.e., bigger lies) and frequency (i.e., lying more frequently). Experiment 2B discovered that Republicans-prime yielded an impact on more lying behavior, and Sarkozy-prime made such impact even stronger. Overall, the research findings suggest that lying can be triggered by external influencers such as leaders, presidents and politicians in the organizations. Our findings have provided valuable insights into organizational leaders and managers in their personnel management practice, especially in the intervention of lying behavior. Our findings also have offered new insights to explain non-conscious lying behavior.

Disaster Monitoring using Grid Based Data Fusion Algorithms

Directory of Open Access Journals (Sweden)

Cătălin NAE

2010-12-01

Full Text Available This is a study of the application of Grid technology and high performance parallelcomputing to a candidate algorithm for jointly accomplishing data fusion from different sensors. Thisincludes applications for both image analysis and/or data processing for simultaneously trackingmultiple targets in real-time. The emphasis is on comparing the architectures of the serial andparallel algorithms, and characterizing the performance benefits achieved by the parallel algorithmwith both on-ground and in-space hardware implementations. The improved performance levelsachieved by the use of Grid technology (middleware for Parallel Data Fusion are presented for themain metrics of interest in near real-time applications, namely latency, total computation load, andtotal sustainable throughput. The objective of this analysis is, therefore, to demonstrate animplementation of multi-sensor data fusion and/or multi-target tracking functions within an integratedmulti-node portable HPC architecture based on emerging Grid technology. The key metrics to bedetermined in support of ongoing system analyses includes: required computational throughput inMFLOPS; latency between receipt of input data and resulting outputs; and scalability, processorutilization and memory requirements. Furthermore, the standard MPI functions are considered to beused for inter-node communications in order to promote code portability across multiple HPCcomputer platforms, both in space and on-ground.

The Parallel System for Integrating Impact Models and Sectors (pSIMS)

Science.gov (United States)

Elliott, Joshua; Kelly, David; Chryssanthacopoulos, James; Glotter, Michael; Jhunjhnuwala, Kanika; Best, Neil; Wilde, Michael; Foster, Ian

2014-01-01

We present a framework for massively parallel climate impact simulations: the parallel System for Integrating Impact Models and Sectors (pSIMS). This framework comprises a) tools for ingesting and converting large amounts of data to a versatile datatype based on a common geospatial grid; b) tools for translating this datatype into custom formats for site-based models; c) a scalable parallel framework for performing large ensemble simulations, using any one of a number of different impacts models, on clusters, supercomputers, distributed grids, or clouds; d) tools and data standards for reformatting outputs to common datatypes for analysis and visualization; and e) methodologies for aggregating these datatypes to arbitrary spatial scales such as administrative and environmental demarcations. By automating many time-consuming and error-prone aspects of large-scale climate impacts studies, pSIMS accelerates computational research, encourages model intercomparison, and enhances reproducibility of simulation results. We present the pSIMS design and use example assessments to demonstrate its multi-model, multi-scale, and multi-sector versatility.

Parallel algorithms for 2-D cylindrical transport equations of Eigenvalue problem

International Nuclear Information System (INIS)

Wei, J.; Yang, S.

2013-01-01

In this paper, aimed at the neutron transport equations of eigenvalue problem under 2-D cylindrical geometry on unstructured grid, the discrete scheme of Sn discrete ordinate and discontinuous finite is built, and the parallel computation for the scheme is realized on MPI systems. Numerical experiments indicate that the designed parallel algorithm can reach perfect speedup, it has good practicality and scalability. (authors)

Oscillating plasma bubbles. IV. Grids, geometry, and gradients

Energy Technology Data Exchange (ETDEWEB)

Stenzel, R. L. [Department of Physics and Astronomy, University of California, Los Angeles, California 90095-1547 (United States); Urrutia, J. M. [Urrutia Scientific, Van Nuys, California 91406 (United States)

2012-08-15

Plasma bubbles are created in an ambient plasma. The bubble is formed inside a cavity bounded by a negatively biased grid. Ions are injected through the grid and neutralized by electrons from either the background plasma or an internal electron emitter. The external electron supply is controlled by the grid bias relative to the external plasma potential. When the electron flux is restricted to the ion flux, the sheath of the bubble becomes unstable and causes the plasma potential to oscillate near the ion plasma frequency. The exact frequency depends on the net space charge density in the bubble sheath. The frequency increases with density and grid voltage, provided the grid forms a parallel equipotential surface. The present investigation shows that when the Debye length becomes smaller than the grid openings the electron flux cannot be controlled by the grid voltage. The frequency dependence on grid voltage and density is modified creating frequency and amplitude jumps. Low frequency sheath oscillations modulate the high frequency normal oscillations. Harmonics and subharmonics are excited by electrons in an ion-rich sheath. When the plasma parameters vary over the bubble surface, the sheath may oscillate at different frequencies. A cavity with two isolated grids has been used to investigate anisotropies of the energetic electron flux in a discharge plasma. The frequency dependence on grid voltage is entirely different when the grid controls the energetic electrons or the bulk electrons. These observations are important to several fields of basic plasma physics, such as sheaths, sheath instabilities, diagnostic probes, current, and space charge neutralization of ion beams.

New challenges in grid generation and adaptivity for scientific computing

CERN Document Server

Formaggia, Luca

2015-01-01

This volume collects selected contributions from the “Fourth Tetrahedron Workshop on Grid Generation for Numerical Computations”, which was held in Verbania, Italy in July 2013. The previous editions of this Workshop were hosted by the Weierstrass Institute in Berlin (2005), by INRIA Rocquencourt in Paris (2007), and by Swansea University (2010). This book covers different, though related, aspects of the field: the generation of quality grids for complex three-dimensional geometries; parallel mesh generation algorithms; mesh adaptation, including both theoretical and implementation aspects; grid generation and adaptation on surfaces – all with an interesting mix of numerical analysis, computer science and strongly application-oriented problems.

Development of Parallel Code for the Alaska Tsunami Forecast Model

Science.gov (United States)

Bahng, B.; Knight, W. R.; Whitmore, P.

2014-12-01

The Alaska Tsunami Forecast Model (ATFM) is a numerical model used to forecast propagation and inundation of tsunamis generated by earthquakes and other means in both the Pacific and Atlantic Oceans. At the U.S. National Tsunami Warning Center (NTWC), the model is mainly used in a pre-computed fashion. That is, results for hundreds of hypothetical events are computed before alerts, and are accessed and calibrated with observations during tsunamis to immediately produce forecasts. ATFM uses the non-linear, depth-averaged, shallow-water equations of motion with multiply nested grids in two-way communications between domains of each parent-child pair as waves get closer to coastal waters. Even with the pre-computation the task becomes non-trivial as sub-grid resolution gets finer. Currently, the finest resolution Digital Elevation Models (DEM) used by ATFM are 1/3 arc-seconds. With a serial code, large or multiple areas of very high resolution can produce run-times that are unrealistic even in a pre-computed approach. One way to increase the model performance is code parallelization used in conjunction with a multi-processor computing environment. NTWC developers have undertaken an ATFM code-parallelization effort to streamline the creation of the pre-computed database of results with the long term aim of tsunami forecasts from source to high resolution shoreline grids in real time. Parallelization will also permit timely regeneration of the forecast model database with new DEMs; and, will make possible future inclusion of new physics such as the non-hydrostatic treatment of tsunami propagation. The purpose of our presentation is to elaborate on the parallelization approach and to show the compute speed increase on various multi-processor systems.

Medicine, lies and deceptions.

Science.gov (United States)

Benn, P

2001-04-01

This article offers a qualified defence of the view that there is a moral difference between telling lies to one's patients, and deceiving them without lying. However, I take issue with certain arguments offered by Jennifer Jackson in support of the same conclusion. In particular, I challenge her claim that to deny that there is such a moral difference makes sense only within a utilitarian framework, and I cast doubt on the aptness of some of her examples of non-lying deception. But I argue that lies have a greater tendency to damage trust than does non-lying deception, and suggest that since many doctors do believe there is a moral boundary between the two types of deception, encouraging them to violate that boundary may have adverse general effects on their moral sensibilities.

Particle-like structure of Lie algebras

Science.gov (United States)

Vinogradov, A. M.

2017-07-01

If a Lie algebra structure 𝔤 on a vector space is the sum of a family of mutually compatible Lie algebra structures 𝔤i's, we say that 𝔤 is simply assembled from the 𝔤i's. Repeating this procedure with a number of Lie algebras, themselves simply assembled from the 𝔤i's, one obtains a Lie algebra assembled in two steps from 𝔤i's, and so on. We describe the process of modular disassembling of a Lie algebra into a unimodular and a non-unimodular part. We then study two inverse questions: which Lie algebras can be assembled from a given family of Lie algebras, and from which Lie algebras can a given Lie algebra be assembled. We develop some basic assembling and disassembling techniques that constitute the elements of a new approach to the general theory of Lie algebras. The main result of our theory is that any finite-dimensional Lie algebra over an algebraically closed field of characteristic zero or over R can be assembled in a finite number of steps from two elementary constituents, which we call dyons and triadons. Up to an abelian summand, a dyon is a Lie algebra structure isomorphic to the non-abelian 2-dimensional Lie algebra, while a triadon is isomorphic to the 3-dimensional Heisenberg Lie algebra. As an example, we describe constructions of classical Lie algebras from triadons.

Binding lies

Directory of Open Access Journals (Sweden)

Avraham eMerzel

2015-10-01

Full Text Available Do we feel bound by our own misrepresentations? Does one act of cheating compel the cheater to make subsequent choices that maintain the false image even at a cost? To answer these questions we employed a two-task paradigm such that in the first task the participants could benefit from false reporting of private observations whereas in the second they could benefit from making a prediction in line with their actual, rather than their previously reported observations. Thus, for those participants who inflated their report during the first task, sticking with that report for the second task was likely to lead to a loss, whereas deviating from it would imply that they had lied. Data from three experiments (total N=116 indicate that, having lied, participants were ready to suffer future loss rather than admit, even if implicitly, that they had lied.

When is a lie acceptable? Work and private life lying acceptance depends on its beneficiary.

Science.gov (United States)

Cantarero, Katarzyna; Szarota, Piotr; Stamkou, Eftychia; Navas, Marisol; Dominguez Espinosa, Alejandra Del Carmen

2018-01-01

In this article we show that when analyzing attitude towards lying in a cross-cultural setting, both the beneficiary of the lie (self vs other) and the context (private life vs. professional domain) should be considered. In a study conducted in Estonia, Ireland, Mexico, The Netherlands, Poland, Spain, and Sweden (N = 1345), in which participants evaluated stories presenting various types of lies, we found usefulness of relying on the dimensions. Results showed that in the joint sample the most acceptable were other-oriented lies concerning private life, then other-oriented lies in the professional domain, followed by egoistic lies in the professional domain; and the least acceptance was shown for egoistic lies regarding one's private life. We found a negative correlation between acceptance of a behavior and the evaluation of its deceitfulness.

SYNCHRONIZATION OF NATIONAL GRID NETWORK WITH THE ELECTRICITY SHIPS NETWORK IN THE "SHORE TO SHIP" SYSTEM

Directory of Open Access Journals (Sweden)

Dariusz TARNAPOWICZ

2013-07-01

Full Text Available ‘Shore to ship’ system – ships’ power supply from the local electrical substations – is one of the effective ways to limit the negative impact of the ships lying in ports on the environment. Energy infrastructure of the port installation necessary to provide ships with power supply has to be designed so that different types of ships can use it. The important issue concerning ‘shore to ship’ system is the quality of power supply. This can be achieved via sustaining continuity of power supply while switching from the ships’ electrical network over to the national grid. In this article the author presents the way of synchronizing the national grid with the ships’ electrical network during ship’s lying in port. Such synchronization would allow for uninterruptible work of the ship’s electrical devices.

ICT Requirements and Challenges for Provision of Grid Services from Renewable Generation Plants

DEFF Research Database (Denmark)

Shahid, Kamal; Olsen, Rasmus Løvenstein; Petersen, Lennart

2018-01-01

The penetration of renewable energy into the electricity supply mix necessitates the traditional power grid to become more resilient, reliable and efficient. One way of ensuring this is to require renewable power plants to have similar regulating properties as conventional power plants...... applications – in terms of data payloads, sampling rates, latency and reliability. Therefore, this paper presents a brief survey on the control and communication architectures for controlling renewable power plants in the future power grid, including the communication network technologies, requirements...... and to coordinate their grid support services (GSS) as well. Among other requirements, the coordination of GSS will highly depend on the communication between renewable plants and system operators’ control rooms, thereby imposing high responsibility on the under lying communication infrastructure. Despite...

Lie bialgebras with triangular decomposition

International Nuclear Information System (INIS)

Andruskiewitsch, N.; Levstein, F.

1992-06-01

Lie bialgebras originated in a triangular decomposition of the underlying Lie algebra are discussed. The explicit formulas for the quantization of the Heisenberg Lie algebra and some motion Lie algebras are given, as well as the algebra of rational functions on the quantum Heisenberg group and the formula for the universal R-matrix. (author). 17 refs

Parallel computing in plasma physics: Nonlinear instabilities

International Nuclear Information System (INIS)

Pohn, E.; Kamelander, G.; Shoucri, M.

2000-01-01

A Vlasov-Poisson-system is used for studying the time evolution of the charge-separation at a spatial one- as well as a two-dimensional plasma-edge. Ions are advanced in time using the Vlasov-equation. The whole three-dimensional velocity-space is considered leading to very time-consuming four-resp. five-dimensional fully kinetic simulations. In the 1D simulations electrons are assumed to behave adiabatic, i.e. they are Boltzmann-distributed, leading to a nonlinear Poisson-equation. In the 2D simulations a gyro-kinetic approximation is used for the electrons. The plasma is assumed to be initially neutral. The simulations are performed at an equidistant grid. A constant time-step is used for advancing the density-distribution function in time. The time-evolution of the distribution function is performed using a splitting scheme. Each dimension (x, y, υ x , υ y , υ z ) of the phase-space is advanced in time separately. The value of the distribution function for the next time is calculated from the value of an - in general - interstitial point at the present time (fractional shift). One-dimensional cubic-spline interpolation is used for calculating the interstitial function values. After the fractional shifts are performed for each dimension of the phase-space, a whole time-step for advancing the distribution function is finished. Afterwards the charge density is calculated, the Poisson-equation is solved and the electric field is calculated before the next time-step is performed. The fractional shift method sketched above was parallelized for p processors as follows. Considering first the shifts in y-direction, a proper parallelization strategy is to split the grid into p disjoint υ z -slices, which are sub-grids, each containing a different 1/p-th part of the υ z range but the whole range of all other dimensions. Each processor is responsible for performing the y-shifts on a different slice, which can be done in parallel without any communication between

Verbal lie detection

NARCIS (Netherlands)

Vrij, Aldert; Taylor, Paul J.; Picornell, Isabel; Oxburgh, Gavin; Myklebust, Trond; Grant, Tim; Milne, Rebecca

2015-01-01

In this chapter, we discuss verbal lie detection and will argue that speech content can be revealing about deception. Starting with a section discussing the, in our view, myth that non-verbal behaviour would be more revealing about deception than speech, we then provide an overview of verbal lie

LIE n-RACKS

OpenAIRE

Biyogmam, Guy Roger

2011-01-01

In this paper, we introduce the category of Lie $n$-racks and generalize several results known on racks. In particular, we show that the tangent space of a Lie $n$-Rack at the neutral element has a Leibniz $n$-algebra structure. We also define a cohomology theory of $n$-racks..

The performance test of anti-scattering x-ray grid with inclined shielding material by MCNP code simulation

Energy Technology Data Exchange (ETDEWEB)

Bae, Jun Woo; Kim, Hee Reyoung [Ulsan National Institute of Science and Technology, Ulsan (Korea, Republic of)

2016-06-15

The scattered photons cause reduction of the contrast of radiographic image and it results in the degradation of the quality of the image. In order to acquire better quality image, an anti-scattering x-ray gird should be equipped in radiography system. The X-ray anti-scattering grid of the inclined type based on the hybrid concept for that of parallel and focused type was tested by MCNP code. The MCNPX 2.7.0 was used for the simulation based test. The geometry for the test was based on the IEC 60627 which was an international standard for diagnostic X-ray imaging equipment-Characteristics of general purpose and mammographic anti-scatter grids. The performance of grids with four inclined shielding material types was compared with that of the parallel type. The grid with completely tapered type the best performance where there were little performance difference according to the degree of inclination.

From simplicial Lie algebras and hypercrossed complexes to differential graded Lie algebras via 1-jets

OpenAIRE

Jurco, Branislav

2011-01-01

Let g be a simplicial Lie algebra with Moore complex Ng of length k. Let G be the simplicial Lie group integrating g, which is simply connected in each simplicial level. We use the 1-jet of the classifying space of G to construct, starting from g, a Lie k-algebra L. The so constructed Lie k-algebra L is actually a differential graded Lie algebra. The differential and the brackets are explicitly described in terms (of a part) of the corresponding k-hypercrossed complex structure of Ng. The res...

The Research of the Parallel Computing Development from the Angle of Cloud Computing

Science.gov (United States)

Peng, Zhensheng; Gong, Qingge; Duan, Yanyu; Wang, Yun

2017-10-01

Cloud computing is the development of parallel computing, distributed computing and grid computing. The development of cloud computing makes parallel computing come into people’s lives. Firstly, this paper expounds the concept of cloud computing and introduces two several traditional parallel programming model. Secondly, it analyzes and studies the principles, advantages and disadvantages of OpenMP, MPI and Map Reduce respectively. Finally, it takes MPI, OpenMP models compared to Map Reduce from the angle of cloud computing. The results of this paper are intended to provide a reference for the development of parallel computing.

Nonflexible Lie-admissible algebras

International Nuclear Information System (INIS)

Myung, H.C.

1978-01-01

We discuss the structure of Lie-admissible algebras which are defined by nonflexible identities. These algebras largely arise from the antiflexible algebras, 2-varieties and associator dependent algebras. The nonflexible Lie-admissible algebras in our discussion are in essence byproducts of the study of nonassociative algebras defined by identities of degree 3. The main purpose is to discuss the classification of simple Lie-admissible algebras of nonflexible type

Design and Implementation of a High Quality Power Supply Scheme for Distributed Generation in a Micro-Grid

Directory of Open Access Journals (Sweden)

Mingchao Xia

2013-09-01

Full Text Available A low carbon, high efficiency and high quality power supply scheme for Distributed Generation (DG in a micro-grid is presented. A three-phase, four-leg DG grid-interfacing converter based on the improved structure of a Unified Power Quality Conditioner (UPQC, including a series converter and a parallel converter is adopted, and improved indirect and direct control strategies are proposed. It can be observed that these strategies effectively compensate for voltage sags, voltage swells and voltage distortion, as well as voltage power quality problems resulting from the nonlinear and unbalanced loads in a micro-grid. While solving the coupling interference from series–parallel, the grid-interfacing converter can achieve proper load power sharing in a micro-grid. In particular, an improved minimum-energy compensation method is proposed that can overcome the conventional compensation algorithm defects, ensure the load voltage’s phase angle stability, improve the voltage compensating ability and range, reduce the capacity and cost of converters, and reduce the shock of micro-grid switching between grid-connected mode and islanded mode. Moreover, the advantages/disadvantages and application situation of the two improved control strategies are analyzed. Finally, the performance of the proposed control strategies has been verified through a MATLAB/Simulink simulation under various operating conditions.

Algorithms for computational fluid dynamics n parallel processors

International Nuclear Information System (INIS)

Van de Velde, E.F.

1986-01-01

A study of parallel algorithms for the numerical solution of partial differential equations arising in computational fluid dynamics is presented. The actual implementation on parallel processors of shared and nonshared memory design is discussed. The performance of these algorithms is analyzed in terms of machine efficiency, communication time, bottlenecks and software development costs. For elliptic equations, a parallel preconditioned conjugate gradient method is described, which has been used to solve pressure equations discretized with high order finite elements on irregular grids. A parallel full multigrid method and a parallel fast Poisson solver are also presented. Hyperbolic conservation laws were discretized with parallel versions of finite difference methods like the Lax-Wendroff scheme and with the Random Choice method. Techniques are developed for comparing the behavior of an algorithm on different architectures as a function of problem size and local computational effort. Effective use of these advanced architecture machines requires the use of machine dependent programming. It is shown that the portability problems can be minimized by introducing high level operations on vectors and matrices structured into program libraries

Isomorphism of Intransitive Linear Lie Equations

Directory of Open Access Journals (Sweden)

Jose Miguel Martins Veloso

2009-11-01

Full Text Available We show that formal isomorphism of intransitive linear Lie equations along transversal to the orbits can be extended to neighborhoods of these transversal. In analytic cases, the word formal is dropped from theorems. Also, we associate an intransitive Lie algebra with each intransitive linear Lie equation, and from the intransitive Lie algebra we recover the linear Lie equation, unless of formal isomorphism. The intransitive Lie algebra gives the structure functions introduced by É. Cartan.

Filiform Lie algebras of order 3

Science.gov (United States)

Navarro, R. M.

2014-04-01

The aim of this work is to generalize a very important type of Lie algebras and superalgebras, i.e., filiform Lie (super)algebras, into the theory of Lie algebras of order F. Thus, the concept of filiform Lie algebras of order F is obtained. In particular, for F = 3 it has been proved that by using infinitesimal deformations of the associated model elementary Lie algebra it can be obtained families of filiform elementary lie algebras of order 3, analogously as that occurs into the theory of Lie algebras [M. Vergne, "Cohomologie des algèbres de Lie nilpotentes. Application à l'étude de la variété des algèbres de Lie nilpotentes," Bull. Soc. Math. France 98, 81-116 (1970)]. Also we give the dimension, using an adaptation of the {sl}(2,{C})-module Method, and a basis of such infinitesimal deformations in some generic cases.

When is a lie more of a lie? Moral judgment mediates the relationship between perceived benefits of others and lie-labeling

Directory of Open Access Journals (Sweden)

Cantarero Katarzyna

2017-06-01

Full Text Available Lay perceptions of lying are argued to consist of a lie prototype. The latter was found to entail the intention to deceive, belief in falsity and falsity (Coleman & Kay, 1981. We proposed and found that the perceptions of the benefits of others are also an important factor that influences the extent, to which an act of intentional misleading someone to foster a false belief is labeled as a lie. Drawing from the intuitionist model of moral judgments (Haidt, 2001 we assumed that moral judgment of the behaviour would mediate the relationship. In Study 1 we analyzed data coming from a crosscultural project and found that perceived intention to benefit others was negatively related to lie labeling and that this relationship was mediated by the moral judgment of that act. In Study 2 we found that manipulating the benefits of others influenced the extent, to which an act of intentional misleading in order to foster a false belief is labeled as a lie and that, again, this relationship is mediated by the moral judgment of that act.

Polarization-dependent thin-film wire-grid reflectarray for terahertz waves

Energy Technology Data Exchange (ETDEWEB)

Niu, Tiaoming [School of Electrical and Electronic Engineering, The University of Adelaide, Adelaide, South Australia 5005 (Australia); School of Information Science and Engineering, Lanzhou University, Lanzhou 730000 (China); Upadhyay, Aditi; Bhaskaran, Madhu; Sriram, Sharath [Functional Materials and Microsystems Research Group, RMIT University, Melbourne, Victoria 3001 (Australia); Withayachumnankul, Withawat [School of Electrical and Electronic Engineering, The University of Adelaide, Adelaide, South Australia 5005 (Australia); Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology, 2-12-1-S9-3, Ookayama, Meguro-ku, Tokyo 152-8552 (Japan); Headland, Daniel; Abbott, Derek; Fumeaux, Christophe, E-mail: cfumeaux@eleceng.adelaide.edu.au [School of Electrical and Electronic Engineering, The University of Adelaide, Adelaide, South Australia 5005 (Australia)

2015-07-20

A thin-film polarization-dependent reflectarray based on patterned metallic wire grids is realized at 1 THz. Unlike conventional reflectarrays with resonant elements and a solid metal ground, parallel narrow metal strips with uniform spacing are employed in this design to construct both the radiation elements and the ground plane. For each radiation element, a certain number of thin strips with an identical length are grouped to effectively form a patch resonator with equivalent performance. The ground plane is made of continuous metallic strips, similar to conventional wire-grid polarizers. The structure can deflect incident waves with the polarization parallel to the strips into a designed direction and transmit the orthogonal polarization component. Measured radiation patterns show reasonable deflection efficiency and high polarization discrimination. Utilizing this flexible device approach, similar reflectarray designs can be realized for conformal mounting onto surfaces of cylindrical or spherical devices for terahertz imaging and communications.

Lie Algebras and Integrable Systems

International Nuclear Information System (INIS)

Zhang Yufeng; Mei Jianqin

2012-01-01

A 3 × 3 matrix Lie algebra is first introduced, its subalgebras and the generated Lie algebras are obtained, respectively. Applications of a few Lie subalgebras give rise to two integrable nonlinear hierarchies of evolution equations from their reductions we obtain the nonlinear Schrödinger equations, the mKdV equations, the Broer-Kaup (BK) equation and its generalized equation, etc. The linear and nonlinear integrable couplings of one integrable hierarchy presented in the paper are worked out by casting a 3 × 3 Lie subalgebra into a 2 × 2 matrix Lie algebra. Finally, we discuss the elliptic variable solutions of a generalized BK equation. (general)

Filiform Lie algebras of order 3

International Nuclear Information System (INIS)

Navarro, R. M.

2014-01-01

The aim of this work is to generalize a very important type of Lie algebras and superalgebras, i.e., filiform Lie (super)algebras, into the theory of Lie algebras of order F. Thus, the concept of filiform Lie algebras of order F is obtained. In particular, for F = 3 it has been proved that by using infinitesimal deformations of the associated model elementary Lie algebra it can be obtained families of filiform elementary lie algebras of order 3, analogously as that occurs into the theory of Lie algebras [M. Vergne, “Cohomologie des algèbres de Lie nilpotentes. Application à l’étude de la variété des algèbres de Lie nilpotentes,” Bull. Soc. Math. France 98, 81–116 (1970)]. Also we give the dimension, using an adaptation of the sl(2,C)-module Method, and a basis of such infinitesimal deformations in some generic cases

Parallelization of the Physical-Space Statistical Analysis System (PSAS)

Science.gov (United States)

Larson, J. W.; Guo, J.; Lyster, P. M.

1999-01-01

Atmospheric data assimilation is a method of combining observations with model forecasts to produce a more accurate description of the atmosphere than the observations or forecast alone can provide. Data assimilation plays an increasingly important role in the study of climate and atmospheric chemistry. The NASA Data Assimilation Office (DAO) has developed the Goddard Earth Observing System Data Assimilation System (GEOS DAS) to create assimilated datasets. The core computational components of the GEOS DAS include the GEOS General Circulation Model (GCM) and the Physical-space Statistical Analysis System (PSAS). The need for timely validation of scientific enhancements to the data assimilation system poses computational demands that are best met by distributed parallel software. PSAS is implemented in Fortran 90 using object-based design principles. The analysis portions of the code solve two equations. The first of these is the "innovation" equation, which is solved on the unstructured observation grid using a preconditioned conjugate gradient (CG) method. The "analysis" equation is a transformation from the observation grid back to a structured grid, and is solved by a direct matrix-vector multiplication. Use of a factored-operator formulation reduces the computational complexity of both the CG solver and the matrix-vector multiplication, rendering the matrix-vector multiplications as a successive product of operators on a vector. Sparsity is introduced to these operators by partitioning the observations using an icosahedral decomposition scheme. PSAS builds a large (approx. 128MB) run-time database of parameters used in the calculation of these operators. Implementing a message passing parallel computing paradigm into an existing yet developing computational system as complex as PSAS is nontrivial. One of the technical challenges is balancing the requirements for computational reproducibility with the need for high performance. The problem of computational

On lying and deceiving.

OpenAIRE

Bakhurst, D

1992-01-01

This article challenges Jennifer Jackson's recent defence of doctors' rights to deceive patients. Jackson maintains there is a general moral difference between lying and intentional deception: while doctors have a prima facie duty not to lie, there is no such obligation to avoid deception. This paper argues 1) that an examination of cases shows that lying and deception are often morally equivalent, and 2) that Jackson's position is premised on a species of moral functionalism that misconstrue...

Grid Connected Solar PV System with SEPIC Converter Compared with Parallel Boost Converter Based MPPT

OpenAIRE

Bosco Raj, T. Ajith; Ramesh, R.; Maglin, J. R.; Vaigundamoorthi, M.; William Christopher, I.; Gopinath, C.; Yaashuwanth, C.

2014-01-01

The main objective of this work is to study the behaviour of the solar PV systems and model the efficient Grid-connected solar power system. The DC-DC MPPT circuit using chaotic pulse width modulation has been designed to track maximum power from solar PV module. The conversion efficiency of the proposed MPPT system is increased when CPWM is used as a control scheme. This paper also proposes a simplified multilevel (seven level) inverter for a grid-connected photovoltaic system. The primary g...

Efficiency Analysis of the Parallel Implementation of the SIMPLE Algorithm on Multiprocessor Computers

Science.gov (United States)

Lashkin, S. V.; Kozelkov, A. S.; Yalozo, A. V.; Gerasimov, V. Yu.; Zelensky, D. K.

2017-12-01

This paper describes the details of the parallel implementation of the SIMPLE algorithm for numerical solution of the Navier-Stokes system of equations on arbitrary unstructured grids. The iteration schemes for the serial and parallel versions of the SIMPLE algorithm are implemented. In the description of the parallel implementation, special attention is paid to computational data exchange among processors under the condition of the grid model decomposition using fictitious cells. We discuss the specific features for the storage of distributed matrices and implementation of vector-matrix operations in parallel mode. It is shown that the proposed way of matrix storage reduces the number of interprocessor exchanges. A series of numerical experiments illustrates the effect of the multigrid SLAE solver tuning on the general efficiency of the algorithm; the tuning involves the types of the cycles used (V, W, and F), the number of iterations of a smoothing operator, and the number of cells for coarsening. Two ways (direct and indirect) of efficiency evaluation for parallelization of the numerical algorithm are demonstrated. The paper presents the results of solving some internal and external flow problems with the evaluation of parallelization efficiency by two algorithms. It is shown that the proposed parallel implementation enables efficient computations for the problems on a thousand processors. Based on the results obtained, some general recommendations are made for the optimal tuning of the multigrid solver, as well as for selecting the optimal number of cells per processor.

Trends in life science grid: from computing grid to knowledge grid

Directory of Open Access Journals (Sweden)

Konagaya Akihiko

2006-12-01

Full Text Available Abstract Background Grid computing has great potential to become a standard cyberinfrastructure for life sciences which often require high-performance computing and large data handling which exceeds the computing capacity of a single institution. Results This survey reviews the latest grid technologies from the viewpoints of computing grid, data grid and knowledge grid. Computing grid technologies have been matured enough to solve high-throughput real-world life scientific problems. Data grid technologies are strong candidates for realizing "resourceome" for bioinformatics. Knowledge grids should be designed not only from sharing explicit knowledge on computers but also from community formulation for sharing tacit knowledge among a community. Conclusion Extending the concept of grid from computing grid to knowledge grid, it is possible to make use of a grid as not only sharable computing resources, but also as time and place in which people work together, create knowledge, and share knowledge and experiences in a community.

Theory of super LIE groups

International Nuclear Information System (INIS)

Prakash, M.

1985-01-01

The theory of supergravity has attracted increasing attention in the recent years as a unified theory of elementary particle interactions. The superspace formulation of the theory is highly suggestive of an underlying geometrical structure of superspace. It also incorporates the beautifully geometrical general theory of relativity. It leads us to believe that a better understanding of its geometry would result in a better understanding of the theory itself, and furthermore, that the geometry of superspace would also have physical consequences. As a first step towards that goal, we develop here a theory of super Lie groups. These are groups that have the same relation to a super Lie algebra as Lie groups have to a Lie algebra. More precisely, a super Lie group is a super-manifold and a group such that the group operations are super-analytic. The super Lie algebra of a super Lie group is related to the local properties of the group near the identity. This work develops the algebraic and super-analytical tools necessary for our theory, including proofs of a set of existence and uniqueness theorems for a class of super-differential equations

A Modified Droop Control Method for Parallel-Connected Current Source Inverters

DEFF Research Database (Denmark)

Wei, Baoze; Guerrero, Josep M.; Quintero, Juan Carlos Vasquez

2016-01-01

In this paper, a novel control method was proposed for current source inverters under the grid-connected working mode. The control scheme is based on a modified droop control method, with an additional current reference signal that will be generated instead of the voltage reference. Hence......, there is only a current control loop with droop control in the whole control scheme without voltage control loop. So it is very suitable for grid-connected current source inverter which will simplify the design of the control scheme and combine the advantage of droop control. The parallel configuration...... is widely used to acquire high power demand, but the circulating current problem is a key issue that should be considered. In this paper, a simulation based on parallel current source inverters using the proposed control scheme is provided. Simulation results showed that a good circulating current...

A portable grid-enabled computing system for a nuclear material study

International Nuclear Information System (INIS)

Tsujita, Yuichi; Arima, Tatsumi; Takekawa, Takayuki; Suzuki, Yoshio

2010-01-01

We have built a portable grid-enabled computing system specialized for our molecular dynamics (MD) simulation program to study Pu material easily. Experimental approach to reveal properties of Pu materials is often accompanied by some difficulties such as radiotoxicity of actinides. Since a computational approach reveals new aspects to researchers without such radioactive facilities, we address an MD computation. In order to have more realistic results about e.g., melting point or thermal conductivity, we need a large scale of parallel computations. Most of application users who don't have supercomputers in their institutes should use a remote supercomputer. For such users, we have developed the portable and secured grid-enabled computing system to utilize a grid computing infrastructure provided by Information Technology Based Laboratory (ITBL). This system enables us to access remote supercomputers in the ITBL system seamlessly from a client PC through its graphical user interface (GUI). Typically it enables seamless file accesses on the GUI. Furthermore monitoring of standard output or standard error is available to see progress of an executed program. Since the system provides fruitful functionalities which are useful for parallel computing on a remote supercomputer, application users can concentrate on their researches. (author)

Parallel computing simulation of fluid flow in the unsaturated zone of Yucca Mountain, Nevada

International Nuclear Information System (INIS)

Zhang, Keni; Wu, Yu-Shu; Bodvarsson, G.S.

2001-01-01

This paper presents the application of parallel computing techniques to large-scale modeling of fluid flow in the unsaturated zone (UZ) at Yucca Mountain, Nevada. In this study, parallel computing techniques, as implemented into the TOUGH2 code, are applied in large-scale numerical simulations on a distributed-memory parallel computer. The modeling study has been conducted using an over-one-million-cell three-dimensional numerical model, which incorporates a wide variety of field data for the highly heterogeneous fractured formation at Yucca Mountain. The objective of this study is to analyze the impact of various surface infiltration scenarios (under current and possible future climates) on flow through the UZ system, using various hydrogeological conceptual models with refined grids. The results indicate that the one-million-cell models produce better resolution results and reveal some flow patterns that cannot be obtained using coarse-grid modeling models

Computations in finite-dimensional Lie algebras

Directory of Open Access Journals (Sweden)

A. M. Cohen

1997-12-01

Full Text Available This paper describes progress made in context with the construction of a general library of Lie algebra algorithms, called ELIAS (Eindhoven Lie Algebra System, within the computer algebra package GAP. A first sketch of the package can be found in Cohen and de Graaf[1]. Since then, in a collaborative effort with G. Ivanyos, the authors have continued to develop algorithms which were implemented in ELIAS by the second author. These activities are part of a bigger project, called ACELA and financed by STW, the Dutch Technology Foundation, which aims at an interactive book on Lie algebras (cf. Cohen and Meertens [2]. This paper gives a global description of the main ways in which to present Lie algebras on a computer. We focus on the transition from a Lie algebra abstractly given by an array of structure constants to a Lie algebra presented as a subalgebra of the Lie algebra of n×n matrices. We describe an algorithm typical of the structure analysis of a finite-dimensional Lie algebra: finding a Levi subalgebra of a Lie algebra.

Lying in Business : Insights from Hannah Arendt’s ‘Lying in Politics’

NARCIS (Netherlands)

Eenkhoorn, P.; Graafland, J.J.

2010-01-01

The famous political philosopher Hannah Arendt develops several arguments why truthfulness cannot be counted among the political virtues. This article shows that similar arguments apply to lying in business. Based on Hannah Arendt’s theory, we distinguish five reasons why lying is a structural

Grid interoperability: joining grid information systems

International Nuclear Information System (INIS)

Flechl, M; Field, L

2008-01-01

A grid is defined as being 'coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations'. Over recent years a number of grid projects, many of which have a strong regional presence, have emerged to help coordinate institutions and enable grids. Today, we face a situation where a number of grid projects exist, most of which are using slightly different middleware. Grid interoperation is trying to bridge these differences and enable Virtual Organizations to access resources at the institutions independent of their grid project affiliation. Grid interoperation is usually a bilateral activity between two grid infrastructures. Recently within the Open Grid Forum, the Grid Interoperability Now (GIN) Community Group is trying to build upon these bilateral activities. The GIN group is a focal point where all the infrastructures can come together to share ideas and experiences on grid interoperation. It is hoped that each bilateral activity will bring us one step closer to the overall goal of a uniform grid landscape. A fundamental aspect of a grid is the information system, which is used to find available grid services. As different grids use different information systems, interoperation between these systems is crucial for grid interoperability. This paper describes the work carried out to overcome these differences between a number of grid projects and the experiences gained. It focuses on the different techniques used and highlights the important areas for future standardization

Parallel computing of a climate model on the dawn 1000 by domain decomposition method

Science.gov (United States)

Bi, Xunqiang

1997-12-01

In this paper the parallel computing of a grid-point nine-level atmospheric general circulation model on the Dawn 1000 is introduced. The model was developed by the Institute of Atmospheric Physics (IAP), Chinese Academy of Sciences (CAS). The Dawn 1000 is a MIMD massive parallel computer made by National Research Center for Intelligent Computer (NCIC), CAS. A two-dimensional domain decomposition method is adopted to perform the parallel computing. The potential ways to increase the speed-up ratio and exploit more resources of future massively parallel supercomputation are also discussed.

Geodynamo and mantle convection simulations on the Earth Simulator using the Yin-Yang grid

International Nuclear Information System (INIS)

Kageyama, Akira; Yoshida, Masaki

2005-01-01

We have developed finite difference codes based on the Yin-Yang grid for the geodynamo simulation and the mantle convection simulation. The Yin-Yang grid is a kind of spherical overset grid that is composed of two identical component grids. The intrinsic simplicity of the mesh configuration of the Yin-Yang grid enables us to develop highly optimized simulation codes on massively parallel supercomputers. The Yin-Yang geodynamo code has achieved 15.2 Tflops with 4096 processors on the Earth Simulator. This represents 46% of the theoretical peak performance. The Yin-Yang mantle code has enabled us to carry out mantle convection simulations in realistic regimes with a Rayleigh number of 10 7 including strongly temperature dependent viscosity with spatial contrast up to 10 6

Thread-Level Parallel Indexing of Update Intensive Moving-Object Workloads

DEFF Research Database (Denmark)

Sidlauskas, Darius; Ross, Kenneth A.; Jensen, Christian S.

2011-01-01

as well as contain queries. The non-trivial challenge addressed is that of avoiding contention between long-running queries and frequent updates. Specifically, the paper proposes a grid-based indexing technique. A static grid indexes a near up-to-date snapshot of the data to support queries, while a live......Modern processors consist of multiple cores that each support parallel processing by multiple physical threads, and they offer ample main-memory storage. This paper studies the use of such processors for the processing of update-intensive moving-object workloads that contain very frequent updates...

Lying relies on the truth

NARCIS (Netherlands)

Debey, E.; De Houwer, J.; Verschuere, B.

2014-01-01

Cognitive models of deception focus on the conflict-inducing nature of the truth activation during lying. Here we tested the counterintuitive hypothesis that the truth can also serve a functional role in the act of lying. More specifically, we examined whether the construction of a lie can involve a

Lie families: theory and applications

International Nuclear Information System (INIS)

Carinena, Jose F; Grabowski, Janusz; De Lucas, Javier

2010-01-01

We analyze the families of non-autonomous systems of first-order ordinary differential equations admitting a common time-dependent superposition rule, i.e. a time-dependent map expressing any solution of each of these systems in terms of a generic set of particular solutions of the system and some constants. We next study the relations of these families, called Lie families, with the theory of Lie and quasi-Lie systems and apply our theory to provide common time-dependent superposition rules for certain Lie families.

Classification and identification of Lie algebras

CERN Document Server

Snobl, Libor

2014-01-01

The purpose of this book is to serve as a tool for researchers and practitioners who apply Lie algebras and Lie groups to solve problems arising in science and engineering. The authors address the problem of expressing a Lie algebra obtained in some arbitrary basis in a more suitable basis in which all essential features of the Lie algebra are directly visible. This includes algorithms accomplishing decomposition into a direct sum, identification of the radical and the Levi decomposition, and the computation of the nilradical and of the Casimir invariants. Examples are given for each algorithm. For low-dimensional Lie algebras this makes it possible to identify the given Lie algebra completely. The authors provide a representative list of all Lie algebras of dimension less or equal to 6 together with their important properties, including their Casimir invariants. The list is ordered in a way to make identification easy, using only basis independent properties of the Lie algebras. They also describe certain cl...

The structure of complex Lie groups

CERN Document Server

Lee, Dong Hoon

2001-01-01

Complex Lie groups have often been used as auxiliaries in the study of real Lie groups in areas such as differential geometry and representation theory. To date, however, no book has fully explored and developed their structural aspects.The Structure of Complex Lie Groups addresses this need. Self-contained, it begins with general concepts introduced via an almost complex structure on a real Lie group. It then moves to the theory of representative functions of Lie groups- used as a primary tool in subsequent chapters-and discusses the extension problem of representations that is essential for studying the structure of complex Lie groups. This is followed by a discourse on complex analytic groups that carry the structure of affine algebraic groups compatible with their analytic group structure. The author then uses the results of his earlier discussions to determine the observability of subgroups of complex Lie groups.The differences between complex algebraic groups and complex Lie groups are sometimes subtle ...

Robust Design of LCL-Filters for Active Damping in Grid Converters

DEFF Research Database (Denmark)

Alzola, Rafael Pena; Liserre, Marco; Blaabjerg, Frede

2013-01-01

Grid converters require a simple inductor or an LCL-filter to limit the current ripples. The LCL-filter is nowadays the preferred solution as it allows lower inductance values. In order to solve the stability concerns, active damping is preferred to passive damping since it does not use dissipative...... elements. However, large variations in the grid inductance and resonances arising from parallel converters may still compromise the system stability. This calls for a robust design of LCL-filters with active damping. This paper proposes a design flow with little iteration for two well-known methods, namely...... lead-lag network and current capacitor feedback. The proposed formulas for the resonance frequency, grid and converter inductance ratio, and capacitance of the LCL-filter allow calculating all the LCL-filter parameters. An estimation for the achieved Total Harmonic Distortion (THD) of the grid current...

Telecommunication Technologies for Smart Grid Projects with Focus on Smart Metering Applications

Directory of Open Access Journals (Sweden)

Nikoleta Andreadou

2016-05-01

Full Text Available This paper provides a study of the smart grid projects realised in Europe and presents their technological solutions with a focus on smart metering Low Voltage (LV applications. Special attention is given to the telecommunications technologies used. For this purpose, we present the telecommunication technologies chosen by several European utilities for the accomplishment of their smart meter national roll-outs. Further on, a study is performed based on the European Smart Grid Projects, highlighting their technological options. The range of the projects analysed covers the ones including smart metering implementation as well as those in which smart metering applications play a significant role in the overall project success. The survey reveals that various topics are directly or indirectly linked to smart metering applications, like smart home/building, energy management, grid monitoring and integration of Renewable Energy Sources (RES. Therefore, the technological options that lie behind such projects are pointed out. For reasons of completeness, we also present the main characteristics of the telecommunication technologies that are found to be used in practice for the LV grid.

Massive parallel 3D PIC simulation of negative ion extraction

Science.gov (United States)

Revel, Adrien; Mochalskyy, Serhiy; Montellano, Ivar Mauricio; Wünderlich, Dirk; Fantz, Ursel; Minea, Tiberiu

2017-09-01

The 3D PIC-MCC code ONIX is dedicated to modeling Negative hydrogen/deuterium Ion (NI) extraction and co-extraction of electrons from radio-frequency driven, low pressure plasma sources. It provides valuable insight on the complex phenomena involved in the extraction process. In previous calculations, a mesh size larger than the Debye length was used, implying numerical electron heating. Important steps have been achieved in terms of computation performance and parallelization efficiency allowing successful massive parallel calculations (4096 cores), imperative to resolve the Debye length. In addition, the numerical algorithms have been improved in terms of grid treatment, i.e., the electric field near the complex geometry boundaries (plasma grid) is calculated more accurately. The revised model preserves the full 3D treatment, but can take advantage of a highly refined mesh. ONIX was used to investigate the role of the mesh size, the re-injection scheme for lost particles (extracted or wall absorbed), and the electron thermalization process on the calculated extracted current and plasma characteristics. It is demonstrated that all numerical schemes give the same NI current distribution for extracted ions. Concerning the electrons, the pair-injection technique is found well-adapted to simulate the sheath in front of the plasma grid.

Fabrication of Si-nozzles for parallel mechano-electrospinning direct writing

International Nuclear Information System (INIS)

Pan, Yanqiao; Huang, YongAn; Bu, Ningbin; Yin, Zhouping

2013-01-01

Nozzles with micro-scale orifices drive high-resolution printing techniques for generating micro- to nano-scale droplets/lines. This paper presents the fabrication and application of Si-nozzles in mechano-electrospinning (MES). The fabrication process mainly consists of photolithography, Au deposition, inductively coupled plasma, and polydimethylsiloxane encapsulation. The 6 wt% polyethylene oxide solution is adopted to study the electrospinning behaviour and the relations between fibre diameter and process parameters in MES. A fibre grid with 250 µm spacing is able to be direct written, and the diameters are less than 3 µm. To improve the printing efficiency, positioning accuracy and flexibility, a rotatable multi-nozzle is adopted. The distance between parallel lines reduces sharply from 4.927 to 0.308 mm with the rotating angle increasing from 0° to 87°, and the fibre grids with tunable distance are achieved. This method paves the way for fabrication of addressable Si-nozzle array in parallel MES direct writing. (paper)

Numerical Nuclear Second Derivatives on a Computing Grid: Enabling and Accelerating Frequency Calculations on Complex Molecular Systems.

Science.gov (United States)

Yang, Tzuhsiung; Berry, John F

2018-06-04

The computation of nuclear second derivatives of energy, or the nuclear Hessian, is an essential routine in quantum chemical investigations of ground and transition states, thermodynamic calculations, and molecular vibrations. Analytic nuclear Hessian computations require the resolution of costly coupled-perturbed self-consistent field (CP-SCF) equations, while numerical differentiation of analytic first derivatives has an unfavorable 6 N ( N = number of atoms) prefactor. Herein, we present a new method in which grid computing is used to accelerate and/or enable the evaluation of the nuclear Hessian via numerical differentiation: NUMFREQ@Grid. Nuclear Hessians were successfully evaluated by NUMFREQ@Grid at the DFT level as well as using RIJCOSX-ZORA-MP2 or RIJCOSX-ZORA-B2PLYP for a set of linear polyacenes with systematically increasing size. For the larger members of this group, NUMFREQ@Grid was found to outperform the wall clock time of analytic Hessian evaluation; at the MP2 or B2LYP levels, these Hessians cannot even be evaluated analytically. We also evaluated a 156-atom catalytically relevant open-shell transition metal complex and found that NUMFREQ@Grid is faster (7.7 times shorter wall clock time) and less demanding (4.4 times less memory requirement) than an analytic Hessian. Capitalizing on the capabilities of parallel grid computing, NUMFREQ@Grid can outperform analytic methods in terms of wall time, memory requirements, and treatable system size. The NUMFREQ@Grid method presented herein demonstrates how grid computing can be used to facilitate embarrassingly parallel computational procedures and is a pioneer for future implementations.

Purposes and Effects of Lying.

Science.gov (United States)

Hample, Dale

Three exploratory studies were aimed at describing the purposes of lies and the consequences of lying. Data were collected through a partly open-ended questionnaire, a content analysis of several tape-recorded interviews, and a large-scale survey. The results showed that two of every three lies were told for selfish reasons, while three of every…

Teaching the Truth about Lies to Psychology Students: The Speed Lying Task

Science.gov (United States)

Pearson, Matthew R.; Richardson, Thomas A.

2013-01-01

To teach the importance of deception in everyday social life, an in-class activity called the "Speed Lying Task" was given in an introductory social psychology class. In class, two major research findings were replicated: Individuals detected deception at levels no better than expected by chance and lie detection confidence was unrelated…

On lying and deceiving.

Science.gov (United States)

Bakhurst, D

1992-06-01

This article challenges Jennifer Jackson's recent defence of doctors' rights to deceive patients. Jackson maintains there is a general moral difference between lying and intentional deception: while doctors have a prima facie duty not to lie, there is no such obligation to avoid deception. This paper argues 1) that an examination of cases shows that lying and deception are often morally equivalent, and 2) that Jackson's position is premised on a species of moral functionalism that misconstrues the nature of moral obligation. Against Jackson, it is argued that both lying and intentional deception are wrong where they infringe a patient's right to autonomy or his/her right to be treated with dignity. These rights represent 'deontological constraints' on action, defining what we must not do whatever the functional value of the consequences. Medical ethics must recognise such constraints if it is to contribute to the moral integrity of medical practice.

Gradings on simple Lie algebras

CERN Document Server

Elduque, Alberto

2013-01-01

Gradings are ubiquitous in the theory of Lie algebras, from the root space decomposition of a complex semisimple Lie algebra relative to a Cartan subalgebra to the beautiful Dempwolff decomposition of E_8 as a direct sum of thirty-one Cartan subalgebras. This monograph is a self-contained exposition of the classification of gradings by arbitrary groups on classical simple Lie algebras over algebraically closed fields of characteristic not equal to 2 as well as on some nonclassical simple Lie algebras in positive characteristic. Other important algebras also enter the stage: matrix algebras, the octonions, and the Albert algebra. Most of the presented results are recent and have not yet appeared in book form. This work can be used as a textbook for graduate students or as a reference for researchers in Lie theory and neighboring areas.

Exploring Shared-Memory Optimizations for an Unstructured Mesh CFD Application on Modern Parallel Systems

KAUST Repository

Mudigere, Dheevatsa

2015-05-01

In this work, we revisit the 1999 Gordon Bell Prize winning PETSc-FUN3D aerodynamics code, extending it with highly-tuned shared-memory parallelization and detailed performance analysis on modern highly parallel architectures. An unstructured-grid implicit flow solver, which forms the backbone of computational aerodynamics, poses particular challenges due to its large irregular working sets, unstructured memory accesses, and variable/limited amount of parallelism. This code, based on a domain decomposition approach, exposes tradeoffs between the number of threads assigned to each MPI-rank sub domain, and the total number of domains. By applying several algorithm- and architecture-aware optimization techniques for unstructured grids, we show a 6.9X speed-up in performance on a single-node Intel® XeonTM1 E5 2690 v2 processor relative to the out-of-the-box compilation. Our scaling studies on TACC Stampede supercomputer show that our optimizations continue to provide performance benefits over baseline implementation as we scale up to 256 nodes.

Automorphic Lie algebras with dihedral symmetry

International Nuclear Information System (INIS)

Knibbeler, V; Lombardo, S; A Sanders, J

2014-01-01

The concept of automorphic Lie algebras arises in the context of reduction groups introduced in the early 1980s in the field of integrable systems. automorphic Lie algebras are obtained by imposing a discrete group symmetry on a current algebra of Krichever–Novikov type. Past work shows remarkable uniformity between algebras associated to different reduction groups. For example, if the base Lie algebra is sl 2 (C) and the poles of the automorphic Lie algebra are restricted to an exceptional orbit of the symmetry group, changing the reduction group does not affect the Lie algebra structure. In this research we fix the reduction group to be the dihedral group and vary the orbit of poles as well as the group action on the base Lie algebra. We find a uniform description of automorphic Lie algebras with dihedral symmetry, valid for poles at exceptional and generic orbits. (paper)

The ease of lying

NARCIS (Netherlands)

Verschuere, B.; Spruyt, A.; Meijer, E.H.; Otgaar, H.

2011-01-01

Brain imaging studies suggest that truth telling constitutes the default of the human brain and that lying involves intentional suppression of the predominant truth response. By manipulating the truth proportion in the Sheffield lie test, we investigated whether the dominance of the truth response

GridRun: A lightweight packaging and execution environment forcompact, multi-architecture binaries

Energy Technology Data Exchange (ETDEWEB)

Shalf, John; Goodale, Tom

2004-02-01

GridRun offers a very simple set of tools for creating and executing multi-platform binary executables. These ''fat-binaries'' archive native machine code into compact packages that are typically a fraction the size of the original binary images they store, enabling efficient staging of executables for heterogeneous parallel jobs. GridRun interoperates with existing distributed job launchers/managers like Condor and the Globus GRAM to greatly simplify the logic required launching native binary applications in distributed heterogeneous environments.

A parallel adaptive finite difference algorithm for petroleum reservoir simulation

Energy Technology Data Exchange (ETDEWEB)

Hoang, Hai Minh

2005-07-01

Adaptive finite differential for problems arising in simulation of flow in porous medium applications are considered. Such methods have been proven useful for overcoming limitations of computational resources and improving the resolution of the numerical solutions to a wide range of problems. By local refinement of the computational mesh where it is needed to improve the accuracy of solutions, yields better solution resolution representing more efficient use of computational resources than is possible with traditional fixed-grid approaches. In this thesis, we propose a parallel adaptive cell-centered finite difference (PAFD) method for black-oil reservoir simulation models. This is an extension of the adaptive mesh refinement (AMR) methodology first developed by Berger and Oliger (1984) for the hyperbolic problem. Our algorithm is fully adaptive in time and space through the use of subcycling, in which finer grids are advanced at smaller time steps than the coarser ones. When coarse and fine grids reach the same advanced time level, they are synchronized to ensure that the global solution is conservative and satisfy the divergence constraint across all levels of refinement. The material in this thesis is subdivided in to three overall parts. First we explain the methodology and intricacies of AFD scheme. Then we extend a finite differential cell-centered approximation discretization to a multilevel hierarchy of refined grids, and finally we are employing the algorithm on parallel computer. The results in this work show that the approach presented is robust, and stable, thus demonstrating the increased solution accuracy due to local refinement and reduced computing resource consumption. (Author)

Performance evaluation for compressible flow calculations on five parallel computers of different architectures

International Nuclear Information System (INIS)

Kimura, Toshiya.

1997-03-01

A two-dimensional explicit Euler solver has been implemented for five MIMD parallel computers of different machine architectures in Center for Promotion of Computational Science and Engineering of Japan Atomic Energy Research Institute. These parallel computers are Fujitsu VPP300, NEC SX-4, CRAY T94, IBM SP2, and Hitachi SR2201. The code was parallelized by several parallelization methods, and a typical compressible flow problem has been calculated for different grid sizes changing the number of processors. Their effective performances for parallel calculations, such as calculation speed, speed-up ratio and parallel efficiency, have been investigated and evaluated. The communication time among processors has been also measured and evaluated. As a result, the differences on the performance and the characteristics between vector-parallel and scalar-parallel computers can be pointed, and it will present the basic data for efficient use of parallel computers and for large scale CFD simulations on parallel computers. (author)

Lie algebras and applications

CERN Document Server

Iachello, Francesco

2015-01-01

This course-based primer provides an introduction to Lie algebras and some of their applications to the spectroscopy of molecules, atoms, nuclei and hadrons. In the first part, it concisely presents the basic concepts of Lie algebras, their representations and their invariants. The second part includes a description of how Lie algebras are used in practice in the treatment of bosonic and fermionic systems. Physical applications considered include rotations and vibrations of molecules (vibron model), collective modes in nuclei (interacting boson model), the atomic shell model, the nuclear shell model, and the quark model of hadrons. One of the key concepts in the application of Lie algebraic methods in physics, that of spectrum generating algebras and their associated dynamic symmetries, is also discussed. The book highlights a number of examples that help to illustrate the abstract algebraic definitions and includes a summary of many formulas of practical interest, such as the eigenvalues of Casimir operators...

On lying and deceiving.

Science.gov (United States)

Bakhurst, D

1992-01-01

This article challenges Jennifer Jackson's recent defence of doctors' rights to deceive patients. Jackson maintains there is a general moral difference between lying and intentional deception: while doctors have a prima facie duty not to lie, there is no such obligation to avoid deception. This paper argues 1) that an examination of cases shows that lying and deception are often morally equivalent, and 2) that Jackson's position is premised on a species of moral functionalism that misconstrues the nature of moral obligation. Against Jackson, it is argued that both lying and intentional deception are wrong where they infringe a patient's right to autonomy or his/her right to be treated with dignity. These rights represent 'deontological constraints' on action, defining what we must not do whatever the functional value of the consequences. Medical ethics must recognise such constraints if it is to contribute to the moral integrity of medical practice. PMID:1619626

A Parallel Algebraic Multigrid Solver on Graphics Processing Units

KAUST Repository

Haase, Gundolf

2010-01-01

The paper presents a multi-GPU implementation of the preconditioned conjugate gradient algorithm with an algebraic multigrid preconditioner (PCG-AMG) for an elliptic model problem on a 3D unstructured grid. An efficient parallel sparse matrix-vector multiplication scheme underlying the PCG-AMG algorithm is presented for the many-core GPU architecture. A performance comparison of the parallel solver shows that a singe Nvidia Tesla C1060 GPU board delivers the performance of a sixteen node Infiniband cluster and a multi-GPU configuration with eight GPUs is about 100 times faster than a typical server CPU core. © 2010 Springer-Verlag.

A Hierarchical and Distributed Approach for Mapping Large Applications to Heterogeneous Grids using Genetic Algorithms

Science.gov (United States)

Sanyal, Soumya; Jain, Amit; Das, Sajal K.; Biswas, Rupak

2003-01-01

In this paper, we propose a distributed approach for mapping a single large application to a heterogeneous grid environment. To minimize the execution time of the parallel application, we distribute the mapping overhead to the available nodes of the grid. This approach not only provides a fast mapping of tasks to resources but is also scalable. We adopt a hierarchical grid model and accomplish the job of mapping tasks to this topology using a scheduler tree. Results show that our three-phase algorithm provides high quality mappings, and is fast and scalable.

The Evolution of the Internet Community and the"Yet-to-Evolve" Smart Grid Community: Parallels and Lessons-to-be-Learned

Energy Technology Data Exchange (ETDEWEB)

McParland, Charles

2009-11-06

The Smart Grid envisions a transformed US power distribution grid that enables communicating devices, under human supervision, to moderate loads and increase overall system stability and security. This vision explicitly promotes increased participation from a community that, in the past, has had little involvement in power grid operations -the consumer. The potential size of this new community and its member's extensive experience with the public Internet prompts an analysis of the evolution and current state of the Internet as a predictor for best practices in the architectural design of certain portions of the Smart Grid network. Although still evolving, the vision of the Smart Grid is that of a community of communicating and cooperating energy related devices that can be directed to route power and modulate loads in pursuit of an integrated, efficient and secure electrical power grid. The remaking of the present power grid into the Smart Grid is considered as fundamentally transformative as previous developments such as modern computing technology and high bandwidth data communications. However, unlike these earlier developments, which relied on the discovery of critical new technologies (e.g. the transistor or optical fiber transmission lines), the technologies required for the Smart Grid currently exist and, in many cases, are already widely deployed. In contrast to other examples of technical transformations, the path (and success) of the Smart Grid will be determined not by its technology, but by its system architecture. Fortunately, we have a recent example of a transformative force of similar scope that shares a fundamental dependence on our existing communications infrastructure - namely, the Internet. We will explore several ways in which the scale of the Internet and expectations of its users have shaped the present Internet environment. As the presence of consumers within the Smart Grid increases, some experiences from the early growth of the

Exponentiation and deformations of Lie-admissible algebras

International Nuclear Information System (INIS)

Myung, H.C.

1982-01-01

The exponential function is defined for a finite-dimensional real power-associative algebra with unit element. The application of the exponential function is focused on the power-associative (p,q)-mutation of a real or complex associative algebra. Explicit formulas are computed for the (p,q)-mutation of the real envelope of the spin 1 algebra and the Lie algebra so(3) of the rotation group, in light of earlier investigations of the spin 1/2. A slight variant of the mutated exponential is interpreted as a continuous function of the Lie algebra into some isotope of the corresponding linear Lie group. The second part of this paper is concerned with the representation and deformation of a Lie-admissible algebra. The second cohomology group of a Lie-admissible algebra is introduced as a generalization of those of associative and Lie algebras in the Hochschild and Chevalley-Eilenberg theory. Some elementary theory of algebraic deformation of Lie-admissible algebras is discussed in view of generalization of that of associative and Lie algebras. Lie-admissible deformations are also suggested by the representation of Lie-admissible algebras. Some explicit examples of Lie-admissible deformation are given in terms of the (p,q)-mutation of associative deformation of an associative algebra. Finally, we discuss Lie-admissible deformations of order one

Lie algebra of conformal Killing–Yano forms

International Nuclear Information System (INIS)

Ertem, Ümit

2016-01-01

We provide a generalization of the Lie algebra of conformal Killing vector fields to conformal Killing–Yano forms. A new Lie bracket for conformal Killing–Yano forms that corresponds to slightly modified Schouten–Nijenhuis bracket of differential forms is proposed. We show that conformal Killing–Yano forms satisfy a graded Lie algebra in constant curvature manifolds. It is also proven that normal conformal Killing–Yano forms in Einstein manifolds also satisfy a graded Lie algebra. The constructed graded Lie algebras reduce to the graded Lie algebra of Killing–Yano forms and the Lie algebras of conformal Killing and Killing vector fields in special cases. (paper)

Efficient Pseudorecursive Evaluation Schemes for Non-adaptive Sparse Grids

KAUST Repository

Buse, Gerrit

2014-01-01

In this work we propose novel algorithms for storing and evaluating sparse grid functions, operating on regular (not spatially adaptive), yet potentially dimensionally adaptive grid types. Besides regular sparse grids our approach includes truncated grids, both with and without boundary grid points. Similar to the implicit data structures proposed in Feuersänger (Dünngitterverfahren für hochdimensionale elliptische partielle Differntialgleichungen. Diploma Thesis, Institut für Numerische Simulation, Universität Bonn, 2005) and Murarasu et al. (Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel Programming. Cambridge University Press, New York, 2011, pp. 25–34) we also define a bijective mapping from the multi-dimensional space of grid points to a contiguous index, such that the grid data can be stored in a simple array without overhead. Our approach is especially well-suited to exploit all levels of current commodity hardware, including cache-levels and vector extensions. Furthermore, this kind of data structure is extremely attractive for today’s real-time applications, as it gives direct access to the hierarchical structure of the grids, while outperforming other common sparse grid structures (hash maps, etc.) which do not match with modern compute platforms that well. For dimensionality d ≤ 10 we achieve good speedups on a 12 core Intel Westmere-EP NUMA platform compared to the results presented in Murarasu et al. (Proceedings of the International Conference on Computational Science—ICCS 2012. Procedia Computer Science, 2012). As we show, this also holds for the results obtained on Nvidia Fermi GPUs, for which we observe speedups over our own CPU implementation of up to 4.5 when dealing with moderate dimensionality. In high-dimensional settings, in the order of tens to hundreds of dimensions, our sparse grid evaluation kernels on the CPU outperform any other known implementation.

Cellular Genetic Algorithm with Communicating Grids for Assembly Line Balancing Problems

Directory of Open Access Journals (Sweden)

BRUDARU, O.

2010-05-01

Full Text Available This paper presents a new approach with cellular multigrid genetic algorithms for the "I"-shaped and "U"-shaped assembly line balancing problems, including parallel workstations and compatibility constraints. First, a cellular hybrid genetic algorithm that uses a single grid is described. Appropriate operators for mutation, hypermutation, and crossover and two devoration techniques are proposed for creating and maintaining groups based on similarity. This monogrid algorithm is extended for handling many populations placed on different grids. In the multigrid version, the population of each grid is organized in clusters using the positional information of the chromosomes. A similarity preserving communication protocol between the clusters placed on different grids is introduced. The experimental evaluation shows that the multigrid cellular genetic algorithm with communicating grids is better than the hybrid genetic algorithm used for building it, whereas it dominates the monogrid version in all cases. Absolute performance is evaluated using classical benchmarks. The role of certain components of the cellular algorithm is explained and the effect of some parameters is evaluated.

An Off-Grid Turbo Channel Estimation Algorithm for Millimeter Wave Communications

Directory of Open Access Journals (Sweden)

Lingyi Han

2016-09-01

Full Text Available The bandwidth shortage has motivated the exploration of the millimeter wave (mmWave frequency spectrum for future communication networks. To compensate for the severe propagation attenuation in the mmWave band, massive antenna arrays can be adopted at both the transmitter and receiver to provide large array gains via directional beamforming. To achieve such array gains, channel estimation (CE with high resolution and low latency is of great importance for mmWave communications. However, classic super-resolution subspace CE methods such as multiple signal classification (MUSIC and estimation of signal parameters via rotation invariant technique (ESPRIT cannot be applied here due to RF chain constraints. In this paper, an enhanced CE algorithm is developed for the off-grid problem when quantizing the angles of mmWave channel in the spatial domain where off-grid problem refers to the scenario that angles do not lie on the quantization grids with high probability, and it results in power leakage and severe reduction of the CE performance. A new model is first proposed to formulate the off-grid problem. The new model divides the continuously-distributed angle into a quantized discrete grid part, referred to as the integral grid angle, and an offset part, termed fractional off-grid angle. Accordingly, an iterative off-grid turbo CE (IOTCE algorithm is proposed to renew and upgrade the CE between the integral grid part and the fractional off-grid part under the Turbo principle. By fully exploiting the sparse structure of mmWave channels, the integral grid part is estimated by a soft-decoding based compressed sensing (CS method called improved turbo compressed channel sensing (ITCCS. It iteratively updates the soft information between the linear minimum mean square error (LMMSE estimator and the sparsity combiner. Monte Carlo simulations are presented to evaluate the performance of the proposed method, and the results show that it enhances the angle

Efficient relaxed-Jacobi smoothers for multigrid on parallel computers

Science.gov (United States)

Yang, Xiang; Mittal, Rajat

2017-03-01

In this Technical Note, we present a family of Jacobi-based multigrid smoothers suitable for the solution of discretized elliptic equations. These smoothers are based on the idea of scheduled-relaxation Jacobi proposed recently by Yang & Mittal (2014) [18] and employ two or three successive relaxed Jacobi iterations with relaxation factors derived so as to maximize the smoothing property of these iterations. The performance of these new smoothers measured in terms of convergence acceleration and computational workload, is assessed for multi-domain implementations typical of parallelized solvers, and compared to the lexicographic point Gauss-Seidel smoother. The tests include the geometric multigrid method on structured grids as well as the algebraic grid method on unstructured grids. The tests demonstrate that unlike Gauss-Seidel, the convergence of these Jacobi-based smoothers is unaffected by domain decomposition, and furthermore, they outperform the lexicographic Gauss-Seidel by factors that increase with domain partition count.

Fractional supersymmetry and infinite dimensional lie algebras

International Nuclear Information System (INIS)

Rausch de Traubenberg, M.

2001-01-01

In an earlier work extensions of supersymmetry and super Lie algebras were constructed consistently starting from any representation D of any Lie algebra g. Here it is shown how infinite dimensional Lie algebras appear naturally within the framework of fractional supersymmetry. Using a differential realization of g this infinite dimensional Lie algebra, containing the Lie algebra g as a sub-algebra, is explicitly constructed

Grid for Earth Science Applications

Science.gov (United States)

Petitdidier, Monique; Schwichtenberg, Horst

2013-04-01

The civil society at large has addressed to the Earth Science community many strong requirements related in particular to natural and industrial risks, climate changes, new energies. The main critical point is that on one hand the civil society and all public ask for certainties i.e. precise values with small error range as it concerns prediction at short, medium and long term in all domains; on the other hand Science can mainly answer only in terms of probability of occurrence. To improve the answer or/and decrease the uncertainties, (1) new observational networks have been deployed in order to have a better geographical coverage and more accurate measurements have been carried out in key locations and aboard satellites. Following the OECD recommendations on the openness of research and public sector data, more and more data are available for Academic organisation and SMEs; (2) New algorithms and methodologies have been developed to face the huge data processing and assimilation into simulations using new technologies and compute resources. Finally, our total knowledge about the complex Earth system is contained in models and measurements, how we put them together has to be managed cleverly. The technical challenge is to put together databases and computing resources to answer the ES challenges. However all the applications are very intensive computing. Different compute solutions are available and depend on the characteristics of the applications. One of them is Grid especially efficient for independent or embarrassingly parallel jobs related to statistical and parametric studies. Numerous applications in atmospheric chemistry, meteorology, seismology, hydrology, pollution, climate and biodiversity have been deployed successfully on Grid. In order to fulfill requirements of risk management, several prototype applications have been deployed using OGC (Open geospatial Consortium) components with Grid middleware. The Grid has permitted via a huge number of runs to

Coordinating Flexibility under Uncertainty in Multi-Area AC and DC Grids

DEFF Research Database (Denmark)

Halilbasic, Lejla; Chatzivasileiadis, Spyros; Pinson, Pierre

2017-01-01

In the future, mixed AC and DC grids, spanning multiple areas operated by different transmission system operators (TSO), are expected to offer the necessary controllability for integrating large amounts of intermittent renewable generation. This is facilitated by high voltage direct current...... transmission based on voltage source converter technology that can offer recourse actions in the form of preventive and corrective control of both active and reactive power. Market-clearing procedures, based on optimal power flow algorithms, need to be revised to account for DC transmission, flexibility...... and privacy requirements. To this end, we propose a decentralized two-stage stochastic market-clearing algorithm that incorporates meshed DC grids and allows the sharing of flexibility resources between areas. The benefit of this approach lies in its pricing mechanism, used for coordinating the different area...

Invariants of triangular Lie algebras

International Nuclear Information System (INIS)

Boyko, Vyacheslav; Patera, Jiri; Popovych, Roman

2007-01-01

Triangular Lie algebras are the Lie algebras which can be faithfully represented by triangular matrices of any finite size over the real/complex number field. In the paper invariants ('generalized Casimir operators') are found for three classes of Lie algebras, namely those which are either strictly or non-strictly triangular, and for so-called special upper triangular Lie algebras. Algebraic algorithm of Boyko et al (2006 J. Phys. A: Math. Gen.39 5749 (Preprint math-ph/0602046)), developed further in Boyko et al (2007 J. Phys. A: Math. Theor.40 113 (Preprint math-ph/0606045)), is used to determine the invariants. A conjecture of Tremblay and Winternitz (2001 J. Phys. A: Math. Gen.34 9085), concerning the number of independent invariants and their form, is corroborated

Parallel dispatch: a new paradigm of electrical power system dispatch

Energy Technology Data Exchange (ETDEWEB)

Zhang, Jun Jason; Wang, Fei-Yue; Wang, Qiang; Hao, Dazhi; Yang, Xiaojing; Gao, David Wenzhong; Zhao, Xiangyang; Zhang, Yingchen

2018-01-01

Modern power systems are evolving into sociotechnical systems with massive complexity, whose real-time operation and dispatch go beyond human capability. Thus, the need for developing and applying new intelligent power system dispatch tools are of great practical significance. In this paper, we introduce the overall business model of power system dispatch, the top level design approach of an intelligent dispatch system, and the parallel intelligent technology with its dispatch applications. We expect that a new dispatch paradigm, namely the parallel dispatch, can be established by incorporating various intelligent technologies, especially the parallel intelligent technology, to enable secure operation of complex power grids, extend system operators U+02BC capabilities, suggest optimal dispatch strategies, and to provide decision-making recommendations according to power system operational goals.

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

Lie algebroids in derived differential topology

NARCIS (Netherlands)

Nuiten, J.J.

2018-01-01

A classical principle in deformation theory asserts that any formal deformation problem is controlled by a differential graded Lie algebra. This thesis studies a generalization of this principle to Lie algebroids, and uses this to examine the interactions between the theory of Lie algebroids and the

The MammoGrid Project Grids Architecture

CERN Document Server

McClatchey, Richard; Hauer, Tamas; Estrella, Florida; Saiz, Pablo; Rogulin, Dmitri; Buncic, Predrag; Clatchey, Richard Mc; Buncic, Predrag; Manset, David; Hauer, Tamas; Estrella, Florida; Saiz, Pablo; Rogulin, Dmitri

2003-01-01

The aim of the recently EU-funded MammoGrid project is, in the light of emerging Grid technology, to develop a European-wide database of mammograms that will be used to develop a set of important healthcare applications and investigate the potential of this Grid to support effective co-working between healthcare professionals throughout the EU. The MammoGrid consortium intends to use a Grid model to enable distributed computing that spans national borders. This Grid infrastructure will be used for deploying novel algorithms as software directly developed or enhanced within the project. Using the MammoGrid clinicians will be able to harness the use of massive amounts of medical image data to perform epidemiological studies, advanced image processing, radiographic education and ultimately, tele-diagnosis over communities of medical "virtual organisations". This is achieved through the use of Grid-compliant services [1] for managing (versions of) massively distributed files of mammograms, for handling the distri...

Quantum Lie theory a multilinear approach

CERN Document Server

Kharchenko, Vladislav

2015-01-01

This is an introduction to the mathematics behind the phrase “quantum Lie algebra”. The numerous attempts over the last 15-20 years to define a quantum Lie algebra as an elegant algebraic object with a binary “quantum” Lie bracket have not been widely accepted. In this book, an alternative approach is developed that includes multivariable operations. Among the problems discussed are the following: a PBW-type theorem; quantum deformations of Kac--Moody algebras; generic and symmetric quantum Lie operations; the Nichols algebras; the Gurevich--Manin  Lie algebras;  and Shestakov--Umirbaev  operations for the Lie theory of nonassociative products.  Opening with an introduction for beginners and continuing as a textbook for graduate students in physics and mathematics, the book can also be used as a reference by more advanced readers. With the exception of the introductory chapter, the content of this monograph has not previously appeared in book form.

VisPortal: Deploying grid-enabled visualization tools through a web-portal interface

Energy Technology Data Exchange (ETDEWEB)

Bethel, Wes; Siegerist, Cristina; Shalf, John; Shetty, Praveenkumar; Jankun-Kelly, T.J.; Kreylos, Oliver; Ma, Kwan-Liu

2003-06-09

The LBNL/NERSC Visportal effort explores ways to deliver advanced Remote/Distributed Visualization (RDV) capabilities through a Grid-enabled web-portal interface. The effort focuses on latency tolerant distributed visualization algorithms, GUI designs that are more appropriate for the capabilities of web interfaces, and refactoring parallel-distributed applications to work in a N-tiered component deployment strategy. Most importantly, our aim is to leverage commercially-supported technology as much as possible in order to create a deployable, supportable, and hence viable platform for delivering grid-based visualization services to collaboratory users.

A parallel algorithm for 3D dislocation dynamics

International Nuclear Information System (INIS)

Wang Zhiqiang; Ghoniem, Nasr; Swaminarayan, Sriram; LeSar, Richard

2006-01-01

Dislocation dynamics (DD), a discrete dynamic simulation method in which dislocations are the fundamental entities, is a powerful tool for investigation of plasticity, deformation and fracture of materials at the micron length scale. However, severe computational difficulties arising from complex, long-range interactions between these curvilinear line defects limit the application of DD in the study of large-scale plastic deformation. We present here the development of a parallel algorithm for accelerated computer simulations of DD. By representing dislocations as a 3D set of dislocation particles, we show here that the problem of an interacting ensemble of dislocations can be converted to a problem of a particle ensemble, interacting with a long-range force field. A grid using binary space partitioning is constructed to keep track of node connectivity across domains. We demonstrate the computational efficiency of the parallel micro-plasticity code and discuss how O(N) methods map naturally onto the parallel data structure. Finally, we present results from applications of the parallel code to deformation in single crystal fcc metals

Parallel computing in genomic research: advances and applications.

Science.gov (United States)

Ocaña, Kary; de Oliveira, Daniel

2015-01-01

Today's genomic experiments have to process the so-called "biological big data" that is now reaching the size of Terabytes and Petabytes. To process this huge amount of data, scientists may require weeks or months if they use their own workstations. Parallelism techniques and high-performance computing (HPC) environments can be applied for reducing the total processing time and to ease the management, treatment, and analyses of this data. However, running bioinformatics experiments in HPC environments such as clouds, grids, clusters, and graphics processing unit requires the expertise from scientists to integrate computational, biological, and mathematical techniques and technologies. Several solutions have already been proposed to allow scientists for processing their genomic experiments using HPC capabilities and parallelism techniques. This article brings a systematic review of literature that surveys the most recently published research involving genomics and parallel computing. Our objective is to gather the main characteristics, benefits, and challenges that can be considered by scientists when running their genomic experiments to benefit from parallelism techniques and HPC capabilities.

Lie Algebras Associated with Group U(n)

International Nuclear Information System (INIS)

Zhang Yufeng; Dong Huanghe; Honwah Tam

2007-01-01

Starting from the subgroups of the group U(n), the corresponding Lie algebras of the Lie algebra A 1 are presented, from which two well-known simple equivalent matrix Lie algebras are given. It follows that a few expanding Lie algebras are obtained by enlarging matrices. Some of them can be devoted to producing double integrable couplings of the soliton hierarchies of nonlinear evolution equations. Others can be used to generate integrable couplings involving more potential functions. The above Lie algebras are classified into two types. Only one type can generate the integrable couplings, whose Hamiltonian structure could be obtained by use of the quadratic-form identity. In addition, one condition on searching for integrable couplings is improved such that more useful Lie algebras are enlightened to engender. Then two explicit examples are shown to illustrate the applications of the Lie algebras. Finally, with the help of closed cycling operation relations, another way of producing higher-dimensional Lie algebras is given.

Koszul information geometry and Souriau Lie group thermodynamics

Energy Technology Data Exchange (ETDEWEB)

Barbaresco, Frédéric, E-mail: frederic.barbaresco@thalesgroup.com

2015-01-13

The François Massieu 1869 idea to derive some mechanical and thermal properties of physical systems from 'Characteristic Functions', was developed by Gibbs and Duhem in thermodynamics with the concept of potentials, and introduced by Poincaré in probability. This paper deals with generalization of this Characteristic Function concept by Jean-Louis Koszul in Mathematics and by Jean-Marie Souriau in Statistical Physics. The Koszul-Vinberg Characteristic Function (KVCF) on convex cones will be presented as cornerstone of 'Information Geometry' theory, defining Koszul Entropy as Legendre transform of minus the logarithm of KVCF, and Fisher Information Metrics as hessian of these dual functions, invariant by their automorphisms. In parallel, Souriau has extended the Characteristic Function in Statistical Physics looking for other kinds of invariances through co-adjoint action of a group on its momentum space, defining physical observables like energy, heat and momentum as pure geometrical objects. In covariant Souriau model, Gibbs equilibriums states are indexed by a geometric parameter, the Geometric (Planck) Temperature, with values in the Lie algebra of the dynamical Galileo/Poincaré groups, interpreted as a space-time vector, giving to the metric tensor a null Lie derivative. Fisher Information metric appears as the opposite of the derivative of Mean 'Moment map' by geometric temperature, equivalent to a Geometric Capacity or Specific Heat. These elements has been developed by author in [10][11].

Local and Nonlocal Parallel Heat Transport in General Magnetic Fields

International Nuclear Information System (INIS)

Castillo-Negrete, D. del; Chacon, L.

2011-01-01

A novel approach for the study of parallel transport in magnetized plasmas is presented. The method avoids numerical pollution issues of grid-based formulations and applies to integrable and chaotic magnetic fields with local or nonlocal parallel closures. In weakly chaotic fields, the method gives the fractal structure of the devil's staircase radial temperature profile. In fully chaotic fields, the temperature exhibits self-similar spatiotemporal evolution with a stretched-exponential scaling function for local closures and an algebraically decaying one for nonlocal closures. It is shown that, for both closures, the effective radial heat transport is incompatible with the quasilinear diffusion model.

Concatenating algorithms for parallel numerical simulations coupling radiation hydrodynamics with neutron transport

International Nuclear Information System (INIS)

Mo Zeyao

2004-11-01

Multiphysics parallel numerical simulations are usually essential to simplify researches on complex physical phenomena in which several physics are tightly coupled. It is very important on how to concatenate those coupled physics for fully scalable parallel simulation. Meanwhile, three objectives should be balanced, the first is efficient data transfer among simulations, the second and the third are efficient parallel executions and simultaneously developments of those simulation codes. Two concatenating algorithms for multiphysics parallel numerical simulations coupling radiation hydrodynamics with neutron transport on unstructured grid are presented. The first algorithm, Fully Loosely Concatenation (FLC), focuses on the independence of code development and the independence running with optimal performance of code. The second algorithm. Two Level Tightly Concatenation (TLTC), focuses on the optimal tradeoffs among above three objectives. Theoretical analyses for communicational complexity and parallel numerical experiments on hundreds of processors on two parallel machines have showed that these two algorithms are efficient and can be generalized to other multiphysics parallel numerical simulations. In especial, algorithm TLTC is linearly scalable and has achieved the optimal parallel performance. (authors)

Vertex ring-indexed Lie algebras

International Nuclear Information System (INIS)

Fairlie, David; Zachos, Cosmas

2005-01-01

Infinite-dimensional Lie algebras are introduced, which are only partially graded, and are specified by indices lying on cyclotomic rings. They may be thought of as generalizations of the Onsager algebra, but unlike it, or its sl(n) generalizations, they are not subalgebras of the loop algebras associated with sl(n). In a particular interesting case associated with sl(3), their indices lie on the Eisenstein integer triangular lattice, and these algebras are expected to underlie vertex operator combinations in CFT, brane physics, and graphite monolayers

Exploring Shared-Memory Optimizations for an Unstructured Mesh CFD Application on Modern Parallel Systems

KAUST Repository

Mudigere, Dheevatsa; Sridharan, Srinivas; Deshpande, Anand; Park, Jongsoo; Heinecke, Alexander; Smelyanskiy, Mikhail; Kaul, Bharat; Dubey, Pradeep; Kaushik, Dinesh; Keyes, David E.

2015-01-01

-grid implicit flow solver, which forms the backbone of computational aerodynamics, poses particular challenges due to its large irregular working sets, unstructured memory accesses, and variable/limited amount of parallelism. This code, based on a domain

Interior point algorithm-based power flow optimisation of a combined AC and DC multi-terminal grid

Directory of Open Access Journals (Sweden)

Farhan Beg

2015-01-01

Full Text Available The high cost of power electronic equipment, lower reliability and poor power handling capacity of the semiconductor devices had stalled the deployment of systems based on DC (multi-terminal direct current system (MTDC networks. The introduction of voltage source converters (VSCs for transmission has renewed the interest in the development of large interconnected grids based on both alternate current (AC and DC transmission networks. Such a grid platform also realises the added advantage of integrating the renewable energy sources into the grid. Thus a grid based on DC MTDC network is a possible solution to improve energy security and check the increasing supply demand gap. An optimal power solution for combined AC and DC grids obtained by the solution of the interior point algorithm is proposed in this study. Multi-terminal HVDC grids lie at the heart of various suggested transmission capacity increases. A significant difference is observed when MTDC grids are solved for power flows in place of conventional AC grids. This study deals with the power flow problem of a combined MTDC and an AC grid. The AC side is modelled with the full power flow equations and the VSCs are modelled using a connecting line, two generators and an AC node. The VSC and the DC losses are also considered. The optimisation focuses on several different goals. Three different scenarios are presented in an arbitrary grid network with ten AC nodes and five converter stations.

Classification of simple flexible Lie-admissible algebras

International Nuclear Information System (INIS)

Okubo, S.; Myung, H.C.

1979-01-01

Let A be a finite-dimensional flexible Lie-admissible algebra over the complex field such that A - is a simple Lie algebra. It is shown that either A is itself a Lie algebra isomorphic to A - or A - is a Lie algebra of type A/sub n/ (n greater than or equal to 2). In the latter case, A is isomorphic to the algebra defined on the space of (n + 1) x (n + 1) traceless matrices with multiplication given by x * y = μxy + (1 - μ)yx - (1/(n + 100 Tr (xy) E where μ is a fixed scalar, xy denotes the matrix operators in Lie algebras which has been studied in theoretical physics. We also discuss a broader class of Lie algebras over arbitrary field of characteristic not equal to 2, called quasi-classical, which includes semisimple as well as reductive Lie algebras. For this class of Lie algebras, we can introduce a multiplication which makes the adjoint operator space into an associative algebra. When L is a Lie algebra with nondegenerate killing form, it is shown that the adjoint operator algebra of L in the adjoint representation becomes a commutative associative algebra with unit element and its dimension is 1 or 2 if L is simple over the complex field. This is related to the known result that a Lie algebra of type A/sub n/ (n greater than or equal to 2) alone has a nonzero completely symmetric adjoint operator in the adjoint representation while all other algebras have none. Finally, Lie-admissible algebras associated with bilinear form are investigated

Continuum analogues of contragredient Lie algebras

International Nuclear Information System (INIS)

Saveliev, M.V.; Vershik, A.M.

1989-03-01

We present an axiomatic formulation of a new class of infinite-dimensional Lie algebras - the generalizations of Z-graded Lie algebras with, generally speaking, an infinite-dimensional Cartan subalgebra and a contiguous set of roots. We call such algebras ''continuum Lie algebras''. The simple Lie algebras of constant growth are encapsulated in our formulation. We pay particular attention to the case when the local algebra is parametrized by a commutative algebra while the Cartan operator (the generalization of the Cartan matrix) is a linear operator. Special examples of these algebras are the Kac-Moody algebras, algebras of Poisson brackets, algebras of vector fields on a manifold, current algebras, and algebras with differential or integro-differential Cartan operator. The nonlinear dynamical systems associated with the continuum contragredient Lie algebras are also considered. (author). 9 refs

Parallel computing solution of Boltzmann neutron transport equation

International Nuclear Information System (INIS)

Ansah-Narh, T.

2010-01-01

The focus of the research was on developing parallel computing algorithm for solving Eigen-values of the Boltzmam Neutron Transport Equation (BNTE) in a slab geometry using multi-grid approach. In response to the problem of slow execution of serial computing when solving large problems, such as BNTE, the study was focused on the design of parallel computing systems which was an evolution of serial computing that used multiple processing elements simultaneously to solve complex physical and mathematical problems. Finite element method (FEM) was used for the spatial discretization scheme, while angular discretization was accomplished by expanding the angular dependence in terms of Legendre polynomials. The eigenvalues representing the multiplication factors in the BNTE were determined by the power method. MATLAB Compiler Version 4.1 (R2009a) was used to compile the MATLAB codes of BNTE. The implemented parallel algorithms were enabled with matlabpool, a Parallel Computing Toolbox function. The option UseParallel was set to 'always' and the default value of the option was 'never'. When those conditions held, the solvers computed estimated gradients in parallel. The parallel computing system was used to handle all the bottlenecks in the matrix generated from the finite element scheme and each domain of the power method generated. The parallel algorithm was implemented on a Symmetric Multi Processor (SMP) cluster machine, which had Intel 32 bit quad-core x 86 processors. Convergence rates and timings for the algorithm on the SMP cluster machine were obtained. Numerical experiments indicated the designed parallel algorithm could reach perfect speedup and had good stability and scalability. (au)

Lying in neuropsychology.

Science.gov (United States)

Seron, X

2014-10-01

The issue of lying occurs in neuropsychology especially when examinations are conducted in a forensic context. When a subject intentionally either presents non-existent deficits or exaggerates their severity to obtain financial or material compensation, this behaviour is termed malingering. Malingering is discussed in the general framework of lying in psychology, and the different procedures used by neuropsychologists to evidence a lack of collaboration at examination are briefly presented and discussed. When a lack of collaboration is observed, specific emphasis is placed on the difficulty in unambiguously establishing that this results from the patient's voluntary decision. Copyright © 2014. Published by Elsevier SAS.

De Novo Ultrascale Atomistic Simulations On High-End Parallel Supercomputers

Energy Technology Data Exchange (ETDEWEB)

Nakano, A; Kalia, R K; Nomura, K; Sharma, A; Vashishta, P; Shimojo, F; van Duin, A; Goddard, III, W A; Biswas, R; Srivastava, D; Yang, L H

2006-09-04

We present a de novo hierarchical simulation framework for first-principles based predictive simulations of materials and their validation on high-end parallel supercomputers and geographically distributed clusters. In this framework, high-end chemically reactive and non-reactive molecular dynamics (MD) simulations explore a wide solution space to discover microscopic mechanisms that govern macroscopic material properties, into which highly accurate quantum mechanical (QM) simulations are embedded to validate the discovered mechanisms and quantify the uncertainty of the solution. The framework includes an embedded divide-and-conquer (EDC) algorithmic framework for the design of linear-scaling simulation algorithms with minimal bandwidth complexity and tight error control. The EDC framework also enables adaptive hierarchical simulation with automated model transitioning assisted by graph-based event tracking. A tunable hierarchical cellular decomposition parallelization framework then maps the O(N) EDC algorithms onto Petaflops computers, while achieving performance tunability through a hierarchy of parameterized cell data/computation structures, as well as its implementation using hybrid Grid remote procedure call + message passing + threads programming. High-end computing platforms such as IBM BlueGene/L, SGI Altix 3000 and the NSF TeraGrid provide an excellent test grounds for the framework. On these platforms, we have achieved unprecedented scales of quantum-mechanically accurate and well validated, chemically reactive atomistic simulations--1.06 billion-atom fast reactive force-field MD and 11.8 million-atom (1.04 trillion grid points) quantum-mechanical MD in the framework of the EDC density functional theory on adaptive multigrids--in addition to 134 billion-atom non-reactive space-time multiresolution MD, with the parallel efficiency as high as 0.998 on 65,536 dual-processor BlueGene/L nodes. We have also achieved an automated execution of hierarchical QM

Finite Volume Methods for Incompressible Navier-Stokes Equations on Collocated Grids with Nonconformal Interfaces

DEFF Research Database (Denmark)

Kolmogorov, Dmitry

turbine computations, collocated grid-based SIMPLE-like algorithms are developed for computations on block-structured grids with nonconformal interfaces. A technique to enhance both the convergence speed and the solution accuracy of the SIMPLE-like algorithms is presented. The erroneous behavior, which...... versions of the SIMPLE algorithm. The new technique is implemented in an existing conservative 2nd order finite-volume scheme flow solver (EllipSys), which is extended to cope with grids with nonconformal interfaces. The behavior of the discrete Navier-Stokes equations is discussed in detail...... Block LU relaxation scheme is shown to possess several optimal conditions, which enables to preserve high efficiency of the multigrid solver on both conformal and nonconformal grids. The developments are done using a parallel MPI algorithm, which can handle multiple numbers of interfaces with multiple...

The First Honest Book about Lies.

Science.gov (United States)

Kincher, Jonni; Espeland, Pamela, Ed.

Readers learn how to discern the truth from lies through a series of activities, games, and experiments. This book invites young students to look at lies in a fair and balanced way. Different types of lies are examined and the purposes they serve and discussed. Problem solving activities are given. The book is organized in nine chapters,…

Dynamic parallel ROOT facility clusters on the Alice Environment

International Nuclear Information System (INIS)

Luzzi, C; Betev, L; Carminati, F; Grigoras, C; Saiz, P; Manafov, A

2012-01-01

The ALICE collaboration has developed a production environment (AliEn) that implements the full set of the Grid tools enabling the full offline computational work-flow of the experiment, simulation, reconstruction and data analysis, in a distributed and heterogeneous computing environment. In addition to the analysis on the Grid, ALICE uses a set of local interactive analysis facilities installed with the Parallel ROOT Facility (PROOF). PROOF enables physicists to analyze medium-sized (order of 200-300 TB) data sets on a short time scale. The default installation of PROOF is on a static dedicated cluster, typically 200-300 cores. This well-proven approach, has its limitations, more specifically for analysis of larger datasets or when the installation of a dedicated cluster is not possible. Using a new framework called PoD (Proof on Demand), PROOF can be used directly on Grid-enabled clusters, by dynamically assigning interactive nodes on user request. The integration of Proof on Demand in the AliEn framework provides private dynamic PROOF clusters as a Grid service. This functionality is transparent to the user who will submit interactive jobs to the AliEn system.

Implementation of grid-connected to/from off-grid transference for micro-grid inverters

OpenAIRE

Heredero Peris, Daniel; Chillón Antón, Cristian; Pages Gimenez, Marc; Gross, Gabriel Igor; Montesinos Miracle, Daniel

2013-01-01

This paper presents the transfer of a microgrid converter from/to on-grid to/from off-grid when the converter is working in two different modes. In the first transfer presented method, the converter operates as a Current Source Inverter (CSI) when on-grid and as a Voltage Source Inverter (VSI) when off-grid. In the second transfer method, the converter is operated as a VSI both, when operated on-grid and off-grid. The two methods are implemented successfully in a real pla...

I/O Parallelization for the Goddard Earth Observing System Data Assimilation System (GEOS DAS)

Science.gov (United States)

Lucchesi, Rob; Sawyer, W.; Takacs, L. L.; Lyster, P.; Zero, J.

1998-01-01

The National Aeronautics and Space Administration (NASA) Data Assimilation Office (DAO) at the Goddard Space Flight Center (GSFC) has developed the GEOS DAS, a data assimilation system that provides production support for NASA missions and will support NASA's Earth Observing System (EOS) in the coming years. The GEOS DAS will be used to provide background fields of meteorological quantities to EOS satellite instrument teams for use in their data algorithms as well as providing assimilated data sets for climate studies on decadal time scales. The DAO has been involved in prototyping parallel implementations of the GEOS DAS for a number of years and is now embarking on an effort to convert the production version from shared-memory parallelism to distributed-memory parallelism using the portable Message-Passing Interface (MPI). The GEOS DAS consists of two main components, an atmospheric General Circulation Model (GCM) and a Physical-space Statistical Analysis System (PSAS). The GCM operates on data that are stored on a regular grid while PSAS works with observational data that are scattered irregularly throughout the atmosphere. As a result, the two components have different data decompositions. The GCM is decomposed horizontally as a checkerboard with all vertical levels of each box existing on the same processing element(PE). The dynamical core of the GCM can also operate on a rotated grid, which requires communication-intensive grid transformations during GCM integration. PSAS groups observations on PEs in a more irregular and dynamic fashion.

On Deformations and Contractions of Lie Algebras

Directory of Open Access Journals (Sweden)

Marc de Montigny

2006-05-01

Full Text Available In this contributed presentation, we discuss and compare the mutually opposite procedures of deformations and contractions of Lie algebras. We suggest that with appropriate combinations of both procedures one may construct new Lie algebras. We first discuss low-dimensional Lie algebras and illustrate thereby that whereas for every contraction there exists a reverse deformation, the converse is not true in general. Also we note that some Lie algebras belonging to parameterized families are singled out by the irreversibility of deformations and contractions. After reminding that global deformations of the Witt, Virasoro, and affine Kac-Moody algebras allow one to retrieve Lie algebras of Krichever-Novikov type, we contract the latter to find new infinite dimensional Lie algebras.

''A Parallel Adaptive Simulation Tool for Two Phase Steady State Reacting Flows in Industrial Boilers and Furnaces''; FINAL

International Nuclear Information System (INIS)

Michael J. Bockelie

2002-01-01

; -mesh adaption, data management, and parallelization software and technology being developed by users of the BoxLib library at LBNL; and -solution methods for problems formulated on block structured grids that were being developed in collaboration with technical staff members at the University of Utah Center for High Performance Computing (CHPC) and at LBNL. The combustion modeling software used by Reaction Engineering International represents an investment of over fifty man-years of development, conducted over a period of twenty years. Thus, it was impractical to achieve our objective by starting from scratch. The research program resulted in an adaptive grid, reacting CFD flow solver that can be used only on limited problems. In current form the code is appropriate for use on academic problems with simplified geometries. The new solver is not sufficiently robust or sufficiently general to be used in a ''production mode'' for industrial applications. The principle difficulty lies with the multi-level solver technology. The use of multi-level solvers on adaptive grids with embedded boundaries is not yet a mature field and there are many issues that remain to be resolved. From the lessons learned in this SBIR program, we have started work on a new flow solver with an AMR capability. The new code is based on a conventional cell-by-cell mesh refinement strategy used in unstructured grid solvers that employ hexahedral cells. The new solver employs several of the concepts and solution strategies developed within this research program. The formulation of the composite grid problem for the new solver has been designed to avoid the embedded boundary complications encountered in this SBIR project. This follow-on effort will result in a reacting flow CFD solver with localized mesh capability that can be used to perform engineering calculations on industrial problems in a production mode

Lagrangian submanifolds and dynamics on Lie algebroids

International Nuclear Information System (INIS)

Leon, Manuel de; Marrero, Juan C; MartInez, Eduardo

2005-01-01

In some previous papers, a geometric description of Lagrangian mechanics on Lie algebroids has been developed. In this topical review, we give a Hamiltonian description of mechanics on Lie algebroids. In addition, we introduce the notion of a Lagrangian submanifold of a symplectic Lie algebroid and we prove that the Lagrangian (Hamiltonian) dynamics on Lie algebroids may be described in terms of Lagrangian submanifolds of symplectic Lie algebroids. The Lagrangian (Hamiltonian) formalism on Lie algebroids permits us to deal with Lagrangian (Hamiltonian) functions not defined necessarily on tangent (cotangent) bundles. Thus, we may apply our results to the projection of Lagrangian (Hamiltonian) functions which are invariant under the action of a symmetry Lie group. As a consequence, we obtain that Lagrange-Poincare (Hamilton-Poincare) equations are the Euler-Lagrange (Hamilton) equations associated with the corresponding Atiyah algebroid. Moreover, we prove that Lagrange-Poincare (Hamilton-Poincare) equations are the local equations defining certain Lagrangian submanifolds of symplectic Atiyah algebroids. (topical review)

Correction of Beam Distortion in Negative Hydrogen Ion Source with Multi-Slot Grounded Grid

International Nuclear Information System (INIS)

Tsumori, Katsuyoshi; Kaneko, Osamu; Takeiri, Yasuhiko; Oka, Yoshihide; Osakabe, Masaki; Ikeda, Katsunori; Nagaoka, Kenichi; Kawamoto, Toshikazu; Asano, Eiji; Sato, Mamoru; Kondo, Tomoki; Watanabe, Junko; Asano, Shiro; Suzuki, Yasuo

2005-01-01

The new beam accelerator with multi-slot grounded grid (MSGG) has been developed to increase the port-through power into large helical device (LHD). Using the accelerator, the maximum power of 5.7 MW was achieved at the beam energy of 186 keV in the beam injection to LHD plasma last year. Although the port-through power increased compared with conventional accelerators with multi-hole grounded grid (MHGG), the accelerator with the MSGG includes a disadvantage of bi-focal condition in parallel and perpendicular direction to the long side of the slots. When the beam width in one of those directions gets narrower, the width in another direction becomes wider. This disadvantage includes the loss of beam port-through power and induces internal damages in neutral beam line. In order to reduce the disadvantage, an experiment has been done using a small-scaled negative ion source with racetrack-shaped apertures for the steering grid installed at beam upstream of the MSGG. By applying the racetrack apertures to the accelerator, it is observed that the beam widths in the parallel and perpendicular directions to the slot long side have almost the same focal condition to obtain minimal beam widths

Scalability of Parallel Scientific Applications on the Cloud

Directory of Open Access Journals (Sweden)

Satish Narayana Srirama

2011-01-01

Full Text Available Cloud computing, with its promise of virtually infinite resources, seems to suit well in solving resource greedy scientific computing problems. To study the effects of moving parallel scientific applications onto the cloud, we deployed several benchmark applications like matrix–vector operations and NAS parallel benchmarks, and DOUG (Domain decomposition On Unstructured Grids on the cloud. DOUG is an open source software package for parallel iterative solution of very large sparse systems of linear equations. The detailed analysis of DOUG on the cloud showed that parallel applications benefit a lot and scale reasonable on the cloud. We could also observe the limitations of the cloud and its comparison with cluster in terms of performance. However, for efficiently running the scientific applications on the cloud infrastructure, the applications must be reduced to frameworks that can successfully exploit the cloud resources, like the MapReduce framework. Several iterative and embarrassingly parallel algorithms are reduced to the MapReduce model and their performance is measured and analyzed. The analysis showed that Hadoop MapReduce has significant problems with iterative methods, while it suits well for embarrassingly parallel algorithms. Scientific computing often uses iterative methods to solve large problems. Thus, for scientific computing on the cloud, this paper raises the necessity for better frameworks or optimizations for MapReduce.

Simulation of ozone production in a complex circulation region using nested grids

Science.gov (United States)

Taghavi, M.; Cautenet, S.; Foret, G.

2004-06-01

During the ESCOMPTE precampaign (summer 2000, over Southern France), a 3-day period of intensive observation (IOP0), associated with ozone peaks, has been simulated. The comprehensive RAMS model, version 4.3, coupled on-line with a chemical module including 29 species, is used to follow the chemistry of the polluted zone. This efficient but time consuming method can be used because the code is installed on a parallel computer, the SGI 3800. Two runs are performed: run 1 with a single grid and run 2 with two nested grids. The simulated fields of ozone, carbon monoxide, nitrogen oxides and sulfur dioxide are compared with aircraft and surface station measurements. The 2-grid run looks substantially better than the run with one grid because the former takes the outer pollutants into account. This on-line method helps to satisfactorily retrieve the chemical species redistribution and to explain the impact of dynamics on this redistribution.

Simulation of ozone production in a complex circulation region using nested grids

Directory of Open Access Journals (Sweden)

M. Taghavi

2004-01-01

Full Text Available During the ESCOMPTE precampaign (summer 2000, over Southern France, a 3-day period of intensive observation (IOP0, associated with ozone peaks, has been simulated. The comprehensive RAMS model, version 4.3, coupled on-line with a chemical module including 29 species, is used to follow the chemistry of the polluted zone. This efficient but time consuming method can be used because the code is installed on a parallel computer, the SGI 3800. Two runs are performed: run 1 with a single grid and run 2 with two nested grids. The simulated fields of ozone, carbon monoxide, nitrogen oxides and sulfur dioxide are compared with aircraft and surface station measurements. The 2-grid run looks substantially better than the run with one grid because the former takes the outer pollutants into account. This on-line method helps to satisfactorily retrieve the chemical species redistribution and to explain the impact of dynamics on this redistribution.

Precise Modeling Based on Dynamic Phasors for Droop-Controlled Parallel-Connected Inverters

DEFF Research Database (Denmark)

Wang, L.; Guo, X.Q.; Gu, H.R.

2012-01-01

This paper deals with the precise modeling of droop controlled parallel inverters. This is very attractive since that is a common structure that can be found in a stand-alone droopcontrolled MicroGrid. The conventional small-signal dynamic is not able to predict instabilities of the system, so...

Smart grid

International Nuclear Information System (INIS)

Choi, Dong Bae

2001-11-01

This book describes press smart grid from basics to recent trend. It is divided into ten chapters, which deals with smart grid as green revolution in energy with introduction, history, the fields, application and needed technique for smart grid, Trend of smart grid in foreign such as a model business of smart grid in foreign, policy for smart grid in U.S.A, Trend of smart grid in domestic with international standard of smart grid and strategy and rood map, smart power grid as infrastructure of smart business with EMS development, SAS, SCADA, DAS and PQMS, smart grid for smart consumer, smart renewable like Desertec project, convergence IT with network and PLC, application of an electric car, smart electro service for realtime of electrical pricing system, arrangement of smart grid.

Large-scale visualization system for grid environment

International Nuclear Information System (INIS)

Suzuki, Yoshio

2007-01-01

Center for Computational Science and E-systems of Japan Atomic Energy Agency (CCSE/JAEA) has been conducting R and Ds of distributed computing (grid computing) environments: Seamless Thinking Aid (STA), Information Technology Based Laboratory (ITBL) and Atomic Energy Grid InfraStructure (AEGIS). In these R and Ds, we have developed the visualization technology suitable for the distributed computing environment. As one of the visualization tools, we have developed the Parallel Support Toolkit (PST) which can execute the visualization process parallely on a computer. Now, we improve PST to be executable simultaneously on multiple heterogeneous computers using Seamless Thinking Aid Message Passing Interface (STAMPI). STAMPI, we have developed in these R and Ds, is the MPI library executable on a heterogeneous computing environment. The improvement realizes the visualization of extremely large-scale data and enables more efficient visualization processes in a distributed computing environment. (author)

Application of parallel computing techniques to a large-scale reservoir simulation

International Nuclear Information System (INIS)

Zhang, Keni; Wu, Yu-Shu; Ding, Chris; Pruess, Karsten

2001-01-01

Even with the continual advances made in both computational algorithms and computer hardware used in reservoir modeling studies, large-scale simulation of fluid and heat flow in heterogeneous reservoirs remains a challenge. The problem commonly arises from intensive computational requirement for detailed modeling investigations of real-world reservoirs. This paper presents the application of a massive parallel-computing version of the TOUGH2 code developed for performing large-scale field simulations. As an application example, the parallelized TOUGH2 code is applied to develop a three-dimensional unsaturated-zone numerical model simulating flow of moisture, gas, and heat in the unsaturated zone of Yucca Mountain, Nevada, a potential repository for high-level radioactive waste. The modeling approach employs refined spatial discretization to represent the heterogeneous fractured tuffs of the system, using more than a million 3-D gridblocks. The problem of two-phase flow and heat transfer within the model domain leads to a total of 3,226,566 linear equations to be solved per Newton iteration. The simulation is conducted on a Cray T3E-900, a distributed-memory massively parallel computer. Simulation results indicate that the parallel computing technique, as implemented in the TOUGH2 code, is very efficient. The reliability and accuracy of the model results have been demonstrated by comparing them to those of small-scale (coarse-grid) models. These comparisons show that simulation results obtained with the refined grid provide more detailed predictions of the future flow conditions at the site, aiding in the assessment of proposed repository performance

High performance parallel computing of flows in complex geometries: I. Methods

International Nuclear Information System (INIS)

Gourdain, N; Gicquel, L; Montagnac, M; Vermorel, O; Staffelbach, G; Garcia, M; Boussuge, J-F; Gazaix, M; Poinsot, T

2009-01-01

Efficient numerical tools coupled with high-performance computers, have become a key element of the design process in the fields of energy supply and transportation. However flow phenomena that occur in complex systems such as gas turbines and aircrafts are still not understood mainly because of the models that are needed. In fact, most computational fluid dynamics (CFD) predictions as found today in industry focus on a reduced or simplified version of the real system (such as a periodic sector) and are usually solved with a steady-state assumption. This paper shows how to overcome such barriers and how such a new challenge can be addressed by developing flow solvers running on high-end computing platforms, using thousands of computing cores. Parallel strategies used by modern flow solvers are discussed with particular emphases on mesh-partitioning, load balancing and communication. Two examples are used to illustrate these concepts: a multi-block structured code and an unstructured code. Parallel computing strategies used with both flow solvers are detailed and compared. This comparison indicates that mesh-partitioning and load balancing are more straightforward with unstructured grids than with multi-block structured meshes. However, the mesh-partitioning stage can be challenging for unstructured grids, mainly due to memory limitations of the newly developed massively parallel architectures. Finally, detailed investigations show that the impact of mesh-partitioning on the numerical CFD solutions, due to rounding errors and block splitting, may be of importance and should be accurately addressed before qualifying massively parallel CFD tools for a routine industrial use.

GridCom, Grid Commander: graphical interface for Grid jobs and data management

International Nuclear Information System (INIS)

Galaktionov, V.V.

2011-01-01

GridCom - the software package for maintenance of automation of access to means of distributed system Grid (jobs and data). The client part, executed in the form of Java-applets, realises the Web-interface access to Grid through standard browsers. The executive part Lexor (LCG Executor) is started by the user in UI (User Interface) machine providing performance of Grid operations

Pro-Lie Groups: A Survey with Open Problems

Directory of Open Access Journals (Sweden)

Karl H. Hofmann

2015-07-01

Full Text Available A topological group is called a pro-Lie group if it is isomorphic to a closed subgroup of a product of finite-dimensional real Lie groups. This class of groups is closed under the formation of arbitrary products and closed subgroups and forms a complete category. It includes each finite-dimensional Lie group, each locally-compact group that has a compact quotient group modulo its identity component and, thus, in particular, each compact and each connected locally-compact group; it also includes all locally-compact Abelian groups. This paper provides an overview of the structure theory and the Lie theory of pro-Lie groups, including results more recent than those in the authors’ reference book on pro-Lie groups. Significantly, it also includes a review of the recent insight that weakly-complete unital algebras provide a natural habitat for both pro-Lie algebras and pro-Lie groups, indeed for the exponential function that links the two. (A topological vector space is weakly complete if it is isomorphic to a power RX of an arbitrary set of copies of R. This class of real vector spaces is at the basis of the Lie theory of pro-Lie groups. The article also lists 12 open questions connected to pro-Lie groups.

Particle-like structure of coaxial Lie algebras

Science.gov (United States)

Vinogradov, A. M.

2018-01-01

This paper is a natural continuation of Vinogradov [J. Math. Phys. 58, 071703 (2017)] where we proved that any Lie algebra over an algebraically closed field or over R can be assembled in a number of steps from two elementary constituents, called dyons and triadons. Here we consider the problems of the construction and classification of those Lie algebras which can be assembled in one step from base dyons and triadons, called coaxial Lie algebras. The base dyons and triadons are Lie algebra structures that have only one non-trivial structure constant in a given basis, while coaxial Lie algebras are linear combinations of pairwise compatible base dyons and triadons. We describe the maximal families of pairwise compatible base dyons and triadons called clusters, and, as a consequence, we give a complete description of the coaxial Lie algebras. The remarkable fact is that dyons and triadons in clusters are self-organised in structural groups which are surrounded by casings and linked by connectives. We discuss generalisations and applications to the theory of deformations of Lie algebras.

Icing modelling in NSMB with chimera overset grids

Energy Technology Data Exchange (ETDEWEB)

Pena, D. [Ècole Polytechnique de Montréal (Canada); ICUBE, Strasbourg University (France); Deloze, T.; Laurendeau, E. [Ècole Polytechnique de Montréal (Canada); Hoarau, Y. [ICUBE, Strasbourg University (France)

2015-03-10

In aerospace Engineering, the accurate simulation of ice accretion is a key element to increase flight safety and avoid accidents related to icing effects. The icing code developed in the NSMB solver is based on an Eulerian formulation for droplets tracking, an iterative Messinger model using a modified water runback scheme for ice thickness calculation and mesh deformation to track the ice/air interface through time. The whole process is parallelized with MPI and applied with chimera grids.

Parallelization of pressure equation solver for incompressible N-S equations

International Nuclear Information System (INIS)

Ichihara, Kiyoshi; Yokokawa, Mitsuo; Kaburaki, Hideo.

1996-03-01

A pressure equation solver in a code for 3-dimensional incompressible flow analysis has been parallelized by using red-black SOR method and PCG method on Fujitsu VPP500, a vector parallel computer with distributed memory. For the comparison of scalability, the solver using the red-black SOR method has been also parallelized on the Intel Paragon, a scalar parallel computer with a distributed memory. The scalability of the red-black SOR method on both VPP500 and Paragon was lost, when number of processor elements was increased. The reason of non-scalability on both systems is increasing communication time between processor elements. In addition, the parallelization by DO-loop division makes the vectorizing efficiency lower on VPP500. For an effective implementation on VPP500, a large scale problem which holds very long vectorized DO-loops in the parallel program should be solved. PCG method with red-black SOR method applied to incomplete LU factorization (red-black PCG) has more iteration steps than normal PCG method with forward and backward substitution, in spite of same number of the floating point operations in a DO-loop of incomplete LU factorization. The parallelized red-black PCG method has less merits than the parallelized red-black SOR method when the computational region has fewer grids, because the low vectorization efficiency is obtained in red-black PCG method. (author)

Implementation of Parallel Dynamic Simulation on Shared-Memory vs. Distributed-Memory Environments

Energy Technology Data Exchange (ETDEWEB)

Jin, Shuangshuang; Chen, Yousu; Wu, Di; Diao, Ruisheng; Huang, Zhenyu

2015-12-09

Power system dynamic simulation computes the system response to a sequence of large disturbance, such as sudden changes in generation or load, or a network short circuit followed by protective branch switching operation. It consists of a large set of differential and algebraic equations, which is computational intensive and challenging to solve using single-processor based dynamic simulation solution. High-performance computing (HPC) based parallel computing is a very promising technology to speed up the computation and facilitate the simulation process. This paper presents two different parallel implementations of power grid dynamic simulation using Open Multi-processing (OpenMP) on shared-memory platform, and Message Passing Interface (MPI) on distributed-memory clusters, respectively. The difference of the parallel simulation algorithms and architectures of the two HPC technologies are illustrated, and their performances for running parallel dynamic simulation are compared and demonstrated.

A CFD Heterogeneous Parallel Solver Based on Collaborating CPU and GPU

Science.gov (United States)

Lai, Jianqi; Tian, Zhengyu; Li, Hua; Pan, Sha

2018-03-01

Since Graphic Processing Unit (GPU) has a strong ability of floating-point computation and memory bandwidth for data parallelism, it has been widely used in the areas of common computing such as molecular dynamics (MD), computational fluid dynamics (CFD) and so on. The emergence of compute unified device architecture (CUDA), which reduces the complexity of compiling program, brings the great opportunities to CFD. There are three different modes for parallel solution of NS equations: parallel solver based on CPU, parallel solver based on GPU and heterogeneous parallel solver based on collaborating CPU and GPU. As we can see, GPUs are relatively rich in compute capacity but poor in memory capacity and the CPUs do the opposite. We need to make full use of the GPUs and CPUs, so a CFD heterogeneous parallel solver based on collaborating CPU and GPU has been established. Three cases are presented to analyse the solver’s computational accuracy and heterogeneous parallel efficiency. The numerical results agree well with experiment results, which demonstrate that the heterogeneous parallel solver has high computational precision. The speedup on a single GPU is more than 40 for laminar flow, it decreases for turbulent flow, but it still can reach more than 20. What’s more, the speedup increases as the grid size becomes larger.

Enabling Campus Grids with Open Science Grid Technology

International Nuclear Information System (INIS)

Weitzel, Derek; Fraser, Dan; Pordes, Ruth; Bockelman, Brian; Swanson, David

2011-01-01

The Open Science Grid is a recognized key component of the US national cyber-infrastructure enabling scientific discovery through advanced high throughput computing. The principles and techniques that underlie the Open Science Grid can also be applied to Campus Grids since many of the requirements are the same, even if the implementation technologies differ. We find five requirements for a campus grid: trust relationships, job submission, resource independence, accounting, and data management. The Holland Computing Center's campus grid at the University of Nebraska-Lincoln was designed to fulfill the requirements of a campus grid. A bridging daemon was designed to bring non-Condor clusters into a grid managed by Condor. Condor features which make it possible to bridge Condor sites into a multi-campus grid have been exploited at the Holland Computing Center as well.

Perspectives in Lie theory

CERN Document Server

Carnovale, Giovanna; Caselli, Fabrizio; Concini, Corrado; Sole, Alberto

2017-01-01

Lie theory is a mathematical framework for encoding the concept of symmetries of a problem, and was the central theme of an INdAM intensive research period at the Centro de Giorgi in Pisa, Italy, in the academic year 2014-2015. This book gathers the key outcomes of this period, addressing topics such as: structure and representation theory of vertex algebras, Lie algebras and superalgebras, as well as hyperplane arrangements with different approaches, ranging from geometry and topology to combinatorics.

CMS Monte Carlo production in the WLCG computing grid

International Nuclear Information System (INIS)

Hernandez, J M; Kreuzer, P; Hof, C; Khomitch, A; Mohapatra, A; Filippis, N D; Pompili, A; My, S; Abbrescia, M; Maggi, G; Donvito, G; Weirdt, S D; Maes, J; Mulders, P v; Villella, I; Wakefield, S; Guan, W; Fanfani, A; Evans, D; Flossdorf, A

2008-01-01

Monte Carlo production in CMS has received a major boost in performance and scale since the past CHEP06 conference. The production system has been re-engineered in order to incorporate the experience gained in running the previous system and to integrate production with the new CMS event data model, data management system and data processing framework. The system is interfaced to the two major computing Grids used by CMS, the LHC Computing Grid (LCG) and the Open Science Grid (OSG). Operational experience and integration aspects of the new CMS Monte Carlo production system is presented together with an analysis of production statistics. The new system automatically handles job submission, resource monitoring, job queuing, job distribution according to the available resources, data merging, registration of data into the data bookkeeping, data location, data transfer and placement systems. Compared to the previous production system automation, reliability and performance have been considerably improved. A more efficient use of computing resources and a better handling of the inherent Grid unreliability have resulted in an increase of production scale by about an order of magnitude, capable of running in parallel at the order of ten thousand jobs and yielding more than two million events per day

Assessment of grid optimisation measures for the German transmission grid using open source grid data

Science.gov (United States)

Böing, F.; Murmann, A.; Pellinger, C.; Bruckmeier, A.; Kern, T.; Mongin, T.

2018-02-01

The expansion of capacities in the German transmission grid is a necessity for further integration of renewable energy sources into the electricity sector. In this paper, the grid optimisation measures ‘Overhead Line Monitoring’, ‘Power-to-Heat’ and ‘Demand Response in the Industry’ are evaluated and compared against conventional grid expansion for the year 2030. Initially, the methodical approach of the simulation model is presented and detailed descriptions of the grid model and the used grid data, which partly originates from open-source platforms, are provided. Further, this paper explains how ‘Curtailment’ and ‘Redispatch’ can be reduced by implementing grid optimisation measures and how the depreciation of economic costs can be determined considering construction costs. The developed simulations show that the conventional grid expansion is more efficient and implies more grid relieving effects than the evaluated grid optimisation measures.

Enabling campus grids with open science grid technology

Energy Technology Data Exchange (ETDEWEB)

Weitzel, Derek [Nebraska U.; Bockelman, Brian [Nebraska U.; Swanson, David [Nebraska U.; Fraser, Dan [Argonne; Pordes, Ruth [Fermilab

2011-01-01

The Open Science Grid is a recognized key component of the US national cyber-infrastructure enabling scientific discovery through advanced high throughput computing. The principles and techniques that underlie the Open Science Grid can also be applied to Campus Grids since many of the requirements are the same, even if the implementation technologies differ. We find five requirements for a campus grid: trust relationships, job submission, resource independence, accounting, and data management. The Holland Computing Center's campus grid at the University of Nebraska-Lincoln was designed to fulfill the requirements of a campus grid. A bridging daemon was designed to bring non-Condor clusters into a grid managed by Condor. Condor features which make it possible to bridge Condor sites into a multi-campus grid have been exploited at the Holland Computing Center as well.

Velocity field calculation for non-orthogonal numerical grids

Energy Technology Data Exchange (ETDEWEB)

Flach, G. P. [Savannah River Site (SRS), Aiken, SC (United States). Savannah River National Lab. (SRNL)

2015-03-01

Computational grids containing cell faces that do not align with an orthogonal (e.g. Cartesian, cylindrical) coordinate system are routinely encountered in porous-medium numerical simulations. Such grids are referred to in this study as non-orthogonal grids because some cell faces are not orthogonal to a coordinate system plane (e.g. xy, yz or xz plane in Cartesian coordinates). Non-orthogonal grids are routinely encountered at the Savannah River Site in porous-medium flow simulations for Performance Assessments and groundwater flow modeling. Examples include grid lines that conform to the sloping roof of a waste tank or disposal unit in a 2D Performance Assessment simulation, and grid surfaces that conform to undulating stratigraphic surfaces in a 3D groundwater flow model. Particle tracking is routinely performed after a porous-medium numerical flow simulation to better understand the dynamics of the flow field and/or as an approximate indication of the trajectory and timing of advective solute transport. Particle tracks are computed by integrating the velocity field from cell to cell starting from designated seed (starting) positions. An accurate velocity field is required to attain accurate particle tracks. However, many numerical simulation codes report only the volumetric flowrate (e.g. PORFLOW) and/or flux (flowrate divided by area) crossing cell faces. For an orthogonal grid, the normal flux at a cell face is a component of the Darcy velocity vector in the coordinate system, and the pore velocity for particle tracking is attained by dividing by water content. For a non-orthogonal grid, the flux normal to a cell face that lies outside a coordinate plane is not a true component of velocity with respect to the coordinate system. Nonetheless, normal fluxes are often taken as Darcy velocity components, either naively or with accepted approximation. To enable accurate particle tracking or otherwise present an accurate depiction of the velocity field for a non

Testosterone administration reduces lying in men.

Directory of Open Access Journals (Sweden)

Matthias Wibral

Full Text Available Lying is a pervasive phenomenon with important social and economic implications. However, despite substantial interest in the prevalence and determinants of lying, little is known about its biological foundations. Here we study a potential hormonal influence, focusing on the steroid hormone testosterone, which has been shown to play an important role in social behavior. In a double-blind placebo-controlled study, 91 healthy men (24.32±2.73 years received a transdermal administration of 50 mg of testosterone (n=46 or a placebo (n=45. Subsequently, subjects participated in a simple task, in which their payoff depended on the self-reported outcome of a die-roll. Subjects could increase their payoff by lying without fear of being caught. Our results show that testosterone administration substantially decreases lying in men. Self-serving lying occurred in both groups, however, reported payoffs were significantly lower in the testosterone group (p<0.01. Our results contribute to the recent debate on the effect of testosterone on prosocial behavior and its underlying channels.

Potential carbon impacts of smart grid development in six European countries

Energy Technology Data Exchange (ETDEWEB)

Darby, S. [Lower Carbon Futures, Environmental Change Institute, Oxford University, South Parks Road, Oxford, OX1 3QY (United Kingdom); Stroembaeck, J. [VaasaETT Global Energy Think Tank, Itaemerenkatu 5, 2nd floor, 00180 Helsinki (Finland); Wilks, M. [Poyry Management Consulting, King Charles House, Park End Street, Oxford, OX1 1JD (United Kingdom)

2013-11-15

This paper examines reports on work carried out for the European Commission to devise a methodology for estimating the potential impact of smart grids on carbon emissions. It first identifies functionalities that enable carbon benefits to be realised. Each functionality on the demand side is assumed to be mirrored on the supply side, as when dynamic peak shifting 'replaces' flexible peak generation. Metrics are developed to describe the state of markets and to estimate customer response to demand response initiatives. Quantitative analysis identifies where the greatest scope for emissions reduction lies, while qualitative assessment indicates where to expect more or less impact from smart grid deployment. The impact of smart grid functionalities by 2020 is then modelled for six representative EU markets (Austria, France, Germany, Great Britain, Portugal and Spain), using a detailed pan-European market model and also a high-level ancillary services model. Three scenarios are developed: baseline, in which no smart grid rollout is assumed; feasible, based on what could be achievable in the light of technology developments and with supportive legislation; and an intermediate expected scenario, in which new technologies are introduced but nothing else changes. The findings indicate the potential for emissions reductions by 2020. They also show that the potential is very unlikely to be reached without regulatory support for user engagement in demand response and demand reduction, along with enabling technology and programmes. Development of regulatory frameworks that allow full advantage to be taken of the new technologies emerges as a challenge for smart grid development.

Storm: A Manager for Storage Resource in Grid

International Nuclear Information System (INIS)

Ghiselli, A.; Magnoni, L.; Zappi, R.

2009-01-01

Nowadays, data intensive applications demand high-performance and large-storage systems capable of serving up to various Peta bytes of storage space. Therefore, common solutions adopted in data centres include Storage Area Networks (San) and cluster parallel file systems, such as GPFS from IBM and Lustre from Sun Microsystems. In order to make these storage system solutions available in modern Data Grid architectures, standard interfaces are needed. The Grid Storage Resource Manager (SRM) interface is one of these standard interfaces. Grid storage services implementing the SRM standard provide common capabilities and advanced functionality such as dynamic space allocation and file management on shared storage systems. In this paper, we describe Storm (Storage Resource Manager). Storm is a flexible and high-performing implementation of the standard SRM interface version 2.2. The software architecture of Storm allows for an easy integration to different underlying storage systems via a plug-in mechanism. In particular, Storm takes advantage from storage systems based on cluster file systems. Currently, Storm is installed and used in production in various data centres, including the WLCG Italian Tier-1. In addition, Economics and Financial communities, as represented by the EGRID Project, adopt Storm in production as well.

Proportional derivative based stabilizing control of paralleled grid converters with cables in renewable power plants

DEFF Research Database (Denmark)

Wang, Xiongfei; Blaabjerg, Frede; Loh, Poh Chiang

2014-01-01

consisting in LCL filters and cables. Both grid and converter current controls are analyzed. The frequency region, within which the system may be destabilized, is identified by means of the impedance-based stability analysis and frequency-domain passivity theory. A proportional derivative control strategy...

Grid based calibration of SWAT hydrological models

Directory of Open Access Journals (Sweden)

D. Gorgan

2012-07-01

Full Text Available The calibration and execution of large hydrological models, such as SWAT (soil and water assessment tool, developed for large areas, high resolution, and huge input data, need not only quite a long execution time but also high computation resources. SWAT hydrological model supports studies and predictions of the impact of land management practices on water, sediment, and agricultural chemical yields in complex watersheds. The paper presents the gSWAT application as a web practical solution for environmental specialists to calibrate extensive hydrological models and to run scenarios, by hiding the complex control of processes and heterogeneous resources across the grid based high computation infrastructure. The paper highlights the basic functionalities of the gSWAT platform, and the features of the graphical user interface. The presentation is concerned with the development of working sessions, interactive control of calibration, direct and basic editing of parameters, process monitoring, and graphical and interactive visualization of the results. The experiments performed on different SWAT models and the obtained results argue the benefits brought by the grid parallel and distributed environment as a solution for the processing platform. All the instances of SWAT models used in the reported experiments have been developed through the enviroGRIDS project, targeting the Black Sea catchment area.

Classification of real Lie superalgebras based on a simple Lie algebra, giving rise to interesting examples involving {mathfrak {su}}(2,2)

Science.gov (United States)

Guzzo, H.; Hernández, I.; Sánchez-Valenzuela, O. A.

2014-09-01

Finite dimensional semisimple real Lie superalgebras are described via finite dimensional semisimple complex Lie superalgebras. As an application of these results, finite dimensional real Lie superalgebras mathfrak {m}=mathfrak {m}_0 oplus mathfrak {m}_1 for which mathfrak {m}_0 is a simple Lie algebra are classified up to isomorphism.

The Centroid of a Lie Triple Algebra

Directory of Open Access Journals (Sweden)

Xiaohong Liu

2013-01-01

Full Text Available General results on the centroids of Lie triple algebras are developed. Centroids of the tensor product of a Lie triple algebra and a unitary commutative associative algebra are studied. Furthermore, the centroid of the tensor product of a simple Lie triple algebra and a polynomial ring is completely determined.

[Parallel virtual reality visualization of extreme large medical datasets].

Science.gov (United States)

Tang, Min

2010-04-01

On the basis of a brief description of grid computing, the essence and critical techniques of parallel visualization of extreme large medical datasets are discussed in connection with Intranet and common-configuration computers of hospitals. In this paper are introduced several kernel techniques, including the hardware structure, software framework, load balance and virtual reality visualization. The Maximum Intensity Projection algorithm is realized in parallel using common PC cluster. In virtual reality world, three-dimensional models can be rotated, zoomed, translated and cut interactively and conveniently through the control panel built on virtual reality modeling language (VRML). Experimental results demonstrate that this method provides promising and real-time results for playing the role in of a good assistant in making clinical diagnosis.

Enveloping algebras of Lie groups with descrete series

International Nuclear Information System (INIS)

Nguyen huu Anh; Vuong manh Son

1990-09-01

In this article we shall prove that the enveloping algebra of the Lie algebra of some unimodular Lie group having discrete series, when localized at some element of the center, is isomorphic to the tensor product of a Weyl algebra over the ring of Laurent polynomials of one variable and the enveloping algebra of some reductive Lie algebra. In particular, it will be proved that the Lie algebra of a unimodular solvable Lie group having discrete series satisfies the Gelfand-Kirillov conjecture. (author). 6 refs

Discontinuous interleaving of parallel inverters for efficiency improvement

DEFF Research Database (Denmark)

Rannestad, Bjørn; Munk-Nielsen, Stig; Gadgaard, Kristian

2017-01-01

Interleaved switching of parallel inverters has previously been proposed for efficiency/size improvements of grid connected three-phase inverters. This paper proposes a novel interleaving method which practically eliminates insulated gate bipolar transistor (IGBT) turn-on losses and drastically...... overall power module losses are reduced. The modulation strategy is suited for converters with doubly fed induction generators (DFIG) for wind turbines, but are not limited hereto. Improvement of switching performance are measured and operational efficiency improvements are calculated and verified...

Parallel community climate model: Description and user`s guide

Energy Technology Data Exchange (ETDEWEB)

Drake, J.B.; Flanery, R.E.; Semeraro, B.D.; Worley, P.H. [and others

1996-07-15

This report gives an overview of a parallel version of the NCAR Community Climate Model, CCM2, implemented for MIMD massively parallel computers using a message-passing programming paradigm. The parallel implementation was developed on an Intel iPSC/860 with 128 processors and on the Intel Delta with 512 processors, and the initial target platform for the production version of the code is the Intel Paragon with 2048 processors. Because the implementation uses a standard, portable message-passing libraries, the code has been easily ported to other multiprocessors supporting a message-passing programming paradigm. The parallelization strategy used is to decompose the problem domain into geographical patches and assign each processor the computation associated with a distinct subset of the patches. With this decomposition, the physics calculations involve only grid points and data local to a processor and are performed in parallel. Using parallel algorithms developed for the semi-Lagrangian transport, the fast Fourier transform and the Legendre transform, both physics and dynamics are computed in parallel with minimal data movement and modest change to the original CCM2 source code. Sequential or parallel history tapes are written and input files (in history tape format) are read sequentially by the parallel code to promote compatibility with production use of the model on other computer systems. A validation exercise has been performed with the parallel code and is detailed along with some performance numbers on the Intel Paragon and the IBM SP2. A discussion of reproducibility of results is included. A user`s guide for the PCCM2 version 2.1 on the various parallel machines completes the report. Procedures for compilation, setup and execution are given. A discussion of code internals is included for those who may wish to modify and use the program in their own research.

CELLS v1.0: updated and parallelized version of an electrical scheme to simulate multiple electrified clouds and flashes over large domains

Directory of Open Access Journals (Sweden)

C. Barthe

2012-01-01

Full Text Available The paper describes the fully parallelized electrical scheme CELLS which is suitable to simulate explicitly electrified storm systems on parallel computers. Our motivation here is to show that a cloud electricity scheme can be developed for use on large grids with complex terrain. Large computational domains are needed to perform real case meteorological simulations with many independent convective cells.

The scheme computes the bulk electric charge attached to each cloud particle and hydrometeor. Positive and negative ions are also taken into account. Several parametrizations of the dominant non-inductive charging process are included and an inductive charging process as well. The electric field is obtained by inverting the Gauss equation with an extension to terrain-following coordinates. The new feature concerns the lightning flash scheme which is a simplified version of an older detailed sequential scheme. Flashes are composed of a bidirectional leader phase (vertical extension from the triggering point and a phase obeying a fractal law (with horizontal extension on electrically charged zones. The originality of the scheme lies in the way the branching phase is treated to get a parallel code.

The complete electrification scheme is tested for the 10 July 1996 STERAO case and for the 21 July 1998 EULINOX case. Flash characteristics are analysed in detail and additional sensitivity experiments are performed for the STERAO case. Although the simulations were run for flat terrain conditions, they show that the model behaves well on multiprocessor computers. This opens a wide area of application for this electrical scheme with the next objective of running real meterological case on large domains.

Development of large scale fusion plasma simulation and storage grid on JAERI Origin3800 system

International Nuclear Information System (INIS)

Idomura, Yasuhiro; Wang, Xin

2003-01-01

Under the Numerical EXperiment of Tokamak (NEXT) research project, various fluid, particle, and hybrid codes have been developed. These codes require a computational environment which consists of high performance processors, high speed storage system, and high speed parallelized visualization system. In this paper, the performance of the JAERI Origin3800 system is examined from a point of view of these requests. In the performance tests, it is shown that the representative particle and fluid codes operate with 15 - 40% of processing efficiency up to 512 processors. A storage area network (SAN) provides high speed parallel data transfer. A parallel visualization system enables order to magnitude faster visualization of a large scale simulation data compared with the previous graphic workstations. Accordingly, an extremely advanced simulation environment is realized on the JAERI Origin3800 system. Recently, development of a storage grid is underway in order to improve a computational environment of remote users. The storage grid is constructed by a combination of SAN and a wavelength division multiplexer (WDM). The preliminary tests show that compared with the existing data transfer methods, it enables dramatically high speed data transfer ∼100 Gbps over a wide area network. (author)

DC Voltage Control and Power-Sharing of Multi-Terminal DC Grids Based on Optimal DC Power Flow and Flexible Voltage Droop Strategy

Directory of Open Access Journals (Sweden)

F. Azma

2015-06-01

Full Text Available This paper develops an effective control framework for DC voltage control and power-sharing of multi-terminal DC (MTDC grids based on an optimal power flow (OPF procedure and the voltage-droop control. In the proposed approach, an OPF algorithm is executed at the secondary level to find optimal reference of DC voltages and active powers of all voltage-regulating converters. Then, the voltage droop characteristics of voltage-regulating converters, at the primary level, are tuned based on the OPF results such that the operating point of the MTDC grid lies on the voltage droop characteristics. Consequently, the optimally-tuned voltage droop controller leads to the optimal operation of the MTDC grid. In case of variation in load or generation of the grid, a new stable operating point is achieved based on the voltage droop characteristics. By execution of a new OPF, the voltage droop characteristics are re-tuned for optimal operation of the MTDC grid after the occurrence of the load or generation variations. The results of simulation on a grid inspired by CIGRE B4 DC grid test system demonstrate efficient grid performance under the proposed control strategy.

GridCom, Grid Commander: graphical interface for Grid jobs and data management; GridCom, Grid Commander: graficheskij interfejs dlya raboty s zadachami i dannymi v gride

Energy Technology Data Exchange (ETDEWEB)

Galaktionov, V V

2011-07-01

GridCom - the software package for maintenance of automation of access to means of distributed system Grid (jobs and data). The client part, executed in the form of Java-applets, realises the Web-interface access to Grid through standard browsers. The executive part Lexor (LCG Executor) is started by the user in UI (User Interface) machine providing performance of Grid operations

Lie n-algebras of BPS charges

Energy Technology Data Exchange (ETDEWEB)

Sati, Hisham [University of Pittsburgh,Pittsburgh, PA, 15260 (United States); Mathematics Program, Division of Science and Mathematics, New York University Abu Dhabi,Saadiyat Island, Abu Dhabi (United Arab Emirates); Schreiber, Urs [Mathematics Institute of the Academy,Žitna 25, Praha 1, 115 67 (Czech Republic)

2017-03-16

We uncover higher algebraic structures on Noether currents and BPS charges. It is known that equivalence classes of conserved currents form a Lie algebra. We show that at least for target space symmetries of higher parameterized WZW-type sigma-models this naturally lifts to a Lie (p+1)-algebra structure on the Noether currents themselves. Applied to the Green-Schwarz-type action functionals for super p-brane sigma-models this yields super Lie (p+1)-algebra refinements of the traditional BPS brane charge extensions of supersymmetry algebras. We discuss this in the generality of higher differential geometry, where it applies also to branes with (higher) gauge fields on their worldvolume. Applied to the M5-brane sigma-model we recover and properly globalize the M-theory super Lie algebra extension of 11-dimensional superisometries by 2-brane and 5-brane charges. Passing beyond the infinitesimal Lie theory we find cohomological corrections to these charges in higher analogy to the familiar corrections for D-brane charges as they are lifted from ordinary cohomology to twisted K-theory. This supports the proposal that M-brane charges live in a twisted cohomology theory.

Wildfire: distributed, Grid-enabled workflow construction and execution

Directory of Open Access Journals (Sweden)

Issac Praveen

2005-03-01

Full Text Available Abstract Background We observe two trends in bioinformatics: (i analyses are increasing in complexity, often requiring several applications to be run as a workflow; and (ii multiple CPU clusters and Grids are available to more scientists. The traditional solution to the problem of running workflows across multiple CPUs required programming, often in a scripting language such as perl. Programming places such solutions beyond the reach of many bioinformatics consumers. Results We present Wildfire, a graphical user interface for constructing and running workflows. Wildfire borrows user interface features from Jemboss and adds a drag-and-drop interface allowing the user to compose EMBOSS (and other programs into workflows. For execution, Wildfire uses GEL, the underlying workflow execution engine, which can exploit available parallelism on multiple CPU machines including Beowulf-class clusters and Grids. Conclusion Wildfire simplifies the tasks of constructing and executing bioinformatics workflows.

The representations of Lie groups and geometric quantizations

International Nuclear Information System (INIS)

Zhao Qiang

1998-01-01

In this paper we discuss the relation between representations of Lie groups and geometric quantizations. A series of representations of Lie groups are constructed by geometric quantization of coadjoint orbits. Particularly, all representations of compact Lie groups, holomorphic discrete series of representations and spherical representations of reductive Lie groups are constructed by geometric quantizations of elliptic and hyperbolic coadjoint orbits. (orig.)

Lie-superalgebraical aspects of quantum statistics

International Nuclear Information System (INIS)

Palev, T.D.

1978-01-01

The Lie-superalgebraical properties of the ordinary quantum statistics are discussed with the aim of possible generalization in quantum theory and in theoretical physics. It is indicated that the algebra generated by n pairs of Fermi or paraFermi operators is isomorphic to the classical simple Lie algebra Bsub(n) of the SO(2n+1) orthogonal group, whereas n pairs of Bose or paraBose operators generate the simple orthosympletic superalgebra B(O,n). The transition to infinite number of creation and annihilation operators (n → infinity) does not change a superalgebraic structure. Hence, ordinary Bose and Fermi quantization can be considered as quantization over definite irreducible representations of two simple Lie superalgebras. The idea is given of how one can introduce creation and annihilation operators that satisfy the second quantization postulates and generate other simple Lie superalgebras

Progress in Grid Generation: From Chimera to DRAGON Grids

Science.gov (United States)

Liou, Meng-Sing; Kao, Kai-Hsiung

1994-01-01

Hybrid grids, composed of structured and unstructured grids, combines the best features of both. The chimera method is a major stepstone toward a hybrid grid from which the present approach is evolved. The chimera grid composes a set of overlapped structured grids which are independently generated and body-fitted, yielding a high quality grid readily accessible for efficient solution schemes. The chimera method has been shown to be efficient to generate a grid about complex geometries and has been demonstrated to deliver accurate aerodynamic prediction of complex flows. While its geometrical flexibility is attractive, interpolation of data in the overlapped regions - which in today's practice in 3D is done in a nonconservative fashion, is not. In the present paper we propose a hybrid grid scheme that maximizes the advantages of the chimera scheme and adapts the strengths of the unstructured grid while at the same time keeps its weaknesses minimal. Like the chimera method, we first divide up the physical domain by a set of structured body-fitted grids which are separately generated and overlaid throughout a complex configuration. To eliminate any pure data manipulation which does not necessarily follow governing equations, we use non-structured grids only to directly replace the region of the arbitrarily overlapped grids. This new adaptation to the chimera thinking is coined the DRAGON grid. The nonstructured grid region sandwiched between the structured grids is limited in size, resulting in only a small increase in memory and computational effort. The DRAGON method has three important advantages: (1) preserving strengths of the chimera grid; (2) eliminating difficulties sometimes encountered in the chimera scheme, such as the orphan points and bad quality of interpolation stencils; and (3) making grid communication in a fully conservative and consistent manner insofar as the governing equations are concerned. To demonstrate its use, the governing equations are

Parallel 3D Mortar Element Method for Adaptive Nonconforming Meshes

Science.gov (United States)

Feng, Huiyu; Mavriplis, Catherine; VanderWijngaart, Rob; Biswas, Rupak

2004-01-01

High order methods are frequently used in computational simulation for their high accuracy. An efficient way to avoid unnecessary computation in smooth regions of the solution is to use adaptive meshes which employ fine grids only in areas where they are needed. Nonconforming spectral elements allow the grid to be flexibly adjusted to satisfy the computational accuracy requirements. The method is suitable for computational simulations of unsteady problems with very disparate length scales or unsteady moving features, such as heat transfer, fluid dynamics or flame combustion. In this work, we select the Mark Element Method (MEM) to handle the non-conforming interfaces between elements. A new technique is introduced to efficiently implement MEM in 3-D nonconforming meshes. By introducing an "intermediate mortar", the proposed method decomposes the projection between 3-D elements and mortars into two steps. In each step, projection matrices derived in 2-D are used. The two-step method avoids explicitly forming/deriving large projection matrices for 3-D meshes, and also helps to simplify the implementation. This new technique can be used for both h- and p-type adaptation. This method is applied to an unsteady 3-D moving heat source problem. With our new MEM implementation, mesh adaptation is able to efficiently refine the grid near the heat source and coarsen the grid once the heat source passes. The savings in computational work resulting from the dynamic mesh adaptation is demonstrated by the reduction of the the number of elements used and CPU time spent. MEM and mesh adaptation, respectively, bring irregularity and dynamics to the computer memory access pattern. Hence, they provide a good way to gauge the performance of computer systems when running scientific applications whose memory access patterns are irregular and unpredictable. We select a 3-D moving heat source problem as the Unstructured Adaptive (UA) grid benchmark, a new component of the NAS Parallel

A grid-enabled web service for low-resolution crystal structure refinement.

Science.gov (United States)

O'Donovan, Daniel J; Stokes-Rees, Ian; Nam, Yunsun; Blacklow, Stephen C; Schröder, Gunnar F; Brunger, Axel T; Sliz, Piotr

2012-03-01

Deformable elastic network (DEN) restraints have proved to be a powerful tool for refining structures from low-resolution X-ray crystallographic data sets. Unfortunately, optimal refinement using DEN restraints requires extensive calculations and is often hindered by a lack of access to sufficient computational resources. The DEN web service presented here intends to provide structural biologists with access to resources for running computationally intensive DEN refinements in parallel on the Open Science Grid, the US cyberinfrastructure. Access to the grid is provided through a simple and intuitive web interface integrated into the SBGrid Science Portal. Using this portal, refinements combined with full parameter optimization that would take many thousands of hours on standard computational resources can now be completed in several hours. An example of the successful application of DEN restraints to the human Notch1 transcriptional complex using the grid resource, and summaries of all submitted refinements, are presented as justification.

New Parallel Algorithms for Landscape Evolution Model

Science.gov (United States)

Jin, Y.; Zhang, H.; Shi, Y.

2017-12-01

Most landscape evolution models (LEM) developed in the last two decades solve the diffusion equation to simulate the transportation of surface sediments. This numerical approach is difficult to parallelize due to the computation of drainage area for each node, which needs huge amount of communication if run in parallel. In order to overcome this difficulty, we developed two parallel algorithms for LEM with a stream net. One algorithm handles the partition of grid with traditional methods and applies an efficient global reduction algorithm to do the computation of drainage areas and transport rates for the stream net; the other algorithm is based on a new partition algorithm, which partitions the nodes in catchments between processes first, and then partitions the cells according to the partition of nodes. Both methods focus on decreasing communication between processes and take the advantage of massive computing techniques, and numerical experiments show that they are both adequate to handle large scale problems with millions of cells. We implemented the two algorithms in our program based on the widely used finite element library deal.II, so that it can be easily coupled with ASPECT.

Testosterone Administration Reduces Lying in Men

NARCIS (Netherlands)

Wibral, M.; Dohmen, T.J.; Klingmüller, Dietrich; Weber, Bernd; Falk, Armin

2012-01-01

Lying is a pervasive phenomenon with important social and economic implications. However, despite substantial interest in the prevalence and determinants of lying, little is known about its biological foundations. Here we study a potential hormonal influence, focusing on the steroid hormone

Bosonic construction of the Lie algebras of some non-compact groups appearing in supergravity theories and their oscillator-like unitary representations

International Nuclear Information System (INIS)

Guenaydin, M.; Saclioglu, C.

1981-06-01

We give a construction of the Lie algebras of the non-compact groups appearing in four dimensional supergravity theories in terms of boson operators. Our construction parallels very closely their emergence in supergravity and is an extension of the well-known construction of the Lie algebras of the non-compact groups Sp(2n,IR) and SO(2n) from boson operators transforming like a fundamental representation of their maximal compact subgroup U(n). However this extension is non-trivial only for n >= 4 and stops at n = 8 leading to the Lie algebras of SU(4) x SU(1,1), SU(5,1), SO(12) and Esub(7(7)). We then give a general construction of an infinite class of unitary irreducible representations of the respective non-compact groups (except for Esub(7(7)) and SO(12) obtained from the extended construction). We illustrate our construction with the examples of SU(5,1) and SO(12). (orig.)

Parallel Newton-Krylov-Schwarz algorithms for the transonic full potential equation

Science.gov (United States)

Cai, Xiao-Chuan; Gropp, William D.; Keyes, David E.; Melvin, Robin G.; Young, David P.

1996-01-01

We study parallel two-level overlapping Schwarz algorithms for solving nonlinear finite element problems, in particular, for the full potential equation of aerodynamics discretized in two dimensions with bilinear elements. The overall algorithm, Newton-Krylov-Schwarz (NKS), employs an inexact finite-difference Newton method and a Krylov space iterative method, with a two-level overlapping Schwarz method as a preconditioner. We demonstrate that NKS, combined with a density upwinding continuation strategy for problems with weak shocks, is robust and, economical for this class of mixed elliptic-hyperbolic nonlinear partial differential equations, with proper specification of several parameters. We study upwinding parameters, inner convergence tolerance, coarse grid density, subdomain overlap, and the level of fill-in in the incomplete factorization, and report their effect on numerical convergence rate, overall execution time, and parallel efficiency on a distributed-memory parallel computer.

MICROARRAY IMAGE GRIDDING USING GRID LINE REFINEMENT TECHNIQUE

Directory of Open Access Journals (Sweden)

V.G. Biju

2015-05-01

Full Text Available An important stage in microarray image analysis is gridding. Microarray image gridding is done to locate sub arrays in a microarray image and find co-ordinates of spots within each sub array. For accurate identification of spots, most of the proposed gridding methods require human intervention. In this paper a fully automatic gridding method which enhances spot intensity in the preprocessing step as per a histogram based threshold method is used. The gridding step finds co-ordinates of spots from horizontal and vertical profile of the image. To correct errors due to the grid line placement, a grid line refinement technique is proposed. The algorithm is applied on different image databases and results are compared based on spot detection accuracy and time. An average spot detection accuracy of 95.06% depicts the proposed method’s flexibility and accuracy in finding the spot co-ordinates for different database images.

A hybrid life cycle assessment of the vehicle-to-grid application in light duty commercial fleet

International Nuclear Information System (INIS)

Zhao, Yang; Tatari, Omer

2015-01-01

The vehicle-to-grid system is an approach utilizing the idle battery capacity of electric vehicles while they are parked to provide supplementary energy to the power grid. As electrification continues in light duty vehicle fleets, the application of vehicle-to-grid systems for commercial delivery truck fleets can provide extra revenue for fleet owners, and also has significant potential for reducing greenhouse gas emissions from the electricity generation sector. In this study, an economic input–output based hybrid life cycle assessment is conducted to analyze the potential greenhouse gas emissions emission savings from the use of the vehicle-to-grid system, as well as the possible emission impacts caused by battery degradation. A Monte Carlo simulation was performed to address the uncertainties that lie in the electricity exchange amount of the vehicle-to-grid service as well as the battery life of the electric vehicles. The results of this study showed that extended range electric vehicles and battery electric vehicles are both viable regulation service providers for saving greenhouse gas emissions from electricity generation if the battery wear-out from regulation services is assumed to be minimal, but the vehicle-to-grid system becomes less attractive at higher battery degradation levels. - Highlights: • The commercial delivery trucks are studied as vehicle-to-grid service providers. • Hybrid life cycle assessment is conducted to evaluate emission mitigation. • Battery degradation level and corresponding emissions and cost are evaluated. • Vehicle-to-grid service is shown to have significant emission saving effect.

CFD analysis of the flow in the near wake of a generic PWR mixing grid

International Nuclear Information System (INIS)

Bieder, Ulrich; Falk, François; Fauchet, Gauthier

2015-01-01

Highlights: • The flow in a 5 × 5 rod bundle with mixing grid is analyzed experimentally and with CFD. • LES and RANS (k–ε) calculations are performed. • The parallelism of the Trio-U code was tested with a strong scaling method. • Close downstream of the grid, k–ε and LES give similar results and fit well the experiment. - Abstract: The flow in fuel assemblies of PWRs with mixing grids has been analyzed with CFD calculations by numerous authors. The comparison between calculation and experiment has often shown an insensitivity of the calculated cross flow velocity on the turbulence modeling. The study presented here was carried out to confirm this result. The comparison between measurements in the AGATE facility (5 × 5 tube bundle) and Trio-U calculations with a linear eddy viscosity turbulence model (k–ε) and Large Eddy Simulations (LES) is presented. The AGATE experiments have originally not been designed for CFD validation but to characterize different types of mixing grids. Nevertheless, the quality of the experimental data allows the quantitative comparison between measurement and calculation. The test section of the AGATE facility has been discretized for the LES calculation on 300 million control volumes by using a staggered grid approach on tetrahedral meshes. 20 days of CPU on 4600 cores of the HPC machine CURIE of the TGCC was necessary to calculate the statistics of the turbulent flow, in particular the mean velocity and the RMS of the turbulent fluctuations. The parallelism of Trio-U was tested up to 10,000 processor cores using strong scaling and has shown a good efficiency up to about 6000 cores, i.e., 40,000 control volumes per core. For various distances from the mixing grid, calculated horizontal profiles of the cross flow velocity and of the axial velocity are compared to measurements. It seems that the flow patterns directly downstream of the grid are insensitive to the used turbulence model. Inertia forces related to the

Diviner lunar radiometer gridded brightness temperatures from geodesic binning of modeled fields of view

Science.gov (United States)

Sefton-Nash, E.; Williams, J.-P.; Greenhagen, B. T.; Aye, K.-M.; Paige, D. A.

2017-12-01

An approach is presented to efficiently produce high quality gridded data records from the large, global point-based dataset returned by the Diviner Lunar Radiometer Experiment aboard NASA's Lunar Reconnaissance Orbiter. The need to minimize data volume and processing time in production of science-ready map products is increasingly important with the growth in data volume of planetary datasets. Diviner makes on average >1400 observations per second of radiance that is reflected and emitted from the lunar surface, using 189 detectors divided into 9 spectral channels. Data management and processing bottlenecks are amplified by modeling every observation as a probability distribution function over the field of view, which can increase the required processing time by 2-3 orders of magnitude. Geometric corrections, such as projection of data points onto a digital elevation model, are numerically intensive and therefore it is desirable to perform them only once. Our approach reduces bottlenecks through parallel binning and efficient storage of a pre-processed database of observations. Database construction is via subdivision of a geodesic icosahedral grid, with a spatial resolution that can be tailored to suit the field of view of the observing instrument. Global geodesic grids with high spatial resolution are normally impractically memory intensive. We therefore demonstrate a minimum storage and highly parallel method to bin very large numbers of data points onto such a grid. A database of the pre-processed and binned points is then used for production of mapped data products that is significantly faster than if unprocessed points were used. We explore quality controls in the production of gridded data records by conditional interpolation, allowed only where data density is sufficient. The resultant effects on the spatial continuity and uncertainty in maps of lunar brightness temperatures is illustrated. We identify four binning regimes based on trades between the

Reductive Lie-admissible algebras applied to H-spaces and connections

International Nuclear Information System (INIS)

Sagle, A.A.

1982-01-01

An algebra A with multiplication xy is Lie-admissible if the vector space A with new multiplication [x,y] = xy-yx is a Lie algebra; we denote this Lie algebra by A - . Thus, an associative algebra is Lie-admissible but a Cayley algebra is not Lie-admissible. In this paper we show how Lie-admissible algebras arise from Lie groups and their application to differential geometry on Lie groups via the following theorem. Let A be an n-dimensional Lie-admissible algebra over the reals. Let G be a Lie group with multiplication function μ and with Lie algebra g which is isomorphic to A - . Then there exiss a corrdinate system at the identify e in G which represents μ by a function F:gxg→g defined locally at the origin, such that the second derivative, F 2 , at the origin defines on the vector space g the structure of a nonassociative algebra (g, F 2 ). Furthermore this algebra is isomorphic to A and (g, F 2 ) - is isomorphic to A - . Thus roughly, any Lie-admissible algebra is isomorphic to an algebra obtained from a Lie algebra via a change of coordinates in the Lie group. Lie algebras arise by using canonical coordinates and the Campbell-Hausdorff formula. Applications of this show that any G-invariant psuedo-Riemannian connection on G is completely determined by a suitable Lie-admissible algebra. These results extend to H-spaces, reductive Lie-admissible algebras and connections on homogeneous H-spaces. Thus, alternative and other non-Lie-admissible algebras can be utilized

Grid3: An Application Grid Laboratory for Science

CERN Multimedia

CERN. Geneva

2004-01-01

level services required by the participating experiments. The deployed infrastructure has been operating since November 2003 with 27 sites, a peak of 2800 processors, work loads from 10 different applications exceeding 1300 simultaneous jobs, and data transfers among sites of greater than 2 TB/day. The Grid3 infrastructure was deployed from grid level services provided by groups and applications within the collaboration. The services were organized into four distinct "grid level services" including: Grid3 Packaging, Monitoring and Information systems, User Authentication and the iGOC Grid Operatio...

A general parallelization strategy for random path based geostatistical simulation methods

Science.gov (United States)

Mariethoz, Grégoire

2010-07-01

The size of simulation grids used for numerical models has increased by many orders of magnitude in the past years, and this trend is likely to continue. Efficient pixel-based geostatistical simulation algorithms have been developed, but for very large grids and complex spatial models, the computational burden remains heavy. As cluster computers become widely available, using parallel strategies is a natural step for increasing the usable grid size and the complexity of the models. These strategies must profit from of the possibilities offered by machines with a large number of processors. On such machines, the bottleneck is often the communication time between processors. We present a strategy distributing grid nodes among all available processors while minimizing communication and latency times. It consists in centralizing the simulation on a master processor that calls other slave processors as if they were functions simulating one node every time. The key is to decouple the sending and the receiving operations to avoid synchronization. Centralization allows having a conflict management system ensuring that nodes being simulated simultaneously do not interfere in terms of neighborhood. The strategy is computationally efficient and is versatile enough to be applicable to all random path based simulation methods.

Grid-connected to/from off-grid transference for micro-grid inverters

OpenAIRE

Heredero Peris, Daniel; Chillón Antón, Cristian; Pages Gimenez, Marc; Gross, Gabriel Igor; Montesinos Miracle, Daniel

2013-01-01

This paper compares two methods for controlling the on-line transference from connected to stand-alone mode and vice versa in converters for micro-grids. The first proposes a method where the converter changes from CSI (Current Source Inverter) in grid-connected mode to VSI (Voltage Source Inverter) in off-grid. In the second method, the inverter always works as a non-ideal voltage source, acting as VSI, using AC droop control strategy.

The GridSite Web/Grid security system

International Nuclear Information System (INIS)

McNab, Andrew; Li Yibiao

2010-01-01

We present an overview of the current status of the GridSite toolkit, describing the security model for interactive and programmatic uses introduced in the last year. We discuss our experiences of implementing these internal changes and how they and previous rounds of improvements have been prompted by requirements from users and wider security trends in Grids (such as CSRF). Finally, we explain how these have improved the user experience of GridSite-based websites, and wider implications for portals and similar web/grid sites.

The Effect of Telling Lies on Belief in the Truth

Directory of Open Access Journals (Sweden)

Danielle Polage

2017-11-01

Full Text Available The current study looks at the effect of telling lies, in contrast to simply planning lies, on participants’ belief in the truth. Participants planned and told a lie, planned to tell a lie but didn’t tell it, told an unplanned lie, or neither planned nor told a lie (control about events that did not actually happen to them. Participants attempted to convince researchers that all of the stories told were true. Results show that telling a lie plays a more important role in inflating belief scores than simply preparing the script of a lie. Cognitive dissonance may lead to motivated forgetting of information that does not align with the lie. This research suggests that telling lies may lead to confusion as to the veracity of the lie leading to inflated belief scores.

Enhancing GIS Capabilities for High Resolution Earth Science Grids

Science.gov (United States)

Koziol, B. W.; Oehmke, R.; Li, P.; O'Kuinghttons, R.; Theurich, G.; DeLuca, C.

2017-12-01

Applications for high performance GIS will continue to increase as Earth system models pursue more realistic representations of Earth system processes. Finer spatial resolution model input and output, unstructured or irregular modeling grids, data assimilation, and regional coordinate systems present novel challenges for GIS frameworks operating in the Earth system modeling domain. This presentation provides an overview of two GIS-driven applications that combine high performance software with big geospatial datasets to produce value-added tools for the modeling and geoscientific community. First, a large-scale interpolation experiment using National Hydrography Dataset (NHD) catchments, a high resolution rectilinear CONUS grid, and the Earth System Modeling Framework's (ESMF) conservative interpolation capability will be described. ESMF is a parallel, high-performance software toolkit that provides capabilities (e.g. interpolation) for building and coupling Earth science applications. ESMF is developed primarily by the NOAA Environmental Software Infrastructure and Interoperability (NESII) group. The purpose of this experiment was to test and demonstrate the utility of high performance scientific software in traditional GIS domains. Special attention will be paid to the nuanced requirements for dealing with high resolution, unstructured grids in scientific data formats. Second, a chunked interpolation application using ESMF and OpenClimateGIS (OCGIS) will demonstrate how spatial subsetting can virtually remove computing resource ceilings for very high spatial resolution interpolation operations. OCGIS is a NESII-developed Python software package designed for the geospatial manipulation of high-dimensional scientific datasets. An overview of the data processing workflow, why a chunked approach is required, and how the application could be adapted to meet operational requirements will be discussed here. In addition, we'll provide a general overview of OCGIS

Current Grid operation and future role of the Grid

Science.gov (United States)

Smirnova, O.

2012-12-01

Grid-like technologies and approaches became an integral part of HEP experiments. Some other scientific communities also use similar technologies for data-intensive computations. The distinct feature of Grid computing is the ability to federate heterogeneous resources of different ownership into a seamless infrastructure, accessible via a single log-on. Like other infrastructures of similar nature, Grid functioning requires not only technologically sound basis, but also reliable operation procedures, monitoring and accounting. The two aspects, technological and operational, are closely related: weaker is the technology, more burden is on operations, and other way around. As of today, Grid technologies are still evolving: at CERN alone, every LHC experiment uses an own Grid-like system. This inevitably creates a heavy load on operations. Infrastructure maintenance, monitoring and incident response are done on several levels, from local system administrators to large international organisations, involving massive human effort worldwide. The necessity to commit substantial resources is one of the obstacles faced by smaller research communities when moving computing to the Grid. Moreover, most current Grid solutions were developed under significant influence of HEP use cases, and thus need additional effort to adapt them to other applications. Reluctance of many non-HEP researchers to use Grid negatively affects the outlook for national Grid organisations, which strive to provide multi-science services. We started from the situation where Grid organisations were fused with HEP laboratories and national HEP research programmes; we hope to move towards the world where Grid will ultimately reach the status of generic public computing and storage service provider and permanent national and international Grid infrastructures will be established. How far will we be able to advance along this path, depends on us. If no standardisation and convergence efforts will take place

Current Grid operation and future role of the Grid

International Nuclear Information System (INIS)

Smirnova, O

2012-01-01

Grid-like technologies and approaches became an integral part of HEP experiments. Some other scientific communities also use similar technologies for data-intensive computations. The distinct feature of Grid computing is the ability to federate heterogeneous resources of different ownership into a seamless infrastructure, accessible via a single log-on. Like other infrastructures of similar nature, Grid functioning requires not only technologically sound basis, but also reliable operation procedures, monitoring and accounting. The two aspects, technological and operational, are closely related: weaker is the technology, more burden is on operations, and other way around. As of today, Grid technologies are still evolving: at CERN alone, every LHC experiment uses an own Grid-like system. This inevitably creates a heavy load on operations. Infrastructure maintenance, monitoring and incident response are done on several levels, from local system administrators to large international organisations, involving massive human effort worldwide. The necessity to commit substantial resources is one of the obstacles faced by smaller research communities when moving computing to the Grid. Moreover, most current Grid solutions were developed under significant influence of HEP use cases, and thus need additional effort to adapt them to other applications. Reluctance of many non-HEP researchers to use Grid negatively affects the outlook for national Grid organisations, which strive to provide multi-science services. We started from the situation where Grid organisations were fused with HEP laboratories and national HEP research programmes; we hope to move towards the world where Grid will ultimately reach the status of generic public computing and storage service provider and permanent national and international Grid infrastructures will be established. How far will we be able to advance along this path, depends on us. If no standardisation and convergence efforts will take place

Parallel Fokker–Planck-DSMC algorithm for rarefied gas flow simulation in complex domains at all Knudsen numbers

Energy Technology Data Exchange (ETDEWEB)

Küchlin, Stephan, E-mail: kuechlin@ifd.mavt.ethz.ch; Jenny, Patrick

2017-01-01

A major challenge for the conventional Direct Simulation Monte Carlo (DSMC) technique lies in the fact that its computational cost becomes prohibitive in the near continuum regime, where the Knudsen number (Kn)—characterizing the degree of rarefaction—becomes small. In contrast, the Fokker–Planck (FP) based particle Monte Carlo scheme allows for computationally efficient simulations of rarefied gas flows in the low and intermediate Kn regime. The Fokker–Planck collision operator—instead of performing binary collisions employed by the DSMC method—integrates continuous stochastic processes for the phase space evolution in time. This allows for time step and grid cell sizes larger than the respective collisional scales required by DSMC. Dynamically switching between the FP and the DSMC collision operators in each computational cell is the basis of the combined FP-DSMC method, which has been proven successful in simulating flows covering the whole Kn range. Until recently, this algorithm had only been applied to two-dimensional test cases. In this contribution, we present the first general purpose implementation of the combined FP-DSMC method. Utilizing both shared- and distributed-memory parallelization, this implementation provides the capability for simulations involving many particles and complex geometries by exploiting state of the art computer cluster technologies.

An adaptive multi-agent-based approach to smart grids control and optimization

Energy Technology Data Exchange (ETDEWEB)

Carvalho, Marco [Florida Institute of Technology, Melbourne, FL (United States); Perez, Carlos; Granados, Adrian [Institute for Human and Machine Cognition, Ocala, FL (United States)

2012-03-15

In this paper, we describe a reinforcement learning-based approach to power management in smart grids. The scenarios we consider are smart grid settings where renewable power sources (e.g. Photovoltaic panels) have unpredictable variations in power output due, for example, to weather or cloud transient effects. Our approach builds on a multi-agent system (MAS)-based infrastructure for the monitoring and coordination of smart grid environments with renewable power sources and configurable energy storage devices (battery banks). Software agents are responsible for tracking and reporting power flow variations at different points in the grid, and to optimally coordinate the engagement of battery banks (i.e. charge/idle/discharge modes) to maintain energy requirements to end-users. Agents are able to share information and coordinate control actions through a parallel communications infrastructure, and are also capable of learning, from experience, how to improve their response strategies for different operational conditions. In this paper we describe our approach and address some of the challenges associated with the communications infrastructure for distributed coordination. We also present some preliminary results of our first simulations using the GridLAB-D simulation environment, created by the US Department of Energy (DoE) at Pacific Northwest National Laboratory (PNNL). (orig.)

Biderivations of finite dimensional complex simple Lie algebras

OpenAIRE

Tang, Xiaomin

2016-01-01

In this paper, we prove that a biderivation of a finite dimensional complex simple Lie algebra without the restriction of skewsymmetric is inner. As an application, the biderivation of a general linear Lie algebra is presented. In particular, we find a class of a non-inner and non-skewsymmetric biderivations. Furthermore, we also get the forms of linear commuting maps on the finite dimensional complex simple Lie algebra or general linear Lie algebra.

ColDICE: A parallel Vlasov–Poisson solver using moving adaptive simplicial tessellation

International Nuclear Information System (INIS)

Sousbie, Thierry; Colombi, Stéphane

2016-01-01

Resolving numerically Vlasov–Poisson equations for initially cold systems can be reduced to following the evolution of a three-dimensional sheet evolving in six-dimensional phase-space. We describe a public parallel numerical algorithm consisting in representing the phase-space sheet with a conforming, self-adaptive simplicial tessellation of which the vertices follow the Lagrangian equations of motion. The algorithm is implemented both in six- and four-dimensional phase-space. Refinement of the tessellation mesh is performed using the bisection method and a local representation of the phase-space sheet at second order relying on additional tracers created when needed at runtime. In order to preserve in the best way the Hamiltonian nature of the system, refinement is anisotropic and constrained by measurements of local Poincaré invariants. Resolution of Poisson equation is performed using the fast Fourier method on a regular rectangular grid, similarly to particle in cells codes. To compute the density projected onto this grid, the intersection of the tessellation and the grid is calculated using the method of Franklin and Kankanhalli [65–67] generalised to linear order. As preliminary tests of the code, we study in four dimensional phase-space the evolution of an initially small patch in a chaotic potential and the cosmological collapse of a fluctuation composed of two sinusoidal waves. We also perform a “warm” dark matter simulation in six-dimensional phase-space that we use to check the parallel scaling of the code.

ColDICE: A parallel Vlasov–Poisson solver using moving adaptive simplicial tessellation

Energy Technology Data Exchange (ETDEWEB)

Sousbie, Thierry, E-mail: tsousbie@gmail.com [Institut d' Astrophysique de Paris, CNRS UMR 7095 and UPMC, 98bis, bd Arago, F-75014 Paris (France); Department of Physics, The University of Tokyo, Tokyo 113-0033 (Japan); Research Center for the Early Universe, School of Science, The University of Tokyo, Tokyo 113-0033 (Japan); Colombi, Stéphane, E-mail: colombi@iap.fr [Institut d' Astrophysique de Paris, CNRS UMR 7095 and UPMC, 98bis, bd Arago, F-75014 Paris (France); Yukawa Institute for Theoretical Physics, Kyoto University, Kyoto 606-8502 (Japan)

2016-09-15

Resolving numerically Vlasov–Poisson equations for initially cold systems can be reduced to following the evolution of a three-dimensional sheet evolving in six-dimensional phase-space. We describe a public parallel numerical algorithm consisting in representing the phase-space sheet with a conforming, self-adaptive simplicial tessellation of which the vertices follow the Lagrangian equations of motion. The algorithm is implemented both in six- and four-dimensional phase-space. Refinement of the tessellation mesh is performed using the bisection method and a local representation of the phase-space sheet at second order relying on additional tracers created when needed at runtime. In order to preserve in the best way the Hamiltonian nature of the system, refinement is anisotropic and constrained by measurements of local Poincaré invariants. Resolution of Poisson equation is performed using the fast Fourier method on a regular rectangular grid, similarly to particle in cells codes. To compute the density projected onto this grid, the intersection of the tessellation and the grid is calculated using the method of Franklin and Kankanhalli [65–67] generalised to linear order. As preliminary tests of the code, we study in four dimensional phase-space the evolution of an initially small patch in a chaotic potential and the cosmological collapse of a fluctuation composed of two sinusoidal waves. We also perform a “warm” dark matter simulation in six-dimensional phase-space that we use to check the parallel scaling of the code.

Graded-Lie-algebra cohomology and supergravity

International Nuclear Information System (INIS)

D'Auria, R.; Fre, P.; Regge, T.

1980-01-01

Detailed explanations of the cohomology invoked in the group-manifold approach to supergravity is given. The Chevalley cohomology theory of Lie algebras is extended to graded Lie algebras. The scheme of geometrical theories is enlarged so to include cosmological terms and higher powers of the curvature. (author)

White Lies in Hand: Are Other-Oriented Lies Modified by Hand Gestures? Possibly Not.

Science.gov (United States)

Cantarero, Katarzyna; Parzuchowski, Michal; Dukala, Karolina

2017-01-01

Previous studies have shown that the hand-over-heart gesture is related to being more honest as opposed to using self-centered dishonesty. We assumed that the hand-over-heart gesture would also relate to other-oriented dishonesty, though the latter differs highly from self-centered lying. In Study 1 ( N = 79), we showed that performing a hand-over-heart gesture diminished the tendency to use other-oriented white lies and that the fingers crossed behind one's back gesture was not related to higher dishonesty. We then pre-registered and conducted Study 2 ( N = 88), which was designed following higher methodological standards than Study 1. Contrary, to the findings of Study 1, we found that using the hand-over-heart gesture did not result in refraining from using other-oriented white lies. We discuss the findings of this failed replication indicating the importance of strict methodological guidelines in conducting research and also reflect on relatively small effect sizes related to some findings in embodied cognition.

Modeling, analysis, and design of stationary reference frame droop controlled parallel three-phase voltage source inverters

DEFF Research Database (Denmark)

Vasquez, Juan Carlos; Guerrero, Josep M.; Savaghebi, Mehdi

2011-01-01

and discussed. Experimental results are provided to validate the performance and robustness of the VSIs functionality during Islanded and grid-connected operations, allowing a seamless transition between these modes through control hierarchies by regulating frequency and voltage, main-grid interactivity......Power electronics based microgrids consist of a number of voltage source inverters (VSIs) operating in parallel. In this paper, the modeling, control design, and stability analysis of three-phase VSIs are derived. The proposed voltage and current inner control loops and the mathematical models...

3-Lie bialgebras (Lb,Cd and (Lb,Ce

Directory of Open Access Journals (Sweden)

Bai Ruipu

2016-05-01

Full Text Available Four dimensional $3$-Lie coalgebras with two-dimensional derived algebras, and four-dimensional $3$-Lie bialgebras of type $(L_b, C_c$ are classified. It is proved that there exist three classes of four dimensional $3$-Lie coalgebras with two-dimensional derived algebra which are $(L, C_{c_i}$, $i=1, 2, 3$ (Lemma 3.1, and ten classes of four dimensional $3$-Lie bialgebras of type $(L_b, C_c$ (Theorem 3.2.

Multitasking for flows about multiple body configurations using the chimera grid scheme

Science.gov (United States)

Dougherty, F. C.; Morgan, R. L.

1987-01-01

The multitasking of a finite-difference scheme using multiple overset meshes is described. In this chimera, or multiple overset mesh approach, a multiple body configuration is mapped using a major grid about the main component of the configuration, with minor overset meshes used to map each additional component. This type of code is well suited to multitasking. Both steady and unsteady two dimensional computations are run on parallel processors on a CRAY-X/MP 48, usually with one mesh per processor. Flow field results are compared with single processor results to demonstrate the feasibility of running multiple mesh codes on parallel processors and to show the increase in efficiency.

Coordinated parallel and series flexible AC transmission systems (FACTS) to support a power grid with a large amount of wind power

Energy Technology Data Exchange (ETDEWEB)

Mora-Cantallops, Marcal; Gomis-Bellmunt, Oriol; Sumper, Andreas; Rull-Duran, Joan [Univ. Politecnica de Catalunya, Barcelona (ES). Centre d' Innovacio Tecnologica en Convertidors Estatics i Accionaments (CITCEA-UPC)

2009-07-01

Wind power constitutes one of the more viable alternatives to conventional power generation technology. In the previous years, wind power penetration on electric grids has grown notably, and has brought several new issues related to its integration into power grids. Flexible AC Transmission Systems (FACTS) installed in the right place and controlled conveniently are able to mitigate and solve many of these issues. In the present work, a STATCOM and a SSSC are used coordinately to fully support an electric grid. Simulations include normal and fault operation. (orig.)

Hybrid AC-High Voltage DC Grid Stability and Controls

Science.gov (United States)

Yu, Jicheng

The growth of energy demands in recent years has been increasing faster than the expansion of transmission facility construction. This tendency cooperating with the continuous investing on the renewable energy resources drives the research, development, and construction of HVDC projects to create a more reliable, affordable, and environmentally friendly power grid. Constructing the hybrid AC-HVDC grid is a significant move in the development of the HVDC techniques; the form of dc system is evolving from the point-to-point stand-alone dc links to the embedded HVDC system and the multi-terminal HVDC (MTDC) system. The MTDC is a solution for the renewable energy interconnections, and the MTDC grids can improve the power system reliability, flexibility in economic dispatches, and converter/cable utilizing efficiencies. The dissertation reviews the HVDC technologies, discusses the stability issues regarding the ac and HVDC connections, proposes a novel power oscillation control strategy to improve system stability, and develops a nonlinear voltage droop control strategy for the MTDC grid. To verify the effectiveness the proposed power oscillation control strategy, a long distance paralleled AC-HVDC transmission test system is employed. Based on the PSCAD/EMTDC platform simulation results, the proposed power oscillation control strategy can improve the system dynamic performance and attenuate the power oscillations effectively. To validate the nonlinear voltage droop control strategy, three droop controls schemes are designed according to the proposed nonlinear voltage droop control design procedures. These control schemes are tested in a hybrid AC-MTDC system. The hybrid AC-MTDC system, which is first proposed in this dissertation, consists of two ac grids, two wind farms and a five-terminal HVDC grid connecting them. Simulation studies are performed in the PSCAD/EMTDC platform. According to the simulation results, all the three design schemes have their unique salient

Internally connected graphs and the Kashiwara-Vergne Lie algebra

Science.gov (United States)

Felder, Matteo

2018-02-01

It is conjectured that the Kashiwara-Vergne Lie algebra \\widehat{krv}_2 is isomorphic to the direct sum of the Grothendieck-Teichmüller Lie algebra grt_1 and a one-dimensional Lie algebra. In this paper, we use the graph complex of internally connected graphs to define a nested sequence of Lie subalgebras of \\widehat{krv}_2 whose intersection is grt_1 , thus giving a way to interpolate between these two Lie algebras.

Lie-Algebras. Pt. 1

International Nuclear Information System (INIS)

Baeuerle, G.G.A.; Kerf, E.A. de

1990-01-01

The structure of the laws in physics is largely based on symmetries. This book is on Lie algebras, the mathematics of symmetry. It gives a thorough mathematical treatment of finite dimensional Lie algebras and Kac-Moody algebras. Concepts such as Cartan matrix, root system, Serre's construction are carefully introduced. Although the book can be read by an undergraduate with only an elementary knowledge of linear algebra, the book will also be of use to the experienced researcher. Experience has shown that students who followed the lectures are well-prepared to take on research in the realms of string-theory, conformal field-theory and integrable systems. 48 refs.; 66 figs.; 3 tabs

caGrid 1.0: a Grid enterprise architecture for cancer research.

Science.gov (United States)

Oster, Scott; Langella, Stephen; Hastings, Shannon; Ervin, David; Madduri, Ravi; Kurc, Tahsin; Siebenlist, Frank; Covitz, Peter; Shanbhag, Krishnakant; Foster, Ian; Saltz, Joel

2007-10-11

caGrid is the core Grid architecture of the NCI-sponsored cancer Biomedical Informatics Grid (caBIG) program. The current release, caGrid version 1.0, is developed as the production Grid software infrastructure of caBIG. Based on feedback from adopters of the previous version (caGrid 0.5), it has been significantly enhanced with new features and improvements to existing components. This paper presents an overview of caGrid 1.0, its main components, and enhancements over caGrid 0.5.

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.

A conceptual design of multidisciplinary-integrated C.F.D. simulation on parallel computers

International Nuclear Information System (INIS)

Onishi, Ryoichi; Ohta, Takashi; Kimura, Toshiya.

1996-11-01

A design of a parallel aeroelastic code for aircraft integrated simulations is conducted. The method for integrating aerodynamics and structural dynamics software on parallel computers is devised by using the Euler/Navier-Stokes equations coupled with wing-box finite element structures. A synthesis of modern aircraft requires the optimizations of aerodynamics, structures, controls, operabilities, or other design disciplines, and the R and D efforts to implement Multidisciplinary Design Optimization environments using high performance computers are made especially among the U.S. aerospace industries. This report describes a Multiple Program Multiple Data (MPMD) parallelization of aerodynamics and structural dynamics codes with a dynamic deformation grid. A three-dimensional computation of a flowfield with dynamic deformation caused by a structural deformation is performed, and a pressure data calculated is used for a computation of the structural deformation which is input again to a fluid dynamics code. This process is repeated exchanging the computed data of pressures and deformations between flowfield grids and structural elements. It enables to simulate the structure movements which take into account of the interaction of fluid and structure. The conceptual design for achieving the aforementioned various functions is reported. Also the future extensions to incorporate control systems, which enable to simulate a realistic aircraft configuration to be a major tool for Aircraft Integrated Simulation, are investigated. (author)

Preschoolers' Understanding of Lies and Innocent and Negligent Mistakes.

Science.gov (United States)

Siegal, Michael; Peterson, Candida C.

1998-01-01

Examined preschoolers' ability to distinguish innocent and negligent mistakes from lies. Found that, when asked to identify a mistake or lie about a food's contact with contaminants and identify a bystander's reaction, children distinguished mistakes from lies; they could also discriminate between lies and both negligent mistakes that generate…

Parallel Implementation of the Discrete Green's Function Formulation of the FDTD Method on a Multicore Central Processing Unit

Directory of Open Access Journals (Sweden)

T. Stefański

2014-12-01

Full Text Available Parallel implementation of the discrete Green's function formulation of the finite-difference time-domain (DGF-FDTD method was developed on a multicore central processing unit. DGF-FDTD avoids computations of the electromagnetic field in free-space cells and does not require domain termination by absorbing boundary conditions. Computed DGF-FDTD solutions are compatible with the FDTD grid enabling the perfect hybridization of FDTD with the use of time-domain integral equation methods. The developed implementation can be applied to simulations of antenna characteristics. For the sake of example, arrays of Yagi-Uda antennas were simulated with the use of parallel DGF-FDTD. The efficiency of parallel computations was investigated as a function of the number of current elements in the FDTD grid. Although the developed method does not apply the fast Fourier transform for convolution computations, advantages stemming from the application of DGF-FDTD instead of FDTD can be demonstrated for one-dimensional wire antennas when simulation results are post-processed by the near-to-far-field transformation.

Load-balancing techniques for a parallel electromagnetic particle-in-cell code

Energy Technology Data Exchange (ETDEWEB)

PLIMPTON,STEVEN J.; SEIDEL,DAVID B.; PASIK,MICHAEL F.; COATS,REBECCA S.

2000-01-01

QUICKSILVER is a 3-d electromagnetic particle-in-cell simulation code developed and used at Sandia to model relativistic charged particle transport. It models the time-response of electromagnetic fields and low-density-plasmas in a self-consistent manner: the fields push the plasma particles and the plasma current modifies the fields. Through an LDRD project a new parallel version of QUICKSILVER was created to enable large-scale plasma simulations to be run on massively-parallel distributed-memory supercomputers with thousands of processors, such as the Intel Tflops and DEC CPlant machines at Sandia. The new parallel code implements nearly all the features of the original serial QUICKSILVER and can be run on any platform which supports the message-passing interface (MPI) standard as well as on single-processor workstations. This report describes basic strategies useful for parallelizing and load-balancing particle-in-cell codes, outlines the parallel algorithms used in this implementation, and provides a summary of the modifications made to QUICKSILVER. It also highlights a series of benchmark simulations which have been run with the new code that illustrate its performance and parallel efficiency. These calculations have up to a billion grid cells and particles and were run on thousands of processors. This report also serves as a user manual for people wishing to run parallel QUICKSILVER.

Load-balancing techniques for a parallel electromagnetic particle-in-cell code

International Nuclear Information System (INIS)

Plimpton, Steven J.; Seidel, David B.; Pasik, Michael F.; Coats, Rebecca S.

2000-01-01

QUICKSILVER is a 3-d electromagnetic particle-in-cell simulation code developed and used at Sandia to model relativistic charged particle transport. It models the time-response of electromagnetic fields and low-density-plasmas in a self-consistent manner: the fields push the plasma particles and the plasma current modifies the fields. Through an LDRD project a new parallel version of QUICKSILVER was created to enable large-scale plasma simulations to be run on massively-parallel distributed-memory supercomputers with thousands of processors, such as the Intel Tflops and DEC CPlant machines at Sandia. The new parallel code implements nearly all the features of the original serial QUICKSILVER and can be run on any platform which supports the message-passing interface (MPI) standard as well as on single-processor workstations. This report describes basic strategies useful for parallelizing and load-balancing particle-in-cell codes, outlines the parallel algorithms used in this implementation, and provides a summary of the modifications made to QUICKSILVER. It also highlights a series of benchmark simulations which have been run with the new code that illustrate its performance and parallel efficiency. These calculations have up to a billion grid cells and particles and were run on thousands of processors. This report also serves as a user manual for people wishing to run parallel QUICKSILVER

Parallel heat transport in integrable and chaotic magnetic fields

Energy Technology Data Exchange (ETDEWEB)

Castillo-Negrete, D. del; Chacon, L. [Oak Ridge National Laboratory, Oak Ridge, Tennessee 37831-8071 (United States)

2012-05-15

The study of transport in magnetized plasmas is a problem of fundamental interest in controlled fusion, space plasmas, and astrophysics research. Three issues make this problem particularly challenging: (i) The extreme anisotropy between the parallel (i.e., along the magnetic field), {chi}{sub ||} , and the perpendicular, {chi}{sub Up-Tack }, conductivities ({chi}{sub ||} /{chi}{sub Up-Tack} may exceed 10{sup 10} in fusion plasmas); (ii) Nonlocal parallel transport in the limit of small collisionality; and (iii) Magnetic field lines chaos which in general complicates (and may preclude) the construction of magnetic field line coordinates. Motivated by these issues, we present a Lagrangian Green's function method to solve the local and non-local parallel transport equation applicable to integrable and chaotic magnetic fields in arbitrary geometry. The method avoids by construction the numerical pollution issues of grid-based algorithms. The potential of the approach is demonstrated with nontrivial applications to integrable (magnetic island), weakly chaotic (Devil's staircase), and fully chaotic magnetic field configurations. For the latter, numerical solutions of the parallel heat transport equation show that the effective radial transport, with local and non-local parallel closures, is non-diffusive, thus casting doubts on the applicability of quasilinear diffusion descriptions. General conditions for the existence of non-diffusive, multivalued flux-gradient relations in the temperature evolution are derived.

Internally connected graphs and the Kashiwara-Vergne Lie algebra

OpenAIRE

Felder, Matteo

2016-01-01

It is conjectured that the Kashiwara-Vergne Lie algebra $\\widehat{\\mathfrak{krv}}_2$ is isomorphic to the direct sum of the Grothendieck-Teichm\\"uller Lie algebra $\\mathfrak{grt}_1$ and a one-dimensional Lie algebra. In this paper, we use the graph complex of internally connected graphs to define a nested sequence of Lie subalgebras of $\\widehat{\\mathfrak{krv}}_2$ whose intersection is $\\mathfrak{grt}_1$, thus giving a way to interpolate between these two Lie algebras.

Legitimate lies : The relationship between omission, commission, and cheating

NARCIS (Netherlands)

Pittarello, Andrea; Rubaltelli, Enrico; Motro, Daphna

Across four experiments, we show that when people can serve their self-interest, they are more likely to refrain from reporting the truth ( lie of omission) than actively lie ( lie of commission). We developed a novel online "Heads or Tails" task in which participants can lie to win a monetary

Parallel Directionally Split Solver Based on Reformulation of Pipelined Thomas Algorithm

Science.gov (United States)

Povitsky, A.

1998-01-01

In this research an efficient parallel algorithm for 3-D directionally split problems is developed. The proposed algorithm is based on a reformulated version of the pipelined Thomas algorithm that starts the backward step computations immediately after the completion of the forward step computations for the first portion of lines This algorithm has data available for other computational tasks while processors are idle from the Thomas algorithm. The proposed 3-D directionally split solver is based on the static scheduling of processors where local and non-local, data-dependent and data-independent computations are scheduled while processors are idle. A theoretical model of parallelization efficiency is used to define optimal parameters of the algorithm, to show an asymptotic parallelization penalty and to obtain an optimal cover of a global domain with subdomains. It is shown by computational experiments and by the theoretical model that the proposed algorithm reduces the parallelization penalty about two times over the basic algorithm for the range of the number of processors (subdomains) considered and the number of grid nodes per subdomain.

Parallel spatial direct numerical simulations on the Intel iPSC/860 hypercube

Science.gov (United States)

Joslin, Ronald D.; Zubair, Mohammad

1993-01-01

The implementation and performance of a parallel spatial direct numerical simulation (PSDNS) approach on the Intel iPSC/860 hypercube is documented. The direct numerical simulation approach is used to compute spatially evolving disturbances associated with the laminar-to-turbulent transition in boundary-layer flows. The feasibility of using the PSDNS on the hypercube to perform transition studies is examined. The results indicate that the direct numerical simulation approach can effectively be parallelized on a distributed-memory parallel machine. By increasing the number of processors nearly ideal linear speedups are achieved with nonoptimized routines; slower than linear speedups are achieved with optimized (machine dependent library) routines. This slower than linear speedup results because the Fast Fourier Transform (FFT) routine dominates the computational cost and because the routine indicates less than ideal speedups. However with the machine-dependent routines the total computational cost decreases by a factor of 4 to 5 compared with standard FORTRAN routines. The computational cost increases linearly with spanwise wall-normal and streamwise grid refinements. The hypercube with 32 processors was estimated to require approximately twice the amount of Cray supercomputer single processor time to complete a comparable simulation; however it is estimated that a subgrid-scale model which reduces the required number of grid points and becomes a large-eddy simulation (PSLES) would reduce the computational cost and memory requirements by a factor of 10 over the PSDNS. This PSLES implementation would enable transition simulations on the hypercube at a reasonable computational cost.

A sparse grid based method for generative dimensionality reduction of high-dimensional data

Science.gov (United States)

Bohn, Bastian; Garcke, Jochen; Griebel, Michael

2016-03-01

Generative dimensionality reduction methods play an important role in machine learning applications because they construct an explicit mapping from a low-dimensional space to the high-dimensional data space. We discuss a general framework to describe generative dimensionality reduction methods, where the main focus lies on a regularized principal manifold learning variant. Since most generative dimensionality reduction algorithms exploit the representer theorem for reproducing kernel Hilbert spaces, their computational costs grow at least quadratically in the number n of data. Instead, we introduce a grid-based discretization approach which automatically scales just linearly in n. To circumvent the curse of dimensionality of full tensor product grids, we use the concept of sparse grids. Furthermore, in real-world applications, some embedding directions are usually more important than others and it is reasonable to refine the underlying discretization space only in these directions. To this end, we employ a dimension-adaptive algorithm which is based on the ANOVA (analysis of variance) decomposition of a function. In particular, the reconstruction error is used to measure the quality of an embedding. As an application, the study of large simulation data from an engineering application in the automotive industry (car crash simulation) is performed.

Ombud’s Corner: a world without lies?

CERN Multimedia

Sudeshna Datta-Cockerill

2016-01-01

Can a world without lies exist? Are there different types of lies, some more acceptable than others, or is that just an excuse that we use to justify ourselves? What consequences do lies have in the working environment?    If we look in the dictionary for the definition of “lie”, we find: “A lie is a false statement made with deliberate intent to deceive”. This simple definition turns out to be very useful when we feel stuck in intricate conflict situations where we suspect lies to have played a role. Examples may include supervisors presenting a situation in different ways to different colleagues; colleagues withholding information that could be useful to others; reports given in a non-accurate way; and rumours that spread around but cannot be verified. Peter was very keen to lead a particular project. He spoke to his supervisor Philippe who told him that he had in fact already proposed him to the board. When he did not get the job, Peter shared h...

Elementary construction of graded lie groups

International Nuclear Information System (INIS)

Scheunert, M.; Rittenberg, V.

1977-06-01

We show how the definitions of the classical Lie groups have to be modified in the case where Grassmann variables are present. In particular, we construct the general linear, the special linear and the orthosymplectic graded Lie groups. Special attention is paid to the question of how to formulate an adequate 'unitarity condition'. (orig.) [de

Cartan calculus on quantum Lie algebras

International Nuclear Information System (INIS)

Schupp, P.; Watts, P.; Zumino, B.

1993-01-01

A generalization of the differential geometry of forms and vector fields to the case of quantum Lie algebras is given. In an abstract formulation that incorporates many existing examples of differential geometry on quantum spaces we combine an exterior derivative, inner derivations, Lie derivatives, forms and functions au into one big algebra, the ''Cartan Calculus.''

改造喷气织机开发四纱并列起格弹力格子布%RECONSTRUCTION JET LOOMS FOR THE DEVELOPMENT OF FOUR PARALLEL YARN GRID ELASTIC PLAID

Institute of Scientific and Technical Information of China (English)

陈声富

2016-01-01

Developed four-parallel-yarn grid elastic plaid by double beam weaving transformation in JAT-190TNT-T610 model Toyota four-jet looms. Product has clear cell type and fabric fullness. Its style and quality is compliance with the requirements of the market, which has become a highlight in market selling varieties.%通过双经轴织造改造，在JAT-190TNT-T610型日本丰田喷气织机上开发的四纱并列起格的弹力格子布，格型清晰，布面丰满，风格和质量完全符合市场要求。

Development of a new dynamic turbulent model, applications to two-dimensional and plane parallel flows

International Nuclear Information System (INIS)

Laval, Jean Philippe

1999-01-01

We developed a turbulent model based on asymptotic development of the Navier-Stokes equations within the hypothesis of non-local interactions at small scales. This model provides expressions of the turbulent Reynolds sub-grid stresses via estimates of the sub-grid velocities rather than velocities correlations as is usually done. The model involves the coupling of two dynamical equations: one for the resolved scales of motions, which depends upon the Reynolds stresses generated by the sub-grid motions, and one for the sub-grid scales of motions, which can be used to compute the sub-grid Reynolds stresses. The non-locality of interaction at sub-grid scales allows to model their evolution with a linear inhomogeneous equation where the forcing occurs via the energy cascade from resolved to sub-grid scales. This model was solved using a decomposition of sub-grid scales on Gabor's modes and implemented numerically in 2D with periodic boundary conditions. A particles method (PIC) was used to compute the sub-grid scales. The results were compared with results of direct simulations for several typical flows. The model was also applied to plane parallel flows. An analytical study of the equations allows a description of mean velocity profiles in agreement with experimental results and theoretical results based on the symmetries of the Navier-Stokes equation. Possible applications and improvements of the model are discussed in the conclusion. (author) [fr

Low-dimensional filiform Lie algebras over finite fields

OpenAIRE

Falcón Ganfornina, Óscar Jesús; Núñez Valdés, Juan; Pacheco Martínez, Ana María; Villar Liñán, María Trinidad; Vasek, Vladimir (Coordinador); Shmaliy, Yuriy S. (Coordinador); Trcek, Denis (Coordinador); Kobayashi, Nobuhiko P. (Coordinador); Choras, Ryszard S. (Coordinador); Klos, Zbigniew (Coordinador)

2011-01-01

In this paper we use some objects of Graph Theory to classify low-dimensional filiform Lie algebras over finite fields. The idea lies in the representation of each Lie algebra by a certain type of graphs. Then, some properties on Graph Theory make easier to classify the algebras. As results, which can be applied in several branches of Physics or Engineering, for instance, we find out that there exist, up to isomorphism, six 6-dimensional filiform Lie algebras over Z/pZ, for p = 2, 3, 5. Pl...

Expansion of the Lie algebra and its applications

International Nuclear Information System (INIS)

Guo Fukui; Zhang Yufeng

2006-01-01

We take the Lie algebra A1 as an example to illustrate a detail approach for expanding a finite dimensional Lie algebra into a higher-dimensional one. By making use of the late and its resulting loop algebra, a few linear isospectral problems with multi-component potential functions are established. It follows from them that some new integrable hierarchies of soliton equations are worked out. In addition, various Lie algebras may be constructed for which the integrable couplings of soliton equations are obtained by employing the expanding technique of the the Lie algebras

A novel capacitive micro-accelerometer with grid strip capacitances and sensing gap alterable capacitances

International Nuclear Information System (INIS)

Dong Linxi; Chen Jindan; Huo Weihong; Li Yongjie; Sun Lingling; Yan Haixia

2009-01-01

The comb capacitances fabricated by deep reactive ion etching (RIE) process have high aspect ratio which is usually smaller than 30: 1 for the complicated process factors, and the combs are usually not parallel due to the well-known micro-loading effect and other process factors, which restricts the increase of the seismic mass by increasing the thickness of comb to reduce the thermal mechanical noise and the decrease of the gap of the comb capacitances for increasing the sensitive capacitance to reduce the electrical noise. Aiming at the disadvantage of the deep RIE, a novel capacitive micro-accelerometer with grid strip capacitances and sensing gap alterable capacitances is developed. One part of sensing of inertial signal of the micro-accelerometer is by the grid strip capacitances whose overlapping area is variable and which do not have the non-parallel plate's effect caused by the deep RIE process. Another part is by the sensing gap alterable capacitances whose gap between combs can be reduced by the actuators. The designed initial gap of the alterable comb capacitances is relatively large to depress the effect of the maximum aspect ratio (30 : 1) of deep RIE process. The initial gap of the capacitance of the actuator is smaller than the one of the comb capacitances. The difference between the two gaps is the initial gap of the sensitive capacitor. The designed structure depresses greatly the requirement of deep RIE process. The effects of non-parallel combs on the accelerometer are also analyzed. The characteristics of the micro-accelerometer are discussed by field emission microscopy (FEM) tool ANSYS. The tested devices based on slide-film damping effect are fabricated, and the tested quality factor is 514, which shows that grid strip capacitance design can partly improve the resolution and also prove the feasibility of the designed silicon-glass anodically bonding process.

White Lies in Hand: Are Other-Oriented Lies Modified by Hand Gestures? Possibly Not

Directory of Open Access Journals (Sweden)

Katarzyna Cantarero

2017-06-01

Full Text Available Previous studies have shown that the hand-over-heart gesture is related to being more honest as opposed to using self-centered dishonesty. We assumed that the hand-over-heart gesture would also relate to other-oriented dishonesty, though the latter differs highly from self-centered lying. In Study 1 (N = 79, we showed that performing a hand-over-heart gesture diminished the tendency to use other-oriented white lies and that the fingers crossed behind one’s back gesture was not related to higher dishonesty. We then pre-registered and conducted Study 2 (N = 88, which was designed following higher methodological standards than Study 1. Contrary, to the findings of Study 1, we found that using the hand-over-heart gesture did not result in refraining from using other-oriented white lies. We discuss the findings of this failed replication indicating the importance of strict methodological guidelines in conducting research and also reflect on relatively small effect sizes related to some findings in embodied cognition.

Gridded Species Distribution, Version 1: Global Amphibians Presence Grids

Data.gov (United States)

National Aeronautics and Space Administration — The Global Amphibians Presence Grids of the Gridded Species Distribution, Version 1 is a reclassified version of the original grids of amphibian species distribution...

On an infinite-dimensional Lie algebra of Virasoro-type

International Nuclear Information System (INIS)

Pei Yufeng; Bai Chengming

2012-01-01

In this paper, we study an infinite-dimensional Lie algebra of Virasoro-type which is realized as an affinization of a two-dimensional Novikov algebra. It is a special deformation of the Lie algebra of differential operators on a circle of order at most 1. There is an explicit construction of a vertex algebra associated with the Lie algebra. We determine all derivations of this Lie algebra in terms of some derivations and centroids of the corresponding Novikov algebra. The universal central extension of this Lie algebra is also determined. (paper)

Ternary q-Virasoro-Witt Hom-Nambu-Lie algebras

International Nuclear Information System (INIS)

Ammar, F; Makhlouf, A; Silvestrov, S

2010-01-01

In this paper we construct ternary q-Virasoro-Witt algebras which q-deform the ternary Virasoro-Witt algebras constructed by Curtright, Fairlie and Zachos using su(1, 1) enveloping algebra techniques. The ternary Virasoro-Witt algebras constructed by Curtright, Fairlie and Zachos depend on a parameter and are not Nambu-Lie algebras for all but finitely many values of this parameter. For the parameter values for which the ternary Virasoro-Witt algebras are Nambu-Lie, the corresponding ternary q-Virasoro-Witt algebras constructed in this paper are also Hom-Nambu-Lie because they are obtained from the ternary Nambu-Lie algebras using the composition method. For other parameter values this composition method does not yield a Hom-Nambu-Lie algebra structure for q-Virasoro-Witt algebras. We show however, using a different construction, that the ternary Virasoro-Witt algebras of Curtright, Fairlie and Zachos, as well as the general ternary q-Virasoro-Witt algebras we construct, carry a structure of the ternary Hom-Nambu-Lie algebra for all values of the involved parameters.

Chimera Grid Tools

Science.gov (United States)

Chan, William M.; Rogers, Stuart E.; Nash, Steven M.; Buning, Pieter G.; Meakin, Robert

2005-01-01

Chimera Grid Tools (CGT) is a software package for performing computational fluid dynamics (CFD) analysis utilizing the Chimera-overset-grid method. For modeling flows with viscosity about geometrically complex bodies in relative motion, the Chimera-overset-grid method is among the most computationally cost-effective methods for obtaining accurate aerodynamic results. CGT contains a large collection of tools for generating overset grids, preparing inputs for computer programs that solve equations of flow on the grids, and post-processing of flow-solution data. The tools in CGT include grid editing tools, surface-grid-generation tools, volume-grid-generation tools, utility scripts, configuration scripts, and tools for post-processing (including generation of animated images of flows and calculating forces and moments exerted on affected bodies). One of the tools, denoted OVERGRID, is a graphical user interface (GUI) that serves to visualize the grids and flow solutions and provides central access to many other tools. The GUI facilitates the generation of grids for a new flow-field configuration. Scripts that follow the grid generation process can then be constructed to mostly automate grid generation for similar configurations. CGT is designed for use in conjunction with a computer-aided-design program that provides the geometry description of the bodies, and a flow-solver program.

Constraint-plane-based synthesis and topology variation of a class of metamorphic parallel mechanisms

International Nuclear Information System (INIS)

Gan, Dongming; Dias, Jorge; Seneviratne, Lakmal; Dai, Jian S.

2014-01-01

This paper investigates various topologies and mobility of a class of metamorphic parallel mechanisms synthesized with reconfigurable rTPS limbs. Based on the reconfigurable Hooke (rT) joint, the rTPS limb has two phases which result in parallel mechanisms having ability of mobility change. While in one phase the limb has no constraint to the platform, in the other it constrains the spherical joint center to lie on a plane which is used to demonstrate different topologies of the nrTPS metamorphic parallel mechanisms by investigating various relations (parallel or intersecting) among the n constraint planes (n = 2,3,..,6). Geometric constraint equations of the platform rotation matrix and translation vector are set up based on the point-plane constraint, which reveals mobility and redundant geometric conditions of the mechanism topologies. By altering the limbs into the non-constraint phase without constraint plane, new mechanism phases are deduced with mobility change based on each mechanism topology.

Stability analysis of grid inverter LCL-filter resonance in wind or photovoltaic parks

DEFF Research Database (Denmark)

Arcuri, S.; Liserre, M.; Ricchiuto, D.

2011-01-01

Typically the resonance problems related to the use of LCL-filters in grid connected inverters are analyzed assuming the operation of a single inverter. Wind and photovoltaic parks may experience propagation of resonance from a poorly damped inverter to other systems connected in parallel....... The paper focuses on the study of the resonance at a park system level with simulations and experimental results....

Quartic trace identity for exceptional Lie algebras

International Nuclear Information System (INIS)

Okubo, S.

1979-01-01

Let X be a representation matrix of generic element x of a simple Lie algebra in generic irreducible representation ]lambda] of the Lie algebra. Then, for all exceptional Lie algebras as well as A 1 and A 2 , we can prove the validity of a quartic trace identity Tr(X 4 ) =K (lambda)[Tr(X 2 )] 2 , where the constant K (lambda) depends only upon the irreducible representation ]lambda], and its explicit form is calculated. Some applications of second and fourth order indices have also been discussed

Grid: From EGEE to EGI and from INFN-Grid to IGI

International Nuclear Information System (INIS)

Giselli, A.; Mazzuccato, M.

2009-01-01

In the last fifteen years the approach of the computational Grid has changed the way to use computing resources. Grid computing has raised interest worldwide in academia, industry, and government with fast development cycles. Great efforts, huge funding and resources have been made available through national, regional and international initiatives aiming at providing Grid infrastructures, Grid core technologies, Grid middle ware and Grid applications. The Grid software layers reflect the architecture of the services developed so far by the most important European and international projects. In this paper Grid e-Infrastructure story is given, detailing European, Italian and international projects such as EGEE, INFN-Grid and NAREGI. In addition the sustainability issue in the long-term perspective is described providing plans by European and Italian communities with EGI and IGI.

Optimization and validation of accelerated golden-angle radial sparse MRI reconstruction with self-calibrating GRAPPA operator gridding.

Science.gov (United States)

Benkert, Thomas; Tian, Ye; Huang, Chenchan; DiBella, Edward V R; Chandarana, Hersh; Feng, Li

2018-07-01

Golden-angle radial sparse parallel (GRASP) MRI reconstruction requires gridding and regridding to transform data between radial and Cartesian k-space. These operations are repeatedly performed in each iteration, which makes the reconstruction computationally demanding. This work aimed to accelerate GRASP reconstruction using self-calibrating GRAPPA operator gridding (GROG) and to validate its performance in clinical imaging. GROG is an alternative gridding approach based on parallel imaging, in which k-space data acquired on a non-Cartesian grid are shifted onto a Cartesian k-space grid using information from multicoil arrays. For iterative non-Cartesian image reconstruction, GROG is performed only once as a preprocessing step. Therefore, the subsequent iterative reconstruction can be performed directly in Cartesian space, which significantly reduces computational burden. Here, a framework combining GROG with GRASP (GROG-GRASP) is first optimized and then compared with standard GRASP reconstruction in 22 prostate patients. GROG-GRASP achieved approximately 4.2-fold reduction in reconstruction time compared with GRASP (∼333 min versus ∼78 min) while maintaining image quality (structural similarity index ≈ 0.97 and root mean square error ≈ 0.007). Visual image quality assessment by two experienced radiologists did not show significant differences between the two reconstruction schemes. With a graphics processing unit implementation, image reconstruction time can be further reduced to approximately 14 min. The GRASP reconstruction can be substantially accelerated using GROG. This framework is promising toward broader clinical application of GRASP and other iterative non-Cartesian reconstruction methods. Magn Reson Med 80:286-293, 2018. © 2017 International Society for Magnetic Resonance in Medicine. © 2017 International Society for Magnetic Resonance in Medicine.

From the grid to the smart grid, topologically

Science.gov (United States)

Pagani, Giuliano Andrea; Aiello, Marco

2016-05-01

In its more visionary acceptation, the smart grid is a model of energy management in which the users are engaged in producing energy as well as consuming it, while having information systems fully aware of the energy demand-response of the network and of dynamically varying prices. A natural question is then: to make the smart grid a reality will the distribution grid have to be upgraded? We assume a positive answer to the question and we consider the lower layers of medium and low voltage to be the most affected by the change. In our previous work, we analyzed samples of the Dutch distribution grid (Pagani and Aiello, 2011) and we considered possible evolutions of these using synthetic topologies modeled after studies of complex systems in other technological domains (Pagani and Aiello, 2014). In this paper, we take an extra important step by defining a methodology for evolving any existing physical power grid to a good smart grid model, thus laying the foundations for a decision support system for utilities and governmental organizations. In doing so, we consider several possible evolution strategies and apply them to the Dutch distribution grid. We show how increasing connectivity is beneficial in realizing more efficient and reliable networks. Our proposal is topological in nature, enhanced with economic considerations of the costs of such evolutions in terms of cabling expenses and economic benefits of evolving the grid.

Grid Generation Techniques Utilizing the Volume Grid Manipulator

Science.gov (United States)

Alter, Stephen J.

1998-01-01

This paper presents grid generation techniques available in the Volume Grid Manipulation (VGM) code. The VGM code is designed to manipulate existing line, surface and volume grids to improve the quality of the data. It embodies an easy to read rich language of commands that enables such alterations as topology changes, grid adaption and smoothing. Additionally, the VGM code can be used to construct simplified straight lines, splines, and conic sections which are common curves used in the generation and manipulation of points, lines, surfaces and volumes (i.e., grid data). These simple geometric curves are essential in the construction of domain discretizations for computational fluid dynamic simulations. By comparison to previously established methods of generating these curves interactively, the VGM code provides control of slope continuity and grid point-to-point stretchings as well as quick changes in the controlling parameters. The VGM code offers the capability to couple the generation of these geometries with an extensive manipulation methodology in a scripting language. The scripting language allows parametric studies of a vehicle geometry to be efficiently performed to evaluate favorable trends in the design process. As examples of the powerful capabilities of the VGM code, a wake flow field domain will be appended to an existing X33 Venturestar volume grid; negative volumes resulting from grid expansions to enable flow field capture on a simple geometry, will be corrected; and geometrical changes to a vehicle component of the X33 Venturestar will be shown.

Implementation of GPU parallel equilibrium reconstruction for plasma control in EAST

Energy Technology Data Exchange (ETDEWEB)

Huang, Yao, E-mail: yaohuang@ipp.ac.cn [Institute of Plasma Physics, Chinese Academy of Sciences, Hefei (China); Xiao, B.J. [Institute of Plasma Physics, Chinese Academy of Sciences, Hefei (China); School of Nuclear Science & Technology, University of Science & Technology of China (China); Luo, Z.P.; Yuan, Q.P.; Pei, X.F. [Institute of Plasma Physics, Chinese Academy of Sciences, Hefei (China); Yue, X.N. [School of Nuclear Science & Technology, University of Science & Technology of China (China)

2016-11-15

Highlights: • We described parallel equilibrium reconstruction code P-EFIT running on GPU was integrated with EAST plasma control system. • Compared with RT-EFIT used in EAST, P-EFIT has better spatial resolution and full algorithm of EFIT per iteration. • With the data interface through RFM, 65 × 65 spatial grids P-EFIT can satisfy the accuracy and time feasibility requirements for plasma control. • Successful control using ISOFLUX/P-EFIT was established in the dedicated experiment during the EAST 2014 campaign. • This work is a stepping-stone towards versatile ISOFLUX/P-EFIT control, such as real-time equilibrium reconstruction with more diagnostics. - Abstract: Implementation of P-EFIT code for plasma control in EAST is described. P-EFIT is based on the EFIT framework, but built with the CUDA™ architecture to take advantage of massively parallel Graphical Processing Unit (GPU) cores to significantly accelerate the computation. 65 × 65 grid size P-EFIT can complete one reconstruction iteration in 300 μs, with one iteration strategy, it can satisfy the needs of real-time plasma shape control. Data interface between P-EFIT and PCS is realized and developed by transferring data through RFM. First application of P-EFIT to discharge control in EAST is described.

The Grid

CERN Document Server

Klotz, Wolf-Dieter

2005-01-01

Grid technology is widely emerging. Grid computing, most simply stated, is distributed computing taken to the next evolutionary level. The goal is to create the illusion of a simple, robust yet large and powerful self managing virtual computer out of a large collection of connected heterogeneous systems sharing various combinations of resources. This talk will give a short history how, out of lessons learned from the Internet, the vision of Grids was born. Then the extensible anatomy of a Grid architecture will be discussed. The talk will end by presenting a selection of major Grid projects in Europe and US and if time permits a short on-line demonstration.

An Extended Design of the "Grid-Enabled SEE++ System" Based on Globus Toolkit 4 and gLite Conference

CERN Document Server

Schreiner, W.; Buchberger, M.; Kaltofen, T.

2006-01-01

"Grid-Enabled SEE++" based on the SEE++ software system for the biomechanical 3D simulation of the human eye and its muscles. SEE++ simulates the common eye muscle surgery techniques in a graphic interactive way that is familiar to an experienced surgeon. The goal of "Grid-Enabled SEE++" is to adapt and to extend SEE++ in several steps and to develop an efficient grid-based tool for "Evidence Based Medicine", which supports the surgeons in choosing optimal surgery techniques for the treatments of different syndromes of strabismus. In our previous work, we combined the SEE++ software with the Globus (pre-Web Service) middleware and developed a parallel version of the simulation of the "Hess-Lancaster test" (typical medical examination). By this, we demonstrated how a noticeable speedup can be achieved in SEE++ by the exploitation of the computational power of the Grid. Furthermore, we reported the prototype implementation of a medical database component for "Grid-Enabled SEE++". Finally, we designed a so calle...

A Parallel Sweeping Preconditioner for Heterogeneous 3D Helmholtz Equations

KAUST Repository

Poulson, Jack

2013-05-02

A parallelization of a sweeping preconditioner for three-dimensional Helmholtz equations without large cavities is introduced and benchmarked for several challenging velocity models. The setup and application costs of the sequential preconditioner are shown to be O(γ2N4/3) and O(γN logN), where γ(ω) denotes the modestly frequency-dependent number of grid points per perfectly matched layer. Several computational and memory improvements are introduced relative to using black-box sparse-direct solvers for the auxiliary problems, and competitive runtimes and iteration counts are reported for high-frequency problems distributed over thousands of cores. Two open-source packages are released along with this paper: Parallel Sweeping Preconditioner (PSP) and the underlying distributed multifrontal solver, Clique. © 2013 Society for Industrial and Applied Mathematics.

The International Symposium on Grids and Clouds and the Open Grid Forum

Science.gov (United States)

addressed while OGF exposed the state of current developments and issues to be resolved if commonalities are to be exploited. Another first is for the Proceedings for 2011, an open access online publishing scheme will ensure these Proceedings will appear more quickly and more people will have access to the results, providing a long-term online archive of the event. The symposium attracted more than 212 participants from 29 countries spanning Asia, Europe and the Americas. Coming so soon after the earthquake and tsunami in Japan, the participation of our Japanese colleagues was particularly appreciated. Keynotes by invited speakers highlighted the impact of distributed computing infrastructures in the social sciences and humanities, high energy physics, earth and life sciences. Plenary sessions entitled Grid Activities in Asia Pacific surveyed the state of grid deployment across 11 Asian countries. Through the parallel sessions, the impact of distributed computing infrastructures in a range of research disciplines was highlighted. Operational procedures, middleware and security aspects were addressed in a dedicated sessions. The symposium was covered online in real-time by the GridCast team from the GridTalk project. A running blog including summarises of specific sessions as well as video interviews with keynote speakers and personalities and photos. As with all regions of the world, grid and cloud computing has to be prove it is adding value to researchers if it is be accepted by them and demonstrate its impact on society as a while if it to be supported by national governments, funding agencies and the general public. ISGC has helped foster the emergence of a strong regional interest in the earth and life sciences, notably for natural disaster mitigation and bioinformatics studies. Prof. Simon C. Lin organised an intense social programme with a gastronomic tour of Taipei culminating with a banquet for all the symposium's participants at the hotel Palais de Chine. I would

Lie n-derivations on 7 -subspace lattice algebras

Indian Academy of Sciences (India)

all x ∈ K and all A ∈ Alg L. Based on this result, a complete characterization of linear n-Lie derivations on Alg L is obtained. Keywords. J -subspace lattice algebras; Lie derivations; Lie n-derivations; derivations. 2010 Mathematics Subject Classification. 47B47, 47L35. 1. Introduction. Let A be an algebra. Recall that a linear ...

A GRID solution for gravitational waves signal analysis from coalescing binaries: performances of test algorithms and further developments

International Nuclear Information System (INIS)

Acernese, A; Barone, F; Rosa, R De; Esposito, R; Frasca, S; Mastroserio, P; Milano, L; Palomba, C; Pardi, S; Qipiani, K; Ricci, F; Russo, G

2004-01-01

The analysis of data coming from interferometric antennas for gravitational wave detection requires a huge amount of computing power. The usual approach to the detection strategy is to set up computer farms able to perform several tasks in parallel, exchanging data through network links. In this paper a new computation strategy based on the GRID environment, is presented. The GRID environment allows several geographically distributed computing resources to exchange data and programs in a secure way, using standard infrastructures. The computing resources can be geographically distributed also on a large scale. Some preliminary tests were performed using a subnetwork of the GRID infrastructure, producing good results in terms of distribution efficiency and time duration

Poisson-Lie T-plurality

International Nuclear Information System (INIS)

Unge, Rikard von

2002-01-01

We extend the path-integral formalism for Poisson-Lie T-duality to include the case of Drinfeld doubles which can be decomposed into bi-algebras in more than one way. We give the correct shift of the dilaton, correcting a mistake in the literature. We then use the fact that the six dimensional Drinfeld doubles have been classified to write down all possible conformal Poisson-Lie T-duals of three dimensional space times and we explicitly work out two duals to the constant dilaton and zero anti-symmetric tensor Bianchi type V space time and show that they satisfy the string equations of motion. This space-time was previously thought to have no duals because of the tracefulness of the structure constants. (author)

Parallelized implicit propagators for the finite-difference Schrödinger equation

Science.gov (United States)

Parker, Jonathan; Taylor, K. T.

1995-08-01

We describe the application of block Gauss-Seidel and block Jacobi iterative methods to the design of implicit propagators for finite-difference models of the time-dependent Schrödinger equation. The block-wise iterative methods discussed here are mixed direct-iterative methods for solving simultaneous equations, in the sense that direct methods (e.g. LU decomposition) are used to invert certain block sub-matrices, and iterative methods are used to complete the solution. We describe parallel variants of the basic algorithm that are well suited to the medium- to coarse-grained parallelism of work-station clusters, and MIMD supercomputers, and we show that under a wide range of conditions, fine-grained parallelism of the computation can be achieved. Numerical tests are conducted on a typical one-electron atom Hamiltonian. The methods converge robustly to machine precision (15 significant figures), in some cases in as few as 6 or 7 iterations. The rate of convergence is nearly independent of the finite-difference grid-point separations.

QR-decomposition based SENSE reconstruction using parallel architecture.

Science.gov (United States)

Ullah, Irfan; Nisar, Habab; Raza, Haseeb; Qasim, Malik; Inam, Omair; Omer, Hammad

2018-04-01

Magnetic Resonance Imaging (MRI) is a powerful medical imaging technique that provides essential clinical information about the human body. One major limitation of MRI is its long scan time. Implementation of advance MRI algorithms on a parallel architecture (to exploit inherent parallelism) has a great potential to reduce the scan time. Sensitivity Encoding (SENSE) is a Parallel Magnetic Resonance Imaging (pMRI) algorithm that utilizes receiver coil sensitivities to reconstruct MR images from the acquired under-sampled k-space data. At the heart of SENSE lies inversion of a rectangular encoding matrix. This work presents a novel implementation of GPU based SENSE algorithm, which employs QR decomposition for the inversion of the rectangular encoding matrix. For a fair comparison, the performance of the proposed GPU based SENSE reconstruction is evaluated against single and multicore CPU using openMP. Several experiments against various acceleration factors (AFs) are performed using multichannel (8, 12 and 30) phantom and in-vivo human head and cardiac datasets. Experimental results show that GPU significantly reduces the computation time of SENSE reconstruction as compared to multi-core CPU (approximately 12x speedup) and single-core CPU (approximately 53x speedup) without any degradation in the quality of the reconstructed images. Copyright © 2018 Elsevier Ltd. All rights reserved.

Discovery of resources using MADM approaches for parallel and distributed computing

Directory of Open Access Journals (Sweden)

Mandeep Kaur

2017-06-01

Full Text Available Grid, a form of parallel and distributed computing, allows the sharing of data and computational resources among its users from various geographical locations. The grid resources are diverse in terms of their underlying attributes. The majority of the state-of-the-art resource discovery techniques rely on the static resource attributes during resource selection. However, the matching resources based on the static resource attributes may not be the most appropriate resources for the execution of user applications because they may have heavy job loads, less storage space or less working memory (RAM. Hence, there is a need to consider the current state of the resources in order to find the most suitable resources. In this paper, we have proposed a two-phased multi-attribute decision making (MADM approach for discovery of grid resources by using P2P formalism. The proposed approach considers multiple resource attributes for decision making of resource selection and provides the best suitable resource(s to grid users. The first phase describes a mechanism to discover all matching resources and applies SAW method to shortlist the top ranked resources, which are communicated to the requesting super-peer. The second phase of our proposed methodology applies integrated MADM approach (AHP enriched PROMETHEE-II on the list of selected resources received from different super-peers. The pairwise comparison of the resources with respect to their attributes is made and the rank of each resource is determined. The top ranked resource is then communicated to the grid user by the grid scheduler. Our proposed methodology enables the grid scheduler to allocate the most suitable resource to the user application and also reduces the search complexity by filtering out the less suitable resources during resource discovery.

A survey on stability and rigidity results for Lie algebras

NARCIS (Netherlands)

Crainic, Marius; Schätz, Florian; Struchiner, Ivan

2014-01-01

We give simple and unified proofs of the known stability and rigidity results for Lie algebras, Lie subalgebras and Lie algebra homomorphisms. Moreover, we investigate when a Lie algebra homomorphism is stable under all automorphisms of the codomain (including outer automorphisms).

Resonance propagation of parallel-operated DC-AC converters with LCL filters

DEFF Research Database (Denmark)

Lu, Xiaonan; Liserre, Marco; Sun, Kai

2012-01-01

filter has higher power density, its resonance problem should be noticed. In a large renewable energy farm, multiple converters inside are connected in parallel. In this way, the analysis of the resonance problem should be expanded. Compared to a conventional single LCL filter system, additional...... performance is also influenced. In this paper, the resonance propagation of parallel converter system with a local capacitor for reactive power compensation is analyzed in detail. Simulation and experiment results support the theoretical analyses.......With the higher penetration of renewable energy into modern power system, power electronics converters are most commonly employed as the interfaces to the grid. At the same time, to deal with high frequency harmonic components, LCL filters are usually adopted. Although compared to L-filters, LCL...

Modelling noise propagation using Grid Resources. Progress within GDI-Grid

Science.gov (United States)

Kiehle, Christian; Mayer, Christian; Padberg, Alexander; Stapelfeld, Hartmut

2010-05-01

Modelling noise propagation using Grid Resources. Progress within GDI-Grid. GDI-Grid (english: SDI-Grid) is a research project funded by the German Ministry for Science and Education (BMBF). It aims at bridging the gaps between OGC Web Services (OWS) and Grid infrastructures and identifying the potential of utilizing the superior storage capacities and computational power of grid infrastructures for geospatial applications while keeping the well-known service interfaces specified by the OGC. The project considers all major OGC webservice interfaces for Web Mapping (WMS), Feature access (Web Feature Service), Coverage access (Web Coverage Service) and processing (Web Processing Service). The major challenge within GDI-Grid is the harmonization of diverging standards as defined by standardization bodies for Grid computing and spatial information exchange. The project started in 2007 and will continue until June 2010. The concept for the gridification of OWS developed by lat/lon GmbH and the Department of Geography of the University of Bonn is applied to three real-world scenarios in order to check its practicability: a flood simulation, a scenario for emergency routing and a noise propagation simulation. The latter scenario is addressed by the Stapelfeldt Ingenieurgesellschaft mbH located in Dortmund adapting their LimA software to utilize grid resources. Noise mapping of e.g. traffic noise in urban agglomerates and along major trunk roads is a reoccurring demand of the EU Noise Directive. Input data requires road net and traffic, terrain, buildings and noise protection screens as well as population distribution. Noise impact levels are generally calculated in 10 m grid and along relevant building facades. For each receiver position sources within a typical range of 2000 m are split down into small segments, depending on local geometry. For each of the segments propagation analysis includes diffraction effects caused by all obstacles on the path of sound propagation

Representations of Lie algebras and partial differential equations

CERN Document Server

Xu, Xiaoping

2017-01-01

This book provides explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic codes, combinatorics and algebraic varieties, summarizing the author’s works and his joint works with his former students.  Further, it presents various oscillator generalizations of the classical representation theorem on harmonic polynomials, and highlights new functors from the representation category of a simple Lie algebra to that of another simple Lie algebra. Partial differential equations play a key role in solving certain representation problems. The weight matrices of the minimal and adjoint representations over the simple Lie algebras of types E and F are proved to generate ternary orthogonal linear codes with large minimal distances. New multi-variable hypergeometric functions related to the root systems of simple Lie algebras are introduced in connection with quantum many-body systems in one dimension. In addition, the book identifies certai...

A new class of infinite-dimensional Lie algebras: an analytical continuation of the arbitrary finite-dimensional semisimple Lie algebra

International Nuclear Information System (INIS)

Fradkin, E.S.; Linetsky, V.Ya.

1990-06-01

With any semisimple Lie algebra g we associate an infinite-dimensional Lie algebra AC(g) which is an analytic continuation of g from its root system to its root lattice. The manifest expressions for the structure constants of analytic continuations of the symplectic Lie algebras sp2 n are obtained by Poisson-bracket realizations method and AC(g) for g=sl n and so n are discussed. The representations, central extension, supersymmetric and higher spin generalizations are considered. The Virasoro theory is a particular case when g=sp 2 . (author). 9 refs

Some quantum Lie algebras of type Dn positive

International Nuclear Information System (INIS)

Bautista, Cesar; Juarez-Ramirez, Maria Araceli

2003-01-01

A quantum Lie algebra is constructed within the positive part of the Drinfeld-Jimbo quantum group of type D n . Our quantum Lie algebra structure includes a generalized antisymmetry property and a generalized Jacobi identity closely related to the braid equation. A generalized universal enveloping algebra of our quantum Lie algebra of type D n positive is proved to be the Drinfeld-Jimbo quantum group of the same type. The existence of such a generalized Lie algebra is reduced to an integer programming problem. Moreover, when the integer programming problem is feasible we show, by means of the generalized Jacobi identity, that the Poincare-Birkhoff-Witt theorem (basis) is still true

Lie transforms and their use in Hamiltonian perturbation theory

International Nuclear Information System (INIS)

Cary, J.R.

1978-06-01

A review is presented of the theory of Lie transforms as applied to Hamiltonian systems. We begin by presenting some general background on the Hamiltonian formalism and by introducing the operator notation for canonical transformations. We then derive the general theory of Lie transforms. We derive the formula for the new Hamiltonian when one uses a Lie transform to effect a canonical transformation, and we use Lie transforms to prove a very general version of Noether's theorem, or the symmetry-equals-invariant theorem. Next we use the general Lie transform theory to derive Deprit's perturbation theory. We illustrate this perturbation theory by application to two well-known problems in classical mechanics. Finally we present a chapter on conventions. There are many ways to develop Lie transforms. The last chapter explains the reasons for the choices made here

Smart grid security

Energy Technology Data Exchange (ETDEWEB)

Cuellar, Jorge (ed.) [Siemens AG, Muenchen (Germany). Corporate Technology

2013-11-01

The engineering, deployment and security of the future smart grid will be an enormous project requiring the consensus of many stakeholders with different views on the security and privacy requirements, not to mention methods and solutions. The fragmentation of research agendas and proposed approaches or solutions for securing the future smart grid becomes apparent observing the results from different projects, standards, committees, etc, in different countries. The different approaches and views of the papers in this collection also witness this fragmentation. This book contains the following papers: 1. IT Security Architecture Approaches for Smart Metering and Smart Grid. 2. Smart Grid Information Exchange - Securing the Smart Grid from the Ground. 3. A Tool Set for the Evaluation of Security and Reliability in Smart Grids. 4. A Holistic View of Security and Privacy Issues in Smart Grids. 5. Hardware Security for Device Authentication in the Smart Grid. 6. Maintaining Privacy in Data Rich Demand Response Applications. 7. Data Protection in a Cloud-Enabled Smart Grid. 8. Formal Analysis of a Privacy-Preserving Billing Protocol. 9. Privacy in Smart Metering Ecosystems. 10. Energy rate at home Leveraging ZigBee to Enable Smart Grid in Residential Environment.

A highly scalable massively parallel fast marching method for the Eikonal equation

Science.gov (United States)

Yang, Jianming; Stern, Frederick

2017-03-01

The fast marching method is a widely used numerical method for solving the Eikonal equation arising from a variety of scientific and engineering fields. It is long deemed inherently sequential and an efficient parallel algorithm applicable to large-scale practical applications is not available in the literature. In this study, we present a highly scalable massively parallel implementation of the fast marching method using a domain decomposition approach. Central to this algorithm is a novel restarted narrow band approach that coordinates the frequency of communications and the amount of computations extra to a sequential run for achieving an unprecedented parallel performance. Within each restart, the narrow band fast marching method is executed; simple synchronous local exchanges and global reductions are adopted for communicating updated data in the overlapping regions between neighboring subdomains and getting the latest front status, respectively. The independence of front characteristics is exploited through special data structures and augmented status tags to extract the masked parallelism within the fast marching method. The efficiency, flexibility, and applicability of the parallel algorithm are demonstrated through several examples. These problems are extensively tested on six grids with up to 1 billion points using different numbers of processes ranging from 1 to 65536. Remarkable parallel speedups are achieved using tens of thousands of processes. Detailed pseudo-codes for both the sequential and parallel algorithms are provided to illustrate the simplicity of the parallel implementation and its similarity to the sequential narrow band fast marching algorithm.

Development and application of a parallel finite volume method for flow simulation on unstructured grids with local refinement; Entwicklung und Anwendung eines parallelen Finite-Volumen-Verfahrens zur Stroemungssimulation auf unstrukturierten Gittern mit lokaler Verfeinerung

Energy Technology Data Exchange (ETDEWEB)

Seidl, V.

1997-11-01

A finite vomume method for calculation of steady and unsteady flow on unstructured grids is parallelized by local spatial and time decomposition. In the first case, a parallel variant of the conjugated gradient method with multiple local preconditioning is formulated and analyzed. The method is tested for simple applications (e.g. flow around a cylinder). The second part of the publication describes a direct numerical simulation of turbulent flow around a sphere at a Reynolds number of 5000 (based on flow velocity and sphere diameter). Current and Reynolds-averaged flow fields are discussed. Particular emphasis is placed on coordinate-independent representation of the anisotropy ratios of the Reynolds tensor and dissipation tensor. (orig.) [Deutsch] Ein Finite-Volumen-Verfahren fuer die Berechnung stationaerer und instationaerer Stroemungen auf unstrukturierten Netzen wird durch Gebietszerlegung im Raum und Zeit parallelisiert. Fuer die raeumliche Zerlegung wird eine parallele Variante der konjugierten Gradienten Methode mit mehrfacher, lokaler Vorkonditionierung formuliert und analysiert. Anhand einfacher Anwendungsbeispiele (Zylinderumstroemung, deckelgetriebene Nischenstroemung) wird das entwickelte Gesamtverfahren getestet und seine Effizienz bestimmt. Der zweite Teil der Arbeit beschreibt eine direkte numerische Simulation der turbulenten Kugelumstroemung bei einer Reynolds-Zahl von 5 000 (basierend auf Anstroemgeschwindigkeit und Kugeldurchmesser). In der Ergebnisauswertung werden augenblickliche und Reynolds-gemittelte Stroemungsfelder diskutiert und besonderer Wert auf eine koordinatenunabhaengige Darstellung der Anisotropieverhaeltnisse des Reynolds-Tensors und des Dissipationstensors gelegt. (orig.)