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.

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

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.

Evolutionary Neural Architecture Search and Its Applications in Healthcare

Most of the neural network architectures are based on human experience,which requires a long and tedious trial-and-error process.Neural architecture search(NAS)attempts to detect effective architectures without human intervention.Evolutionary algorithms(EAs)for NAS can find better solutions than human-designed architectures by exploring a large search space for possible architectures.Using multiobjective EAs for NAS,optimal neural architectures that meet various performance criteria can be explored and discovered efficiently.Furthermore,hardware-accelerated NAS methods can improve the efficiency of the NAS.While existing reviews have mainly focused on different strategies to complete NAS,a few studies have explored the use of EAs for NAS.In this paper,we summarize and explore the use of EAs for NAS,as well as large-scale multiobjective optimization strategies and hardware-accelerated NAS methods.NAS performs well in healthcare applications,such as medical image analysis,classification of disease diagnosis,and health monitoring.EAs for NAS can automate the search process and optimize multiple objectives simultaneously in a given healthcare task.Deep neural network has been successfully used in healthcare,but it lacks interpretability.Medical data is highly sensitive,and privacy leaks are frequently reported in the healthcare industry.To solve these problems,in healthcare,we propose an interpretable neuroevolution framework based on federated learning to address search efficiency and privacy protection.Moreover,we also point out future research directions for evolutionary NAS.Overall,for researchers who want to use EAs to optimize NNs in healthcare,we analyze the advantages and disadvantages of doing so to provide detailed guidance,and propose an interpretable privacy-preserving framework for healthcare applications.

Adaptive monopulse beamforming with partial parallel structure

A new recursive algorithm with the partial parallel structure based on the linearly constrained minimum variance （LCMV） criterion for adaptive monopulse systems is proposed. The weight vector associated with the original whole antenna array is decomposed into several adaptive weight sub-vectors firstly. An adaptive algorithm based on the conventional LCMV principle is then deduced to update the weight sub-vectors for sum and difference beam, respectively. The optimal weight vector can be obtained after convergence. The required computational complexity is evaluated for the proposed technique, which is on the order of O（N） and less than that of the conventional LCMV method. The flow chart scheme with the partial parallel structure of the proposed algorithm is introduced. This scheme is easy to be implemented on a distributed computer/digital signal processor （DSP） system to solve the problems of the heavy computational burden and vast data transmission of the large-scale adaptive monopulse array. Then, the monopulse ratio and convergence rate of the proposed algorithm are evaluated by numerical simulations. Compared with some recent adaptive monopulse estimation methods, a better performance on computational complexity and monopulse ratio can be achieved with the proposed adaptive method.

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.

Adaptive Distributed Admission Control in Differentiated Services Domains

In this paper we propose a scalable admission control scheme for the QoS sensitivity traffic in DiffServ domains. In our scheme, the ingress touters perform admissibility test in a fully distributed and parallel fashion for requests based on our resource per-assigning mechanism. Then, we introduce a novel two phase token passing mechanism to adaptively optimize resource per-assigning among contending edge touters in proportion to their traffic. In addition, we adopt a measurement based admission decision-making criterion to gain the benefit of high utilization of statistical multiplexing. Our simulation results indicate that even under very high request load it is possible to perform admission control and resource allocation in parallel without suffering in terms of response time, packet loss rate, or utilization.

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.

Spatial Management of Distributed Social Systems

The paper describes the use of invented,developed,and tested in different countries of the high-level spatial grasp model and technology capable of solving important problems in large social systems,which may be represented as dynamic,self-evolving and distributed social networks.The approach allows us to find important solutions on a holistic level by spatial navigation and parallel pattern matching of social networks with active self-propagating scenarios represented in a special recursive language.This approach effectively hides inside the distributed and networked language implementation traditional system management routines,often providing hundreds of times shorter and simpler high-level solution code.The paper highlights the demands to efficient simulation of social systems,briefs the technology used,and provides some programming examples for solutions of practical problems.

Java Parallel Implementations of Kohonen Self-Organizing Feature Maps

The Kohonen self-organizing map (SOM) is an important tool to find a mapping from high-dimensional space to low dimensional space. The time a SOM requires increases with the number of neurons. A parallel implementation of the algorithm can make it faster. This paper investigates the most recent parallel algorithms on SOMs. Using Java network programming utilities, improved parallel and distributed system are set up to simulate these algorithms. From the simulations, we conclude that those algorithms form good feature maps.

DE RHAM DECOMPOSITION FOR RIEMANNIAN MANIFOLDS WITH BOUNDARY

In this paper,we extend the classical de Rham decomposition theorem to the case of Riemannian manifolds with boundary by using the trick of the development of curves.

Controller Design for Electric Power Steering System Using T-S Fuzzy Model Approach

Pressure ripples in electric power steering （EPS） systems can be caused by the phase lag between the driver s steering torque and steer angle, the nonlinear frictions, and the disturbances from road and sensor noise especially during high-frequency maneuvers. This paper investigates the use of the robust fuzzy control method for actively reducing pressure ripples for EPS systems. Remarkable progress on steering maneuverability is achieved. The EPS dynamics is described with an eight-order nonlinear state-space model and approximated by a Takagi-Sugeno （T-S） fuzzy model with time-varying delays and external disturbances. A stabilization approach is then presented for nonlinear time-delay systems through fuzzy state feedback controller in parallel distributed compensation （PDC） structure. The closed-loop stability conditions of EPS system with the fuzzy controller are parameterized in terms of the linear matrix inequality （LMI） problem. Simulations and experiments using the proposed robust fuzzy controller and traditional PID controller have been carried out for EPS systems. Both the simulation and experiment results show that the proposed fuzzy controller can reduce the torque ripples and allow us to have a good steering feeling and stable driving.

