Vague集向Fuzzy集转化的一种新方法

提出Vague值向Fuzzy值转化的实用方法的定义。针对文献[6]中的一个Vague值向Fuzzy值转化的均值修正法,提出了加权均值修正法,并证明了这种方法同样是Vague值向Fuzzy转化的一种非常实用的方法。     

一种G2连续的二次曲线样条插值方法

给出了一种用二次曲线段来插值平面有序数据点列的一种方法 .文中的曲线采用隐函数表示而不是常用的参数形式 .曲线不是用通常的二曲线方程来表示 ,而是用一种带参数的函数样条来表示 .首先给出用二次曲线来插值两点、两切线以及在一端点处的曲率达到给定值 ;其次 ,给出了用二次曲线样条插值平面上一个有序点列且使曲线达到整体 G2 连续 ;最后就用二次曲线对平面闭曲线插值问题进行了研究 .该方法对数据点列没有任何限定性要求 ,无论是闭曲线还是开曲线 ,都能达到整体 G2连续 .     

基于代数曲线段的G2连续的曲线造型方法

文中提出了一种用低次代数样条曲线来插值平面上有序数据点列或者构造用多种方法表示的两曲线段间过渡曲线的一种方法 .这里得到的曲线不是用通常的代数曲线方程来表示 ,而是用一种带参数的代数方程来表示 .首先给出了用二次曲线来插值两点、两切线和用四次代数曲线插值两点、两切线和两曲率的方法 ;其次 ,给出了利用四次代数样条曲线来插值平面上一个有序点列 ,无论是构造闭曲线还是开曲线 ,都能达到整体 G2 连续 .最后 ,讨论了代数曲线 /代数曲线、代数曲线 /参数曲线以及参数曲线 /参数曲线之间的过渡曲线造型方法     

一种求解线性方程组的SOR并行算法

逐次松弛迭代算法(SOR)是求解线性方程组的一种常用迭代算法,当系数矩阵正定时,它具有较快的收敛速度。但是,由于每个迭代步内存在数据相关,它难以实现并行计算。目前的SOR并行算法采用数据分解的方法,但由于该法并行区域过小,同步通讯代价大,并行效率低。本文提出了SOR的一种新型并行算法,该算法与传统SOR方法等价,具有相同的收敛性和迭代结果。该并行算法通过矩阵分块增大了可并行计算的区域,并引入流水线技术,利用各处理器间通讯与计算时间的重叠,获得较理想的并行加速效率。通过多核微机以及小规模集群上的数值实验证明,本文提出的SOR并行算法在求解大型稠密线性方程组时具有较好的并行效率。     

Model-based prediction error uncertainty estimation for k-nn method

The k-nearest neighbour estimation method is one of the main tools used in multi-source forest inventories. It is a powerful non-parametric method for which estimates are easy to compute and relatively accurate. One downside of this method is that it lacks an uncertainty measure for predicted values and for areas of an arbitrary size. We present a method to estimate the prediction uncertainty based on the variogram model which derives the necessary formula for the k-nn method. A data application is illustrated for multi-source forest inventory data, and the results are compared at pixel level to the conventional RMSE method. We find that the variogram model-based method which is analytic, is competitive with the RMSE method.     

基于PCA特征和融合特征的ECG身份识别方法

ECG作为一种活体生物特征用于身份识别在国际上引起了广泛重视.针对基于解析特征的ECG身份识别方法对特征点检测精度要求较高的缺点,提出一种仅需R波峰值点检测的ECG身份识别方法,该方法通过有针对性的设定相应阈值,将PCA特征和小波融合特征方法相结合.实验结果表明该方法优于PCA特征方法、波形特征方法和小波特征方法,既减少了特征点检测的复杂性和特征点检测不准确带来的误差,又可获得较高的识别率,是一种实时、高效算法.     

基于GPU-CUDA的共轭斜量法实现及性能对比

偏微分方程数值解法(包括有限差分法、有限元法)以及大量的数学物理方程数值解法最终都会演变成求解大型线性方程组。因此,探讨快速、稳定、精确的大型线性方程组解法一直是数值计算领域不断深入研究的课题且具有特别重要的意义。在迭代法中,共轭斜量法(又称共轭梯度法)被公认为最好的方法之一。但是,该方法最大缺点是仅适用于线性方程组系数矩阵为对称正定矩阵的情况,而且常规的CPU算法实现非常耗时。为此,通过将线性方程组系数矩阵作转换成对称矩阵后实施基于GPU-CUDA的快速共轭斜量法来解决一般性大型线性方程组的求解问题。试验结果表明:在求解效率方面,基于GPU-CUDA的共轭斜量法运行效率高,当线性方程组阶数超过3000时,其加速比将超过14;在解的精确性与求解过程的稳定性方面,与高斯列主元消去法相当。基于GPU-CUDA的快速共轭斜量法是求解一般性大型线性方程组快速而非常有效的方法。     

