A note on circle packing

The problem of packing circles into a domain of prescribed topology is considered. The circles need not have equal radii. The Collins-Stephenson algorithm computes such a circle packing. This algorithm is parallelized in two different ways and its performance is reported for a triangular, planar domain test case. The implementation uses the highly parallel graphics processing unit (GPU) on commodity hardware. The speedups so achieved are discussed based on a number of experiments.     

Intelligent tool wear monitoring based on parallel residual and stacked bidirectional long short-term memory network

Effective tool wear monitoring (TWM) is essential for accurately assessing the degree of tool wear and for timely preventive maintenance. Existing data-driven monitoring methods mainly rely on complex feature engineering, which reduces the monitoring efficiency. This paper proposes a novel TWM model based on a parallel residual and stacked bidirectional long short-term memory (PRes–SBiLSTM) network. First, a parallel residual network (PResNet) is used to extract the multi-scale local features of sensor signals adaptively. Subsequently, a stacked bidirectional long short-term memory (SBiLSTM) network is used to obtain the time-series features related to the tool wear characteristics. Finally, the predicted tool wear value is outputted through a fully connected network. A smoothing correction method is applied to improve the prediction accuracy. The proposed model is experimentally verified to have a high prediction accuracy without sacrificing its generalization ability. A TWM system framework based on the PRes–SBiLSTM network is proposed, which has a certain reference value for TWM in actual industrial environments.     

Parallel depth first search. Part II. Analysis

This paper presents the analysis of a parallel formulation of depth-first search. At the heart of this parallel formulation is a dynamic work-distribution scheme that divides the work between different processors. The effectiveness of the parallel formulation is strongly influenced by the work-distribution scheme and the target architecture. We introduce the concept of isoefficiency function to characterize the effectiveness of different architectures and work-distribution schemes. Many researchers considered the ring architecture to be quite suitable for parallel depth-first search. Our analytical and experimental results show that hypercube and shared-memory architectures are significantly better. The analysis of previously known work-distribution schemes motivated the design of substantially improved schemes for ring and shared-memory architectures. In particular, we present a work-distribution algorithm that guarantees close to optimal performance on a shared-memory/-network-with-message-combining architecture (e.g. RP3). Much of the analysis presented in this paper is applicable to other parallel algorithms in which work is dynamically shared between different processors (e.g., parallel divide-and-conquer algorithms). The concept of isoefficiency is useful in characterizing the scalability of a variety of parallel algorithms.This work was supported by Army Research Office Grant No. DAAG29-84-K-0060 to the Artificial Intelligence Laboratory, and Office of Naval Research Grant N00014-86-K-0763 to the Computer Science Department at the University of Texas at Austin.     

一种四自由度并联机构的标定技术

运动学标定就是对实际几何参数的估计过程，通过标定来减少动平台的位姿误差。本文对并联机构的标定技术进行了介绍，并对一种四自由度并联机构的标定过程以两种标定方法进行了说明，给出了仿真结果。     

一种新的变轴数控机床标定方法

本文论述了国内外并联数控机床所采用的标定方法，选择了序列法进行了标定试验。但在实际标定过程中，出现了部分数据误差较大的问题，本文针对所面临的问题，提出了数值逼近法，并应用到实际机床的标定中，获得了机床的相关参数。之后，通过数学模型的计算值和实际测量值对比，验证了数据的可靠性，从而验证了方法的可行性和正确性。     

Variance analysis of identified linear MISO models having spatially correlated inputs,with application to parallel Hammerstein models

This contribution concerns variance analysis of linear multi-input single-output models when the inputs are temporally white but where different inputs may be correlated. An expression is provided for the variance of a linearly parametrized estimate of the frequency response function from one block, i.e. from one input to the output. In particular, this expression reveals that the variance increases in one block when the number of estimated parameters in another block is increased, but levels off when the number of parameters in the other block reaches the number of parameters in the block in question. It also quantifies exactly how correlation between inputs affects the resulting accuracy and a graphical representation is provided for this purpose. The results are applicable to parallel MISO Hammerstein models when the nonlinearities are known and generalize an existing variance expression for this type of model.     

Particle-in-Cell algorithms for emerging computer architectures

We have designed Particle-in-Cell algorithms for emerging architectures. These algorithms share a common approach, using fine-grained tiles, but different implementations depending on the architecture. On the GPU, there were two different implementations, one with atomic operations and one with no data collisions, using CUDA C and Fortran. Speedups up to about 50 compared to a single core of the Intel i7 processor have been achieved. There was also an implementation for traditional multi-core processors using OpenMP which achieved high parallel efficiency. We believe that this approach should work for other emerging designs such as Intel Phi coprocessor from the Intel MIC architecture.     

Fast computation of computer-generated hologram using Xeon Phi coprocessor

We report fast computation of computer-generated holograms (CGHs) using Xeon Phi coprocessors, which have massively x86-based processors on one chip, recently released by Intel. CGHs can generate arbitrary light wavefronts, and therefore, are promising technology for many applications: for example, three-dimensional displays, diffractive optical elements, and the generation of arbitrary beams. CGHs incur enormous computational cost. In this paper, we describe the implementations of several CGH generating algorithms on the Xeon Phi, and the comparisons in terms of the performance and the ease of programming between the Xeon Phi, a CPU and graphics processing unit (GPU).     

An integrated job release and scheduling approach on parallel machines: An application in electric wire-harness industry

This paper presents a new job release (JR) and scheduling methodology for one-stage parallel machines where sequence dependent setup times exist. A decision support system (DSS) based on job release is developed in order to enable the application of the methodology. First, mathematical programming models for both job release and job scheduling are devised. Then, due to the NP-hard nature of the problems, heuristics are proposed. As for the interaction between JR and scheduling, job scheduling is integrated with job release for the proposed heuristic solutions so that the capacity achievement provided by scheduling can be utilized for job release. In brief, product design characteristics oriented scheduling affects JR in the proposed approach. Moreover, value stream mapping (VSM) approach is used with the aim of stating the effect of the proposed methodology. Furthermore, the presented methodology was applied in a real life electric wire-harness production system. The application, based on 120-day production data, revealed that the proposed methodology provided 25% decrease in in-plant manufacturing lead time.     

Tri-pyramid Robot: Design and kinematic analysis of a 3-DOF translational parallel manipulator

3-DOF translational parallel manipulators have been developed in many different forms, but they still have respective disadvantages in different applications. To overcome their disadvantages, the structure and constraint design of a 3-DOF translational parallel manipulator is presented and named the Tri-pyramid Robot. In the constraint design of the presented manipulator, a conical displacement subset is defined based on displacement group theory. A triangular pyramidal constraint is presented and applied in the constraint designs between the manipulator?s subchains. The structural properties including the decoupled motions, overconstraint elimination, singularity free workspace, fixed actuators and isotropic configuration are analyzed and compared to existing structures. The Tri-pyramid Robot is constrained and realized by a minimal number of 1-DOF joints. The kinematic position solutions, workspace with variation of structural parameters, Jacobian matrix, isotropic and dexterity analysis are performed and evaluated in the numerical simulations.