一种基于运动场的snake算法

在计算光流场的基础上,提出了snake算法中一种新的外部能量函数,并利用光流场的运动矢量来预测下帧图像中snake的初始值,不仅与无预测的算法相比能提高收敛的速度,而且收敛结果更贴近于目标的本身。实验证明了该文算法的优越性。     

Multidimensional interpolation and differentiation based on an accelerated sinc interpolation procedure

A multidimensional interpolator based on convolution with the sinc function is developed. The interpolator is global in nature, with all sampled data contributing to the computation. Preprocessing of the data by partial summation accelerates convergence of the actual interpolation, when repeatedly interpolating the same data. Modification of the interpolation procedure gives an efficient method for numerical differentiation. The method is intended for bandlimited functions with finite support. The interpolator was tested for a class of problems related to molecular dynamics, including interpolation of 1D, 2D and 3D Gaussian wave packets on a grid; integration of classical trajectories on an interpolated potential; and the transfer of a sampled wave function from a polar grid to a Cartesian grid and back. It was found that the interpolator is very accurate for Gaussian-like wave functions, and that even for functions which are not bandlimited, such as the Morse potential, a reasonable accuracy can be obtained.     

心脏序列图象光流场运动的相关算法

心脏是人体的重要器官,它的运动与其功能紧密相关,因此在心脏疾病的诊断中,对心脏的运动分析是十分必要的.现代医学成象技术为医生在心脏的整体解剖结构和功能结构等方面提供了全局性信息.针对心脏超声序列图象的特征,相邻两帧图象内移动不大,而其灰度相关性和位置相关性强的特点,本文根据二维序列图象的相关性来跟踪各帧像素点得到序列图象光流场,并与传统方法进行了比较.为了检测本算法的可行性,本文结合临床知识对仿真图象应用相关算法进行了定量分析并获得预期实验结果.     

Abduction in logic programming: A new definition and an abductive procedure based on rewriting

A long outstanding problem for abduction in logic programming has been on how minimality might be defined. Without minimality, an abductive procedure is often required to generate exponentially many subsumed explanations for a given observation. In this paper, we propose a new definition of abduction in logic programming where the set of minimal explanations can be viewed as a succinct representation of the set of all explanations. We then propose an abductive procedure where the problem of generating explanations is formalized as rewriting with confluent and terminating rewrite systems. We show that these rewrite systems are sound and complete under the partial stable model semantics, and sound and complete under the answer set semantics when the underlying program is so-called odd-loop free. We discuss an application of abduction in logic programming to a problem in reasoning about actions and provide some experimental results.     

A continuation procedure based on projected Newton steps

In this paper we present and discuss a continuation method for solving certain fixed point problems in Hilbert spaces. The procedure allows to reduce progressively the residual until a desired level is reached. It is constructed combining a projected variant of Newton's method recently proposed and studied in [6] with the so-called principle of sufficiently weak increase of H. Schwetlick [9], [10]. Numerical examples illustrate the performance of the algorithm.     

Group decision-making procedure based on incomplete reciprocal relations

Xu (Int J Approx Reason 36:261–270, 2004) introduced the concepts of incomplete reciprocal relation and additive consistent incomplete reciprocal relation. The aim of this paper is to develop a novel procedure for group decision making with incomplete reciprocal relations. The procedure utilizes each given incomplete reciprocal relation to construct an auxiliary reciprocal relation based on additive transitivity, and then aggregates directly these auxiliary reciprocal relations into a collective auxiliary reciprocal relation. After that, based on the collective auxiliary reciprocal relation, a simple linear system of equations is established for ranking alternatives. Finally, a numerical example is given to illustrate the developed procedure.     

基于密码库函数的程序加解密过程分析

针对常见密码算法种类多及实现方式不同,采用现有特征扫描和动态调试的方法分析程序中的加解密过程非常困难的问题。提出一种基于库函数原型分析和库函数调用链构造的加解密过程分析方法,库函数原型分析是分析常见密码库函数所包含的密码算法知识和库框架知识,并记录形成知识库,库函数调用链是根据密码库函数调用时参数值的相等关系构建的库函数调用的先后关系链,最后根据知识库在链上提取展示密码库及密码算法相关知识。该方法对运用到常见库的程序中的算法的识别精确度达到近100%,能详细分析算法调用时的数据、密钥、模式,并有助于对多个算法的协同处理关系作分析。该方法有助于辅助分析木马、蠕虫之类恶意程序,也可用于检测程序对库密码算法的运用是否正确。     

基于DSP的USB设备固件程序开发

本文介绍了一种采用TMS320VC5509A自带的USB模块来实现USB数据传输的方案,对该DSP内部的USB模块的构造及其传输原理做了分析.详细的介绍了如何利用CCS内部集成的片级支持库(CSL)来实现USB设备固件程序的设计,并给出了相关的部分代码.该方案大大降低了系统硬件设计的复杂度和调试的难度,提高了系统的集成度和稳定性,适用于便携式设备中.     

Multi-objective optimization of a permanent magnet synchronous motor based on an automated design and analysis procedure

Microsystem Technologies - Since traction motors for electric vehicles require a variety of features to be used simultaneously, research on the design optimization of permanent magnet synchronous...     

基于FPGA的动态重构系统重构过程研究

