A possible probe to neutron-skin thickness by fragment parallel momentum distribution in projectile fragmentation reactions

Neutron-skin thickness is a key parameter for a neutron-rich nucleus;however,it is difficult to determine.In the framework of the Lanzhou Quantum Molecular Dynamics(LQMD)model,a possible probe for the neutron-skin thickness(δ_(np))of neutron-rich ^(48)Ca was studied in the 140A MeV ^(48)Ca+^(9)Be projectile fragmentation reaction based on the parallel momentum distribution(p∥)of the residual fragments.A Fermi-type density distribution was employed to initiate the neutron density distributions in the LQMD simulations.A combined Gaussian function with different width parameters for the left side(Γ_(L))and the right side(Γ_(R))in the distribution was used to describe the p∥of the residual fragments.Taking neutron-rich sulfur isotopes as examples,Γ_(L) shows a sensitive correlation withδ_(np) of ^(48)Ca,and is proposed as a probe for determining the neutron skin thickness of the projectile nucleus.

Effect of parallel resonance on the electron energy distribution function in a 60 MHz capacitively coupled plasma

In general,as the radio frequency(RF)power increases in a capacitively coupled plasma(CCP),the power transfer efficiency decreases because the resistance of the CCP decreases.In this work,a parallel resonance circuit is applied to improve the power transfer efficiency at high RF power,and the effect of the parallel resonance on the electron energy distribution function(EEDF)is investigated in a 60 MHz CCP.The CCP consists of a power feed line,the electrodes,and plasma.The reactance of the CCP is positive at 60 MHz and acts like an inductive load.A vacuum variable capacitor(VVC)is connected in parallel with the inductive load,and then the parallel resonance between the VVC and the inductive load can be achieved.As the capacitance of the VVC approaches the parallel resonance condition,the equivalent resistance of the parallel circuit is considerably larger than that without the VVC,and the current flowing through the matching network is greatly reduced.Therefore,the power transfer efficiency of the discharge is improved from 76%,70%,and 68%to 81%,77%,and 76%at RF powers of 100 W,150 W,and 200 W,respectively.At parallel resonance conditions,the electron heating in bulk plasma is enhanced,which cannot be achieved without the VVC even at the higher RF powers.This enhancement of electron heating results in the evolution of the shape of the EEDF from a biMaxwellian distribution to a distribution with the smaller temperature difference between high-energy electrons and low-energy electrons.Due to the parallel resonance effect,the electron density increases by approximately 4%,18%,and 21%at RF powers of 100 W,150 W,and 200 W,respectively.

Distributed Control of Multiple-Bus Microgrid With Paralleled Distributed Generators

A microgrid is hard to control due to its reduced inertia and increased uncertainties. To overcome the challenges of microgrid control, advanced controllers need to be developed.In this paper, a distributed, two-level, communication-economic control scheme is presented for multiple-bus microgrids with each bus having multiple distributed generators(DGs) connected in parallel. The control objective of the upper level is to calculate the voltage references for one-bus subsystems. The objectives of the lower control level are to make the subsystems' bus voltages track the voltage references and to enhance load current sharing accuracy among the local DGs. Firstly, a distributed consensusbased power sharing algorithm is introduced to determine the power generations of the subsystems. Secondly, a discrete-time droop equation is used to adjust subsystem frequencies for voltage reference calculations. Finally, a Lyapunov-based decentralized control algorithm is designed for bus voltage regulation and proportional load current sharing. Extensive simulation studies with microgrid models of different levels of detail are performed to demonstrate the merits of the proposed control scheme.

Hound:a parallel image distribution system for cluster based on Docker

Current applications,consisting of multiple replicas,are packaged into lightweight containers with their execution dependencies.Considering the dominant impact of distribution efficiency of gigantic images on container startup(e.g.,distributed deep learning application),the image“warm-up”technique which prefetches images of these replicas to destination nodes in the cluster is proposed.However,the current image“warm-up”technique solely focuses on identical image distribution,which fails to take effect when distributing different images to destination nodes.To address this problem,this paper proposes Hound,a simple but efficient cluster image distribution system based on Docker.To support diverse image distribution requests of cluster nodes,Hound additionally adopts node-level parallelism(i.e.,downloading images to destination nodes in parallel)to further improve the efficiency of image distribution.The experimental results demonstrate Hound outperforms Docker,kubernetes container runtime interface(CRI-O),and Docker-compose in terms of image distribution performance when cluster nodes request different images.Moreover,the high scalability of Hound is evaluated in the scenario of ten nodes.