Decentralized robust stabilization of discrete-time fuzzy large-scale systems with parametric uncertainties: a LMI method

Decentralized robust stabilization problem of discrete-time fuzzy large-scale systems with parametric uncertainties is considered. This uncertain fuzzy large-scale system consists of N interconnected T-S fuzzy subsystems, and the parametric uncertainties are unknown but norm-bounded. Based on Lyapunov stability theory and decentralized control theory of large-scale system, the design schema of decentralized parallel distributed compensation （DPDC） fuzzy controllers to ensure the asymptotic stability of the whole fuzzy large-scale system is proposed. The existence conditions for these controllers take the forms of LMIs. Finally a numerical simulation example is given to show the utility of the method proposed.

Graph Computing Based Distributed Parallel Power Flow for AC/DC Systems with Improved Initial Estimate

The sequential method is easy to integrate with existing large-scale alternating current(AC)power flow solvers and is therefore a common approach for solving the power flow of AC/direct current(DC)hybrid systems.In this paper,a highperformance graph computing based distributed parallel implementation of the sequential method with an improved initial estimate approach for hybrid AC/DC systems is developed.The proposed approach is capable of speeding up the entire computation process without compromising the accuracy of result.First,the AC/DC network is intuitively represented by a graph and stored in a graph database(GDB)to expedite data processing.Considering the interconnection of AC grids via high-voltage direct current(HVDC)links,the network is subsequently partitioned into independent areas which are naturally fit for distributed power flow analysis.For each area,the fast-decoupled power flow(FDPF)is employed with node-based parallel computing(NPC)and hierarchical parallel computing(HPC)to quickly identify system states.Furthermore,to reduce the alternate iterations in the sequential method,a new decoupled approach is utilized to achieve a good initial estimate for the Newton-Raphson method.With the improved initial estimate,the sequential method can converge in fewer iterations.Consequently,the proposed approach allows for significant reduction in computing time and is able to meet the requirement of the real-time analysis platform for power system.The performance is verified on standard IEEE 300-bus system,extended large-scale systems,and a practical 11119-bus system in China.

Frequency domain wave equation forward modeling using gaussian elimination with static pivoting

Frequency domain wave equation forward modeling is a problem of solving large scale linear sparse systems which is often subject to the limits of computational efficiency and memory storage. Conventional Gaussian elimination cannot resolve the parallel computation of huge data. Therefore, we use the Gaussian elimination with static pivoting （GESP） method for sparse matrix decomposition and multi-source finite-difference modeling. The GESP method does not only improve the computational efficiency but also benefit the distributed parallel computation of matrix decomposition within a single frequency point. We test the proposed method using the classic Marmousi model. Both the single-frequency wave field and time domain seismic section show that the proposed method improves the simulation accuracy and computational efficiency and saves and makes full use of memory. This method can lay the basis for waveform inversion.

Construction of parallel and distributed static simulation system based on augmented reality

This article puts forward a kind of parallel and distributed static augmented scene system structure to improve the performance of real time augmented simulation system. Based on static registration technique, several groups of processing nodes do parallel scene pictures taking, 3D registration and virtual-real merging. Process on different nodes is controlled by uniform synchronization mechanism and network transmitting. Wide field of view image can be obtained from image mosaic operation and displayed by wide view display system. Detailed system architecture, registration algorithm, method how to determine camera position and synchronization mechanism between each process node are introduced. The experiment result can validate the good performance of the designed system.

Thread-Oriented Online Load Balancing

Dynamic task assignment and migration are the key technique to load balancing which plays an important role in the achievement of high performance in distributed computing system. In this paper, we describe the design and implementation of an online thread scheduling and migration system (S&M) based on a previous work of LWP -MPI. Experimental results show that performance is enhanced.

Two phase decision algorithm of replica allocation

In distributed parallel server system, location and redundancy of repficas have great influence on availability and efficiency of the system. In order to improve availability and efficiency of the system, two phase decision algorithm of replica allocation is proposed. The algorithm which makes use of auto-regression model dynamically predicts the future count of READ and WRITE operation, and then determines location and redundancy of replicas by considering availability, CPU and bands of the network. The algorithm can not only ensure the requirement of availability, but also reduce the system resources consumed by all the operations in a great scale. Analysis and test show that communication complexity and time complexity of the algorithm satisfy O（n）, resource optimizing scale increases with the increase of READ count.

New Heuristic Distributed Parallel Algorithms for Searching and Planning

This paper proposes new heuristic distributed parallel algorithms for search-ing and planning, which are based on the concepts of wave concurrent prop-agations and competitive activation mechanisms. These algorithms are char-acterized by simplicity and clearness of control strategies for searching, anddistinguished abilities in many aspects, such as high speed processing, widesuitability for searching AND/OR implicit graphs, and ease in hardware imple-mentation.

Grid-based internet worm behavior simulator

The traditional network simulator has function and performance limitation when simulating Internet worms,so we designed the grid-based Internet worm behavior simulator (IWBS Grid).IWBS Grid makes use of the real Internet topology,link and routing information,and simulates the worm behavior at the packet event-driven level;and proposes a high-performance Internet worms behavior simulation platform by right of the grid computing capability,resource and task management,and so on.The experimental results show that IWBS grid surpasses the traditional simulator in simulating capability,and the technology to track the worm propagation in packet level can propose the valuable information for the further study on worms.