相鄰多局 的英文怎麼說

中文拼音 [xiānglīnduō]
相鄰多局 英文
neighboring multi office
  • : 相Ⅰ名詞1 (相貌; 外貌) looks; appearance 2 (坐、立等的姿態) bearing; posture 3 [物理學] (相位...
  • : Ⅰ名詞1 (棋盤) chessboard2 (下棋或其他比賽一次叫一局) game; set; innings 3 (形勢; 情況; 處境...
  • 相鄰 : adjoin; adjoining; adjacent
  1. Abstract : considering the second nearest - neighbor interaction and cubic, quartic anharmonic interactions simultaneously, we employ the multiple scales method combined with a quasidiscreteness approximation to calculate the lattice vibration. it is shown that the kind of nonlinear chain exhibits envelope soliton, envelope kink and envelope antikink soliton. these results can also be used to explain the experimental phenomena that the kink amplitude of the self - localized structure is determined only by the intrinsic properties of its lattices

    文摘:同時考慮次近諧振互作用和三次方、四次方非諧互作用,利用重尺度結合準離散近似方法去計算晶格振動行為,發現一維非線性點陣中存在包絡孤子及正扭結型包絡孤子、反扭結型包絡孤子,解釋了自域結構的幅度只取決于點陣中的固有參數的實驗現象
  2. A normal transform is introduced, and there are enough much grids in the region between the critical layer and the wall, where the variation of the disturbance is the quickest. the finite - difference of governing equations with fourth - order accuracy in the normal direction is utilized in full regions including points close the wall, and is very important for accurately discreting equations. the combination of global and local methods is implemented, and a new iterative formula is derived

    對于曲線坐標系下的拋物化穩定性方程,文中發展了求解的高效數值方法:引進法向變換,使得在臨界層與壁面之間的擾動量變化最快的區域有更的法向網格點;導出包含邊界域在內的完全四階精度的法向有限差分格式,這對方程精確離散至關重要;採用全法和部法結合的方法及其新的迭代公式,大大加速收斂並得到更精確的特徵值。
  3. The search space is divided into many small areas, and each area is given a certain pheromone value. according to the state transition rules, the artificial ants move to the next solution which is generated randomly or calculated by particle swarm optimization. local search strategy is also added into psaco so that the search speed and precision is enhanced

    該演算法首先將連續對象定義域平均分成許邊緣互重疊的小區域,區域的稠密程度決定了演算法解的精度,每個區域賦予一定的信息素值;螞蟻根據狀態轉移規則在隨機生成的可行解與利用微粒群演算法得出的可行解之間選擇下一步要去的位置;引入部尋優策略,加強近似最優解域內的部搜索,提高搜索速度和精度。
  4. After a short - term load forecasting method based analogous and linear extrapolation is proposed, the load forecast and the priority of equipment action are led into static reactive power optimization. the aim function is constructed for the practical situation of power system. on the basis of traditional genetic algorithm the fitness function and the holding of population diversity are improved

    在提出基於似日和線性外推的短期負荷預測新方法的基礎上,將負荷預測和設備動作優先級引入靜態無功優化中,並結合電網實際情況,構造了實用的目標函數,對遺傳演算法的適應度函數和群體樣性的保持進行了改進,採用域搜索運算元增加遺傳演算法的部尋優能力。
  5. Just like that the core patch which is not adjacent to water and hilly woods has the flat edge, near round shape, high trees diversity and abundant native trees, which can reduce the external disturb and protect the native trees. in addition, the matrix in the landscape is the patch that is flat, not adjacent to water and scatter woods has low fragmentation degree, smooth edge and near ellipse shape, which is adapted to matrix

    如,非水山地密林團聚分佈,邊界平滑,呈圓形,樹種樣性指數高,當地物種豐富,這種格能顯著降低外部干擾,保護主要當地物種,與核心斑塊的功能適應;非水平地疏林斑塊邊界平滑,近橢圓形,這種格有利於分散干擾危險,與本底斑塊的功能適應。
  6. Secondly, image enhancement technique based on linear filtering is adopted. a new image segmentation method by means of automatic multilevel threshold is given, which realizes partial multilevel threshold segmentation based on image region partition of gray - level position projection, removes the influence of uneven illuminance or uneven gray - level distribution on goal recognition, and resolves the problem of error segmentation caused by threshold step between adjacent regions by threshold transition. the method has well robustness

    在圖像處理時,採用基於線性濾波的圖像增強方法,並提出了一種新的自動閾值圖像分割方法,該方法以基於灰度位置投影的圖像分區實現閾值分割,克服了不均勻照明或不均勻灰度分佈對目標識別的影響,同時,通過閾值過渡很好地解決了區域閾值「階躍」引起的錯誤分割問題,具有很好的魯棒性。
  7. The main idea of this hybrid algorithm is : at first, all candidates in task collection is lined according to a dispatching rule ( earliest due date, edd ), then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier, many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier, the allocation of the resources over time is conducted to perform every feasible task sequence, and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed

    該演算法按照最早完工時間優先( ect )分派規則,先將參加排序的工序合併成一個串列序列,然後按照同層內不存在偏序關系的原則,將其分解為若干個時間上互銜接的層次,在每個層次內部,通過構造域產生出個可行序列,對每個可行序列進行設備配置,採用域搜索演算法進行方案的尋優,保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境,通過層層遞進最終獲取全的近似最優解。
  8. This research addressed an urban traffic intelligent control system, which adopts a multi - agents coordination in urban traffic control to coordinate the signal of adjacent intersections for eliminating the congestion of traffic network. an agent represents a signal intersection control, and multi - agents realize coordination of multiple intersections to eliminate congestion. based on recursive modeling method and bayesian learning that enables an agent to select his rational action by examining with other agents by modeling their decision making in conjunction with dynamic belief update. based on this method, a simplified multi - agent traffic control system is established and the results demonstrate its effectiveness. it is very important for its

    本文中提出一種城市交通智能控制系統,針對城市交通網路中交叉口的交通流可能互沖突,即部交通流的優化可能引起其他區域交通狀況的惡化的問題,採用智能體協調控制方法來協調交叉口處的控制信號消除網路中的交通擁塞.提出以一個智能體的方式實現一個信號燈交叉口控制,對個信號燈交叉口形成的交通網路採用智能體協調控制的方式實現網路流量優化來消除擁塞.文中提出由遞歸建模和改進的貝葉斯學習結合的智能體系統來使智能體可以確定其他智能體的準確模型並實時更新信息,並基於上述方法在簡單的交通網路模型上建立了智能體交通控制系統,模擬結果表明了方法的有效性,對實現智能交通系統有重要意義
  9. For every point on contour curves, the support area and support radius were first calculated based on actual distance of adjacent pixels, end points were obtained with linear interpolation technique ; next, the distance between point and its centroid of support area was used as feature strength to determine feature points candidate ; finally, those points with local maximum feature strength were selected as vertices of polygonal

    摘要首先基於像素間的歐氏距離計算出輪廓曲線上每一點的支持區域及支持半徑,用線性插值得到支持區域的端點;然後求得支持區域的質心,以曲線上的點和其應的支持區域質心之間的距離作為特徵響應篩選出候選特徵點;最後將具有部極大特徵強度的點作為邊形的頂點。
分享友人