C~k连续的保形插值2k 1次样条函数

1．预备知识样条函数的保形插值已有很多研究工作[1-4]，以前主要研究C1连续保形插值二次和三次样条函数。［3］给出了一种C2连续的保形插值四次样条函数，并推广到C‘（k三2）连续的保形插值Zk次样条函数．遗憾的是对于保形插值Zk＋l次样条函数并没有加以讨论．本文首先构造了一种C’保形插值五次样条函数，并且推广到C‘连续的Zk＋1次保形插值样条函数，而在节点处的导数取法不同于［3］．这样得到的保形插值样条的计算量更小，且容易编程序上机计算．定义1．设／（。）在［a，b］上有定义，称n次多项式为函数f（）在［a；b］上的n次B…     

B样条曲面GC~1拼接中连接函数性质及其应用

为了方便地实现B样条曲面建模,讨论了一般节点下2张B样条曲面G2连续条件中连接函数的性质,以及连接函数、本征方程和公共边界的相互约束关系.通过分析连接函数存内节点上的连续性质,提出了一种用B样条函数为连接甬数的B样条曲面G1连续拼接方法.最后以分段二次连接函数为例,实现了双三次B样条曲面的G1连续拼接.该方法由于采用了重节点,释放了公共边界的自由度,使得曲面拼接更为灵活.     

基于局部梯度特征的自适应多结点样条图像插值

为了获得质量更好的插值图像，提出了一种新的C^2。连续的支撑区间为（-2，2）的三次多结点样条插值核函数．通过增加结点带来的自由度构造了多结点样条插值公式；分析了在适当的边界条件和约束下三次多结点样条插值的逼近阶；将一维多结点样条插值算法推广到二维，建立了用于图像数据的插值公式；如果忽视图像的局部特征，通常双三次多结点样条插值图像的边缘会有模糊的现象，为此。对多结点样条插值应用逆梯度，得到了自适应多结点样条插值算法；实验所得误差图像和实验所得图像的峰值信噪比也证实了用自适应多结点样条插值算法重建的图像具有更高的质量．     

导航随机微分模型的三次样条插值求解探索

提出一种用三次样条插值逼近导航系统状态概率密度函数的方法．导航随机微分模型的弱解由前向Kolmogorov方程表示,其解析解很难求得．本文通过三次样条插值函数来逼近其解可得到状态的先验概率密度函数,再由Bayes公式得到状态的后验概率密度函数,解决了构造三次样条插值条件的难点问题,并以水下潜器组合导航系统为背景,与粒子滤波方法进行性能对比分析,仿真结果验证了三次样条插值逼近导航随机微分模型解析解的可行性．     

最短三次样条插值研究

在分析了样条函数插值基础上，提出最短三次样条插值问题，并提出了该问题的解法，最后给出了一个实例。     

基于三次样条函数拟合的过程神经元网络训练

过程神经元网络的提出为大样本识别问题开辟了新途径，但其训练方法目前主要基于权函数正交基展开。这种方法基函数个数选取目前尚无理论依据。提出了基于三次样条函数拟合的过程神经元网络训练方法。首先将样本函数、过程神经元权函数的离散化数据拟合成分段表示的三次样条函数，然后计算样本样条函数与权值样条函数乘积在给定采样区间上的积分，并将此积分值提交给网络的过程隐层神经元，输出层由普通神经元组成。三次样条函数具有很好的光滑性、可积性、阶数低、参数少等优点，有效地简化了网络的时空聚合运算。实验表明该方法是可行的。     

三次样条构造的伪逆解法

为了提高三次样条构造的可行性, 基于矩阵的伪逆方法, 提出一种不依赖额外约束条件的三次样条构造的伪逆解法。该解法通过求解出三次样条二阶导数的最小范数解, 从而较好地构造出三次样条函数。理论分析及数值实验结果表明该三次样条构造的伪逆解法具有简单、有效等特点。综合分析各种构造解法的性质, 对各种三次样条构造解法进行归类比较, 为在实际工程计算应用中选择合适的三次样条构造解法提供了指导方向。     

三次Cardinal样条函数的自由参数优化方案

为了合理地取定三次Cardinal样条函数所含的自由参数,讨论了插值问题中三次Cardinal样条函数所含自由参数的优化问题。首先分析了自由参数对三次Cardinal样条函数曲线形状的影响,然后给出了数据插值与函数逼近这2种情形下自由参数最优取值的计算方案,分别得到了具有极小二次平均振荡与极小逼近误差的三次Cardinal样条函数。当需要构造具有良好形状保持效果或逼近效果的三次Cardinal样条函数时,可通过所提出的方案选取自由参数的最优取值。     

