Understanding and Modeling the Effect of Surfactants in Enhanced Particle Removal from Surfaces in Aqueous Media

The removal of particulate contamination is a critical issue for many manufacturing processes. It is particularly critical to the electronics industry in which small pieces of microscopic debris remaining after chemical mechanical planarization (cmp) using submicron polishing particles can cause device failure. One way to enhance particle removal following the cmp process is to utilize surfactants. Recent research has shown ways to model the effect of surfactants on enhanced particle removal. However, previous research has not demonstrated the effect of ionic strength on enhanced particle removal associated with surfactant use. Past research has also not shown the combined effects of ionic strength and surfactant concentration on enhanced particle removal using surfactants. This article summarizes the parameters affecting particle removal, and it provides data and analysis on the effect of ionic strength as well as the combined effects of ionic strength and surfactant concentration on particle removal following cmp processing.     

油气集输系统新增产能建设拓扑优化方法研究

在油气集输新增产能建设中,为充分利用已建管网系统的处理能力,达到降低投资,提高经济效益的目的,进行了油气集输新增产能建设布局优化方法的研究。针对新建集输管网为树状结构的情况,建立了油气集输系统新增产能建设拓扑优化的数学模型,讨论了计算复杂性问题。根据模型的特点,将问题分解为拓扑级优化和几何级优化两个子问题,并通过它们之间的迭代进行求解。实例计算表明,所建立的数学模型正确,求解方法可行,能用于工程实际设计。     

Local Exact Particle Tracing on Unstructured Grids

For analyzing and interpreting results of flow simulations, particle tracing is a well established visualization method. In addition, it is a preliminary step for more advanced techniques such as line integral convolution. For interactive exploration of large data sets, a very efficient and reliable particle tracing method is needed. For wind channel experiments or flight simulations, large unstructured computational grids have become common practice. Traditional approachs, based on numerical integration methods of ordinary differential equations however fail to deliver sufficiently accurate path calculation at the speed required for interactive use. In this paper we extend the local exact approach of Nielson and Jung in such a way that it can be used for interactive particle tracing in large data sets of steady flow simulation experiments. This will be achieved by sophisticated preprocessing using additional memory. For further visual enhancement of the streamline we construct an implicitly defined smooth Bézier curve that is used for ray tracing. This allows us to visualize additional scalar values of the simulation as attributes to the trajectory and enables the display of high‐quality smooth curves without creating any visualization geometry and providing a good impression of the spatial situation at the same time. ACM CSS: I.3.3 Computer Graphics—Line and curve generation; I .3.7 Computer Graphics—Raytracing; G.1.2 Numerical Analysis—Spline and piecewise polynomial approximation     

神经网络分类器的快速构造算法

使用ＢＰ算法训练多层网络的速度很慢而且事先难于确定隐节点和隐层的适当数目。本文提出一个有效的算法，先构造决策树，然后将构造的决策树转换为神经网。文中使用一个全局准则函数控制决策树的增长，它较好地匹配了树的复杂性和训练样本量及错分率界。实验结果，本文的算法比用ＢＰ算法训练多层网络要快，而其分类精度不低于用ＢＰ算法训练的多层神经网。     

一种产生式系统的并行推理模型

1.引言 在人工智能领域中,产生式系统是一种比较有效的知识表示方法,并得到了广泛应用。目前许多较为成功的专家系统都是用产生式系统实现的~[1]。随着应用领域的不断扩士其知识座的抓橄称渐增     

红外目标精跟踪方法的研究

本文提出了一种直接把红外前视传感器的输出作为测量值来跟踪红外目标的扩展型卡尔曼滤波跟踪算法。在滤波处理时,设置可变的测量矩阵,其目的在于提高运算速度和抑制噪声干扰。通过具体的实例,对所提跟踪算法的特点和有效性进行了细致的分析。     

WKB近似下的Fourier衍射成象方法

对于介质目标微波衍射成象，本文引入了ＷＫＢ近似来模拟目标内部总场。基于这种近似，我们导出了Ｆｏｕｒｉｅｒ衍射公式，并采用了广义滤波逆传播方法由目标空间谱实现目标特性的重建。计算机模拟结果表明采用ＷＫＢ近似重建目标特性较Ｂｏｒｎ近似有明显改善。     

Using internal fibre geometry to improve the performance of pin-loaded holes in composite materials

The anisotropic nature of fibre reinforced composites leads to large stress concentrations around pin-loaded holes through standard weave cloths. Proper understanding of how this anisotropic nature affects the load distribution around holes can be utilised to reduce these concentrations if sufficient thought is given to the internal fibre geometry near to the hole. Such local reinforcements need not be highly complex and can be readily produced without excessive effort, producing significant improvements in performance.     

The pickup and delivery problem: Faces and branch-and-cut algorithm

This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented.