點乘積 的英文怎麼說
中文拼音 [diǎnchéngjī]
點乘積
英文
dot product-
The nine elements of the matrix are products of cosines of angles between the direction of a streamline at a point and the coordinate axis.
這矩陣的9個元素系一點的流線方向和座標軸之間夾角餘弦的乘積。The dot product, being the product of three scalars, is a scalar.
點積是三個標量的乘積,所以是個標量。Fixed point theorem and system of generalized vector equilibrium problems in the product space of topological vector spaces
乘積拓撲矢量空間中的不動點定理和廣義矢量平衡問題組( the force between two point charges at rest is directly proportional to the product of the charges and inversely proportional to the square of the distance between them
在真空中,兩個靜止的點電荷之間的相互作用力的大小與兩電荷所帶電量的乘積成正比,與它們之間距離的平方成反比,作用力的方向沿兩電荷的連線。Some other people deem that they should go to work immediately, because they can accumulate more experiences at the youth
還有部分人認為應該馬上工作因為乘年輕多積累點工作經驗比較合適。As a result of the require of cagd in airplane, automobile shipping and electrical appliance etc, fairing of curves and surfaces has become the hot subject in all over the world. this paper presents a new method for fairing of curves based on fitting the derivative of second order of curves. several practicality examples has been given to show the advantage of this arithmetic
本文針對目前曲線光順演算法存在的問題,提出了一種採用最小二乘法來擬合曲線型值點列的二階導數曲線,然後通過兩次積分來反求光順曲線思想的曲線光順演算法,並給出了實際的算例來說明本文演算法的優越性。Walk more and ride less. save energy whenever you can and fix your air conditioner at 25. 5 degrees c. never waste any paper and try to explore the concept of paperless offices
際此學年之始,我呼籲所有中大成員平日多走路,少乘車;盡量節省能源,把室內溫度調節至攝氏二十五點五度;更要愛惜紙張,積極探討無紙辦公室的概念。Tpc has nearly the same performance as turbo code, especially simpler decoding method. so, it becomes the focus of the coding area, and will be widely applied in high speed communication
Turbo乘積碼的性能與turbo碼相近,譯碼方法比turbo碼簡單,因此也成為編解碼領域近幾年來研究的熱點,在高速數據通信中有很廣闊的應用前景。Select and verify some algorithms of powerpc603e ' s fpu. design and implemention of the data - path of fpu, with emphasis in design a 64bit multiply - add unit. powerpc603e is a complex microporcessor system
? fpu中數據通路的設計與實現:重點是一個64bit乘加器的實現,包括部分積產生和選擇單元、 wallace壓縮單元、 161bit加法器。Then, we obtain some new continuous selection theorems in g - convex spaces. through the use of it, some new coincidence theorems are proved in noncompact g - convex spaces or in product g - convex spaces
最後,我們還在g -凸空間內得到了一些新的連續選擇定理,並利用該定理證明了非緊g -凸空間內及乘積g -凸空間內的重合點定理。For cylinder diameters, besides two point size, actual size and local actual size, the national standard of china also specified computing sizes, which included area diameter, perimeter diameter and volume diameter, and global sizes, which included least square diameter, maximum inscribed diameter and minimum circumscribed diameter
摘要對于圓柱體的直徑尺寸,除了兩點尺寸、實際尺寸以及局部實際尺寸外,國家標準還將規定計算尺寸(包括面積直徑、周長直徑和體積直徑)與全局尺寸(包括最小二乘直徑、最大內接直徑和最小外接直徑) 。Lbie, based on the local boundary equation, adopts the traditional moving least squares ( mls ) approximation which depends on only the values of the nodes in the domain of the problem or along its boundary. the whole process of integration is carried on over a local domain or its local boundary centered at the node in question. the local boundary equation can be rewritten to represent the values of the unknown function at the point of interest, and the essential boundary conditions can be directly and easily enforced by using the green formula and the characters of the dirac function
它以局部邊界積分方程為基礎,採用移動最小二乘近似函數,從而只需要分佈在問題域內及其邊界上的節點的信息值,無需劃分單元;整個積分是在以節點為中心的局部域及其邊界上實現,所以不需要背景積分網格;藉助于格林公式及dirac函數的性質,將局部邊界積分方程轉化為所考慮點的未知函數的邊界積分表達式,便於直接施加本質邊界條件。The turbo codes proposed by these authors can be broadly divided into two major types : turbo product codes ( tpc ) and turbo convolutional codes ( tcc ). the goal of this paper is to describe the main ideas behind both the tpc and tcc. although most research until now has been focused on tccs, tpcs have been shown to be a more attractive option for a wide range of applications
Berrou提出后,已成為通道編碼研究的熱點,大量關于turbo碼研究的論文被發表。其實現的方法大體被分成兩種類型:增強型乘積編碼( turboproductcodestpc )和增強型卷積編碼( turboconvolutionalcodestcc ) 。To obtain the fast matrix - vector multiplication algorithm, we approximate the kernel function with piece - wise polynomial and get the approximate coefficient matrix a using the approximate kernel function. let n be the number of quadrature points and k2 be the number of interpolating knots at each subdomain. it is proved that the construction of a and the matrix - vector multiplication ax require o ( nk ) operations respectively
我們利用對核函數進行分片多項式插值逼近得到適用於快速方法的近似系數矩陣a :矩陣a的計算和矩陣-向量相乘ax各需要o ( nk )次運算,存貯a需要佔用o ( nk )內存,其中n為積分節點的個數, k ~ 2為每個小區域的插值節點數。分享友人