Total curvature variation fairing for medial axis regularization

We present a new fairing method for planar curves, which is particularly well suited for the regularization of the medial axis of a planar domain. It is based on the concept of total variation regularization. The original boundary (given as a closed B-spline curve or several such curves for multiply connected domains) is approximated by another curve that possesses a smaller number of curvature extrema. Consequently, the modified curve leads to a smaller number of branches of the medial axis. In order to compute the medial axis, we use the state-of-the-art algorithm from [1] which is based on arc spline approximation and a domain decomposition approach. We improve this algorithm by using a different decomposition strategy that allows to reduce the number of base cases from 13 to only 5. Moreover, the algorithm reduces the number of conic arcs in the output by approx. 50%.     

利用曲线拟合对触觉数据的压缩

为减轻离线触觉数据压缩带来的失真变形,提出利用曲线拟合的压缩方法.在假定触觉数据所对应原触觉信号能用分段二次参数曲线表示的前提下,通过反向采样过程来构造触觉数据拟合曲线,该曲线由分段二次曲线组成,在连接处达到切线连续,且每段二次曲线对原触觉信号具有二次多项式逼近精度.为避免保存拟合曲线的所有系数以进一步提高数据减少率,对拟合曲线系数进行了迭代求解,从而只需编码保存部分系数即可解码.实验结果表明,该方法在保持高数据减少率的前提下减轻了压缩失真变形.     

非圆曲线的数控处理及程序实现

引用优化设计中一维搜索和黄金分割法,针对数控加工中非圆曲线的处理,给出实用、简洁和新颖的宏程序实现方法,解决在数控系统中求解方程组的问题,是数控用户快速解决相关应用问题的有效手段。     

Conference key agreement protocol with non-interactive fault-tolerance over broadcast network

Most conventional conference key agreement protocols have not been concerned with a practical situation. There may exist some malicious conferees who attempt to block conference initiation for some purposes, e.g. commercial, political or military benefit. Instances where conference must be launched immediately due to emergency, efficient detection of malicious behavior would be needed. Recently, Tzeng (IEEE Trans. Comput. 51(4):373–379, 2002) proposed a fault-tolerant conference key agreement protocol to address the issue where a conference key can be established among conferees even though malicious conferees exist. However, his protocol might be complex and inefficient during fault-detection. In the case where a malicious conferee exists and a fault-tolerant mechanism is launched, complicated interactions between conferees will be required. In this paper, we introduce a novel strategy, where any malicious conferee may be identified and removed from the conferee list without any interaction. With such a non-interactive fault-tolerance, conferences could be established and started efficiently. A complete example of our protocol will be given to describe the fascinating fault-tolerance. We analyse the security of our protocol regarding four aspects, i.e. correctness, fault-tolerance, active attack and passive attack. The comparisons of performance between our protocol and that of Tzeng are also shown. As a whole, the advantage of our protocol is superior to that of Tzeng under the situation where malicious conferees exist.

Efficient processing of spatial joins with DOT-based indexing

A spatial join is a query that searches for a set of object pairs satisfying a given spatial relationship from a database. It is one of the most costly queries, and thus requires an efficient processing algorithm that fully exploits the features of the underlying spatial indexes. In our earlier work, we devised a fairly effective algorithm for processing spatial joins with double transformation (DOT) indexing, which is one of several spatial indexing schemes. However, the algorithm is restricted to only the one-dimensional cases. In this paper, we extend the algorithm for the two-dimensional cases, which are general in Geographic Information Systems (GIS) applications. We first extend DOT to two-dimensional original space. Next, we propose an efficient algorithm for processing range queries using extended DOT. This algorithm employs the quarter division technique and the tri-quarter division technique devised by analyzing the regularity of the space-filling curve used in DOT. This greatly reduces the number of space transformation operations. We then propose a novel spatial join algorithm based on this range query processing algorithm. In processing a spatial join, we determine the access order of disk pages so that we can minimize the number of disk accesses. We show the superiority of the proposed method by extensive experiments using data sets of various distributions and sizes. The experimental results reveal that the proposed method improves the performance of spatial join processing up to three times in comparison with the widely-used R-tree-based spatial join method.     

A Complex View of Barycentric Mappings

Barycentric coordinates are very popular for interpolating data values on polyhedral domains. It has been recently shown that expressing them as complex functions has various advantages when interpolating two‐dimensional data in the plane, and in particular for holomorphic maps. We extend and generalize these results by investigating the complex representation of real‐valued barycentric coordinates, when applied to planar domains. We show how the construction for generating real‐valued barycentric coordinates from a given weight function can be applied to generating complex‐valued coordinates, thus deriving complex expressions for the classical barycentric coordinates: Wachspress, mean value, and discrete harmonic. Furthermore, we show that a complex barycentric map admits the intuitive interpretation as a complex‐weighted combination of edge‐to‐edge similarity transformations, allowing the design of “home‐made” barycentric maps with desirable properties. Thus, using the tools of complex analysis, we provide a methodology for analyzing existing barycentric mappings, as well as designing new ones.     

计算两参数对称音叉式分岐曲线扩张系统的构造

构造了计算两参数分岐线的扩张系统，讨论了扩张系统的正则性。     

加速基因方法在最大流量频率曲线参数估计中的应用

基因方法是基于自然选择和自然基因机制的并行随机自适应工程模型参数全局优化估计的通用数值方法。它不限制模型结构、优化准则、被估参数的数目、约束条件等，已开始广泛用于各种工程模型的优化设计之中。文中对它的原理、步骤、特点进行初步探讨，并针对基因方法的弱点，作者提出予以改进的加速基因方法，后者在最大流量频率曲线参数估计中得到成功应用     

平面四点确定一条抛物线及其在参数插值中的应用

本文讨论了用平面有序四点确定一条抛物线及其在参数插值中的应用。提出了有用四点确定一条抛物线的算法，讨论了确定抛物线的四点相互间要满足的位置。对平面给定的一组数据点，提出了构造参数插值曲线的新方法。所构造的插值曲线是ＧＣ＾１连续的分片三次参数曲线，其插值精度为二次参数多项式。本文还以计算实例对新方法与其它方法的插值精度进行了比较。     

Characterization of PdAg/Al2O3 composite membrane by electroless co-deposition

In this work, PdAg/Al₂O₃ composite membranes prepared by electroless co-deposition technique have been studied. Effects of plating time, Ag composition and total concentration of metal ions on surface morphologies, composition and microstructure of the resulting layers were investigated. Scanning electron microscope, energy dispersive spectrometer and nitrogen permeation technique were used to characterize the as-prepared composite membranes. From the experimental results, it shows that the surface morphology of the deposited PdAg layer is strongly affected by the Ag content of the plating bath. Since large differences of deposition rates and growth modes are observed between Pd and Ag grains, the PdAg layer exhibits the dendritic structure. As the Ag content is approximately 50%, the dendritic structured PdAg layer reveals the largest nitrogen permeability with the smallest size of residual pores. Furthermore, a comprehensive electrochemical analysis is proposed to interpret the composition and structure of the PdAg layer. Eventually, the experimental results are quite consistent with those predicted from the electrochemical analysis.