点运算

在设计过程中，本文对DICOM文件编码、点运算、模板运算等图像处理算法做了一些分析研究，最后完成的模块达到设计要求。

During the design process , the thesis Researched and analysised the DICOM file coding , the image process such as point operation , template operation and so on . Finally , the system has reached design demands .

利用非线性单调点运算增强图像的研究

Study on applying the non-linear monotonous point operation enhancing image

若一同构于H的有向图可通过对有向图D施行一系列推点运算得到，则称D可推为H。

We say that a digraph D can be pushed to a digraph H if a digraph isomorphic to H can be obtained by applying a sequence of pushes to D.

Montgomery方法是椭圆曲线密码中计算多倍点运算kP的一种新方法。

The Montgomery method is a new method for the computation of the multi point arithmetic kP in elliptic curve cryptosystems .

Koblitz曲线密码中倍点运算算法的改进

An Improved Method for Computing Multiplying Points on Koblitz Curve Cryptography

对基于FPGA椭圆曲线密码体制的实现进行全面研究，在Xilinx的FPGA上实现了二元有限域和椭圆曲线点运算的所有算法。

Studies on realization of elliptic curve cryptosystem are carried out based on FPGA , the arithmetics both in binary finite field and on the elliptic cure are realized in Xilinx FPGA device .

计算机中图像颜色处理技术是根据RGB三原色理论对色彩信息量化，再利用像素的点运算扫描整幅图像进行一一处理。

Image color-process techniques is to digitize the color information based on RGB principle , then to scan and process the whole image by means of computation of pixel .

文章对一款基于特征2域实现的椭圆曲线密码ASIC芯片进行了差分功耗分析，其中分析的目标为实现椭圆曲线层多倍点运算的Montgomeryladder算法。

This paper describes a differential power analysis ( DPA ) against an implementation of elliptic curve cryptosystem ( ECC ) on an ASIC chip . In the chip , the method used for scalar multiplication of ECC is Montgomery Ladder which is a basic algorithm used to resist DPA .

对复数输入信号序列，字长16位，时钟速率10MHz时，每点运算时间约4μs，根据对运算速度及设备量的要求，可选用并行或串并行方案。

When 10 MHz clock frequency is used , the operation time per point is about 4 μ s for the complex signal input sequence of 16 bits in word-length .

运用图像点运算的方法克服了液滴图像对比度不强的特点；

The pixel operation has overcome the characteristic of the low contrast ratio of the drops-image .

一个小型的计算机功能，提供加减乘除的运算功能并提供小数点运算功能。

Function of a small computer to provide Math decimal point computing capabilities and provide operational capabilities .

主要内容包括点运算、图像变换、图像增强、形态学变换、图像编码、图像恢复、图像分析等。

The system mainly includes : point operation , image transformation , image enhancement , image restoration and image analysis .

基于直觉模糊点运算引入了一种新的得分函数，对直觉模糊数进行排序。

Thirdly , based on the point operator of the intuitionistic fuzzy number , a new score function is introduced to rank the alternatives .

分析结果表明：受数乘运算中倍点运算次数与处理器数目无关这一瓶颈的制约，并行算法的效率受倍点运算的效率影响很大。

The data show that : restricted by the fact that the number of double operations is independent of the number of processors , the parallel algorithm is greatly affected by Double algorithm .

利用非线性点运算处理具有双峰灰度值直方图的图像，通过调节较亮或较暗物体的对比度和调节中间灰度级处的对比度而达到增强图像的目的。

Applying the non-linear point operation processing the image of two-peak gray-scale values histogram , through adjusting brighter or darker contrast of object and adjusting contrast of the medial gray-scale , attaining the purpose of enhancing image .

通过对灰度直方图进行匹配的理论，提出了一个通过二维模型对灰度直方图进行点运算的方法，以达到图像增强的目的。

According to the theory of Gray Level Histogram Specification , the means of the Spatial Domain calculating has been put forward in this article , through the establishment of the two-dimensional model , in order to achieve the image enhancement .

p函数类的点乘和点幂运算

Pointwise multiplication and power on the class of d-functions

该方法可适用于所有的2n点FFT运算。

It can be used to all the 2n point FFT .

提高椭圆曲线上点加运算的速度在整个基于FPGA设计的椭圆曲线密码应用系统实现中极为关键。

The speed of point addition on elliptic curve is critical in elliptic curve application cryptosystem design based on FPGA device .

通过核技巧，只需在原空间进行点积运算，便可使第一主成分的贡献率达到90%以上，能有效避免PCA中因各指标贡献率过于分散而影响评价效果。

We can make the first principal component contribute to 90 % by choosing the suitable kernel function and point product computation only .

在有限素整数域Fp上定义了一条椭圆曲线及点群运算规则，并由此构造出一种椭圆曲线密码体制。

An elliptic curve is defined over a finite field GF ( p ) for a given set of operation rules .

其次介绍了ECC的数学基础，对有限域上椭圆曲线点的运算规则进行了详细描述。

Then , this paper introduces the math foundation required by ECC , including the addition rule for elliptic curve point defined over finite field .

若干个点集运算的解析表示及其运用

Analytical expression and application of the operations in several sets

点集运算的解析表示

The analytical expression of sets operation

提高椭圆曲线点积运算的效率是椭圆曲线研究的一个核心问题。

To improve the efficiency of the algorithm of point multiplication on elliptic curves is a key problem .

试验结果表明，优化后的投影坐标下的点加运算较原来的算法在速度上提高了22%。

Experiment results show that the parallel-optimized elliptic curve point addition is 22 percent faster than the original algorithm .

支持向量机利用核函数代替高维特征空间的点积运算，巧妙地解决维度问题，适合处理高维以及不均衡数据的异常检测问题。

Support vector machine use kernel function instead of point multiply in high dimensional feature space , perfectly solving the dimension problem .

设计到点对点路由运算法则，分布式的索引和搜索功能，分布式安全系统问题，资源访问效率问题。

Related to Peer-to – peer routing algorithms , distributed index and searches problem , distributed security system problem and resource accessing efficiency problem .

该文首先介绍有限域上定义的椭圆曲线及点群运算规则，给出椭圆曲线点群的阶。

This paper , firstly introduces the elliptic curve in finite field and algebraic law of its point group , gives the order of the group .

若将输入图像与每一幅存贮的图像进行光学异或逻辑运算，并用光电方法探测逐点逻辑运算输出光强的总和，则与最小透射光强相对应的存贮图像就是输入图像的最佳匹配。

The best match is indicated by the minimum collected transmitted light intensity resulted from optical XOR logic operations between the input image and every stored image .