Synchronization Of Parallel Discrete Event Simulations
Steinman, Jeffrey S.
1992-01-01
Adaptive, parallel, discrete-event-simulation-synchronization algorithm, Breathing Time Buckets, developed in Synchronous Parallel Environment for Emulation and Discrete Event Simulation (SPEEDES) operating system. Algorithm allows parallel simulations to process events optimistically in fluctuating time cycles that naturally adapt while simulation in progress. Combines best of optimistic and conservative synchronization strategies while avoiding major disadvantages. Algorithm processes events optimistically in time cycles adapting while simulation in progress. Well suited for modeling communication networks, for large-scale war games, for simulated flights of aircraft, for simulations of computer equipment, for mathematical modeling, for interactive engineering simulations, and for depictions of flows of information.
International Nuclear Information System (INIS)
Yan Sen-Lin
2014-01-01
The parallel synchronization of three chaotic lasers is used to emulate optoelectronic logic NOR and XNOR gates via modulating the light and the current. We deduce a logical computational equation that governs the chaotic synchronization, logical input, and logical output. We construct fundamental gates based on the three chaotic lasers and define the computational principle depending on the parallel synchronization. The logic gate can be implemented by appropriately synchronizing two chaotic lasers. The system shows practicability and flexibility because it can emulate synchronously an XNOR gate, two NOR gates, and so on. The synchronization can still be deteceted when mismatches exist with a certain range. (general)
On synchronous parallel computations with independent probabilistic choice
International Nuclear Information System (INIS)
Reif, J.H.
1984-01-01
This paper introduces probabilistic choice to synchronous parallel machine models; in particular parallel RAMs. The power of probabilistic choice in parallel computations is illustrate by parallelizing some known probabilistic sequential algorithms. The authors characterize the computational complexity of time, space, and processor bounded probabilistic parallel RAMs in terms of the computational complexity of probabilistic sequential RAMs. They show that parallelism uniformly speeds up time bounded probabilistic sequential RAM computations by nearly a quadratic factor. They also show that probabilistic choice can be eliminated from parallel computations by introducing nonuniformity
Synchronization Techniques in Parallel Discrete Event Simulation
Lindén, Jonatan
2018-01-01
Discrete event simulation is an important tool for evaluating system models in many fields of science and engineering. To improve the performance of large-scale discrete event simulations, several techniques to parallelize discrete event simulation have been developed. In parallel discrete event simulation, the work of a single discrete event simulation is distributed over multiple processing elements. A key challenge in parallel discrete event simulation is to ensure that causally dependent ...
Synchronization control for ultrafast laser parallel microdrilling system
Zhai, Zhongsheng; Kuang, Zheng; Ouyang, Jinlei; Liu, Dun; Perrie, Walter; Edwardson, Stuart P.; Dearden, Geoff
2014-11-01
Ultrafast lasers, emitting ultra-short pulses of light, generally of the order of femtoseconds to ten picoseconds, are widely used in micro-processing with the advantage of very little thermal damage. Parallel micro-processing is seen significant developments in laser fabrication, thanking to the spatial light modulator (SLM) which can concert single beam to multiple beams through computer generate holograms (CGHs). However, without synchronization control, on the conditions of changing different holograms or processing on large area beyond scanning galvo's ability, the fabrication will be interrupted constantly for changing holograms and moving the stages. Therefore, synchronization control is very important to improve the convenience and application of parallel micro-processing. A synchronization control method, carried out through two application software: SAMLight (or WaveRunner) and Labview, is presented in this paper. SAMLight is used to control the laser and the scanning galvo to implement microprocessing, and the developed program with Labview is used to control the SLM and motion stages. The synchronization signals, transmitted between the two software, are utilized by a National Instruments (NI) device USB-6008. Using optimal control methods, the synchronized system can easily and automatically accomplish complicated fabrications with minimum time. A multi-drilling application is provided to verify the affectivity of the synchronized control method. It uses multiple annular beams, generated by superimposing multi-beam CGH onto a diffractive axicon CGH, to drill multiple holes at one time, and it can automatically finish different patterns based on synchronization control. This drilling way is an optical trepanning and it avoids huge laser energy waste with attenuation. The multi-beam CGHs, generated by the Grating and Lens algorithm, are different for different patterns. The processing is over 200 times faster than traditional mechanical trepanning
Global synchronization of parallel processors using clock pulse width modulation
Chen, Dong; Ellavsky, Matthew R.; Franke, Ross L.; Gara, Alan; Gooding, Thomas M.; Haring, Rudolf A.; Jeanson, Mark J.; Kopcsay, Gerard V.; Liebsch, Thomas A.; Littrell, Daniel; Ohmacht, Martin; Reed, Don D.; Schenck, Brandon E.; Swetz, Richard A.
2013-04-02
A circuit generates a global clock signal with a pulse width modification to synchronize processors in a parallel computing system. The circuit may include a hardware module and a clock splitter. The hardware module may generate a clock signal and performs a pulse width modification on the clock signal. The pulse width modification changes a pulse width within a clock period in the clock signal. The clock splitter may distribute the pulse width modified clock signal to a plurality of processors in the parallel computing system.
The cost of conservative synchronization in parallel discrete event simulations
Nicol, David M.
1990-01-01
The performance of a synchronous conservative parallel discrete-event simulation protocol is analyzed. The class of simulation models considered is oriented around a physical domain and possesses a limited ability to predict future behavior. A stochastic model is used to show that as the volume of simulation activity in the model increases relative to a fixed architecture, the complexity of the average per-event overhead due to synchronization, event list manipulation, lookahead calculations, and processor idle time approach the complexity of the average per-event overhead of a serial simulation. The method is therefore within a constant factor of optimal. The analysis demonstrates that on large problems--those for which parallel processing is ideally suited--there is often enough parallel workload so that processors are not usually idle. The viability of the method is also demonstrated empirically, showing how good performance is achieved on large problems using a thirty-two node Intel iPSC/2 distributed memory multiprocessor.
Synchronous Parallel System for Emulation and Discrete Event Simulation
Steinman, Jeffrey S. (Inventor)
2001-01-01
A synchronous parallel system for emulation and discrete event simulation having parallel nodes responds to received messages at each node by generating event objects having individual time stamps, stores only the changes to the state variables of the simulation object attributable to the event object and produces corresponding messages. The system refrains from transmitting the messages and changing the state variables while it determines whether the changes are superseded, and then stores the unchanged state variables in the event object for later restoral to the simulation object if called for. This determination preferably includes sensing the time stamp of each new event object and determining which new event object has the earliest time stamp as the local event horizon, determining the earliest local event horizon of the nodes as the global event horizon, and ignoring events whose time stamps are less than the global event horizon. Host processing between the system and external terminals enables such a terminal to query, monitor, command or participate with a simulation object during the simulation process.
SPEEDES - A multiple-synchronization environment for parallel discrete-event simulation
Steinman, Jeff S.
1992-01-01
Synchronous Parallel Environment for Emulation and Discrete-Event Simulation (SPEEDES) is a unified parallel simulation environment. It supports multiple-synchronization protocols without requiring users to recompile their code. When a SPEEDES simulation runs on one node, all the extra parallel overhead is removed automatically at run time. When the same executable runs in parallel, the user preselects the synchronization algorithm from a list of options. SPEEDES currently runs on UNIX networks and on the California Institute of Technology/Jet Propulsion Laboratory Mark III Hypercube. SPEEDES also supports interactive simulations. Featured in the SPEEDES environment is a new parallel synchronization approach called Breathing Time Buckets. This algorithm uses some of the conservative techniques found in Time Bucket synchronization, along with the optimism that characterizes the Time Warp approach. A mathematical model derived from first principles predicts the performance of Breathing Time Buckets. Along with the Breathing Time Buckets algorithm, this paper discusses the rules for processing events in SPEEDES, describes the implementation of various other synchronization protocols supported by SPEEDES, describes some new ones for the future, discusses interactive simulations, and then gives some performance results.
An Evaluation of Parallel Synchronous and Conservative Asynchronous Logic-Level Simulations
Directory of Open Access Journals (Sweden)
Ausif Mahmood
1996-01-01
a circuit remain fixed during the entire simulation. We remove this limitation and, by extending the analyses to multi-input, multi-output circuits with an arbitrary number of input events, show that the conservative asynchronous simulation extracts more parallelism and executes faster than synchronous simulation in general. Our conclusions are supported by a comparison of the idealized execution times of synchronous and conservative asynchronous algorithms on ISCAS combinational and sequential benchmark circuits.
An object-oriented bulk synchronous parallel library for multicore programming
Yzelman, A.N.; Bisseling, R.H.
2012-01-01
We show that the bulk synchronous parallel (BSP) model, originally designed for distributed-memory systems, is also applicable for shared-memory multicore systems and, furthermore, that BSP libraries are useful in scientific computing on these systems. A proof-of-concept MulticoreBSP library has
ASSET: Analysis of Sequences of Synchronous Events in Massively Parallel Spike Trains
Canova, Carlos; Denker, Michael; Gerstein, George; Helias, Moritz
2016-01-01
With the ability to observe the activity from large numbers of neurons simultaneously using modern recording technologies, the chance to identify sub-networks involved in coordinated processing increases. Sequences of synchronous spike events (SSEs) constitute one type of such coordinated spiking that propagates activity in a temporally precise manner. The synfire chain was proposed as one potential model for such network processing. Previous work introduced a method for visualization of SSEs in massively parallel spike trains, based on an intersection matrix that contains in each entry the degree of overlap of active neurons in two corresponding time bins. Repeated SSEs are reflected in the matrix as diagonal structures of high overlap values. The method as such, however, leaves the task of identifying these diagonal structures to visual inspection rather than to a quantitative analysis. Here we present ASSET (Analysis of Sequences of Synchronous EvenTs), an improved, fully automated method which determines diagonal structures in the intersection matrix by a robust mathematical procedure. The method consists of a sequence of steps that i) assess which entries in the matrix potentially belong to a diagonal structure, ii) cluster these entries into individual diagonal structures and iii) determine the neurons composing the associated SSEs. We employ parallel point processes generated by stochastic simulations as test data to demonstrate the performance of the method under a wide range of realistic scenarios, including different types of non-stationarity of the spiking activity and different correlation structures. Finally, the ability of the method to discover SSEs is demonstrated on complex data from large network simulations with embedded synfire chains. Thus, ASSET represents an effective and efficient tool to analyze massively parallel spike data for temporal sequences of synchronous activity. PMID:27420734
Archer, Charles J [Rochester, MN; Blocksome, Michael A [Rochester, MN; Peters, Amanda E [Cambridge, MA; Ratterman, Joseph D [Rochester, MN; Smith, Brian E [Rochester, MN
2012-04-17
Methods, apparatus, and products are disclosed for reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application that include: beginning, by each compute node, performance of a blocking operation specified by the parallel application, each compute node beginning the blocking operation asynchronously with respect to the other compute nodes; reducing, for each compute node, power to one or more hardware components of that compute node in response to that compute node beginning the performance of the blocking operation; and restoring, for each compute node, the power to the hardware components having power reduced in response to all of the compute nodes beginning the performance of the blocking operation.
Archer, Charles J [Rochester, MN; Blocksome, Michael A [Rochester, MN; Peters, Amanda A [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian E [Rochester, MN
2012-01-10
Methods, apparatus, and products are disclosed for reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application that include: beginning, by each compute node, performance of a blocking operation specified by the parallel application, each compute node beginning the blocking operation asynchronously with respect to the other compute nodes; reducing, for each compute node, power to one or more hardware components of that compute node in response to that compute node beginning the performance of the blocking operation; and restoring, for each compute node, the power to the hardware components having power reduced in response to all of the compute nodes beginning the performance of the blocking operation.
Lyan, Oleg; Jankunas, Valdas; Guseinoviene, Eleonora; Pašilis, Aleksas; Senulis, Audrius; Knolis, Audrius; Kurt, Erol
2018-02-01
In this study, a permanent magnet synchronous generator (PMSG) topology with compensated reactance windings in parallel rod configuration is proposed to reduce the armature reactance X L and to achieve higher efficiency of PMSG. The PMSG was designed using iron-cored bifilar coil topology to overcome problems of market-dominant rotary type generators. Often the problem is a comparatively high armature reactance X L, which is usually bigger than armature resistance R a. Therefore, the topology is proposed to partially compensate or negligibly reduce the PMSG reactance. The study was performed by using finite element method (FEM) analysis and experimental investigation. FEM analysis was used to investigate magnetic field flux distribution and density in PMSG. The PMSG experimental analyses of no-load losses and electromotive force versus frequency (i.e., speed) was performed. Also terminal voltage, power output and efficiency relation with load current at different frequencies have been evaluated. The reactance of PMSG has low value and a linear relation with operating frequency. The low reactance gives a small variation of efficiency (from 90% to 95%) in a wide range of load (from 3 A to 10 A) and operation frequency (from 44 Hz to 114 Hz). The comparison of PMSG characteristics with parallel and series winding connection showed insignificant power variation. The research results showed that compensated reactance winding in parallel rod configuration in PMSG design provides lower reactance and therefore, higher efficiency under wider load and frequency variation.
Synchronous parallel kinetic Monte Carlo for continuum diffusion-reaction systems
International Nuclear Information System (INIS)
Martinez, E.; Marian, J.; Kalos, M.H.; Perlado, J.M.
2008-01-01
A novel parallel kinetic Monte Carlo (kMC) algorithm formulated on the basis of perfect time synchronicity is presented. The algorithm is intended as a generalization of the standard n-fold kMC method, and is trivially implemented in parallel architectures. In its present form, the algorithm is not rigorous in the sense that boundary conflicts are ignored. We demonstrate, however, that, in their absence, or if they were correctly accounted for, our algorithm solves the same master equation as the serial method. We test the validity and parallel performance of the method by solving several pure diffusion problems (i.e. with no particle interactions) with known analytical solution. We also study diffusion-reaction systems with known asymptotic behavior and find that, for large systems with interaction radii smaller than the typical diffusion length, boundary conflicts are negligible and do not affect the global kinetic evolution, which is seen to agree with the expected analytical behavior. Our method is a controlled approximation in the sense that the error incurred by ignoring boundary conflicts can be quantified intrinsically, during the course of a simulation, and decreased arbitrarily (controlled) by modifying a few problem-dependent simulation parameters
Directory of Open Access Journals (Sweden)
FERDI Brahim
2014-05-01
Full Text Available This paper proposes a novel application of the instantaneous P-Q theory in a wind energy conversion system (WECS. The proposed WECS is formed by permanent magnet synchronous generator (PMSG wind turbine system connected to the grid through parallel active power filter (PAPF. PAPF uses the generated wind energy to feed loads connected at the point of common coupling (PPC, compensates current harmonics and injects the excess of this energy into the grid using P-Q theory as control method. To demonstrate the feasibility and the performance of the proposed control scheme, simulation of this wind system has been realized using MATLAB/SIMULINK software. Simulation results show the accuracy and validity of the proposed control scheme for the PMSGPAPF system.
Yasuda, Shugo; Yamamoto, Ryoichi
2015-11-01
The Synchronized Molecular-Dynamics simulation which was recently proposed by authors is applied to the analysis of polymer lubrication between parallel plates. In the SMD method, the MD simulations are assigned to small fluid elements to calculate the local stresses and temperatures and are synchronized at certain time intervals to satisfy the macroscopic heat- and momentum-transport equations.The rheological properties and conformation of the polymer chains coupled with local viscous heating are investigated with a non-dimensional parameter, the Nahme-Griffith number, which is defined as the ratio of the viscous heating to the thermal conduction at the characteristic temperature required to sufficiently change the viscosity. The present simulation demonstrates that strong shear thinning and a transitional behavior of the conformation of the polymer chains are exhibited with a rapid temperature rise when the Nahme-Griffith number exceeds unity.The results also clarify that the reentrant transition of the linear stress-optical relation occurs for large shear stresses due to the coupling of the conformation of polymer chains with heat generation under shear flows. This study was financially supported by JSPS KAKENHI Grant Nos. 26790080 and 26247069.
2016-05-11
Current-Controlled Inverters by Midshipman 1/C Spencer C. Shabshab, USN UNITED STATES NAVAL ACADEMY...Three-Phase, Current-Controlled Inverters by Midshipman 1/C Spencer C. Shabshab United States Naval Academy Annapolis, Maryland...for Communication-Free Synchronization of Paralleled, 5a. CONTRACT NUMBER Three-Phase, Current-Controlled Inverters 5b. GRANT NUMBER 5c
Byun, Hye Suk; El-Naggar, Mohamed Y.; Kalia, Rajiv K.; Nakano, Aiichiro; Vashishta, Priya
2017-10-01
Kinetic Monte Carlo (KMC) simulations are used to study long-time dynamics of a wide variety of systems. Unfortunately, the conventional KMC algorithm is not scalable to larger systems, since its time scale is inversely proportional to the simulated system size. A promising approach to resolving this issue is the synchronous parallel KMC (SPKMC) algorithm, which makes the time scale size-independent. This paper introduces a formal derivation of the SPKMC algorithm based on local transition-state and time-dependent Hartree approximations, as well as its scalable parallel implementation based on a dual linked-list cell method. The resulting algorithm has achieved a weak-scaling parallel efficiency of 0.935 on 1024 Intel Xeon processors for simulating biological electron transfer dynamics in a 4.2 billion-heme system, as well as decent strong-scaling parallel efficiency. The parallel code has been used to simulate a lattice of cytochrome complexes on a bacterial-membrane nanowire, and it is broadly applicable to other problems such as computational synthesis of new materials.
DEFF Research Database (Denmark)
Guan, Yajuan; Guerrero, Josep M.; Zhao, Xin
2016-01-01
A novel simple and effective autonomous current-sharing controller for parallel three-phase inverters is proposed in this paper. The proposed controller provides faster response and better accuracy in contrast to the conventional droop control, since this novel approach does not require any active...... or reactive power calculations. Instead, a synchronous-reference-frame (SRF) virtual impedance loop and an SRF-based phase-locked loop are used. Stationary analysis is provided in order to identify the inherent mechanism of the direct and quadrature output currents in relation to the voltage amplitude...... from a setup with three parallel 2.2 kW inverters verify the effectiveness of the proposed control strategy in different scenarios....
International Nuclear Information System (INIS)
Nitta, T.; Okada, T.
1989-01-01
This paper describes electrical transient characteristics of parallel running of the 20kVA superconducting synchronous generator and a conventional one. In the experimental power system, the superconducting generator is connected through reactors (artificial transmission lines) to a regional power system (infinite bus) and the conventional generator (20kVA) is connected to the terminal of the superconducting generator. Several tests were performed in order to consider the transient behavior of superconducting generator (SCG) in the power system. The items of the tests are synchronous closing test, loss of synchronism test and disconnecting and reclosing test. From the experimental results, it can be said that by installing SCG in power systems, voltage stability and power system stability can be improved in transient states as well as in steady states and the variation of armature current of SCG during a transient period is extremely larger than that of the conventional one. The transient analysis by a computer simulation was also carried out for the experiments. The simulation results are in good agreement with the experimental ones
Furjan Mandic, Gordana; Peric, Mia; Krzelj, Lucijana; Stankovic, Sladana; Zenic, Natasa
2013-01-01
Although nutrition and doping are important factors in sports, neither is often investigated in synchronized swimming (Synchro).This study aimed to define and compare Synchro athletes and their coaches on their knowledge of sports nutrition (KSN)and knowledge of doping (KD); and to study factors related to KSN and KD in each of these groups. Additionally, the KSNand KD questionnaires were evaluated for their reliability and validity. Altogether, 82 athletes (17.2 ± 1.92 years of age) and 28 coaches (30.8 ± 5.26 years of age) from Croatia and Serbia were included in the study, with a 99% response rate. The testand retest correlations were 0.94 and 0.90 for the KD and KSN,respectively. Subjects responded equally to 91% queries of the KD and 89% queries of the KSN. Although most of the coache sare highly educated, they declared self-education as the primary source of information about doping and sport-nutrition. Coaches scored higher than their athletes on both questionnaires which defined appropriate discriminative validity of the questionnaires. Variables such as age, sports experience and formal education are positively correlated to KSN and KD scores among athletes. The athletes who scored better on the KD are less prone to doping behavior in the future. These data reinforce the need for systematic educational programs on doping and sports nutrition in synchronized swimming. Special attention should be placed on younger athletes. Key PointsAlthough most of the synchro coaches are highly educated, self-education is declared as the primary source of information about doping and sportnutrition.The knowledge of doping and doping-health hazards are negatively related to potential doping behavior in the future among synchronized swimmersThe data reinforce the need for systematic educational programs on doping and sports nutrition in synchronized swimming.We advocate improving the knowledge of sports nutrition among older coaches and the knowledge of doping among
Furjan Mandic, Gordana; Peric, Mia; Krzelj, Lucijana; Stankovic, Sladana; Zenic, Natasa
2013-01-01
Although nutrition and doping are important factors in sports, neither is often investigated in synchronized swimming (Synchro).This study aimed to define and compare Synchro athletes and their coaches on their knowledge of sports nutrition (KSN)and knowledge of doping (KD); and to study factors related to KSN and KD in each of these groups. Additionally, the KSNand KD questionnaires were evaluated for their reliability and validity. Altogether, 82 athletes (17.2 ± 1.92 years of age) and 28 coaches (30.8 ± 5.26 years of age) from Croatia and Serbia were included in the study, with a 99% response rate. The testand retest correlations were 0.94 and 0.90 for the KD and KSN,respectively. Subjects responded equally to 91% queries of the KD and 89% queries of the KSN. Although most of the coache sare highly educated, they declared self-education as the primary source of information about doping and sport-nutrition. Coaches scored higher than their athletes on both questionnaires which defined appropriate discriminative validity of the questionnaires. Variables such as age, sports experience and formal education are positively correlated to KSN and KD scores among athletes. The athletes who scored better on the KD are less prone to doping behavior in the future. These data reinforce the need for systematic educational programs on doping and sports nutrition in synchronized swimming. Special attention should be placed on younger athletes. Key Points Although most of the synchro coaches are highly educated, self-education is declared as the primary source of information about doping and sportnutrition. The knowledge of doping and doping-health hazards are negatively related to potential doping behavior in the future among synchronized swimmers The data reinforce the need for systematic educational programs on doping and sports nutrition in synchronized swimming. We advocate improving the knowledge of sports nutrition among older coaches and the knowledge of doping among
Directory of Open Access Journals (Sweden)
Gordana Furjan Mandic
2013-12-01
Full Text Available Although nutrition and doping are important factors in sports, neither is often investigated in synchronized swimming (Synchro.This study aimed to define and compare Synchro athletes and their coaches on their knowledge of sports nutrition (KSNand knowledge of doping (KD; and to study factors related to KSN and KD in each of these groups. Additionally, the KSNand KD questionnaires were evaluated for their reliability and validity. Altogether, 82 athletes (17.2 ± 1.92 years of age and 28 coaches (30.8 ± 5.26 years of age from Croatia and Serbia were included in the study, with a 99% response rate. The testand retest correlations were 0.94 and 0.90 for the KD and KSN,respectively. Subjects responded equally to 91% queries of the KD and 89% queries of the KSN. Although most of the coache sare highly educated, they declared self-education as the primary source of information about doping and sport-nutrition. Coaches scored higher than their athletes on both questionnaires which defined appropriate discriminative validity of the questionnaires. Variables such as age, sports experience and formal education are positively correlated to KSN and KD scores among athletes. The athletes who scored better on the KD are less prone to doping behavior in the future. These data reinforce the need for systematic educational programs on doping and sports nutrition in synchronized swimming. Special attention should be placed on younger athletes.
Synchronic and diachronic evidence for parallels between noun phrases and sentences
DEFF Research Database (Denmark)
Rijkhoff, Jan
2008-01-01
Both formal and functional linguists have developed models in which clauses and NPs can at least partly be analyzed in a similar fashion. But whereas formal approaches to grammar have concentrated on similarities between the (underlying) syntactic structure of the NP and the clause (e.g. Jackendoff...... 1977, Abney 1989), functional theories such as Functional Grammar have investigated parallels between the underlying semantic structure of the NP and clause (Rijkhoff 1989, 1992, 2002). This article has two main goals: [a] to present a revised and expanded version of the layered (semantic) NP...
Directory of Open Access Journals (Sweden)
Kamran Siddique
2017-09-01
Full Text Available Anomaly detection systems, also known as intrusion detection systems (IDSs, continuously monitor network traffic aiming to identify malicious actions. Extensive research has been conducted to build efficient IDSs emphasizing two essential characteristics. The first is concerned with finding optimal feature selection, while another deals with employing robust classification schemes. However, the advent of big data concepts in anomaly detection domain and the appearance of sophisticated network attacks in the modern era require some fundamental methodological revisions to develop IDSs. Therefore, we first identify two more significant characteristics in addition to the ones mentioned above. These refer to the need for employing specialized big data processing frameworks and utilizing appropriate datasets for validating system’s performance, which is largely overlooked in existing studies. Afterwards, we set out to develop an anomaly detection system that comprehensively follows these four identified characteristics, i.e., the proposed system (i performs feature ranking and selection using information gain and automated branch-and-bound algorithms respectively; (ii employs logistic regression and extreme gradient boosting techniques for classification; (iii introduces bulk synchronous parallel processing to cater computational requirements of high-speed big data networks; and; (iv uses the Infromation Security Centre of Excellence, of the University of Brunswick real-time contemporary dataset for performance evaluation. We present experimental results that verify the efficacy of the proposed system.
Zhang, Quan; Li, Chaodong; Zhang, Jiantao; Zhang, Xu
2017-11-01
The macro-micro combined approach, as an effective way to realize trans-scale nano-precision positioning with multi-dimensions and high velocity, plays a significant role in integrated circuit manufacturing field. A 3-degree-of-freedoms (3-DOFs) macro-micro manipulator is designed and analyzed to compromise the conflictions among the large stroke, high precision and multi-DOFs. The macro manipulator is a 3-Prismatic-Revolute-Revolute (3-PRR) structure parallel manipulator which is driven by three linear ultrasonic motors. The dynamic model and the cross-coupling error based synchronized motion controller of the 3-PRR parallel manipulator are theoretical analyzed and experimental tested. To further improve the positioning accuracy, a 3-DOFs monolithic compliant manipulator actuated by three piezoelectric stack actuators is designed. Then a multilayer BP neural network based inverse kinematic model identifier is developed to perform the positioning control. Finally, by forming the macro-micro structure, the dual stage manipulator successfully achieved the positioning task from the point (2 mm, 2 mm, 0 rad) back to the original point (0 mm, 0 mm, 0 rad) with the translation errors in X and Y directions less than ±50 nm and the rotation error around Z axis less than ±1 μrad, respectively.
Steinman, Jeffrey S. (Inventor)
1998-01-01
The present invention is embodied in a method of performing object-oriented simulation and a system having inter-connected processor nodes operating in parallel to simulate mutual interactions of a set of discrete simulation objects distributed among the nodes as a sequence of discrete events changing state variables of respective simulation objects so as to generate new event-defining messages addressed to respective ones of the nodes. The object-oriented simulation is performed at each one of the nodes by assigning passive self-contained simulation objects to each one of the nodes, responding to messages received at one node by generating corresponding active event objects having user-defined inherent capabilities and individual time stamps and corresponding to respective events affecting one of the passive self-contained simulation objects of the one node, restricting the respective passive self-contained simulation objects to only providing and receiving information from die respective active event objects, requesting information and changing variables within a passive self-contained simulation object by the active event object, and producing corresponding messages specifying events resulting therefrom by the active event objects.
Jerath, Ravinder; Cearley, Shannon M; Barnes, Vernon A; Jensen, Mike
2018-01-01
A fundamental function of the visual system is detecting motion, yet visual perception is poorly understood. Current research has determined that the retina and ganglion cells elicit responses for motion detection; however, the underlying mechanism for this is incompletely understood. Previously we proposed that retinogeniculo-cortical oscillations and photoreceptors work in parallel to process vision. Here we propose that motion could also be processed within the retina, and not in the brain as current theory suggests. In this paper, we discuss: 1) internal neural space formation; 2) primary, secondary, and tertiary roles of vision; 3) gamma as the secondary role; and 4) synchronization and coherence. Movement within the external field is instantly detected by primary processing within the space formed by the retina, providing a unified view of the world from an internal point of view. Our new theory begins to answer questions about: 1) perception of space, erect images, and motion, 2) purpose of lateral inhibition, 3) speed of visual perception, and 4) how peripheral color vision occurs without a large population of cones located peripherally in the retina. We explain that strong oscillatory activity influences on brain activity and is necessary for: 1) visual processing, and 2) formation of the internal visuospatial area necessary for visual consciousness, which could allow rods to receive precise visual and visuospatial information, while retinal waves could link the lateral geniculate body with the cortex to form a neural space formed by membrane potential-based oscillations and photoreceptors. We propose that vision is tripartite, with three components that allow a person to make sense of the world, terming them "primary, secondary, and tertiary roles" of vision. Finally, we propose that Gamma waves that are higher in strength and volume allow communication among the retina, thalamus, and various areas of the cortex, and synchronization brings cortical
Synchronicity from Synchronized Chaos
Directory of Open Access Journals (Sweden)
Gregory S. Duane
2015-03-01
Full Text Available The synchronization of loosely-coupled chaotic oscillators, a phenomenon investigated intensively for the last two decades, may realize the philosophical concept of “synchronicity”—the commonplace notion that related eventsmysteriously occur at the same time. When extended to continuous media and/or large discrete arrays, and when general (non-identical correspondences are considered between states, intermittent synchronous relationships indeed become ubiquitous. Meaningful synchronicity follows naturally if meaningful events are identified with coherent structures, defined by internal synchronization between remote degrees of freedom; a condition that has been posited as necessary for synchronizability with an external system. The important case of synchronization between mind and matter is realized if mind is analogized to a computer model, synchronizing with a sporadically observed system, as in meteorological data assimilation. Evidence for the ubiquity of synchronization is reviewed along with recent proposals that: (1 synchronization of different models of the same objective process may be an expeditious route to improved computational modeling and may also describe the functioning of conscious brains; and (2 the nonlocality in quantum phenomena implied by Bell’s theorem may be explained in a variety of deterministic (hidden variable interpretations if the quantum world resides on a generalized synchronization “manifold”.
The convergence of parallel Boltzmann machines
Zwietering, P.J.; Aarts, E.H.L.; Eckmiller, R.; Hartmann, G.; Hauske, G.
1990-01-01
We discuss the main results obtained in a study of a mathematical model of synchronously parallel Boltzmann machines. We present supporting evidence for the conjecture that a synchronously parallel Boltzmann machine maximizes a consensus function that consists of a weighted sum of the regular
Software support for irregular and loosely synchronous problems
Choudhary, A.; Fox, G.; Hiranandani, S.; Kennedy, K.; Koelbel, C.; Ranka, S.; Saltz, J.
1992-01-01
A large class of scientific and engineering applications may be classified as irregular and loosely synchronous from the perspective of parallel processing. We present a partial classification of such problems. This classification has motivated us to enhance FORTRAN D to provide language support for irregular, loosely synchronous problems. We present techniques for parallelization of such problems in the context of FORTRAN D.
On Synchronization Primitive Systems.
The report studies the question: what synchronization primitive should be used to handle inter-process communication. A formal model is presented...between these synchronization primitives. Although only four synchronization primitives are compared, the general methods can be used to compare other... synchronization primitives. Moreover, in the definitions of these synchronization primitives, conditional branches are explicitly allowed. In addition
Pantaleone, James
2002-10-01
Synchronization is a common phenomenon in physical and biological systems. We examine the synchronization of two (and more) metronomes placed on a freely moving base. The small motion of the base couples the pendulums causing synchronization. The synchronization is generally in-phase, with antiphase synchronization occurring only under special conditions. The metronome system provides a mechanical realization of the popular Kuramoto model for synchronization of biological oscillators, and is excellent for classroom demonstrations and an undergraduate physics lab.
Synchronous ethernet and IEEE 1588 in telecoms next generation synchronization networks
2013-01-01
This book addresses the multiple technical aspects of the distribution of synchronization in new generation telecommunication networks, focusing in particular on synchronous Ethernet and IEEE1588 technologies. Many packet network engineers struggle with understanding the challenges that precise synchronization distribution can impose on networks. The usual “why”, “when” and particularly “how” can cause problems for many engineers. In parallel to this, some other markets have identical synchronization requirements, but with their own design requirements, generating further questions. This book attempts to respond to the different questions by providing background technical information. Invaluable information on state of-the-art packet network synchronization and timing architectures is provided, as well as an unbiased view on the synchronization technologies that have been internationally standardized over recent years, with the aim of providing the average reader (who is not skilled in the art) wi...
Fuzzy stability and synchronization of hyperchaos systems
International Nuclear Information System (INIS)
Wang Junwei; Xiong Xiaohua; Zhao Meichun; Zhang Yanbin
2008-01-01
This paper studies stability and synchronization of hyperchaos systems via a fuzzy-model-based control design methodology. First, we utilize a Takagi-Sugeno fuzzy model to represent a hyperchaos system. Second, we design fuzzy-model-based controllers for stability and synchronization of the system, based on so-called 'parallel distributed compensation (PDC)'. Third, we reduce a question of stabilizing and synchronizing hyperchaos systems to linear matrix inequalities (LMI) so that convex programming techniques can solve these LMIs efficiently. Finally, the generalized Lorenz hyperchaos system is employed to illustrate the effectiveness of our designing controller
Multithreading for synchronization tolerance in matrix factorization
International Nuclear Information System (INIS)
Buttari, Alfredo; Dongarra, Jack; Husbands, Parry; Kurzak, Jakub; Yelick, Katherine
2007-01-01
Physical constraints such as power, leakage and pin bandwidth are currently driving the HPC industry to produce systems with unprecedented levels of concurrency. In these parallel systems, synchronization and memory operations are becoming considerably more expensive than before. In this work we study parallel matrix factorization codes and conclude that they need to be re-engineered to avoid unnecessary (and expensive) synchronization. We propose the use of multithreading combined with intelligent schedulers and implement representative algorithms in this style. Our results indicate that this strategy can significantly outperform traditional codes
Overview of Cell Synchronization.
Banfalvi, Gaspar
2017-01-01
The widespread interest in cell synchronization is maintained by the studies of control mechanism involved in cell cycle regulation. During the synchronization distinct subpopulations of cells are obtained representing different stages of the cell cycle. These subpopulations are then used to study regulatory mechanisms of the cycle at the level of macromolecular biosynthesis (DNA synthesis, gene expression, protein synthesis), protein phosphorylation, development of new drugs, etc. Although several synchronization methods have been described, it is of general interest that scientists get a compilation and an updated view of these synchronization techniques. This introductory chapter summarizes: (1) the basic concepts and principal criteria of cell cycle synchronizations, (2) the most frequently used synchronization methods, such as physical fractionation (flow cytometry, dielectrophoresis, cytofluorometric purification), chemical blockade, (3) synchronization of embryonic cells, (4) synchronization at low temperature, (5) comparison of cell synchrony techniques, (6) synchronization of unicellular organisms, and (7) the effect of synchronization on transfection.
Stages of chaotic synchronization.
Tang, D. Y.; Dykstra, R.; Hamilton, M. W.; Heckenberg, N. R.
1998-09-01
In an experimental investigation of the response of a chaotic system to a chaotic driving force, we have observed synchronization of chaos of the response system in the forms of generalized synchronization, phase synchronization, and lag synchronization to the driving signal. In this paper we compare the features of these forms of synchronized chaos and study their relations and physical origins. We found that different forms of chaotic synchronization could be interpreted as different stages of nonlinear interaction between the coupled chaotic systems. (c) 1998 American Institute of Physics.
STUDYING BUSINESS CYCLES SYNCHRONIZATION
Directory of Open Access Journals (Sweden)
N. Servetnyk
2014-06-01
Full Text Available The paper researches business cycles synchronization. The fluctuations in post-Soviet countries are considered. The study examines different measures of synchronization in groups of countries according to some criteria.
Clock synchronization and dispersion
International Nuclear Information System (INIS)
Giovannetti, Vittorio; Lloyd, Seth; Maccone, Lorenzo; Wong, Franco N C
2002-01-01
We present a method to defeat effects of dispersion of timing signals when synchronizing clocks. It is based on the recently proposed 'conveyor belt synchronization' scheme and on the quantum dispersion cancellation effect
The report summarizes the progress in the design and construction of automatic equipment for synchronizing cell division in culture by periodic...Concurrent experiments in hypothermic synchronization of algal cell division are reported.
Robust Synchronization Models for Presentation System Using SMIL-Driven Approach
Asnawi, Rustam; Ahmad, Wan Fatimah Wan; Rambli, Dayang Rohaya Awang
2013-01-01
Current common Presentation System (PS) models are slide based oriented and lack synchronization analysis either with temporal or spatial constraints. Such models, in fact, tend to lead to synchronization problems, particularly on parallel synchronization with spatial constraints between multimedia element presentations. However, parallel…
Synchronization of Multipoint Hoists
A contractor has conceived an electrohydraulic feedback system that will provide position synchronization of four aircraft cargo hoists. To... synchronized hoist system. Test results show that the feedback system concept provides adequate synchronization control; i.e., the platform pitch and roll
Crockett, Thomas W.
1995-01-01
This article provides a broad introduction to the subject of parallel rendering, encompassing both hardware and software systems. The focus is on the underlying concepts and the issues which arise in the design of parallel rendering algorithms and systems. We examine the different types of parallelism and how they can be applied in rendering applications. Concepts from parallel computing, such as data decomposition, task granularity, scalability, and load balancing, are considered in relation to the rendering problem. We also explore concepts from computer graphics, such as coherence and projection, which have a significant impact on the structure of parallel rendering algorithms. Our survey covers a number of practical considerations as well, including the choice of architectural platform, communication and memory requirements, and the problem of image assembly and display. We illustrate the discussion with numerous examples from the parallel rendering literature, representing most of the principal rendering methods currently used in computer graphics.
1982-01-01
Parallel Computations focuses on parallel computation, with emphasis on algorithms used in a variety of numerical and physical applications and for many different types of parallel computers. Topics covered range from vectorization of fast Fourier transforms (FFTs) and of the incomplete Cholesky conjugate gradient (ICCG) algorithm on the Cray-1 to calculation of table lookups and piecewise functions. Single tridiagonal linear systems and vectorized computation of reactive flow are also discussed.Comprised of 13 chapters, this volume begins by classifying parallel computers and describing techn
Synchronization of chaotic systems
International Nuclear Information System (INIS)
Pecora, Louis M.; Carroll, Thomas L.
2015-01-01
We review some of the history and early work in the area of synchronization in chaotic systems. We start with our own discovery of the phenomenon, but go on to establish the historical timeline of this topic back to the earliest known paper. The topic of synchronization of chaotic systems has always been intriguing, since chaotic systems are known to resist synchronization because of their positive Lyapunov exponents. The convergence of the two systems to identical trajectories is a surprise. We show how people originally thought about this process and how the concept of synchronization changed over the years to a more geometric view using synchronization manifolds. We also show that building synchronizing systems leads naturally to engineering more complex systems whose constituents are chaotic, but which can be tuned to output various chaotic signals. We finally end up at a topic that is still in very active exploration today and that is synchronization of dynamical systems in networks of oscillators
Overview of the Force Scientific Parallel Language
Directory of Open Access Journals (Sweden)
Gita Alaghband
1994-01-01
Full Text Available The Force parallel programming language designed for large-scale shared-memory multiprocessors is presented. The language provides a number of parallel constructs as extensions to the ordinary Fortran language and is implemented as a two-level macro preprocessor to support portability across shared memory multiprocessors. The global parallelism model on which the Force is based provides a powerful parallel language. The parallel constructs, generic synchronization, and freedom from process management supported by the Force has resulted in structured parallel programs that are ported to the many multiprocessors on which the Force is implemented. Two new parallel constructs for looping and functional decomposition are discussed. Several programming examples to illustrate some parallel programming approaches using the Force are also presented.
The STAPL Parallel Graph Library
Harshvardhan,
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable distributed graph container and a collection of commonly used parallel graph algorithms. The library introduces pGraph pViews that separate algorithm design from the container implementation. It supports three graph processing algorithmic paradigms, level-synchronous, asynchronous and coarse-grained, and provides common graph algorithms based on them. Experimental results demonstrate improved scalability in performance and data size over existing graph libraries on more than 16,000 cores and on internet-scale graphs containing over 16 billion vertices and 250 billion edges. © Springer-Verlag Berlin Heidelberg 2013.
Casanova, Henri; Robert, Yves
2008-01-01
""…The authors of the present book, who have extensive credentials in both research and instruction in the area of parallelism, present a sound, principled treatment of parallel algorithms. … This book is very well written and extremely well designed from an instructional point of view. … The authors have created an instructive and fascinating text. The book will serve researchers as well as instructors who need a solid, readable text for a course on parallelism in computing. Indeed, for anyone who wants an understandable text from which to acquire a current, rigorous, and broad vi
Synchronization of Concurrent Processes
1975-07-01
Pettersen Stanford Ur.iversity Artificial Intelligence Laboratory ABSTRACT Th oaoer gives an overview of commonly used synchronization primitives and...wr.ters . ut.l.z.ng the DroDo4d synchronization primitive . The solution is simpler and shorter than other known S’ms The first sections of the paper...un reicr»» side il nrcttaary and Identity by block number) Scheduling, process scheduling, synchronization , mutual exclusion, semaphores , critical
Adaptive Backoff Synchronization Techniques
1989-07-01
Percentage of synchronization and non- synchronisation references that cause invalidations in directory schemes with 2, 3, 4, 5, and 64 pointers...processors to arrive. The slight relative increase of synchronisation overhead in all cases when going from two to five pointers is because synchronization ...MASSACHUSETTS INSTITUTE OF TECHNOLOGY VLSI PUBLICATIONS q~JU VLSI Memo No. 89-547 It July 1989 Adaptive Backoff Synchronization Techniques Anant
Synchronization on effective networks
International Nuclear Information System (INIS)
Zhou Tao; Zhao Ming; Zhou Changsong
2010-01-01
The study of network synchronization has attracted increasing attentionrecently. In this paper, we strictly define a class of networks, namely effective networks, which are synchronizable and orientable networks. We can prove that all the effective networks with the same size have the same spectra, and are of the best synchronizability according to the master stability analysis. However, it is found that the synchronization time for different effective networks can be quite different. Further analysis shows that the key ingredient affecting the synchronization time is the maximal depth of an effective network: the larger depth results in a longer synchronization time. The secondary factor is the number of links. The increasing number of links connecting nodes in the same layer (horizontal links) will lead to longer synchronization time, whereas the increasing number of links connecting nodes in neighboring layers (vertical links) will accelerate the synchronization. Our analysis of the relationship between the structure and synchronization properties of the original and effective networks shows that the purely directed effective network can provide an approximation of the original weighted network with normalized input strength. Our findings provide insights into the roles of depth, horizontal and vertical links in the synchronizing process, and suggest that the spectral analysis is helpful yet insufficient for the comprehensive understanding of network synchronization.
Synchronization on effective networks
Energy Technology Data Exchange (ETDEWEB)
Zhou Tao [Web Sciences Center, University of Electronic Science and Technology of China, Chengdu 610054 (China); Zhao Ming [Department of Modern Physics, University of Science and Technology of China, Hefei 230026 (China); Zhou Changsong, E-mail: cszhou@hkbu.edu.h [Department of Physics, Hong Kong Baptist University, Kowloon Tong (Hong Kong)
2010-04-15
The study of network synchronization has attracted increasing attentionrecently. In this paper, we strictly define a class of networks, namely effective networks, which are synchronizable and orientable networks. We can prove that all the effective networks with the same size have the same spectra, and are of the best synchronizability according to the master stability analysis. However, it is found that the synchronization time for different effective networks can be quite different. Further analysis shows that the key ingredient affecting the synchronization time is the maximal depth of an effective network: the larger depth results in a longer synchronization time. The secondary factor is the number of links. The increasing number of links connecting nodes in the same layer (horizontal links) will lead to longer synchronization time, whereas the increasing number of links connecting nodes in neighboring layers (vertical links) will accelerate the synchronization. Our analysis of the relationship between the structure and synchronization properties of the original and effective networks shows that the purely directed effective network can provide an approximation of the original weighted network with normalized input strength. Our findings provide insights into the roles of depth, horizontal and vertical links in the synchronizing process, and suggest that the spectral analysis is helpful yet insufficient for the comprehensive understanding of network synchronization.
TIME SIGNALS, * SYNCHRONIZATION (ELECTRONICS)), NETWORKS, FREQUENCY, STANDARDS, RADIO SIGNALS, ERRORS, VERY LOW FREQUENCY, PROPAGATION, ACCURACY, ATOMIC CLOCKS, CESIUM, RADIO STATIONS, NAVAL SHORE FACILITIES
Method of synchronizing independent functional unit
Kim, Changhoan
2018-03-13
A system for synchronizing parallel processing of a plurality of functional processing units (FPU), a first FPU and a first program counter to control timing of a first stream of program instructions issued to the first FPU by advancement of the first program counter; a second FPU and a second program counter to control timing of a second stream of program instructions issued to the second FPU by advancement of the second program counter, the first FPU is in communication with a second FPU to synchronize the issuance of a first stream of program instructions to the second stream of program instructions and the second FPU is in communication with the first FPU to synchronize the issuance of the second stream program instructions to the first stream of program instructions.
Merry, Philip
2017-01-01
LAY SUMMARY SYNCHRONICITY AND LEADERSHIP TILBURG PHD DISSERTATION, PHILIP MERRY World’s First PhD to Research Synchronicity And Leadership Using Grounded Theory OUT OF THE BLUE COINCIDENCES: research topic Most people have had the experience of thinking of someone and then, almost magically have
Synchronization of hyperchaotic oscillators
DEFF Research Database (Denmark)
Tamasevicius, A.; Cenys, A.; Mykolaitis, G.
1997-01-01
Synchronization of chaotic oscillators is believed to have promising applications in secure communications. Hyperchaotic systems with multiple positive Lyapunov exponents (LEs) have an advantage over common chaotic systems with only one positive LE. Three different types of hyperchaotic electronic...... oscillators are investigated demonstrating synchronization by means of only one properly selected variable....
RUN LENGTH SYNCHRONIZATION TECHNIQUES
An important aspect of digital communications is the problem of determining efficient methods for acquiring block synchronization . In this paper we...utilizes an N-digit sync sequence as prefix to the data blocks. The results of this study show that this technique is a practical method for acquiring block synchronization .
Is Monte Carlo embarrassingly parallel?
Energy Technology Data Exchange (ETDEWEB)
Hoogenboom, J. E. [Delft Univ. of Technology, Mekelweg 15, 2629 JB Delft (Netherlands); Delft Nuclear Consultancy, IJsselzoom 2, 2902 LB Capelle aan den IJssel (Netherlands)
2012-07-01
Monte Carlo is often stated as being embarrassingly parallel. However, running a Monte Carlo calculation, especially a reactor criticality calculation, in parallel using tens of processors shows a serious limitation in speedup and the execution time may even increase beyond a certain number of processors. In this paper the main causes of the loss of efficiency when using many processors are analyzed using a simple Monte Carlo program for criticality. The basic mechanism for parallel execution is MPI. One of the bottlenecks turn out to be the rendez-vous points in the parallel calculation used for synchronization and exchange of data between processors. This happens at least at the end of each cycle for fission source generation in order to collect the full fission source distribution for the next cycle and to estimate the effective multiplication factor, which is not only part of the requested results, but also input to the next cycle for population control. Basic improvements to overcome this limitation are suggested and tested. Also other time losses in the parallel calculation are identified. Moreover, the threading mechanism, which allows the parallel execution of tasks based on shared memory using OpenMP, is analyzed in detail. Recommendations are given to get the maximum efficiency out of a parallel Monte Carlo calculation. (authors)
Is Monte Carlo embarrassingly parallel?
International Nuclear Information System (INIS)
Hoogenboom, J. E.
2012-01-01
Monte Carlo is often stated as being embarrassingly parallel. However, running a Monte Carlo calculation, especially a reactor criticality calculation, in parallel using tens of processors shows a serious limitation in speedup and the execution time may even increase beyond a certain number of processors. In this paper the main causes of the loss of efficiency when using many processors are analyzed using a simple Monte Carlo program for criticality. The basic mechanism for parallel execution is MPI. One of the bottlenecks turn out to be the rendez-vous points in the parallel calculation used for synchronization and exchange of data between processors. This happens at least at the end of each cycle for fission source generation in order to collect the full fission source distribution for the next cycle and to estimate the effective multiplication factor, which is not only part of the requested results, but also input to the next cycle for population control. Basic improvements to overcome this limitation are suggested and tested. Also other time losses in the parallel calculation are identified. Moreover, the threading mechanism, which allows the parallel execution of tasks based on shared memory using OpenMP, is analyzed in detail. Recommendations are given to get the maximum efficiency out of a parallel Monte Carlo calculation. (authors)
Asynchronized synchronous machines
Botvinnik, M M
1964-01-01
Asynchronized Synchronous Machines focuses on the theoretical research on asynchronized synchronous (AS) machines, which are "hybrids of synchronous and induction machines that can operate with slip. Topics covered in this book include the initial equations; vector diagram of an AS machine; regulation in cases of deviation from the law of full compensation; parameters of the excitation system; and schematic diagram of an excitation regulator. The possible applications of AS machines and its calculations in certain cases are also discussed. This publication is beneficial for students and indiv
Lock-free parallel garbage collection
H. Gao; J.F. Groote (Jan Friso); W.H. Hesselink (Wim)
2005-01-01
htmlabstract This paper presents a lock-free parallel algorithm for mark&sweep garbage collection (GC) in a realistic model using synchronization primitives compare-and-swap (CAS) and load-linked/store-conditional (LL/SC) offered by machine architectures. Mutators and collectors can simultaneously
Parallel object-oriented specification language
Florescu, O.; Voeten, J.P.M.; Theelen, B.D.; Geilen, M.C.W.; Corporaal, H.; Burns, Alan
2008-01-01
The Parallel Object-Oriented Specification Language (POOSL) is an expressive modelling language for hardware/software systems [10]. It was originally defined in [7] as an object-oriented extension of process algebra CCS [6], supporting (conditional) synchronous message passing between
Indian Academy of Sciences (India)
We study the synchronization of coupled dynamical systems on networks. The dynamics is .... Such a time-varying topology can occur in social networks, computer networks, WWW ... This has the effect of reducing the spread of the transverse ...
Synchronization in complex networks
Energy Technology Data Exchange (ETDEWEB)
Arenas, A.; Diaz-Guilera, A.; Moreno, Y.; Zhou, C.; Kurths, J.
2007-12-12
Synchronization processes in populations of locally interacting elements are in the focus of intense research in physical, biological, chemical, technological and social systems. The many efforts devoted to understand synchronization phenomena in natural systems take now advantage of the recent theory of complex networks. In this review, we report the advances in the comprehension of synchronization phenomena when oscillating elements are constrained to interact in a complex network topology. We also overview the new emergent features coming out from the interplay between the structure and the function of the underlying pattern of connections. Extensive numerical work as well as analytical approaches to the problem are presented. Finally, we review several applications of synchronization in complex networks to different disciplines: biological systems and neuroscience, engineering and computer science, and economy and social sciences.
DIFFRACTION SYNCHRONIZATION OF LASERS,
semiconductor lasers while suppressing parasitic generation in the plane of the mirror. The diffraction coupling coefficient of open resonators is calculated, and the stability conditions of the synchronized system is determined.
Traffic signal synchronization.
Huang, Ding-wei; Huang, Wei-neng
2003-05-01
The benefits of traffic signal synchronization are examined within the cellular automata approach. The microsimulations of traffic flow are obtained with different settings of signal period T and time delay delta. Both numerical results and analytical approximations are presented. For undersaturated traffic, the green-light wave solutions can be realized. For saturated traffic, the correlation among the traffic signals has no effect on the throughput. For oversaturated traffic, the benefits of synchronization are manifest only when stochastic noise is suppressed.
International Nuclear Information System (INIS)
Jejcic, A.; Maillard, J.; Maurel, G.; Silva, J.; Wolff-Bacha, F.
1997-01-01
The work in the field of parallel processing has developed as research activities using several numerical Monte Carlo simulations related to basic or applied current problems of nuclear and particle physics. For the applications utilizing the GEANT code development or improvement works were done on parts simulating low energy physical phenomena like radiation, transport and interaction. The problem of actinide burning by means of accelerators was approached using a simulation with the GEANT code. A program of neutron tracking in the range of low energies up to the thermal region has been developed. It is coupled to the GEANT code and permits in a single pass the simulation of a hybrid reactor core receiving a proton burst. Other works in this field refers to simulations for nuclear medicine applications like, for instance, development of biological probes, evaluation and characterization of the gamma cameras (collimators, crystal thickness) as well as the method for dosimetric calculations. Particularly, these calculations are suited for a geometrical parallelization approach especially adapted to parallel machines of the TN310 type. Other works mentioned in the same field refer to simulation of the electron channelling in crystals and simulation of the beam-beam interaction effect in colliders. The GEANT code was also used to simulate the operation of germanium detectors designed for natural and artificial radioactivity monitoring of environment
Neural Synchronization and Cryptography
Ruttor, Andreas
2007-11-01
Neural networks can synchronize by learning from each other. In the case of discrete weights full synchronization is achieved in a finite number of steps. Additional networks can be trained by using the inputs and outputs generated during this process as examples. Several learning rules for both tasks are presented and analyzed. In the case of Tree Parity Machines synchronization is much faster than learning. Scaling laws for the number of steps needed for full synchronization and successful learning are derived using analytical models. They indicate that the difference between both processes can be controlled by changing the synaptic depth. In the case of bidirectional interaction the synchronization time increases proportional to the square of this parameter, but it grows exponentially, if information is transmitted in one direction only. Because of this effect neural synchronization can be used to construct a cryptographic key-exchange protocol. Here the partners benefit from mutual interaction, so that a passive attacker is usually unable to learn the generated key in time. The success probabilities of different attack methods are determined by numerical simulations and scaling laws are derived from the data. They show that the partners can reach any desired level of security by just increasing the synaptic depth. Then the complexity of a successful attack grows exponentially, but there is only a polynomial increase of the effort needed to generate a key. Further improvements of security are possible by replacing the random inputs with queries generated by the partners.
Parallel discrete-event simulation of FCFS stochastic queueing networks
Nicol, David M.
1988-01-01
Physical systems are inherently parallel. Intuition suggests that simulations of these systems may be amenable to parallel execution. The parallel execution of a discrete-event simulation requires careful synchronization of processes in order to ensure the execution's correctness; this synchronization can degrade performance. Largely negative results were recently reported in a study which used a well-known synchronization method on queueing network simulations. Discussed here is a synchronization method (appointments), which has proven itself to be effective on simulations of FCFS queueing networks. The key concept behind appointments is the provision of lookahead. Lookahead is a prediction on a processor's future behavior, based on an analysis of the processor's simulation state. It is shown how lookahead can be computed for FCFS queueing network simulations, give performance data that demonstrates the method's effectiveness under moderate to heavy loads, and discuss performance tradeoffs between the quality of lookahead, and the cost of computing lookahead.
Lü, Hua-Ping; Wang, Shi-Hong; Li, Xiao-Wen; Tang, Guo-Ning; Kuang, Jin-Yu; Ye, Wei-Ping; Hu, Gang
2004-06-01
Two-dimensional one-way coupled map lattices are used for cryptography where multiple space units produce chaotic outputs in parallel. One of the outputs plays the role of driving for synchronization of the decryption system while the others perform the function of information encoding. With this separation of functions the receiver can establish a self-checking and self-correction mechanism, and enjoys the advantages of both synchronous and self-synchronizing schemes. A comparison between the present system with the system of advanced encryption standard (AES) is presented in the aspect of channel noise influence. Numerical investigations show that our system is much stronger than AES against channel noise perturbations, and thus can be better used for secure communications with large channel noise.
Dataflow Query Execution in a Parallel Main-Memory Environment
Wilschut, A.N.; Apers, Peter M.G.
1991-01-01
The performance and characteristics of the execution of various join-trees on a parallel DBMS are studied. The results are a step in the direction of the design of a query optimization strategy that is fit for parallel execution of complex queries. Among others, synchronization issues are identified
Memory-based frame synchronizer. [for digital communication systems
Stattel, R. J.; Niswander, J. K. (Inventor)
1981-01-01
A frame synchronizer for use in digital communications systems wherein data formats can be easily and dynamically changed is described. The use of memory array elements provide increased flexibility in format selection and sync word selection in addition to real time reconfiguration ability. The frame synchronizer comprises a serial-to-parallel converter which converts a serial input data stream to a constantly changing parallel data output. This parallel data output is supplied to programmable sync word recognizers each consisting of a multiplexer and a random access memory (RAM). The multiplexer is connected to both the parallel data output and an address bus which may be connected to a microprocessor or computer for purposes of programming the sync word recognizer. The RAM is used as an associative memory or decorder and is programmed to identify a specific sync word. Additional programmable RAMs are used as counter decoders to define word bit length, frame word length, and paragraph frame length.
McCallum, Ethan
2011-01-01
It's tough to argue with R as a high-quality, cross-platform, open source statistical software product-unless you're in the business of crunching Big Data. This concise book introduces you to several strategies for using R to analyze large datasets. You'll learn the basics of Snow, Multicore, Parallel, and some Hadoop-related tools, including how to find them, how to use them, when they work well, and when they don't. With these packages, you can overcome R's single-threaded nature by spreading work across multiple CPUs, or offloading work to multiple machines to address R's memory barrier.
High-performance parallel interface to synchronous optical network gateway
St. John, Wallace B.; DuBois, David H.
1998-08-11
A digital system provides sending and receiving gateways for HIPPI interfaces. Electronic logic circuitry formats data signals and overhead signals in a data frame that is suitable for transmission over a connecting fiber optic link. Multiplexers route the data and overhead signals to a framer module. The framer module allocates the data and overhead signals to a plurality of 9-byte words that are arranged in a selected protocol. The formatted words are stored in a storage register for output through the gateway.
Advanced parallel processing with supercomputer architectures
International Nuclear Information System (INIS)
Hwang, K.
1987-01-01
This paper investigates advanced parallel processing techniques and innovative hardware/software architectures that can be applied to boost the performance of supercomputers. Critical issues on architectural choices, parallel languages, compiling techniques, resource management, concurrency control, programming environment, parallel algorithms, and performance enhancement methods are examined and the best answers are presented. The authors cover advanced processing techniques suitable for supercomputers, high-end mainframes, minisupers, and array processors. The coverage emphasizes vectorization, multitasking, multiprocessing, and distributed computing. In order to achieve these operation modes, parallel languages, smart compilers, synchronization mechanisms, load balancing methods, mapping parallel algorithms, operating system functions, application library, and multidiscipline interactions are investigated to ensure high performance. At the end, they assess the potentials of optical and neural technologies for developing future supercomputers
Directory of Open Access Journals (Sweden)
James G. Worner
2017-05-01
Full Text Available James Worner is an Australian-based writer and scholar currently pursuing a PhD at the University of Technology Sydney. His research seeks to expose masculinities lost in the shadow of Australia’s Anzac hegemony while exploring new opportunities for contemporary historiography. He is the recipient of the Doctoral Scholarship in Historical Consciousness at the university’s Australian Centre of Public History and will be hosted by the University of Bologna during 2017 on a doctoral research writing scholarship. ‘Parallel Lines’ is one of a collection of stories, The Shapes of Us, exploring liminal spaces of modern life: class, gender, sexuality, race, religion and education. It looks at lives, like lines, that do not meet but which travel in proximity, simultaneously attracted and repelled. James’ short stories have been published in various journals and anthologies.
Computer-Aided Parallelizer and Optimizer
Jin, Haoqiang
2011-01-01
The Computer-Aided Parallelizer and Optimizer (CAPO) automates the insertion of compiler directives (see figure) to facilitate parallel processing on Shared Memory Parallel (SMP) machines. While CAPO currently is integrated seamlessly into CAPTools (developed at the University of Greenwich, now marketed as ParaWise), CAPO was independently developed at Ames Research Center as one of the components for the Legacy Code Modernization (LCM) project. The current version takes serial FORTRAN programs, performs interprocedural data dependence analysis, and generates OpenMP directives. Due to the widely supported OpenMP standard, the generated OpenMP codes have the potential to run on a wide range of SMP machines. CAPO relies on accurate interprocedural data dependence information currently provided by CAPTools. Compiler directives are generated through identification of parallel loops in the outermost level, construction of parallel regions around parallel loops and optimization of parallel regions, and insertion of directives with automatic identification of private, reduction, induction, and shared variables. Attempts also have been made to identify potential pipeline parallelism (implemented with point-to-point synchronization). Although directives are generated automatically, user interaction with the tool is still important for producing good parallel codes. A comprehensive graphical user interface is included for users to interact with the parallelization process.
A Semantics of Synchronization.
1980-09-01
suggestion of having very hungry philosophers. One can easily imagine the complexity of the equivalent implementation using semaphores . Synchronization types...Edinburgh, July 1978. [STAR79] Stark, E.W., " Semaphore Primitives and Fair Mutual Exclusion," TM-158, Laboratory for Computer Science, M.I.T., Cambridge...AD-AQ91 015 MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTE--ETC F/S 9/2 A SEMANTICS OF SYNCHRONIZATION .(U) .C SEP 80 C A SEAQUIST N00015-75
Pulse Synchronization System (PSS)
International Nuclear Information System (INIS)
1977-06-01
This document is intended to serve as an operations manual, as well as a documentation of the backup analyses pertinent to the design as delivered. A history of earlier unsuccessful versions of the Pulse Synchronization System (PSS) is not included. The function of the PSS is to synchronize the time of arrival at the fusion target of laser pulses that are propagated through the 20 amplifier chains of the SHIVA laser. The positional accuracy requirement is +-1.5 mm (+-5 psec), and is obtained by the PSS with a wide margin factor
Parallel-Architecture Simulator Development Using Hardware Transactional Memory
Armejach Sanosa, Adrià
2009-01-01
To address the need for a simpler parallel programming model, Transactional Memory (TM) has been developed and promises good parallel performance with easy-to-write parallel code. Unlike lock-based approaches, with TM, programmers do not need to explicitly specify and manage the synchronization among threads. However, programmers simply mark code segments as transactions, and the TM system manages the concurrency control for them. TM can be implemented either in software (STM) or hardware (HT...
Pattern formation and firing synchronization in networks of map neurons
International Nuclear Information System (INIS)
Wang Qingyun; Duan Zhisheng; Huang Lin; Chen Guanrong; Lu Qishao
2007-01-01
Patterns and collective phenomena such as firing synchronization are studied in networks of nonhomogeneous oscillatory neurons and mixtures of oscillatory and excitable neurons, with dynamics of each neuron described by a two-dimensional (2D) Rulkov map neuron. It is shown that as the coupling strength is increased, typical patterns emerge spatially, which propagate through the networks in the form of beautiful target waves or parallel ones depending on the size of networks. Furthermore, we investigate the transitions of firing synchronization characterized by the rate of firing when the coupling strength is increased. It is found that there exists an intermediate coupling strength; firing synchronization is minimal simultaneously irrespective of the size of networks. For further increasing the coupling strength, synchronization is enhanced. Since noise is inevitable in real neurons, we also investigate the effects of white noise on firing synchronization for different networks. For the networks of oscillatory neurons, it is shown that firing synchronization decreases when the noise level increases. For the missed networks, firing synchronization is robust under the noise conditions considered in this paper. Results presented in this paper should prove to be valuable for understanding the properties of collective dynamics in real neuronal networks
Parallel imaging microfluidic cytometer.
Ehrlich, Daniel J; McKenna, Brian K; Evans, James G; Belkina, Anna C; Denis, Gerald V; Sherr, David H; Cheung, Man Ching
2011-01-01
By adding an additional degree of freedom from multichannel flow, the parallel microfluidic cytometer (PMC) combines some of the best features of fluorescence-activated flow cytometry (FCM) and microscope-based high-content screening (HCS). The PMC (i) lends itself to fast processing of large numbers of samples, (ii) adds a 1D imaging capability for intracellular localization assays (HCS), (iii) has a high rare-cell sensitivity, and (iv) has an unusual capability for time-synchronized sampling. An inability to practically handle large sample numbers has restricted applications of conventional flow cytometers and microscopes in combinatorial cell assays, network biology, and drug discovery. The PMC promises to relieve a bottleneck in these previously constrained applications. The PMC may also be a powerful tool for finding rare primary cells in the clinic. The multichannel architecture of current PMC prototypes allows 384 unique samples for a cell-based screen to be read out in ∼6-10 min, about 30 times the speed of most current FCM systems. In 1D intracellular imaging, the PMC can obtain protein localization using HCS marker strategies at many times for the sample throughput of charge-coupled device (CCD)-based microscopes or CCD-based single-channel flow cytometers. The PMC also permits the signal integration time to be varied over a larger range than is practical in conventional flow cytometers. The signal-to-noise advantages are useful, for example, in counting rare positive cells in the most difficult early stages of genome-wide screening. We review the status of parallel microfluidic cytometry and discuss some of the directions the new technology may take. Copyright © 2011 Elsevier Inc. All rights reserved.
Indian Academy of Sciences (India)
We study the synchronization of coupled dynamical systems on networks. The dynamics is governed by a local nonlinear oscillator for each node of the network and interactions connecting different nodes via the links of the network. We consider existence and stability conditions for both single- and multi-cluster ...
Heartbeat synchronized with ventilation
Schäfer, Carsten; Rosenblum, Michael G.; Kurths, Jürgen; Abel, Hans-Henning
1998-03-01
It is widely accepted that cardiac and respiratory rhythms in humans are unsynchronised. However, a newly developed data analysis technique allows any interaction that does occur in even weakly coupled complex systems to be observed. Using this technique, we found long periods of hidden cardiorespiratory synchronization, lasting up to 20 minutes, during spontaneous breathing at rest.
Synchronous, bilateral tonsillar carcinomas
DEFF Research Database (Denmark)
Nami Saber, Camelia; Grønhøj, Christian; Jensen, David Hebbelstrup
2017-01-01
INTRODUCTION: The incidence of oropharyngeal squamous cell carcinoma (OPSCC) is increasing, but data on the incidence of synchronous, bilateral tonsillar squamous cell carcinomas (BiTSCCs) is sparse. In this study, we report the incidence and tumour characteristics of BiTSCCs in a population-base...
Injuries in synchronized skating.
Dubravcic-Simunjak, S; Kuipers, H; Moran, J; Simunjak, B; Pecina, M
2006-06-01
Synchronized skating is a relatively new competitive sport and data about injuries in this discipline are lacking. Therefore the purpose of this study was to investigate the frequency and pattern of acute and overuse injuries in synchronized skaters. Before and during the World Synchronized Skating Championship 2004, a questionnaire inquiring about the frequency of injuries in this skating discipline was given to 23 participating teams. A total of 514 women and 14 men senior skaters completed the questionnaires (100 % response). Two hundred and eighteen (42.4 %) female and 6 (42.9 %) male skaters had suffered from acute injuries during their synchronized skating career. As some skaters had suffered from more than one injury, the total number of acute injuries in females was 398 and in males 14. In female skaters 19.8 % of acute injuries were head injuries, 7.1 % trunk, 33.2 % upper, and 39.9 % lower extremity injuries. In male skaters 14.3 % were head injuries, 28.6 % upper, and 57.1 % lower extremity injuries, with no report of trunk injuries. Sixty-nine female and 2 male skaters had low back problems and 112 female and 2 male skaters had one or more overuse syndromes during their skating career. Of 155 overuse injuries in female skaters, 102 (65.8 %) occurred during their figure skating career, while 53 injuries (34.2 %) only occurred when they skated in synchronized skating teams. In male skaters, out of 5 overuse injuries, 4 (80 %) occurred in their figure skating career, while 1 (20 %) occurred during their synchronized skating career. Out of the total of 412 injuries, 338 (82 %) occurred during on-ice practice, while 74 (18 %) happened during off-ice training. Ninety-one (26.9 %) acute injures occurred while practicing individual elements, and 247 (73.1 %) on-ice injuries occurred while practicing different team elements. We conclude that injuries in synchronized skating should be of medical concern due to an increasing number of acute injuries, especially
Instructor's guide : - synchronized skating school
Mokkila, Eveliina
2011-01-01
The starting point to the Instructor’s guide for synchronized skating school was the situation that Turun Riennon Taitoluistelu figure skating club constantly struggles to get enough skaters to the Beginner team in synchronized skating. The guidebook was written to guide the skating school instructors towards providing more synchronized skating teaching in their lessons. As a result from introducing synchronized skating more in the skating school, it is expected to have more children conti...
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
Self-discharge synchronizing operations in the external electrode fluorescent multi-lamps backlight
International Nuclear Information System (INIS)
Cho, Guangsup; Kwon, Nam O; Kim, Young M; Kim, Sung J; Cho, Tae S; Kim, Bong S; Kang, June G; Choi, Eun H; Lee, Ung W; Yang, Soon C; Uhm, Han S
2003-01-01
The external electrode fluorescent lamp (EEFL) is operated in a high frequency mode because the lamp lighting is basically a dielectric barrier discharge. The self-discharge synchronization is defined by synchronizing the self-discharge time of the dielectric wall charge with the voltage rising and falling time. It is shown that for the self-discharge synchronization a high brightness is obtained in the multi-lamps backlight connected in parallel with the EEFLs operated with square waves from a switching inverter. The frequency for self-discharge synchronizing is also shown to increase as the driving voltage increases
MulticoreBSP for C : A high-performance library for shared-memory parallel programming
Yzelman, A. N.; Bisseling, R. H.; Roose, D.; Meerbergen, K.
2014-01-01
The bulk synchronous parallel (BSP) model, as well as parallel programming interfaces based on BSP, classically target distributed-memory parallel architectures. In earlier work, Yzelman and Bisseling designed a MulticoreBSP for Java library specifically for shared-memory architectures. In the
Synchronizing Strategies under Partial Observability
DEFF Research Database (Denmark)
Larsen, Kim Guldstrand; Laursen, Simon; Srba, Jiri
2014-01-01
Embedded devices usually share only partial information about their current configurations as the communication bandwidth can be restricted. Despite this, we may wish to bring a failed device into a given predetermined configuration. This problem, also known as resetting or synchronizing words, has...... been intensively studied for systems that do not provide any information about their configurations. In order to capture more general scenarios, we extend the existing theory of synchronizing words to synchronizing strategies, and study the synchronization, short-synchronization and subset...
DEFF Research Database (Denmark)
Pedersen, Dennis; Pedersen, Torben Bach
2004-01-01
The increasing availability of XML-based data sources, e.g., for publishing data on the WWW, means that more and more applications (data consumers) rely on accessing and using XML data. Typically, the access is achieved by defining views over the XML data, and accessing data through these views....... However, the XML data sources are often independent of the data consumers and may change their schemas without notification, invalidating the XML views defined by the data consumers. This requires the view definitions to be updated to reflect the new structure of the data sources, a process termed view...... synchronization. XPath is the most commonly used language for retrieving parts of XML documents, and is thus an important cornerstone for XML view definitions. This paper presents techniques for discovering schema changes in XML data sources and synchronizing XPath-based views to reflect these schema changes...
LHC synchronization test successful
The synchronization of the LHC's clockwise beam transfer system and the rest of CERN's accelerator chain was successfully achieved last weekend. Tests began on Friday 8 August when a single bunch of a few particles was taken down the transfer line from the SPS accelerator to the LHC. After a period of optimization, one bunch was kicked up from the transfer line into the LHC beam pipe and steered about 3 kilometres around the LHC itself on the first attempt. On Saturday, the test was repeated several times to optimize the transfer before the operations group handed the machine back for hardware commissioning to resume on Sunday. The anti-clockwise synchronization systems will be tested over the weekend of 22 August.Picture:http://lhc-injection-test.web.cern.ch/lhc-injection-test/
Programmable synchronous communications module
International Nuclear Information System (INIS)
Horelick, D.
1979-10-01
The functional characteristics of a programmable, synchronous serial communications CAMAC module with buffering in block format are described. Both bit and byte oriented protocols can be handled in full duplex depending on the program implemented. The main elements of the module are a Signetics 2652 Multi-Protocol Communications Controller, a Zilog Z-808 8 bit microprocessor with PROM and RAM, and FIFOs for buffering
Program For Parallel Discrete-Event Simulation
Beckman, Brian C.; Blume, Leo R.; Geiselman, John S.; Presley, Matthew T.; Wedel, John J., Jr.; Bellenot, Steven F.; Diloreto, Michael; Hontalas, Philip J.; Reiher, Peter L.; Weiland, Frederick P.
1991-01-01
User does not have to add any special logic to aid in synchronization. Time Warp Operating System (TWOS) computer program is special-purpose operating system designed to support parallel discrete-event simulation. Complete implementation of Time Warp mechanism. Supports only simulations and other computations designed for virtual time. Time Warp Simulator (TWSIM) subdirectory contains sequential simulation engine interface-compatible with TWOS. TWOS and TWSIM written in, and support simulations in, C programming language.
Asynchronous Parallelization of a CFD Solver
Abdi, Daniel S.; Bitsuamlak, Girma T.
2015-01-01
The article of record as published may be found at http://dx.doi.org/10.1155/2015/295393 A Navier-Stokes equations solver is parallelized to run on a cluster of computers using the domain decomposition method. Two approaches of communication and computation are investigated, namely, synchronous and asynchronous methods. Asynchronous communication between subdomains is not commonly used inCFDcodes; however, it has a potential to alleviate scaling bottlenecks incurred due to process...
Optimized Parallel Discrete Event Simulation (PDES) for High Performance Computing (HPC) Clusters
National Research Council Canada - National Science Library
Abu-Ghazaleh, Nael
2005-01-01
The aim of this project was to study the communication subsystem performance of state of the art optimistic simulator Synchronous Parallel Environment for Emulation and Discrete-Event Simulation (SPEEDES...
Exploiting Schemas in Data Synchronization
DEFF Research Database (Denmark)
Foster, J. Nathan; Greenwald, Michael B.; Kirkegaard, Christian
2005-01-01
Increased reliance on optimistic data replication has led to burgeoning interest in tools and frameworks for disconnected updates to replicated data.We have implemented a generic synchronization framework, called HARMONY, that can be used to build state-based synchronizers for a wide variety...... of tree-structureddata formats. A novel feature of this framework is that the synchronization process - in particular, the recognition of conflicts - is driven by the schema of the structures being synchronized.We formalize HARMONY's synchronization algorithm, state a simple and intuitive specification......, and illustrate, using simple address books as a case study, how it can be used to synchronize trees representing a variety of specific forms of applicationdata, including sets, records, tuples, and relations....
Content-based intermedia synchronization
Oh, Dong-Young; Sampath-Kumar, Srihari; Rangan, P. Venkat
1995-03-01
Inter-media synchronization methods developed until now have been based on syntactic timestamping of video frames and audio samples. These methods are not fully appropriate for the synchronization of multimedia objects which may have to be accessed individually by their contents, e.g. content-base data retrieval. We propose a content-based multimedia synchronization scheme in which a media stream is viewed as hierarchial composition of smaller objects which are logically structured based on the contents, and the synchronization is achieved by deriving temporal relations among logical units of media object. content-based synchronization offers several advantages such as, elimination of the need for time stamping, freedom from limitations of jitter, synchronization of independently captured media objects in video editing, and compensation for inherent asynchronies in capture times of video and audio.
Physical Layer Ethernet Clock Synchronization
2010-11-01
42 nd Annual Precise Time and Time Interval (PTTI) Meeting 77 PHYSICAL LAYER ETHERNET CLOCK SYNCHRONIZATION Reinhard Exel, Georg...oeaw.ac.at Nikolaus Kerö Oregano Systems, Mohsgasse 1, 1030 Wien, Austria E-mail: nikolaus.keroe@oregano.at Abstract Clock synchronization ...is a service widely used in distributed networks to coordinate data acquisition and actions. As the requirement to achieve tighter synchronization
DEFF Research Database (Denmark)
Hansen, Erik W.
, to exist, in order to underline the cognitive basis of man's (comprehension of) existence. A theory of history (existence) is set up on the basis of the traditional dualistic sign function, and the traditional sound-law concept and sound development are reinterpreted in terms of the theory's system...... of definitions. Historical linguistics ('change') is not dependent on an arbitrary synchronic theory. The two language universals polysemy and synonymy are reinterpreted and defined in accordance with the advanced definitions. Louis Hjelmslev's glossematic theory is the general horizon of the argument...
Louis, Jean-Paul
2013-01-01
Synchronous motors are indubitably the most effective device to drive industrial production systems and robots with precision and rapidity. Their control law is thus critical for combining at the same time high productivity to reduced energy consummation. As far as possible, the control algorithms must exploit the properties of these actuators. Therefore, this work draws on well adapted models resulting from the Park's transformation, for both the most traditional machines with sinusoidal field distribution and for machines with non-sinusoidal field distribution which are more and more used in
Psychic energy and synchronicity.
Zabriskie, Beverley
2014-04-01
Given Jung's interest in physics' formulations of psychic energy and the concept of time, overlaps and convergences in the themes addressed in analytical psychology and in quantum physics are to be expected. These are informed by the active intersections between the matter of mind and mindfulness re matter. In 1911, Jung initiated dinners with Einstein. Jung's definition of libido in the pivotal 1912 Fordham Lectures reveals the influence of these conversations. Twenty years later, a significant period in physics, Wolfgang Pauli contacted Jung. Their collaboration led to the theory of synchronicity. © 2014, The Society of Analytical Psychology.
Laser Megajoule synchronization system
International Nuclear Information System (INIS)
Luttmann, M.; Pastor, J.F; Drouet, V.; Prat, M.; Raimbourg, J.; Adolf, A.
2011-01-01
This paper describes the synchronisation system under development on the Laser Megajoule (LMJ) in order to synchronize the laser quads on the target to better than 40 ps rms. Our architecture is based on a Timing System (TS) which delivers trigger signals with jitter down to 15 ps rms coupled with an ultra precision timing system with 5 ps rms jitter. In addition to TS, a sensor placed at the target chamber center measures the arrival times of the 3 omega nano joule laser pulses generated by front end shots. (authors)
Accelerated testing for synchronous orbits
Mcdermott, P.
1981-01-01
Degradation of batteries during synchronous orbits is analyzed. Discharge and recharge rates are evaluated. The functional relationship between charge rate and degradation is mathematically determined.
Medical issues in synchronized skating.
Abbott, Kristin; Hecht, Suzanne
2013-01-01
Synchronized skating is a unique sport of team skating and currently represents the largest competitive discipline in U.S. Figure Skating. Synchronized skating allows skaters to compete as part of a team with opportunities to represent their country in international competitions. As the popularity of the sport continues to grow, more of these athletes will present to sports medicine clinics with injuries and illnesses related to participation in synchronized skating. The purpose of this article is to review the common injuries and medical conditions affecting synchronized skaters.
Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors
Banerjee, Prithviraj; Jones, Mark Howard; Sargent, Jeff S.
1990-01-01
Two parallel algorithms for standard cell placement using simulated annealing are developed to run on distributed-memory message-passing hypercube multiprocessors. The cells can be mapped in a two-dimensional area of a chip onto processors in an n-dimensional hypercube in two ways, such that both small and large cell exchange and displacement moves can be applied. The computation of the cost function in parallel among all the processors in the hypercube is described, along with a distributed data structure that needs to be stored in the hypercube to support the parallel cost evaluation. A novel tree broadcasting strategy is used extensively for updating cell locations in the parallel environment. A dynamic parallel annealing schedule estimates the errors due to interacting parallel moves and adapts the rate of synchronization automatically. Two novel approaches in controlling error in parallel algorithms are described: heuristic cell coloring and adaptive sequence control.
Portable parallel programming in a Fortran environment
International Nuclear Information System (INIS)
May, E.N.
1989-01-01
Experience using the Argonne-developed PARMACs macro package to implement a portable parallel programming environment is described. Fortran programs with intrinsic parallelism of coarse and medium granularity are easily converted to parallel programs which are portable among a number of commercially available parallel processors in the class of shared-memory bus-based and local-memory network based MIMD processors. The parallelism is implemented using standard UNIX (tm) tools and a small number of easily understood synchronization concepts (monitors and message-passing techniques) to construct and coordinate multiple cooperating processes on one or many processors. Benchmark results are presented for parallel computers such as the Alliant FX/8, the Encore MultiMax, the Sequent Balance, the Intel iPSC/2 Hypercube and a network of Sun 3 workstations. These parallel machines are typical MIMD types with from 8 to 30 processors, each rated at from 1 to 10 MIPS processing power. The demonstration code used for this work is a Monte Carlo simulation of the response to photons of a ''nearly realistic'' lead, iron and plastic electromagnetic and hadronic calorimeter, using the EGS4 code system. 6 refs., 2 figs., 2 tabs
Synchronized dynamic dose reconstruction
International Nuclear Information System (INIS)
Litzenberg, Dale W.; Hadley, Scott W.; Tyagi, Neelam; Balter, James M.; Ten Haken, Randall K.; Chetty, Indrin J.
2007-01-01
Variations in target volume position between and during treatment fractions can lead to measurable differences in the dose distribution delivered to each patient. Current methods to estimate the ongoing cumulative delivered dose distribution make idealized assumptions about individual patient motion based on average motions observed in a population of patients. In the delivery of intensity modulated radiation therapy (IMRT) with a multi-leaf collimator (MLC), errors are introduced in both the implementation and delivery processes. In addition, target motion and MLC motion can lead to dosimetric errors from interplay effects. All of these effects may be of clinical importance. Here we present a method to compute delivered dose distributions for each treatment beam and fraction, which explicitly incorporates synchronized real-time patient motion data and real-time fluence and machine configuration data. This synchronized dynamic dose reconstruction method properly accounts for the two primary classes of errors that arise from delivering IMRT with an MLC: (a) Interplay errors between target volume motion and MLC motion, and (b) Implementation errors, such as dropped segments, dose over/under shoot, faulty leaf motors, tongue-and-groove effect, rounded leaf ends, and communications delays. These reconstructed dose fractions can then be combined to produce high-quality determinations of the dose distribution actually received to date, from which individualized adaptive treatment strategies can be determined
International Nuclear Information System (INIS)
Corvin, C.
1995-06-01
A synchronous condenser is a synchronous machine that generates reactive power that leads real power by 90 degrees in phase. The leading reactive power generated by the condenser offsets or cancels the normal lagging reactive power consumed by inductive and nonlinear loads at the accelerator complex. The quality of SLAC's utility power is improved with the addition of the condenser. The inertia of the condenser's 35,000 pound rotor damps and smoothes voltage excursions on two 12 kilovolt master substation buses, improving voltage regulation site wide. The condenser absorbs high frequency transients and noise in effect ''scrubbing'' the electric system power at its primary distribution source. In addition, the condenser produces a substantial savings in power costs. Federal and investor owned utilities that supply electric power to SLAC levy a monthly penalty for lagging reactive power delivered to the site. For the 1993 fiscal year this totaled over $285,000 in added costs for the year. By generating leading reactive power on site, thereby reducing total lagging reactive power requirements, a substantial savings in electric utility bills is achieved. Actual savings of $150,000 or more a year are possible depending on experimental operations
FPGA based fast synchronous serial multi-wire links synchronization
Pozniak, Krzysztof T.
2013-10-01
The paper debates synchronization method of multi-wire, serial link of constant latency, by means of pseudo-random numbers generators. The solution was designed for various families of FPGA circuits. There were debated synchronization algorithm and functional structure of parameterized transmitter and receiver modules. The modules were realized in VHDL language in a behavioral form.
Synchronization dynamics of two different dynamical systems
International Nuclear Information System (INIS)
Luo, Albert C.J.; Min Fuhong
2011-01-01
Highlights: → Synchronization dynamics of two distinct dynamical systems. → Synchronization, de-synchronization and instantaneous synchronization. → A controlled pendulum synchronizing with the Duffing oscillator. → Synchronization invariant set. → Synchronization parameter map. - Abstract: In this paper, synchronization dynamics of two different dynamical systems is investigated through the theory of discontinuous dynamical systems. The necessary and sufficient conditions for the synchronization, de-synchronization and instantaneous synchronization (penetration or grazing) are presented. Using such a synchronization theory, the synchronization of a controlled pendulum with the Duffing oscillator is systematically discussed as a sampled problem, and the corresponding analytical conditions for the synchronization are presented. The synchronization parameter study is carried out for a better understanding of synchronization characteristics of the controlled pendulum and the Duffing oscillator. Finally, the partial and full synchronizations of the controlled pendulum with periodic and chaotic motions are presented to illustrate the analytical conditions. The synchronization of the Duffing oscillator and pendulum are investigated in order to show the usefulness and efficiency of the methodology in this paper. The synchronization invariant domain is obtained. The technique presented in this paper should have a wide spectrum of applications in engineering. For example, this technique can be applied to the maneuvering target tracking, and the others.
Business cycle synchronization in Europe
DEFF Research Database (Denmark)
Bergman, Ulf Michael; Jonung, Lars
2011-01-01
In this paper we study business cycle synchronization in the three Scandinavian countries Denmark, Norway and Sweden prior to, during and after the Scandinavian Currency Union 1873–1913. We find that the degree of synchronization tended to increase during the currency union, thus supporting earlier...
Biologically Inspired Intercellular Slot Synchronization
Directory of Open Access Journals (Sweden)
Alexander Tyrrell
2009-01-01
Full Text Available The present article develops a decentralized interbase station slot synchronization algorithm suitable for cellular mobile communication systems. The proposed cellular firefly synchronization (CelFSync algorithm is derived from the theory of pulse-coupled oscillators, common to describe synchronization phenomena in biological systems, such as the spontaneous synchronization of fireflies. In order to maintain synchronization among base stations (BSs, even when there is no direct link between adjacent BSs, some selected user terminals (UTs participate in the network synchronization process. Synchronization emerges by exchanging two distinct synchronization words, one transmitted by BSs and the other by active UTs, without any a priori assumption on the initial timing misalignments of BSs and UTs. In large-scale networks with inter-BS site distances up to a few kilometers, propagation delays severely affect the attainable timing accuracy of CelFSync. We show that by an appropriate combination of CelFSync with the timing advance procedure, which aligns uplink transmission of UTs to arrive simultaneously at the BS, a timing accuracy within a fraction of the inter-BS propagation delay is retained.
Introduction to media synchronization (Mediasync)
M.A. Montagud Climent (Mario); P.S. Cesar Garcia (Pablo Santiago); F. Boronat (Fernando); A.J. Jansen (Jack)
2018-01-01
textabstractMedia synchronization is a core research area in multimedia systems. This chapter introduces the area by providing key definitions, classifications, and examples. It also discusses the relevance of different types of media synchronization to ensure satisfactory Quality of Experience
Distributed Synchronization in Communication Networks
2018-01-24
synchronization. Secondly, it is known that identical oscillators with sin() coupling functions are guaranteed to synchronize in phase on a complete...provide sufficient conditions for phase- locking , i.e., convergence to a stable equilibrium almost surely. We additionally find conditions when the
[Synchronous sigmoideum- and caecum volvulus].
Berg, Anna Korsgaard; Perdawood, Sharaf Karim
2015-09-21
This case presents a synchronous sigmoid- and caecum volvulus in a 69-year old man with Parkinson's disease, hypertension and previous history of colonic volvulus. On admission the patient had abdominal pain, nausea, vomiting and constipation. The CT scan showed a sigmoid volvulus with a dilated caecum. The synchronous sigmoideum- and caecum volvulus was diagnosed intraoperatively. Total colectomy and ileostomy was performed.
Digital synchronization and communication techniques
Lindsey, William C.
1992-01-01
Information on digital synchronization and communication techniques is given in viewgraph form. Topics covered include phase shift keying, modems, characteristics of open loop digital synchronizers, an open loop phase and frequency estimator, and a digital receiver structure using an open loop estimator in a decision directed architecture.
Parallel Programming with Intel Parallel Studio XE
Blair-Chappell , Stephen
2012-01-01
Optimize code for multi-core processors with Intel's Parallel Studio Parallel programming is rapidly becoming a "must-know" skill for developers. Yet, where to start? This teach-yourself tutorial is an ideal starting point for developers who already know Windows C and C++ and are eager to add parallelism to their code. With a focus on applying tools, techniques, and language extensions to implement parallelism, this essential resource teaches you how to write programs for multicore and leverage the power of multicore in your programs. Sharing hands-on case studies and real-world examples, the
Parallel computing of physical maps--a comparative study in SIMD and MIMD parallelism.
Bhandarkar, S M; Chirravuri, S; Arnold, J
1996-01-01
Ordering clones from a genomic library into physical maps of whole chromosomes presents a central computational problem in genetics. Chromosome reconstruction via clone ordering is usually isomorphic to the NP-complete Optimal Linear Arrangement problem. Parallel SIMD and MIMD algorithms for simulated annealing based on Markov chain distribution are proposed and applied to the problem of chromosome reconstruction via clone ordering. Perturbation methods and problem-specific annealing heuristics are proposed and described. The SIMD algorithms are implemented on a 2048 processor MasPar MP-2 system which is an SIMD 2-D toroidal mesh architecture whereas the MIMD algorithms are implemented on an 8 processor Intel iPSC/860 which is an MIMD hypercube architecture. A comparative analysis of the various SIMD and MIMD algorithms is presented in which the convergence, speedup, and scalability characteristics of the various algorithms are analyzed and discussed. On a fine-grained, massively parallel SIMD architecture with a low synchronization overhead such as the MasPar MP-2, a parallel simulated annealing algorithm based on multiple periodically interacting searches performs the best. For a coarse-grained MIMD architecture with high synchronization overhead such as the Intel iPSC/860, a parallel simulated annealing algorithm based on multiple independent searches yields the best results. In either case, distribution of clonal data across multiple processors is shown to exacerbate the tendency of the parallel simulated annealing algorithm to get trapped in a local optimum.
Evaluation of global synchronization for iterative algebra algorithms on many-core
ul Hasan Khan, Ayaz; Al-Mouhamed, Mayez; Firdaus, Lutfi A.
2015-01-01
© 2015 IEEE. Massively parallel computing is applied extensively in various scientific and engineering domains. With the growing interest in many-core architectures and due to the lack of explicit support for inter-block synchronization specifically in GPUs, synchronization becomes necessary to minimize inter-block communication time. In this paper, we have proposed two new inter-block synchronization techniques: 1) Relaxed Synchronization, and 2) Block-Query Synchronization. These schemes are used in implementing numerical iterative solvers where computation/communication overlapping is one used optimization to enhance application performance. We have evaluated and analyzed the performance of the proposed synchronization techniques using Jacobi Iterative Solver in comparison to the state of the art inter-block lock-free synchronization techniques. We have achieved about 1-8% performance improvement in terms of execution time over lock-free synchronization depending on the problem size and the number of thread blocks. We have also evaluated the proposed algorithm on GPU and MIC architectures and obtained about 8-26% performance improvement over the barrier synchronization available in OpenMP programming environment depending on the problem size and number of cores used.
Evaluation of global synchronization for iterative algebra algorithms on many-core
ul Hasan Khan, Ayaz
2015-06-01
© 2015 IEEE. Massively parallel computing is applied extensively in various scientific and engineering domains. With the growing interest in many-core architectures and due to the lack of explicit support for inter-block synchronization specifically in GPUs, synchronization becomes necessary to minimize inter-block communication time. In this paper, we have proposed two new inter-block synchronization techniques: 1) Relaxed Synchronization, and 2) Block-Query Synchronization. These schemes are used in implementing numerical iterative solvers where computation/communication overlapping is one used optimization to enhance application performance. We have evaluated and analyzed the performance of the proposed synchronization techniques using Jacobi Iterative Solver in comparison to the state of the art inter-block lock-free synchronization techniques. We have achieved about 1-8% performance improvement in terms of execution time over lock-free synchronization depending on the problem size and the number of thread blocks. We have also evaluated the proposed algorithm on GPU and MIC architectures and obtained about 8-26% performance improvement over the barrier synchronization available in OpenMP programming environment depending on the problem size and number of cores used.
Generalized synchronization between chimera states
Andrzejak, Ralph G.; Ruzzene, Giulia; Malvestio, Irene
2017-05-01
Networks of coupled oscillators in chimera states are characterized by an intriguing interplay of synchronous and asynchronous motion. While chimera states were initially discovered in mathematical model systems, there is growing experimental and conceptual evidence that they manifest themselves also in natural and man-made networks. In real-world systems, however, synchronization and desynchronization are not only important within individual networks but also across different interacting networks. It is therefore essential to investigate if chimera states can be synchronized across networks. To address this open problem, we use the classical setting of ring networks of non-locally coupled identical phase oscillators. We apply diffusive drive-response couplings between pairs of such networks that individually show chimera states when there is no coupling between them. The drive and response networks are either identical or they differ by a variable mismatch in their phase lag parameters. In both cases, already for weak couplings, the coherent domain of the response network aligns its position to the one of the driver networks. For identical networks, a sufficiently strong coupling leads to identical synchronization between the drive and response. For non-identical networks, we use the auxiliary system approach to demonstrate that generalized synchronization is established instead. In this case, the response network continues to show a chimera dynamics which however remains distinct from the one of the driver. Hence, segregated synchronized and desynchronized domains in individual networks congregate in generalized synchronization across networks.
Parallel-aware, dedicated job co-scheduling within/across symmetric multiprocessing nodes
Jones, Terry R.; Watson, Pythagoras C.; Tuel, William; Brenner, Larry; ,Caffrey, Patrick; Fier, Jeffrey
2010-10-05
In a parallel computing environment comprising a network of SMP nodes each having at least one processor, a parallel-aware co-scheduling method and system for improving the performance and scalability of a dedicated parallel job having synchronizing collective operations. The method and system uses a global co-scheduler and an operating system kernel dispatcher adapted to coordinate interfering system and daemon activities on a node and across nodes to promote intra-node and inter-node overlap of said interfering system and daemon activities as well as intra-node and inter-node overlap of said synchronizing collective operations. In this manner, the impact of random short-lived interruptions, such as timer-decrement processing and periodic daemon activity, on synchronizing collective operations is minimized on large processor-count SPMD bulk-synchronous programming styles.
Three types of generalized synchronization
Energy Technology Data Exchange (ETDEWEB)
Yang Junzhong [School of Science, Beijing University of Posts and Telecomunications, Beijing 100876 (China)]. E-mail: jzyang@bupt.edu.cn; Hu Gang [China Center for Advanced Science and Technology (CCAST) (World Laboratory), PO Box 8730, Beijing 100080 (China) and Department of Physics, Beijing Normal University, Beijing 100875 (China)]. E-mail: ganghu@bnu.edu.cn
2007-02-05
The roles played by drive and response systems on generalized chaos synchronization (GS) are studied. And the generalized synchronization is classified, based on these roles, to three distinctive types: the passive GS which is mainly determined by the response system and insensitive to the driving signal; the resonant GS where phase synchronization between the drive and response systems is preceding GS; and the interacting GS where both the drive and response have influences on the status of GS. The features of these GS types and the possible changes from one types to others are investigated.
Three types of generalized synchronization
International Nuclear Information System (INIS)
Yang Junzhong; Hu Gang
2007-01-01
The roles played by drive and response systems on generalized chaos synchronization (GS) are studied. And the generalized synchronization is classified, based on these roles, to three distinctive types: the passive GS which is mainly determined by the response system and insensitive to the driving signal; the resonant GS where phase synchronization between the drive and response systems is preceding GS; and the interacting GS where both the drive and response have influences on the status of GS. The features of these GS types and the possible changes from one types to others are investigated
Morse, H Stephen
1994-01-01
Practical Parallel Computing provides information pertinent to the fundamental aspects of high-performance parallel processing. This book discusses the development of parallel applications on a variety of equipment.Organized into three parts encompassing 12 chapters, this book begins with an overview of the technology trends that converge to favor massively parallel hardware over traditional mainframes and vector machines. This text then gives a tutorial introduction to parallel hardware architectures. Other chapters provide worked-out examples of programs using several parallel languages. Thi
Akl, Selim G
1985-01-01
Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the
RAMA: A file system for massively parallel computers
Miller, Ethan L.; Katz, Randy H.
1993-01-01
This paper describes a file system design for massively parallel computers which makes very efficient use of a few disks per processor. This overcomes the traditional I/O bottleneck of massively parallel machines by storing the data on disks within the high-speed interconnection network. In addition, the file system, called RAMA, requires little inter-node synchronization, removing another common bottleneck in parallel processor file systems. Support for a large tertiary storage system can easily be integrated in lo the file system; in fact, RAMA runs most efficiently when tertiary storage is used.
Noncoherent Symbol Synchronization Techniques
Simon, Marvin
2005-01-01
Traditional methods for establishing symbol synchronization (sync) in digital communication receivers assume that carrier sync has already been established, i.e., the problem is addressed at the baseband level assuming that a 'perfect' estimate of carrier phase is available. We refer to this approach as coherent symbol sync. Since, for NRZ signaling, a suppressed carrier sync loop such as an I-Q Costas loop includes integrate-and-dump (I and D) filters in its in-phase (1) and quadrature (Q) arms, the traditional approach is to first track the carrier in the absence of symbol sync information, then feed back the symbol sync estimate to these filters, and then iterate between the two to a desirable operating level In this paper, we revisit the symbol sync problem by examining methods for obtaining such sync in the absence of carrier phase information, i.e., so-called noncoherent symbol sync loops. We compare the performance of these loops with that of a well-known coherent symbol sync loop and examine the conditions under which one is preferable over the other.
Cross-spectrum symbol synchronization
Mccallister, R. D.; Simon, M. K.
1981-01-01
A popular method of symbol synchronization exploits one aspect of generalized harmonic analysis, normally referred to as the cross-spectrum. Utilizing nonlinear techniques, the input symbol energy is effectively concentrated onto multiples of the symbol clock frequency, facilitating application of conventional phase lock synchronization techniques. A general treatment of the cross-spectrum technique is developed and shown to be applicable across a broad class of symbol modulation formats. An important specific symbol synchronization application is then treated, focusing the general development to provide both insight and quantitative measure of the performance impact associated with variation in these key synchronization parameters: symbol modulation format, symbol transition probability, symbol energy to noise density ratio, and symbol rate to filter bandwidth ratio.
Principles of synchronous digital hierarchy
Jain, Rajesh Kumar
2012-01-01
The book presents the current standards of digital multiplexing, called synchronous digital hierarchy, including analog multiplexing technologies. It is aimed at telecommunication professionals who want to develop an understanding of digital multiplexing and synchronous digital hierarchy in particular and the functioning of practical telecommunication systems in general. The text includes all relevant fundamentals and provides a handy reference for problem solving or defining operations and maintenance strategies. The author covers digital conversion and TDM principles, line coding and digital
Synchronous Half-Wave Rectifier
Rippel, Wally E.
1989-01-01
Synchronous rectifying circuit behaves like diode having unusually low voltage drop during forward-voltage half cycles. Circuit particularly useful in power supplies with potentials of 5 Vdc or less, where normal forward-voltage drops in ordinary diodes unacceptably large. Fabricated as monolithic assembly or as hybrid. Synchronous half-wave rectifier includes active circuits to attain low forward voltage drop and high rectification efficiency.
Hybrid synchronization of hyperchaotic Lu system
Indian Academy of Sciences (India)
In this paper, we study the hybrid synchronization between two identical hyperchaotic Lu systems. Hybrid synchronization of hyperchaotic Lu system is achieved through synchronization of two pairs of states and anti-synchronization of the other two pairs of states. Active controls are designed to achieve hybrid ...
Introduction to parallel programming
Brawer, Steven
1989-01-01
Introduction to Parallel Programming focuses on the techniques, processes, methodologies, and approaches involved in parallel programming. The book first offers information on Fortran, hardware and operating system models, and processes, shared memory, and simple parallel programs. Discussions focus on processes and processors, joining processes, shared memory, time-sharing with multiple processors, hardware, loops, passing arguments in function/subroutine calls, program structure, and arithmetic expressions. The text then elaborates on basic parallel programming techniques, barriers and race
Fox, Geoffrey C; Messina, Guiseppe C
2014-01-01
A clear illustration of how parallel computers can be successfully appliedto large-scale scientific computations. This book demonstrates how avariety of applications in physics, biology, mathematics and other scienceswere implemented on real parallel computers to produce new scientificresults. It investigates issues of fine-grained parallelism relevant forfuture supercomputers with particular emphasis on hypercube architecture. The authors describe how they used an experimental approach to configuredifferent massively parallel machines, design and implement basic systemsoftware, and develop
Synchronization and anti-synchronization coexist in Chen-Lee chaotic systems
International Nuclear Information System (INIS)
Chen, J.-H.; Chen, H.-K.; Lin, Y.-K.
2009-01-01
This study demonstrates that synchronization and anti-synchronization can coexist in Chen-Lee chaotic systems by direct linear coupling. Based on Lyapunov's direct method, a linear controller was designed to assure that two different types of synchronization can simultaneously be achieved. Further, the hybrid projective synchronization of Chen-Lee chaotic systems was studied using a nonlinear control scheme. The nonlinear controller was designed according to the Lyapunov stability theory to guarantee the hybrid projective synchronization, including synchronization, anti-synchronization, and projective synchronization. Finally, numerical examples are presented in order to illustrate the proposed synchronization approach.
Outer Synchronization of Complex Networks by Impulse
International Nuclear Information System (INIS)
Sun Wen; Yan Zizong; Chen Shihua; Lü Jinhu
2011-01-01
This paper investigates outer synchronization of complex networks, especially, outer complete synchronization and outer anti-synchronization between the driving network and the response network. Employing the impulsive control method which is uncontinuous, simple, efficient, low-cost and easy to implement in practical applications, we obtain some sufficient conditions of outer complete synchronization and outer anti-synchronization between two complex networks. Numerical simulations demonstrate the effectiveness of the proposed impulsive control scheme. (general)
Unidirectional synchronization of Hodgkin-Huxley neurons
Energy Technology Data Exchange (ETDEWEB)
Cornejo-Perez, Octavio [Division de Matematicas Aplicadas y Sistemas, Computacionales, IPICYT, Apdo. Postal 3-74 Tangamanga, 78231 San Luis Potosi (Mexico)]. E-mail: octavio@ipicyt.edu.mx; Femat, Ricardo [Division de Matematicas Aplicadas y Sistemas, Computacionales, IPICYT, Apdo. Postal 3-74 Tangamanga, 78231 San Luis Potosi (Mexico)]. E-mail: rfemat@ipicyt.edu.mx
2005-07-01
Synchronization dynamics of two noiseless Hodgkin-Huxley (HH) neurons under the action of feedback control is studied. The spiking patterns of the action potentials evoked by periodic external modulations attain synchronization states under the feedback action. Numerical simulations for the synchronization dynamics of regular-irregular desynchronized spiking sequences are displayed. The results are discussed in context of generalized synchronization. It is also shown that the HH neurons can be synchronized in face of unmeasured states.
Parallel Atomistic Simulations
Energy Technology Data Exchange (ETDEWEB)
HEFFELFINGER,GRANT S.
2000-01-18
Algorithms developed to enable the use of atomistic molecular simulation methods with parallel computers are reviewed. Methods appropriate for bonded as well as non-bonded (and charged) interactions are included. While strategies for obtaining parallel molecular simulations have been developed for the full variety of atomistic simulation methods, molecular dynamics and Monte Carlo have received the most attention. Three main types of parallel molecular dynamics simulations have been developed, the replicated data decomposition, the spatial decomposition, and the force decomposition. For Monte Carlo simulations, parallel algorithms have been developed which can be divided into two categories, those which require a modified Markov chain and those which do not. Parallel algorithms developed for other simulation methods such as Gibbs ensemble Monte Carlo, grand canonical molecular dynamics, and Monte Carlo methods for protein structure determination are also reviewed and issues such as how to measure parallel efficiency, especially in the case of parallel Monte Carlo algorithms with modified Markov chains are discussed.
On eliminating synchronous communication in molecular simulations to improve scalability
Straatsma, T. P.; Chavarría-Miranda, Daniel G.
2013-12-01
Molecular dynamics simulation, as a complementary tool to experimentation, has become an important methodology for the understanding and design of molecular systems as it provides access to properties that are difficult, impossible or prohibitively expensive to obtain experimentally. Many of the available software packages have been parallelized to take advantage of modern massively concurrent processing resources. The challenge in achieving parallel efficiency is commonly attributed to the fact that molecular dynamics algorithms are communication intensive. This paper illustrates how an appropriately chosen data distribution and asynchronous one-sided communication approach can be used to effectively deal with the data movement within the Global Arrays/ARMCI programming model framework. A new put_notify capability is presented here, allowing the implementation of the molecular dynamics algorithm without any explicit global or local synchronization or global data reduction operations. In addition, this push-data model is shown to very effectively allow hiding data communication behind computation. Rather than data movement or explicit global reductions, the implicit synchronization of the algorithm becomes the primary challenge for scalability. Without any explicit synchronous operations, the scalability of molecular simulations is shown to depend only on the ability to evenly balance computational load.
Facility-wide synchronization of standard FAIR equipment controllers
International Nuclear Information System (INIS)
Rauch, S.; Terpstra, W.; Panschow, W.; Thieme, M.; Prados, C.; Zweig, M.; Kreider, M.; Beck, D.; Bär, R.
2012-01-01
The standard equipment controller under development for the new FAIR accelerator facility is the Scalable Control Unit (SCU). It is designed to synchronize and control the actions of up to 12 purpose-built slave cards, connected in a proprietary crate by a parallel backplane. Inter-crate coordination and facility-wide synchronization are a core FAIR requirement and thus precise timing of SCU slave actions is of vital importance. The SCU consists primarily of two components, an x86 COM Express daughter board and a carrier board with an Altera Arria II GX FPGA, interconnected by PCI Express. The x86 receives configuration and set values with which it programs the real-time event-condition-action (ECA) unit in the FPGA. The ECA unit receives event messages via the timing network, which also synchronizes the clocks of all SCUs in the facility using White Rabbit. Matching events trigger actions on the SCU slave cards such as: ramping magnets, triggering kickers, etc. Timing requirements differ depending on the action taken. For softer real-time actions, an interrupt can be generated for complex processing on the x86. Alternatively, the FPGA can directly fire a pulse out a LEMO output or an immediate SCU bus operation. The delay and synchronization achievable in each case differs and this paper examines the timing performance of each to determine which approach is appropriate for the required actions. (author)
Bodily Synchronization Underlying Joke Telling
Directory of Open Access Journals (Sweden)
R. C. Schmidt
2014-08-01
Full Text Available Advances in video and time series analysis have greatly enhanced our ability to study the bodily synchronization that occurs in natural interactions. Past research has demonstrated that the behavioral synchronization involved in social interactions is similar to dynamical synchronization found generically in nature. The present study investigated how the bodily synchronization in a joke telling task is spread across different nested temporal scales. Pairs of participants enacted knock-knock jokes and times series of their bodily activity were recorded. Coherence and relative phase analyses were used to evaluate the synchronization of bodily rhythms for the whole trial as well as at the subsidiary time scales of the whole joke, the setup of the punch line, the two-person exchange and the utterance. The analyses revealed greater than chance entrainment of the joke teller’s and joke responder’s movements at all time scales and that the relative phasing of the teller’s movements led those of the responder at the longer time scales. Moreover, this entrainment was greater when visual information about the partner’s movements was present but was decreased particularly at the shorter time scales when explicit gesturing in telling the joke was performed. In short, the results demonstrate that a complex interpersonal bodily dance occurs during structured conversation interactions and that this dance is constructed from a set of rhythms associated with the nested behavioral structure of the interaction.
Vestibular hearing and neural synchronization.
Emami, Seyede Faranak; Daneshi, Ahmad
2012-01-01
Objectives. Vestibular hearing as an auditory sensitivity of the saccule in the human ear is revealed by cervical vestibular evoked myogenic potentials (cVEMPs). The range of the vestibular hearing lies in the low frequency. Also, the amplitude of an auditory brainstem response component depends on the amount of synchronized neural activity, and the auditory nerve fibers' responses have the best synchronization with the low frequency. Thus, the aim of this study was to investigate correlation between vestibular hearing using cVEMPs and neural synchronization via slow wave Auditory Brainstem Responses (sABR). Study Design. This case-control survey was consisted of twenty-two dizzy patients, compared to twenty healthy controls. Methods. Intervention comprised of Pure Tone Audiometry (PTA), Impedance acoustic metry (IA), Videonystagmography (VNG), fast wave ABR (fABR), sABR, and cVEMPs. Results. The affected ears of the dizzy patients had the abnormal findings of cVEMPs (insecure vestibular hearing) and the abnormal findings of sABR (decreased neural synchronization). Comparison of the cVEMPs at affected ears versus unaffected ears and the normal persons revealed significant differences (P < 0.05). Conclusion. Safe vestibular hearing was effective in the improvement of the neural synchronization.
CERN. Geneva
2016-01-01
The traditionally used and well established parallel programming models OpenMP and MPI are both targeting lower level parallelism and are meant to be as language agnostic as possible. For a long time, those models were the only widely available portable options for developing parallel C++ applications beyond using plain threads. This has strongly limited the optimization capabilities of compilers, has inhibited extensibility and genericity, and has restricted the use of those models together with other, modern higher level abstractions introduced by the C++11 and C++14 standards. The recent revival of interest in the industry and wider community for the C++ language has also spurred a remarkable amount of standardization proposals and technical specifications being developed. Those efforts however have so far failed to build a vision on how to seamlessly integrate various types of parallelism, such as iterative parallel execution, task-based parallelism, asynchronous many-task execution flows, continuation s...
Parallelism in matrix computations
Gallopoulos, Efstratios; Sameh, Ahmed H
2016-01-01
This book is primarily intended as a research monograph that could also be used in graduate courses for the design of parallel algorithms in matrix computations. It assumes general but not extensive knowledge of numerical linear algebra, parallel architectures, and parallel programming paradigms. The book consists of four parts: (I) Basics; (II) Dense and Special Matrix Computations; (III) Sparse Matrix Computations; and (IV) Matrix functions and characteristics. Part I deals with parallel programming paradigms and fundamental kernels, including reordering schemes for sparse matrices. Part II is devoted to dense matrix computations such as parallel algorithms for solving linear systems, linear least squares, the symmetric algebraic eigenvalue problem, and the singular-value decomposition. It also deals with the development of parallel algorithms for special linear systems such as banded ,Vandermonde ,Toeplitz ,and block Toeplitz systems. Part III addresses sparse matrix computations: (a) the development of pa...
Linear Synchronous Motor Repeatability Tests
International Nuclear Information System (INIS)
Ward, C.R.
2002-01-01
A cart system using linear synchronous motors was being considered for the Plutonium Immobilization Plant (PIP). One of the applications in the PIP was the movement of a stack of furnace trays, filled with the waste form (pucks) from a stacking/unstacking station to several bottom loaded furnaces. A system was ordered to perform this function in the PIP Ceramic Prototype Test Facility (CPTF). This system was installed and started up in SRTC prior to being installed in the CPTF. The PIP was suspended and then canceled after the linear synchronous motor system was started up. This system was used to determine repeatability of a linear synchronous motor cart system for the Modern Pit Facility
[Rapid identification of hogwash oil by using synchronous fluorescence spectroscopy].
Sun, Yan-Hui; An, Hai-Yang; Jia, Xiao-Li; Wang, Juan
2012-10-01
To identify hogwash oil quickly, the characteristic delta lambda of hogwash oil was analyzed by three dimensional fluorescence spectroscopy with parallel factor analysis, and the model was built up by using synchronous fluorescence spectroscopy with support vector machines (SVM). The results showed that the characteristic delta lambda of hogwash oil was 60 nm. Collecting original spectrum of different samples under the condition of characteristic delta lambda 60 nm, the best model was established while 5 principal components were selected from original spectrum and the radial basis function (RBF) was used as the kernel function, and the optimal penalty factor C and kernel function g were 512 and 0.5 respectively obtained by the grid searching and 6-fold cross validation. The discrimination rate of the model was 100% for both training sets and prediction sets. Thus, it is quick and accurate to apply synchronous fluorescence spectroscopy to identification of hogwash oil.
Machine Translation Using Constraint-Based Synchronous Grammar
Institute of Scientific and Technical Information of China (English)
WONG Fai; DONG Mingchui; HU Dongcheng
2006-01-01
A synchronous grammar based on the formalism of context-free grammar was developed by generalizing the first component of production that models the source text. Unlike other synchronous grammars,the grammar allows multiple target productions to be associated to a single production rule which can be used to guide a parser to infer different possible translational equivalences for a recognized input string according to the feature constraints of symbols in the pattern. An extended generalized LR algorithm was adapted to the parsing of the proposed formalism to analyze the syntactic structure of a language. The grammar was used as the basis for building a machine translation system for Portuguese to Chinese translation. The empirical results show that the grammar is more expressive when modeling the translational equivalences of parallel texts for machine translation and grammar rewriting applications.
Random field Ising chain and neutral networks with synchronous dynamics
International Nuclear Information System (INIS)
Skantzos, N.S.; Coolen, A.C.C.
2001-01-01
We first present an exact solution of the one-dimensional random-field Ising model in which spin-updates are made fully synchronously, i.e. in parallel (in contrast to the more conventional Glauber-type sequential rules). We find transitions where the support of local observables turns from a continuous interval into a Cantor set and we show that synchronous and sequential random-field models lead asymptotically to the same physical states. We then proceed to an application of these techniques to recurrent neural networks where 1D short-range interactions are combined with infinite-range ones. Due to the competing interactions these models exhibit phase diagrams with first-order transitions and regions with multiple locally stable solutions for the macroscopic order parameters
A synchronous game for binary constraint systems
Kim, Se-Jin; Paulsen, Vern; Schafhauser, Christopher
2018-03-01
Recently, Slofstra proved that the set of quantum correlations is not closed. We prove that the set of synchronous quantum correlations is not closed, which implies his result, by giving an example of a synchronous game that has a perfect quantum approximate strategy but no perfect quantum strategy. We also exhibit a graph for which the quantum independence number and the quantum approximate independence number are different. We prove new characterisations of synchronous quantum approximate correlations and synchronous quantum spatial correlations. We solve the synchronous approximation problem of Dykema and the second author, which yields a new equivalence of Connes' embedding problem in terms of synchronous correlations.
Control of non-conventional synchronous motors
Louis, Jean-Paul
2013-01-01
Classical synchronous motors are the most effective device to drive industrial production systems and robots with precision and rapidity. However, numerous applications require efficient controls in non-conventional situations. Firstly, this is the case with synchronous motors supplied by thyristor line-commutated inverters, or with synchronous motors with faults on one or several phases. Secondly, many drive systems use non-conventional motors such as polyphase (more than three phases) synchronous motors, synchronous motors with double excitation, permanent magnet linear synchronous motors,
DEFF Research Database (Denmark)
Sitchinava, Nodar; Zeh, Norbert
2012-01-01
We present the parallel buffer tree, a parallel external memory (PEM) data structure for batched search problems. This data structure is a non-trivial extension of Arge's sequential buffer tree to a private-cache multiprocessor environment and reduces the number of I/O operations by the number of...... in the optimal OhOf(psortN + K/PB) parallel I/O complexity, where K is the size of the output reported in the process and psortN is the parallel I/O complexity of sorting N elements using P processors....
Deshmane, Anagha; Gulani, Vikas; Griswold, Mark A; Seiberlich, Nicole
2012-07-01
Parallel imaging is a robust method for accelerating the acquisition of magnetic resonance imaging (MRI) data, and has made possible many new applications of MR imaging. Parallel imaging works by acquiring a reduced amount of k-space data with an array of receiver coils. These undersampled data can be acquired more quickly, but the undersampling leads to aliased images. One of several parallel imaging algorithms can then be used to reconstruct artifact-free images from either the aliased images (SENSE-type reconstruction) or from the undersampled data (GRAPPA-type reconstruction). The advantages of parallel imaging in a clinical setting include faster image acquisition, which can be used, for instance, to shorten breath-hold times resulting in fewer motion-corrupted examinations. In this article the basic concepts behind parallel imaging are introduced. The relationship between undersampling and aliasing is discussed and two commonly used parallel imaging methods, SENSE and GRAPPA, are explained in detail. Examples of artifacts arising from parallel imaging are shown and ways to detect and mitigate these artifacts are described. Finally, several current applications of parallel imaging are presented and recent advancements and promising research in parallel imaging are briefly reviewed. Copyright © 2012 Wiley Periodicals, Inc.
Parallel Algorithms and Patterns
Energy Technology Data Exchange (ETDEWEB)
Robey, Robert W. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2016-06-16
This is a powerpoint presentation on parallel algorithms and patterns. A parallel algorithm is a well-defined, step-by-step computational procedure that emphasizes concurrency to solve a problem. Examples of problems include: Sorting, searching, optimization, matrix operations. A parallel pattern is a computational step in a sequence of independent, potentially concurrent operations that occurs in diverse scenarios with some frequency. Examples are: Reductions, prefix scans, ghost cell updates. We only touch on parallel patterns in this presentation. It really deserves its own detailed discussion which Gabe Rockefeller would like to develop.
Application Portable Parallel Library
Cole, Gary L.; Blech, Richard A.; Quealy, Angela; Townsend, Scott
1995-01-01
Application Portable Parallel Library (APPL) computer program is subroutine-based message-passing software library intended to provide consistent interface to variety of multiprocessor computers on market today. Minimizes effort needed to move application program from one computer to another. User develops application program once and then easily moves application program from parallel computer on which created to another parallel computer. ("Parallel computer" also include heterogeneous collection of networked computers). Written in C language with one FORTRAN 77 subroutine for UNIX-based computers and callable from application programs written in C language or FORTRAN 77.
Simulating synchronization in neuronal networks
Fink, Christian G.
2016-06-01
We discuss several techniques used in simulating neuronal networks by exploring how a network's connectivity structure affects its propensity for synchronous spiking. Network connectivity is generated using the Watts-Strogatz small-world algorithm, and two key measures of network structure are described. These measures quantify structural characteristics that influence collective neuronal spiking, which is simulated using the leaky integrate-and-fire model. Simulations show that adding a small number of random connections to an otherwise lattice-like connectivity structure leads to a dramatic increase in neuronal synchronization.
Synchronous-flux-generator (SFG)
Energy Technology Data Exchange (ETDEWEB)
Zweygbergk, S.V.; Ljungstroem, O. (ed.)
1976-01-01
The synchronous machine is the most common rotating electric machine for producing electric energy in a large scale, but it is also used for other purposes. One well known everyday example is its use as driving motor in the electric synchronous clock. One has in this connection made full use of one of the main qualities of this kind of machine--its rotating speed is bound to the frequency of the feeding voltage, either if it is working as a motor or as a generator. Characteristics are discussed.
Symbol Synchronization for SDR Using a Polyphase Filterbank Based on an FPGA
Directory of Open Access Journals (Sweden)
P. Fiala
2015-09-01
Full Text Available This paper is devoted to the proposal of a highly efficient symbol synchronization subsystem for Software Defined Radio. The proposed feedback phase-locked loop timing synchronizer is suitable for parallel implementation on an FPGA. The polyphase FIR filter simultaneously performs matched-filtering and arbitrary interpolation between acquired samples. Determination of the proper sampling instant is achieved by selecting a suitable polyphase filterbank using a derived index. This index is determined based on the output either the Zero-Crossing or Gardner Timing Error Detector. The paper will extensively focus on simulation of the proposed synchronization system. On the basis of this simulation, a complete, fully pipelined VHDL description model is created. This model is composed of a fully parallel polyphase filterbank based on distributed arithmetic, timing error detector and interpolation control block. Finally, RTL synthesis on an Altera Cyclone IV FPGA is presented and resource utilization in comparison with a conventional model is analyzed.
Parallel discrete event simulation
Overeinder, B.J.; Hertzberger, L.O.; Sloot, P.M.A.; Withagen, W.J.
1991-01-01
In simulating applications for execution on specific computing systems, the simulation performance figures must be known in a short period of time. One basic approach to the problem of reducing the required simulation time is the exploitation of parallelism. However, in parallelizing the simulation
Parallel reservoir simulator computations
International Nuclear Information System (INIS)
Hemanth-Kumar, K.; Young, L.C.
1995-01-01
The adaptation of a reservoir simulator for parallel computations is described. The simulator was originally designed for vector processors. It performs approximately 99% of its calculations in vector/parallel mode and relative to scalar calculations it achieves speedups of 65 and 81 for black oil and EOS simulations, respectively on the CRAY C-90
Pinning Synchronization of Switched Complex Dynamical Networks
Directory of Open Access Journals (Sweden)
Liming Du
2015-01-01
Full Text Available Network topology and node dynamics play a key role in forming synchronization of complex networks. Unfortunately there is no effective synchronization criterion for pinning synchronization of complex dynamical networks with switching topology. In this paper, pinning synchronization of complex dynamical networks with switching topology is studied. Two basic problems are considered: one is pinning synchronization of switched complex networks under arbitrary switching; the other is pinning synchronization of switched complex networks by design of switching when synchronization cannot achieved by using any individual connection topology alone. For the two problems, common Lyapunov function method and single Lyapunov function method are used respectively, some global synchronization criteria are proposed and the designed switching law is given. Finally, simulation results verify the validity of the results.
Fermi Timing and Synchronization System
International Nuclear Information System (INIS)
Wilcox, R.; Staples, J.; Doolittle, L.; Byrd, J.; Ratti, A.; Kaertner, F.X.; Kim, J.; Chen, J.; Ilday, F.O.; Ludwig, F.; Winter, A.; Ferianis, M.; Danailov, M.; D'Auria, G.
2006-01-01
The Fermi FEL will depend critically on precise timing of its RF, laser and diagnostic subsystems. The timing subsystem to coordinate these functions will need to reliably maintain sub-100fs synchronicity between distant points up to 300m apart in the Fermi facility. The technology to do this is not commercially available, and has not been experimentally demonstrated in a working facility. Therefore, new technology must be developed to meet these needs. Two approaches have been researched by different groups working with the Fermi staff. At MIT, a pulse transmission scheme has been developed for synchronization of RF and laser devices. And at LBL, a CW transmission scheme has been developed for RF and laser synchronization. These respective schemes have advantages and disadvantages that will become better understood in coming years. This document presents the work done by both teams, and suggests a possible system design which integrates them both. The integrated system design provides an example of how choices can be made between the different approaches without significantly changing the basic infrastructure of the system. Overall system issues common to any synchronization scheme are also discussed
Epidemic Synchronization in Robotic Swarms
DEFF Research Database (Denmark)
Schiøler, Henrik; Nielsen, Jens Frederik Dalsgaard; Ngo, Trung Dung
2009-01-01
Clock synchronization in swarms of networked mobile robots is studied in a probabilistic, epidemic framework. In this setting communication and synchonization is considered to be a randomized process, taking place at unplanned instants of geographical rendezvous between robots. In combination...... as an infinite-dimensional optimal controlproblem. Illustrative numerical examples are given and commented....
Fermi Timing and Synchronization System
Energy Technology Data Exchange (ETDEWEB)
Wilcox, R.; Staples, J.; Doolittle, L.; Byrd, J.; Ratti, A.; Kaertner, F.X.; Kim, J.; Chen, J.; Ilday, F.O.; Ludwig, F.; Winter, A.; Ferianis, M.; Danailov, M.; D' Auria, G.
2006-07-19
The Fermi FEL will depend critically on precise timing of its RF, laser and diagnostic subsystems. The timing subsystem to coordinate these functions will need to reliably maintain sub-100fs synchronicity between distant points up to 300m apart in the Fermi facility. The technology to do this is not commercially available, and has not been experimentally demonstrated in a working facility. Therefore, new technology must be developed to meet these needs. Two approaches have been researched by different groups working with the Fermi staff. At MIT, a pulse transmission scheme has been developed for synchronization of RF and laser devices. And at LBL, a CW transmission scheme has been developed for RF and laser synchronization. These respective schemes have advantages and disadvantages that will become better understood in coming years. This document presents the work done by both teams, and suggests a possible system design which integrates them both. The integrated system design provides an example of how choices can be made between the different approaches without significantly changing the basic infrastructure of the system. Overall system issues common to any synchronization scheme are also discussed.
Main injector synchronous timing system
International Nuclear Information System (INIS)
Blokland, W.; Steimel, J.
1998-01-01
The Synchronous Timing System is designed to provide sub-nanosecond timing to instrumentation during the acceleration of particles in the Main Injector. Increased energy of the beam particles leads to a small but significant increase in speed, reducing the time it takes to complete a full turn of the ring by 61 nanoseconds (or more than 3 rf buckets). In contrast, the reference signal, used to trigger instrumentation and transmitted over a cable, has a constant group delay. This difference leads to a phase slip during the ramp and prevents instrumentation such as dampers from properly operating without additional measures. The Synchronous Timing System corrects for this phase slip as well as signal propagation time changes due to temperature variations. A module at the LLRF system uses a 1.2 Gbit/s G-Link chip to transmit the rf clock and digital data (e.g. the current frequency) over a single mode fiber around the ring. Fiber optic couplers at service buildings split off part of this signal for a local module which reconstructs a synchronous beam reference signal. This paper describes the background, design and expected performance of the Synchronous Timing System. copyright 1998 American Institute of Physics
Main injector synchronous timing system
International Nuclear Information System (INIS)
Blokland, Willem; Steimel, James
1998-01-01
The Synchronous Timing System is designed to provide sub-nanosecond timing to instrumentation during the acceleration of particles in the Main Injector. Increased energy of the beam particles leads to a small but significant increase in speed, reducing the time it takes to complete a full turn of the ring by 61 nanoseconds (or more than 3 rf buckets). In contrast, the reference signal, used to trigger instrumentation and transmitted over a cable, has a constant group delay. This difference leads to a phase slip during the ramp and prevents instrumentation such as dampers from properly operating without additional measures. The Synchronous Timing System corrects for this phase slip as well as signal propagation time changes due to temperature variations. A module at the LLRF system uses a 1.2 Gbit/s G-Link chip to transmit the rf clock and digital data (e.g. the current frequency) over a single mode fiber around the ring. Fiber optic couplers at service buildings split off part of this signal for a local module which reconstructs a synchronous beam reference signal. This paper describes the background, design and expected performance of the Synchronous Timing System
Generalized synchronization via impulsive control
International Nuclear Information System (INIS)
Zhang Rong; Xu Zhenyuan; Yang, Simon X.; He Xueming
2008-01-01
This paper demonstrates theoretically that two completely different systems can implement GS via impulsive control, moreover by using impulsive control, for a given manifold y = H(x) we construct a response system to achieve GS with drive system and the synchronization manifold is y = H(x). Our theoretical results are supported by numerical examples
Learning through synchronous electronic discussion
Kanselaar, G.; Veerman, A.L.; Andriessen, J.E.B.
2000-01-01
This article reports a study examining university student pairs carrying out an electronic discussion task in a synchronous computer mediated communication (CMC) system (NetMeeting). The purpose of the assignment was to raise students' awareness concerning conceptions that characterise effective
Epidemic Synchronization in Robotic Swarms
DEFF Research Database (Denmark)
Schiøler, Henrik; Nielsen, Jens Frederik Dalsgaard; Ngo, Trung Dung
2009-01-01
Clock synchronization in swarms of networked mobile robots is studied in a probabilistic, epidemic framework. In this setting communication and synchonization is considered to be a randomized process, taking place at unplanned instants of geographical rendezvous between robots. In combination wit...
Digital device for synchronous storage
International Nuclear Information System (INIS)
Kobzar', Yu.M.; Kovtun, V.G.; Pashechko, N.I.
1991-01-01
Synchronous storage digital device for IR electron-photon emission spectrometer operating with analogue-to-digital converter F4223 or monocrystal converter K572PV1 is described. The device accomplished deduction of noise-background in each storage cycle. Summation and deduction operational time equals 90 ns, device output code discharge - 20, number of storages -2 23
Neural synchronization via potassium signaling
DEFF Research Database (Denmark)
Postnov, Dmitry E; Ryazanova, Ludmila S; Mosekilde, Erik
2006-01-01
Using a relatively simple model we examine how variations of the extracellular potassium concentration can give rise to synchronization of two nearby pacemaker cells. With the volume of the extracellular space and the rate of potassium diffusion as control parameters, the dual nature of this reso...
Totally parallel multilevel algorithms
Frederickson, Paul O.
1988-01-01
Four totally parallel algorithms for the solution of a sparse linear system have common characteristics which become quite apparent when they are implemented on a highly parallel hypercube such as the CM2. These four algorithms are Parallel Superconvergent Multigrid (PSMG) of Frederickson and McBryan, Robust Multigrid (RMG) of Hackbusch, the FFT based Spectral Algorithm, and Parallel Cyclic Reduction. In fact, all four can be formulated as particular cases of the same totally parallel multilevel algorithm, which are referred to as TPMA. In certain cases the spectral radius of TPMA is zero, and it is recognized to be a direct algorithm. In many other cases the spectral radius, although not zero, is small enough that a single iteration per timestep keeps the local error within the required tolerance.
Energy Technology Data Exchange (ETDEWEB)
1991-10-23
An account of the Caltech Concurrent Computation Program (C{sup 3}P), a five year project that focused on answering the question: Can parallel computers be used to do large-scale scientific computations '' As the title indicates, the question is answered in the affirmative, by implementing numerous scientific applications on real parallel computers and doing computations that produced new scientific results. In the process of doing so, C{sup 3}P helped design and build several new computers, designed and implemented basic system software, developed algorithms for frequently used mathematical computations on massively parallel machines, devised performance models and measured the performance of many computers, and created a high performance computing facility based exclusively on parallel computers. While the initial focus of C{sup 3}P was the hypercube architecture developed by C. Seitz, many of the methods developed and lessons learned have been applied successfully on other massively parallel architectures.
Massively parallel mathematical sieves
Energy Technology Data Exchange (ETDEWEB)
Montry, G.R.
1989-01-01
The Sieve of Eratosthenes is a well-known algorithm for finding all prime numbers in a given subset of integers. A parallel version of the Sieve is described that produces computational speedups over 800 on a hypercube with 1,024 processing elements for problems of fixed size. Computational speedups as high as 980 are achieved when the problem size per processor is fixed. The method of parallelization generalizes to other sieves and will be efficient on any ensemble architecture. We investigate two highly parallel sieves using scattered decomposition and compare their performance on a hypercube multiprocessor. A comparison of different parallelization techniques for the sieve illustrates the trade-offs necessary in the design and implementation of massively parallel algorithms for large ensemble computers.
Anti-synchronization of chaotic oscillators
International Nuclear Information System (INIS)
Kim, Chil-Min; Rim, Sunghwan; Kye, Won-Ho; Ryu, Jung-Wan; Park, Young-Jai
2003-01-01
We have observed anti-synchronization phenomena in coupled identical chaotic oscillators. Anti-synchronization can be characterized by the vanishing of the sum of relevant variables. We have qualitatively analyzed its base mechanism by using the dynamics of the difference and the sum of the relevant variables in coupled chaotic oscillators. Near the threshold of the synchronization and anti-synchronization transition, we have obtained the novel characteristic relation
Robust synchronization of chaotic systems via feedback
Energy Technology Data Exchange (ETDEWEB)
Femat, Ricardo [IPICYT, San Luis Potosi (Mexico). Dept. de Matematicas Aplicadas; Solis-Perales, Gualberto [Universidad de Guadalajara, Centro Univ. de Ciencias Exactas e Ingenierias (Mexico). Div. de Electronica y Computacion
2008-07-01
This volume includes the results derived during last ten years about both suppression and synchronization of chaotic -continuous time- systems. Along this time, the concept was to study how the intrinsic properties of dynamical systems can be exploited to suppress and to synchronize the chaotic behaviour and what synchronization phenomena can be found under feedback interconnection. A compilation of these findings is described in this book. This book shows a perspective on synchronization of chaotic systems. (orig.)
Two novel synchronization criterions for a unified chaotic system
International Nuclear Information System (INIS)
Tao Chaohai; Xiong Hongxia; Hu Feng
2006-01-01
Two novel synchronization criterions are proposed in this paper. It includes drive-response synchronization and adaptive synchronization schemes. Moreover, these synchronization criterions can be applied to a large class of chaotic systems and are very useful for secure communication
40 CFR 93.128 - Traffic signal synchronization projects.
2010-07-01
... 40 Protection of Environment 20 2010-07-01 2010-07-01 false Traffic signal synchronization... synchronization projects. Traffic signal synchronization projects may be approved, funded, and implemented without... include such regionally significant traffic signal synchronization projects. ...
Synchronization of indirectly coupled Lorenz oscillators
Indian Academy of Sciences (India)
Synchronization of indirectly coupled Lorenz oscillators: An experimental study. Amit Sharma Manish Dev Shrimali. Synchronization, Coupled Systems and Networks Volume 77 Issue 5 November 2011 pp 881-889 ... The in-phase and anti-phase synchronization of indirectly coupled chaotic oscillators reported in Phys. Rev ...
Control synchronization of differential mobile robots
Nijmeijer, H.; Rodriguez Angeles, A.; Allgoewer, F.
2004-01-01
In this paper a synchronization controller for differential mobile robots is proposed. The synchronization goal is to control the angular position of each wheel to a desired trajectory and at the same time the differential (or synchronization) error between the angular positions of the two wheels.
Chaos synchronization based on contraction principle
International Nuclear Information System (INIS)
Wang Junwei; Zhou Tianshou
2007-01-01
This paper introduces contraction principle. Based on such a principle, a novel scheme is proposed to synchronize coupled systems with global diffusive coupling. A rigorous sufficient condition on chaos synchronization is derived. As an example, coupled Lorenz systems with nearest-neighbor diffusive coupling are investigated, and numerical simulations are given to validate the proposed synchronization approach
Global chaos synchronization of coupled parametrically excited ...
Indian Academy of Sciences (India)
In this paper, we study the synchronization behaviour of two linearly coupled parametrically excited chaotic pendula. The stability of the synchronized state is examined using Lyapunov stability theory and linear matrix inequality (LMI); and some sufficient criteria for global asymptotic synchronization are derived from which ...
Synchronization of coupled nonidentical multidelay feedback systems
International Nuclear Information System (INIS)
Hoang, Thang Manh; Nakagawa, Masahiro
2007-01-01
We present the lag synchronization of coupled nonidentical multidelay feedback systems, in which the synchronization signal is the sum of nonlinearly transformed components of delayed state variable. The sufficient condition for synchronization is considered by the Krasovskii-Lyapunov theory. The specific examples will demonstrate and verify the effectiveness of the proposed model
Synchronization and comparison of Lifelog audio recordings
DEFF Research Database (Denmark)
Nielsen, Andreas Brinch; Hansen, Lars Kai
2008-01-01
as a preprocessing step to select and synchronize recordings before further processing. The two methods perform similarly in classification, but fingerprinting scales better with the number of recordings, while cross-correlation can offer sample resolution synchronization. We propose and investigate the benefits...... of combining the two. In particular we show that the combination allows sample resolution synchronization and scalability....
Method of parallel processing in SANPO real time system
International Nuclear Information System (INIS)
Ostrovnoj, A.I.; Salamatin, I.M.
1981-01-01
A method of parellel processing in SANPO real time system is described. Algorithms of data accumulation and preliminary processing in this system as a parallel processes using a specialized high level programming language are described. Hierarchy of elementary processes are also described. It provides the synchronization of concurrent processes without semaphors. The developed means are applied to the systems of experiment automation using SM-3 minicomputers [ru
Parallel algorithms for simulating continuous time Markov chains
Nicol, David M.; Heidelberger, Philip
1992-01-01
We have previously shown that the mathematical technique of uniformization can serve as the basis of synchronization for the parallel simulation of continuous-time Markov chains. This paper reviews the basic method and compares five different methods based on uniformization, evaluating their strengths and weaknesses as a function of problem characteristics. The methods vary in their use of optimism, logical aggregation, communication management, and adaptivity. Performance evaluation is conducted on the Intel Touchstone Delta multiprocessor, using up to 256 processors.
On the Convergence of Asynchronous Parallel Pattern Search
International Nuclear Information System (INIS)
Tamara Gilbson Kolda
2002-01-01
In this paper the authors prove global convergence for asynchronous parallel pattern search. In standard pattern search, decisions regarding the update of the iterate and the step-length control parameter are synchronized implicitly across all search directions. They lose this feature in asynchronous parallel pattern search since the search along each direction proceeds semi-autonomously. By bounding the value of the step-length control parameter after any step that produces decrease along a single search direction, they can prove that all the processes share a common accumulation point and that such a point is a stationary point of the standard nonlinear unconstrained optimization problem
New type of chaos synchronization in discrete-time systems: the F-M synchronization
Directory of Open Access Journals (Sweden)
Ouannas Adel
2018-04-01
Full Text Available In this paper, a new type of synchronization for chaotic (hyperchaotic maps with different dimensions is proposed. The novel scheme is called F – M synchronization, since it combines the inverse generalized synchronization (based on a functional relationship F with the matrix projective synchronization (based on a matrix M. In particular, the proposed approach enables F – M synchronization with index d to be achieved between n-dimensional drive system map and m-dimensional response system map, where the synchronization index d corresponds to the dimension of the synchronization error. The technique, which exploits nonlinear controllers and Lyapunov stability theory, proves to be effective in achieving the F – M synchronization not only when the synchronization index d equals n or m, but even if the synchronization index d is larger than the map dimensions n and m. Finally, simulation results are reported, with the aim to illustrate the capabilities of the novel scheme proposed herein.
New type of chaos synchronization in discrete-time systems: the F-M synchronization
Ouannas, Adel; Grassi, Giuseppe; Karouma, Abdulrahman; Ziar, Toufik; Wang, Xiong; Pham, Viet-Thanh
2018-04-01
In this paper, a new type of synchronization for chaotic (hyperchaotic) maps with different dimensions is proposed. The novel scheme is called F - M synchronization, since it combines the inverse generalized synchronization (based on a functional relationship F) with the matrix projective synchronization (based on a matrix M). In particular, the proposed approach enables F - M synchronization with index d to be achieved between n-dimensional drive system map and m-dimensional response system map, where the synchronization index d corresponds to the dimension of the synchronization error. The technique, which exploits nonlinear controllers and Lyapunov stability theory, proves to be effective in achieving the F - M synchronization not only when the synchronization index d equals n or m, but even if the synchronization index d is larger than the map dimensions n and m. Finally, simulation results are reported, with the aim to illustrate the capabilities of the novel scheme proposed herein.
Chaos synchronization of coupled hyperchaotic system
International Nuclear Information System (INIS)
Yang Lixin; Chu Yandong; Zhang Jiangang; Li Xianfeng
2009-01-01
Chaos synchronization, as an important topic, has become an active research subject in nonlinear science. Over the past two decades, chaos synchronization between nonlinear systems has been extensively studied, and many types of synchronization have been announced. This paper introduces synchronization of coupled hyperchaotic system, based on the Lapunov stability theory, asymptotic stability of the system is guaranteed by means of Lapunov function. The numerical simulation was provided in order to show the effectiveness of this method for the synchronization of the chaotic hyperchaotic Chen system and Rossler system.
Adaptive feedback synchronization of Lue system
International Nuclear Information System (INIS)
Han, X.; Lu, J.-A.; Wu, X.
2004-01-01
This letter further improves and extends the works of Chen and Lue [Chaos, Solitons and Fractals 14 (2002) 643] and Wang et al. [Phys. Lett. A 312 (2003) 34]. In detail, the linear feedback synchronization and adaptive feedback synchronization for Lue system are discussed. And the lower bound of the feedback gain in linear feedback synchronization is presented. The adaptive feedback synchronization with only one controller is designed, which improves the proof in the work by Wang et al. The adaptive synchronization with two controllers for completely uncertain Lue system is also discussed, which extends the work of Chen and Lue. Also, numerical simulations show the effectiveness of these methods
Targeting engineering synchronization in chaotic systems
Bhowmick, Sourav K.; Ghosh, Dibakar
2016-07-01
A method of targeting engineering synchronization states in two identical and mismatch chaotic systems is explained in detail. The method is proposed using linear feedback controller coupling for engineering synchronization such as mixed synchronization, linear and nonlinear generalized synchronization and targeting fixed point. The general form of coupling design to target any desire synchronization state under unidirectional coupling with the help of Lyapunov function stability theory is derived analytically. A scaling factor is introduced in the coupling definition to smooth control without any loss of synchrony. Numerical results are done on two mismatch Lorenz systems and two identical Sprott oscillators.
Algorithms for parallel computers
International Nuclear Information System (INIS)
Churchhouse, R.F.
1985-01-01
Until relatively recently almost all the algorithms for use on computers had been designed on the (usually unstated) assumption that they were to be run on single processor, serial machines. With the introduction of vector processors, array processors and interconnected systems of mainframes, minis and micros, however, various forms of parallelism have become available. The advantage of parallelism is that it offers increased overall processing speed but it also raises some fundamental questions, including: (i) which, if any, of the existing 'serial' algorithms can be adapted for use in the parallel mode. (ii) How close to optimal can such adapted algorithms be and, where relevant, what are the convergence criteria. (iii) How can we design new algorithms specifically for parallel systems. (iv) For multi-processor systems how can we handle the software aspects of the interprocessor communications. Aspects of these questions illustrated by examples are considered in these lectures. (orig.)
Parallelism and array processing
International Nuclear Information System (INIS)
Zacharov, V.
1983-01-01
Modern computing, as well as the historical development of computing, has been dominated by sequential monoprocessing. Yet there is the alternative of parallelism, where several processes may be in concurrent execution. This alternative is discussed in a series of lectures, in which the main developments involving parallelism are considered, both from the standpoint of computing systems and that of applications that can exploit such systems. The lectures seek to discuss parallelism in a historical context, and to identify all the main aspects of concurrency in computation right up to the present time. Included will be consideration of the important question as to what use parallelism might be in the field of data processing. (orig.)
Analysis of remote synchronization in complex networks
Gambuzza, Lucia Valentina; Cardillo, Alessio; Fiasconaro, Alessandro; Fortuna, Luigi; Gómez-Gardeñes, Jesus; Frasca, Mattia
2013-12-01
A novel regime of synchronization, called remote synchronization, where the peripheral nodes form a phase synchronized cluster not including the hub, was recently observed in star motifs [Bergner et al., Phys. Rev. E 85, 026208 (2012)]. We show the existence of a more general dynamical state of remote synchronization in arbitrary networks of coupled oscillators. This state is characterized by the synchronization of pairs of nodes that are not directly connected via a physical link or any sequence of synchronized nodes. This phenomenon is almost negligible in networks of phase oscillators as its underlying mechanism is the modulation of the amplitude of those intermediary nodes between the remotely synchronized units. Our findings thus show the ubiquity and robustness of these states and bridge the gap from their recent observation in simple toy graphs to complex networks.
Producing Newborn Synchronous Mammalian Cells
Gonda, Steve R.; Helmstetter, Charles E.; Thornton, Maureen
2008-01-01
A method and bioreactor for the continuous production of synchronous (same age) population of mammalian cells have been invented. The invention involves the attachment and growth of cells on an adhesive-coated porous membrane immersed in a perfused liquid culture medium in a microgravity analog bioreactor. When cells attach to the surface divide, newborn cells are released into the flowing culture medium. The released cells, consisting of a uniform population of synchronous cells are then collected from the effluent culture medium. This invention could be of interest to researchers investigating the effects of the geneotoxic effects of the space environment (microgravity, radiation, chemicals, gases) and to pharmaceutical and biotechnology companies involved in research on aging and cancer, and in new drug development and testing.
Parallel magnetic resonance imaging
International Nuclear Information System (INIS)
Larkman, David J; Nunes, Rita G
2007-01-01
Parallel imaging has been the single biggest innovation in magnetic resonance imaging in the last decade. The use of multiple receiver coils to augment the time consuming Fourier encoding has reduced acquisition times significantly. This increase in speed comes at a time when other approaches to acquisition time reduction were reaching engineering and human limits. A brief summary of spatial encoding in MRI is followed by an introduction to the problem parallel imaging is designed to solve. There are a large number of parallel reconstruction algorithms; this article reviews a cross-section, SENSE, SMASH, g-SMASH and GRAPPA, selected to demonstrate the different approaches. Theoretical (the g-factor) and practical (coil design) limits to acquisition speed are reviewed. The practical implementation of parallel imaging is also discussed, in particular coil calibration. How to recognize potential failure modes and their associated artefacts are shown. Well-established applications including angiography, cardiac imaging and applications using echo planar imaging are reviewed and we discuss what makes a good application for parallel imaging. Finally, active research areas where parallel imaging is being used to improve data quality by repairing artefacted images are also reviewed. (invited topical review)
High Precision Clock Bias Prediction Model in Clock Synchronization System
Directory of Open Access Journals (Sweden)
Zan Liu
2016-01-01
Full Text Available Time synchronization is a fundamental requirement for many services provided by a distributed system. Clock calibration through the time signal is the usual way to realize the synchronization among the clocks used in the distributed system. The interference to time signal transmission or equipment failures may bring about failure to synchronize the time. To solve this problem, a clock bias prediction module is paralleled in the clock calibration system. And for improving the precision of clock bias prediction, the first-order grey model with one variable (GM(1,1 model is proposed. In the traditional GM(1,1 model, the combination of parameters determined by least squares criterion is not optimal; therefore, the particle swarm optimization (PSO is used to optimize GM(1,1 model. At the same time, in order to avoid PSO getting stuck at local optimization and improve its efficiency, the mechanisms that double subgroups and nonlinear decreasing inertia weight are proposed. In order to test the precision of the improved model, we design clock calibration experiments, where time signal is transferred via radio and wired channel, respectively. The improved model is built on the basis of clock bias acquired in the experiments. The results show that the improved model is superior to other models both in precision and in stability. The precision of improved model increased by 66.4%~76.7%.
Taniguchi, Tomohiro; Tsunegi, Sumito; Kubota, Hitoshi
2018-01-01
A mutual synchronization of spin-torque oscillators coupled through current injection is studied theoretically. Models of electrical coupling in parallel and series circuits are proposed. Solving the Landau-Lifshitz-Gilbert equation, excitation of in-phase or antiphase synchronization, depending on the ways the oscillators are connected, is found. It is also found from both analytical and numerical calculations that the current-frequency relations for both parallel and series circuits are the same as that for a single spin-torque oscillator.
The STAPL Parallel Graph Library
Harshvardhan,; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable
Fuzzy Modeling and Synchronization of a New Hyperchaotic Complex System with Uncertainties
Directory of Open Access Journals (Sweden)
Hadi Delavari
2015-07-01
Full Text Available In this paper, the synchronization of a new hyperchaotic complex system based on T-S fuzzy model is proposed. First the considered hyperchaotic system is represented by T-S fuzzy model equivalently. Then by using the parallel distributed compensation (PDC method and by applying linear system theory and exact linearization (EL technique, a fuzzy controller is designed to realize the synchronization. Finally, simulation results are carried out to demonstrate the performance of our proposed control scheme, and also the robustness of the designed fuzzy controller to uncertainties.
[Synchronous playing and acquiring of heart sounds and electrocardiogram based on labVIEW].
Dan, Chunmei; He, Wei; Zhou, Jing; Que, Xiaosheng
2008-12-01
In this paper is described a comprehensive system, which can acquire heart sounds and electrocardiogram (ECG) in parallel, synchronize the display; and play of heart sound and make auscultation and check phonocardiogram to tie in. The hardware system with C8051F340 as the core acquires the heart sound and ECG synchronously, and then sends them to indicators, respectively. Heart sounds are displayed and played simultaneously by controlling the moment of writing to indicator and sound output device. In clinical testing, heart sounds can be successfully located with ECG and real-time played.
Balancing Contention and Synchronization on the Intel Paragon
Bokhari, Shahid H.; Nicol, David M.
1996-01-01
The Intel Paragon is a mesh-connected distributed memory parallel computer. It uses an oblivious and deterministic message routing algorithm: this permits us to develop highly optimized schedules for frequently needed communication patterns. The complete exchange is one such pattern. Several approaches are available for carrying it out on the mesh. We study an algorithm developed by Scott. This algorithm assumes that a communication link can carry one message at a time and that a node can only transmit one message at a time. It requires global synchronization to enforce a schedule of transmissions. Unfortunately global synchronization has substantial overhead on the Paragon. At the same time the powerful interconnection mechanism of this machine permits 2 or 3 messages to share a communication link with minor overhead. It can also overlap multiple message transmission from the same node to some extent. We develop a generalization of Scott's algorithm that executes complete exchange with a prescribed contention. Schedules that incur greater contention require fewer synchronization steps. This permits us to tradeoff contention against synchronization overhead. We describe the performance of this algorithm and compare it with Scott's original algorithm as well as with a naive algorithm that does not take interconnection structure into account. The Bounded contention algorithm is always better than Scott's algorithm and outperforms the naive algorithm for all but the smallest message sizes. The naive algorithm fails to work on meshes larger than 12 x 12. These results show that due consideration of processor interconnect and machine performance parameters is necessary to obtain peak performance from the Paragon and its successor mesh machines.
A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations
Venter, Gerhard; Sobieszczanski-Sobieski, Jaroslaw
2005-01-01
A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high computational cost as measured by elapsed time. One approach to reduce the elapsed time is to make use of coarse-grained parallelization to evaluate the design points. Previous parallel PSO algorithms were mostly implemented in a synchronous manner, where all design points within a design iteration are evaluated before the next iteration is started. This approach leads to poor parallel speedup in cases where a heterogeneous parallel environment is used and/or where the analysis time depends on the design point being analyzed. This paper introduces an asynchronous parallel PSO algorithm that greatly improves the parallel e ciency. The asynchronous algorithm is benchmarked on a cluster assembled of Apple Macintosh G5 desktop computers, using the multi-disciplinary optimization of a typical transport aircraft wing as an example.
Parallel Algorithms for Switching Edges in Heterogeneous Graphs.
Bhuiyan, Hasanuzzaman; Khan, Maleq; Chen, Jiangzhuo; Marathe, Madhav
2017-06-01
An edge switch is an operation on a graph (or network) where two edges are selected randomly and one of their end vertices are swapped with each other. Edge switch operations have important applications in graph theory and network analysis, such as in generating random networks with a given degree sequence, modeling and analyzing dynamic networks, and in studying various dynamic phenomena over a network. The recent growth of real-world networks motivates the need for efficient parallel algorithms. The dependencies among successive edge switch operations and the requirement to keep the graph simple (i.e., no self-loops or parallel edges) as the edges are switched lead to significant challenges in designing a parallel algorithm. Addressing these challenges requires complex synchronization and communication among the processors leading to difficulties in achieving a good speedup by parallelization. In this paper, we present distributed memory parallel algorithms for switching edges in massive networks. These algorithms provide good speedup and scale well to a large number of processors. A harmonic mean speedup of 73.25 is achieved on eight different networks with 1024 processors. One of the steps in our edge switch algorithms requires the computation of multinomial random variables in parallel. This paper presents the first non-trivial parallel algorithm for the problem, achieving a speedup of 925 using 1024 processors.
Parallel discrete event simulation using shared memory
Reed, Daniel A.; Malony, Allen D.; Mccredie, Bradley D.
1988-01-01
With traditional event-list techniques, evaluating a detailed discrete-event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments, using the Chandy-Misra distributed-simulation algorithm, to simulate networks of queues is presented. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential-simulation of most queueing network models.
Partial Synchronization Manifolds for Linearly Time-Delay Coupled Systems
Steur, Erik; van Leeuwen, Cees; Michiels, Wim
2014-01-01
Sometimes a network of dynamical systems shows a form of incomplete synchronization characterized by synchronization of some but not all of its systems. This type of incomplete synchronization is called partial synchronization. Partial synchronization is associated with the existence of partial synchronization manifolds, which are linear invariant subspaces of C, the state space of the network of systems. We focus on partial synchronization manifolds in networks of system...
Massively parallel multicanonical simulations
Gross, Jonathan; Zierenberg, Johannes; Weigel, Martin; Janke, Wolfhard
2018-03-01
Generalized-ensemble Monte Carlo simulations such as the multicanonical method and similar techniques are among the most efficient approaches for simulations of systems undergoing discontinuous phase transitions or with rugged free-energy landscapes. As Markov chain methods, they are inherently serial computationally. It was demonstrated recently, however, that a combination of independent simulations that communicate weight updates at variable intervals allows for the efficient utilization of parallel computational resources for multicanonical simulations. Implementing this approach for the many-thread architecture provided by current generations of graphics processing units (GPUs), we show how it can be efficiently employed with of the order of 104 parallel walkers and beyond, thus constituting a versatile tool for Monte Carlo simulations in the era of massively parallel computing. We provide the fully documented source code for the approach applied to the paradigmatic example of the two-dimensional Ising model as starting point and reference for practitioners in the field.
SPINning parallel systems software
International Nuclear Information System (INIS)
Matlin, O.S.; Lusk, E.; McCune, W.
2002-01-01
We describe our experiences in using Spin to verify parts of the Multi Purpose Daemon (MPD) parallel process management system. MPD is a distributed collection of processes connected by Unix network sockets. MPD is dynamic processes and connections among them are created and destroyed as MPD is initialized, runs user processes, recovers from faults, and terminates. This dynamic nature is easily expressible in the Spin/Promela framework but poses performance and scalability challenges. We present here the results of expressing some of the parallel algorithms of MPD and executing both simulation and verification runs with Spin
Parallel programming with Python
Palach, Jan
2014-01-01
A fast, easy-to-follow and clear tutorial to help you develop Parallel computing systems using Python. Along with explaining the fundamentals, the book will also introduce you to slightly advanced concepts and will help you in implementing these techniques in the real world. If you are an experienced Python programmer and are willing to utilize the available computing resources by parallelizing applications in a simple way, then this book is for you. You are required to have a basic knowledge of Python development to get the most of this book.
Nonlinearity induced synchronization enhancement in mechanical oscillators
Czaplewski, David A.; Lopez, Omar; Guest, Jeffrey R.; Antonio, Dario; Arroyo, Sebastian I.; Zanette, Damian H.
2018-05-08
An autonomous oscillator synchronizes to an external harmonic force only when the forcing frequency lies within a certain interval, known as the synchronization range, around the oscillator's natural frequency. Under ordinary conditions, the width of the synchronization range decreases when the oscillation amplitude grows, which constrains synchronized motion of micro- and nano-mechanical resonators to narrow frequency and amplitude bounds. The present invention shows that nonlinearity in the oscillator can be exploited to manifest a regime where the synchronization range increases with an increasing oscillation amplitude. The present invention shows that nonlinearities in specific configurations of oscillator systems, as described herein, are the key determinants of the effect. The present invention presents a new configuration and operation regime that enhances the synchronization of micro- and nano-mechanical oscillators by capitalizing on their intrinsic nonlinear dynamics.
A chimeric path to neuronal synchronization
Essaki Arumugam, Easwara Moorthy; Spano, Mark L.
2015-01-01
Synchronization of neuronal activity is associated with neurological disorders such as epilepsy. This process of neuronal synchronization is not fully understood. To further our understanding, we have experimentally studied the progression of this synchronization from normal neuronal firing to full synchronization. We implemented nine FitzHugh-Nagumo neurons (a simplified Hodgkin-Huxley model) via discrete electronics. For different coupling parameters (synaptic strengths), the neurons in the ring were either unsynchronized or completely synchronized when locally coupled in a ring. When a single long-range connection (nonlocal coupling) was introduced, an intermediate state known as a chimera appeared. The results indicate that (1) epilepsy is likely not only a dynamical disease but also a topological disease, strongly tied to the connectivity of the underlying network of neurons, and (2) the synchronization process in epilepsy may not be an "all or none" phenomenon, but can pass through an intermediate stage (chimera).
Continuous and discontinuous transitions to synchronization.
Wang, Chaoqing; Garnier, Nicolas B
2016-11-01
We describe how the transition to synchronization in a system of globally coupled Stuart-Landau oscillators changes from continuous to discontinuous when the nature of the coupling is moved from diffusive to reactive. We explain this drastic qualitative change as resulting from the co-existence of a particular synchronized macrostate together with the trivial incoherent macrostate, in a range of parameter values for which the latter is linearly stable. In contrast to the paradigmatic Kuramoto model, this particular state observed at the synchronization transition contains a finite, non-vanishing number of synchronized oscillators, which results in a discontinuous transition. We consider successively two situations where either a fully synchronized state or a partially synchronized state exists at the transition. Thermodynamic limit and finite size effects are briefly discussed, as well as connections with recently observed discontinuous transitions.
Synchronization in complex networks with switching topology
International Nuclear Information System (INIS)
Wang, Lei; Wang, Qing-guo
2011-01-01
This Letter investigates synchronization issues of complex dynamical networks with switching topology. By constructing a common Lyapunov function, we show that local and global synchronization for a linearly coupled network with switching topology can be evaluated by the time average of second smallest eigenvalues corresponding to the Laplacians of switching topology. This result is quite powerful and can be further used to explore various switching cases for complex dynamical networks. Numerical simulations illustrate the effectiveness of the obtained results in the end. -- Highlights: → Synchronization of complex networks with switching topology is investigated. → A common Lyapunov function is established for synchronization of switching network. → The common Lyapunov function is not necessary to monotonically decrease with time. → Synchronization is determined by the second smallest eigenvalue of its Laplacian. → Synchronization criterion can be used to investigate various switching cases.
A chimeric path to neuronal synchronization
Energy Technology Data Exchange (ETDEWEB)
Essaki Arumugam, Easwara Moorthy; Spano, Mark L. [School of Biological and Health Systems Engineering, Arizona State University, Tempe, Arizona 85287-9709 (United States)
2015-01-15
Synchronization of neuronal activity is associated with neurological disorders such as epilepsy. This process of neuronal synchronization is not fully understood. To further our understanding, we have experimentally studied the progression of this synchronization from normal neuronal firing to full synchronization. We implemented nine FitzHugh-Nagumo neurons (a simplified Hodgkin-Huxley model) via discrete electronics. For different coupling parameters (synaptic strengths), the neurons in the ring were either unsynchronized or completely synchronized when locally coupled in a ring. When a single long-range connection (nonlocal coupling) was introduced, an intermediate state known as a chimera appeared. The results indicate that (1) epilepsy is likely not only a dynamical disease but also a topological disease, strongly tied to the connectivity of the underlying network of neurons, and (2) the synchronization process in epilepsy may not be an “all or none” phenomenon, but can pass through an intermediate stage (chimera)
Synchronizing noisy nonidentical oscillators by transient uncoupling
Energy Technology Data Exchange (ETDEWEB)
Tandon, Aditya, E-mail: adityat@iitk.ac.in; Mannattil, Manu, E-mail: mmanu@iitk.ac.in [Department of Physics, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh 208016 (India); Schröder, Malte, E-mail: malte@nld.ds.mpg.de [Network Dynamics, Max Planck Institute for Dynamics and Self-Organization (MPIDS), 37077 Göttingen (Germany); Timme, Marc, E-mail: timme@nld.ds.mpg.de [Network Dynamics, Max Planck Institute for Dynamics and Self-Organization (MPIDS), 37077 Göttingen (Germany); Department of Physics, Technical University of Darmstadt, 64289 Darmstadt (Germany); Chakraborty, Sagar, E-mail: sagarc@iitk.ac.in [Department of Physics, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh 208016 (India); Mechanics and Applied Mathematics Group, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh 208016 (India)
2016-09-15
Synchronization is the process of achieving identical dynamics among coupled identical units. If the units are different from each other, their dynamics cannot become identical; yet, after transients, there may emerge a functional relationship between them—a phenomenon termed “generalized synchronization.” Here, we show that the concept of transient uncoupling, recently introduced for synchronizing identical units, also supports generalized synchronization among nonidentical chaotic units. Generalized synchronization can be achieved by transient uncoupling even when it is impossible by regular coupling. We furthermore demonstrate that transient uncoupling stabilizes synchronization in the presence of common noise. Transient uncoupling works best if the units stay uncoupled whenever the driven orbit visits regions that are locally diverging in its phase space. Thus, to select a favorable uncoupling region, we propose an intuitive method that measures the local divergence at the phase points of the driven unit's trajectory by linearizing the flow and subsequently suppresses the divergence by uncoupling.
A chimeric path to neuronal synchronization
International Nuclear Information System (INIS)
Essaki Arumugam, Easwara Moorthy; Spano, Mark L.
2015-01-01
Synchronization of neuronal activity is associated with neurological disorders such as epilepsy. This process of neuronal synchronization is not fully understood. To further our understanding, we have experimentally studied the progression of this synchronization from normal neuronal firing to full synchronization. We implemented nine FitzHugh-Nagumo neurons (a simplified Hodgkin-Huxley model) via discrete electronics. For different coupling parameters (synaptic strengths), the neurons in the ring were either unsynchronized or completely synchronized when locally coupled in a ring. When a single long-range connection (nonlocal coupling) was introduced, an intermediate state known as a chimera appeared. The results indicate that (1) epilepsy is likely not only a dynamical disease but also a topological disease, strongly tied to the connectivity of the underlying network of neurons, and (2) the synchronization process in epilepsy may not be an “all or none” phenomenon, but can pass through an intermediate stage (chimera)
Indian Academy of Sciences (India)
abnormally low heart rate known as bradycardia. This results in symptoms like fatigue, dizziness and fainting. In such cases ... cycle. Owing to this interaction, the flashing frequencies get entrained and the phases of the fireflies are locked.
Explosive synchronization coexists with classical synchronization in the Kuramoto model
Energy Technology Data Exchange (ETDEWEB)
Danziger, Michael M., E-mail: michael.danziger@biu.ac.il; Havlin, Shlomo [Department of Physics, Bar-Ilan University, Ramat Gan (Israel); Moskalenko, Olga I.; Kurkin, Semen A. [Faculty of Nonlinear Processes, Saratov State University, Astrakhanskaya, 83, Saratov 410012 (Russian Federation); Saratov State Technical University, Politehnicheskaya, 77, Saratov 410054 (Russian Federation); Zhang, Xiyun [Department of Physics, East China Normal University, Shanghai 200062 (China); Boccaletti, Stefano [CNR-Institute of Complex Systems, Via Madonna del Piano 10, 50019 Sesto Fiorentino, Florence (Italy); The Italian Embassy in Israel, 25 Hamered Street, 68125 Tel Aviv (Israel)
2016-06-15
Explosive synchronization has recently been reported in a system of adaptively coupled Kuramoto oscillators, without any conditions on the frequency or degree of the nodes. Here, we find that, in fact, the explosive phase coexists with the standard phase of the Kuramoto oscillators. We determine this by extending the mean-field theory of adaptively coupled oscillators with full coupling to the case with partial coupling of a fraction f. This analysis shows that a metastable region exists for all finite values of f > 0, and therefore explosive synchronization is expected for any perturbation of adaptively coupling added to the standard Kuramoto model. We verify this theory with GPU-accelerated simulations on very large networks (N ∼ 10{sup 6}) and find that, in fact, an explosive transition with hysteresis is observed for all finite couplings. By demonstrating that explosive transitions coexist with standard transitions in the limit of f → 0, we show that this behavior is far more likely to occur naturally than was previously believed.
Development of a synchronous subset of AADL
DEFF Research Database (Denmark)
Filali, Mamoun; Lawall, Julia
2010-01-01
We study the definition and the mapping of an AADL subset: the so called synchronous subset. We show that the data port protocol used for delayed and immediate connections between periodic threads can be interpreted in a synchronous way. In this paper, we formalize this interpretation and study ...... the development of its mapping such that the original synchronous semantics is preserved. For that purpose, we use refinements through the Event B method....
Adaptive Synchronization of Robotic Sensor Networks
Yıldırım, Kasım Sinan; Gürcan, Önder
2014-01-01
The main focus of recent time synchronization research is developing power-efficient synchronization methods that meet pre-defined accuracy requirements. However, an aspect that has been often overlooked is the high dynamics of the network topology due to the mobility of the nodes. Employing existing flooding-based and peer-to-peer synchronization methods, are networked robots still be able to adapt themselves and self-adjust their logical clocks under mobile network dynamics? In this paper, ...
Method for Converter Synchronization with RF Injection
Joshua P. Bruckmeyer; Ivica Kostanic
2015-01-01
This paper presents an injection method for synchronizing analog to digital converters (ADC). This approach can eliminate the need for precision routed discrete synchronization signals of current technologies, such as JESD204. By eliminating the setup and hold time requirements at the conversion (or near conversion) clock rate, higher sample rate systems can be synchronized. Measured data from an existing multiple ADC conversion system was used to evaluate the method. Coherent beams were simu...
The synchronization of three fractional differential systems
International Nuclear Information System (INIS)
Li Changpin; Yan Jianping
2007-01-01
In this paper, a new method is proposed and applied to the synchronization of fractional differential systems (or 'differential systems with fractional orders'), where both drive and response systems have the same dimensionality and are coupled by the driving signal. The present technique is based on the stability criterion of linear fractional systems. This method is implemented in (chaos) synchronization of the fractional Lorenz system, Chen system and Chua circuit. Numerical simulations show the present synchronization method works well
Fitness for synchronization of network motifs
DEFF Research Database (Denmark)
Vega, Y.M.; Vázquez-Prada, M.; Pacheco, A.F.
2004-01-01
We study the synchronization of Kuramoto's oscillators in small parts of networks known as motifs. We first report on the system dynamics for the case of a scale-free network and show the existence of a non-trivial critical point. We compute the probability that network motifs synchronize, and fi...... that the fitness for synchronization correlates well with motifs interconnectedness and structural complexity. Possible implications for present debates about network evolution in biological and other systems are discussed....
Synchronizing a class of uncertain chaotic systems
International Nuclear Information System (INIS)
Chen Maoyin; Zhou Donghua; Shang Yun
2005-01-01
This Letter deals with the synchronization of a class of uncertain chaotic systems in the drive-response framework. A robust adaptive observer based response system is designed to synchronize a given chaotic system with unknown parameters and external disturbances. Lyapunov stability ensures the global synchronization between the drive and response systems even if Lipschitz constants on function matrices and bounds on uncertainties are unknown. Numerical simulation of Genesio-Tesi system verifies the effectiveness of this scheme
Impulsive synchronization of Chen's hyperchaotic system
International Nuclear Information System (INIS)
Haeri, Mohammad; Dehghani, Mahsa
2006-01-01
In this Letter the impulsive synchronization of the Chen's hyperchaotic systems is discussed. Some new and sufficient conditions on varying impulsive distance are established in order to guarantee the synchronizabillity of the systems using the synchronization method. In particular, some simple conditions are derived in synchronizing the systems by equal impulsive distances. Two illustrative examples are provided to show the feasibility and the effectiveness of the proposed method. The boundaries of the stable regions are also estimated
A True Open-Loop Synchronization Technique
DEFF Research Database (Denmark)
Golestan, Saeed; Vidal, Ana; Yepes, Alejandro G.
2016-01-01
Synchronization techniques can be broadly classified into two major categories: Closed-loop and open-loop methods. The open-loop synchronization (OLS) techniques, contrary to the closed-loop ones, are unconditionally stable and benefit from a fast dynamic response. Their performance, however, tends...... is to develop a true OLS (and therefore, unconditionally stable) technique without any need for the calculation of sine and cosine functions. The effectiveness of the proposed synchronization technique is confirmed through the simulation and experimental results....
A single phase synchronous micromotor
Energy Technology Data Exchange (ETDEWEB)
Yamada, T.
1982-01-25
The excitation winding of a synchronous micromotor, wound on a bobin made of an electricity insulating material (EIM), is located in a cylindrical mount, whose exterior walls are thicker than the interior ones. From above the mount is covered by a pole top with comb poles. The rotor poles are made of a permanent magnet, seated on a bushing which rotates on a shaft. The stable rotation of the rotor is supported by a stop bearing and a guide bearing, where the latter consists of a magnetic part and a nonmagnetic part.
Synchronous Oscillations in Microtubule Polymerization
Carlier, M. F.; Melki, R.; Pantaloni, D.; Hill, T. L.; Chen, Y.
1987-08-01
Under conditions where microtubule nucleation and growth are fast (i.e., high magnesium ion and tubulin concentrations and absence of glycerol), microtubule assembly in vitro exhibits an oscillatory regime preceding the establishment of steady state. The amplitude of the oscillations can represent >50% of the maximum turbidity change and oscillations persist for up to 20 periods of 80 s each. Oscillations are accompanied by extensive length redistribution of microtubules. Preliminary work suggests that the oscillatory kinetics can be simulated using a model in which many microtubules undergo synchronous transitions between growing and rapidly depolymerizing phases, complicated by the kinetically limiting rate of nucleotide exchange on free tubulin.
Seamless Image Mosaicking via Synchronization
Santellani, E.; Maset, E.; Fusiello, A.
2018-05-01
This paper proposes an innovative method to create high-quality seamless planar mosaics. The developed pipeline ensures good robustness against many common mosaicking problems (e.g., misalignments, colour distortion, moving objects, parallax) and differs from other works in the literature because a global approach, known as synchronization, is used for image registration and colour correction. To better conceal the mosaic seamlines, images are cut along specific paths, computed using a Voronoi decomposition of the mosaic area and a shortest path algorithm. Results obtained on challenging real datasets show that the colour correction mitigates significantly the colour variations between the original images and the seams on the final mosaic are not evident.
Efficient Synchronization Primitives for GPUs
Stuart, Jeff A.; Owens, John D.
2011-01-01
In this paper, we revisit the design of synchronization primitives---specifically barriers, mutexes, and semaphores---and how they apply to the GPU. Previous implementations are insufficient due to the discrepancies in hardware and programming model of the GPU and CPU. We create new implementations in CUDA and analyze the performance of spinning on the GPU, as well as a method of sleeping on the GPU, by running a set of memory-system benchmarks on two of the most common GPUs in use, the Tesla...
Synchronization of coupled metronomes on two layers
Zhang, Jing; Yu, Yi-Zhen; Wang, Xin-Gang
2017-12-01
Coupled metronomes serve as a paradigmatic model for exploring the collective behaviors of complex dynamical systems, as well as a classical setup for classroom demonstrations of synchronization phenomena. Whereas previous studies of metronome synchronization have been concentrating on symmetric coupling schemes, here we consider the asymmetric case by adopting the scheme of layered metronomes. Specifically, we place two metronomes on each layer, and couple two layers by placing one on top of the other. By varying the initial conditions of the metronomes and adjusting the friction between the two layers, a variety of synchronous patterns are observed in experiment, including the splay synchronization (SS) state, the generalized splay synchronization (GSS) state, the anti-phase synchronization (APS) state, the in-phase delay synchronization (IPDS) state, and the in-phase synchronization (IPS) state. In particular, the IPDS state, in which the metronomes on each layer are synchronized in phase but are of a constant phase delay to metronomes on the other layer, is observed for the first time. In addition, a new technique based on audio signals is proposed for pattern detection, which is more convenient and easier to apply than the existing acquisition techniques. Furthermore, a theoretical model is developed to explain the experimental observations, and is employed to explore the dynamical properties of the patterns, including the basin distributions and the pattern transitions. Our study sheds new lights on the collective behaviors of coupled metronomes, and the developed setup can be used in the classroom for demonstration purposes.
Pilotless Frame Synchronization Using LDPC Code Constraints
Jones, Christopher; Vissasenor, John
2009-01-01
A method of pilotless frame synchronization has been devised for low- density parity-check (LDPC) codes. In pilotless frame synchronization , there are no pilot symbols; instead, the offset is estimated by ex ploiting selected aspects of the structure of the code. The advantag e of pilotless frame synchronization is that the bandwidth of the sig nal is reduced by an amount associated with elimination of the pilot symbols. The disadvantage is an increase in the amount of receiver data processing needed for frame synchronization.
Synchronization Analysis of the Supermarket Refrigeration System
DEFF Research Database (Denmark)
Wisniewski, Rafal; Chen, Liang; Larsen, Lars Finn Sloth
2009-01-01
is analyzed using the bifurcation and chaos theory. It is demonstrated that the system can have a complex chaotic behavior, which is far from the synchronization. This shows that making the system chaotic is a good choice for a de-synchronization strategy. The positive maximum Lyapunov exponent is usually...... taken as an indication of the existence of chaos. It is used in the paper as a measure of performance for the tendency of the system to synchronize, that is, the higher value of the maximum Lyapunov exponent the lower risk for synchronization....
Acoustophoretic Synchronization of Mammalian Cells in Microchannels
DEFF Research Database (Denmark)
Thévoz, P.; Adams, J.D.; Shea, H.
2010-01-01
We report the first use of ultrasonic standing waves to achieve cell cycle phase synchronization in mammalian cells in a high-throughput and reagent-free manner. The acoustophoretic cell synchronization (ACS) device utilizes volume-dependent acoustic radiation force within a microchannel to selec......We report the first use of ultrasonic standing waves to achieve cell cycle phase synchronization in mammalian cells in a high-throughput and reagent-free manner. The acoustophoretic cell synchronization (ACS) device utilizes volume-dependent acoustic radiation force within a microchannel...
Price synchronization in retailing: some empirical evidence
Directory of Open Access Journals (Sweden)
Marcelo Resende
2014-06-01
Full Text Available The paper investigates the synchronization of price changes in the context of retail tire dealers in São Paulo-Brazil and selected items in supermarkets for cleaning supplies and food in Rio de Janeiro-Brazil. Results indicate similar and non-negligible synchronization for different brands, although magnitudes are distant from a perfect synchronization pattern. We find interesting patterns in inter-firm competition, with similar magnitudes across different tire types. Intra-chain synchronization is substantial, indicating that a common price adjustment policy tends to be sustained for each chain across different products.
Parallel keyed hash function construction based on chaotic maps
International Nuclear Information System (INIS)
Xiao Di; Liao Xiaofeng; Deng Shaojiang
2008-01-01
Recently, a variety of chaos-based hash functions have been proposed. Nevertheless, none of them works efficiently in parallel computing environment. In this Letter, an algorithm for parallel keyed hash function construction is proposed, whose structure can ensure the uniform sensitivity of hash value to the message. By means of the mechanism of both changeable-parameter and self-synchronization, the keystream establishes a close relation with the algorithm key, the content and the order of each message block. The entire message is modulated into the chaotic iteration orbit, and the coarse-graining trajectory is extracted as the hash value. Theoretical analysis and computer simulation indicate that the proposed algorithm can satisfy the performance requirements of hash function. It is simple, efficient, practicable, and reliable. These properties make it a good choice for hash on parallel computing platform
Expressing Parallelism with ROOT
Energy Technology Data Exchange (ETDEWEB)
Piparo, D. [CERN; Tejedor, E. [CERN; Guiraud, E. [CERN; Ganis, G. [CERN; Mato, P. [CERN; Moneta, L. [CERN; Valls Pla, X. [CERN; Canal, P. [Fermilab
2017-11-22
The need for processing the ever-increasing amount of data generated by the LHC experiments in a more efficient way has motivated ROOT to further develop its support for parallelism. Such support is being tackled both for shared-memory and distributed-memory environments. The incarnations of the aforementioned parallelism are multi-threading, multi-processing and cluster-wide executions. In the area of multi-threading, we discuss the new implicit parallelism and related interfaces, as well as the new building blocks to safely operate with ROOT objects in a multi-threaded environment. Regarding multi-processing, we review the new MultiProc framework, comparing it with similar tools (e.g. multiprocessing module in Python). Finally, as an alternative to PROOF for cluster-wide executions, we introduce the efforts on integrating ROOT with state-of-the-art distributed data processing technologies like Spark, both in terms of programming model and runtime design (with EOS as one of the main components). For all the levels of parallelism, we discuss, based on real-life examples and measurements, how our proposals can increase the productivity of scientists.
Expressing Parallelism with ROOT
Piparo, D.; Tejedor, E.; Guiraud, E.; Ganis, G.; Mato, P.; Moneta, L.; Valls Pla, X.; Canal, P.
2017-10-01
The need for processing the ever-increasing amount of data generated by the LHC experiments in a more efficient way has motivated ROOT to further develop its support for parallelism. Such support is being tackled both for shared-memory and distributed-memory environments. The incarnations of the aforementioned parallelism are multi-threading, multi-processing and cluster-wide executions. In the area of multi-threading, we discuss the new implicit parallelism and related interfaces, as well as the new building blocks to safely operate with ROOT objects in a multi-threaded environment. Regarding multi-processing, we review the new MultiProc framework, comparing it with similar tools (e.g. multiprocessing module in Python). Finally, as an alternative to PROOF for cluster-wide executions, we introduce the efforts on integrating ROOT with state-of-the-art distributed data processing technologies like Spark, both in terms of programming model and runtime design (with EOS as one of the main components). For all the levels of parallelism, we discuss, based on real-life examples and measurements, how our proposals can increase the productivity of scientists.
Parallel Fast Legendre Transform
Alves de Inda, M.; Bisseling, R.H.; Maslen, D.K.
1998-01-01
We discuss a parallel implementation of a fast algorithm for the discrete polynomial Legendre transform We give an introduction to the DriscollHealy algorithm using polynomial arithmetic and present experimental results on the eciency and accuracy of our implementation The algorithms were
Practical parallel programming
Bauer, Barr E
2014-01-01
This is the book that will teach programmers to write faster, more efficient code for parallel processors. The reader is introduced to a vast array of procedures and paradigms on which actual coding may be based. Examples and real-life simulations using these devices are presented in C and FORTRAN.
Parallel hierarchical radiosity rendering
Energy Technology Data Exchange (ETDEWEB)
Carter, Michael [Iowa State Univ., Ames, IA (United States)
1993-07-01
In this dissertation, the step-by-step development of a scalable parallel hierarchical radiosity renderer is documented. First, a new look is taken at the traditional radiosity equation, and a new form is presented in which the matrix of linear system coefficients is transformed into a symmetric matrix, thereby simplifying the problem and enabling a new solution technique to be applied. Next, the state-of-the-art hierarchical radiosity methods are examined for their suitability to parallel implementation, and scalability. Significant enhancements are also discovered which both improve their theoretical foundations and improve the images they generate. The resultant hierarchical radiosity algorithm is then examined for sources of parallelism, and for an architectural mapping. Several architectural mappings are discussed. A few key algorithmic changes are suggested during the process of making the algorithm parallel. Next, the performance, efficiency, and scalability of the algorithm are analyzed. The dissertation closes with a discussion of several ideas which have the potential to further enhance the hierarchical radiosity method, or provide an entirely new forum for the application of hierarchical methods.
Parallel universes beguile science
2007-01-01
A staple of mind-bending science fiction, the possibility of multiple universes has long intrigued hard-nosed physicists, mathematicians and cosmologists too. We may not be able -- as least not yet -- to prove they exist, many serious scientists say, but there are plenty of reasons to think that parallel dimensions are more than figments of eggheaded imagination.
Energy Technology Data Exchange (ETDEWEB)
2017-04-04
A parallelization of the k-means++ seed selection algorithm on three distinct hardware platforms: GPU, multicore CPU, and multithreaded architecture. K-means++ was developed by David Arthur and Sergei Vassilvitskii in 2007 as an extension of the k-means data clustering technique. These algorithms allow people to cluster multidimensional data, by attempting to minimize the mean distance of data points within a cluster. K-means++ improved upon traditional k-means by using a more intelligent approach to selecting the initial seeds for the clustering process. While k-means++ has become a popular alternative to traditional k-means clustering, little work has been done to parallelize this technique. We have developed original C++ code for parallelizing the algorithm on three unique hardware architectures: GPU using NVidia's CUDA/Thrust framework, multicore CPU using OpenMP, and the Cray XMT multithreaded architecture. By parallelizing the process for these platforms, we are able to perform k-means++ clustering much more quickly than it could be done before.
International Nuclear Information System (INIS)
Gardes, D.; Volkov, P.
1981-01-01
A 5x3cm 2 (timing only) and a 15x5cm 2 (timing and position) parallel plate avalanche counters (PPAC) are considered. The theory of operation and timing resolution is given. The measurement set-up and the curves of experimental results illustrate the possibilities of the two counters [fr
Parallel hierarchical global illumination
Energy Technology Data Exchange (ETDEWEB)
Snell, Quinn O. [Iowa State Univ., Ames, IA (United States)
1997-10-08
Solving the global illumination problem is equivalent to determining the intensity of every wavelength of light in all directions at every point in a given scene. The complexity of the problem has led researchers to use approximation methods for solving the problem on serial computers. Rather than using an approximation method, such as backward ray tracing or radiosity, the authors have chosen to solve the Rendering Equation by direct simulation of light transport from the light sources. This paper presents an algorithm that solves the Rendering Equation to any desired accuracy, and can be run in parallel on distributed memory or shared memory computer systems with excellent scaling properties. It appears superior in both speed and physical correctness to recent published methods involving bidirectional ray tracing or hybrid treatments of diffuse and specular surfaces. Like progressive radiosity methods, it dynamically refines the geometry decomposition where required, but does so without the excessive storage requirements for ray histories. The algorithm, called Photon, produces a scene which converges to the global illumination solution. This amounts to a huge task for a 1997-vintage serial computer, but using the power of a parallel supercomputer significantly reduces the time required to generate a solution. Currently, Photon can be run on most parallel environments from a shared memory multiprocessor to a parallel supercomputer, as well as on clusters of heterogeneous workstations.
Directory of Open Access Journals (Sweden)
Jilin Zhang
2017-01-01
Full Text Available With the development of the mobile systems, we gain a lot of benefits and convenience by leveraging mobile devices; at the same time, the information gathered by smartphones, such as location and environment, is also valuable for business to provide more intelligent services for customers. More and more machine learning methods have been used in the field of mobile information systems to study user behavior and classify usage patterns, especially convolutional neural network. With the increasing of model training parameters and data scale, the traditional single machine training method cannot meet the requirements of time complexity in practical application scenarios. The current training framework often uses simple data parallel or model parallel method to speed up the training process, which is why heterogeneous computing resources have not been fully utilized. To solve these problems, our paper proposes a delay synchronization convolutional neural network parallel strategy, which leverages the heterogeneous system. The strategy is based on both synchronous parallel and asynchronous parallel approaches; the model training process can reduce the dependence on the heterogeneous architecture in the premise of ensuring the model convergence, so the convolution neural network framework is more adaptive to different heterogeneous system environments. The experimental results show that the proposed delay synchronization strategy can achieve at least three times the speedup compared to the traditional data parallelism.
Using cellular automata for parallel simulation of laser dynamics with dynamic load balancing
Guisado, J.L.; Fernández de Vega, F.; Jiménez Morales, F.; Iskra, K.A.; Sloot, P.M.A.
2008-01-01
We present an analysis of the feasibility of executing a parallel bioinspired model of laser dynamics, based on cellular automata (CA), on the usual target platform of this kind of applications: a heterogeneous non-dedicated cluster. As this model employs a synchronous CA, using the single program,
New method for protection of parallel generator; Novo metodo para protecao do gerador em paralelismo
Energy Technology Data Exchange (ETDEWEB)
Silva, M R.C. da [Elfa-Seg Eletronica Ltda. (Brazil)
1988-07-01
The protection of synchronous machinery, especially generators working in parallel with the pertaining electric power utility have been extensively discussed specially because of the growing importance of co-generation in Brazil. This work discusses existing efficient methods and suggests new ways of proceeding this protection. 8 refs., 2 figs.
The specificity of learned parallelism in dual-memory retrieval.
Strobach, Tilo; Schubert, Torsten; Pashler, Harold; Rickard, Timothy
2014-05-01
Retrieval of two responses from one visually presented cue occurs sequentially at the outset of dual-retrieval practice. Exclusively for subjects who adopt a mode of grouping (i.e., synchronizing) their response execution, however, reaction times after dual-retrieval practice indicate a shift to learned retrieval parallelism (e.g., Nino & Rickard, in Journal of Experimental Psychology: Learning, Memory, and Cognition, 29, 373-388, 2003). In the present study, we investigated how this learned parallelism is achieved and why it appears to occur only for subjects who group their responses. Two main accounts were considered: a task-level versus a cue-level account. The task-level account assumes that learned retrieval parallelism occurs at the level of the task as a whole and is not limited to practiced cues. Grouping response execution may thus promote a general shift to parallel retrieval following practice. The cue-level account states that learned retrieval parallelism is specific to practiced cues. This type of parallelism may result from cue-specific response chunking that occurs uniquely as a consequence of grouped response execution. The results of two experiments favored the second account and were best interpreted in terms of a structural bottleneck model.
Directory of Open Access Journals (Sweden)
Aghamammadova S.
2016-01-01
Based on this experimental researches, the complex reaction, consisting of parallel-sequential oxidation and dehydrogenation reactions, which are coherently synchronized, proceeds during the process of cyclohexane oxidation with biomimetic catalyst. Depending on the reaction parameters it is possible to deliberately adjust the direction of oxidation reaction and reaction rate.
A Parallel Modular Biomimetic Cilia Sorting Platform
Directory of Open Access Journals (Sweden)
James G. H. Whiting
2018-03-01
Full Text Available The aquatic unicellular organism Paramecium caudatum uses cilia to swim around its environment and to graze on food particles and bacteria. Paramecia use waves of ciliary beating for locomotion, intake of food particles and sensing. There is some evidence that Paramecia pre-sort food particles by discarding larger particles, but intake the particles matching their mouth cavity. Most prior attempts to mimic cilia-based manipulation merely mimicked the overall action rather than the beating of cilia. The majority of massive-parallel actuators are controlled by a central computer; however, a distributed control would be far more true-to-life. We propose and test a distributed parallel cilia platform where each actuating unit is autonomous, yet exchanging information with its closest neighboring units. The units are arranged in a hexagonal array. Each unit is a tileable circuit board, with a microprocessor, color-based object sensor and servo-actuated biomimetic cilia actuator. Localized synchronous communication between cilia allowed for the emergence of coordinated action, moving different colored objects together. The coordinated beating action was capable of moving objects up to 4 cm/s at its highest beating frequency; however, objects were moved at a speed proportional to the beat frequency. Using the local communication, we were able to detect the shape of objects and rotating an object using edge detection was performed; however, lateral manipulation using shape information was unsuccessful.
Wald, Ingo; Ize, Santiago
2015-07-28
Parallel population of a grid with a plurality of objects using a plurality of processors. One example embodiment is a method for parallel population of a grid with a plurality of objects using a plurality of processors. The method includes a first act of dividing a grid into n distinct grid portions, where n is the number of processors available for populating the grid. The method also includes acts of dividing a plurality of objects into n distinct sets of objects, assigning a distinct set of objects to each processor such that each processor determines by which distinct grid portion(s) each object in its distinct set of objects is at least partially bounded, and assigning a distinct grid portion to each processor such that each processor populates its distinct grid portion with any objects that were previously determined to be at least partially bounded by its distinct grid portion.
Ultrascalable petaflop parallel supercomputer
Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Chiu, George [Cross River, NY; Cipolla, Thomas M [Katonah, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Hall, Shawn [Pleasantville, NY; Haring, Rudolf A [Cortlandt Manor, NY; Heidelberger, Philip [Cortlandt Manor, NY; Kopcsay, Gerard V [Yorktown Heights, NY; Ohmacht, Martin [Yorktown Heights, NY; Salapura, Valentina [Chappaqua, NY; Sugavanam, Krishnan [Mahopac, NY; Takken, Todd [Brewster, NY
2010-07-20
A massively parallel supercomputer of petaOPS-scale includes node architectures based upon System-On-a-Chip technology, where each processing node comprises a single Application Specific Integrated Circuit (ASIC) having up to four processing elements. The ASIC nodes are interconnected by multiple independent networks that optimally maximize the throughput of packet communications between nodes with minimal latency. The multiple networks may include three high-speed networks for parallel algorithm message passing including a Torus, collective network, and a Global Asynchronous network that provides global barrier and notification functions. These multiple independent networks may be collaboratively or independently utilized according to the needs or phases of an algorithm for optimizing algorithm processing performance. The use of a DMA engine is provided to facilitate message passing among the nodes without the expenditure of processing resources at the node.
DEFF Research Database (Denmark)
Gregersen, Frans; Josephson, Olle; Kristoffersen, Gjert
of departure that English may be used in parallel with the various local, in this case Nordic, languages. As such, the book integrates the challenge of internationalization faced by any university with the wish to improve quality in research, education and administration based on the local language......Abstract [en] More parallel, please is the result of the work of an Inter-Nordic group of experts on language policy financed by the Nordic Council of Ministers 2014-17. The book presents all that is needed to plan, practice and revise a university language policy which takes as its point......(s). There are three layers in the text: First, you may read the extremely brief version of the in total 11 recommendations for best practice. Second, you may acquaint yourself with the extended version of the recommendations and finally, you may study the reasoning behind each of them. At the end of the text, we give...
PARALLEL MOVING MECHANICAL SYSTEMS
Directory of Open Access Journals (Sweden)
Florian Ion Tiberius Petrescu
2014-09-01
Full Text Available Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4 Moving mechanical systems parallel structures are solid, fast, and accurate. Between parallel systems it is to be noticed Stewart platforms, as the oldest systems, fast, solid and precise. The work outlines a few main elements of Stewart platforms. Begin with the geometry platform, kinematic elements of it, and presented then and a few items of dynamics. Dynamic primary element on it means the determination mechanism kinetic energy of the entire Stewart platforms. It is then in a record tail cinematic mobile by a method dot matrix of rotation. If a structural mottoelement consists of two moving elements which translates relative, drive train and especially dynamic it is more convenient to represent the mottoelement as a single moving components. We have thus seven moving parts (the six motoelements or feet to which is added mobile platform 7 and one fixed.
Directory of Open Access Journals (Sweden)
Xiuli Chai
2013-01-01
Full Text Available The impulsive synchronization and adaptive-impulsive synchronization of a novel financial hyperchaotic system are investigated. Based on comparing principle for impulsive functional differential equations, several sufficient conditions for impulsive synchronization are derived, and the upper bounds of impulsive interval for stable synchronization are estimated. Furthermore, a nonlinear adaptive-impulsive control scheme is designed to synchronize the financial system using invariant principle of impulsive dynamical systems. Moreover, corresponding numerical simulations are presented to illustrate the effectiveness and feasibility of the proposed methods.
Synchronization of coupled chaotic dynamics on networks
Indian Academy of Sciences (India)
We review some recent work on the synchronization of coupled dynamical systems on a variety of networks. When nodes show synchronized behaviour, two interesting phenomena can be observed. First, there are some nodes of the floating type that show intermittent behaviour between getting attached to some clusters ...
Synchronization and emergence in complex systems
Indian Academy of Sciences (India)
... complex systems. Fatihcan M Atay. Synchronization, Coupled Systems and Networks Volume 77 Issue 5 November 2011 pp 855-863 ... We show how novel behaviour can emerge in complex systems at the global level through synchronization of the activities of their constituent units. Two mechanisms are suggested for ...
Dependence of synchronization frequency of Kuramoto oscillators ...
Indian Academy of Sciences (India)
Kuramoto oscillators have been proposed earlier as a model for interacting systems that exhibit synchronization. In this article, we study the difference between networks with symmetric and asymmetric distribution of natural frequencies. We first indicate that synchronization frequency of oscillators in a completely connected ...
Synchronization of oscillators in complex networks
Indian Academy of Sciences (India)
Theory of identical or complete synchronization of identical oscillators in arbitrary networks is introduced. In addition, several graph theory concepts and results that augment the synchronization theory and a tie in closely to random, semirandom, and regular networks are introduced. Combined theories are used to explore ...
Synchronized Data Aggregation for Wireless Sensor Network
DEFF Research Database (Denmark)
Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee
2014-01-01
Wireless Sensor Networks (WSNs) are used for monitoring and data collection purposes. A key challenge in effective data collection is to schedule and synchronize the activities of the nodes with global clock. This paper proposes the Synchronized Data Aggregation Algorithm (SDA) using spanning tree...
A clock synchronization skeleton based on RTAI
Huang, Y.; Visser, P.M.; Broenink, Johannes F.
2006-01-01
This paper presents a clock synchronization skeleton based on RTAI (Real Time Application Interface). The skeleton is a thin layer that provides unified but extendible interfaces to the underlying operating system, the synchronization algorithms and the upper level applications in need of clock
Analytical treatment for synchronizing chaos through unidirectional ...
Indian Academy of Sciences (India)
Abstract. The idea of synchronization can be explicitly demonstrated by both numerical and ana- lytical means on a nonlinear electronic circuit. Also, we introduce a scheme to obtain various logic gate structures, using synchronization of chaotic systems. By a small change in the response param- eter of unidirectionally ...
Synchronization of oscillators in complex networks
Indian Academy of Sciences (India)
Abstract. Theory of identical or complete synchronization of identical oscillators in arbitrary networks is introduced. In addition, several graph theory concepts and results that augment the synchronization theory and a tie in closely to random, semirandom, and regular networks are introduced. Combined theories are used to ...
Identical synchronization of coupled Rossler systems
DEFF Research Database (Denmark)
Yanchuk, S.; Maistrenko, Y.; Mosekilde, Erik
1999-01-01
Analyzing the transverse stability of low periodic orbits embedded in the synchronized chaotic state for a system of two coupled Rössler oscillators, we obtain the conditions for synchronization and determine the coupling parameters for which riddled basins of attraction may arise. It is shown how...
Chaos synchronization of nonlinear Bloch equations
International Nuclear Information System (INIS)
Park, Ju H.
2006-01-01
In this paper, the problem of chaos synchronization of Bloch equations is considered. A novel nonlinear controller is designed based on the Lyapunov stability theory. The proposed controller ensures that the states of the controlled chaotic slave system asymptotically synchronizes the states of the master system. A numerical example is given to illuminate the design procedure and advantage of the result derived
Synchronization in Quantum Key Distribution Systems
Directory of Open Access Journals (Sweden)
Anton Pljonkin
2017-10-01
Full Text Available In the description of quantum key distribution systems, much attention is paid to the operation of quantum cryptography protocols. The main problem is the insufficient study of the synchronization process of quantum key distribution systems. This paper contains a general description of quantum cryptography principles. A two-line fiber-optic quantum key distribution system with phase coding of photon states in transceiver and coding station synchronization mode was examined. A quantum key distribution system was built on the basis of the scheme with automatic compensation of polarization mode distortions. Single-photon avalanche diodes were used as optical radiation detecting devices. It was estimated how the parameters used in quantum key distribution systems of optical detectors affect the detection of the time frame with attenuated optical pulse in synchronization mode with respect to its probabilistic and time-domain characteristics. A design method was given for the process that detects the time frame that includes an optical pulse during synchronization. This paper describes the main quantum communication channel attack methods by removing a portion of optical emission. This paper describes the developed synchronization algorithm that takes into account the time required to restore the photodetector’s operation state after the photon has been registered during synchronization. The computer simulation results of the developed synchronization algorithm were analyzed. The efficiency of the developed algorithm with respect to synchronization process protection from unauthorized gathering of optical emission is demonstrated herein.
Xyce parallel electronic simulator.
Energy Technology Data Exchange (ETDEWEB)
Keiter, Eric R; Mei, Ting; Russo, Thomas V.; Rankin, Eric Lamont; Schiek, Richard Louis; Thornquist, Heidi K.; Fixel, Deborah A.; Coffey, Todd S; Pawlowski, Roger P; Santarelli, Keith R.
2010-05-01
This document is a reference guide to the Xyce Parallel Electronic Simulator, and is a companion document to the Xyce Users Guide. The focus of this document is (to the extent possible) exhaustively list device parameters, solver options, parser options, and other usage details of Xyce. This document is not intended to be a tutorial. Users who are new to circuit simulation are better served by the Xyce Users Guide.
Betchov, R
2012-01-01
Stability of Parallel Flows provides information pertinent to hydrodynamical stability. This book explores the stability problems that occur in various fields, including electronics, mechanics, oceanography, administration, economics, as well as naval and aeronautical engineering. Organized into two parts encompassing 10 chapters, this book starts with an overview of the general equations of a two-dimensional incompressible flow. This text then explores the stability of a laminar boundary layer and presents the equation of the inviscid approximation. Other chapters present the general equation
Algorithmically specialized parallel computers
Snyder, Lawrence; Gannon, Dennis B
1985-01-01
Algorithmically Specialized Parallel Computers focuses on the concept and characteristics of an algorithmically specialized computer.This book discusses the algorithmically specialized computers, algorithmic specialization using VLSI, and innovative architectures. The architectures and algorithms for digital signal, speech, and image processing and specialized architectures for numerical computations are also elaborated. Other topics include the model for analyzing generalized inter-processor, pipelined architecture for search tree maintenance, and specialized computer organization for raster
Communicating via robust synchronization of chaotic lasers
International Nuclear Information System (INIS)
Lopez-Gutierrez, R.M.; Posadas-Castillo, C.; Lopez-Mancilla, D.; Cruz-Hernandez, C.
2009-01-01
In this paper, the robust synchronization problem for coupled chaotic Nd:YAG lasers is addressed. We resort to complex systems theory to achieve chaos synchronization. Based on stability theory, it is shown that the state trajectories of the perturbed error synchronization are ultimately bounded, provided the unperturbed synchronization error system is exponentially stable, and some conditions on the bounds of the perturbation terms are satisfied. So that, encoding, transmission, and decoding in chaotic optical communications are presented. We analyze the transmission and recovery of encrypted information when parameter mismatches are considered. Computer simulations are provided to show the effectiveness of this robustness synchronization property, we present the encrypted transmission of image messages, and we show that, the transmitted image is faithfully recovered.
Communicating via robust synchronization of chaotic lasers
Energy Technology Data Exchange (ETDEWEB)
Lopez-Gutierrez, R.M. [Engineering Faculty, Baja California Autonomous University (UABC), Km. 103 Carret. Tij-Ens., 22860 Ensenada, B.C. (Mexico); Posadas-Castillo, C. [Engineering Faculty, Baja California Autonomous University (UABC), Km. 103 Carret. Tij-Ens., 22860 Ensenada, B.C. (Mexico); FIME, Autonomous University of Nuevo Leon (UANL), Pedro de Alba, S.N., Cd. Universitaria, San Nicolas de los Garza, NL (Mexico); Lopez-Mancilla, D. [Departamento de Ciencias Exactas y Tecnologicas, Centro Universitario de los Lagos, Universidad de Guadalajara (CULagos-UdeG), Enrique Diaz de Leon s/n, 47460 Lagos de Moreno, Jal. (Mexico); Cruz-Hernandez, C. [Electronics and Telecommunications Department, Scientific Research and Advanced Studies of Ensenada (CICESE), Km. 107 Carret. Tij-Ens., 22860 Ensenada, B.C. (Mexico)], E-mail: ccruz@cicese.mx
2009-10-15
In this paper, the robust synchronization problem for coupled chaotic Nd:YAG lasers is addressed. We resort to complex systems theory to achieve chaos synchronization. Based on stability theory, it is shown that the state trajectories of the perturbed error synchronization are ultimately bounded, provided the unperturbed synchronization error system is exponentially stable, and some conditions on the bounds of the perturbation terms are satisfied. So that, encoding, transmission, and decoding in chaotic optical communications are presented. We analyze the transmission and recovery of encrypted information when parameter mismatches are considered. Computer simulations are provided to show the effectiveness of this robustness synchronization property, we present the encrypted transmission of image messages, and we show that, the transmitted image is faithfully recovered.
Synchronization in networks with heterogeneous coupling delays
Otto, Andreas; Radons, Günter; Bachrathy, Dániel; Orosz, Gábor
2018-01-01
Synchronization in networks of identical oscillators with heterogeneous coupling delays is studied. A decomposition of the network dynamics is obtained by block diagonalizing a newly introduced adjacency lag operator which contains the topology of the network as well as the corresponding coupling delays. This generalizes the master stability function approach, which was developed for homogenous delays. As a result the network dynamics can be analyzed by delay differential equations with distributed delay, where different delay distributions emerge for different network modes. Frequency domain methods are used for the stability analysis of synchronized equilibria and synchronized periodic orbits. As an example, the synchronization behavior in a system of delay-coupled Hodgkin-Huxley neurons is investigated. It is shown that the parameter regions where synchronized periodic spiking is unstable expand when increasing the delay heterogeneity.
Chaos synchronization based on intermittent state observer
Institute of Scientific and Technical Information of China (English)
Li Guo-Hui; Zhou Shi-Ping; Xu De-Ming
2004-01-01
This paper describes the method of synchronizing slave to the master trajectory using an intermittent state observer by constructing a synchronizer which drives the response system globally tracing the driving system asymptotically. It has been shown from the theory of synchronization error-analysis that a satisfactory result of chaos synchronization is expected under an appropriate intermittent period and state observer. Compared with continuous control method,the proposed intermittent method can target the desired orbit more efficiently. The application of the method is demonstrated on the hyperchaotic Rossler systems. Numerical simulations show that the length of the synchronization interval rs is of crucial importance for our scheme, and the method is robust with respect to parameter mismatch.
Effects of frustration on explosive synchronization
Huang, Xia; Gao, Jian; Sun, Yu-Ting; Zheng, Zhi-Gang; Xu, Can
2016-12-01
In this study, we consider the emergence of explosive synchronization in scale-free networks by considering the Kuramoto model of coupled phase oscillators. The natural frequencies of oscillators are assumed to be correlated with their degrees and frustration is included in the system. This assumption can enhance or delay the explosive transition to synchronization. Interestingly, a de-synchronization phenomenon occurs and the type of phase transition is also changed. Furthermore, we provide an analytical treatment based on a star graph, which resembles that obtained in scale-free networks. Finally, a self-consistent approach is implemented to study the de-synchronization regime. Our findings have important implications for controlling synchronization in complex networks because frustration is a controllable parameter in experiments and a discontinuous abrupt phase transition is always dangerous in engineering in the real world.
Variance based OFDM frame synchronization
Directory of Open Access Journals (Sweden)
Z. Fedra
2012-04-01
Full Text Available The paper deals with a new frame synchronization scheme for OFDM systems and calculates the complexity of this scheme. The scheme is based on the computing of the detection window variance. The variance is computed in two delayed times, so a modified Early-Late loop is used for the frame position detection. The proposed algorithm deals with different variants of OFDM parameters including guard interval, cyclic prefix, and has good properties regarding the choice of the algorithm's parameters since the parameters may be chosen within a wide range without having a high influence on system performance. The verification of the proposed algorithm functionality has been performed on a development environment using universal software radio peripheral (USRP hardware.
Concurrent systems and time synchronization
Burgin, Mark; Grathoff, Annette
2018-05-01
In the majority of scientific fields, system dynamics is described assuming existence of unique time for the whole system. However, it is established theoretically, for example, in relativity theory or in the system theory of time, and validated experimentally that there are different times and time scales in a variety of real systems - physical, chemical, biological, social, etc. In spite of this, there are no wide-ranging scientific approaches to exploration of such systems. Therefore, the goal of this paper is to study systems with this property. We call them concurrent systems because processes in them can go, events can happen and actions can be performed in different time scales. The problem of time synchronization is specifically explored.
Synchronization of world economic activity
Groth, Andreas; Ghil, Michael
2017-12-01
Common dynamical properties of business cycle fluctuations are studied in a sample of more than 100 countries that represent economic regions from all around the world. We apply the methodology of multivariate singular spectrum analysis (M-SSA) to identify oscillatory modes and to detect whether these modes are shared by clusters of phase- and frequency-locked oscillators. An extension of the M-SSA approach is introduced to help analyze structural changes in the cluster configuration of synchronization. With this novel technique, we are able to identify a common mode of business cycle activity across our sample, and thus point to the existence of a world business cycle. Superimposed on this mode, we further identify several major events that have markedly influenced the landscape of world economic activity in the postwar era.
Chaos synchronization between Chen system and Genesio system
International Nuclear Information System (INIS)
Wu Xianyong; Guan Zhihong; Wu Zhengping; Li Tao
2007-01-01
This Letter presents two synchronization schemes between two different chaotic systems. Active control synchronization and adaptive synchronization between Chen system and Genesio system are studied, different controllers are designed to synchronize the drive and response systems, active control synchronization is used when system parameters are known; adaptive synchronization is employed when system parameters are unknown or uncertain. Simulation results show the effectiveness of the proposed schemes
Sensorimotor synchronization with different metrical levels of point-light dance movements
Directory of Open Access Journals (Sweden)
Yi-Huang eSu
2016-04-01
Full Text Available Rhythm perception and synchronization have been extensively investigated in the auditory domain, as they underlie means of human communication such as music and speech. Although recent studies suggest comparable mechanisms for synchronizing with periodically moving visual objects, the extent to which it applies to ecologically relevant information, such as the rhythm of complex biological motion, remains unknown. The present study addressed this issue by linking rhythm of music and dance in the framework of action-perception coupling. As a previous study showed that observers perceived multiple metrical periodicities in dance movements that embodied this structure, the present study examined whether sensorimotor synchronization (SMS to dance movements resembles what is known of auditory SMS. Participants watched a point-light figure performing two basic steps of Swing dance cyclically, in which the trunk bounced at every beat and the limbs moved at every second beat, forming two metrical periodicities. Participants tapped synchronously to the bounce of the trunk with or without the limbs moving in the stimuli (Experiment 1, or tapped synchronously to the leg movements with or without the trunk bouncing simultaneously (Experiment 2. Results showed that, while synchronization with the bounce (lower-level pulse was not influenced by the presence or absence of limb movements (metrical accent, synchronization with the legs (beat was improved by the presence of the bounce (metrical subdivision across different movement types. The latter finding parallels the subdivision benefit often demonstrated in auditory tasks, suggesting common sensorimotor mechanisms for visual rhythms in dance and auditory rhythms in music.
Sensorimotor Synchronization with Different Metrical Levels of Point-Light Dance Movements
Su, Yi-Huang
2016-01-01
Rhythm perception and synchronization have been extensively investigated in the auditory domain, as they underlie means of human communication such as music and speech. Although recent studies suggest comparable mechanisms for synchronizing with periodically moving visual objects, the extent to which it applies to ecologically relevant information, such as the rhythm of complex biological motion, remains unknown. The present study addressed this issue by linking rhythm of music and dance in the framework of action-perception coupling. As a previous study showed that observers perceived multiple metrical periodicities in dance movements that embodied this structure, the present study examined whether sensorimotor synchronization (SMS) to dance movements resembles what is known of auditory SMS. Participants watched a point-light figure performing two basic steps of Swing dance cyclically, in which the trunk bounced at every beat and the limbs moved at every second beat, forming two metrical periodicities. Participants tapped synchronously to the bounce of the trunk with or without the limbs moving in the stimuli (Experiment 1), or tapped synchronously to the leg movements with or without the trunk bouncing simultaneously (Experiment 2). Results showed that, while synchronization with the bounce (lower-level pulse) was not influenced by the presence or absence of limb movements (metrical accent), synchronization with the legs (beat) was improved by the presence of the bounce (metrical subdivision) across different movement types. The latter finding parallels the “subdivision benefit” often demonstrated in auditory tasks, suggesting common sensorimotor mechanisms for visual rhythms in dance and auditory rhythms in music. PMID:27199709
On program restructuring, scheduling, and communication for parallel processor systems
Energy Technology Data Exchange (ETDEWEB)
Polychronopoulos, Constantine D. [Univ. of Illinois, Urbana, IL (United States)
1986-08-01
This dissertation discusses several software and hardware aspects of program execution on large-scale, high-performance parallel processor systems. The issues covered are program restructuring, partitioning, scheduling and interprocessor communication, synchronization, and hardware design issues of specialized units. All this work was performed focusing on a single goal: to maximize program speedup, or equivalently, to minimize parallel execution time. Parafrase, a Fortran restructuring compiler was used to transform programs in a parallel form and conduct experiments. Two new program restructuring techniques are presented, loop coalescing and subscript blocking. Compile-time and run-time scheduling schemes are covered extensively. Depending on the program construct, these algorithms generate optimal or near-optimal schedules. For the case of arbitrarily nested hybrid loops, two optimal scheduling algorithms for dynamic and static scheduling are presented. Simulation results are given for a new dynamic scheduling algorithm. The performance of this algorithm is compared to that of self-scheduling. Techniques for program partitioning and minimization of interprocessor communication for idealized program models and for real Fortran programs are also discussed. The close relationship between scheduling, interprocessor communication, and synchronization becomes apparent at several points in this work. Finally, the impact of various types of overhead on program speedup and experimental results are presented.
Communications oriented programming of parallel iterative solutions of sparse linear systems
Patrick, M. L.; Pratt, T. W.
1986-01-01
Parallel algorithms are developed for a class of scientific computational problems by partitioning the problems into smaller problems which may be solved concurrently. The effectiveness of the resulting parallel solutions is determined by the amount and frequency of communication and synchronization and the extent to which communication can be overlapped with computation. Three different parallel algorithms for solving the same class of problems are presented, and their effectiveness is analyzed from this point of view. The algorithms are programmed using a new programming environment. Run-time statistics and experience obtained from the execution of these programs assist in measuring the effectiveness of these algorithms.
Parallel performance of TORT on the CRAY J90: Model and measurement
International Nuclear Information System (INIS)
Barnett, A.; Azmy, Y.Y.
1997-10-01
A limitation on the parallel performance of TORT on the CRAY J90 is the amount of extra work introduced by the multitasking algorithm itself. The extra work beyond that of the serial version of the code, called overhead, arises from the synchronization of the parallel tasks and the accumulation of results by the master task. The goal of recent updates to TORT was to reduce the time consumed by these activities. To help understand which components of the multitasking algorithm contribute significantly to the overhead, a parallel performance model was constructed and compared to measurements of actual timings of the code
Embedded multiprocessors scheduling and synchronization
Sriram, Sundararajan
2009-01-01
Techniques for Optimizing Multiprocessor Implementations of Signal Processing ApplicationsAn indispensable component of the information age, signal processing is embedded in a variety of consumer devices, including cell phones and digital television, as well as in communication infrastructure, such as media servers and cellular base stations. Multiple programmable processors, along with custom hardware running in parallel, are needed to achieve the computation throughput required of such applications. Reviews important research in key areas related to the multiprocessor implementation of multi
Resistor Combinations for Parallel Circuits.
McTernan, James P.
1978-01-01
To help simplify both teaching and learning of parallel circuits, a high school electricity/electronics teacher presents and illustrates the use of tables of values for parallel resistive circuits in which total resistances are whole numbers. (MF)
SOFTWARE FOR DESIGNING PARALLEL APPLICATIONS
Directory of Open Access Journals (Sweden)
M. K. Bouza
2017-01-01
Full Text Available The object of research is the tools to support the development of parallel programs in C/C ++. The methods and software which automates the process of designing parallel applications are proposed.
Induction motor for superconducting synchronous/asynchronous motor
International Nuclear Information System (INIS)
Litz, D.C.; Haller, H.E. III.
1975-01-01
An induction motor structure for use on the outside of a superconducting rotor comprising a cylindrical shell of solid and laminated, magnetic iron with squirrel cage windings embedded in the outer circumference of said shell is described. The sections of the shell between the superconducting windings of the rotor are solid magnetic iron. The sections of the shell over the superconducting windings are made of laminations of magnetic iron. These laminations are parallel to the axis of the machine and are divided in halves with the laminations in each half oriented in diagonal opposition so that the intersection of the laminations forms a V. This structure presents a relatively high reluctance to leakage flux from the superconducting windings in the synchronous operating mode, while presenting a low reluctance path to the stator flux during asynchronous operation
V123 Beam Synchronous Encoder Module
International Nuclear Information System (INIS)
Kerner, T.; Conkling, C. R.; Oerter, B.
1999-01-01
The V123 Synchronous Encoder Module transmits events to distributed trigger modules and embedded decoders around the RHIC rings where they are used to provide beam instrumentation triggers [1,2,3]. The RHIC beam synchronous event link hardware is mainly comprised of three VMEbus board designs, the central input modules (V201), and encoder modules (V123), and the distributed trigger modules (V124). Two beam synchronous links, one for each ring, are distributed via fiberoptic and fanned out via twisted wire pair cables. The V123 synchronizes with the RF system clock derived from the beam bucket frequency and a revolution fiducial pulse. The RF system clock is used to create the beam synchronous event link carrier and events are synchronized with the rotation fiducial. A low jitter RF clock is later recovered from this carrier by phase lock loops in the trigger modules. Prioritized hardware and software triggers fill up to 15 beam event code transmission slots per revolution while tracking the ramping RF acceleration frequency and storage frequency. The revolution fiducial event is always the first event transmitted which is used to synchronize the firing of the abort kicker and to locate the first bucket for decoders distributed about the ring
Bursting synchronization in clustered neuronal networks
International Nuclear Information System (INIS)
Yu Hai-Tao; Wang Jiang; Deng Bin; Wei Xi-Le
2013-01-01
Neuronal networks in the brain exhibit the modular (clustered) property, i.e., they are composed of certain subnetworks with differential internal and external connectivity. We investigate bursting synchronization in a clustered neuronal network. A transition to mutual-phase synchronization takes place on the bursting time scale of coupled neurons, while on the spiking time scale, they behave asynchronously. This synchronization transition can be induced by the variations of inter- and intracoupling strengths, as well as the probability of random links between different subnetworks. Considering that some pathological conditions are related with the synchronization of bursting neurons in the brain, we analyze the control of bursting synchronization by using a time-periodic external signal in the clustered neuronal network. Simulation results show a frequency locking tongue in the driving parameter plane, where bursting synchronization is maintained, even in the presence of external driving. Hence, effective synchronization suppression can be realized with the driving parameters outside the frequency locking region. (interdisciplinary physics and related areas of science and technology)
Synchronization of Estrus in Cattle: A Review
Directory of Open Access Journals (Sweden)
R. Islam
2011-06-01
Full Text Available Numbers of estrus synchronization programmes are available in cattle based on the use of various hormones like progesterone, prostaglandin F2a and their various combinations with other hormones like estrogen and Gonadotrophin Releasing hormone (GnRH. Selection of appropriate estrus synchronization protocol should be made on the basis of management capabilities and expectations of the farmer. Synchronization of oestrus can be accomplished with the injection of prostaglandin F2a alone, but it needs proper detection of the ovarian status of the cows as prostaglandin F2a is active in only functional corpus luteum in between 8 to 17 days of estrous cycle. Progesterone may reduce fertility up to 14 percent, but short time progesterone exposure (less than 14 days is beneficial. Addition of GnRH in the Progesterone or Prostaglandin based synchronization programme is helpful for more synchrony in estrus as GnRH may be helpful to synchronize the oestrous cycle in delayed pubertal heifers and post partum cows (Post partum anoestrum and further a single, timed artificial insemination is possible with this method. New methods of synchronizing estrus in which the GnRH-PG protocol is preceded by progesterone treatment offer effective synchronization of estrus with high fertility. [Vet. World 2011; 4(3.000: 136-141
Parallel External Memory Graph Algorithms
DEFF Research Database (Denmark)
Arge, Lars Allan; Goodrich, Michael T.; Sitchinava, Nodari
2010-01-01
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one o f the private-cache chip multiprocessor (CMP) models. We study the fundamental problem of list ranking which leads to efficient solutions to problems on trees, such as computing lowest...... an optimal speedup of Â¿(P) in parallel I/O complexity and parallel computation time, compared to the single-processor external memory counterparts....
Parallel inter channel interaction mechanisms
International Nuclear Information System (INIS)
Jovic, V.; Afgan, N.; Jovic, L.
1995-01-01
Parallel channels interactions are examined. For experimental researches of nonstationary regimes flow in three parallel vertical channels results of phenomenon analysis and mechanisms of parallel channel interaction for adiabatic condition of one-phase fluid and two-phase mixture flow are shown. (author)
Transmission delays in hardware clock synchronization
Shin, Kang G.; Ramanathan, P.
1988-01-01
Various methods, both with software and hardware, have been proposed to synchronize a set of physical clocks in a system. Software methods are very flexible and economical but suffer an excessive time overhead, whereas hardware methods require no time overhead but are unable to handle transmission delays in clock signals. The effects of nonzero transmission delays in synchronization have been studied extensively in the communication area in the absence of malicious or Byzantine faults. The authors show that it is easy to incorporate the ideas from the communication area into the existing hardware clock synchronization algorithms to take into account the presence of both malicious faults and nonzero transmission delays.
Permutation parity machines for neural synchronization
International Nuclear Information System (INIS)
Reyes, O M; Kopitzke, I; Zimmermann, K-H
2009-01-01
Synchronization of neural networks has been studied in recent years as an alternative to cryptographic applications such as the realization of symmetric key exchange protocols. This paper presents a first view of the so-called permutation parity machine, an artificial neural network proposed as a binary variant of the tree parity machine. The dynamics of the synchronization process by mutual learning between permutation parity machines is analytically studied and the results are compared with those of tree parity machines. It will turn out that for neural synchronization, permutation parity machines form a viable alternative to tree parity machines
The least channel capacity for chaos synchronization.
Wang, Mogei; Wang, Xingyuan; Liu, Zhenzhen; Zhang, Huaguang
2011-03-01
Recently researchers have found that a channel with capacity exceeding the Kolmogorov-Sinai entropy of the drive system (h(KS)) is theoretically necessary and sufficient to sustain the unidirectional synchronization to arbitrarily high precision. In this study, we use symbolic dynamics and the automaton reset sequence to distinguish the information that is required in identifying the current drive word and obtaining the synchronization. Then, we show that the least channel capacity that is sufficient to transmit the distinguished information and attain the synchronization of arbitrarily high precision is h(KS). Numerical simulations provide support for our conclusions.
Adaptive H∞ Chaos Anti-synchronization
International Nuclear Information System (INIS)
Ahn, Choon Ki
2010-01-01
A new adaptive H ∞ anti-synchronization (AHAS) method is proposed for chaotic systems in the presence of unknown parameters and external disturbances. Based on the Lyapunov theory and linear matrix inequality formulation, the AHAS controller with adaptive laws of unknown parameters is derived to not only guarantee adaptive anti-synchronization but also reduce the effect of external disturbances to an H ∞ norm constraint. As an application of the proposed AHAS method, the H ∞ anti-synchronization problem for Genesio–Tesi chaotic systems is investigated. (general)
Analysis of Synchronization for Coupled Hybrid Systems
DEFF Research Database (Denmark)
Li, Zheng; Wisniewski, Rafal
2006-01-01
In the control systems with coupled multi-subsystem, the subsystems might be synchronized (i.e. all the subsystems have the same operation states), which results in negative influence to the whole system. For example, in the supermarket refrigeration systems, the synchronized switch of each...... subsystem will cause low efficiency, inferior control performance and a high wear on the compressor. This paper takes the supermarket refrigeration systems as an example to analyze the synchronization and its coupling strengths of coupled hybrid systems, which may provide a base for further research...... of control strategies. This paper combines topology and section mapping theories together to show a new way of analyzing hybrid systems...
Chaos synchronization of the energy resource system
International Nuclear Information System (INIS)
Li Xiuchun; Xu Wei; Li Ruihong
2009-01-01
This paper presents the chaos synchronization problem for new dynamical system (that is, energy resource demand-supply system), where the controller is designed using two different control methods. Firstly, based on stability criterion of linear system, chaotic synchronization is achieved with the help of the active theory, and accordingly, the simulation results are given for verifying the feasibility of the method. Secondly, based on Lyapunov stability theory, on the assumption that all the parameters of the system are unknown, adaptive control approach is proposed to make the states of two chaotic systems asymptotic synchronization. In the end, numerical simulations are used to show the effectiveness of the proposed control method.
Synchronization of two coupled turbulent fires
Takagi, Kazushi; Gotoda, Hiroshi; Miyano, Takaya; Murayama, Shogo; Tokuda, Isao T.
2018-04-01
We numerically study the scale-free nature of a buoyancy-induced turbulent fire and synchronization of two coupled turbulent fires. A scale-free structure is detected in weighted networks between vortices, while its lifetime obeys a clear power law, indicating intermittent appearances, disappearances, and reappearances of the scale-free property. A significant decrease in the distance between the two fire sources gives rise to a synchronized state in the near field dominated by the unstable motion of large-scale of transverse vortex rings. The synchronized state vanishes in the far field forming well-developed turbulent plumes, regardless of the distance between the two fire sources.
Synchronization System for Next Generation Light Sources
Energy Technology Data Exchange (ETDEWEB)
Zavriyev, Anton [MagiQ Technologies, Inc., Somerville, MA (United States)
2014-03-27
An alternative synchronization technique – one that would allow explicit control of the pulse train including its repetition rate and delay is clearly desired. We propose such a scheme. Our method is based on optical interferometry and permits synchronization of the pulse trains generated by two independent mode-locked lasers. As the next generation x-ray sources will be driven by a clock signal derived from a mode-locked optical source, our technique will provide a way to synchronize x-ray probe with the optical pump pulses.
Usability of synchronization for cognitive modeling
International Nuclear Information System (INIS)
Diebner, Hans H.; Grond, Florian
2005-01-01
We discuss the synchronization features of a previously introduced adaptive system for dynamics recognition in more detail. We investigate the usability of synchronization for modeling and parameter estimations. It is pointed out inhowfar the adaptive system based on synchronization can become a powerful tool in modeling. The adaptive system can store modules of pre-adapted dynamics and is potentially capable of undergoing self-modification. We compare the stored modules with pre-knowledge that a modeler puts into his or her models. In this sense the adaptive system functions like an expert system
International Nuclear Information System (INIS)
Soltz, R; Vranas, P; Blumrich, M; Chen, D; Gara, A; Giampap, M; Heidelberger, P; Salapura, V; Sexton, J; Bhanot, G
2007-01-01
The theory of the strong nuclear force, Quantum Chromodynamics (QCD), can be numerically simulated from first principles on massively-parallel supercomputers using the method of Lattice Gauge Theory. We describe the special programming requirements of lattice QCD (LQCD) as well as the optimal supercomputer hardware architectures that it suggests. We demonstrate these methods on the BlueGene massively-parallel supercomputer and argue that LQCD and the BlueGene architecture are a natural match. This can be traced to the simple fact that LQCD is a regular lattice discretization of space into lattice sites while the BlueGene supercomputer is a discretization of space into compute nodes, and that both are constrained by requirements of locality. This simple relation is both technologically important and theoretically intriguing. The main result of this paper is the speedup of LQCD using up to 131,072 CPUs on the largest BlueGene/L supercomputer. The speedup is perfect with sustained performance of about 20% of peak. This corresponds to a maximum of 70.5 sustained TFlop/s. At these speeds LQCD and BlueGene are poised to produce the next generation of strong interaction physics theoretical results
A Parallel Butterfly Algorithm
Poulson, Jack; Demanet, Laurent; Maxwell, Nicholas; Ying, Lexing
2014-01-01
The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform (Equation Presented.) at large numbers of target points when the kernel, K(x, y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(Nd) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r2Nd logN). A parallelization of the butterfly algorithm is introduced which, assuming a message latency of α and per-process inverse bandwidth of β, executes in at most (Equation Presented.) time using p processes. This parallel algorithm was then instantiated in the form of the open-source DistButterfly library for the special case where K(x, y) = exp(iΦ(x, y)), where Φ(x, y) is a black-box, sufficiently smooth, real-valued phase function. Experiments on Blue Gene/Q demonstrate impressive strong-scaling results for important classes of phase functions. Using quasi-uniform sources, hyperbolic Radon transforms, and an analogue of a three-dimensional generalized Radon transform were, respectively, observed to strong-scale from 1-node/16-cores up to 1024-nodes/16,384-cores with greater than 90% and 82% efficiency, respectively. © 2014 Society for Industrial and Applied Mathematics.
A Parallel Butterfly Algorithm
Poulson, Jack
2014-02-04
The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform (Equation Presented.) at large numbers of target points when the kernel, K(x, y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(Nd) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r2Nd logN). A parallelization of the butterfly algorithm is introduced which, assuming a message latency of α and per-process inverse bandwidth of β, executes in at most (Equation Presented.) time using p processes. This parallel algorithm was then instantiated in the form of the open-source DistButterfly library for the special case where K(x, y) = exp(iΦ(x, y)), where Φ(x, y) is a black-box, sufficiently smooth, real-valued phase function. Experiments on Blue Gene/Q demonstrate impressive strong-scaling results for important classes of phase functions. Using quasi-uniform sources, hyperbolic Radon transforms, and an analogue of a three-dimensional generalized Radon transform were, respectively, observed to strong-scale from 1-node/16-cores up to 1024-nodes/16,384-cores with greater than 90% and 82% efficiency, respectively. © 2014 Society for Industrial and Applied Mathematics.
Fast parallel event reconstruction
CERN. Geneva
2010-01-01
On-line processing of large data volumes produced in modern HEP experiments requires using maximum capabilities of modern and future many-core CPU and GPU architectures.One of such powerful feature is a SIMD instruction set, which allows packing several data items in one register and to operate on all of them, thus achievingmore operations per clock cycle. Motivated by the idea of using the SIMD unit ofmodern processors, the KF based track fit has been adapted for parallelism, including memory optimization, numerical analysis, vectorization with inline operator overloading, and optimization using SDKs. The speed of the algorithm has been increased in 120000 times with 0.1 ms/track, running in parallel on 16 SPEs of a Cell Blade computer. Running on a Nehalem CPU with 8 cores it shows the processing speed of 52 ns/track using the Intel Threading Building Blocks. The same KF algorithm running on an Nvidia GTX 280 in the CUDA frameworkprovi...
Parallel Breadth-First Search on Distributed Memory Systems
Energy Technology Data Exchange (ETDEWEB)
Computational Research Division; Buluc, Aydin; Madduri, Kamesh
2011-04-15
Data-intensive, graph-based computations are pervasive in several scientific applications, and are known to to be quite challenging to implement on distributed memory systems. In this work, we explore the design space of parallel algorithms for Breadth-First Search (BFS), a key subroutine in several graph algorithms. We present two highly-tuned par- allel approaches for BFS on large parallel systems: a level-synchronous strategy that relies on a simple vertex-based partitioning of the graph, and a two-dimensional sparse matrix- partitioning-based approach that mitigates parallel commu- nication overhead. For both approaches, we also present hybrid versions with intra-node multithreading. Our novel hybrid two-dimensional algorithm reduces communication times by up to a factor of 3.5, relative to a common vertex based approach. Our experimental study identifies execu- tion regimes in which these approaches will be competitive, and we demonstrate extremely high performance on lead- ing distributed-memory parallel systems. For instance, for a 40,000-core parallel execution on Hopper, an AMD Magny- Cours based system, we achieve a BFS performance rate of 17.8 billion edge visits per second on an undirected graph of 4.3 billion vertices and 68.7 billion edges with skewed degree distribution.
International Nuclear Information System (INIS)
DeHart, Mark D.; Williams, Mark L.; Bowman, Stephen M.
2010-01-01
The SCALE computational architecture has remained basically the same since its inception 30 years ago, although constituent modules and capabilities have changed significantly. This SCALE concept was intended to provide a framework whereby independent codes can be linked to provide a more comprehensive capability than possible with the individual programs - allowing flexibility to address a wide variety of applications. However, the current system was designed originally for mainframe computers with a single CPU and with significantly less memory than today's personal computers. It has been recognized that the present SCALE computation system could be restructured to take advantage of modern hardware and software capabilities, while retaining many of the modular features of the present system. Preliminary work is being done to define specifications and capabilities for a more advanced computational architecture. This paper describes the state of current SCALE development activities and plans for future development. With the release of SCALE 6.1 in 2010, a new phase of evolutionary development will be available to SCALE users within the TRITON and NEWT modules. The SCALE (Standardized Computer Analyses for Licensing Evaluation) code system developed by Oak Ridge National Laboratory (ORNL) provides a comprehensive and integrated package of codes and nuclear data for a wide range of applications in criticality safety, reactor physics, shielding, isotopic depletion and decay, and sensitivity/uncertainty (S/U) analysis. Over the last three years, since the release of version 5.1 in 2006, several important new codes have been introduced within SCALE, and significant advances applied to existing codes. Many of these new features became available with the release of SCALE 6.0 in early 2009. However, beginning with SCALE 6.1, a first generation of parallel computing is being introduced. In addition to near-term improvements, a plan for longer term SCALE enhancement
International Nuclear Information System (INIS)
Wu, Liang; Zhu, Shiqun
2003-01-01
The chaotic synchronization between two bi-directionally coupled external cavity single-mode semiconductor lasers is investigated. Numerical simulation shows that anticipating synchronization and lag synchronization coexist and switch between each other in certain parameter regime. The anticipating time with different effects that were discussed quite differently in the previous theoretical analysis and experimental observation is determined by the involved parameters in the system
On synchronization of three chaotic systems
International Nuclear Information System (INIS)
Yan Jianping; Li Changpin
2005-01-01
In this paper, a simple but efficient method is applied to the synchronization of three chaotic systems, i.e., the chaotic Lorenz, Chua, and Chen systems. Numerical simulations show this method works very well
Robust adaptive synchronization of general dynamical networks ...
Indian Academy of Sciences (India)
Robust adaptive synchronization; dynamical network; multiple delays; multiple uncertainties. ... Networks such as neural networks, communication transmission networks, social rela- tionship networks etc. ..... a very good effect. Pramana – J.
Multivalued synchronization by Poincaré coupling
Ontañón-García, L. J.; Campos-Cantón, E.; Femat, R.; Campos-Cantón, I.; Bonilla-Marín, M.
2013-10-01
This work presents multivalued chaotic synchronization via coupling based on the Poincaré plane. The coupling is carried out by an underdamped signal, triggered every crossing event of the trajectory of the master system through a previously defined Poincaré plane. A master-slave system is explored, and the synchronization between the systems is detected via the auxiliary system approach and the maximum conditional Lyapunov exponent. Due to the response to specific conditions two phenomena may be obtained: univalued and multivalued synchronization. Since the Lyapunov exponent is not enough to detect these two phenomena, the distance between the pieces of trajectories of the slave and auxiliary systems with different initial conditions is also used as a tool for the detection of multivalued synchronization. Computer simulations using the benchmark chaotic systems of Lorenz and Rössler are used to exemplify the approach proposed.
New GOES satellite synchronized time code generation
Fossler, D. E.; Olson, R. K.
1984-01-01
The TRAK Systems' GOES Satellite Synchronized Time Code Generator is described. TRAK Systems has developed this timing instrument to supply improved accuracy over most existing GOES receiver clocks. A classical time code generator is integrated with a GOES receiver.
Synchronization in complex networks with adaptive coupling
International Nuclear Information System (INIS)
Zhang Rong; Hu Manfeng; Xu Zhenyuan
2007-01-01
Generally it is very difficult to realized synchronization for some complex networks. In order to synchronize, the coupling coefficient of networks has to be very large, especially when the number of coupled nodes is larger. In this Letter, we consider the problem of synchronization in complex networks with adaptive coupling. A new concept about asymptotic stability is presented, then we proved by using the well-known LaSalle invariance principle, that the state of such a complex network can synchronize an arbitrary assigned state of an isolated node of the network as long as the feedback gain is positive. Unified system is simulated as the nodes of adaptive coupling complex networks with different topologies
Synchronous correlation matrices and Connes’ embedding conjecture
Energy Technology Data Exchange (ETDEWEB)
Dykema, Kenneth J., E-mail: kdykema@math.tamu.edu [Department of Mathematics, Texas A& M University, College Station, Texas 77843-3368 (United States); Paulsen, Vern, E-mail: vern@math.uh.edu [Department of Mathematics, University of Houston, Houston, Texas 77204 (United States)
2016-01-15
In the work of Paulsen et al. [J. Funct. Anal. (in press); preprint arXiv:1407.6918], the concept of synchronous quantum correlation matrices was introduced and these were shown to correspond to traces on certain C*-algebras. In particular, synchronous correlation matrices arose in their study of various versions of quantum chromatic numbers of graphs and other quantum versions of graph theoretic parameters. In this paper, we develop these ideas further, focusing on the relations between synchronous correlation matrices and microstates. We prove that Connes’ embedding conjecture is equivalent to the equality of two families of synchronous quantum correlation matrices. We prove that if Connes’ embedding conjecture has a positive answer, then the tracial rank and projective rank are equal for every graph. We then apply these results to more general non-local games.
Some Considerations on Seriality and Synchronicity
Elena Nechita
2010-01-01
This paper presents an overview of the results that have been obtained lately on seriality and synchronicity and their link, in the light of the new theories and within the frame of complexity science.
Some Considerations on Seriality and Synchronicity
Directory of Open Access Journals (Sweden)
Elena Nechita
2010-01-01
Full Text Available This paper presents an overview of the results that have been obtained lately on seriality and synchronicity and their link, in the light of the new theories and within the frame of complexity science.
High Speed Frame Synchronization and Viterbi Decoding
DEFF Research Database (Denmark)
Paaske, Erik; Justesen, Jørn; Larsen, Knud J.
1996-01-01
The purpose of Phase 1 of the study is to describe the system structure and algorithms in sufficient detail to allow drawing the high level architecture of units containing frame synchronization and Viterbi decoding. The systems we consider are high data rate space communication systems. Also...... components. Node synchronization performed within a Viterbi decoder is discussed, and algorithms for frame synchronization are described and analyzed. We present a list of system configurations that we find potentially useful. Further, the high level architecture of units that contain frame synchronization...... and various other functions needed in a complete system is presented. Two such units are described, one for placement before the Viterbi decoder and another for placement after the decoder. The high level architectures of three possible implementations of Viterbi decoders are described: The first...
High Speed Frame Synchronization and Viterbi Decoding
DEFF Research Database (Denmark)
Paaske, Erik; Justesen, Jørn; Larsen, Knud J.
1998-01-01
The study has been divided into two phases. The purpose of Phase 1 of the study was to describe the system structure and algorithms in sufficient detail to allow drawing the high level architecture of units containing frame synchronization and Viterbi decoding. After selection of which specific...... potentially useful.Algorithms for frame synchronization are described and analyzed. Further, the high level architecture of units that contain frame synchronization and various other functions needed in a complete system is presented. Two such units are described, one for placement before the Viterbi decoder...... towards a realization in an FPGA.Node synchronization performed within a Viterbi decoder is discussed, and the high level architectures of three possible implementations of Viterbi decoders are described: The first implementation uses a number of commercially available decoders while the the two others...
Dependence of synchronization frequency of Kuramoto oscillators ...
Indian Academy of Sciences (India)
2Department of Theoretical Physics, Physical Research Laboratory, ... on the sine of the phase difference between the oscillators and hence, ... we study the change in synchronization frequency as the symmetry is changed under the limit of.
Dreams: a framework for distributed synchronous coordination
Proença, J.; Clarke, D.; Vink, de E.P.; Arbab, F.
2012-01-01
Synchronous coordination systems, such as Reo, exchange data via indivisible actions, while distributed systems are typically asynchronous and assume that messages can be delayed or get lost. To combine these seemingly contradictory notions, we introduce the Dreams framework. Coordination patterns
Pitch Synchronous Segmentation of Speech Signals
National Aeronautics and Space Administration — The Pitch Synchronous Segmentation (PSS) that accelerates speech without changing its fundamental frequency method could be applied and evaluated for use at NASA....
SYNCHRONIZATION OF OVULATION IN BEEF HERDS ...
African Journals Online (AJOL)
IMPROVED CONCEPTION RATE AFTER AND INTERRUPTED COURSE ... with normal first insemination figures uncomplicated by synchronization and ... get her pregnant again so that she can consistently recalve ... Delayed ovulation may also contribute towards lower .... Effect of syttdtottizotbn on genad hcrd fatility.
Synchronized flow in oversaturated city traffic.
Kerner, Boris S; Klenov, Sergey L; Hermanns, Gerhard; Hemmerle, Peter; Rehborn, Hubert; Schreckenberg, Michael
2013-11-01
Based on numerical simulations with a stochastic three-phase traffic flow model, we reveal that moving queues (moving jams) in oversaturated city traffic dissolve at some distance upstream of the traffic signal while transforming into synchronized flow. It is found that, as in highway traffic [Kerner, Phys. Rev. E 85, 036110 (2012)], such a jam-absorption effect in city traffic is explained by a strong driver's speed adaptation: Time headways (space gaps) between vehicles increase upstream of a moving queue (moving jam), resulting in moving queue dissolution. It turns out that at given traffic signal parameters, the stronger the speed adaptation effect, the shorter the mean distance between the signal location and the road location at which moving queues dissolve fully and oversaturated traffic consists of synchronized flow only. A comparison of the synchronized flow in city traffic found in this Brief Report with synchronized flow in highway traffic is made.
Parallel Polarization State Generation.
She, Alan; Capasso, Federico
2016-05-17
The control of polarization, an essential property of light, is of wide scientific and technological interest. The general problem of generating arbitrary time-varying states of polarization (SOP) has always been mathematically formulated by a series of linear transformations, i.e. a product of matrices, imposing a serial architecture. Here we show a parallel architecture described by a sum of matrices. The theory is experimentally demonstrated by modulating spatially-separated polarization components of a laser using a digital micromirror device that are subsequently beam combined. This method greatly expands the parameter space for engineering devices that control polarization. Consequently, performance characteristics, such as speed, stability, and spectral range, are entirely dictated by the technologies of optical intensity modulation, including absorption, reflection, emission, and scattering. This opens up important prospects for polarization state generation (PSG) with unique performance characteristics with applications in spectroscopic ellipsometry, spectropolarimetry, communications, imaging, and security.
Stochastic synchronization in finite size spiking networks
Doiron, Brent; Rinzel, John; Reyes, Alex
2006-09-01
We study a stochastic synchronization of spiking activity in feedforward networks of integrate-and-fire model neurons. A stochastic mean field analysis shows that synchronization occurs only when the network size is sufficiently small. This gives evidence that the dynamics, and hence processing, of finite size populations can be drastically different from that observed in the infinite size limit. Our results agree with experimentally observed synchrony in cortical networks, and further strengthen the link between synchrony and propagation in cortical systems.
Stochastic Hydrodynamic Synchronization in Rotating Energy Landscapes
Koumakis, N.; Di Leonardo, R.
2013-01-01
Hydrodynamic synchronization provides a general mechanism for the spontaneous emergence of coherent beating states in independently driven mesoscopic oscillators. A complete physical picture of those phenomena is of definite importance to the understanding of biological cooperative motions of cilia and flagella. Moreover, it can potentially suggest novel routes to exploit synchronization in technological applications of soft matter. We demonstrate that driving colloidal particles in rotating ...
Synchronous and Asynchronous ATM Multiplexor Properties Comparsion
Jan Zabka
2006-01-01
The article is aimed to ATM multiplexor computer model utilisation. Based on simulation runs we try to review aspects of use a synchronous and asynchronous ATM multiplexors. ATM multiplexor is the input queuing model with three inputs. Synchronous multiplexor works without an input priority. Multiplexor inputs are served periodically. Asynchronous multiplexor model supports several queuing and priority mechanisms. CLR and CTD are basic performance parameters. Input cell flows are genera...
Projective synchronization based on suitable separation
International Nuclear Information System (INIS)
Li Guohui; Xiong Chuan; Sun Xiaonan
2007-01-01
A new approach for constructing a projective-synchronized chaotic slave system is proposed in this paper. This method is based on suitable separation by decomposing the system as the linear part and the nonlinear one. From matrix measure theory, some simple but efficient criteria are derived for projective synchronization of chaotic system. Numerical simulations for the Lorenz system show that this control method works very well
Full state hybrid projective synchronization in hyperchaotic systems
International Nuclear Information System (INIS)
Chu Yandong; Chang Yingxiang; Zhang Jiangang; Li Xianfeng; An Xinlei
2009-01-01
In this letter, we investigate the full state hybrid projective synchronization (FSHPS) which includes complete synchronization, anti-synchronization and projective synchronization as its special items. Based on Lyapunov stability theory a controller can be designed for achieving the FSHPS of hyperchaotic systems. Numerical simulations are provided to verify the effectiveness of the proposed scheme.
Complete synchronization of two Chen-Lee systems
International Nuclear Information System (INIS)
Sheu, L-J; Chen, J-H; Chen, H-K; Tam, L-M; Lao, S-K; Chen, W-C; Lin, K-T
2008-01-01
This study demonstrates that complete synchronization of two Chen-Lee chaotic systems can be easily achieved. The upper bound of the Chen-Lee chaotic system is estimated numerically. A controller is designed to synchronize two chaotic systems. Sufficient conditions for synchronization are obtained using Lyapunov's direct method. Two numerical examples are presented to verify the proposed synchronization approach
Nonlinear observer based phase synchronization of chaotic systems
International Nuclear Information System (INIS)
Meng Juan; Wang Xingyuan
2007-01-01
This Letter analyzes the phase synchronization problem of autonomous chaotic systems. Based on the nonlinear state observer algorithm and the pole placement technique, a phase synchronization scheme is designed. The phase synchronization of a new chaotic system is achieved by using this observer controller. Numerical simulations further demonstrate the effectiveness of the proposed phase synchronization scheme
Parallel discrete event simulation: A shared memory approach
Reed, Daniel A.; Malony, Allen D.; Mccredie, Bradley D.
1987-01-01
With traditional event list techniques, evaluating a detailed discrete event simulation model can often require hours or even days of computation time. Parallel simulation mimics the interacting servers and queues of a real system by assigning each simulated entity to a processor. By eliminating the event list and maintaining only sufficient synchronization to insure causality, parallel simulation can potentially provide speedups that are linear in the number of processors. A set of shared memory experiments is presented using the Chandy-Misra distributed simulation algorithm to simulate networks of queues. Parameters include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential simulation of most queueing network models.
Frame Synchronization Without Attached Sync Markers
Hamkins, Jon
2011-01-01
We describe a method to synchronize codeword frames without making use of attached synchronization markers (ASMs). Instead, the synchronizer identifies the code structure present in the received symbols, by operating the decoder for a handful of iterations at each possible symbol offset and forming an appropriate metric. This method is computationally more complex and doesn't perform as well as frame synchronizers that utilize an ASM; nevertheless, the new synchronizer acquires frame synchronization in about two seconds when using a 600 kbps software decoder, and would take about 15 milliseconds on prototype hardware. It also eliminates the need for the ASMs, which is an attractive feature for short uplink codes whose coding gain would be diminished by the overheard of ASM bits. The lack of ASMs also would simplify clock distribution for the AR4JA low-density parity-check (LDPC) codes and adds a small amount to the coding gain as well (up to 0.2 dB).
Synchronization of mobile chaotic oscillator networks
Energy Technology Data Exchange (ETDEWEB)
Fujiwara, Naoya, E-mail: fujiwara@csis.u-tokyo.ac.jp [Center for Spatial Information Science, The University of Tokyo, 277-8568 Chiba (Japan); Kurths, Jürgen [Potsdam Institute for Climate Impact Research (PIK), 14473 Potsdam, Germany and Institute for Complex Systems and Mathematical Biology, University of Aberdeen, Aberdeen (United Kingdom); Díaz-Guilera, Albert [Departament de Física de la Matèria Condensada, Universitat de Barcelona, Martí i Franquès 1, 08028 Barcelona, Spain and Universitat de Barcelona Institute of Complex Systems (UBICS), Universitat de Barcelona, Barcelona (Spain)
2016-09-15
We study synchronization of systems in which agents holding chaotic oscillators move in a two-dimensional plane and interact with nearby ones forming a time dependent network. Due to the uncertainty in observing other agents' states, we assume that the interaction contains a certain amount of noise that turns out to be relevant for chaotic dynamics. We find that a synchronization transition takes place by changing a control parameter. But this transition depends on the relative dynamic scale of motion and interaction. When the topology change is slow, we observe an intermittent switching between laminar and burst states close to the transition due to small noise. This novel type of synchronization transition and intermittency can happen even when complete synchronization is linearly stable in the absence of noise. We show that the linear stability of the synchronized state is not a sufficient condition for its stability due to strong fluctuations of the transverse Lyapunov exponent associated with a slow network topology change. Since this effect can be observed within the linearized dynamics, we can expect such an effect in the temporal networks with noisy chaotic oscillators, irrespective of the details of the oscillator dynamics. When the topology change is fast, a linearized approximation describes well the dynamics towards synchrony. These results imply that the fluctuations of the finite-time transverse Lyapunov exponent should also be taken into account to estimate synchronization of the mobile contact networks.
Synchronization of mobile chaotic oscillator networks
International Nuclear Information System (INIS)
Fujiwara, Naoya; Kurths, Jürgen; Díaz-Guilera, Albert
2016-01-01
We study synchronization of systems in which agents holding chaotic oscillators move in a two-dimensional plane and interact with nearby ones forming a time dependent network. Due to the uncertainty in observing other agents' states, we assume that the interaction contains a certain amount of noise that turns out to be relevant for chaotic dynamics. We find that a synchronization transition takes place by changing a control parameter. But this transition depends on the relative dynamic scale of motion and interaction. When the topology change is slow, we observe an intermittent switching between laminar and burst states close to the transition due to small noise. This novel type of synchronization transition and intermittency can happen even when complete synchronization is linearly stable in the absence of noise. We show that the linear stability of the synchronized state is not a sufficient condition for its stability due to strong fluctuations of the transverse Lyapunov exponent associated with a slow network topology change. Since this effect can be observed within the linearized dynamics, we can expect such an effect in the temporal networks with noisy chaotic oscillators, irrespective of the details of the oscillator dynamics. When the topology change is fast, a linearized approximation describes well the dynamics towards synchrony. These results imply that the fluctuations of the finite-time transverse Lyapunov exponent should also be taken into account to estimate synchronization of the mobile contact networks.
Synchronization of mobile chaotic oscillator networks.
Fujiwara, Naoya; Kurths, Jürgen; Díaz-Guilera, Albert
2016-09-01
We study synchronization of systems in which agents holding chaotic oscillators move in a two-dimensional plane and interact with nearby ones forming a time dependent network. Due to the uncertainty in observing other agents' states, we assume that the interaction contains a certain amount of noise that turns out to be relevant for chaotic dynamics. We find that a synchronization transition takes place by changing a control parameter. But this transition depends on the relative dynamic scale of motion and interaction. When the topology change is slow, we observe an intermittent switching between laminar and burst states close to the transition due to small noise. This novel type of synchronization transition and intermittency can happen even when complete synchronization is linearly stable in the absence of noise. We show that the linear stability of the synchronized state is not a sufficient condition for its stability due to strong fluctuations of the transverse Lyapunov exponent associated with a slow network topology change. Since this effect can be observed within the linearized dynamics, we can expect such an effect in the temporal networks with noisy chaotic oscillators, irrespective of the details of the oscillator dynamics. When the topology change is fast, a linearized approximation describes well the dynamics towards synchrony. These results imply that the fluctuations of the finite-time transverse Lyapunov exponent should also be taken into account to estimate synchronization of the mobile contact networks.
Explosive synchronization transitions in complex neural networks
Chen, Hanshuang; He, Gang; Huang, Feng; Shen, Chuansheng; Hou, Zhonghuai
2013-09-01
It has been recently reported that explosive synchronization transitions can take place in networks of phase oscillators [Gómez-Gardeñes et al. Phys. Rev. Lett. 106, 128701 (2011)] and chaotic oscillators [Leyva et al. Phys. Rev. Lett. 108, 168702 (2012)]. Here, we investigate the effect of a microscopic correlation between the dynamics and the interacting topology of coupled FitzHugh-Nagumo oscillators on phase synchronization transition in Barabási-Albert (BA) scale-free networks and Erdös-Rényi (ER) random networks. We show that, if natural frequencies of the oscillations are positively correlated with node degrees and the width of the frequency distribution is larger than a threshold value, a strong hysteresis loop arises in the synchronization diagram of BA networks, indicating the evidence of an explosive transition towards synchronization of relaxation oscillators system. In contrast to the results in BA networks, in more homogeneous ER networks, the synchronization transition is always of continuous type regardless of the width of the frequency distribution. Moreover, we consider the effect of degree-mixing patterns on the nature of the synchronization transition, and find that the degree assortativity is unfavorable for the occurrence of such an explosive transition.
Fault-tolerant clock synchronization in distributed systems
Ramanathan, Parameswaran; Shin, Kang G.; Butler, Ricky W.
1990-01-01
Existing fault-tolerant clock synchronization algorithms are compared and contrasted. These include the following: software synchronization algorithms, such as convergence-averaging, convergence-nonaveraging, and consistency algorithms, as well as probabilistic synchronization; hardware synchronization algorithms; and hybrid synchronization. The worst-case clock skews guaranteed by representative algorithms are compared, along with other important aspects such as time, message, and cost overhead imposed by the algorithms. More recent developments such as hardware-assisted software synchronization and algorithms for synchronizing large, partially connected distributed systems are especially emphasized.
About Parallel Programming: Paradigms, Parallel Execution and Collaborative Systems
Directory of Open Access Journals (Sweden)
Loredana MOCEAN
2009-01-01
Full Text Available In the last years, there were made efforts for delineation of a stabile and unitary frame, where the problems of logical parallel processing must find solutions at least at the level of imperative languages. The results obtained by now are not at the level of the made efforts. This paper wants to be a little contribution at these efforts. We propose an overview in parallel programming, parallel execution and collaborative systems.
Quantum synchronization in an optomechanical system based on Lyapunov control.
Li, Wenlin; Li, Chong; Song, Heshan
2016-06-01
We extend the concepts of quantum complete synchronization and phase synchronization, which were proposed in A. Mari et al., Phys. Rev. Lett. 111, 103605 (2013)PRLTAO0031-900710.1103/PhysRevLett.111.103605, to more widespread quantum generalized synchronization. Generalized synchronization can be considered a necessary condition or a more flexible derivative of complete synchronization, and its criterion and synchronization measure are proposed and analyzed in this paper. As examples, we consider two typical generalized synchronizations in a designed optomechanical system. Unlike the effort to construct a special coupling synchronization system, we purposefully design extra control fields based on Lyapunov control theory. We find that the Lyapunov function can adapt to more flexible control objectives, which is more suitable for generalized synchronization control, and the control fields can be achieved simply with a time-variant voltage. Finally, the existence of quantum entanglement in different generalized synchronizations is also discussed.
Chaos synchronization in autonomous chaotic system via hybrid feedback control
International Nuclear Information System (INIS)
Yang Lixin; Chu Yandong; Zhang Jiangang; Li Xianfeng; Chang Yingxiang
2009-01-01
This paper presents the synchronization of chaos by designing united controller. First, this method is implemented in synchronization of a simple system, then we realize the synchronization of Lue hyperchaotic system, we also take tracking control to realize the synchronization of Lue hyperchaotic system. Comparing with results, we can find that hybrid feedback control approach is more effective than tracking control for hyperchaotic system. Numerical simulations show the united synchronization method works well.
Synchronization of Coupled Neurons Controlled by a Pacemaker
International Nuclear Information System (INIS)
Li Mei-Sheng; Zhang Hong-Hui; Zhao Yong; Shi Xia
2011-01-01
We investigate synchronization of Hindmarsh—Rose neurons with gap junctions under the control of a pacemaker. In a ring Hindmarsh—Rose neuronal network, the coupled neurons with the pacemaker can occur in synchronization more easily than those without the pacemaker. Furthermore, the pacemaker can induce phase synchronization or nearly-complete synchronization of nonidentical neurons. This synchronization can occur more easily when time delay is considered. Theses results can be helpful to understand the activities of the real neuronal system. (general)
Chaos synchronizations of chaotic systems via active nonlinear control
International Nuclear Information System (INIS)
Huang, J; Xiao, T J
2008-01-01
This paper not only investigates the chaos synchronization between two LCC chaotic systems, but also discusses the chaos synchronization between LCC system and Genesio system. Some novel active nonlinear controllers are designed to achieve synchronizations between drive and response systems effectively. Moreover, the sufficient conditions of synchronizations are derived by using Lyapunov stability theorem. Numerical simulations are presented to verify the theoretical analysis, which shows that the synchronization schemes are global effective
Guide to Synchronization of Video Systems to IRIG Timing
1992-07-01
and industry. 1-2 CHAPTER 2 SYNCHRONISATION Before delving into the details of synchronization , a review is needed of the reasons for synchronizing ... Synchronization of Video Systems to IRIG Timing Optical Systems Group Range Commanders Council White Sands Missile Range, NM 88002-5110 RCC Document 456-92 Range...This document addresses a broad field of video synchronization to IRIG timing with emphasis on color synchronization . This document deals with
Directory of Open Access Journals (Sweden)
Md Ruhul Amin
2017-12-01
Full Text Available In this paper, a fast self-synchronization known as virtual synchronous converter (VSCon between single-phase microgrid and inverter in low-voltage microgrid, has been developed in Matlab/Simulink. The idea is to any phase locked loop (PLL circuit for inverter-microgrid synchronization in order to improve the synchronization time. As known, it is difficult and lengthy process to tune the PLL gain parameters to reach suitable performance for synchronizing among the voltage, phase-angle and frequency between them. Due to this problem, a fast self synchronization technique is needed in order to minimize the time losses at the microgrid connection. Therefore, the VSCon has been developed which is based on the synchronous generator mathematical model but in virtual environment representation. It has been applied in the inverter control for generating switching pattern to the inverter switches in order to respond to the grid voltage for improve the synchronization. For a prove of concept, several simulation tests in MATLAB models have been conducted, in order to see the effectiveness of this VSCon. First test has been conducted, when a 240V, 50Hz frequency grid source is used for observing the self-synchronization the system with the power flows output. Furthermore, the next test is conducted when the grid frequency is changed from the rated frequency at 50Hz to 51Hz and the result shows the VSCon in inverter control takes nearly 40ms to synchronize to this new frequency value. The test on grid phase-angle delay also been tested when ac grid voltage has 150 phase delay. As from all the results, the improved inverter control with VSCon structure is able to have fast and self-synchronized between the invertergrid connection before the power from the inverter can be transferred.
Mapping of synchronous dataflow graphs on MPSoCs based on parallelism enhancement
Tang, Q.; Basten, T.; Geilen, M.; Stuijk, S.; Wei, J.B.
2017-01-01
Multi-processor systems-on-chips are widely adopted in implementing modern streaming applications to satisfy the ever increasing computation requirements. To take advantage of this kind of platform, it is necessary to map tasks of the application properly to different processors, so as to fully
Parallel Framework for Cooperative Processes
Directory of Open Access Journals (Sweden)
Mitică Craus
2005-01-01
Full Text Available This paper describes the work of an object oriented framework designed to be used in the parallelization of a set of related algorithms. The idea behind the system we are describing is to have a re-usable framework for running several sequential algorithms in a parallel environment. The algorithms that the framework can be used with have several things in common: they have to run in cycles and the work should be possible to be split between several "processing units". The parallel framework uses the message-passing communication paradigm and is organized as a master-slave system. Two applications are presented: an Ant Colony Optimization (ACO parallel algorithm for the Travelling Salesman Problem (TSP and an Image Processing (IP parallel algorithm for the Symmetrical Neighborhood Filter (SNF. The implementations of these applications by means of the parallel framework prove to have good performances: approximatively linear speedup and low communication cost.
Parallel Monte Carlo reactor neutronics
International Nuclear Information System (INIS)
Blomquist, R.N.; Brown, F.B.
1994-01-01
The issues affecting implementation of parallel algorithms for large-scale engineering Monte Carlo neutron transport simulations are discussed. For nuclear reactor calculations, these include load balancing, recoding effort, reproducibility, domain decomposition techniques, I/O minimization, and strategies for different parallel architectures. Two codes were parallelized and tested for performance. The architectures employed include SIMD, MIMD-distributed memory, and workstation network with uneven interactive load. Speedups linear with the number of nodes were achieved
DEFF Research Database (Denmark)
Kosbar, Tamer R.; Sofan, Mamdouh A.; Waly, Mohamed A.
2015-01-01
about 6.1 °C when the TFO strand was modified with Z and the Watson-Crick strand with adenine-LNA (AL). The molecular modeling results showed that, in case of nucleobases Y and Z a hydrogen bond (1.69 and 1.72 Å, respectively) was formed between the protonated 3-aminopropyn-1-yl chain and one...... of the phosphate groups in Watson-Crick strand. Also, it was shown that the nucleobase Y made a good stacking and binding with the other nucleobases in the TFO and Watson-Crick duplex, respectively. In contrast, the nucleobase Z with LNA moiety was forced to twist out of plane of Watson-Crick base pair which......The phosphoramidites of DNA monomers of 7-(3-aminopropyn-1-yl)-8-aza-7-deazaadenine (Y) and 7-(3-aminopropyn-1-yl)-8-aza-7-deazaadenine LNA (Z) are synthesized, and the thermal stability at pH 7.2 and 8.2 of anti-parallel triplexes modified with these two monomers is determined. When, the anti...
Parallel consensual neural networks.
Benediktsson, J A; Sveinsson, J R; Ersoy, O K; Swain, P H
1997-01-01
A new type of a neural-network architecture, the parallel consensual neural network (PCNN), is introduced and applied in classification/data fusion of multisource remote sensing and geographic data. The PCNN architecture is based on statistical consensus theory and involves using stage neural networks with transformed input data. The input data are transformed several times and the different transformed data are used as if they were independent inputs. The independent inputs are first classified using the stage neural networks. The output responses from the stage networks are then weighted and combined to make a consensual decision. In this paper, optimization methods are used in order to weight the outputs from the stage networks. Two approaches are proposed to compute the data transforms for the PCNN, one for binary data and another for analog data. The analog approach uses wavelet packets. The experimental results obtained with the proposed approach show that the PCNN outperforms both a conjugate-gradient backpropagation neural network and conventional statistical methods in terms of overall classification accuracy of test data.
A Parallel Particle Swarm Optimizer
National Research Council Canada - National Science Library
Schutte, J. F; Fregly, B .J; Haftka, R. T; George, A. D
2003-01-01
.... Motivated by a computationally demanding biomechanical system identification problem, we introduce a parallel implementation of a stochastic population based global optimizer, the Particle Swarm...
Patterns for Parallel Software Design
Ortega-Arjona, Jorge Luis
2010-01-01
Essential reading to understand patterns for parallel programming Software patterns have revolutionized the way we think about how software is designed, built, and documented, and the design of parallel software requires you to consider other particular design aspects and special skills. From clusters to supercomputers, success heavily depends on the design skills of software developers. Patterns for Parallel Software Design presents a pattern-oriented software architecture approach to parallel software design. This approach is not a design method in the classic sense, but a new way of managin
DEFF Research Database (Denmark)
Christensen, Mark Schram; Ehrsson, H Henrik; Nielsen, Jens Bo
2013-01-01
a different network, involving bilateral dorsal premotor cortex (PMd), primary motor cortex, and SMA, was more active when subjects viewed parallel movements while performing either symmetrical or parallel movements. Correlations between behavioral instability and brain activity were present in right lateral...... adduction-abduction movements symmetrically or in parallel with real-time congruent or incongruent visual feedback of the movements. One network, consisting of bilateral superior and middle frontal gyrus and supplementary motor area (SMA), was more active when subjects performed parallel movements, whereas...
International Nuclear Information System (INIS)
Alvarez, G.; Li Shujun; Montoya, F.; Pastor, G.; Romera, M.
2005-01-01
This paper describes the security weaknesses of a recently proposed secure communication method based on chaotic masking using projective synchronization of two chaotic systems. We show that the system is insecure and how to break it in two different ways, by high-pass filtering and by generalized synchronization
International Nuclear Information System (INIS)
Yan-Li, Zou; Guan-Rong, Chen
2009-01-01
This paper studies pinning-controlled synchronization of complex networks with bounded or unbounded synchronized regions. To study a state-feedback pinning-controlled network with N nodes, it first converts the controlled network to an extended network of N+1 nodes without controls. It is shown that the controlled synchronizability of the given network is determined by the real part of the smallest nonzero eigenvalue of the coupling matrix of its extended network when the synchronized region is unbounded; but it is determined by the ratio of the real parts of the largest and the smallest nonzero eigenvalues of the coupling matrix when the synchronized region is bounded. Both theoretical analysis and numerical simulation show that the portion of controlled nodes has no critical values when the synchronized region is unbounded, but it has a critical value when the synchronized region is bounded. In the former case, therefore, it is possible to control the network to achieve synchronization by pinning only one node. In the latter case, the network can achieve controlled synchronization only when the portion of controlled nodes is larger than the critical value. (general)
Massively Parallel Dimension Independent Adaptive Metropolis
Chen, Yuxin
2015-05-14
This work considers black-box Bayesian inference over high-dimensional parameter spaces. The well-known and widely respected adaptive Metropolis (AM) algorithm is extended herein to asymptotically scale uniformly with respect to the underlying parameter dimension, by respecting the variance, for Gaussian targets. The result- ing algorithm, referred to as the dimension-independent adaptive Metropolis (DIAM) algorithm, also shows improved performance with respect to adaptive Metropolis on non-Gaussian targets. This algorithm is further improved, and the possibility of probing high-dimensional targets is enabled, via GPU-accelerated numerical libraries and periodically synchronized concurrent chains (justified a posteriori). Asymptoti- cally in dimension, this massively parallel dimension-independent adaptive Metropolis (MPDIAM) GPU implementation exhibits a factor of four improvement versus the CPU-based Intel MKL version alone, which is itself already a factor of three improve- ment versus the serial version. The scaling to multiple CPUs and GPUs exhibits a form of strong scaling in terms of the time necessary to reach a certain convergence criterion, through a combination of longer time per sample batch (weak scaling) and yet fewer necessary samples to convergence. This is illustrated by e ciently sampling from several Gaussian and non-Gaussian targets for dimension d 1000.
Sindhikara, Daniel J; Kim, Seonah; Voter, Arthur F; Roitberg, Adrian E
2009-06-09
Molecular dynamics simulations starting from different initial conditions are commonly used to mimic the behavior of an experimental ensemble. We show in this article that when a Langevin thermostat is used to maintain constant temperature during such simulations, extreme care must be taken when choosing the random number seeds to prevent statistical correlation among the MD trajectories. While recent studies have shown that stochastically thermostatted trajectories evolving within a single potential basin with identical random number seeds tend to synchronize, we show that there is a synchronization effect even for complex, biologically relevant systems. We demonstrate this effect in simulations of alanine trimer and pentamer and in a simulation of a temperature-jump experiment for peptide folding of a 14-residue peptide. Even in replica-exchange simulations, in which the trajectories are at different temperatures, we find partial synchronization occurring when the same random number seed is employed. We explain this by extending the recent derivation of the synchronization effect for two trajectories in a harmonic well to the case in which the trajectories are at two different temperatures. Our results suggest several ways in which mishandling selection of a pseudorandom number generator initial seed can lead to corruption of simulation data. Simulators can fall into this trap in simple situations such as neglecting to specifically indicate different random seeds in either parallel or sequential restart simulations, utilizing a simulation package with a weak pseudorandom number generator, or using an advanced simulation algorithm that has not been programmed to distribute initial seeds.
Asynchronous Task-Based Parallelization of Algebraic Multigrid
AlOnazi, Amani A.
2017-06-23
As processor clock rates become more dynamic and workloads become more adaptive, the vulnerability to global synchronization that already complicates programming for performance in today\\'s petascale environment will be exacerbated. Algebraic multigrid (AMG), the solver of choice in many large-scale PDE-based simulations, scales well in the weak sense, with fixed problem size per node, on tightly coupled systems when loads are well balanced and core performance is reliable. However, its strong scaling to many cores within a node is challenging. Reducing synchronization and increasing concurrency are vital adaptations of AMG to hybrid architectures. Recent communication-reducing improvements to classical additive AMG by Vassilevski and Yang improve concurrency and increase communication-computation overlap, while retaining convergence properties close to those of standard multiplicative AMG, but remain bulk synchronous.We extend the Vassilevski and Yang additive AMG to asynchronous task-based parallelism using a hybrid MPI+OmpSs (from the Barcelona Supercomputer Center) within a node, along with MPI for internode communications. We implement a tiling approach to decompose the grid hierarchy into parallel units within task containers. We compare against the MPI-only BoomerAMG and the Auxiliary-space Maxwell Solver (AMS) in the hypre library for the 3D Laplacian operator and the electromagnetic diffusion, respectively. In time to solution for a full solve an MPI-OmpSs hybrid improves over an all-MPI approach in strong scaling at full core count (32 threads per single Haswell node of the Cray XC40) and maintains this per node advantage as both weak scale to thousands of cores, with MPI between nodes.
Chen, Ming; He, Jing; Cao, Zizheng; Tang, Jin; Chen, Lin; Wu, Xian
2014-09-01
In this paper, we propose and experimentally demonstrate a symbol synchronization and sampling frequency synchronization techniques in real-time direct-detection optical orthogonal frequency division multiplexing (DDO-OFDM) system, over 100-km standard single mode fiber (SSMF) using a cost-effective directly modulated distributed feedback (DFB) laser. The experiment results show that the proposed symbol synchronization based on training sequence (TS) has a low complexity and high accuracy even at a sampling frequency offset (SFO) of 5000-ppm. Meanwhile, the proposed pilot-assisted sampling frequency synchronization between digital-to-analog converter (DAC) and analog-to-digital converter (ADC) is capable of estimating SFOs with an accuracy of technique can also compensate SFO effects within a small residual SFO caused by deviation of SFO estimation and low-precision or unstable clock source. The two synchronization techniques are suitable for high-speed DDO-OFDM transmission systems.
Study of a mixed parallel and serial data transmission in trigger system of Beijing Spectrometer III
International Nuclear Information System (INIS)
Wang Ke; Yin Zejie; Liu Zhen'an; Zhao Dixin; Guo Ya'nan
2005-01-01
Serial optical fiber transmission technology will be used to transfer data from the detector electronics systems to the trigger system in the Beijing Spectrometer III. This technology has the advantages of cutting off the ground loops between the electronics systems and the trigger system, improving the system immunity to electro-magnetic interference and lengthening the transfer distance. Some important aspects of this technology are carefully studied, such as the bit-error-rate, error report, synchronization-back, delay skew of channels and phase stability. Design for single line self-synchronizing back is given, which makes the system more robust. The skew of channels is half a period. So the synchronous parallel data can be gotten if the rising of sample clock is set at the middle of the stable time of all deserialized data. This method can meet the requirement of BES III data transmission. (authors)
Blending Online Asynchronous and Synchronous Learning
Directory of Open Access Journals (Sweden)
Lisa C. Yamagata-Lynch
2014-04-01
Full Text Available In this article I will share a qualitative self-study about a 15-week blended 100% online graduate level course facilitated through synchronous meetings on Blackboard Collaborate and asynchronous discussions on Blackboard. I taught the course at the University of Tennessee (UT during the spring 2012 semester and the course topic was online learning environments. The primary research question of this study was: How can the designer/instructor optimize learning experiences for students who are studying about online learning environments in a blended online course relying on both synchronous and asynchronous technologies? I relied on student reflections of course activities during the beginning, middle, and the end of the semester as the primary data source to obtain their insights regarding course experiences. Through the experiences involved in designing and teaching the course and engaging in this study I found that there is room in the instructional technology research community to address strategies for facilitating online synchronous learning that complement asynchronous learning. Synchronous online whole class meetings and well-structured small group meetings can help students feel a stronger sense of connection to their peers and instructor and stay engaged with course activities. In order to provide meaningful learning spaces in synchronous learning environments, the instructor/designer needs to balance the tension between embracing the flexibility that the online space affords to users and designing deliberate structures that will help them take advantage of the flexible space.
Emergent explosive synchronization in adaptive complex networks
Avalos-Gaytán, Vanesa; Almendral, Juan A.; Leyva, I.; Battiston, F.; Nicosia, V.; Latora, V.; Boccaletti, S.
2018-04-01
Adaptation plays a fundamental role in shaping the structure of a complex network and improving its functional fitting. Even when increasing the level of synchronization in a biological system is considered as the main driving force for adaptation, there is evidence of negative effects induced by excessive synchronization. This indicates that coherence alone cannot be enough to explain all the structural features observed in many real-world networks. In this work, we propose an adaptive network model where the dynamical evolution of the node states toward synchronization is coupled with an evolution of the link weights based on an anti-Hebbian adaptive rule, which accounts for the presence of inhibitory effects in the system. We found that the emergent networks spontaneously develop the structural conditions to sustain explosive synchronization. Our results can enlighten the shaping mechanisms at the heart of the structural and dynamical organization of some relevant biological systems, namely, brain networks, for which the emergence of explosive synchronization has been observed.
Adaptive Control Algorithm of the Synchronous Generator
Directory of Open Access Journals (Sweden)
Shevchenko Victor
2017-01-01
Full Text Available The article discusses the the problem of controlling a synchronous generator, namely, maintaining the stability of the control object in the conditions of occurrence of noise and disturbances in the regulatory process. The model of a synchronous generator is represented by a system of differential equations of Park-Gorev, where state variables are computed relative to synchronously rotating d, q-axis. Management of synchronous generator is proposed to organize on the basis of the position-path control using algorithms to adapt with the reference model. Basic control law directed on the stabilizing indicators the frequency generated by the current and the required power level, which is achieved by controlling the mechanical torque on the shaft of the turbine and the value of the excitation voltage of the synchronous generator. Modification of the classic adaptation algorithm using the reference model, allowing to minimize the error of the reference regulation and the model under investigation within the prescribed limits, produced by means of the introduction of additional variables controller adaptation in the model. Сarried out the mathematical modeling of control provided influence on the studied model of continuous nonlinear and unmeasured the disturbance. Simulation results confirm the high level accuracy of tracking and adaptation investigated model with respect to the reference, and the present value of the loop error depends on parameters performance of regulator.
Chaotic synchronization of two complex nonlinear oscillators
International Nuclear Information System (INIS)
Mahmoud, Gamal M.; Mahmoud, Emad E.; Farghaly, Ahmed A.; Aly, Shaban A.
2009-01-01
Synchronization is an important phenomenon commonly observed in nature. It is also often artificially induced because it is desirable for a variety of applications in physics, applied sciences and engineering. In a recent paper [Mahmoud GM, Mohamed AA, Aly SA. Strange attractors and chaos control in periodically forced complex Duffing's oscillators. Physica A 2001;292:193-206], a system of periodically forced complex Duffing's oscillators was introduced and shown to display chaotic behavior and possess strange attractors. Such complex oscillators appear in many problems of physics and engineering, as, for example, nonlinear optics, deep-water wave theory, plasma physics and bimolecular dynamics. Their connection to solutions of the nonlinear Schroedinger equation has also been pointed out. In this paper, we study the remarkable phenomenon of chaotic synchronization on these oscillator systems, using active control and global synchronization techniques. We derive analytical expressions for control functions and show that the dynamics of error evolution is globally stable, by constructing appropriate Lyapunov functions. This means that, for a relatively large set initial conditions, the differences between the drive and response systems vanish exponentially and synchronization is achieved. Numerical results are obtained to test the validity of the analytical expressions and illustrate the efficiency of these techniques for inducing chaos synchronization in our nonlinear oscillators.
PARALLEL IMPORT: REALITY FOR RUSSIA
Directory of Open Access Journals (Sweden)
Т. А. Сухопарова
2014-01-01
Full Text Available Problem of parallel import is urgent question at now. Parallel import legalization in Russia is expedient. Such statement based on opposite experts opinion analysis. At the same time it’s necessary to negative consequences consider of this decision and to apply remedies to its minimization.Purchase on Elibrary.ru > Buy now
The Galley Parallel File System
Nieuwejaar, Nils; Kotz, David
1996-01-01
Most current multiprocessor file systems are designed to use multiple disks in parallel, using the high aggregate bandwidth to meet the growing I/0 requirements of parallel scientific applications. Many multiprocessor file systems provide applications with a conventional Unix-like interface, allowing the application to access multiple disks transparently. This interface conceals the parallelism within the file system, increasing the ease of programmability, but making it difficult or impossible for sophisticated programmers and libraries to use knowledge about their I/O needs to exploit that parallelism. In addition to providing an insufficient interface, most current multiprocessor file systems are optimized for a different workload than they are being asked to support. We introduce Galley, a new parallel file system that is intended to efficiently support realistic scientific multiprocessor workloads. We discuss Galley's file structure and application interface, as well as the performance advantages offered by that interface.
Parallelization of the FLAPW method
International Nuclear Information System (INIS)
Canning, A.; Mannstadt, W.; Freeman, A.J.
1999-01-01
The FLAPW (full-potential linearized-augmented plane-wave) method is one of the most accurate first-principles methods for determining electronic and magnetic properties of crystals and surfaces. Until the present work, the FLAPW method has been limited to systems of less than about one hundred atoms due to a lack of an efficient parallel implementation to exploit the power and memory of parallel computers. In this work we present an efficient parallelization of the method by division among the processors of the plane-wave components for each state. The code is also optimized for RISC (reduced instruction set computer) architectures, such as those found on most parallel computers, making full use of BLAS (basic linear algebra subprograms) wherever possible. Scaling results are presented for systems of up to 686 silicon atoms and 343 palladium atoms per unit cell, running on up to 512 processors on a CRAY T3E parallel computer
Parallelization of the FLAPW method
Canning, A.; Mannstadt, W.; Freeman, A. J.
2000-08-01
The FLAPW (full-potential linearized-augmented plane-wave) method is one of the most accurate first-principles methods for determining structural, electronic and magnetic properties of crystals and surfaces. Until the present work, the FLAPW method has been limited to systems of less than about a hundred atoms due to the lack of an efficient parallel implementation to exploit the power and memory of parallel computers. In this work, we present an efficient parallelization of the method by division among the processors of the plane-wave components for each state. The code is also optimized for RISC (reduced instruction set computer) architectures, such as those found on most parallel computers, making full use of BLAS (basic linear algebra subprograms) wherever possible. Scaling results are presented for systems of up to 686 silicon atoms and 343 palladium atoms per unit cell, running on up to 512 processors on a CRAY T3E parallel supercomputer.
Synchronization coupled systems to complex networks
Boccaletti, Stefano; del Genio, Charo I; Amann, Andreas
2018-01-01
A modern introduction to synchronization phenomena, this text presents recent discoveries and the current state of research in the field, from low-dimensional systems to complex networks. The book describes some of the main mechanisms of collective behaviour in dynamical systems, including simple coupled systems, chaotic systems, and systems of infinite-dimension. After introducing the reader to the basic concepts of nonlinear dynamics, the book explores the main synchronized states of coupled systems and describes the influence of noise and the occurrence of synchronous motion in multistable and spatially-extended systems. Finally, the authors discuss the underlying principles of collective dynamics on complex networks, providing an understanding of how networked systems are able to function as a whole in order to process information, perform coordinated tasks, and respond collectively to external perturbations. The demonstrations, numerous illustrations and application examples will help advanced graduate s...
Designing Learning Resources in Synchronous Learning Environments
DEFF Research Database (Denmark)
Christiansen, Rene B
2015-01-01
Computer-mediated Communication (CMC) and synchronous learning environments offer new solutions for teachers and students that transcend the singular one-way transmission of content knowledge from teacher to student. CMC makes it possible not only to teach computer mediated but also to design...... and create new learning resources targeted to a specific group of learners. This paper addresses the possibilities of designing learning resources within synchronous learning environments. The empirical basis is a cross-country study involving students and teachers in primary schools in three Nordic...... Countries (Denmark, Sweden and Norway). On the basis of these empirical studies a set of design examples is drawn with the purpose of showing how the design fulfills the dual purpose of functioning as a remote, synchronous learning environment and - using the learning materials used and recordings...
Adaptive elimination of synchronization in coupled oscillator
Zhou, Shijie; Ji, Peng; Zhou, Qing; Feng, Jianfeng; Kurths, Jürgen; Lin, Wei
2017-08-01
We present here an adaptive control scheme with a feedback delay to achieve elimination of synchronization in a large population of coupled and synchronized oscillators. We validate the feasibility of this scheme not only in the coupled Kuramoto’s oscillators with a unimodal or bimodal distribution of natural frequency, but also in two representative models of neuronal networks, namely, the FitzHugh-Nagumo spiking oscillators and the Hindmarsh-Rose bursting oscillators. More significantly, we analytically illustrate the feasibility of the proposed scheme with a feedback delay and reveal how the exact topological form of the bimodal natural frequency distribution influences the scheme performance. We anticipate that our developed scheme will deepen the understanding and refinement of those controllers, e.g. techniques of deep brain stimulation, which have been implemented in remedying some synchronization-induced mental disorders including Parkinson disease and epilepsy.
Phase synchronization in train connection timetables
Energy Technology Data Exchange (ETDEWEB)
Fretter, Christoph; Mueller-Hannemann, Matthias [Martin Luther Universitaet, Halle-Wittenberg (Germany); Krumov, Lachezar; Weihe, Karsten [TU Darmstadt (Germany); Huett, Marc-Thorsten [Jacobs University, Bremen (Germany)
2010-07-01
Train connection timetables are an important research topic in algorithmics. Finding optimal or near-optimal timetables under the subsidiary conditions of minimizing travel times and other criteria is an important contribution to the functioning of public transportation. In addition to efficiency (given, e.g. by minimal average travel times), the robustness of the timetable, i.e. a minimization of delay propagation, is an important criterion. Here we study the balance of efficiency and robustness in train connection timetables from the perspective of synchronization, exploiting the fact that a major part of the trains run nearly periodically. We find that synchronization is highest at intermediate-sized stations. We argue that this synchronization perspectives opens a new avenue towards an understanding of train connection timetables by representing them as spatiotemporal phase patterns. Robustness and efficiency can then be viewed as properties of this phase pattern.
Synchronous characterization of semiconductor microcavity laser beam.
Wang, T; Lippi, G L
2015-06-01
We report on a high-resolution double-channel imaging method used to synchronously map the intensity- and optical-frequency-distribution of a laser beam in the plane orthogonal to the propagation direction. The synchronous measurement allows us to show that the laser frequency is an inhomogeneous distribution below threshold, but that it becomes homogeneous across the fundamental Gaussian mode above threshold. The beam's tails deviations from the Gaussian shape, however, are accompanied by sizeable fluctuations in the laser wavelength, possibly deriving from manufacturing details and from the influence of spontaneous emission in the very low intensity wings. In addition to the synchronous spatial characterization, a temporal analysis at any given point in the beam cross section is carried out. Using this method, the beam homogeneity and spatial shape, energy density, energy center, and the defects-related spectrum can also be extracted from these high-resolution pictures.
Synthesizing Modular Invariants for Synchronous Code
Directory of Open Access Journals (Sweden)
Pierre-Loic Garoche
2014-12-01
Full Text Available In this paper, we explore different techniques to synthesize modular invariants for synchronous code encoded as Horn clauses. Modular invariants are a set of formulas that characterizes the validity of predicates. They are very useful for different aspects of analysis, synthesis, testing and program transformation. We describe two techniques to generate modular invariants for code written in the synchronous dataflow language Lustre. The first technique directly encodes the synchronous code in a modular fashion. While in the second technique, we synthesize modular invariants starting from a monolithic invariant. Both techniques, take advantage of analysis techniques based on property-directed reachability. We also describe a technique to minimize the synthesized invariants.
Trigger delay compensation of beam synchronous sampling
International Nuclear Information System (INIS)
Steimel, J.
1996-05-01
One of the problems of providing beam feedback in a large accelerator is the lack of beam synchronous trigger signals far from the RF signal source. IF single bucket resolutions are required, a cable extending from the RF source to the other side of the accelerator will not provide a synchronous signal if the RF frequency changes significantly with respect to the cable delay. This paper offers a solution to this problem by locking to the RF, at the remote location, using a digital phase locked loop. Then, the digitized frequency value is used to calculate the phase shift required to remain synchronized to the beam. Results are shown for phase lock to the Fermilab Main Ring RF. 1 ref., 4 figs
Suppression of synchronous resonance for VSGs
DEFF Research Database (Denmark)
Yang, Dongsheng; Wu, Heng; Wang, Xiongfei
2017-01-01
The virtual synchronous generator (VSG) is an attractive interfacing technique for high-penetration renewable generation. By incorporating the inertia control, the grid-connected voltage-source converter can behave in a similar way with the SGs, which is helpful to enhance the stability of the po......The virtual synchronous generator (VSG) is an attractive interfacing technique for high-penetration renewable generation. By incorporating the inertia control, the grid-connected voltage-source converter can behave in a similar way with the SGs, which is helpful to enhance the stability...... of the power system. However, it is reported that the synchronous frequency resonance (SFR) can be aroused in the VSG due to the resonance peaks in the power control loops at the fundamental frequency. By modelling the power control loop in the dq domain, the mechanism underlying the SFR is studied. It reveals...
Adaptive elimination of synchronization in coupled oscillator
International Nuclear Information System (INIS)
Zhou, Shijie; Lin, Wei; Ji, Peng; Feng, Jianfeng; Zhou, Qing; Kurths, Jürgen
2017-01-01
We present here an adaptive control scheme with a feedback delay to achieve elimination of synchronization in a large population of coupled and synchronized oscillators. We validate the feasibility of this scheme not only in the coupled Kuramoto’s oscillators with a unimodal or bimodal distribution of natural frequency, but also in two representative models of neuronal networks, namely, the FitzHugh–Nagumo spiking oscillators and the Hindmarsh–Rose bursting oscillators. More significantly, we analytically illustrate the feasibility of the proposed scheme with a feedback delay and reveal how the exact topological form of the bimodal natural frequency distribution influences the scheme performance. We anticipate that our developed scheme will deepen the understanding and refinement of those controllers, e.g. techniques of deep brain stimulation, which have been implemented in remedying some synchronization-induced mental disorders including Parkinson disease and epilepsy. (paper)
Pinning synchronization of a mobile agent network
International Nuclear Information System (INIS)
Wang, Lei; Sun, You-xian
2009-01-01
We investigate the problem of controlling a group of mobile agents in a plane in order to move them towards a desired orbit via pinning control, in which each agent is associated with a chaotic oscillator coupled with those of neighboring agents, and the pinning strategy is to have the common linear feedback acting on a small fraction of agents by random selection. We explore the effects of the pinning probability, feedback gains and agent density in the pinning synchronization of a mobile agent network under a fast-switching constraint, and perform numerical simulations for validation. In particular, we show that there exists a critical pinning density for network synchronization with an unbounded region: above the threshold, the dynamical network can be controlled by pinning; below it, anarchy prevails. And for the network with a single bounded synchronization region, pinning control has little effect as regards enhancing network synchronizability
HEP - A semaphore-synchronized multiprocessor with central control. [Heterogeneous Element Processor
Gilliland, M. C.; Smith, B. J.; Calvert, W.
1976-01-01
The paper describes the design concept of the Heterogeneous Element Processor (HEP), a system tailored to the special needs of scientific simulation. In order to achieve high-speed computation required by simulation, HEP features a hierarchy of processes executing in parallel on a number of processors, with synchronization being largely accomplished by hardware. A full-empty-reserve scheme of synchronization is realized by zero-one-valued hardware semaphores. A typical system has, besides the control computer and the scheduler, an algebraic module, a memory module, a first-in first-out (FIFO) module, an integrator module, and an I/O module. The architecture of the scheduler and the algebraic module is examined in detail.
Luo, Bingyang; Chi, Shangjie; Fang, Man; Li, Mengchao
2017-03-01
Permanent magnet synchronous motor is used widely in industry, the performance requirements wouldn't be met by adopting traditional PID control in some of the occasions with high requirements. In this paper, a hybrid control strategy - nonlinear neural network PID and traditional PID parallel control are adopted. The high stability and reliability of traditional PID was combined with the strong adaptive ability and robustness of neural network. The permanent magnet synchronous motor will get better control performance when switch different working modes according to different controlled object conditions. As the results showed, the speed response adopting the composite control strategy in this paper was faster than the single control strategy. And in the case of sudden disturbance, the recovery time adopting the composite control strategy designed in this paper was shorter, the recovery ability and the robustness were stronger.
Eberle, Henry; Nasuto, Slawomir J; Hayashi, Yoshikatsu
2018-03-01
We present a novel way of using a dynamical model for predictive tracking control that can adapt to a wide range of delays without parameter update. This is achieved by incorporating the paradigm of anticipating synchronization (AS), where a 'slave' system predicts a 'master' via delayed self-feedback. By treating the delayed output of the plant as one half of a 'sensory' AS coupling, the plant and an internal dynamical model can be synchronized such that the plant consistently leads the target's motion. We use two simulated robotic systems with differing arrangements of the plant and internal model ('parallel' and 'serial') to demonstrate that this form of control adapts to a wide range of delays without requiring the parameters of the controller to be changed.
Measures of Quantum Synchronization in Continuous Variable Systems
Mari, A.; Farace, A.; Didier, N.; Giovannetti, V.; Fazio, R.
2013-09-01
We introduce and characterize two different measures which quantify the level of synchronization of coupled continuous variable quantum systems. The two measures allow us to extend to the quantum domain the notions of complete and phase synchronization. The Heisenberg principle sets a universal bound to complete synchronization. The measure of phase synchronization is, in principle, unbounded; however, in the absence of quantum resources (e.g., squeezing) the synchronization level is bounded below a certain threshold. We elucidate some interesting connections between entanglement and synchronization and, finally, discuss an application based on quantum optomechanical systems.
Analysis of ECT Synchronization Performance Based on Different Interpolation Methods
Directory of Open Access Journals (Sweden)
Yang Zhixin
2014-01-01
Full Text Available There are two synchronization methods of electronic transformer in IEC60044-8 standard: impulsive synchronization and interpolation. When the impulsive synchronization method is inapplicability, the data synchronization of electronic transformer can be realized by using the interpolation method. The typical interpolation methods are piecewise linear interpolation, quadratic interpolation, cubic spline interpolation and so on. In this paper, the influences of piecewise linear interpolation, quadratic interpolation and cubic spline interpolation for the data synchronization of electronic transformer are computed, then the computational complexity, the synchronization precision, the reliability, the application range of different interpolation methods are analyzed and compared, which can serve as guide studies for practical applications.
On synchronized regions of discrete-time complex dynamical networks
International Nuclear Information System (INIS)
Duan Zhisheng; Chen Guanrong
2011-01-01
In this paper, the local synchronization of discrete-time complex networks is studied. First, it is shown that for any natural number n, there exists a discrete-time network which has at least left floor n/2 right floor +1 disconnected synchronized regions for local synchronization, which implies the possibility of intermittent synchronization behaviors. Different from the continuous-time networks, the existence of an unbounded synchronized region is impossible for discrete-time networks. The convexity of the synchronized regions is also characterized based on the stability of a class of matrix pencils, which is useful for enlarging the stability region so as to improve the network synchronizability.
Proxy-equation paradigm: A strategy for massively parallel asynchronous computations
Mittal, Ankita; Girimaji, Sharath
2017-09-01
Massively parallel simulations of transport equation systems call for a paradigm change in algorithm development to achieve efficient scalability. Traditional approaches require time synchronization of processing elements (PEs), which severely restricts scalability. Relaxing synchronization requirement introduces error and slows down convergence. In this paper, we propose and develop a novel "proxy equation" concept for a general transport equation that (i) tolerates asynchrony with minimal added error, (ii) preserves convergence order and thus, (iii) expected to scale efficiently on massively parallel machines. The central idea is to modify a priori the transport equation at the PE boundaries to offset asynchrony errors. Proof-of-concept computations are performed using a one-dimensional advection (convection) diffusion equation. The results demonstrate the promise and advantages of the present strategy.
Synchronous gastric neuroendocrine carcinoma and hepatocellular carcinoma
DEFF Research Database (Denmark)
Ewertsen, Caroline; Henriksen, Birthe Merete; Hansen, Carsten Palnæs
2009-01-01
of synchronous gastric NEC and hepatocellular carcinoma in a patient with several other precancerous lesions is presented. The patient had anaemia, and a gastric tumour and two duodenal polyps were identified on upper endoscopy. A CT scan of the abdomen revealed several lesions in the liver. The lesions were...... invisible on B-mode sonography and real-time sonography fused with CT was used to identify and biopsy one of the lesions. Histology showed hepatocellular carcinoma. A literature search showed that only one case of a hepatocellular carcinoma synchronous with a gastric NEC has been reported previously. TRIAL...
Characteristics of silent countingin synchronized swimmers
Directory of Open Access Journals (Sweden)
Sergey V. Leonov
2012-01-01
Full Text Available This article describes the temporal characteristics of silent counting as used duringa competition by the Russian youth team of synchronized swimmers. Theathletes listened to the music that accompanied their performance at the competition.Diff erent indices of silent counting were defi ned, such as the beginningand cessation of diff erent periods of counting, counting frequency, the stabilityof the temporal structure of silent counting, the degree of synchronization of silentcounting at diff erent moments during the sports program. We studied therelationship of these characteristics of counting with expert estimates of the athletes’sense of tempo, coordination of movements, and choreographic abilities.
Carrier and symbol synchronization system performance study
Lindsey, W. C.
1976-01-01
Results pertinent to predicting the performance of convolutionally encoded binary phase-shift keyed communication links were presented. The details of the development are provided in four sections. These sections are concerned with developing the bit error probability performance degradations due to PN despreading by a time-shared delay locked loop, the Costas demodulation process, symbol synchronization effects and cycle slipping phenomena in the Costas loop. In addition, Costas cycle slipping probabilities are studied as functions of Doppler count time and signal-to-noise conditions. The effect of cycle slipping in the symbol synchronizer is also studied as a function of channel Doppler and other frequency uncertainties.
GPS synchronized power system phase angle measurements
Wilson, Robert E.; Sterlina, Patrick S.
1994-09-01
This paper discusses the use of Global Positioning System (GPS) synchronized equipment for the measurement and analysis of key power system quantities. Two GPS synchronized phasor measurement units (PMU) were installed before testing. It was indicated that PMUs recorded the dynamic response of the power system phase angles when the northern California power grid was excited by the artificial short circuits. Power system planning engineers perform detailed computer generated simulations of the dynamic response of the power system to naturally occurring short circuits. The computer simulations use models of transmission lines, transformers, circuit breakers, and other high voltage components. This work will compare computer simulations of the same event with field measurement.
Modulated Field Synchronous Generator for Wind Turbines
Directory of Open Access Journals (Sweden)
Petru Chioncel
2013-01-01
Full Text Available This paper presents a modern electromechanical conversion systemsolution as the modulated field synchronous generator, offering on theone hand, an output voltage with constant frequency in terms of speedvariation of the wind turbine and on the other hand an advantagepower / weight ratio due to the high frequency for which the magneticcircuit of the electric machine is sized. The mathematical model of the modulated field synchronous generator is implemented in MatLABmodeling language, highlighting the command structure on thetransistors bases of the inverter transistors, through which thefunctioning of the electric machine can be studied, especially in terms of the frequency of the delivered voltage.
The transition to chaotic phase synchronization
DEFF Research Database (Denmark)
Mosekilde, E.; Laugesen, J. L.; Zhusubaliyev, Zh. T.
2012-01-01
The transition to chaotic phase synchronization for a periodically driven spiral-type chaotic oscillator is known to involve a dense set of saddle-node bifurcations. By following the synchronization transition through the cascade of period-doubling bifurcations in a forced Ro¨ssler system...... to the torus doubling bifurcations that take place outside this domain. By examining a physiology-based model of the blood flow regulation to the individual functional unit (nephron) of the kidney we demonstrate how a similar bifurcation structure may arise in this system as a response to a periodically...
Synchronous generator wind energy conversion control system
Energy Technology Data Exchange (ETDEWEB)
Medeiros, A.L.R. [Wind Energy Group, Recife (Brazil); Lima, A.M.N.; Jacobina, C.B.; Simoes, F.J. [DEE, Campina Grande (Brazil)
1996-12-31
This paper presents the performance evaluation and the design of the control system of a WECS (Wind Energy Conversion System) that employs a synchronous generator based on its digital simulation. The WECS discussed in this paper is connected to the utility grid through two Pulse Width Modulated (PWM) power converters. The structure of the proposed WECS enables us to achieve high performance energy conversion by: (i) maximizing the wind energy capture and (ii) minimizing the reactive power flowing between the grid and the synchronous generator. 8 refs., 19 figs.
Synchronous Control of Modular Multilevel Converters
DEFF Research Database (Denmark)
Oleschuk, Valentin; Blaabjerg, Frede; Bose, Bimal K.
2002-01-01
A novel method of direct synchronous pulsewidth modulation (PWM) is applied for control of modular multilevel converters consisting from three standard triphase inverter modules along with an 0.33 p.u. output transformer. The proposed method provides synchronisation of the voltage waveforms...... for each module and the composed voltage at the output of the converter. Multilevel output voltage of the converter has quarter-wave symmetry during the whole range including the zone of overmodulation. Both continuous and discontinuous versions of synchronous PWM, based on vector approach...
Parallel integer sorting with medium and fine-scale parallelism
Dagum, Leonardo
1993-01-01
Two new parallel integer sorting algorithms, queue-sort and barrel-sort, are presented and analyzed in detail. These algorithms do not have optimal parallel complexity, yet they show very good performance in practice. Queue-sort designed for fine-scale parallel architectures which allow the queueing of multiple messages to the same destination. Barrel-sort is designed for medium-scale parallel architectures with a high message passing overhead. The performance results from the implementation of queue-sort on a Connection Machine CM-2 and barrel-sort on a 128 processor iPSC/860 are given. The two implementations are found to be comparable in performance but not as good as a fully vectorized bucket sort on the Cray YMP.
Template based parallel checkpointing in a massively parallel computer system
Archer, Charles Jens [Rochester, MN; Inglett, Todd Alan [Rochester, MN
2009-01-13
A method and apparatus for a template based parallel checkpoint save for a massively parallel super computer system using a parallel variation of the rsync protocol, and network broadcast. In preferred embodiments, the checkpoint data for each node is compared to a template checkpoint file that resides in the storage and that was previously produced. Embodiments herein greatly decrease the amount of data that must be transmitted and stored for faster checkpointing and increased efficiency of the computer system. Embodiments are directed to a parallel computer system with nodes arranged in a cluster with a high speed interconnect that can perform broadcast communication. The checkpoint contains a set of actual small data blocks with their corresponding checksums from all nodes in the system. The data blocks may be compressed using conventional non-lossy data compression algorithms to further reduce the overall checkpoint size.
Co-simulation of dynamic systems in parallel and serial model configurations
International Nuclear Information System (INIS)
Sweafford, Trevor; Yoon, Hwan Sik
2013-01-01
Recent advancement in simulation software and computation hardware make it realizable to simulate complex dynamic systems comprised of multiple submodels developed in different modeling languages. The so-called co-simulation enables one to study various aspects of a complex dynamic system with heterogeneous submodels in a cost-effective manner. Among several different model configurations for co-simulation, synchronized parallel configuration is regarded to expedite the simulation process by simulation multiple sub models concurrently on a multi core processor. In this paper, computational accuracies as well as computation time are studied for three different co-simulation frameworks : integrated, serial, and parallel. for this purpose, analytical evaluations of the three different methods are made using the explicit Euler method and then they are applied to two-DOF mass-spring systems. The result show that while the parallel simulation configuration produces the same accurate results as the integrated configuration, results of the serial configuration, results of the serial configuration show a slight deviation. it is also shown that the computation time can be reduced by running simulation in the parallel configuration. Therefore, it can be concluded that the synchronized parallel simulation methodology is the best for both simulation accuracy and time efficiency.
Parallel education: what is it?
Amos, Michelle Peta
2017-01-01
In the history of education it has long been discussed that single-sex and coeducation are the two models of education present in schools. With the introduction of parallel schools over the last 15 years, there has been very little research into this 'new model'. Many people do not understand what it means for a school to be parallel or they confuse a parallel model with co-education, due to the presence of both boys and girls within the one institution. Therefore, the main obj...
Balanced, parallel operation of flashlamps
International Nuclear Information System (INIS)
Carder, B.M.; Merritt, B.T.
1979-01-01
A new energy store, the Compensated Pulsed Alternator (CPA), promises to be a cost effective substitute for capacitors to drive flashlamps that pump large Nd:glass lasers. Because the CPA is large and discrete, it will be necessary that it drive many parallel flashlamp circuits, presenting a problem in equal current distribution. Current division to +- 20% between parallel flashlamps has been achieved, but this is marginal for laser pumping. A method is presented here that provides equal current sharing to about 1%, and it includes fused protection against short circuit faults. The method was tested with eight parallel circuits, including both open-circuit and short-circuit fault tests
A highly scalable massively parallel fast marching method for the Eikonal equation
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.
Injuries and medical issues in synchronized Olympic sports.
Mountjoy, Margo
2009-01-01
Spectators of the Olympic Games can enjoy a wide variety of sports, including strength, team, timed, endurance, and artistic sports. In the Olympic program, there are two synchronized events: synchronized diving and synchronized swimming. The precision of the synchronization of the athlete's movements and skills is an added feature of entertainment. Synchronized athletes have additional training requirements to perfect the synchronization of their skills. The physical demands on the athlete from the repetition of training required for the perfection of synchronization result in injuries unique to these sports. Although both traumatic and overuse injuries occur, overuse injuries are more common. As these disciplines are artistic, judged sports, these athletes also are susceptible to eating disorders and the female athlete triad. This article reviews the training regimen of these athletes and outlines the injuries and health concerns that are common in the synchronized sports.
Hybrid synchronization of two independent chaotic systems on ...
Indian Academy of Sciences (India)
Keywords. Hybrid synchronization; complex network; information source; chaotic system. ... encryption and decryption through synchronization. However, the ... Certainly, if the two systems are different, the security would be improved. How.
Making sense of media synchronicity in humanitarian crises
Muhren, W.J.; van den Eede, G.G.P.; van de Walle, B.A.
2009-01-01
This paper reintroduces concepts from sensemaking in media synchronicity theory (MST). It focuses on how media should support synchronicity to fit communication needs when making sense of a humanitarian crisis situation. Findings from interviews with senior management of humanitarian aid
The effects of three methods of synchronization on estrus induction ...
African Journals Online (AJOL)
The effects of three methods of synchronization on estrus induction and ... Due to the importances of estrus synchronization in sheep reproduction and fertility, the ... sponges (medroxyprogesterone) and controlled intravaginal drug-releasing ...
RBF neural network based H∞ synchronization for unknown chaotic ...
Indian Academy of Sciences (India)
, 172 ... the effect of disturbance to an H∞ norm constraint. It is shown that ... unknown chaotic systems; linear matrix inequality (LMI); learning law. 1. Introduction .... (9) is RBFNN H∞ synchronized if the synchronization error e(t) satisfies. ∫ ∞.
Analysis of synchronization in a supermarket refrigeration system
DEFF Research Database (Denmark)
Wisniewski, Rafal; Leth, John-Josef; Rasmussen, Jakob Gulddahl
2014-01-01
increases both the energy consumption and the wear of components. Besides this practical importance, from the theoretical point of view, synchronization, likewise stability, Zeno phenomenon, and chaos, is an interesting dynamical phenomenon. The study of synchronization in the supermarket refrigeration...
Robust adaptive synchronization of general dynamical networks ...
Indian Academy of Sciences (India)
Home; Journals; Pramana – Journal of Physics; Volume 86; Issue 6. Robust ... A robust adaptive synchronization scheme for these general complex networks with multiple delays and uncertainties is established and raised by employing the robust adaptive control principle and the Lyapunov stability theory. We choose ...
Hypothesis test for synchronization: twin surrogates revisited.
Romano, M Carmen; Thiel, Marco; Kurths, Jürgen; Mergenthaler, Konstantin; Engbert, Ralf
2009-03-01
The method of twin surrogates has been introduced to test for phase synchronization of complex systems in the case of passive experiments. In this paper we derive new analytical expressions for the number of twins depending on the size of the neighborhood, as well as on the length of the trajectory. This allows us to determine the optimal parameters for the generation of twin surrogates. Furthermore, we determine the quality of the twin surrogates with respect to several linear and nonlinear statistics depending on the parameters of the method. In the second part of the paper we perform a hypothesis test for phase synchronization in the case of experimental data from fixational eye movements. These miniature eye movements have been shown to play a central role in neural information processing underlying the perception of static visual scenes. The high number of data sets (21 subjects and 30 trials per person) allows us to compare the generated twin surrogates with the "natural" surrogates that correspond to the different trials. We show that the generated twin surrogates reproduce very well all linear and nonlinear characteristics of the underlying experimental system. The synchronization analysis of fixational eye movements by means of twin surrogates reveals that the synchronization between the left and right eye is significant, indicating that either the centers in the brain stem generating fixational eye movements are closely linked, or, alternatively that there is only one center controlling both eyes.
Effects of synchronous coaching in teacher training
Hooreman, Ralph W.; Kommers, Petrus A.M.; Jochems, Wim M.G.
2008-01-01
Historically, the nature of coaching the teachers is asynchronously: a reflective discussion with the supervisory coach is the follow-up after a lesson has been taught. We expect that synchronous (immediate) coaching may complement and to a certain extent supplant the asynchronous feedback.
Distance learning through synchronous interactive television.
Hall, Janis L
2007-01-01
The advent and popularity of asynchronous online learning has somewhat obscured a standby technology developed over the last two decades. Interactive videoconferencing, sometimes called "interactive television," though not as glamorous and popular a topic at distance-learning conferences, is still alive and well at many institutions. Three or four years ago, many of us were led to believe that interactive television would go the way of the dinosaurs-everything would soon be in an asynchronous format or on individual desktops. There would no longer be any need for elaborately designed classrooms, networks, and operations staff. To date, this prediction has not come true. In fact, synchronous interactive television has experienced significant growth as newer, easier, and cheaper technologies allow institutions to reach more students with less resource investment. Faculty and students, while appreciating the convenience of asynchronous delivery, still express a need for synchronous communication. This article explores the issues involved in synchronous distance education, the current technologies and proposed future developments, and best practices in terms of classroom design, faculty use, and operational issues. It is not a research article but an anecdotal case study based on Washington State University's experiences over the last 20 years in developing and adapting to new synchronous technologies and creating the support and technical infrastructure to best deliver academic courses through this medium.
Relaxation of synchronization on complex networks.
Son, Seung-Woo; Jeong, Hawoong; Hong, Hyunsuk
2008-07-01
We study collective synchronization in a large number of coupled oscillators on various complex networks. In particular, we focus on the relaxation dynamics of the synchronization, which is important from the viewpoint of information transfer or the dynamics of system recovery from a perturbation. We measure the relaxation time tau that is required to establish global synchronization by varying the structural properties of the networks. It is found that the relaxation time in a strong-coupling regime (K>Kc) logarithmically increases with network size N , which is attributed to the initial random phase fluctuation given by O(N-1/2) . After elimination of the initial-phase fluctuation, the relaxation time is found to be independent of the system size; this implies that the local interaction that depends on the structural connectivity is irrelevant in the relaxation dynamics of the synchronization in the strong-coupling regime. The relaxation dynamics is analytically derived in a form independent of the system size, and it exhibits good consistency with numerical simulations. As an application, we also explore the recovery dynamics of the oscillators when perturbations enter the system.
Synchronizing data from irregularly sampled sensors
Uluyol, Onder
2017-07-11
A system and method include receiving a set of sampled measurements for each of multiple sensors, wherein the sampled measurements are at irregular intervals or different rates, re-sampling the sampled measurements of each of the multiple sensors at a higher rate than one of the sensor's set of sampled measurements, and synchronizing the sampled measurements of each of the multiple sensors.
Blended synchronous learning environment: Student perspectives
Directory of Open Access Journals (Sweden)
Conklina Sheri
2017-06-01
Full Text Available Distance education environments can take many forms, from asynchronous to blended synchronous environments. Blended synchronous learning environment (BSLE can be defined as an innovative setting in which students can decide to attend classes either face-to-face or via a synchronous virtual connection. Many educators are unfamiliar teaching in BSLE because of lack of experience or exposure to this delivery method. Thus, it is important to understand the optimal organisational structures and the effective management of BSLE courses to facilitate student learning and interaction. Seeking to understand this teaching method, an exploratory mixed-method study was conducted to examine graduate students’ perceptions of the BSLE. Quantitative and qualitative data was collected from a questionnaire and analysed. The findings revealed that students were satisfied with the BSLE, interactions, and the instructor. However, findings showed that the instructor divided attention between face-to-face and online synchronous students, which can cause cognitive overload and compromise the quality of instruction. Additionally, this study suggests that technical difficulties can affect students’ satisfaction with BSLE courses. Implications for further research and limitations are discussed.
Long distance synchronization of mobile robots
Alvarez Aguirre, A.; Nijmeijer, H.; Oguchi, T.
2010-01-01
This paper considers the long distance master-slave and mutual synchronization of unicycle-type mobile robots. The issues that arise when the elements of a robotic network are placed in different locations are addressed, specifically the time-delay induced by the communication channel linking the
Synchronization of chaos by nonlinear feedback
International Nuclear Information System (INIS)
Cheng Yanxiang
1995-01-01
The authors point out that synchronization of chaos may also be achieved by a nonlinear feedback without decomposing the original system. They apply the idea to the Lorentz system, and discuss several forms of nonlinear feedbacks by Lyapunov function and numerical method
Online Moderation of Synchronous E-Argumentation
Asterhan, Christa S. C.; Schwarz, Baruch B.
2010-01-01
In this paper, we present findings on moderation of synchronous, small-group argumentation in blended, co-located learning environments. Drawing on findings from the literature on human facilitation of dialogue in face-to-face settings, we first elaborate on the potential promise of this new practice. However, little is known about what…
Clock Synchronization for Multihop Wireless Sensor Networks
Solis Robles, Roberto
2009-01-01
In wireless sensor networks, more so generally than in other types of distributed systems, clock synchronization is crucial since by having this service available, several applications such as media access protocols, object tracking, or data fusion, would improve their performance. In this dissertation, we propose a set of algorithms to achieve…
An Online Synchronous Test for Professional Interpreters
Chen, Nian-Shing; Ko, Leong
2010-01-01
This article is based on an experiment designed to conduct an interpreting test for multiple candidates online, using web-based synchronous cyber classrooms. The test model was based on the accreditation test for Professional Interpreters produced by the National Accreditation Authority of Translators and Interpreters (NAATI) in Australia.…
Control of a superconducting synchronous motor
Energy Technology Data Exchange (ETDEWEB)
Jiang, Y; Pei, R; Jiang, Q; Hong, Z; Coombs, T A [Engineering Department, Cambridge University, Trumpington Street, Cambridge CB2 1PZ (United Kingdom)
2007-04-15
This paper presents a control algorithm for starting up a high temperature superconducting synchronous motor. The mathematical model of the motor has been established in m-file in Matlab and the parameters have been identified by means of the finite-element analysis method. Different starting methods for the motor have been compared and discussed, and eventually a hybrid control algorithm is proposed.
Is synchronous computermediated communication a viable ...
African Journals Online (AJOL)
Employing a conversationanalytic perspective, the logs were analysed to determine whether the interaction reflected in them replicated that characteristic of face-to-face classroom interaction. Once the discourse study had been completed, the logs were used to determine learners' perceptions of synchronous learning.
Synchronic tutoring of a virtual community
Simons, P.R.J.; Ligorio, M.B.; Talamo, A.
2002-01-01
The role of tutors has changed over time, depending on models of learning and on the technology available. This article discusses the evolution of the tutor role and presents a new model concerning the tutoring functions in a synchronous virtual community. The definition of a virtual community
Permanent synchronization of camcorders via LANC protocol
Vrancic, Damir; Smith, Steven L.
2006-02-01
A device, which keeps two camcorders permanently in synchronization, has been developed. The mentioned device uses LANC (CONTROL-L) camcorder's inputs for synchronization. It enables controlling of two camcorders simultaneously via built-in buttons, by using external LANC remote controller and/or by the PC via serial (RS232) communication. Since device requires LANC inputs on camcorders or ACC inputs on still cameras, it can be used on some camcorders produced by manufacturers Sony and Canon or some still cameras produced by Sony. The device initially synchronizes camcorders or still cameras by applying arbitrarily delayed power-up pulses on LANC (ACC) inputs. Then, on user demand, the camcorders can be permanently synchronized (valid only for some camcorders produced by Sony). The effectiveness of the proposed device is demonstrated by several experiments on three types of camcorders (DCR-TRV900E, HDR-HC1, HVR-Z1U) and one type of still camera (DSC-V1). The electronic schemes, PCB layouts, firmware and communication programs are freely available (under GPL licence).
Asynchronous versus Synchronous Learning in Pharmacy Education
Motycka, Carol A.; St. Onge, Erin L.; Williams, Jennifer
2013-01-01
Objective: To better understand the technology being used today in pharmacy education through a review of the current methodologies being employed at various institutions. Also, to discuss the benefits and difficulties of asynchronous and synchronous methodologies, which are being utilized at both traditional and distance education campuses.…
Symbol synchronization in convolutionally coded systems
Baumert, L. D.; Mceliece, R. J.; Van Tilborg, H. C. A.
1979-01-01
Alternate symbol inversion is sometimes applied to the output of convolutional encoders to guarantee sufficient richness of symbol transition for the receiver symbol synchronizer. A bound is given for the length of the transition-free symbol stream in such systems, and those convolutional codes are characterized in which arbitrarily long transition free runs occur.
Traveling-wave synchronous coil gun
International Nuclear Information System (INIS)
Elliott, D.G.
1991-01-01
This paper reports on a traveling-wave synchronous coil gun which permits independent adjustment of the magnetic field and armature current for high velocity at low armature mass fraction. Magnetic field energy is transferred from the rear of the wave to the front without passing through the power supply. Elaborate switching is required
Efficient Distribution of Triggered Synchronous Block Diagrams
2011-10-21
latest input data it reads fromW ∗. IfR ∗ receives a message fromW ∗ whose fresh-bit is false, meaning that R∗ has already read the latest output data...assumptions on clock synchronization. This has the advantage of providing implementations that are robust to various types of timing uncertainties such as
Supplementary material for: The adaptive synchronization of ...
Indian Academy of Sciences (India)
Supplementary material for: The adaptive synchronization of fractional-order Liu chaotic system with unknown parameters. ADELEH NOURIAN and SAEED BALOCHIAN. -50. -40. -30. -20. -10. 0. 10. 20. 30. 40. -25. -20. -15. -10. -5. 0. 5. 10. 15. 20. 25. Y. Z. -12. -10. -8. -6. -4. -2. 0. 2. 4. 6. 8. -25. -20. -15. -10. -5. 0. 5. 10. 15.
Synchronous Computer-Mediated Communication and Interaction
Ziegler, Nicole
2016-01-01
The current study reports on a meta-analysis of the relative effectiveness of interaction in synchronous computer-mediated communication (SCMC) and face-to-face (FTF) contexts. The primary studies included in the analysis were journal articles and dissertations completed between 1990 and 2012 (k = 14). Results demonstrate that interaction in SCMC…
Synchronization of Time-Continuous Chaotic Oscillators
DEFF Research Database (Denmark)
Yanchuk, S.; Maistrenko, Yuri; Mosekilde, Erik
2003-01-01
Considering a system of two coupled identical chaotic oscillators, the paper first establishes the conditions of transverse stability for the fully synchronized chaotic state. Periodic orbit threshold theory is applied to determine the bifurcations through which low-periodic orbits embedded...
Synchronicity and the meaning-making psyche.
Colman, Warren
2011-09-01
This paper contrasts Jung's account of synchronicity as evidence of an objective principle of meaning in Nature with a view that emphasizes human meaning-making. All synchronicities generate indicative signs but only where this becomes a 'living symbol' of a transcendent intentionality at work in a living universe does synchronicity generate the kind of symbolic meaning that led Jung to posit the existence of a Universal Mind. This is regarded as a form of personal, experiential knowledge belonging to the 'imaginal world of meaning' characteristic of the 'primordial mind', as opposed to the 'rational world of knowledge' in which Jung attempted to present his experiences as if they were empirically and publicly verifiable. Whereas rational knowledge depends on a form of meaning in which causal chains and logical links are paramount, imaginal meaning is generated by forms of congruent correspondence-a feature that synchronicity shares with metaphor and symbol-and the creation of narratives by means of retroactive organization of its constituent elements. © 2011, The Society of Analytical Psychology.
Multiswitching combination–combination synchronization of chaotic ...
Indian Academy of Sciences (India)
2017-02-09
Feb 9, 2017 ... restricted to single drive–response system model. It is therefore interesting to ask whether these studies ... this scheme, a universal controller is designed to realize synchronization between a combination of two ... literature [33]. In view of the above discussions, in this paper, we present a new multiswitching ...
On the structure of phase synchronized chaos
DEFF Research Database (Denmark)
Mosekilde, Erik; Zhusubaliyev, Zhanybai T.; Laugesen, Jakob L.
2013-01-01
It is well-known that the transition to chaotic phase synchronization for a periodically driven chaotic oscillator of spiral type involves a dense set of saddle-node bifurcations. However, the way of formation and precise organization of these saddle node bifurcation curves have only recently bee...
Comment on two papers of chaotic synchronization
International Nuclear Information System (INIS)
Li Lixiang; Peng Haipeng; Wang Xiangdong; Yang Yixian
2004-01-01
This Letter comments on two papers of chaotic synchronization, namely [Phys. Rev. Lett. 76 (1996) 1232] and [Phys. Lett. A 321 (2004) 50]. We find that some statements in the two papers are incorrect by numerical simulations. The consequence of the incorrectness is analyzed as well
Adaptive projective synchronization between different chaotic ...
Indian Academy of Sciences (India)
Numerical simulation results are performed to explain the effectiveness and feasibility of ... analysis of nonlinear dynamics have gained immense popularity during the last few ... applications of projective synchronization is in secure communication [31] due to ... of uncertain chaotic systems using adaptive control method.
Synchronization Phenomena in Nephron-Nephron Interaction
DEFF Research Database (Denmark)
Holstein-Rathlou, N.-H.; Yip, K.-P.; Sosnovtseva, Olga
2001-01-01
Experimental data for tubular pressure oscillations in rat kidneys are analyzed in order to examine the different types of synchronization that can arise between neighboring functional units. For rats with normal blood pressure, the individual unit (the nephron) typically exhibits regular oscilla...
Global chaos synchronization of coupled parametrically excited ...
Indian Academy of Sciences (India)
In order to ascertain the error dynamics, we define the synchronization error as ... The following theorem is related to the general control matrix: C = ( c11 c12 .... ates as a means of accounting for the initial transients, we display in figure 5 the.
Design of multistable systems via partial synchronization
Indian Academy of Sciences (India)
Mohammad Ali Khan
2017-07-05
Jul 5, 2017 ... The basic idea of the scheme is to design partial synchronization of states between the coupled systems and ... Numerical simulation results consisting of ... systems of the same order via active control is discussed. In §3, the ...
Synchronization analysis of coloured delayed networks under ...
Indian Academy of Sciences (India)
This paper investigates synchronization of coloured delayed networks under decentralized pinning intermittent control. To begin with, the time delays are taken into account in the coloured networks. In addition, we propose a decentralized pinning intermittent control for coloured delayed networks, which is different from that ...
from synchronic variation to a grammaticalization path
African Journals Online (AJOL)
Kate H
Abstract. The authors argue that the synchronic variation of cognate objects of weather verbs exhibited in six African languages of South Africa (Sepedi, Sesotho, Tshivenda, isiXhosa, Xitsonga, and. isiZulu) has a diachronic explanation, and may be represented as a grammaticalization path. This path gradually leads from ...
Compatibility of Motion Facilitates Visuomotor Synchronization
Hove, Michael J.; Spivey, Michael J.; Krumhansl, Carol L.
2010-01-01
Prior research indicates that synchronized tapping performance is very poor with flashing visual stimuli compared with auditory stimuli. Three finger-tapping experiments compared flashing visual metronomes with visual metronomes containing a spatial component, either compatible, incompatible, or orthogonal to the tapping action. In Experiment 1,…
Electrotonic vascular signal conduction and nephron synchronization
DEFF Research Database (Denmark)
Marsh, D.J.; Toma, I.; Sosnovtseva, Olga
2009-01-01
Marsh DJ, Toma I, Sosnovtseva OV, Peti-Peterdi J, Holstein-Rathlou NH. Electrotonic vascular signal conduction and nephron synchronization. Am J Physiol Renal Physiol 296: F751-F761, 2009. First published December 30, 2008; doi:10.1152/ajprenal.90669.2008.-Tubuloglomerular feedback (TGF) and the ......Marsh DJ, Toma I, Sosnovtseva OV, Peti-Peterdi J, Holstein-Rathlou NH. Electrotonic vascular signal conduction and nephron synchronization. Am J Physiol Renal Physiol 296: F751-F761, 2009. First published December 30, 2008; doi:10.1152/ajprenal.90669.2008.-Tubuloglomerular feedback (TGF......) and the myogenic mechanism control afferent arteriolar diameter in each nephron and regulate blood flow. Both mechanisms generate self-sustained oscillations, the oscillations interact, TGF modulates the frequency and amplitude of the myogenic oscillation, and the oscillations synchronize; a 5: 1 frequency ratio...... is the most frequent. TGF oscillations synchronize in nephron pairs supplied from a common cortical radial artery, as do myogenic oscillations. We propose that electrotonic vascular signal propagation from one juxtaglomerular apparatus interacts with similar signals from other nephrons to produce...
Community Pharmacist Attitudes on Medication Synchronization Programs
Directory of Open Access Journals (Sweden)
Matthew Witry
2017-05-01
Full Text Available Background: Medication synchronization is a service offered by an increasing number of community pharmacies that aligns refilling of a patient’s multiple medications. Purported benefits include increased adherence and improved dispensing efficiency. Objective: To assess community pharmacist agreement with a set of declarative statements about medication synchronization programs and to identify variation related to pharmacist characteristics. Methods: In 2015, a cross-sectional survey was mailed to 1,000 pharmacists from 5 Midwestern U.S. states using 4-contacts and an online option. Respondents used a 7-point Likert scale to agree or disagree with 5 statements about medication synchronization. Demographic and workplace characteristics were collected. Data were analyzed using descriptive statistics and factor analysis. Multiple linear regression tested the relationship between pharmacist characteristics and a 4-item attitude composite. Results: There were 258 usable responses for a response rate of 28.8%. About half (45.0% reported their pharmacy offered medication synchronization. Most pharmacists (82.6% agreed this service has a positive impact on patient adherence but 57% agreed that a “significant change to workflow” was or would be required. Pharmacist agreement that the program provides financial benefits to the pharmacy was higher than agreement that the service provides more opportunities for patient interactions (p<0.001. In the multiple regression analysis, having a PharmD and working at a pharmacy offering Medication Therapy Management were associated with more positive scores on the medication synchronization benefits composite whereas working in a staff role (rather than a manager/owner was lower. No demographic predictors were significantly associated with agreeing that a significant change to workflow would be required for implementation. Conclusions: Pharmacists generally were positive about medication synchronization
Directory of Open Access Journals (Sweden)
Chen Chuang-Wei
2012-12-01
Full Text Available Abstract Intussusception is uncommon in adults. To our knowledge, synchronous colocolic intussusceptions have never been reported in the literature. Here we described the case of a 59-year-old female of synchronous colocolic intussusceptions presenting as acute abdomen that was diagnosed by CT preoperatively. Laparotomy with radical right hemicolectomy and sigmoidectomy was undertaken without reduction of the invagination due to a significant risk of associated malignancy. The final diagnosis was synchronous adenocarcinoma of proximal transverse colon and sigmoid colon without lymph nodes or distant metastasis. The patient had an uneventful recovery. The case also emphasizes the importance of thorough exploration during surgery for bowel invagination since synchronous events may occur.
Generalized synchronization in discrete maps. New point of view on weak and strong synchronization
International Nuclear Information System (INIS)
Koronovskii, Alexey A.; Moskalenko, Olga I.; Shurygina, Svetlana A.; Hramov, Alexander E.
2013-01-01
In the present Letter we show that the concept of the generalized synchronization regime in discrete maps needs refining in the same way as it has been done for the flow systems Koronovskii et al. [Koronovskii AA, Moskalenko OI, Hramov AE. Nearest neighbors, phase tubes, and generalized synchronization. Phys Rev E 2011;84:037201]. We have shown that, in the general case, when the relationship between state vectors of the interacting chaotic maps are considered, the prehistory must be taken into account. We extend the phase tube approach to the systems with a discrete time coupled both unidirectionally and mutually and analyze the essence of the generalized synchronization by means of this technique. Obtained results show that the division of the generalized synchronization into the weak and the strong ones also must be reconsidered. Unidirectionally coupled logistic maps and Hénon maps coupled mutually are used as sample systems.
Workspace Analysis for Parallel Robot
Directory of Open Access Journals (Sweden)
Ying Sun
2013-05-01
Full Text Available As a completely new-type of robot, the parallel robot possesses a lot of advantages that the serial robot does not, such as high rigidity, great load-carrying capacity, small error, high precision, small self-weight/load ratio, good dynamic behavior and easy control, hence its range is extended in using domain. In order to find workspace of parallel mechanism, the numerical boundary-searching algorithm based on the reverse solution of kinematics and limitation of link length has been introduced. This paper analyses position workspace, orientation workspace of parallel robot of the six degrees of freedom. The result shows: It is a main means to increase and decrease its workspace to change the length of branch of parallel mechanism; The radius of the movement platform has no effect on the size of workspace, but will change position of workspace.
"Feeling" Series and Parallel Resistances.
Morse, Robert A.
1993-01-01
Equipped with drinking straws and stirring straws, a teacher can help students understand how resistances in electric circuits combine in series and in parallel. Follow-up suggestions are provided. (ZWH)
Parallel encoders for pixel detectors
International Nuclear Information System (INIS)
Nikityuk, N.M.
1991-01-01
A new method of fast encoding and determining the multiplicity and coordinates of fired pixels is described. A specific example construction of parallel encodes and MCC for n=49 and t=2 is given. 16 refs.; 6 figs.; 2 tabs
Massively Parallel Finite Element Programming
Heister, Timo
2010-01-01
Today\\'s large finite element simulations require parallel algorithms to scale on clusters with thousands or tens of thousands of processor cores. We present data structures and algorithms to take advantage of the power of high performance computers in generic finite element codes. Existing generic finite element libraries often restrict the parallelization to parallel linear algebra routines. This is a limiting factor when solving on more than a few hundreds of cores. We describe routines for distributed storage of all major components coupled with efficient, scalable algorithms. We give an overview of our effort to enable the modern and generic finite element library deal.II to take advantage of the power of large clusters. In particular, we describe the construction of a distributed mesh and develop algorithms to fully parallelize the finite element calculation. Numerical results demonstrate good scalability. © 2010 Springer-Verlag.
Event monitoring of parallel computations
Directory of Open Access Journals (Sweden)
Gruzlikov Alexander M.
2015-06-01
Full Text Available The paper considers the monitoring of parallel computations for detection of abnormal events. It is assumed that computations are organized according to an event model, and monitoring is based on specific test sequences
Massively Parallel Finite Element Programming
Heister, Timo; Kronbichler, Martin; Bangerth, Wolfgang
2010-01-01
Today's large finite element simulations require parallel algorithms to scale on clusters with thousands or tens of thousands of processor cores. We present data structures and algorithms to take advantage of the power of high performance computers in generic finite element codes. Existing generic finite element libraries often restrict the parallelization to parallel linear algebra routines. This is a limiting factor when solving on more than a few hundreds of cores. We describe routines for distributed storage of all major components coupled with efficient, scalable algorithms. We give an overview of our effort to enable the modern and generic finite element library deal.II to take advantage of the power of large clusters. In particular, we describe the construction of a distributed mesh and develop algorithms to fully parallelize the finite element calculation. Numerical results demonstrate good scalability. © 2010 Springer-Verlag.
Research on synchronization technology of frequency hopping communication system
Zhao, Xiangwu; Quan, Houde; Cui, Peizhang
2018-05-01
Frequency Hopping (FH) communication is a technology of spread spectrum communication. It has strong anti-interference, anti-interception and security capabilities, and has been widely applied in the field of communications. Synchronization technology is one of the most crucial technologies in frequency hopping communication. The speed of synchronization establishment and the reliability of synchronous system directly affect the performance of frequency hopping communication system. Therefore, the research of synchronization technology in frequency hopping communication has important value.
Stroboscope Based Synchronization of Full Frame CCD Sensors
Shen, Liang; Feng, Xiaobing; Zhang, Yuan; Shi, Min; Zhu, Dengming; Wang, Zhaoqi
2017-01-01
The key obstacle to the use of consumer cameras in computer vision and computer graphics applications is the lack of synchronization hardware. We present a stroboscope based synchronization approach for the charge-coupled device (CCD) consumer cameras. The synchronization is realized by first aligning the frames from different video sequences based on the smear dots of the stroboscope, and then matching the sequences using a hidden Markov model. Compared with current synchronized capture equi...
Methodology for GPS Synchronization Evaluation with High Accuracy
Li Zan; Braun Torsten; Dimitrova Desislava
2015-01-01
Clock synchronization in the order of nanoseconds is one of the critical factors for time based localization. Currently used time synchronization methods are developed for the more relaxed needs of network operation. Their usability for positioning should be carefully evaluated. In this paper we are particularly interested in GPS based time synchronization. To judge its usability for localization we need a method that can evaluate the achieved time synchronization with nanosecond accuracy. Ou...
Methodology for GPS Synchronization Evaluation with High Accuracy
Li, Zan; Braun, Torsten; Dimitrova, Desislava Cvetanova
2015-01-01
Clock synchronization in the order of nanoseconds is one of the critical factors for time-based localization. Currently used time synchronization methods are developed for the more relaxed needs of network operation. Their usability for positioning should be carefully evaluated. In this paper, we are particularly interested in GPS-based time synchronization. To judge its usability for localization we need a method that can evaluate the achieved time synchronization with nanosecond accuracy. O...
On analytical justification of phase synchronization in different chaotic systems
International Nuclear Information System (INIS)
Erjaee, G.H.
2009-01-01
In analytical or numerical synchronizations studies of coupled chaotic systems the phase synchronizations have less considered in the leading literatures. This article is an attempt to find a sufficient analytical condition for stability of phase synchronization in some coupled chaotic systems. The method of nonlinear feedback function and the scheme of matrix measure have been used to justify this analytical stability, and tested numerically for the existence of the phase synchronization in some coupled chaotic systems.
Impulsive generalized function synchronization of complex dynamical networks
International Nuclear Information System (INIS)
Zhang, Qunjiao; Chen, Juan; Wan, Li
2013-01-01
This Letter investigates generalized function synchronization of continuous and discrete complex networks by impulsive control. By constructing the reasonable corresponding impulsively controlled response networks, some criteria and corollaries are derived for the generalized function synchronization between the impulsively controlled complex networks, continuous and discrete networks are both included. Furthermore, the generalized linear synchronization and nonlinear synchronization are respectively illustrated by several examples. All the numerical simulations demonstrate the correctness of the theoretical results
Synchronization of Rikitake chaotic attractor using active control
International Nuclear Information System (INIS)
Vincent, U.E.
2005-01-01
Using synchronization technique based on control theory, we design an active controller which enables the synchronization of two identical Rikitake two-disc dynamo systems. Numerical simulations are used to show the robustness of the active control scheme in synchronizing coupled Rikitake dynamical systems. On the sequential application of the active control, transitions from temporary phase locking (TPL) state to complete synchronization state were found
Chaos synchronization of a unified chaotic system via partial linearization
International Nuclear Information System (INIS)
Yu Yongguang; Li Hanxiong; Duan Jian
2009-01-01
A partial linearization method is proposed for realizing the chaos synchronization of an unified chaotic system. Through synchronizing partial state of the chaotic systems can result in the synchronization of their entire states, and the resulting controller is singularity free. The results can be easily extended to the synchronization of other similar chaotic systems. Simulation results are conducted to show the effectiveness of the method.
Synchronization of two chaotic systems: Dynamic compensator approach
International Nuclear Information System (INIS)
Chen, C.-K.; Lai, T.-W.; Yan, J.-J.; Liao, T.-L.
2009-01-01
This study is concerned with the identical synchronization problem for a class of chaotic systems. A dynamic compensator is proposed to achieve the synchronization between master and slave chaotic systems using only the accessible output variables. A sufficient condition is also proposed to ensure the global synchronization. Furthermore, the strictly positive real (SPR) restriction, which is normally required in most of the observer-based synchronization schemes, is released in our approach. Two numerical examples are included to illustrate the proposed scheme.
An approach of parameter estimation for non-synchronous systems
International Nuclear Information System (INIS)
Xu Daolin; Lu Fangfang
2005-01-01
Synchronization-based parameter estimation is simple and effective but only available to synchronous systems. To come over this limitation, we propose a technique that the parameters of an unknown physical process (possibly a non-synchronous system) can be identified from a time series via a minimization procedure based on a synchronization control. The feasibility of this approach is illustrated in several chaotic systems
Static inverter with synchronous output waveform synthesized by time-optimal-response feedback
Kernick, A.; Stechschulte, D. L.; Shireman, D. W.
1976-01-01
Time-optimal-response 'bang-bang' or 'bang-hang' technique, using four feedback control loops, synthesizes static-inverter sinusoidal output waveform by self-oscillatory but yet synchronous pulse-frequency-modulation (SPFM). A single modular power stage per phase of ac output entails the minimum of circuit complexity while providing by feedback synthesis individual phase voltage regulation, phase position control and inherent compensation simultaneously for line and load disturbances. Clipped sinewave performance is described under off-limit load or input voltage conditions. Also, approaches to high power levels, 3-phase arraying and parallel modular connection are given.
Writing parallel programs that work
CERN. Geneva
2012-01-01
Serial algorithms typically run inefficiently on parallel machines. This may sound like an obvious statement, but it is the root cause of why parallel programming is considered to be difficult. The current state of the computer industry is still that almost all programs in existence are serial. This talk will describe the techniques used in the Intel Parallel Studio to provide a developer with the tools necessary to understand the behaviors and limitations of the existing serial programs. Once the limitations are known the developer can refactor the algorithms and reanalyze the resulting programs with the tools in the Intel Parallel Studio to create parallel programs that work. About the speaker Paul Petersen is a Sr. Principal Engineer in the Software and Solutions Group (SSG) at Intel. He received a Ph.D. degree in Computer Science from the University of Illinois in 1993. After UIUC, he was employed at Kuck and Associates, Inc. (KAI) working on auto-parallelizing compiler (KAP), and was involved in th...
Exploiting Symmetry on Parallel Architectures.
Stiller, Lewis Benjamin
1995-01-01
This thesis describes techniques for the design of parallel programs that solve well-structured problems with inherent symmetry. Part I demonstrates the reduction of such problems to generalized matrix multiplication by a group-equivariant matrix. Fast techniques for this multiplication are described, including factorization, orbit decomposition, and Fourier transforms over finite groups. Our algorithms entail interaction between two symmetry groups: one arising at the software level from the problem's symmetry and the other arising at the hardware level from the processors' communication network. Part II illustrates the applicability of our symmetry -exploitation techniques by presenting a series of case studies of the design and implementation of parallel programs. First, a parallel program that solves chess endgames by factorization of an associated dihedral group-equivariant matrix is described. This code runs faster than previous serial programs, and discovered it a number of results. Second, parallel algorithms for Fourier transforms for finite groups are developed, and preliminary parallel implementations for group transforms of dihedral and of symmetric groups are described. Applications in learning, vision, pattern recognition, and statistics are proposed. Third, parallel implementations solving several computational science problems are described, including the direct n-body problem, convolutions arising from molecular biology, and some communication primitives such as broadcast and reduce. Some of our implementations ran orders of magnitude faster than previous techniques, and were used in the investigation of various physical phenomena.
Parallel algorithms for continuum dynamics
International Nuclear Information System (INIS)
Hicks, D.L.; Liebrock, L.M.
1987-01-01
Simply porting existing parallel programs to a new parallel processor may not achieve the full speedup possible; to achieve the maximum efficiency may require redesigning the parallel algorithms for the specific architecture. The authors discuss here parallel algorithms that were developed first for the HEP processor and then ported to the CRAY X-MP/4, the ELXSI/10, and the Intel iPSC/32. Focus is mainly on the most recent parallel processing results produced, i.e., those on the Intel Hypercube. The applications are simulations of continuum dynamics in which the momentum and stress gradients are important. Examples of these are inertial confinement fusion experiments, severe breaks in the coolant system of a reactor, weapons physics, shock-wave physics. Speedup efficiencies on the Intel iPSC Hypercube are very sensitive to the ratio of communication to computation. Great care must be taken in designing algorithms for this machine to avoid global communication. This is much more critical on the iPSC than it was on the three previous parallel processors
30 CFR 56.19008 - Friction hoist synchronizing mechanisms.
2010-07-01
... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Friction hoist synchronizing mechanisms. 56... Personnel Hoisting Hoists § 56.19008 Friction hoist synchronizing mechanisms. Where creep or slip may alter the effective position of safety devices, friction hoists shall be equipped with synchronizing...
Adaptive synchronization of a new hyperchaotic system with uncertain parameters
International Nuclear Information System (INIS)
Gao Tiegang; Chen Zengqiang; Yuan Zhuzhi; Yu Dongchuan
2007-01-01
This paper discusses control for the master-slave synchronization of a new hyperchaos with five uncertain parameters. An adaptive control law is derived to make the states of two identical hyperchaotic systems asymptotically synchronized based on the Lyapunov stability theory. Finally, a numerical simulation is presented to verify the effectiveness of the proposed synchronization scheme
Partial synchronization in diffusively time-delay coupled oscillator networks
Steur, E.; Oguchi, T.; Leeuwen, van C.; Nijmeijer, H.
2012-01-01
We study networks of diffusively time-delay coupled oscillatory units and we show that networks with certain symmetries can exhibit a form of incomplete synchronization called partial synchronization. We present conditions for the existence and stability of partial synchronization modes in networks
Complete switched modified function projective synchronization of a ...
Indian Academy of Sciences (India)
This paper extends previous work, where CSMFPS of chaotic systems means that all the state variables of the drive system synchronize with different state variables of the response system. As the synchronization scheme has many combined forms, it is a promising type of synchronization and can provide greater security in ...
Designing synchronization schemes for chaotic fractional-order unified systems
International Nuclear Information System (INIS)
Wang Junwei; Zhang Yanbin
2006-01-01
Synchronization in chaotic fractional-order differential systems is studied both theoretically and numerically. Two schemes are designed to achieve chaos synchronization of so-called unified chaotic systems and the corresponding numerical algorithms are established. Some sufficient conditions on synchronization are also derived based on the Laplace transformation theory. Computer simulations are used for demonstration
Partial synchronization and spontaneous spatial ordering in coupled chaotic systems
International Nuclear Information System (INIS)
Ying Zhang; Gang Hu; Cerdeira, Hilda A.; Shigang Chen; Braun, Thomas; Yugui Yao
2000-11-01
A model of many symmetrically and locally coupled chaotic oscillators is studied. Partial chaotic synchronizations associated with spontaneous spatial ordering are demonstrated. Very rich patterns of the system are revealed, based on partial synchronization analysis. The stabilities of different partially synchronous spatiotemporal structures and some novel dynamical behaviors of these states are discussed both numerically and analytically. (author)
21 CFR 892.1970 - Radiographic ECG/respirator synchronizer.
2010-04-01
... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Radiographic ECG/respirator synchronizer. 892.1970... (CONTINUED) MEDICAL DEVICES RADIOLOGY DEVICES Diagnostic Devices § 892.1970 Radiographic ECG/respirator synchronizer. (a) Identification. A radiographic ECG/respirator synchronizer is a device intended to be used to...
Adaptive synchronization of Rossler system with uncertain parameters
International Nuclear Information System (INIS)
Park, Ju H.
2005-01-01
This article addresses control for the chaos synchronization of Rossler systems with three uncertain parameters. Based on the Lyapunov stability theory, an adaptive control law is derived to make the states of two identical Rossler systems asymptotically synchronized. A numerical simulations is presented to show the effectiveness of the proposed chaos synchronization scheme
Chaos synchronization between two different chaotic dynamical systems
International Nuclear Information System (INIS)
Park, Ju H.
2006-01-01
This work presents chaos synchronization between two different chaotic systems by nonlinear control laws. First, synchronization problem between Genesio system and Rossler system has been investigated, and then the similar approach is applied to the synchronization problem between Genesio system and a new chaotic system developed recently in the literature. The control performances are verified by two numerical examples
Synchronous Control Method and Realization of Automated Pharmacy Elevator
Liu, Xiang-Quan
Firstly, the control method of elevator's synchronous motion is provided, the synchronous control structure of double servo motor based on PMAC is accomplished. Secondly, synchronous control program of elevator is implemented by using PMAC linear interpolation motion model and position error compensation method. Finally, the PID parameters of servo motor were adjusted. The experiment proves the control method has high stability and reliability.
Adaptive synchronization of hyperchaotic Chen system with uncertain parameters
International Nuclear Information System (INIS)
Park, Ju H.
2005-01-01
This article addresses control for the chaos synchronization of hyperchaotic Chen system with five uncertain parameters. Based on the Lyapunov stability theory, an adaptive control law is derived to make the states of two identical hyperchaotic Chen systems asymptotically synchronized. Finally, a numerical simulations is presented to show the effectiveness of the proposed chaos synchronization scheme
Synchronization in Coupled Oscillators with Two Coexisting Attractors
International Nuclear Information System (INIS)
Han-Han, Zhu; Jun-Zhong, Yang
2008-01-01
Dynamics in coupled Duffing oscillators with two coexisting symmetrical attractors is investigated. For a pair of Duffing oscillators coupled linearly, the transition to the synchronization generally consists of two steps: Firstly, the two oscillators have to jump onto a same attractor, then they reach synchronization similarly to coupled monostable oscillators. The transition scenarios to the synchronization observed are strongly dependent on initial conditions. (general)
Synchronization of Coupled Nonidentical Fractional-Order Hyperchaotic Systems
Directory of Open Access Journals (Sweden)
Zhouchao Wei
2011-01-01
Full Text Available Synchronization of coupled nonidentical fractional-order hyperchaotic systems is addressed by the active sliding mode method. By designing an active sliding mode controller and choosing proper control parameters, the master and slave systems are synchronized. Furthermore, synchronizing fractional-order hyperchaotic Lorenz system and fractional-order hyperchaotic Chen system is performed to show the effectiveness of the proposed controller.
Nonlinear Dynamics of Controlled Synchronizations of Manipulator System
Directory of Open Access Journals (Sweden)
Qingkai Han
2014-01-01
Full Text Available The nonlinear dynamics of the manipulator system which is controlled to achieve the synchronization motions is investigated in the paper. Firstly, the control strategies and modeling approaches of the manipulator system are given, in which the synchronization goal is defined by both synchronization errors and its derivatives. The synchronization controllers applied on the manipulator system include neuron synchronization controller, improved OPCL synchronization controller, and MRAC-PD synchronization controller. Then, an improved adaptive synchronized control strategy is proposed in order to estimate online the unknown structure parameters and state variables of the manipulator system and to realize the needed synchronous compensation. Furthermore, a robust adaptive synchronization controller is also researched to guarantee the dynamic stability of the system. Finally, the stability of motion synchronizations of the manipulator system possessing nonlinear component is discussed, together with the effect of control parameters and joint friction and others. Some typical motions such as motion bifurcations and the loss of synchronization of it are obtained and illustrated as periodic, multiperiodic, and/or chaotic motion patterns.
Adaptive projective synchronization of different chaotic systems with nonlinearity inputs
International Nuclear Information System (INIS)
Niu Yu-Jun; Pei Bing-Nan; Wang Xing-Yuan
2012-01-01
We investigate the projective synchronization of different chaotic systems with nonlinearity inputs. Based on the adaptive technique, sliding mode control method and pole assignment technique, a novel adaptive projective synchronization scheme is proposed to ensure the drive system and the response system with nonlinearity inputs can be rapidly synchronized up to the given scaling factor. (general)
Data driven parallelism in experimental high energy physics applications
International Nuclear Information System (INIS)
Pohl, M.
1987-01-01
I present global design principles for the implementation of high energy physics data analysis code on sequential and parallel processors with mixed shared and local memory. Potential parallelism in the structure of high energy physics tasks is identified with granularity varying from a few times 10 8 instructions all the way down to a few times 10 4 instructions. It follows the hierarchical structure of detector and data acquisition systems. To take advantage of this - yet preserving the necessary portability of the code - I propose a computational model with purely data driven concurrency in Single Program Multiple Data (SPMD) mode. The task granularity is defined by varying the granularity of the central data structure manipulated. Concurrent processes coordiate themselves asynchroneously using simple lock constructs on parts of the data structure. Load balancing among processes occurs naturally. The scheme allows to map the internal layout of the data structure closely onto the layout of local and shared memory in a parallel architecture. It thus allows to optimize the application with respect to synchronization as well as data transport overheads. I present a coarse top level design for a portable implementation of this scheme on sequential machines, multiprocessor mainframes (e.g. IBM 3090), tightly coupled multiprocessors (e.g. RP-3) and loosely coupled processor arrays (e.g. LCAP, Emulating Processor Farms). (orig.)
Data driven parallelism in experimental high energy physics applications
Pohl, Martin
1987-08-01
I present global design principles for the implementation of High Energy Physics data analysis code on sequential and parallel processors with mixed shared and local memory. Potential parallelism in the structure of High Energy Physics tasks is identified with granularity varying from a few times 10 8 instructions all the way down to a few times 10 4 instructions. It follows the hierarchical structure of detector and data acquisition systems. To take advantage of this - yet preserving the necessary portability of the code - I propose a computational model with purely data driven concurrency in Single Program Multiple Data (SPMD) mode. The Task granularity is defined by varying the granularity of the central data structure manipulated. Concurrent processes coordinate themselves asynchroneously using simple lock constructs on parts of the data structure. Load balancing among processes occurs naturally. The scheme allows to map the internal layout of the data structure closely onto the layout of local and shared memory in a parallel architecture. It thus allows to optimize the application with respect to synchronization as well as data transport overheads. I present a coarse top level design for a portable implementation of this scheme on sequential machines, multiprocessor mainframes (e.g. IBM 3090), tightly coupled multiprocessors (e.g. RP-3) and loosely coupled processor arrays (e.g. LCAP, Emulating Processor Farms).
Exploiting fine-grain parallelism in recursive LU factorization
Dongarra, Jack
2012-01-01
The LU factorization is an important numerical algorithm for solving system of linear equations. This paper proposes a novel approach for computing the LU factorization in parallel on multicore architectures. It improves the overall performance and also achieves the numerical quality of the standard LU factorization with partial pivoting. While the update of the trailing submatrix is computationally intensive and highly parallel, the inherently problematic portion of the LU factorization is the panel factorization due to its memory-bound characteristic and the atomicity of selecting the appropriate pivots. We remedy this in our new approach to LU factorization of (narrow and tall) panel submatrices. We use a parallel fine-grained recursive formulation of the factorization. It is based on conflict-free partitioning of the data and lock-less synchronization mechanisms. Our implementation lets the overall computation naturally flow with limited contention. Our recursive panel factorization provides the necessary performance increase for the inherently problematic portion of the LU factorization of square matrices. A large panel width results in larger Amdahl\\'s fraction as our experiments have revealed which is consistent with related efforts. The performance results of our implementation reveal superlinear speedup and far exceed what can be achieved with equivalent MKL and/or LAPACK routines. © 2012 The authors and IOS Press. All rights reserved.
Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E.
2014-08-12
Endpoint-based parallel data processing in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, the compute nodes coupled for data communications through the PAMI, including establishing a data communications geometry, the geometry specifying, for tasks representing processes of execution of the parallel application, a set of endpoints that are used in collective operations of the PAMI including a plurality of endpoints for one of the tasks; receiving in endpoints of the geometry an instruction for a collective operation; and executing the instruction for a collective operation through the endpoints in dependence upon the geometry, including dividing data communications operations among the plurality of endpoints for one of the tasks.
PPOOLEX experiments with two parallel blowdown pipes
Energy Technology Data Exchange (ETDEWEB)
Laine, J.; Puustinen, M.; Raesaenen, A. (Lappeenranta Univ. of Technology, Nuclear Safety Research Unit (Finland))
2011-01-15
This report summarizes the results of the experiments with two transparent blowdown pipes carried out with the scaled down PPOOLEX test facility designed and constructed at Lappeenranta University of Technology. Steam was blown into the dry well compartment and from there through either one or two vertical transparent blowdown pipes to the condensation pool. Five experiments with one pipe and six with two parallel pipes were carried out. The main purpose of the experiments was to study loads caused by chugging (rapid condensation) while steam is discharged into the condensation pool filled with sub-cooled water. The PPOOLEX test facility is a closed stainless steel vessel divided into two compartments, dry well and wet well. In the experiments the initial temperature of the condensation pool water varied from 12 deg. C to 55 deg. C, the steam flow rate from 40 g/s to 1 300 g/s and the temperature of incoming steam from 120 deg. C to 185 deg. C. In the experiments with only one transparent blowdown pipe chugging phenomenon didn't occur as intensified as in the preceding experiments carried out with a DN200 stainless steel pipe. With the steel blowdown pipe even 10 times higher pressure pulses were registered inside the pipe. Meanwhile, loads registered in the pool didn't indicate significant differences between the steel and polycarbonate pipe experiments. In the experiments with two transparent blowdown pipes, the steamwater interface moved almost synchronously up and down inside both pipes. Chugging was stronger than in the one pipe experiments and even two times higher loads were measured inside the pipes. The loads at the blowdown pipe outlet were approximately the same as in the one pipe cases. Other registered loads around the pool were about 50-100 % higher than with one pipe. The experiments with two parallel blowdown pipes gave contradictory results compared to the earlier studies dealing with chugging loads in case of multiple pipes. Contributing
Parallel Implicit Algorithms for CFD
Keyes, David E.
1998-01-01
The main goal of this project was efficient distributed parallel and workstation cluster implementations of Newton-Krylov-Schwarz (NKS) solvers for implicit Computational Fluid Dynamics (CFD.) "Newton" refers to a quadratically convergent nonlinear iteration using gradient information based on the true residual, "Krylov" to an inner linear iteration that accesses the Jacobian matrix only through highly parallelizable sparse matrix-vector products, and "Schwarz" to a domain decomposition form of preconditioning the inner Krylov iterations with primarily neighbor-only exchange of data between the processors. Prior experience has established that Newton-Krylov methods are competitive solvers in the CFD context and that Krylov-Schwarz methods port well to distributed memory computers. The combination of the techniques into Newton-Krylov-Schwarz was implemented on 2D and 3D unstructured Euler codes on the parallel testbeds that used to be at LaRC and on several other parallel computers operated by other agencies or made available by the vendors. Early implementations were made directly in Massively Parallel Integration (MPI) with parallel solvers we adapted from legacy NASA codes and enhanced for full NKS functionality. Later implementations were made in the framework of the PETSC library from Argonne National Laboratory, which now includes pseudo-transient continuation Newton-Krylov-Schwarz solver capability (as a result of demands we made upon PETSC during our early porting experiences). A secondary project pursued with funding from this contract was parallel implicit solvers in acoustics, specifically in the Helmholtz formulation. A 2D acoustic inverse problem has been solved in parallel within the PETSC framework.
Second derivative parallel block backward differentiation type ...
African Journals Online (AJOL)
Second derivative parallel block backward differentiation type formulas for Stiff ODEs. ... Log in or Register to get access to full text downloads. ... and the methods are inherently parallel and can be distributed over parallel processors. They are ...
A Parallel Approach to Fractal Image Compression
Lubomir Dedera
2004-01-01
The paper deals with a parallel approach to coding and decoding algorithms in fractal image compressionand presents experimental results comparing sequential and parallel algorithms from the point of view of achieved bothcoding and decoding time and effectiveness of parallelization.
Stroboscope Based Synchronization of Full Frame CCD Sensors.
Shen, Liang; Feng, Xiaobing; Zhang, Yuan; Shi, Min; Zhu, Dengming; Wang, Zhaoqi
2017-04-07
The key obstacle to the use of consumer cameras in computer vision and computer graphics applications is the lack of synchronization hardware. We present a stroboscope based synchronization approach for the charge-coupled device (CCD) consumer cameras. The synchronization is realized by first aligning the frames from different video sequences based on the smear dots of the stroboscope, and then matching the sequences using a hidden Markov model. Compared with current synchronized capture equipment, the proposed approach greatly reduces the cost by using inexpensive CCD cameras and one stroboscope. The results show that our method could reach a high accuracy much better than the frame-level synchronization of traditional software methods.
Synchronization of modified Colpitts oscillators with structural perturbations
Energy Technology Data Exchange (ETDEWEB)
Kammogne, Soup Tewa; Fotsin, H B, E-mail: hbfotsin@yahoo.fr [Laboratoire d' electronique, Departement de Physique, Faculte des sciences, Universite de Dschang, PO Box 067, Dschang (Cameroon)
2011-06-01
This paper deals with the problem of the synchronization of uncertain modified Colpitts oscillators. Considering the effect of external disturbances on the system parameters and nonlinear control inputs, a robust controller based on Lyapunov theory is designed for the output synchronization between a slave system and a master system in order to ensure the synchronization of uncertain modified Colpitts oscillator systems. This approach was chosen not only to guarantee a stable synchronization but also to reduce the effect of external perturbation. Nonadaptive feedback synchronization with only one controller for the system is investigated. Numerical simulations are performed to confirm the efficiency of the proposed control scheme.
Role of multistability in the transition to chaotic phase synchronization
DEFF Research Database (Denmark)
Postnov, D.E.; Vadivasova, T.E.; Sosnovtseva, Olga
1999-01-01
In this paper we describe the transition to phase synchronization for systems of coupled nonlinear oscillators that individually follow the Feigenbaum route to chaos. A nested structure of phase synchronized regions of different attractor families is observed. With this structure, the transition...... to nonsynchronous behavior is determined by the loss of stability for the most stable synchronous mode. It is shown that the appearance of hyperchaos and the transition from lag synchronization to phase synchronization are related to the merging of chaotic attractors from different families. Numerical examples...
Design of High Performance Permanent-Magnet Synchronous Wind Generators
Directory of Open Access Journals (Sweden)
Chun-Yu Hsiao
2014-11-01
Full Text Available This paper is devoted to the analysis and design of high performance permanent-magnet synchronous wind generators (PSWGs. A systematic and sequential methodology for the design of PMSGs is proposed with a high performance wind generator as a design model. Aiming at high induced voltage, low harmonic distortion as well as high generator efficiency, optimal generator parameters such as pole-arc to pole-pitch ratio and stator-slot-shoes dimension, etc. are determined with the proposed technique using Maxwell 2-D, Matlab software and the Taguchi method. The proposed double three-phase and six-phase winding configurations, which consist of six windings in the stator, can provide evenly distributed current for versatile applications regarding the voltage and current demands for practical consideration. Specifically, windings are connected in series to increase the output voltage at low wind speed, and in parallel during high wind speed to generate electricity even when either one winding fails, thereby enhancing the reliability as well. A PMSG is designed and implemented based on the proposed method. When the simulation is performed with a 6 Ω load, the output power for the double three-phase winding and six-phase winding are correspondingly 10.64 and 11.13 kW. In addition, 24 Ω load experiments show that the efficiencies of double three-phase winding and six-phase winding are 96.56% and 98.54%, respectively, verifying the proposed high performance operation.
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...
Parallel fabrication of macroporous scaffolds.
Dobos, Andrew; Grandhi, Taraka Sai Pavan; Godeshala, Sudhakar; Meldrum, Deirdre R; Rege, Kaushal
2018-07-01
Scaffolds generated from naturally occurring and synthetic polymers have been investigated in several applications because of their biocompatibility and tunable chemo-mechanical properties. Existing methods for generation of 3D polymeric scaffolds typically cannot be parallelized, suffer from low throughputs, and do not allow for quick and easy removal of the fragile structures that are formed. Current molds used in hydrogel and scaffold fabrication using solvent casting and porogen leaching are often single-use and do not facilitate 3D scaffold formation in parallel. Here, we describe a simple device and related approaches for the parallel fabrication of macroporous scaffolds. This approach was employed for the generation of macroporous and non-macroporous materials in parallel, in higher throughput and allowed for easy retrieval of these 3D scaffolds once formed. In addition, macroporous scaffolds with interconnected as well as non-interconnected pores were generated, and the versatility of this approach was employed for the generation of 3D scaffolds from diverse materials including an aminoglycoside-derived cationic hydrogel ("Amikagel"), poly(lactic-co-glycolic acid) or PLGA, and collagen. Macroporous scaffolds generated using the device were investigated for plasmid DNA binding and cell loading, indicating the use of this approach for developing materials for different applications in biotechnology. Our results demonstrate that the device-based approach is a simple technology for generating scaffolds in parallel, which can enhance the toolbox of current fabrication techniques. © 2018 Wiley Periodicals, Inc.
Parallel plasma fluid turbulence calculations
International Nuclear Information System (INIS)
Leboeuf, J.N.; Carreras, B.A.; Charlton, L.A.; Drake, J.B.; Lynch, V.E.; Newman, D.E.; Sidikman, K.L.; Spong, D.A.
1994-01-01
The study of plasma turbulence and transport is a complex problem of critical importance for fusion-relevant plasmas. To this day, the fluid treatment of plasma dynamics is the best approach to realistic physics at the high resolution required for certain experimentally relevant calculations. Core and edge turbulence in a magnetic fusion device have been modeled using state-of-the-art, nonlinear, three-dimensional, initial-value fluid and gyrofluid codes. Parallel implementation of these models on diverse platforms--vector parallel (National Energy Research Supercomputer Center's CRAY Y-MP C90), massively parallel (Intel Paragon XP/S 35), and serial parallel (clusters of high-performance workstations using the Parallel Virtual Machine protocol)--offers a variety of paths to high resolution and significant improvements in real-time efficiency, each with its own advantages. The largest and most efficient calculations have been performed at the 200 Mword memory limit on the C90 in dedicated mode, where an overlap of 12 to 13 out of a maximum of 16 processors has been achieved with a gyrofluid model of core fluctuations. The richness of the physics captured by these calculations is commensurate with the increased resolution and efficiency and is limited only by the ingenuity brought to the analysis of the massive amounts of data generated
Evaluating parallel optimization on transputers
Directory of Open Access Journals (Sweden)
A.G. Chalmers
2003-12-01
Full Text Available The faster processing power of modern computers and the development of efficient algorithms have made it possible for operations researchers to tackle a much wider range of problems than ever before. Further improvements in processing speed can be achieved utilising relatively inexpensive transputers to process components of an algorithm in parallel. The Davidon-Fletcher-Powell method is one of the most successful and widely used optimisation algorithms for unconstrained problems. This paper examines the algorithm and identifies the components that can be processed in parallel. The results of some experiments with these components are presented which indicates under what conditions parallel processing with an inexpensive configuration is likely to be faster than the traditional sequential implementations. The performance of the whole algorithm with its parallel components is then compared with the original sequential algorithm. The implementation serves to illustrate the practicalities of speeding up typical OR algorithms in terms of difficulty, effort and cost. The results give an indication of the savings in time a given parallel implementation can be expected to yield.