运用EXCEL函数进行拉丁方设计

拉丁方设计是科学试验和加工工艺研究中经常用到的试验设计方法,本文通过对拉丁方设计中的配对设计进行实质的分析,提出了运用EXCEL进行拉丁方设计的方法。结果认为,灵活利用Excel的随机函数如RAND、RANDOMBETWEEN等和排序按钮可以快速地进行拉丁方设计。     

时思寺古建筑群个案探究——景宁县大漈乡古建筑调研

建筑是对人类历史与文明的反映,一个国家的建筑史就是一个国家文明的发展史。与西方国家相比我国存世的古建筑资源相对贫乏。景宁县周边村落的这些古老的建筑是我国存世不多的古建筑其中的一部分,如何去研究开发它们,保护好它们,让它们能继续地存活下来,需要我们去努力。     

The Local Artificial Boundary Conditions for Numerical Simulations of the Flow Around a Submerged Body

We consider in this work the numerical approximations of the two-dimensional steady potential flow around a body moving in a liquid of finite constant depth at constant speed and distance below a free surface. Several vertical segments are introduced as the upstream and the downstream artificial boundaries, where a sequence of high-order local artificial boundary conditions are proposed. Then the original problem is solved in a finite computational domain, which is equivalent to a variational problem. The numerical approximations for the original problem are obtained by solving the variational problem with the finite element method. The numerical examples show that the artificial boundary conditions given in this work are very effective.     

Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines

Ordered binary decision diagrams are the state-of-the-art representation of switching functions. In order to keep the sizes of OBDDs tractable, heuristics and dynamic reordering algorithms are applied to optimize the underlying variable order. When finite state machines are represented by OBDDs the state encoding can be used as an additional optimization parameter. In this paper, we analyze local encoding transformations which can be applied dynamically. First, we investigate the potential of re-encoding techniques. We then propose the use of an XOR-transformation and show why this transformation is most suitable among the set of all encoding transformations. The presented theoretical framework establishes a new optimization technique for OBDDs.     

动态系统的常微分方程组建模—基于不同搜索技术的实验研究

以人口模型和化学反应模型为例,通过大量实验研究比较了分别采用基于两种传统的搜索方法即局部搜索算法和模拟退火算法、遗传算法（简称GA）四者相结合的14种不同算法建立动态系统的常微分方程组模型的实验结果,得到了有关各算法性能比较的一些新的结论。两个实例的实验结果表明：在14种算法中,GP＋GA＋LS－MU算法（即在采用GP的模型结构的优化过程中嵌入采用GA的模型参数的优化过程,并且在每一演化代对种群中的部分个体进行基于GP的标准变异算子产生邻域解的局域搜索过程）是目前解决常微分方程组建模问题的最好算法。     

解Hamilton-Jacobi方程的无振荡局部加密方法

０．引 言 近年来,Ｈａｍｉｌｔｏｎ－Ｊａｃｏｂｉ方程（简称Ｈ－Ｊ方程）的数学理论与数值逼近已引起人们越来越多的关注．Ｈ－Ｊ方程不仅在原有的领域例如控制论、微分几何等有非常重要的应用［８］,而且不断开拓新的应用领域,例如用于网格生成［５］以及流体界面的水平集方法计算 ［９,１２,１３,１５］等．由于 Ｈ－Ｊ方程解的导数会出现间断,导致解曲面（线）出现尖点或纽结等现象［７］,故如何做到既节省计算时间,又能在光滑区域高精度数值求解和较好地分辨间断是一个十分重要的问题．文卜］通过在每个坐标方向构造单变量的…     

Asymptotic Fourier Coefficients for a C∞ Bell (Smoothed-“Top-Hat”) & the Fourier Extension Problem

In constructing local Fourier bases and in solving differential equations with nonperiodic solutions through Fourier spectral algorithms, it is necessary to solve the Fourier Extension Problem. This is the task of extending a nonperiodic function, defined on an interval , to a function which is periodic on the larger interval . We derive the asymptotic Fourier coefficients for an infinitely differentiable function which is one on an interval , identically zero for , and varies smoothly in between. Such smoothed “top-hat” functions are “bells” in wavelet theory. Our bell is (for x ≥ 0) where where . By applying steepest descents to approximate the coefficient integrals in the limit of large degree j, we show that when the width L is fixed, the Fourier cosine coefficients a _j of on are proportional to where Λ(j) is an oscillatory factor of degree given in the text. We also show that to minimize error in a Fourier series truncated after the Nth term, the width should be chosen to increase with N as . We derive similar asymptotics for the function f(x)=x as extended by a more sophisticated scheme with overlapping bells; this gives an even faster rate of Fourier convergence     

有效生成饰带群混沌吸引子参数的改进优生遗传算法

本文将蒙特卡罗搜索法与优生遗传算法应用于构造饰带群等价映射模型p112与模型p1a1混沌吸引子,并针对“遗传漂移”现象提出了改进的优生遗传算法．研究表明,在参数空间中引入空间距离的限制,可以由初始种群参数向量搜索出无重复参数向量的子代参数集合．在进化的种群中,也无重复混沌吸引子参数向量,从而避免了原有优生遗传算法在种群中出现的“遗传漂移”现象．新算法实现了种群中的参数无重复地不断更新,利用更新的种群在参数空间上能够持续地搜索出无重复图形结构的混沌吸引子参数向量,解决了原优生遗传算法无法持续有效生成新的混沌吸引子参数向量的问题．     

区域车辆信息管理系统建设设想

充分利用计算机技术和Internet技术,开展车辆管理和网上服务已成为一种发展趋势,重点介绍了区域车辆信息管理系统的建设设想及软件体系构架。     

网络存储技术的探讨

本文介绍了传统的依赖服务器存储的缺陷以及网络存储的现状,对附网存储及存储局域网技术进行了论述,把二者进行了比较,并总结出了二者优势和缺点,最后介绍存储局域网和附网存储的应用。