Development of an integrated look-ahead dynamics-based NURBS interpolator for high precision machinery

Methodologies for planning motion trajectory of parametric interpolation such as non-uniform rational B-spline (NURBS) curves have been proposed in the past. However, most of the algorithms were developed based on the constraints of feedrate, acceleration/deceleration (acc/dec), jerk, and chord errors. The errors caused by servo dynamics were rarely included in the design process. This paper proposes an integrated look-ahead dynamics-based (ILD) algorithm which considers geometric and servo errors simultaneously. The ILD consists of three different modules: a sharp corner detection module, a jerk-limited module, and a dynamics module. The sharp corner detection module identifies sharp corners of a curve and then divides the curve into small segments. The jerk-limited module plans the feedrate profile of each segment according to the constraints of feedrate, acc/dec, jerk, and chord errors. To ensure that the contour errors are bounded within the specified value, the dynamics module further modifies the feedrate profile based on the derived contour error equation. Simulations and experiments are performed to validate the ILD algorithm. It is shown that the ILD approach improves tracking and contour accuracies significantly compared to adaptive-feedrate and curvature-feedrate algorithms.     

多维数据的复杂查询聚集算法研究

对空间多维数据的复杂查询是多维数据研究的重点和难点,目前研究的结论相对较少。在传统算法的基础上,进行了几个方面的改进：按分组属性值进行数据分块;对分组数据进行有效的排序;在聚集函数的应用上进行优化。模拟数据的试验表明：改进算法较大地提高了查询效率。     

Analogy and duality of texture analysis by harmonics or indicators

According to the classic harmonic approach, an orientation density function (odf)f is expanded into its corresponding Fourier orthogonal series with respect to generalized spherical harmonics, and a pole density function (pdf) into its corresponding Fourier orthogonal series with respect to spherical harmonics. While pdfs are even (antipodally symmetric) functions, odfs are generally not. Therefore, the part of the odf which cannot be determined from normal diffraction pdfs can be mathematically represented as the odd portion of its series expansion. If the odff is given, the even part can be mathematically represented explicitly in terms off itself. Thus, it is possible to render maps ofharmonic orientation ghosts, and to evaluatevariants of mathematical standard odfs resulting in identical pdfs independent of pdf data. However, if only normal diffraction pdfs are known, the data-dependentvariation width of feasible odfs remained unaccessible, and within the harmonic approach a measure of confidence in a solution of the pdf-to-odf inversion problem does not exist.According to any discrete approach, an odff defined on some setG of orientations is expanded into its corresponding Fourier orthogonal series with respect to indicator functions of the elements of a partition ofG, and a pdf defined on the upper (lower) unit hemisphereS ₊ ^{3 3} into its corresponding Fourier orthogonal series with respect to indicator functions of the elements of a partition ofS ₊ ³ . The ambiguity of the pdf-to-odf inversion problem is discussed in terms of column-rank deficiency of the augmented projection matrix. The implication of the harmonic approach to split an odf into auniquely determined and anundetermined part does no longer seem to be reasonable. However, it is possible to numerically determine data-dependent confidence intervals for the Fourier coefficients with respect to the indicator functions which can be immediately interpreted as mean orientation densities within the elements of the partition ofG. Doing so for all Fourier coefficients in the finite series expansion, i.e. for all elements of the partition of the setG, eventually results in the data-dependent variation width of odfs feasible with respect to given pdf data, and to the partitions ofG andS ₊ ³ .Thus it is confirmed that the appearance of orientation ghosts, in particular correlations oftrue andghost orientation components, depends on the representation of an odf. It may be questioned whether in practical applications the implicit assumption of the harmonic method that the even part can be determined uniquely and free of error is generally a reasonable initial condition to develop ghost correction procedures.     

Direct Observation of Oxygen Ion Dynamics in a WO3-x based Second-Order Memristor with Dendritic Integration Functions

Direct observation of oxygen dynamics in an oxide-based second-order memristor can provide the valid evidence to clarify the memristive mechanism, however, which is still limited for now. In this study, the migration and diffusion of oxygen ions in the region of Pt/WO_3-x Schottky interface are observed in the WO_3-x second-order memristor by using the technique of in situ transmission electron microscopy (TEM) and the electron energy loss spectroscopy. Interestingly, the coexistence of memristive and memcapacitive switching can be implemented in this memristor. Combined with the analysis of depth-profile X-ray photoelectron spectroscopy (XPS), an interface-barrier-modulation second-order memristive model is proposed based on the above results. Notably, temporally correlative oxygen dynamics in the memristor offers the platform to integrate signals from multiple inputs, enabling the realization of the dendritic functions of synchronous and asynchronous integration for the application of logic operations with fault-tolerance capability and associative learning. These findings provide the experimental evidence to in-depth understanding of oxygen dynamics and switching mechanism in second-order memristor, which can support the optimization of memristive performance and the achievement of biorealistic synaptic functions.     

HSWOA: An ensemble of hunger games search and whale optimization algorithm for global optimization

