Studies on the Adsorption of Asymmetrical Triblock Copolymers by Scheutjens-Fleer Theory and Monte Carlo Simulation

The adsorption of asymmetrical triblock copolymers from a non-selective solvent on solid surface has been studied by using Scheutjens-Fleer mean-field theory and Monte Carlo simulation method on lattice model. The main aim of this paper is to provide detailed computer simulation data, taking A8-kB20Ak as a key example, to study the influence of the structure of copolymer on adsorption behavior and make a comparison between MC and SF results. The simulated results show that the size distribution of various configurations and density-profile are dependent on molecular structure and adsorption energy. The molecular structure will lead to diversity of adsorption behavior. This discrepancy between different structures would be enlarged for the surface coverage and adsorption amount with increasing of the adsorption energy. The surface coverage and the adsorption amount as well as the bound fraction will become larger as symmetry of the molecular structure becomes gradually worse. The adsorption layer becomes thicker with increasing of symmetry of the molecule when adsorption energy is smaller but it becomes thinner when adsorption energy is higher. It is shown that SF theory can reproduce the adsorption behavior of asymmetrical triblock copolymers. However, systematic discrepancy between the theory and simulation still exists.The approximations inherited in the mean-filed theory such as random mixing and the allowance of direct back folding may be responsible for those deviations.     

高速色散补偿系统中喇曼放大器性能研究

利用喇曼放大器的非线性偏微分耦合方程组,对带喇曼放大器的色散补偿系统进行了仿真,并与传统的仿真方法进行了比较.结果表明:在色散完全补偿系统中,当传输速率较高时,忽略色散后的传统仿真方法的结果,与采用色散补偿技术后使整个系统色散为零的仿真结果有一定偏差,此时不能忽略色散的作用.还对前补偿系统和后补偿系统进行了研究,利用Q值性能判别法,分别得到了信号光脉冲的最佳占空比和最佳脉冲阶数.     

金纳米粒子光学性质中的尺寸和形状效应

纳米尺度的金属及半导体呈现出特殊的光学、电学及磁学性质,采用近年发展起来的离散偶极近似(DDA)的方法,我们分析了金纳米粒子的尺寸及形状对其光学性质的影响。粒子周围介质的影响在文中亦作了分析。计算结果显示,金纳米粒子的等离子体吸收带同时受到粒子尺寸和形状的影响,但来自形状的影响更为明显。与米氏理论及扩展的甘氏理论相比较,DDA方法在粒子尺寸不再远小于入射光波长的时候更准确,并能应用于任何形状的纳米粒子。理论计算与实验结果能较好的吻合。     

一种简易云雾室的制作

本文利用自制云雾室把微观粒子的运动转化为宏观现象，从而供实验观察和研究。     

Diffusive behavior of asymmetric zero-range processes

We investigate a new interpretation for the Navier-Stokes corrections to the hydrodynamic equation of asymmetric interacting particle systems. We consider a system that starts from a measure associated with a profile that is constant along the drift direction. We show that under diffusive scaling the macroscopic behavior of the process is described by a nonlinear parabolic equation whose diffusion coefficient coincides with the diffusion coefficient of the hydrodynamic equation of the symmetric version of the process.     

电站锅炉系统性能仿真模型的建立

1引言根据热力学第二定律，燃料中的化学拥将近一半损失在锅炉的燃烧与传热过程中。因此，优化锅炉性能对降低整个火电机组的煤耗率具有明显效果。完整的锅炉系统由磨煤机、送风机、一次风机、弓讯机、炉膛、汽包、过热器、再热器、省煤器、空气预热器等单元组成，这些单元之间的联结错综复杂。本文建立了锅炉系统中通用单元的性能模型，并在此基础上，对锅炉系统的结构特点进行了分析，利用过程系统工程中的序贯模块法建立了整个锅炉系统的性能模型。对单元的划分、回路的切断及断裂流股的收敛与迭代策略提出了自己的观点。最后根据生产厂…     

非共沸制冷剂R417A在水平光滑管内的沸腾传热

应用一种快速、准确的隐式格式迭代数值计算方法 ,对非共沸制冷剂 R41 7A在水平光滑管内的蒸发过程进行了数值模拟。通过应用纯质的传热公式计算后与实验值相比较 ,数值计算结果高于实验值。     

On Discrete Zariski-Dense Subgroups of Algebraic Groups

We investigate under which conditions an algebraic group G defined over a locally compact field k admitr a subgroup Γ? G(k) which is dense in the Zariski topology, but discerte in the topology induced by the locally compact topology on k. For non—solvable groups we provide a complete answer.     

一种改进的计算探测器校正因子的相关抽样方法

对于小尺寸探测器处于大块介质的情形, 在探测器的校正因子的Monte Carlo模拟中, 存在两个难题: 一是由于探测器尺寸很小粒子难以到达探测器并发生碰撞; 二是两个随机变量比值难以达到要求精度. 本文使用经过改进的粒子碰撞自动重要抽样方法, 再结合相关抽样方法, 解决了这两个难题, 并在MCNP-4C程序平台上加以实现. 除了粒子碰撞自动重要抽样以外, 还选用了其他3种方法: 直接模拟、区域分裂、强迫碰撞+Dxtran球分别与相关抽样方法结合, 对一个简化的探测器校正因子计算模型进行了计算. 实际计算结果表明, 相关抽样方法无论与哪种方法结合, 都起到了提高相关量计算效率的作用; 而它与粒子碰撞自动重要抽样结合, 比其他方法具有明显的优越性.     

Ant colony optimization: Introduction and recent trends

Ant colony optimization is a technique for optimization that was introduced in the early 1990's. The inspiring source of ant colony optimization is the foraging behavior of real ant colonies. This behavior is exploited in artificial ant colonies for the search of approximate solutions to discrete optimization problems, to continuous optimization problems, and to important problems in telecommunications, such as routing and load balancing. First, we deal with the biological inspiration of ant colony optimization algorithms. We show how this biological inspiration can be transfered into an algorithm for discrete optimization. Then, we outline ant colony optimization in more general terms in the context of discrete optimization, and present some of the nowadays best-performing ant colony optimization variants. After summarizing some important theoretical results, we demonstrate how ant colony optimization can be applied to continuous optimization problems. Finally, we provide examples of an interesting recent research direction: The hybridization with more classical techniques from artificial intelligence and operations research.