有效融合了专用集成系统(Application Specific Integrated Circuit,ASIC)与通用目的处理器(General Purpose Processor,GPP)优势的动态可重构系统,以其良好的灵活性、可重构性以及优异的计算性能,逐步应用于从嵌入式系统到高性能计算的许多领域。针对动态可重构系统的重构过程控制进行了研究,详细分析了动态重构过程中的一些潜在问题。针对重构过程中重构模块与固定模块之间的耦合问题和数据交互问题,提出了一种新的动态重构过程通信控制机制。该机制将重构过程划分为重构前、重构中和重构后3个阶段,并在各个阶段对数据交互和通道隔离进行了有效控制。实验验证表明,该机制能够有效保证动态重构过程的正确性。     

A linear programming procedure based on de la Vallée Poussin's minimax estimation procedure

It is shown that de la Vallée Poussin's 1911 procedure for the solution of linear minimax estimation problems can be adjusted to solve a class of linear programming problems. A general procedure of this type should have been accessible in the 1910s, but the historical record shows that no such procedure was developed before the work of Kantorovich, Koopmans, and Dantzig in the 1940s.     

A ranking procedure based on a natural monotonicity constraint

We formulate a new ranking procedure in the traditional context where each voter has expressed a linear order relation or ranking over the candidates. The final ranking of the candidates is taken to be the one which best adheres to a natural monotonicity constraint. For a ranking a ≻ b ≻ c, monotonicity implies that the strength with which a ≻ c is supported should not be less than the strength with which either one of a ≻ b or b ≻ c is supported. We investigate some properties of this ranking procedure and encounter some surprising preliminary results.     

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

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

面向任务T-Petri网的舰载机出动流程仿真

为明确舰载机的出动过程,以更好地指导舰载机操作,对舰载机出动流程仿真问题进行研究。在分析舰载机出动流程共性以及Petri网优点的基础上设计了一种面向任务的综合T-Petri（Task-Petri）网模型。该模型通过对基本网进行简单扩充便可以动态仿真不同的出动任务,不仅简化了出动流程,而且可以满足舰载机出动任务的多样性建模要求,避免了重复建模的复杂性。利用T-Petri网模型对库兹涅佐夫号航母舰载机出动流程进行仿真试验,并给出了甘特图,比较直观地给出了舰载机出动流程。分析给出了舰载机出动时间计算公式,将其所得的出动时间与通过T-Petri网仿真得出的出动时间进行比较,结果表明所提出的T-Petri网模型用于仿真舰载机出动流程是可行的,且结果比较精确。     

基于Hoare逻辑的过程调用的形式化方法

采用Hoare逻辑风格的推理,提出了一些从源代码推导过程和这些过程调用的形式化语义规范的技术和算法。为了推导一个过程调用的语义,将过程看作一个抽象单元从程序分离出来,提取过程的形式化语义规范。对于一个具体的过程调用,形式化这个调用的前置条件,根据这些条件形式化求解调用的最强后置条件,也就是调用的语义作用。     

Design of a planar multibody dynamic system with ANCF beam elements based on an element-wise stiffness evaluation procedure

The absolute nodal coordinate formulation (ANCF) has been widely applied for large deformation analysis in flexible multibody dynamics. Although the formulation led to stable solutions for time integration under large rotations and deformations, excessive time consumption was recorded. The nonlinear relationship between the deformation and the internal force accounted for repeated adjustment to the force equilibrium state as the structure deformed. In this research, an equivalent model of the ANCF beam structure was constructed. The stiffness evaluation method was applied in an element-wise manner. In this model, the irrelevant parts were separated from those that relate to the displacements and design parameters enabling efficient updates of internal forces to achieve force equilibrium. Therefore, by using this model, optimization problems, in which displacements as well as design parameters keep changing can be efficiently approached. To verify the proposed method, two examples of optimization problems related to a free-falling pendulum and a slider-crank mechanism are demonstrated.     

基于过程神经元网络的汉字笔段提取算法研究

提出一种利用过程神经元网络,对脱机手写体汉字二维图像的笔段提取方法。定义了脱机手写体汉字笔段的提取方法,给出了用于脱机手写体汉字笔段提取的过程神经网络的模型和学习算法,并对算法进行了仿真实验。该方法与其他汉字笔段提取方法相比,具有速度快、可学习、鲁棒性好的特点。经实验证明,该方法是行之有效的。     

基于存储过程的高性能数据库应用模型研究

基于C/S及B/S的传统数据库应用模型在处理海量数据时,系统通常会对许多无用数据进行运算,增加了运算的时间复杂度和空间复杂度.针对这个问题,提出了一种基于存储过程的高性能数据库应用模型,仅仅对有效数据进行运算,减少了对大量无用数据的运算,提高了SQL的运行速度,同时也降低了网络数据流量.实践结果表明,该存储过程数据库模型比传统数据库处理模型的处理效率提高了n倍.     

A note on group decision-making procedure based on incomplete reciprocal relations

In a very recent paper by Xu and Chen (Soft Comput 12:515–521, 2008), a novel procedure for group decision making with incomplete reciprocal relations was developed. In this note, we examine the function between the fuzzy preference relation and its corresponding priority vector developed by Xu and Chen with a numerical example and show that the function does not hold in general cases. Then, we deduce an exact function between the additive transitivity fuzzy preference relation and its corresponding priority vector. Based on this, we develop a procedure for the decision making with an incomplete reciprocal relation and also develop a procedure for the group decision making with incomplete reciprocal relations. In order to compare the performances of our method with Xu and Chen’s method in fitting the reciprocal relation, we introduce some criteria. Theoretical analysis and numerical examples have shown that the function deduced by us is more reasonable and effective than Xu and Chen’s.