它的每一个像素点都对指定的入射角十分敏感，并提供一部分称为“傅里叶变换”的数学运算以产生一张20像素的图像。
Each of its pixels is sensitive to specific incident angles and supplies a component of the mathematical operation called the Fourier Transform to produce an image about 20 pixels across.
为了在结构化类型的实例上调用mutator或observer方法，请使用双点(. .)运算符(清单1、清单2和清单3)。
To invoke a mutator or observer method on an instance of a structured type, use the double-dot (..) operator (Listings 1, 2, and 3).
逻辑运算符的优先级低于单独的比较运算符，这一点意义重大，因为必须先计算比较运算符，然后才能计算逻辑运算符。
The logical operators have lower precedence than the individual comparison operators, which makes sense because the comparison has to be evaluated before the logical operator can be evaluated.
提供了很多新的函数和运算符在时间点和时期之间完成适当的算术运算。
Many new functions and operators are provided that allow all suitable arithmetic operations between points in time and durations.
方法是用点（.）运算符调用的。
Methods are invoked (as in the Java language) with the dot (.) operator.
它会将信息传输到我们的服务器上，我们的服务器通过全球匹配运算系统，确定是哪两个手机，在同一时间，同一地点，同时撞击。
It sends information up to our server, and our server does this global matching algorithm to figure out which two phones in the world got the same bump at the same time in the same place.
就像懂得逻辑连接(布尔运算AND)的人脑可以类似地将逻辑连接的句子分类那样，TLU也懂得一点逻辑连接之类的东西。
Insofar as a human brain that knows about logical conjunction (Boolean AND) would similarly classify logically conjoined sentences, this TLU knows something like logical conjunction.
双点运算符调用了mutator方法来设置每个地址属性的值。
The double-dot operator invokes mutator methods to set values for each of the address attributes.
在使用set -x时还要记住一点：如果脚本有内部函数，而且set - x放在代码的主体部分，那么它的输出会包含子函数的运算过程。
One thing to keep in mind when using set -x is that if the script you're evaluating has internal functions, set -x will carry over to its child function if placed in the root body of the code.
为了实现这个目标，我们将调用observer方法(使用双点运算符)获取address列中的结构化类型值的城市属性。(清单2)。
To do that, we will invoke the observer method (using the double-dot operator) for the city attribute of the structured type value in the ADDRESS column (Listing 2).
在使用算术表达式时，还需要记住一点，在版本7.2之前，Vim只支持整数运算。
When using arithmetic expressions, it's also important to remember that, until version 7.2, Vim supported only integer arithmetic. A common mistake under earlier versions was writing something like.
在CSimpleBinaryTree 中有两个搜索算法.线性搜索和对半搜索.线性搜索只在树种子项数目小于指定值的时候才使用 (缺省为10),从这个点以后的各项，将使用对半搜索.这样做的原因是线性查找不要求元素进行排序并且它的运算规则相对要简单的多.因此对于小数目项来说，线性查找是理想的.
The reason for this is that a linear search doesn't require the elements to be sorted and its algorithm is a lot less complicated. So for a small number of items a linear search is ideal.
通过计算图像梯度信息，选取边缘区域像素作为控制点，既改善减影图像质量，又提高运算速度。
The quality of the subtraction image was improved and computation time was reduced by selecting edge pixels as triangular control points.
在这一点上，IP监控比模拟CCTV或者DVR部署有明确的优势，它能分享现有的网络基础设施，而且大大节省了运算和存储成本。
To this point, IP surveillance offers clear advantages over analogue CCTV or DVR deployments with significant savings as a result of sharing existing network infrastructure, computation and storage.
在最后一个定位点成员和第一个递归成员之间，以及组合多个递归成员时，只能使用UNIONALL集合运算符。
UNION ALL is the only set operator allowed between the last anchor member and first recursive member, and when combining multiple recursive members.
但由于确定各像素点属于哪一个圆环需要进行复杂的乘积运算，耗费了大量时间。
But the arithmetic product operation is needed to determine a pixel belonging to which circular ring, which consumes much time.
只要几个大一点的柜子就可将它容下，运算速度也大大地提高了。1959年出现的是第三代集成电路计算机。
As long as a few larger cabinets can be Rongxia, the computing speed is also greatly improved. 1959 was the emergence of third-generation computer circuits.
由此，通过在一个临近SVSR边界的系统运行点处的运算，可以直接得到SVSR边界的近似二次解析表达式。
Thus the approximate quadratic expression of SVSR boundary can be obtained by the calculation on a given operating point close to the boundary.
分段函数是函数问题中难点，本文就分段函数在分界点的极限，导数、定积分的运算问题探讨一些新方法。
This text will talk about some new methods about the limit of disjunction function in the boundary and the operation of lead number and definite integral.
本文提出一种经过验证的方法，其运算简捷，对点的分布状态不加限制。
The verified method presented here is simple in calculation and of no limit over distribution of given points.
本文主要研究了两方面内容：基于点模型的布尔运算及其融合方法；基于网格模型的离散曲面融合方法。
This thesis studies two aspects: the Boolean operations on point models and the fusion; grid-based model of discrete surface fusion method.
说明：MF C实现灰度图像的各种点运算，如图像反色，窗口变换，线性变换，阈值变换，灰度均衡等。
MFC to achieve a variety of gray-scale image point operations, such as anti-color images, the window transform, linear transformation, threshold transform, gray balance, etc.
查运算曲线首先要算出每个电源对短路点的计算电抗。
The calculating reactance between power source node and fault node must be computed first before checking operational curve.
在假设3中通过引入一种新的运算，把内变量演化方程定义在时间的点集上。
In assumption 3 a new operation is introduced and the evolution equations of internal variables are denned in the point set of time.
全变换方法用于处理每一边界约束点，对刚度矩阵和位移矢量作相应的算子运算。
The full transformation method deals with each boundary constraint node, and for stiff matrices and displacement vector, using operator transformation, relative operator calculation is performed.
本文设计的FFT处理器采用流水线和并行处理技术，在64个时钟周期完成64点复数定点FFT运算，可以满足OFDM系统的需要。
The FFT processer adopts the pipeline and parallel technology and can complete 64 points FFT computation in 64 clocks. It is able to meet the need of OFDM system.
然后通过简单的倍乘和叠加运算计算出各负荷点的可靠性指标。
Then every load point's reliability indices are obtained via simple multiplication and repeated addition calculations.
分析并研究了可用于指针图像处理的图像分割、图像滤波、边缘点提取、直线拟合、平行直线求距等运算方法。
It analyses and studies the operating method in image processing area, including image division, image filter, picking up edge point, drawing up line and getting the distance of parallel lines.
为了提高椭圆曲线密码（ECC）的点乘运算速度，提出了一种快速约简求模算法。
To accelerate point multiplication operation of elliptic curve cryptography(ECC), a fast reduction algorithm for modular operation was introduced.
为了提高椭圆曲线密码（ECC）的点乘运算速度，提出了一种快速约简求模算法。
To accelerate point multiplication operation of elliptic curve cryptography(ECC), a fast reduction algorithm for modular operation was introduced.
应用推荐