The search for food stimulated by hunger is a common phenomenon in the animal world. Mimicking the concept, recently, an optimization algorithm Hunger Games Search (HGS) has been proposed for global optimization. On the other side, the Whale Optimization Algorithm (WOA) is a commonly utilized nature-inspired algorithm portrayed by a straightforward construction with easy parameters imitating the hunting behavior of humpback whales. However, due to minimum exploration of the search space, WOA has a high chance of trapping into local solutions, and more exploitation leads it towards premature convergence. The concept of hunger from HGS is merged with the food searching techniques of the whale to lessen the inherent drawbacks of WOA. Two weights of HGS are adaptively designed for every whale using the respective hunger level for balancing search strategies. Performance verification of the proposed hunger search-based whale optimization algorithm (HSWOA) is done by comparing it with 10 state-of-the-art algorithms, including three very recently developed algorithms on 30 classical benchmark functions. Comparison with some basic algorithms, recently modified algorithms, and WOA variants is performed using IEEE CEC 2019 function set. Statistical performance of the proposed algorithm is verified with Friedman's test, boxplot analysis, and Nemenyi multiple comparison test. The operating speed of the algorithm is determined and tested with complexity analysis and convergence analysis. Finally, seven real-world engineering problems are solved and compared with a list of metaheuristic algorithms. Numerical and statistical performance comparison with state-of-the-art algorithms confirms the efficacy of the newly designed algorithm.     

TGDDM/DDS交联环氧树脂的分子动力学模拟

采用分子动力学(MD)模拟方法研究了环氧树脂4,4’-二氨基二苯甲烷四缩水甘油醚(TGDDM)与固化剂4,4’-二氨基二苯砜(DDS)交联过程中结构与能量的变化情况,预测了交联环氧树脂的玻璃化转变温度(Tg)、体积热膨胀系数和力学性能。研究结果表明,交联反应使得TGDDM/DDS体系密度增大,结构堆积更加紧密,范德华力和静电作用力增大,总能量减小,反应过程放热,通过温度-比体积曲线得到了交联体系的Tg约为527.9K,与实验值538.9K较为吻合,交联显著增强了材料的力学性能,而高温环境会引起树脂力学性能的下降,通过径向分布函数g(r)揭示了温度对交联环氧树脂结构的影响规律。     

A greedy MLPG method for identifying a control parameter in 2D parabolic PDEs

In this paper, we consider coefficient inverse problems, which are associated with the identification of unknown time dependent control parameter and unknown solution of two-dimensional parabolic inverse problem with overspecialization at a point in the spatial domain. After suitable finite difference approximation of time variable, an MLPG method is used for spatial discretization. To improve the efficiency of the MLPG method, a greedy algorithm is used. In fact, using the greedy algorithm, we avoid using more points from the data site than absolutely necessary and therefore, the method becomes more efficient. Comparison of the different kind of point selection and the effect of noisy data are performed for four test problems while our last test problem considers a problem with unknown solution. The results reveal that the method is efficient.     

A meshless method for solving 1D time-dependent heat source problem

A novel meshless numerical procedure based on the method of fundamental solutions (MFS) and the heat polynomials is proposed for recovering a time-dependent heat source and the boundary data simultaneously in an inverse heat conduction problem (IHCP). We will transform the problem into a homogeneous IHCP and initial value problems for the first-order ordinary differential equation. An improved method of MFS is used to solve the IHCP and a finite difference method is applied for solving the initial value problems. The advantage of applying the proposed meshless numerical scheme is producing the shape functions which provide the important delta function property to ensure that the essential conditions are fulfilled. Numerical experiments for some examples are provided to show the effectiveness of the proposed algorithm.     

Exponentially Accurate Approximations to Periodic Lipschitz Functions Based on Fourier Series Partial Sums

The problem of accurately reconstructing a piecewise smooth. 2-periodic function f and its first few derivatives, given only a truncated Fourier series representation of f, is studied and solved. The reconstruction process is divided into two steps. In the first step, the first 2N + 1 Fourier coefficients of f are used to approximate the locations and magnitudes of the discontinuities in f and its first M derivatives. This is accomplished by first finding initial estimates of these quantities based on certain properties of Gibbs phenomenon, and then refining these estimates by fitting the asymptotic form of the Fourier coefficients to the given coefficients using a least-squares approach. The locations of the singularities are approximated to within O(N ^–M–2), and the associated jump of the kth derivative of f is approximated to within O(N ^–M–1+k ), as N , and the method is robust. These estimates are then used with a class of singular basis functions, which have certain built-in singularities, to construct a new sequence of approximations to f. Each of these new approximations is the sum of a piecewise smooth function and a new Fourier series partial sum. When N is proportional to M, it is shown that these new approximations, and their derivatives, converge exponentially in the maximum norm to f, and its corresponding derivatives, except in the union of a finite number of small open intervals containing the points of singularity of f. The total measure of these intervals decreases exponentially to zero as M . The technique is illustrated with several examples.     

Some notes on Zadeh’s extensions

This paper shows that the Zadeh’s extensions of sendograph-metric-continuous fuzzy-valued functions are sendograph-metric-continuous fuzzy functions.