Fast parallel factor decomposition technique for coherently distributed source localization

This paper links parallel factor（PARAFAC） analysis to the problem of nominal direction-of-arrival（DOA） estimation for coherently distributed（CD） sources and proposes a fast PARAFACbased algorithm by establishing the trilinear PARAFAC model.Relying on the uniqueness of the low-rank three-way array decomposition and the trilinear alternating least squares regression, the proposed algorithm achieves nominal DOA estimation and outperforms the conventional estimation of signal parameter via rotational technique CD（ESPRIT-CD） and propagator method CD（PM-CD）methods in terms of estimation accuracy. Furthermore, by means of the initialization via the propagator method, this paper accelerates the convergence procedure of the proposed algorithm with no estimation performance degradation. In addition, the proposed algorithm can be directly applied to the multiple-source scenario,where sources have different angular distribution shapes. Numerical simulation results corroborate the effectiveness and superiority of the proposed fast PARAFAC-based algorithm.

Edge Intelligence with Distributed Processing of DNNs:A Survey

Withthe rapiddevelopment of deep learning,the size of data sets anddeepneuralnetworks(DNNs)models are also booming.As a result,the intolerable long time for models’training or inference with conventional strategies can not meet the satisfaction of modern tasks gradually.Moreover,devices stay idle in the scenario of edge computing(EC),which presents a waste of resources since they can share the pressure of the busy devices but they do not.To address the problem,the strategy leveraging distributed processing has been applied to load computation tasks from a single processor to a group of devices,which results in the acceleration of training or inference of DNN models and promotes the high utilization of devices in edge computing.Compared with existing papers,this paper presents an enlightening and novel review of applying distributed processing with data and model parallelism to improve deep learning tasks in edge computing.Considering the practicalities,commonly used lightweight models in a distributed system are introduced as well.As the key technique,the parallel strategy will be described in detail.Then some typical applications of distributed processing will be analyzed.Finally,the challenges of distributed processing with edge computing will be described.

A Novel Mixed Precision Distributed TPU GAN for Accelerated Learning Curve

Deep neural networks are gaining importance and popularity in applications and services.Due to the enormous number of learnable parameters and datasets,the training of neural networks is computationally costly.Parallel and distributed computation-based strategies are used to accelerate this training process.Generative Adversarial Networks(GAN)are a recent technological achievement in deep learning.These generative models are computationally expensive because a GAN consists of two neural networks and trains on enormous datasets.Typically,a GAN is trained on a single server.Conventional deep learning accelerator designs are challenged by the unique properties of GAN,like the enormous computation stages with non-traditional convolution layers.This work addresses the issue of distributing GANs so that they can train on datasets distributed over many TPUs(Tensor Processing Unit).Distributed learning training accelerates the learning process and decreases computation time.In this paper,the Generative Adversarial Network is accelerated using the distributed multi-core TPU in distributed data-parallel synchronous model.For adequate acceleration of the GAN network,the data parallel SGD(Stochastic Gradient Descent)model is implemented in multi-core TPU using distributed TensorFlow with mixed precision,bfloat16,and XLA(Accelerated Linear Algebra).The study was conducted on the MNIST dataset for varying batch sizes from 64 to 512 for 30 epochs in distributed SGD in TPU v3 with 128×128 systolic array.An extensive batch technique is implemented in bfloat16 to decrease the storage cost and speed up floating-point computations.The accelerated learning curve for the generator and discriminator network is obtained.The training time was reduced by 79%by varying the batch size from 64 to 512 in multi-core TPU.

Research on Grid Planning of Dual Power Distribution Network Based on Parallel Ant Colony Optimization Algorithm

A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the safety and reliability of residential electricity consumption.it is necessary to actively plan and modify the distribution network’s structure in the power grid,improve the quality of the distribution network,and optimize the planning of the distribution network,so that the network can be fully utilized to meet the needs of electricity consumption.In this paper,a distribution network grid planning algorithm based on the reliability of electricity consumption was completed using ant colony algorithm.For the distribution network structure planning of dual power sources,the parallel ant colony algorithm was used to prove that the premise of parallelism is the interactive process of ant colonies,and the dual power distribution network structure model is established based on the principle of the lowest cost.The artificial ants in the algorithm were compared with real ants in nature,and the basic steps and working principle of the ant colony optimization algorithm was studied with the help of the travelling salesman problem(TSP).Then,the limitations of the ant colony algorithm were analyzed,and an improvement strategy was proposed by using python for digital simulation.The results demonstrated the reliability of model-building and algorithm improvement.

