UBET-based numerical modeling of bulk deformation processes

The paper summarizes the development of numerical procedures for modeling bulk deformation process and preform designing techniques based on the upper bound elemental technique (UBET). UBET has a unique place where an approximate, but faster solution is needed for decision making. In designing and optimizing multistage forging and profile ring-rolling processes, an approximate solution can be used to identify the most influential process parameters. Once an optimum combination of process conditions are determined, computationally intensive, but more accurate finite element analysis can be used to verify and refine results. In this paper, UBET procedures for closed-die forging and profile ring rolling are high-lighted. Experimental investigations are used to validate the model predictions. Also, the UBET-based preform design tool is presented as a process and die design tool for multistage forging processes. Application of these techniques is presented with evidence of effective material usage and extended overall die-life.     

基于遗传算法优化铣削用量的数控加工仿真系统的研究

遗传算法是一种模拟生物界自然选择和自然遗传机制的自适应搜索和优化方法,在搜索优化问题的全局或全局附近的最优解上具有良好的优势条件.文章建立了基于遗传算法思想的铣削用量多目标智能优化的数学模型及其数控加工动态仿真系统,运用遗传优化方法对铣削加工实例进行优化,并在数控加工动态仿真系统上验证了铣削用量多目标智能优化的数学模型的正确性和实用性.     

金属液体凝固中直接挤压过程的数值模拟

根据稳定的交替方向隐式（ＳＡＤＩ）有限差分方法、上限元法（ＵＢＥＴ）等数值计算方法提出了一种数值模拟方法．使用这种方法成功地模拟了融凝固和大塑性变形为一体的金属液体凝固过程中直接挤压（简称液体挤压）的工艺过程．计算机生成的动画图象直观地表现了工件的整个成型过程．模拟结果有助于掌握液体挤压这一新工艺的各种工艺规律．     

系统失效的分支-界限分析法及其在桁架可靠性分析中的应用

本文首先介绍了系统失效的分支-界限分析法，然后以空间桁架系统为例用分支-界限分析法进行了可靠性分析。系统失效的分支-界限分析法直观、明了，适合对实际工程中的复杂系统进行可靠性分析。     

基于遗传算法的车间设备布局优化设计

文章针对某厂曲轴生产车间设备布局问题采用遗传算法进行优化设计.首次提出了搬运矩概念,很好的解决了生产多种工件的车间设备布局优化问题.优化设计结果符合生产实际要求.     

环件开式辗扩力和力矩计算

用上限法分析了环件开式辗扩变形，导出了辗扩力和力矩计算公式，阐述了辗扩力和力矩与辗扩进给速度的关系。根据环件辗扩实验结果，对文中的辗扩力和力矩计算公式进行了验证。     

Greedily computing associative aggregations on sliding windows

We present an algorithm for combining the elements of subsequences of a sequence with an associative operator. The subsequences are given by a sliding window of varying size. Our algorithm is greedy and computes the result with the minimal number of operator applications.     

Guided Volume Editing based on Histogram Dissimilarity

Segmentation of volumetric data is an important part of many analysis pipelines, but frequently requires manual inspection and correction. While plenty of volume editing techniques exist, it remains cumbersome and errorprone for the user to find and select appropriate regions for editing. We propose an approach to improve volume editing by detecting potential segmentation defects while considering the underlying structure of the object of interest. Our method is based on a novel histogram dissimilarity measure between individual regions, derived from structural information extracted from the initial segmentation. Based on this information, our interactive system guides the user towards potential defects, provides integrated tools for their inspection, and automatically generates suggestions for their resolution. We demonstrate that our approach can reduce interaction effort and supports the user in a comprehensive investigation for high‐quality segmentations.     

Computing Minimum Area Homologies

Calculating and categorizing the similarity of curves is a fundamental problem which has generated much recent interest. However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on the quality of the measure. In this paper, we present a similarity measure for any two cycles that are homologous, where we calculate the minimum area of any homology (or connected bounding chain) between the two cycles. The minimum area homology exists for broader classes of cycles than previous measures which are based on homotopy. It is also much easier to compute than previously defined measures, yielding an efficient implementation that is based on linear algebra tools. We demonstrate our algorithm on a range of inputs, showing examples which highlight the feasibility of this similarity measure.     

基于混合遗传算法的去耦电容网络设计

结合基于目标阻抗的设计方法,将混合遗传算法应用于PDN(电源分配网络)的去耦电容网络设计,对所需去耦电容器的种类和数目进行优化计算,同时与标准遗传算法和传统设计方法进行对比,借助Cadence电源完整性仿真工具验证设计结果的有效性和合理性。避免了传统设计需要借助EDA工具进行反复修改和验证的繁琐过程,同时减少了设计冗余,节省了PCB布局布线空间,为高频电路的PDN设计提供参考。