考虑接触演变的板材回弹过程建模与优化

回弹是由工件在卸载后的弹性变形引起的。板料成形过程中为了控制成形件的最终形状,必须进行回弹设计优化。准确预测回弹对于板料成形过程的模具设计非常重要。降低回弹模拟结果与试验结果的偏差是设计过程中的难题。基于NUMISHEET’02的自由弯曲标准考题考虑板材与模具间的接触演变过程,建立了一个有限元模型来预测回弹。采用一个常规的优化方法对有限元分析中的材料和单元模型进行了分析,研究发现不同模型对回弹结果有较大影响。模拟结果与参考文献中的试验结果比较表明了模型的正确性和可行性。     

Water cycle algorithm with evaporation rate for solving constrained and unconstrained optimization problems

This paper presents a modified version of the water cycle algorithm (WCA). The fundamental concepts and ideas which underlie the WCA are inspired based on the observation of water cycle process and how rivers and streams flow to the sea. New concept of evaporation rate for different rivers and streams is defined so called evaporation rate based WCA (ER-WCA), which offers improvement in search. Furthermore, the evaporation condition is also applied for streams that directly flow to sea based on the new approach. The ER-WCA shows a better balance between exploration and exploitation phases compared to the standard WCA. It is shown that the ER-WCA offers high potential in finding all global optima of multimodal and benchmark functions. The WCA and ER-WCA are tested using several multimodal benchmark functions and the obtained optimization results show that in most cases the ER-WCA converges to the global solution faster and offers more accurate results than the WCA and other considered optimizers. Based on the performance of ER-WCA on a number of well-known benchmark functions, the efficiency of the proposed method with respect to the number of function evaluations (computational effort) and accuracy of function value are represented.     

Influence of erroneous learning samples on adaptation in on-line handwriting recognition

We have considered problems involved in the self-supervised learning process of an on-line handwriting recognition system. Our system is able to recognize isolated characters by comparing them to prototype characters with a method based on the Dynamic Time Warping algorithm. The recognition system is adapted by adding new prototypes, inactivating confusing or erroneous ones, and reshaping existing prototypes with a method based on the Learning Vector Quantization. We have analyzed the sources of erroneous learning samples and studied the influence of such samples on the performance of the recognizer via simulations. In these simulations, two adaptation strategies combined with four methods for inactivating prototypes were applied. The results of the simulations showed that the adaptation strategies are able to improve the system's recognition rate and the prototype inactivation methods do reduce the harmful effects of erroneous learning samples.     

Two-stage segmentation of unconstrained handwritten Chinese characters

Correct segmentation of handwritten Chinese characters is crucial to their successful recognition. However, due to many difficulties involved, little work has been reported in this area. In this paper, a two-stage approach is presented to segment unconstrained handwritten Chinese characters. A handwritten Chinese character string is first coarsely segmented according to the background skeleton and vertical projection after a proper image preprocessing. With several geometric features, all possible segmentation paths are evaluated by using the fuzzy decision rules learned from examples. As a result, unsuitable segmentation paths are discarded. In the fine segmentation stage that follows, the strokes that may contain segmentation points are first identified. The feature points are then extracted from candidate strokes and taken as segmentation point candidates through each of which a segmentation path may be formed. The geometric features similar to the coarse segmentation stage are used and corresponding fuzzy decision rules are generated to evaluate fine segmentation paths. Experimental results on 1000 Chinese character strings from postal mail show that our approach can achieve a reasonable good overall accuracy in segmenting unconstrained handwritten Chinese characters.     

A generalized two point ellipsoidal anisotropic ray tracing for converted waves

