straight-line n 中文意思是什麼

straight-line n 解釋
直線法
  • straight : adj 1 直,一直線的 (opp crooked bent curved )。2 直挺的,向(目標)直進的。3 直接的,連續的。4 ...
  • line : n 1 線;繩索;釣絲;測深度用繩,捲尺。 a fishing line 釣魚線。 be clever with rod and line 會釣魚...
  • n : 1. 【羅馬數字】90〈N=90000〉。2. 【化學】=nitrogen. 3. =North(ern)。N =nuclear 核的:N-waste 核廢料。
  1. Volume shrinkage of sample results in the increasing of the value of the crystallization rate vc and the decreasing the values of the avrami exponent n in the primary crystallization and s, defined as the relative crystallinity degree when experiment data deviate theoretical predicting straight line. compared with the avrami equation, the price equation hardly makes progress on describing the behavior of polymer later stage crystallization

    樣品體積收縮,導致avrami指數n值減小;結晶速度v _ c值增加;表示實驗值偏離理論預測直線時的相對結晶度_ s值減小;與avrami方程相比, price方程仍不能較準確地描述高聚物等溫後期結晶行為。
  2. Secondly, their aims are made the investment of substations, feeders or running cost of electric power system minimum. but they do n ' t take into account of land utilization, street accessibility of right of way, etc., but demands of electric power system. generally, a straight line distance, namely, euclid distance, was used for calculating the distance between a load point and a substation, which is a straight forward but non - practical way for most planning techniques

    其次受研究工具的限制,這些模型以工程投資、運行費用等最小為目標,僅能考慮導線載流量、電壓降等電力系統技術約束條件,簡化略去了用地限制、街道可達性等重要的自然約束條件,且求解這些模型的前奏是計算負荷點到變電所的歐幾里得距離(直線距離) ,簡便但不切合實際(這一點在城市電網規劃中尤其重要) ,因此較難給出技術上可行的最優解。
  3. The improper excavating will bear capacity, water permeability, natural structure and geological structure worsenning the base rock of foundation., this ca n ' t be allowed to the water conservancy project building, especially to block water building. lt will not only increase the expenses happened of the remedy measure, but also lengthen building straight line time limit for a project of construction

    開挖不當將降低基巖的承載能力、增大基礎的透水性、惡化基巖的天然結構和地質構造,這對於水工建築物,特別是擋水建築物是不能允許的,同時將會增加採取補救處理措施所發生的費用,延長建築物施工直線工期。
  4. We mainly discuss four point - line location problems in the plane as follows : problem a is to determine a straight - line to mini - mize the total weighted distances from n given points ; problem b is to determine a point to mini - mize the total weighted distances from n given straight - lines ; problem c is to determine a straight - line to minimize the maximum weighted distances from n given points ; problem d is to determine a point to minimize the maximum weighted distances from n given straight - lines

    我們主要研究了四個平面上的點-線選址問題a , b , c , d 。問題a是求一直線到n個給定點的加權距離和為最小,問題b是求一點到n條給定直線的加權距離和為最小,問題c是求一直線到n個給定點的最大加權距離為最小,問題d是求一點到n條給定直線的最大加權距離為最小。
  5. Following are detailed steps of this system : in the segmentation section, we use three successive frames to detect the motion infomation of the pictures, by using blockmatching algorithm in two successive frames twice, we can get two pictures composed of motion blocks of the moving object, then we find out the common motion blocks of the two pictures, experiments prove these blocks approximately compose the moving object. after getting the motion blocks, we calculate the center of these blocks as the center of the moving object, thus we can use the center point as the origin, construct n straight linesjoining the boundry of the image and the center. on each line, we can find out a proper point near the object contour according to some criteria, then we use these n points as the initial points of the snake and let the snake converge on the object contour, thus finish the segmentation of the moving object

    本方案的實現過程為:分割部分:對運動目標的前後三幀進行兩次塊匹配運動檢測,通過找出兩個匹配結果中運動圖像塊的公共部分,獲得組成運動目標的圖像塊;求出運動目標圖像塊的形心作為運動目標的中心,以此中心為端點,向四周發散出角度間隔為的n條射線,射線的另一端終止於圖像的邊緣;在每條射線上按照一定的準則(點的梯度和與目標中心的距離在一定閾值范圍內)找出n個初始輪廓點;以這些初始輪廓點作為主動輪廓模型( snake )的初始點,用改進的貪婪演算法使snake收斂到待分割的運動目標輪廓上。
分享友人