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

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

聚碳酸酯的吹塑成型

简介聚碳酸酯吹塑容器的特性与用途,着重分析其吹塑(包括挤出吹塑、共挤吹塑和注射吹塑)成型的机械(螺杆、机筒、型坯机头与吹塑模具)设计要点及工艺条件。     

Ozone Contribution in Food Industry in Japan

Ozone has the strongest oxidization effect after fluorine, and this property has been used in sterilization for food and processing plants in Japan. Moreover, there is no fear of toxic residues as with chlorine-based sterilizers and no hazardous trihalomethanes are formed. Based on these advantages, ozone has been used in water and air treatment for food products food materials and food processing plants. Use in the food processing is now increasing in Japan. This paper describes ozone sterilization, introducing sterilization systems and equipment applied to food in Japan.     

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.     

CUDA programs for the GPU computing of the Swendsen–Wang multi-cluster spin flip algorithm: 2D and 3D Ising,Potts, and XY models

We present sample CUDA programs for the GPU computing of the Swendsen–Wang multi-cluster spin flip algorithm. We deal with the classical spin models; the Ising model, the q$q$-state Potts model, and the classical XY model. As for the lattice, both the 2D (square) lattice and the 3D (simple cubic) lattice are treated. We already reported the idea of the GPU implementation for 2D models (Komura and Okabe, 2012). We here explain the details of sample programs, and discuss the performance of the present GPU implementation for the 3D Ising and XY models. We also show the calculated results of the moment ratio for these models, and discuss phase transitions.     

Fast finite difference Poisson solvers on heterogeneous architectures

In this paper we propose and evaluate a set of new strategies for the solution of three dimensional separable elliptic problems on CPU–GPU platforms. The numerical solution of the system of linear equations arising when discretizing those operators often represents the most time consuming part of larger simulation codes tackling a variety of physical situations. Incompressible fluid flows, electromagnetic problems, heat transfer and solid mechanic simulations are just a few examples of application areas that require efficient solution strategies for this class of problems. GPU computing has emerged as an attractive alternative to conventional CPUs for many scientific applications. High speedups over CPU implementations have been reported and this trend is expected to continue in the future with improved programming support and tighter CPU–GPU integration. These speedups by no means imply that CPU performance is no longer critical. The conventional CPU-control–GPU-compute pattern used in many applications wastes much of CPU’s computational power. Our proposed parallel implementation of a classical cyclic reduction algorithm to tackle the large linear systems arising from the discretized form of the elliptic problem at hand, schedules computing on both the GPU and the CPUs in a cooperative way. The experimental result demonstrates the effectiveness of this approach.     

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

热塑性淀粉加工过程的控制参数及塑化程度的表征方法

在介绍热塑性淀粉塑料加工原理的基础上,提出特殊机械能可以作为描述热塑性淀粉塑化过程的控制参数;并对表征热塑性淀粉塑化程度的各种方法进行了总结和评述。