Edwards曲线快速标量乘算法研究

标量乘法是椭圆曲线密码算法中最核心的运算,其运算速度影响着整个密码体制的实现效率。首先,详细地介绍了Edwards曲线的基本概念。其次,为了提高标量乘法的运算速度,针对椭圆曲线标量乘算法进行了研究,引入了一种可以用来计算连续倍点2◢△mP◣的算法CDA。为了提高CDA的计算效率,提出了将标量◢k◣表示为4-NNAF形式以减少◢k◣的长度,再结合CDA计算标量乘法可以有效地减少运算量。最后根据算法的运算量分析和具体例子得出,减少标量◢k◣长度后的计算效率提高了13%以上。为了进一步加快运算速度,又提出了对CDA中乘法运算和模逆运算采用并行结构来减少标量乘法的运算次数。计算结果表明,并行后的计算效率提高了36%以上。     

A parametric frequency response method for non-linear time-varying systems

A new parametric frequency response algorithm is introduced to investigate linear and non-linear dynamic systems with time-varying parameters. In the new algorithm the time-varying parameters are regarded as additional inputs of the systems and the non-linear generalised frequency response functions for multi-input-single-output systems are then employed to obtain Zadeh's system functions from a differential equation representation. The parametric frequency response method reveals how the time-varying parameters affect the behaviour of the systems through a time-varying term. The new method can be applied to both linear and non-linear time-varying systems.     

Efficient multilevel image segmentation through fuzzy entropy maximization and graph cut optimization

The fuzzy c-partition entropy has been widely adopted as a global optimization technique for finding the optimized thresholds for multilevel image segmentation. However, it involves expensive computation as the number of thresholds increases and often yields noisy segmentation results since spatial coherence is not enforced. In this paper, an iterative calculation scheme is presented for reducing redundant computations in entropy evaluation. The efficiency of threshold selection is further improved through utilizing the artificial bee colony algorithm as the optimization technique. Finally, instead of performing thresholding for each pixel independently, the presented algorithm oversegments the input image into small regions and uses the probabilities of fuzzy events to define the costs of different label assignments for each region. The final segmentation results is computed using graph cut, which produces smooth segmentation results. The experimental results demonstrate the presented iterative calculation scheme can greatly reduce the running time and keep it stable as the number of required thresholds increases. Quantitative evaluations over 20 classic images also show that the presented algorithm outperforms existing multilevel segmentation approaches.     

基于灰度形态重构的颗粒图像分割方法

提出了一种基于距离变换、形态重构和分水岭算法的图像分割算法。将一幅图像通过距离变换得到距离灰度图,与形态重构算法结合,得到颗粒图像的标识点图,用标识点图对距离灰度图进行分割,再用分水岭变换对分割后的距离灰度图进行变换。试验表明,该算法能有效合理地解决粘连或者重叠颗粒等物体的分割。     

Designing multilayered wire‐grid polarizers using a monochromatic recursive convolution finite‐difference time‐domain algorithm

Multilayered wire‐grid polarizers (WGP) find application as low‐reflection polarizers in projection‐type liquid crystal display devices. A multilayered WGP is formed by adding thin layers on top of the metal ridges of an ordinary WGP. The ordinary WGP consists of a periodic array of parallel metal ridges, where the period of the array and the width of any individual metal ridge are typically less than the wavelength of the incident light. Such WGPs are often used as efficient polarizers. However, in certain applications, it is important to reduce the reflection from the WGP while preserving the polarization efficiency. One of the ways to achieve this goal is to add thin layers on top of the metal ridges of the ordinary WGP. The reduction in reflection from the multilayered WGP depends on the number and material of these additional layers. In this paper, we describe a design method for multilayered WGPs based on an effective medium theory, thin‐film computation method and a monochromatic recursive convolution finite‐difference time‐domain algorithm. The goal of design process is to identify suitable materials and thicknesses for the additional thin layers needed to lower the reflection appreciably. The design method is explained with the help of bilayered WGPs.     

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%.     

基于PHP的多功能域名销售管理系统设计

针对目前常用的域名销售系统存在的诸如在域名注册资料获取不便、域名闲置难以及时处理等问题,研究并实现了一套基于PHP语言的多功能域名销售管理系统。介绍了系统的体系结构与设计思路,对基于MySQL的数据库、各功能模块等进行了描述;通过使用Smarty的前台模板引擎,解决了对注册商的域名进行分类、多条件管理、编辑等问题。系统运行表明,该方法符合域名管理规范,能有效提高域名管理质量。     

Word的高级应用——制作表单

通过实例,详细讲解用Word的窗体工具建立表单,以解决行政部门制作电子文档的空白表格时,让填写的人员方便、快捷地填写内容,又不随意修改(破坏)原有格式和原文。     

公式分层的谓词模态逻辑

由于必然模态词□的引入,谓词模态逻辑的公式在一个可能世界中的真假值可能依赖于其可达的可能世界.在谓词模态逻辑中存在个体跨可能世界相等问题.针对这一问题,Lewis提出了对应物理论,并且在对应物理论中用对应物关系来表示个体跨可能世界相等.但是,当一个对象具有一个以上的对应物时,谓词模态逻辑中的跨可能世界相等关系无法与对应物关系建立一一对应.通过限制谓词模态逻辑中全称量词∀的范围,给出了一种公式分层的谓词模态逻辑.它是谓词模态逻辑的一个子逻辑,并且其语言与谓词模态逻辑的语言是相同的.但其公式是分层定义的,使得∀可以出现在□的范围内,并且□不能出现在∀的范围内.由于任意形如∀x□φ（x）的表达式都不是该逻辑的公式,以量词开头的公式在一个可能世界w中的真假值只依赖于w,该逻辑避免了个体跨可能世界相等问题.给出了该逻辑的语言、语法和语义,并证明了该逻辑是可靠的和完备的.     

基于自然语言处理的算法知识名称发现

网络中的很多程序资源在知识概念上有内在的联系,却没有超链接将它们连接在一起。将网络程序资源中的算法知识名称获取出来,组织成一个算法知识专家库文件,用于识别程序设计资源所含的知识点,即可将程序设计资源按知识点相互联系。为了自动获取程序资源中的算法知识名称,提出一种基于自然语言处理的算法知识名称发现方法。通过发现含有算法知识名称语句的字符串模式,从程序资源中提取可能含算法知识名称的字符串,从中找出最有可能出现在算法知识名称中的分词,并根据这些分词获取算法知识名称。实验结果表明,与原有人工整理出的算法知识名称集合相比,该方法新增了11.2%的算法知识点和13.6%的算法知识名称。