TRIP带钢轧后冷却过程温度场的有限元模拟

应用有限元模拟仿真计算，对相变诱发塑性(TRIP)带钢在连轧机精轧后由850～890℃快冷至700℃，经几秒钟短暂空冷再第2次快速水冷至卷取温度400℃的冷却过程的温度进行了分析计算。分析结果得出，3mmTRIP带钢厚度方向的温差较小，而8mmTRIP带钢厚度方向温差明显增大。因此TRIP带钢在2次快速冷却后和卷取前应有适当的空冷时间以降低TRIP带钢卷取时表面和厚度方向中心处的温度差。     

CCD传感器实时检测系统在微细电火花加工机床上校正法的研究

CCD(Charge-Couple Device)传感器实时检测系统是一套基于光电检测技术的质量监测仪器,可用于实时观测和测量被加工工件,特别适合安装应用于微细电火花加工机床.本文就该系统安装在电火花加工机床上后如何提高检测精度进行研究,提出了3种方法对该检测系统进行校正,如,整体校准常数、C值校正、D值校正.此后设计实验来检验校准后该系统的稳定性和精确度,从而验证了所提出的三步校正法的可靠性.     

Optimization of abrasive water jet cutting of ductile materials

Full factorial design of experiments was developed in order to investigate the effects of jet pressure, abrasive mixing rate, cutting feed, and plate thickness upon three response variables, surface finish of cutting wear zone, percentage proportion of striation free area, and maximum width of cut. The set of sixteen experiments was performed on each of the following two ductile materials: AISI 4340 (high strength low alloy steel, hardened to 49HRc) and Aluminum 2219. Analysis of Variance (ANOVA) was performed on experimental data in order to determine the significance of effects of different parameters on the performance measures. It was found that cutting feed and thickness were highly influential parameters, while abrasive mixing rate is influential upon surface roughness only. Strong interaction was found between jet pressure and workpiece material. Multi-criteria numerical optimization was performed in order to simultaneously maximize/minimize different combinations of performance measures.     

DCAF: An MPEG-21 Dynamic Content Adaptation Framework

Universal Multimedia Access aims at providing a gratifying end user-experience by either adapting the content, be it static or dynamic, to suit the usage environment or adapting the usage environment, be it client- or server-centric, to suit content. This paper presents our MPEG-21 Dynamic Content Adaptation Framework, acronym DCAF, which uses a fusion of Genetic Algorithms and Strength Pareto Optimality to adapt content in order to suit the usage environment.

Procedural Synthesis using Vortex Particle Method for Fluid Simulation

We propose a fast and effective technique to improve sub‐grid visual details of the grid based fluid simulation. Our method procedurally synthesizes the flow fields coming from the incompressible Navier‐Stokes solver and the vorticity fields generated by vortex particle method for sub‐grid turbulence. We are able to efficiently animate smoke which is highly turbulent and swirling with small scale details. Since this technique does not solve the linear system in high‐resolution grids, it can perform fluid simulation more rapidly. We can easily estimate the influence of turbulent and swirling effect to the fluid flow.     

Subharmonic Resonance Behavior for the Classical Hydrogen Atomic System

Previously unexplored resonance conditions are shown to exist for the classical hydrogen atomic system, where the electron is treated as a classical charged point particle following the nonrelativistic Lorentz-Dirac equation of motion about a stationary nucleus of opposite charge. For circularly polarized (CP) light directed normal to the orbit, very pronounced subharmonic resonance behavior is shown to occur with a variety of interesting properties. In particular, only if the amplitude of the CP light exceeds a critical value, will the resonance continue without radius and energy decay. A perturbation analysis is carried out to illustrate the main features of the behavior. The present phenomena adds to a growing list of other nonlinear dynamical behaviors of this simple system, that may well be important for more deeply understanding classical and quantum connections.     

Artistic features extraction from chinese calligraphy works via regional guided filter with reference image

Chinese calligraphy is a unique visual art, and and is one of the material basis of China’s traditional cultural heritage. However, time had caused the old calligraphy works to weathering and damages, so it is necessary to utilize advanced technologies to protect those works. One of those technologies is digital imaging, and the obtained images by digital imaging can preserve the visual information of calligraphy works better, furthermore, they can be used in further researches. While the basic works for those researches are to extract the artistic features which include two elements, i.e., form and spirit. However, most of the existing methods only extract the form and ignore the characters’ spirit, especially they are insensitive to the slight variation in complex ink strokes. To solve these problems, this paper proposes an extraction method based on regional guided flter (RGF) with reference images, which is generated by KNN matting and used as the input image for RGF. Since RGF is sensitive to the slight variation of ink, so the detailed information of the inside of strokes can be detected better. Besides, unlike the past works, which filter the whole strokes, RGF filters the inside of strokes and edges in different windows respectively, which results in that the edges are preserved accurately. Results from a deployment of several famous Chinese calligraphy works demonstrate that our method can extract more accurate and complete form and spirit with lower error rate.     

Approximation Algorithms for <Emphasis Type="Italic">k</Emphasis>-hurdle Problems

The polynomial-time solvable k-hurdle problem is a natural generalization of the classical s-t minimum cut problem where we must select a minimum-cost subset S of the edges of a graph such that |p∩S|≥k for every s-t path p. In this paper, we describe a set of approximation algorithms for “k-hurdle” variants of the NP-hard multiway cut and multicut problems. For the k-hurdle multiway cut problem with r terminals, we give two results, the first being a pseudo-approximation algorithm that outputs a (k−1)-hurdle solution whose cost is at most that of an optimal solution for k hurdles. Secondly, we provide a 2(1-\frac1r)2(1-\frac{1}{r})-approximation algorithm based on rounding the solution of a linear program, for which we give a simple randomized half-integrality proof that works for both edge and vertex k-hurdle multiway cuts that generalizes the half-integrality results of Garg et al. for the vertex multiway cut problem. We also describe an approximation-preserving reduction from vertex cover as evidence that it may be difficult to achieve a better approximation ratio than 2(1-\frac1r)2(1-\frac{1}{r}). For the k-hurdle multicut problem in an n-vertex graph, we provide an algorithm that, for any constant ε>0, outputs a ⌈(1−ε)k⌉-hurdle solution of cost at most O(log n) times that of an optimal k-hurdle solution, and we obtain a 2-approximation algorithm for trees.