A Parallel Distributed FEM Computing Circumstance Based on CORBA and Java Techniqiues

Based on CORBA (Common Object Request Broker Architect ) and Java techniques, a concrete solution to creating a parallel distributed FEM computing circumstance (PDFCC) on the platform of heterogeneous networks supporting TGP/IP protocol is proposed. In order to verify the feasibility of this solution, the basic frame of PDFCC has been implemented and tested on LAN (Local Area Network).

Parallel Distributed Implementation of Truss Optimization on a Local Area Network

A two-level optimization method for the design of complex truss and parallel distributed implementation on a LAN is presented using parallel virtual machine (PVM) for Win 32 as message passing between PCs. The volumes of truss are minimized by decomposing the original optimization problem into a number of bar optimization problems executed concurrently and a coordinate optimization problem, subject to constraints on nodal displacements, and stresses, buckling and crippling of bars, etc. The system sensitivity analysis that derives the partial derivatives of displacements and stresses with respect to areas are also performed in parallel so as to shorten the analysis time. The convergence and the speedup performances as well as parallel computing efficiency of the method are investigated by the optimization examples of a 52-bar planar truss and a 3 126-bar three-dimensional truss. The results show that the ideal speedup is obtained in the cases of 2 PCs for the 3 126-bar space truss optimization, while no speedup is observed for the 52-bar truss. It!is concluded that (1) the parallel distributed algorithm proposed is efficient on the PC-based LAN for the coarse-grained large optimization problem; (2) to get a high speedup, the problem granularity should match with the network granularity; and (3) the larger the problem size is, the higher the parallel efficiency is.

Parallel Computation of Fourier Transform on Distributed Memory Computer System

Multicomputer systems(distributed memory computer systems) are becoming more and more popular and will be wildly used in scientific researches. In this paper, we present a parallel algorithm of Fourier Transform of a vector of complex numbers on multicomputer system and give its computing times and its speedup in parallel environment supported by EXPRESS system on the multicomputer system which consists of four SGI workstations. Our analysis shows that the results is ideal and this scheme is suitable to multicomputer systems.

Burden Distribution for Bell-Less Top With Two Parallel Hoppers

The circumferential burden distribution of bell-less top with two parallel hoppers was analyzed to obtain the expressions of burden flux and uneven ratio. The four-batch feeding spirally with two parallel hoppers was proposed to realize even burden distribution by uneven flux, ensuring reasonable distribution of BF gas and effective usage of heat energy and chemical energy of gas as well as stable BF production with higher quality and lower consumption.

Rapid Optimization of Tension Distribution for Cable-Driven Parallel Manipulators with Redundant Cables

The solution of tension distributions is infinite for cable-driven parallel manipulators（CDPMs） with redundant cables. A rapid optimization method for determining the optimal tension distribution is presented. The new optimization method is primarily based on the geometry properties of a polyhedron and convex analysis. The computational efficiency of the optimization method is improved by the designed projection algorithm, and a fast algorithm is proposed to determine which two of the lines are intersected at the optimal point. Moreover, a method for avoiding the operating point on the lower tension limit is developed. Simulation experiments are implemented on a six degree-of-freedom（6-DOF） CDPM with eight cables, and the results indicate that the new method is one order of magnitude faster than the standard simplex method. The optimal distribution of tension distribution is thus rapidly established on real-time by the proposed method.

Distributed Air &Missile Defense with Spatial Grasp Technology

A high-level technology is revealed that can effectively convert any distributed system into a globally programmable machine capable of operating without central resources and self-recovering from indiscriminate damages. Integral mission scenarios in Distributed Scenario Language (DSL) can be injected from any point, runtime covering & grasping the whole system or its parts, setting operational infrastructures, and orienting local and global behavior in the way needed. Many operational scenarios can be simultaneously injected into this spatial machine from different points, cooperating or competing over the shared distributed knowledge as overlapping fields of solutions. Distributed DSL interpreter organization and benefits of using this technology for integrated air and missile defense are discussed along with programming examples in this and other fields.

A novel hybrid estimation of distribution algorithm for solving hybrid flowshop scheduling problem with unrelated parallel machine

The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.

An Approach of Distributed Joint Optimization for Cluster-based Wireless Sensor Networks

