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.

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.

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.

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.

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.

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.

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.

Dynamic Distribution Model with Prime Granularity for Parallel Computing

Dynamic distribution model is one of the best schemes for parallel volume rendering. How- ever, in homogeneous cluster system.since the granularity is traditionally identical, all processors communicate almost simultaneously and computation load may lose balance. Due to problems above, a dynamic distribution model with prime granularity for parallel computing is presented. Granularities of each processor are relatively prime, and related theories are introduced. A high parallel performance can be achieved by minimizing network competition and using a load balancing strategy that ensures all processors finish almost simultaneously. Based on Master-Slave-Gleaner ( MSG) scheme, the parallel Splatting Algorithm for volume rendering is used to test the model on IBM Cluster 1350 system. The experimental results show that the model can bring a considerable improvement in performance, including computation efficiency, total execution time, speed, and load balancing.

An effective estimation of distribution algorithm for parallel litho machine scheduling with reticle constraints

In order to improve the scheduling efficiency of photolithography,bottleneck process of wafer fabrications in the semiconductor industry,an effective estimation of distribution algorithm is proposed for scheduling problems of parallel litho machines with reticle constraints,where multiple reticles are available for each reticle type.First,the scheduling problem domain of parallel litho machines is described with reticle constraints and mathematical programming formulations are put forward with the objective of minimizing total weighted completion time.Second,estimation of distribution algorithm is developed with a decoding scheme specially designed to deal with the reticle constraints.Third,an insert-based local search with the first move strategy is introduced to enhance the local exploitation ability of the algorithm.Finally,simulation experiments and analysis demonstrate the effectiveness of the proposed algorithm.

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.

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.

A New Study on Combustion Behavior of Pine Sawdust Characterized by the Weibull Distribution

An isothermal operation is implemented by employing a thermogravimetric analyzer (TGA) for simulating the thermal decomposition behavior of 58μm pine sawdust in air atmosphere.An independent parallel reaction model is adopted in this study to describe the thermal decomposition mechanism.The Weibull distribution function is used to record and analyze the weight loss during isothermal decomposition at different temperatures(500,600,700,and 800°C).The total weight loss of the pine sawdust is assumed as a linear combination of individual weight loss from three components,including the char and two volatile matters.The plot of the thermal decomposition rate curve leads to kinetic parameters such as the reaction rate constants and the reaction order.The results show that the Weibull distribution function successfully represents decomposition curves of three components,and fits the experimental data very well.Therefore,this study provides a simple way to evaluate the decomposition rate of biomass combustion in a real combustor.

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

Overall optimization of distribution networks

Network reconfiguration and capacitor switching are important measures to reduce power loss and improve security and economy in automation of distribution. A new method based on parallel genetic algorithm is proposed to search the whole problem space for better solution. Multiple populations evolve independently and communicate periodically, which simulates parallel computing process to save computing time. The results show that the method is robust and has better benefit than the alterative iteration method. In addition, the effect of overall optimization is better than optimization alone. Power loss can be reduced and the level of voltage can be greatly improved.

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.

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.