missing data imputation: a fuzzy k-means clustering algorithm over sliding window

Tianjin University of Technology

Application of the Conjugate Gradient Optimization Algorithm of Neural Network on Laser Machining

在应用激光技术加工复杂曲面时,通常以采样点集为插值点来建立曲面函数,然后实现曲面上任意坐标点的精确定位。人工神经网络的BP算法能实现函数插值,但计算精度偏低,往往达不到插值精确要求,造成较大的加工误差。提出人工神经网络的共轭梯度最优化插值新算法,并通过实例仿真,证明了这种曲面精确定位方法的可行性,从而为激光加工的三维精确定位提供了一种良好解决方案。这种方法已经应用在实际中。

Simulating shock to detonation transition: Algorithm and results

An algorithm based on flux-corrected transport and the Lagrangian finite element method is presented for solving the problem of shock dynamics. It is verified through the model problem of one-dimensional strain elastoplastic shock wave propagation that the algorithm leads to stable, non-oscillatory results. Shock initiation and detonation wave propagation is simulated using the algorithm, and some interesting results are obtained. (C) 1999 Academic Press.

Ancient Chinese algorithm: The Ying Buzu Shu (method of surplus and deficiency) vs Newton iteration method

Air exploratory discussion of an ancient Chinese algorithm, the Ying Buzu Shu, in about 2nd century BC, known as the rule of double false position in the West is given. In addition to pointing out that the rule of double false position is actually a translation version of the ancient Chinese algorithm, a comparison with well-known Newton iteration method is also made. If derivative is introduced, the ancient Chinese algorithm reduces to the Newton method. A modification of the ancient Chinese algorithm is also proposed, and some of applications to nonlinear oscillators are illustrated.

Composite materials dynamic fracture studies by generalized Shmuely difference algorithm

The generalized Shmuely Difference Algorithm (GSDA) is presented here to analyze the dynamic fracture performance of orthogonal-anisotropic composite materials, such as glass fibre reinforced phenolplast. The difference recurrence Formulae and boundary condition difference extrapolation formulae are derived and programmed. The dynamic stress intensity factors (DSIF) of the isotropic and anisotropic centrally cracked plates are computed respectively using GSDA and compared with that published previously. GSDA is proved effective and reliable. Copyright (C) 1996 Elsevier Science Ltd.

An Extension of Self-Organizing Maps to Categorical Data

Self-organizing maps (SOM) have been recognized as a powerful tool in data exploratoration, especially for the tasks of clustering on high dimensional data. However, clustering on categorical data is still a challenge for SOM. This paper aims to extend standard SOM to handle feature values of categorical type. A batch SOM algorithm (NCSOM) is presented concerning the dissimilarity measure and update method of map evolution for both numeric and categorical features simultaneously.

An algorithm for coarse particle sedimentation simulation by Stokesian dynamics

Coarse Particle sedimentation is studied by using an algorithm with no adjustable parameters based on stokesian dynamics. Only inter-particle interactions of hydrodynamic force and gravity are considered. The sedimentation of a simple cubic array of spheres is used to verify the computational results. The scaling and parallelism with OpenMP of the method are presented. Random suspension sedimentation is investigated with Mont Carlo simulation. The computational results are shown in good agreement with experimental fitting at the lower computational cost of O(N In N).

Algorithm for simulating fracture processes in concrete by lattice modeling

To simulate fracture behaviors in concrete more realistically, a theoretical analysis on the potential question in the quasi-static method is presented, then a novel algorithm is proposed which takes into account the inertia effect due to unstable crack propagation and meanwhile requests much lower computational efforts than purely dynamic method. The inertia effect due to load increasing becomes less important and can be ignored with the loading rate decreasing, but the inertia effect due to unstable crack propagation remains considerable no matter how low the loading rate is. Therefore, results may become questionable if a fracture process including unstable cracking is simulated by the quasi-static procedure excluding completely inertia effects. However, it requires much higher computational effort to simulate experiments with not very high loading rates by the dynamic method. In this investigation which can be taken as a natural continuation, the potential question of quasi-static method is analyzed based on the dynamic equations of motion. One solution to this question is the new algorithm mentioned above. Numerical examples are provided by the generalized beam (GB) lattice model to show both fracture processes under different loading rates and capability of the new algorithm.

An Integrated Evolutionary Algorithm for Expensive Global Optimization

We propose an integrated algorithm named low dimensional simplex evolution extension (LDSEE) for expensive global optimization in which only a very limited number of function evaluations is allowed. The new algorithm accelerates an existing global optimization, low dimensional simplex evolution (LDSE), by using radial basis function (RBF) interpolation and tabu search. Different from other expensive global optimization methods, LDSEE integrates the RBF interpolation and tabu search with the LDSE algorithm rather than just calling existing global optimization algorithms as subroutines. As a result, it can keep a good balance between the model approximation and the global search. Meanwhile it is self-contained. It does not rely on other GO algorithms and is very easy to use. Numerical results show that it is a competitive alternative for expensive global optimization.

A block SPP algorithm for multidimensional tridiagonal equations with optimal message vector length

A parallel strategy for solving multidimensional tridiagonal equations is investigated in this paper. We present in detail an improved version of single parallel partition (SPP) algorithm in conjunction with message vectorization, which aggregates several communication messages into one to reduce the communication cost. We show the resulting block SPP can achieve good speedup for a wide range of message vector length (MVL), especially when the number of grid points in the divided direction is large. Instead of only using the largest possible MVL, we adopt numerical tests and modeling analysis to determine an optimal MVL so that significant improvement in speedup can be obtained.

On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver

It has long been recognized that many direct parallel tridiagonal solvers are only efficient for solving a single tridiagonal equation of large sizes, and they become inefficient when naively used in a three-dimensional ADI solver. In order to improve the parallel efficiency of an ADI solver using a direct parallel solver, we implement the single parallel partition (SPP) algorithm in conjunction with message vectorization, which aggregates several communication messages into one to reduce the communication costs. The measured performances show that the longest allowable message vector length (MVL) is not necessarily the best choice. To understand this observation and optimize the performance, we propose an improved model that takes the cache effect into consideration. The optimal MVL for achieving the best performance is shown to depend on number of processors and grid sizes. Similar dependence of the optimal MVL is also found for the popular block pipelined method.

Designing superresolution optical pupil filter with constrained global optimization algorithm

In this paper, a new method for designing three-zone optical pupil filter is presented. The phase-only optical pupil filter and the amplitude-only optical pupil filters were designed. The first kind of pupil for optical data storage can increase the transverse resolution. The second kind of pupil filter can increase the axial and transverse resolution at the same time, which is applicable in three-dimension imaging in confocal microscopy. (C) 2007 Elsevier GmbH. All rights reserved.

Optimization of single attosecond x-ray pulses by genetic algorithm control of the chirp and initial phase of 5 fs laser pulses

We show that the peak intensity of single attosecond x-ray pulses is enhanced by 1 or 2 orders of magnitude, the pulse duration is greatly compressed, and the optimal propagation distance is shortened by genetic algorithm optimization of the chirp and initial phase of 5 fs laser pulses. However, as the laser intensity increases, more efficient nonadiabatic self-phase matching can lead to a dramatically enhanced harmonic yield, and the efficiency of optimization decreases in the enhancement and compression of the generated attosecond pulses. (c) 2006 Optical Society of America.