基于DNA序列的计算技术

DNA计算是由生物学和计算机科学相互结合形成的交叉学科,该文将对此学科的发展进行介绍。首先介绍如何借助于处理DNA序列的方法来解决卖货郎问题,并以此表明DNA计算的可行性;再对DNA的切片重组系统和图灵机系统进行比较,以此说明用切片重组系统来实现图灵机功能的可行性,最后简单介绍待解决的问题.     

Computing on Sequences of Embedded Intervals

What will prevent most users to turn from standard arithmetic to interval arithmetic is the common belief that on any real-life program, interval arithmetic will return most pessimistic bounds to their problem. Although some adequate set of refinements usually yields satisfactory results with interval arithmetic, an interval-novice would most certainly not spend the time to look into the details and learn about his code mathematic peculiarities.We present in this work the prototype of a software library that deals almost transparently with intervals. Directly from its model of execution, the library is able to automatically decide to refine a part or the totality of an evaluation as it is needed. We also introduce a new technique based on an extended number representation that even improves the performances of the library and reduces the interval computed after a numerical evaluation.     

Algorithms For Computing Approximate Repetitions In Musical Sequences

Here we introduce two new notions of approximate matching with application in computer assisted music analysis. We present algorithms for each notion of approximation: for approximate string matching and for computing approximate squares.     

Interpolating optimizing process control

A new model-based optimizing controller for a set of nonlinear systems is proposed. The nonlinear model set is based on a convex combination of two bounding linear models. An optimal control sequence is computed for each of the two bounding models. The proposed control algorithm is based on a convex combination of the two control sequences. A novel feature in these two optimizations is an added constraint related to the feasibility of the ‘other’ bounding model. The control algorithm can for example be used in model predictive control. We provide robust feasibility guarantees and an upper bound on the optimal criterion if the bounding models are linear FIR models. Further, simulation examples demonstrate significant feasibility improvements in the case where the bounding models are general linear state-space models. The proposed method guarantees robust feasibility for a 1-step ahead prediction in the general case. This can be of interest in MPC applications.     

A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences

We present in this article a linear time and space method for the computation of the length of a repeated suffix for each prefix of a given word p . Our method is based on the utilization of the factor oracle of p which is a new and very compact structure introduced in [1], used for representing all the factors of p . We exhibit applications where our method really speeds up the computation of repetitions in words.     

正交紧支撑插值多小波的设计

介绍一种正交紧支撑插值多小波函数的设计方法。它利用变换将一般的多小波自适应信号变换为一个正交紧支撑插值多小波,从而使信号的均匀采样点和理论多小波系数在尺度空间上完全一致。     

The Continuous Interpolating Self-organizing Map

The self-organizing map (SOM) [5] provides a general data approximation method which is suitable for several application domains. The topology preservation is an important feature in data-analysis and may also be advantageous for the evaluation of the data in a function approximation or regression task. For this reason the interpolated self-organizing map (I-SOM) adds an output layer to the SOM architecture which computes a real valued output vector. This paper presents an extension of I-SOM towards a continuous interpolation. It is compared to RBF and to the parametrized self-organizing map.     

插值型Catmull-Clark曲面的实现

Catmull-Clark细分是一种逼近型细分方法,它的极限曲面并不插值初始点。通过对Catmull-Clark细分矩阵进行分析,给出了一种插值条件。通过求解插值条件,得到一个新的网格,对这个网格应用Catmull-Clark细分,其极限曲面插值初始网格的控制顶点。最后对极限曲面的形状进行了讨论。     

Interactive Shape Control of Interpolating B-splines

This paper presents a new methodfor providing interactive shape control of interpolating B-splines. The CAD designer can directly interact with geometric entities defined on the B-spline at any interpolated data point; shape adjustments can be performed either globally or locally. Our approach is based on Bλ-splines of order k (λ,k ≥1), i.e. λ-reparametrized, classical B-splines. The method presented can be easily generalised to surfaces defined either as tensor products or by using the skinning technique; interactive shape control can be provided in both surface parametric directions.     