Polynomial collocation using a domain decomposition solution to parabolic PDE's via the penalty method and explicit/implicit time marching

A domain decomposition method is examined to solve a time-dependent parabolic equation. The method employs an orthogonal polynomial collocation technique on multiple subdomains. The subdomain interfaces are approximated with the aid of a penalty method. The time discretization is implemented in an explicit/implicit finite difference method. The subdomain interface is approximated using an explicit Dufort-Frankel method, while the interior of each subdomain is approximated using an implicit backwards Euler's method. The principal advantage to the method is the direct implementation on a distributed computing system with a minimum of interprocessor communication. Theoretical results are given for Legendre polynomials, while computational results are given for Chebyshev polynomials. Results are given for both a single processor computer and a distributed computing system.     

Complete solutions for a class of elastic-plastic structures

A mathematical programming method is proposed for determining the complete history of (generalized) stresses and strains during a loading process for a class of elastic-plastic structures. This method is based on a pivoting procedure similar to the simplex method for a linear program and is suited for computer implementation. The method is illustrated by a simple truss problem. Based on the method, some results on existence and uniqueness of the solution of the structural problem are established.     

求解非线性方程重根的区间牛顿法

讨论了求解非线性方程重根问题,针对此时Moore区间牛顿法不再适用,以及Hansen改进的区间牛顿法收敛速度慢的情况,通过引入原方程的一种相关方程,建立了求解非线性方程重根的区间牛顿法;证明了其局部平方收敛的性质,给出了数值算例。验证了新算法比Hansen改进的区间牛顿法具有更快的收敛速度,且算法是有效和可靠的。     

三维矩形块布局的序列三元组编码方法

解空间的序列对编码方法是解二维矩形体聚块布局问题的完整且有限(P-admissible)的编码方法.它产生于直观的分划过程(gridding procedure).受二维序列对编码方法的启示,对三维矩形聚块布局问题,也应该存在序列三元组编码方法.然而将直观分划过程直接推广到三维空间是困难的.通过对序列和部分序列的运算和分析,得到了三维矩形块聚块布局的序列三元组编码方法,此编码方法是完整且有限的.     

A Prefix Code Matching Parallel Load-Balancing Method for Solution-Adaptive Unstructured Finite Element Graphs on Distributed Memory Multicomputers

In this paper, we propose a prefix code matching parallel load-balancing method (PCMPLB) to efficiently deal with the load imbalance of solution-adaptive finite element application programs on distributed memory multicomputers. The main idea of the PCMPLB method is first to construct a prefix code tree for processors. Based on the prefix code tree, a schedule for performing load transfer among processors can be determined by concurrently and recursively dividing the tree into two subtrees and finding a maximum matching for processors in the two subtrees until the leaves of the prefix code tree are reached. We have implemented the PCMPLB method on an SP2 parallel machine and compared its performance with two load-balancing methods, the directed diffusion method and the multilevel diffusion method, and five mapping methods, the AE/ORB method, the AE/MC method, the MLkP method, the PARTY library method, and the JOSTLE-MS method. An unstructured finite element graph Truss was used as a test sample. During the execution, Truss was refined five times. Three criteria, the execution time of mapping/load-balancing methods, the execution time of an application program under different mapping/load-balancing methods, and the speedups achieved by mapping/load-balancing methods for an application program, are used for the performance evaluation. The experimental results show that (1) if a mapping method is used for the initial partitioning and this mapping method or a load-balancing method is used in each refinement, the execution time of an application program under a load-balancing method is less than that of the mapping method. (2) The execution time of an application program under the PCMPLB method is less than that of the directed diffusion method and the multilevel diffusion method.     

分布式视频编码中相关噪声分布的非参数估计

目的 针对分布式视频编码系统中相关噪声（CN）分布难以准确模拟的问题,提出了一种CN的非参数估计方法。方法 根据CN分布的特点,提出CN的非参数估计方法,建立了基于最优窗宽的核密度估计-均匀分布模型（KDEUDM）,比较了变换域Wyner-Ziv（TDWZ）系统中CN的参数估计法和非参数估计法所建立的噪声模型对系统性能的影响。结果 实验结果表明,非参数估计方法能较准确地模拟CN的分布,与参数估计法相比,用非参数估计法建立的噪声模型能使WZ帧编码在高码率下最高能节约10%的码率。结论 非参数估计法是TDWZ系统中有效的相关噪声估计方法。     

一种基于分块和混沌网的图像置乱方法

图像置乱是实现图像加密的重要手段之一。由于混沌系统具有非周期性、遍历性、伪随机性和对初值的高度敏感性,因而已被广泛应用于图像置乱。为提升图像置乱效果和置乱性能,现提出了一种图像分块与混沌网相结合的图像置乱方法。该方法首先利用一种分块思想将图像进行置乱,进而构造一种混沌网,并将其应用于分块置乱的结果。实验结果表明,该方法不仅可取得良好的置乱效果,并具有较强的抗攻击性能。     

