演算

We present an efficient approach for generating the correspondence between two homeomorphic 3D polyhedral models. The user can select vertices on the polyhedra to decompose the boundary of each polyhedron into the same number of morphing patches. Further, the user can specify the feature points on the morphing patch pairs to improve the morph. After the morphing patch pairs are be mapped to 2D regular polygons, they are merged and reconstructed to generate a morph. In the main procedures of our approach, we propose an easy mapping method and a foldover-free warping technique. And we also propose a most efficient merging algorithm. The merging can be completed in O.

我们的对应演算法主要的流程架构是(1)设计一套良好的介面提供给使用者在物体表面上点选圈选点；(2)利用最短路径将圈选点作两两相连，以切割勿体表面；(3)利用Relaxation的方式进行摊平的目的；(4)利用Warping技术以增进使用者的便利性，因此无须圈选太多快patch以精确对齐物体的特徵，同时还提供一套自行避免相交情况的演算法以保证不相交；(5)我们研发出一套极快速的merge演算法，其利用最小轮廓涵盖结构而有效地达成区域搜寻与区域merge，因此在效率上达到O；(6)最后藉由Remesh与3D位置资讯的建立，重构出对应的结果整体而言，透过本论文所研发的对应演算法将不用花费太多的执行时间，因此符合经济效益。

In light of the approximation of Muskingum flood calculation model,an improving model on average flow within prescribed time in flood calculation is presented using curve integral instead of general arithmetic mean.

针对马斯京根洪水演算模型的近似性问题，用曲线积分法改进了原模型中时段流量的简单算术平均值法，并利用连续性空间优化问题的蚁群算法对改进的马斯京根洪水演算模型进行参数最优估计，使演算流量更加接近实际。

An object-based logic calculus is outlined in this paper, which is built on the trace calculus based on dynamic entities with local states.

对象演算是一个面向对象的逻辑演算系统，它建立在描述具有内部状态的动态演变实体的Trace演算之上。

The rules of modus ponens are given and the main results of propositional calculus in two-valued logic.

本文利用有补T-范建立了一类Fuzzy命题演算系统，给出了假言推理规则，推广了二值逻辑中命题演算的主要结果，且演算简单方便。

In order to describe the dynamic and complicated process model exactly, we propose the logic situation calculus based on the expanding the situation calculus and describe the virtual enterprise in this formal logic framework.

为了准确地描述虚拟企业这种动态的、复杂的建模过程，我们对情景演算这种形式化逻辑框架进行扩展，提出了逻辑情景演算，并以逻辑情景演算来描述虚拟企业的运作过程。

In contrast to conventional optimization algorithms whose iterates are computed and analyzed deterministically, randomized methods rely on stochastic processes and random number/vector generation as part of the algorithm and/or its analysis.

传统的最佳化演算法中迭代的计算和分析是确定的，与之相比，随机方法依靠随机过程和乱数字/向量的生成作为演算法和演算法分析的一部分。

Among many research problems in bioinformatics, the shortest superstring problem has wide applications in many research areas, such as DNA sequencing and data compression.

在解决NP-hard的问题上，近代有许多最佳化方法被探讨，包括了：蚂蚁演算法、基因演算法、模拟退火法、或一些启发式演算法等等。

In this thesis, we have proposed the algorithms of performing of three improving types, can improve the efficiency of prospecting of the unusual fluctuation database , so the improvement type of a thesis performs algorithms and will not need to rescan the whole database each time when there are newly-increased materials, the majority only needs to scan the newly-increased trade materials, in order to improve the efficiency of prospecting.

在本论文中，我们提出了三个改良式的演算法，第一个为Apriori演算法来动态探勘，其二为使用布林演算法为基础进行动态探勘，最后为以布林运算为基础之FP-tree的动态探勘，可以提升异动资料库的探勘效率，因为在过去的资料探勘技术中，在探勘关联规则的过程}式演算法当有新增资料时将不用每次都要重新扫描整个资料库，绝大部分只需要扫描新增的交易资料，以提升探勘效率。

In this thesis, we have proposed the algorithms of performing of three improving types, can improve the efficiency of prospecting of the unusual fluctuation database , so the improvement type of a thesis performs algorithms and will not need to rescan the whole database each time when there are newly-increased materials, the majority only needs to scan the newly-increased trade materials, in order to improve the efficiency of prospecting.

在本论文中，我们提出了三个改良式的演算法，第一个为Apriori演算法来动态探勘，其二为使用布林演算法为基础进行动态探勘，最后为以布林运算为基础之FP-tree的动态探勘，可以提升异动资料库的探勘效率，因为在过去的资料探勘技术中，在探勘关联规则的过程中，若有新增或删除交易资料时，则必须重新计算一次，将造成前次探勘计算的重复及资源的浪费，所以本论文的改良式演算法当有新增资料时将不用每次都要重新扫描整个资料库，绝大部分只需要扫描新增的交易资料，以提升探勘效率。

In this study, we implement and investigate the performance of a more advanced row-action maximum likelihood algorithm and compare its performance to OSEM and MLEM on an Inveon microPET for small animals. We used a clinical rat PET study acquired and reconstructed the rat sinogram using MLEM, OSEM, RAMLA.

本研究针对Inveon microPET探讨列运算最大相似度演算法之效能和可行性，也与最大相似度与均值最大化演算法及序列子集均值与最佳化演算法比较。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。