基于视频三音子的双模态语料自动选取算法

为实现可视语音合成,建立符合条件的双模态语料库,提出双模态语料自动选取算法。根据视频中唇部发音特征,对已有的三音子模型归类,形成视频三音子,在其基础上从原始语料中自动选取语料,利用评估函数对原始语料中的句子打分。与其他双模态语料库相比,该语料库在覆盖率等指标上有较大改进,为实现具有真实感的可视语音合成奠定基础。     

基于函数签名的控制流监控方法

针对恶意篡改程序控制流攻击方式,提出一种监控程序控制流完整性的方法。对程序源代码进行扫描,以函数作为识别程序行为的基本粒子,利用函数调用执行的序列信息,建立表现程序原意的行为轨迹模型,利用该模型在运行期监控程序的执行流程。实验结果表明,该方法对篡改控制流的攻击起到了很好的防御作用。     

B样条类曲线及其在曲线参数化中的应用

从B样条基函数出发,通过参数变换,导出B样条函数类的概念,讨论了它们的性质.给出B样条类曲线和附加权因子的B样条类曲线的理论,研究了它们与B样条曲线的关系.提出B样条曲线重新参数化因子的概念,探讨通过基函数的重新参数化实现B样条曲线的重新参数化的方法.结果表明,该方法具有较好的通用性以及计算简单、便于操作等特点.     

Stability analysis of discrete-time switched systems: a switched homogeneous Lyapunov function method

This paper addresses the stability issue of discrete-time switched systems with guaranteed dwell-time. The approach of switched homogeneous Lyapunov function of higher order is formally proposed. By means of this approach, a necessary and sufficient condition is established to check the exponential stability of the considered system. With the observation that switching signal is actually arbitrary if the dwell time is one sample time, a necessary and sufficient condition is also presented to verify the exponential stability of switched systems under arbitrary switching signals. Using the augmented argument, a necessary and sufficient exponential stability criterion is given for discrete-time switched systems with delays. A numerical example is provided to show the advantages of the theoretical results.     

基于平行截面上轮廓之间重构问题的研究

研究了基于平行截面上两多边形轮廓重构的基本问题,给出了利用体积最大化作为度量标准来求得一个"较好"并且合法的重构的目标函数,然后得出:其中一个多边形轮廓在其所在的截面上沿着法向平移、在截面内平移和在截面内等比例缩放都不影响最大化体积后的结果。该结论对于三维实体的可视化和几何造型领域具有重要的实用价值。     

Matlab和C++接口中函数注册的实现

函数注册在Matlab和C 接口中起着重要的作用。在介绍函数注册作用的基础上 ,详细分析了函数注册的过程及应当注意的问题 ,并给出了一种实现函数注册的最简单的方法。用实例展示了函数注册的具体实现过程。     

A Jacobi-type method for computing balanced realizations

A new numerical scheme for computing balancing coordinate transformations in linear systems theory is presented. The method is closely related to the Jacobi method for diagonalizing symmetric matrices. Here the minimization of the sum of traces of the Gramians by orthogonal and nonorthogonal Jacobi-type rotations is considered. The algorithm is shown to be globally convergent to a balancing transformation that arranges the Hankel singular values in a prescribed ordering. Local quadratic convergence of the algorithm is shown.     

Solving multiple objective quasi-convex goal programming problems by linear programming

This study presents a novel means of resolving multiple objective goal programming (GP) problems with quasi-convex linear penalty functions. The proposed method initially expresses a quasi-convex function by the maximum operator of two convex functions, then solves it via a linear programming technique. The proposed method does not contain any zero–one variables; nor does it require dividing the multi-objective quasi-convex GP problem into large sub-problems as in conventional methods. Some illustrative examples are provided.     

A new neural network algorithm for planarization problems

To deal with the planarization problem widely used in many applications including routing very-large-scale integration （VLSI） circuits, this paper points out that only when its vertices are arranged in some specific order in a line can a planar graph be embedded on a line without any cross connections or cross edges. Energy function is proposed to meet the need of embedding a graph on a single line and route it correctly. A Hopfield network is designed according to the proposed energy function for such embedding and routing. The advantage of the proposed method is that it not only can detect if a graph is a planar one or not, but also can embed a planar graph or the maximal planar subgraph of a non-planar graph on a single line. In addition, simulated annealing is employed for helping the network to escape from local minima during the running of the Hopfield network. Experiments of the proposed method and its comparison with some existent conventional methods were performed and the results indicate that the proposed method is of great feasibility and effectiveness especially for the planarization problem of large graphs.