多层积分值三次样条拟插值

目的 在实际问题中,某些插值问题结点处的函数值往往是未知的,而仅仅知道一些连续等距区间上的积分值。为此提出了一种基于未知函数在连续等距区间上的积分值和多层样条拟插值技术来解决函数重构。该方法称之为多层积分值三次样条拟插值方法。方法 首先,利用积分值的线性组合来逼近结点处的函数值;然后,利用传统的三次B-样条拟插值和相应的误差函数来实现多层三次样条拟插值;最后,给出两层积分值三次样条拟插值算子的多项式再生性和误差估计。结果 选取无穷次可微函数对多层积分值三次样条拟插值方法和已有的积分值三次样条拟插值方法进行对比分析。数值实验印证了本文方法在逼近误差和数值收敛阶均稍占优。结论本文多层三次样条拟插值函数能够在整体上很好的逼近原始函数,一阶和二阶导函数。本文方法较之于已有的积分值三次样条拟插值方法具有更好的逼近误差和数值收敛阶。该方法对连续等距区间上积分值的函数重构具有普适性。     

插值曲线区域控制的加权有理插值方法

将插值曲线约束于给定的区域之内是曲线形状控制中的重要问题,文中利用分母为线性的有理三次插值样条和仅基于函数值的有理三次插值样条构造了一种加权有理三次插值样条,由于这种有理三次插值样条中含有新的参数,给约束控制带来了方便,给出了将插值曲线约束于给定的折线、二次曲线之上（下）或之间的条件,最后给出了数值例子。     

Real-time adaptive fluid simulation with complex boundaries

In this paper, we present a new adaptive model for real-time fluid simulation with complex boundaries based on Smoothed Particle Hydrodynamics (SPH) framework. Firstly, we introduce an adaptive SPH framework that is based on our character field function composed of four factors: geometrical complexity, boundary condition, physical complexity, and complementary condition in terms of the neighboring particle number. Meanwhile, the rule for particle adaptation is presented. We also present a two-step method to fast detect collision with complex boundary. The first step is voxelization on the complex scene. In the second step, based on the result of voxelization, we propose a three-phase method to fast detect collisions between complex boundaries and particles. By using this method, we avoid most of the useless intersection detection computation and greatly enhance the computation efficiency. In addition, a subdivision of boundary is precomputed before the collision interaction method so that fluid in a scene with complex boundary can still be simulated at relatively high speed and system stability risk is reduced greatly. To further accelerate the simulation, a highly parallel fluid algorithm is presented and implemented using GPU so that we can simulate dynamic fluid with mutual interaction between fluid and complex boundary at a considerably fast speed without compromising realism.     

An automatic time-stepping algorithm for dynamic problems

The paper discusses algorithms for automatic computation of time steps in discrete integration of dynamic problems. Objective criteria for performance and guidelines for making an algorithm practically applicable are suggested. A set of parameters for characterizing the dynamic response of a system is proposed, this includes a ‘current frequency’, a ‘current period’, and a ‘dynamic stiffness parameter’. An algorithm for automatic computation of the time step based on the current period is outlined. Aspects of adapting this algorithm to special types of applications are discussed, this involves use of a ‘tuning function’. Several examples of applications are given.     

Automatic clustering algorithm based on multi-objective Immunized PSO to classify actions of 3D human models

Multi-objective clustering algorithms are preferred over its conventional single objective counterparts as they incorporate additional knowledge on properties of data in the from of objectives to extract the underlying clusters present in many datasets. Researchers have recently proposed some standardized multi-objective evolutionary clustering algorithms based on genetic operations, particle swarm optimization, clonal selection principles, differential evolution and simulated annealing, etc. In many cases it is observed that hybrid evolutionary algorithms provide improved performance compared to that of individual algorithm. In this paper an automatic clustering algorithm MOIMPSO (Multi-objective Immunized Particle Swarm Optimization) is proposed, which is based on a recently developed hybrid evolutionary algorithm Immunized PSO. The proposed algorithm provides suitable Pareto optimal archive for unsupervised problems by automatically evolving the cluster centers and simultaneously optimizing two objective functions. In addition the algorithm provides a single best solution from the Pareto optimal archive which mostly satisfy the users' requirement. Rigorous simulation studies on 11 benchmark datasets demonstrate the superior performance of the proposed algorithm compared to that of the standardized automatic clustering algorithms such as MOCK, MOPSO and MOCLONAL. An interesting application of the proposed algorithm has also been demonstrated to classify the normal and aggressive actions of 3D human models.     