Locally Weighted Interpolating Growing Neural Gas

In this paper, we propose a new approach to function approximation based on a growing neural gas (GNG), a self-organizing map (SOM) which is able to adapt to the local dimension of a possible high-dimensional input distribution. Local models are built interpolating between values associated with the map's neurons. These models are combined using a weighted sum to yield the final approximation value. The values, the positions, and the "local ranges" of the neurons are adapted to improve the approximation quality. The method is able to adapt to changing target functions and to follow nonstationary input distributions. The new approach is compared to the radial basis function (RBF) extension of the growing neural gas and to locally weighted projection regression (LWPR), a state-of-the-art algorithm for incremental nonlinear function approximation     

Interpolating G-splines with rational offsets

In (Pottmann, 1995), a geometric characterization of rational PH-curves is presented. Using this result we developed an explicit Bézier representation for interpolating G¹-Hermite PH-splines referring to local coordinate systems. Furthermore a simple geometric criterion for avoiding singularities is proposed.     

Constrained Control of Interpolating Surfaces by Parameters

In order to meet the needs of practical design, an interpolation technique is employed to constrain the shape of surfaces. The method of preserving positivity on the interpolation surface and constraint on interpolating data is also developed. The advantage of this new method is that it can be used to constrain the shape of an interpolating surface only by selecting suitable parameters, and numerical examples are presented to show the performance of the method.     

交互式保凸离散插值曲线

本文给出了一种生成交互式保凸离散插值曲线的方法。所生成的曲线是Chaikin曲线的推广。本质上,它是一阶几何连续(GC~1)的分段二次参数曲线。文中讨论了它的几何性质和交互性质,最后给出了几个实例。     

形状插值的G1 Hermite曲线

提出了在给定2个端点及其切矢方向的条件下生成一条形状较好的三次Hermite曲线的方法.把未知的形状最好曲线的端点切矢模长看作端点条件的函数;然后建立该函数应当满足的条件,并根据工程制图人员在一些特殊的端点条件下的绘图得到一些经验数据;最后把该函数近似用三角函数的二次以下谐波分解表示,根据已有的经验数据和建立的条件得到谐波分量的大小.目标曲线的计算简单,在经验数据的情况下,目标曲线端点切矢模长范围为(0.5,2.9).与已有方法相比,曲线形状较好.     

Interpolating Quintic Polynomial with C~1 Continuity

A method constructinq C~1 Piecewise quintic polynomial over a triangular grid to interpo-late function values and partial derivatives at vertices is presented in this paper.The set of precise poly-nomials of this method is discussed.     

视图Morphing技术在视图插补中的应用

图像 Morphing是图像之间插补变换的一类被广泛使用的技术,这种方法是基于两幅图像之间的像素位置和颜色的内插,但对3D场景或物体,它不能保证所生成图像的真实性,即不满足透视性质,在此介绍一种图像插补变换的新方法:视图Morphing 技术,它可以保证生成图像的真实性,且不需要知道图像的3D信息,这避免了图像的3D重建,因而具有极大的应用价值.一般的视图 Morphing技术需要知道图像的投影矩阵,可是用目前的技术,从图像直接获得投影矩阵是很困难的.视图Morphing技术事先不需要知道图像的投影矩阵,就可以对摄像机刚体运动所获得的两幅图像进行插补运算,获得中间视点的图像.     

基于空间坐标的三线性插值立体视觉定标算法

该文提出了一种基于空间三维坐标校正的立体视觉定标算法。该算法对空间点的三维坐标误差采用三线性插值进行校正,从而改变了以往算法完全依赖于迭代的办法来求解误差多项式的方法,较以往算法更加稳定、快速、方便。     

Interpolating Runge-Kutta methods for vanishing delay differential equations

In the numerical solution of delay differential equations by a continuous explicit Runge-Kutta method a difficulty arises when the delay vanishes or becomes smaller than the stepsize the method would like to use. In this situation the standard explicit sequential process of computing the Runge-Kutta stages becomes an implicit process and an iteration scheme must be adopted. We will consider alternative iteration schemes and investigate their order.