改进果蝇算法求解混合流水车间调度问题

针对混合流水车间调度问题(HFSP),本文提出了一种新的基于果蝇算法和变邻域搜索的混合优化方法.首先,将关键块内的工序与同阶段其他机器上的工序进行交换,提出了一种基于关键路径的HFSP新邻域结构.其次,针对HFSP的阶段式解码特性,提出了一种邻域解的快速评估方法,并验证了快速评估方法的高效性.然后,基于提出的新邻域结构,并将N7和K-insertion邻域结构引入HFSP,设计了基于上述3种邻域结构的变邻域搜索方法,以此为基础提出了一种针对HFSP的混合优化方法.最后,通过对Carlier和Liao等经典测试集进行测试,验证了所提新邻域结构的可行性和有效性,并将该方法与其他文献的方法进行了对比,验证了所提方法的优越性.     

基于部分随机行走的电源线/地线(P/G)网络快速求解方法

介绍一种基于随机行走方法与松弛迭代(SOR)算法相结合的快速电源网络求解方法，它先将P／G网分为若干块，然后用简化的随机行走方法求取电路块边界结点的电压，最后采用松弛迭代算法求出电路块内部结点的电压．同时还给出了一种电路块从对角顶点向中央求解的策略，并将此方法推广到采用RLC瞬态网络的求解．大量的实验数据表明，受限于P／G网供电PAD的数目较少这一现实，随机行走方法的效率比较低，在此情形下，该方法比随机行走方法快20倍．     

A method for ranking fuzzy numbers and its application todecision-making

Since fuzzy numbers represent uncertain numeric values, it is difficult to rank them according to their magnitude. In the paper, a method for ranking fuzzy numbers is proposed. The method considers the overall possibility distributions of fuzzy numbers in their evaluations for ranking and provides users with a method of changing viewpoints for evaluations. Users represent their viewpoints with fuzzy sets. The method evaluates fuzzy numbers with a satisfaction function and the viewpoint given by users and then ranks the numbers according to their evaluation values. The satisfaction function is a measure of comparisons between fuzzy numbers. In order to illustrate the ranking method, two numeric examples are shown, and for the comparative study, our method is compared with four existing ranking methods through eight examples. As an example of potential applications, the proposed method is applied to a decision-making problem: a two-person game with fuzzy profit and loss. The ranking method is used to analyze player choices     

海量层次信息的Focus+Context交互式可视化技术

综述了海量层次信息可视化与Focus Context技术的相关工作,针对海量层次信息可视化的交互问题,在嵌套圆可视化技术的基础上提出了基于上下文感知的Focus Context交互式可视化技术.首先,基于外切圆排列方法提出对圆心进行三角网格剖分的方法,为变形计算建立上下文;然后,针对变形计算前后上下文一致性问题,在三角网格邻居跟踪方法的基础上,提出了用于同层兄弟节点上下文感知的外切圆变形排列方法,以及用于父子节点上下文感知的嵌套圆迭代排列方法.实验结果表明。上述方法在实现焦点突出的鱼眼视图的同时,能够有效地解决Focus Context交互式可视化的上下文感知问题.上述方法应用于文件系统海量层次信息的交互式可视化问题,提供了交互式可视化工具.     

A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization

Recently, an increasing attention was paid on different procedures for an unconstrained optimization problem when the information of the first derivatives is unavailable or unreliable. In this paper, we consider a heuristic iterated-subspace minimization method with pattern search for solving such unconstrained optimization problems. The proposed method is designed to reduce the total number of function evaluations for the implementation of high-dimensional problems. Meanwhile, it keeps the advantages of general pattern search algorithm, i.e., the information of the derivatives is not needed. At each major iteration of such a method, a low-dimensional manifold, the iterated subspace, is constructed. And an approximate minimizer of the objective function in this manifold is then determined by a pattern search method. Numerical results on some classic test examples are given to show the efficiency of the proposed method in comparison with a conventional pattern search method and a derivative-free method.     

基于 GPU 和 Kinect 的快速物体重建

便宜的物体快速三维建模技术是当前计算机视觉领域重要的研究课题.给出了一种基于Kinect传感器的快速物体重建方法,以及基于该方法的一种图形处理器 (Graphic processing unit, GPU)原型系统实现.本文方法主要分为两步: 1)系统的初始标定; 2)全自动的物体重建.对于系统初始标定,提出了一种简单易用的粗标定方法;对于物体重建,提出一种全自动的快速物体重建方法.本文方法鲁棒性高,在出现点云配准错误时仍然能够稳定地得到较理想的重建模型.针对环闭合(Loop-closure)问题,提出了一种全局的点云配准方法.对几类物体的重建实验结果表明,本文方法方便实用,且能得到较好的重建效果.此外,本文还探索了有遮挡物体的重建问题.将本文方法应用于有遮挡物体的重建,也取得了较好的重建效果.