Wireless sensor networks(WSNs) are energyconstrained,so energy saving is one of the most important issues in typical applications.The clustered WSN topology is considered in this paper.To achieve the balance of energy consumption and utility of network resources,we explicitly model and factor the effect of power and rate.A novel joint optimization model is proposed with the protection for cluster head.By the mean of a choice of two appropriate sub-utility functions,the distributed iterative algorithm is obtained.The convergence of the proposed iterative algorithm is proved analytically.We consider general dual decomposition method to realize variable separation and distributed computation,which is practical in large-scale sensor networks.Numerical results show that the proposed joint optimal algorithm converges to the optimal power allocation and rate transmission,and validate the performance in terms of prolonging of network lifetime and improvement of throughput.

Stability Analysis for a Planar Parallel Manipulator with the Capability of Self-Coordinating the Load Distribution

Redundantly actuated parallel manipulators have the advantage of enhancing load-carrying capability over their non-redundant ones, however they also cause the problem of uneven load distribution and need a high requirement for the control system. This paper presents a 2-RPR/RP planar redundantly actuated parallel manipulator which can self-coordinate the distribution of external loads. This capability is realized by an appropriate design of the moving platform to make the manipulator stable at equilibrium position. The stability is proved by the theorem of direct Lyapunov method in classical mechanics. The numerical simulations are conducted to validate the stable capability by means of the observation of potential energies and phase planes. This paper offers an alternative way to design a redundantly actuated manipulator with the capability of self-coordinating the load distribution to actuations, such that parts of the controlling work are assigned to the manipulator itself by its own structure and only a little work remains to the control system.

A DISTRIBUTED LATTICE BOLTZMANN METHOD

In this paper, an overlapping lattice Boltzmann model is introduced and its domain decomposition method, a distributed lattice Boltzmann method is presented. Parallel effectiveness of some programs based on the distributed lattice Boltzmann method are analyzed.

A Distributed Virtual Machine for Microsoft .NET

Today, an ever increasing number of natural scientists use computers for data analysis, modeling, simulation and visualization of complex problems. However, in the last decade the computer architecture has changed significantly, making it increasingly difficult to fully utilize the power of the processor, unless the scientist is a trained programmer. The reasons for this shift include the change from single-core to multi-core processors, as well as the decreasing price of hardware, which allows researchers to build cluster computers made from commodity hardware. Therefore, scientists must not only be able to handle multi-core processors, but also the problems associated with writing distributed memory programs and handle communication between hundreds of multi-core machines. Fortunately, there are a number of systems to help the scientist e.g. Message Parsing Interface (MPI) [1] for handling communication, DistNumPy [2] for handling data distribution and Communicating Sequential Processes (CSP) [3] for handling concurrency related problems. Having said that, it must be emphasized that all of these methods require that the scientists learn a new method and then rewrite their programs, which mean more work for the scientist. A solution that does not require much work for the scientists is automatic parallelization. However, research dating back three decades has yet to find fully automated parallelization as a feasible solution for programs in general, but some classes of programs can be automatically parallelized to an extent. This paper describes an external library which provides a Parallel. For loop construct, allowing the body of a loop to be run in Parallel across multiple networked machines, i.e. on distributed memory architectures. The individual machines themselves may be shared memory nodes of course. The idea is inspired by Microsoft’s Parallel Library that supplies multiple Parallel constructs. However, unlike Microsoft’s Library our library supports distributed memory architectures. Preliminary tests have shown that simple problems may be distributed easily and achieve good scalability. Unfortunately, the tests show that the scalability is limited by the number of accesses made to shared variables. Thus the applicability of the library is not general but limited to a subset of applications with only limited communication needs.

Improved Estimation of Distribution Algorithm for Solving Unrelated Parallel Machine Scheduling Problem

Scheduling problem is a well-known combinatorial optimization problem.An effective improved estimation of distribution algorithm(IEDA) was proposed for minimizing the makespan of the unrelated parallel machine scheduling problem(UPMSP).Mathematical description was given for the UPMSP.The IEDA which was combined with variable neighborhood search(IEDA_VNS) was proposed to solve the UPMSP in order to improve local search ability.A new encoding method was designed for representing the feasible solutions of the UPMSP.More knowledge of the UPMSP were taken consideration in IEDA_ VNS for probability matrix which was based the processing time matrix.The simulation results show that the proposed IEDA_VNS can solve the problem effectively.