抗弹陶瓷的犁削机理和自锐作用研究

研制了铬刚玉抗弹陶瓷，其抗弹能力比标准均质钢有很大的提高，通过分析讨论，其主要抗弹机制为犁削机理和自锐作用。     

基于Windows Phone平台的移动项目开发

Windows Phone是微软在2010年10月发布的一款手机操作系统,它将微软旗下的Xbox Live游戏、Xbox Music音乐与独特的视频体验整合至手机中。为了更好地了解这个平台的开发,用C#语言在此系统下开发了一款关于中国文化的手机应用——《瓷Online》。主要介绍了Windows Phone手机应用开发的主要流程和在开发过程中所用到的编程技术。通过多次测试之后,将其上传到Windows Phone应用商店。通过下载量表明,此移动平台具有不错的市场。     

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.     

Some new error inequalities for a generalized quadrature rule of open type

Some new error inequalities for a generalized quadrature rule of open type are established. Especially, two sharp inequalities are derived when n is an odd and an even integer, respectively.     

A coupling algorithm for partitioned solvers applied to bubble and droplet dynamics

Bubbles and droplets both consist of a liquid in contact with a gas. In this paper, we consider the interface between the incompressible liquid and the gas as a zero thickness structure. The position of the interface is determined by the equilibrium between surface tension effects and the fluid pressure difference across the interface. So, the structure interacts with the fluids on either side. The behaviour of a limited number of bubbles and droplets can therefore be simulated as a Fluid-Structure Interaction (FSI) problem.Most existing techniques frequently used for studying bubble and droplet dynamics, such as Level Set or Volume Of Fluid, use monolithic schemes. The flow on both sides of the interface and the position of the interface are calculated in a single code. In this contribution, a partitioned approach is presented. The position of the interface is calculated with a structural solver. Given a displacement of the interface, a separate flow solver calculates the flow on the liquid side of the interface with the Arbitrary Lagrangian-Eulerian (ALE) technique. The structural solver uses a reduced order model of the flow solver to obtain implicit coupling between both solvers. This reduced order model is built up during the coupling iterations of a time step. Grid and time converged solutions of two axisymmetric problems are calculated: an oscillating water droplet in air and the growth and detachment of an air bubble from the outlet of a vertical needle, submerged in quiescent water.     

嵌入式软件可靠性仿真测试环境框架

提出了一种针对嵌入式软件进行可靠性测试的仿真测试环境框架。分析了仿真测试环境的系统特性并对其功能组件进行了介绍，对测试环境中的测试运行时组件进行了功能需求的分析，构建出测试运行时组件的框架实现，借助于UML中的抽象类图和顺序图描述对框架的静态特征和动态特征作了介绍，总结了利用框架实现仿真测试环境的优势。     

Upper Bound Analysis of Turning Using Sharp Corner Tools

A generalized upper bound model of turning operations using flat-faced sharp corner tools with both the side and end cutting edges engaged in cutting is described. The projection of the uncut chip area on the rake face plane is divided into a few regions separated by lines parallel to the chip flow direction at transition points. The area of each of these regions is transformed to the area of the corresponding regions of the shear surface using the ratio of the shear speed to the chip speed. Summing up the area of these regions, the total shear surface area is obtained. The tool-chip contact length at vertices is obtained from the length along the shear surface using the similarity between orthogonal and oblique cutting in the “equivalent” plane (the plane formed by the cutting velocity and chip velocity). Knowing the tool-chip contact length, the friction area is calculated. The chip flow angle and chip speed are obtained by minimizing the cutting power with respect to both these variables. Comparison of the chip flow angle predicted by the current model with the chip flow angle measured by direct high speed photography of the chip motion over the tool rake face shows good correlation between the two for various tool geometries and cutting conditions. The shape of the shear surface and the chip cross section predicted by the model are also presented.     

Imageware逆向建模中特征边界线的构建方法

Imageware是当前应用最为广泛的逆向建模系统之一,它是一个非参数化的交互式建模工具.在这个工具下,如何从复杂点云数据中有效提取特征边界曲线决定着逆向建模的进程.本文提出了针对于Imageware逆向建模系统的逆向特征分类思想,在此基础上,总结并提出了三种构建特征边界的方法:基于点云曲率彩图的尖角特征法、基于截面特征曲线元的特征点提取法和特征边界线的直接交互构造法.     

Hierarchical mesh segmentation based on fitting primitives

In this paper, we describe a hierarchical face clustering algorithm for triangle meshes based on fitting primitives belonging to an arbitrary set. The method proposed is completely automatic, and generates a binary tree of clusters, each of which is fitted by one of the primitives employed. Initially, each triangle represents a single cluster; at every iteration, all the pairs of adjacent clusters are considered, and the one that can be better approximated by one of the primitives forms a new single cluster. The approximation error is evaluated using the same metric for all the primitives, so that it makes sense to choose which is the most suitable primitive to approximate the set of triangles in a cluster. Based on this approach, we have implemented a prototype that uses planes, spheres and cylinders, and have experimented that for meshes made of 100 K faces, the whole binary tree of clusters can be built in about 8 s on a standard PC. The framework described here has natural application in reverse engineering processes, but it has also been tested for surface denoising, feature recovery and character skinning.     

保持拓扑和尖角特征的网格简化算法

提出了一种有效的保持拓扑和尖角特征的网格简化算法。由于曲率刻画了模型的尖角特征，该文利用顶点曲率的高斯加权函数对经典边折叠算法的二次误差测度矩阵进行了修正，增强了尖角点对新点位置的影响。鉴于网格的拓扑保持具有重要的工程应用，论述了网格简化中各种可能的拓扑错误，并给出了相应的解决措施。平衡二叉树和半边匹配数据结构的引入，提高了拓扑信息重建的速度。最后，几个网格简化实例显示了该文算法的有效性。