模拟集成电路三维互连电容的改进层次式提取

层次式直接边界元方法可一次性计算出整个互连寄生电容矩阵,具有较高的计算效率．针对模拟集成电路的特点,对层次式三维电容提取的三维块切割方式、非均匀边界元划分和程序组织等方面进行了改进,显著地提高了算法的效率．数值实验表明,改进的层次式互连电容提取在保证高精度的同时,速度提高了数倍,适用于实际的模拟集成电路设计．     

面向信息检索的概念关系自动构建

概念之间的依存分析是提高信息检索性能的关键。相比概念关系的强弱而言,识别关系的类型更有意义。本文在Bootstrapping框架下,以“(地理)领属”,“(实体)功能”和“(动作)对象”三种语义关系类型为例,获得了构建上下文中两个概念特定关系的语义模板,并开发了一个名为SPG的系统。本文的工作: (1)引入了生物信息计算中序列比对的方法两两生成相似上下文的模板;(2)定义了新的模板评价机制估计模板的置信度。就这三种概念关系的识别而言,SPG获得的模板集合相比DIPRE系统获得了更高的正确率和覆盖能力。     

Electrostatic force computation for bio-molecules on supercomputers with torus networks

We present an application of the Ewald algorithm for electrostatic force computation on a supercomputer with a torus network, like those on QCDOC and BlueGene/L. Typical bio-molecular systems have thousands, possibly millions of atoms interacting, with simulation time ranging from microseconds to milliseconds. The most dominant time consuming calculation for bio-molecules is the electrostatic interactions. The importance of an efficient all-gather method is discussed, in particular for QCDOC since it does not have a network specific for global communication like the tree network on BlueGene/L. In addition, we demonstrate the ability for QCDOC to run non QCD (Quantum Chromodynamics) applications, in particular, electrostatic force computation on bio-molecules.     

Interactive Boundary Computation of Boolean Combinations of Sculptured Solids

We present algorithms and systems for interactive boundary computation of Boolean combinations of sculptured solids. The algorithm is applicable to all spline solids and computes an accurate boundary representation. To speed up the computation, the algorithm exploits parallelism at all stages. It has been implemented on a multi-processor SGI and takes one second on average per boolean operation to compute the boundary of high degree primitives. The system has also been integrated with an immersive design and manipulation environment. The resulting system is able to interactively evaluate boundaries of the models, display them for model validation and place them at appropriate position using collision detection algorithms.     

A grid generator for 3-D explosion simulations using the staircase boundary approach in Cartesian coordinates based on STL models

In this paper, an automatic grid generator based on STL models is proposed. The staircase boundary treatment is implemented to handle irregular geometries and the computation domain is discretized using a regular Cartesian grid. Using the grid generator, staircase grids that are suitable for fast and accurate finite difference analysis could be generated. Employing the slicing algorithm in RP technologies [1], the STL models are sliced with a set of parallel planes to generate 2D slices after the STL files obtained from a CAD system undergo topology reconstruction. To decrease the staircase error (increase accuracy) and enhance working efficiency, the cross-section at the middle of the layer is taken to represent the cross-section of whole layer. The scan line filling technique of computer graphics [2] is used to achieve grid generation after slicing. Finally, we demonstrate an application of the introduced method to generate staircase grids, which allows successful FDM simulation in the field of explosion. The example shows that the automatic grid generator based on STL models is fast and gives simulation results that are in agreement with practical observations.     

模拟器采样工具设计与实现

采样技术作为一种高效的模拟器加速手段,目前已得到广泛的应用。但采样技术通常需要使用大量的数据分析算法,因此,如何方便快捷地集成采样技术所需的各种算法,不仅可以让采样技术更加简单易用,也能够提高对新采样技术的评估效率。设计并实现了针对采样技术的自动化工具,该工具可以让用户自己设计采样算法,并且能自动且高效地完成采样算法的分析。实验数据表明,该工具能自动且高效地完成采样算法的分析,同时具有运算速度快、可扩展性强等优点。