Rocks can be anisotropic due to a variety of reasons. When estimating rock velocities from seismic data, failure to introduce anisotropy into earth models could generate distortions in the final images that can have enormous economic impact. To estimate anisotropic earth velocities by tomographic methods, it is necessary to trace rays or to solve the wave equation in models where anisotropy has been properly considered. Thus, in this work we present a 3-D generalized ellipsoidal travel time formulation that allow us to trace rays in an anisotropic medium. We propose to trace rays in anisotropic media by solving a set of nonlinear optimization problems, where the group velocities for P and S wave propagation modes are 3-D ellipsoidal approximations that have been recently obtained. Moreover, we prove that this 3-D ellipsoidal anisotropic ray tracing formulation is a convex nonlinear optimization problem, and therefore any solution of the problem is a global minimum. Each optimization problem is solved by the global spectral gradient method, which requires first order information and has low computation and low storage requirements. Our approach for tracing rays in anisotropic media is a generalization in the sense that handles titled axis of symmetry and, close to the axis of symmetry, it is an accurate formulation for 2-D transversely isotropic media and 3-D orthorhombic media, depending on the input parameters. Moreover, this formulation gives the exact ray trajectories in 2-D and 3-D homogeneous isotropic media. The simplicity of the formulation and the low computational cost of the optimization method allow us to present a variety of numerical results that illustrate the behavior and computational advantages of the approach, and the difficulties when working in anisotropic media. Partially supported by Fonacit project UCV-97-003769     

强迫下降的三项共轭梯度法

基于共轭和下降性质,提出了一种强迫下降的三项共轭梯度法,证明了算法在Wolfe线搜索下的全局收敛性,并进行了数值比较实验.理论与数值试验结果表明这个算法是一个值得研究的方法.     

一种基于程序DD图的无约束边生成算法

基于相似路径集进行软件故障定位是众多有效故障定位方法中的一种,该方法利用测试技术、程序切片和削片技术给出具体的软件故障定位报告.在实现上述方法时,求出程序DD图(Decision-to-Decision Graph)的无约束边就是关键步骤.目前,针对这一关键步骤的研究中,虽然取得了一定进展,但如何基于程序DD图生成无约束边,尚需要进一步研究.首先选用十字链表结构存储程序的DD图,进而计算出该程序DD图中各边对应的主宰树和蕴含树,在此基础上求出程序DD图中无约束边.通过实验验证,提出的无约束边生成算法是一种有效的方法.     

一种设计近似完全重构非均匀余弦调制滤波器组的新算法

该文提出了一种设计近似完全重构非均匀余弦调制滤波器组的新算法。针对现有合并算法中非均匀滤波器组性能无法直接控制优化的缺点,新算法把非均匀滤波器组的设计问题归纳为一个关于原型滤波器的无约束优化问题,其中目标函数是非均匀滤波器组传递失真与原型滤波器阻带能量的加权和,最后利用线性迭代算法求解该优化问题。理论分析和数值实验表明,新算法获得的非均匀余弦调制滤波器组比现有算法设计的滤波器组整体性能更佳。     

A spectral conjugate gradient method for solving large-scale unconstrained optimization

This paper establishes a spectral conjugate gradient method for solving unconstrained optimization problems, where the conjugate parameter and the spectral parameter satisfy a restrictive relationship. The search direction is sufficient descent without restarts in per-iteration. Moreover, this feature is independent of any line searches. Under the standard Wolfe line searches, the global convergence of the proposed method is proved when $\left|{\beta }_k\right|\le {\beta }_k^{FR}$ holds. The preliminary numerical results are presented to show effectiveness of the proposed method.     

A new scheme for unconstrained handwritten text-line segmentation

Variations in inter-line gaps and skewed or curled text-lines are some of the challenging issues in segmentation of handwritten text-lines. Moreover, overlapping and touching text-lines that frequently appear in unconstrained handwritten text documents significantly increase segmentation complexities. In this paper, we propose a novel approach for unconstrained handwritten text-line segmentation. A new painting technique is employed to smear the foreground portion of the document image. The painting technique enhances the separability between the foreground and background portions enabling easy detection of text-lines. A dilation operation is employed on the foreground portion of the painted image to obtain a single component for each text-line. Thinning of the background portion of the dilated image and subsequently some trimming operations are performed to obtain a number of separating lines, called candidate line separators. By using the starting and ending points of the candidate line separators and analyzing the distances among them, related candidate line separators are connected to obtain segmented text-lines. Furthermore, the problems of overlapping and touching components are addressed using some novel techniques. We tested the proposed scheme on text-pages of English, French, German, Greek, Persian, Oriya and Bangla and remarkable results were obtained.