整數集 的英文怎麼說

中文拼音 [zhěngshǔjí]
整數集 英文
set of integer
  • 整 : Ⅰ形容詞1 （全部在內; 完整） whole; all; complete 2 （整齊） neat; tidy; orderly Ⅱ動詞1 （整理; 整...
  • 數 : 數副詞（屢次） frequently; repeatedly
  • 集 : gatherassemblecollect
  • 整數 : 1. （不含分數或小數的數） integer; whole number; integral number2. （沒有零頭的數目） round number; round figure
  1. Call a set of integers fat if each of its elements is at least as large as its cardinality.

    稱一個整數的集合為飽和的，如果它的每一個元素都至少不小於其基數。
  2. If we consider the integers with ordinary multiplication we have closure, associativity, and identity element.

    如果我們考慮整數集且用通常的乘法，我們有封閉性，可結合性，和一個單位元。
  3. We wish to make triples (x, y, z)from the integers｛1, 2, …, (n＋1)｝.

    我們要從整數集1、2、…（n1）中取三數組（x，y，z）。
  4. You can set report parameter properties that determine whether parameters are single - valued or multivalued, are visible at run time, use a static or query - based valid values list, have default values, and accept null or blank values

    < parametername > . count來返回集合中單個參數值的數量。您可以使用split或join函數拆分或組合數組中的值。可以使用string或cint函數將值轉換為字元串或整數。
  5. In this text, we first do some research on the genetic algorithm about clustering, discuss about the way of coding and the construction of fitness function, analyze the influence that different genetic manipulation do to the effect of cluster algorithm. then analyze and research on the way that select the initial value in the k - means algorithm, we propose a mix clustering algorithm to improve the k - means algorithm by using genetic algorithm. first we use k - learning genetic algorithm to identify the number of the clusters, then use the clustering result of the genetic clustering algorithm as the initial cluster center of k - means clustering. these two steps are finished based on small database which equably sampling from the whole database, now we have known the number of the clusters and initial cluster center, finally we use k - means algorithm to finish the clustering on the whole database. because genetic algorithm search for the best solution by simulating the process of evolution, the most distinct trait of the algorithm is connotative parallelism and the ability to take advantage of the global information, so the algorithm take on strong steadiness, avoid getting into the local

    本文首先對聚類分析的遺傳演算法進行了研究，討論了聚類問題的編碼方式和適應度函數的構造方案與計算方法，分析了不同遺傳操作對聚類演算法的性能和聚類效果的影響意義。然後對k - means演算法中初值的選取方法進行了分析和研究，提出了一種基於遺傳演算法的k - means聚類改進（混合聚類演算法） ，在基於均勻采樣的小樣本集上用k值學習遺傳演算法確定聚類數k ，用遺傳聚類演算法的聚類結果作為k - means聚類的初始聚類中心，最後在已知初始聚類數和初始聚類中心的情況下用k - means演算法對完整數據集進行聚類。由於遺傳演算法是一種通過模擬自然進化過程搜索最優解的方法，其顯著特點是隱含并行性和對全局信息的有效利用的能力，所以新的改進演算法具有較強的穩健性，可避免陷入局部最優，大大提高聚類效果。
  6. The other classfies the calculation of mbps into the solution of inequation based on heuristic knowledge of mbps of optimal directional coordination setting in complex multiloop network and comes into equivalence of 0 - 1 integral second layout problem. on the basis of the principle of gene optimal evolution, a new approach to determine mbps is first presented and decreases the computational complexity of mbps problem

    其二，利用復雜環網方向保護最優整定配合中最小斷點集（ mbps ）的啟發知識，將mbps的計算歸結為解不等式，進而等價為0 ? 1整數二次規劃問題，基於基因遺傳優化計算原理，首次提出了mbps問題的基因遺傳演算法，降低了問題的計算復雜性。
  7. Some questions about integral set comstruction in numeral sysytem expanding

    關于數系擴充中整數集構造的若干問題
  8. Using method of oil - flow visualization techniques and measuring pressure distribution along airfoil chordwise and spanwise studies have been down for sidewall boundary - layer displacement effect in two - dimensional wind tunnel. three different chord models were tested in two different wind tunnel. in order to clarify the sidewall effects and study method of sidewall suction theory and sidewall interference correction method to remove effects of sidewall on model. the results of oil - flow test show that selection rational suction wary can obtain better testing results. by investigations on effects of the sidewall boundary layer suction and application of a sidewall interference correction method

    為了很好地解決多機場航班隊列的擁塞問題，在將進場容量、離場容量與機場容量作為統一整體的情況下，充分考慮了機場間的網路效應，詳細研究了多機場航班隊列的優化問題，建立了多機場開放式非實時流量管理的數學模型，通過選取適當的決策變量，使其為線性0 - 1整數規劃模型，實現了中心流量集中管理.與其它演算法不同，本文提出的啟發式隱枚舉演算法能很好地解決此類問題，對某機場網路系統的模擬結果證明了所建模型、優化演算法及相應軟體的有效性和可靠性
  9. We propose in this paper an evaluation method for the transient performance of das, through the period signal, by utilizing the much smaller difference than sampling period between the multi - periods of signal and the multi - sampling periods, getting shorter equivalent sampling period ( i. e. higher equivalent sampling rate ), which is derived from input signal period and sampling period, and then, the problem that how to get the transient performance of das has been solved. the transfer function of das is then evaluated and identified, and practical test results are also presented

    本文介紹一種方法，通過對其加載特定的周期性輸入信號，使用采樣周期的整數倍和信號周期整數倍間的微小偏差，獲得比實際采樣周期小得多的等效采樣周期，從而解決了數據採集系統瞬態響應特性的獲取問題；並進而獲得了數據採集系統傳遞函數的辨識和評價結果，實現了數據採集系統瞬態特性的總體評價。
  10. Converts a subset of an array of 8 - bit unsigned integers to its equivalent

    將8位無符號整數數組的子集轉換為其等效的、用以64為基的數字編碼的
  11. Converts a subset of an 8 - bit unsigned integer array to an equivalent subset of a unicode character array encoded with base 64 digits

    將8位無符號整數數組的子集轉換為用base 64數字編碼的unicode字元數組的等價子集。
  12. A k - role assignment of graph is an assignment of role, if g is a graph, a k - role assignment is a surjective function mapping each vertex into a positive integer 1, 2. . . k, so that if x and y have the same role, then the sets of roles assigned to their neighbors are the same

    -角色分配就是一個角色分配，也稱為角色染色。 g是一個圖， -角色分配就是把圖上各頂點映到正整數{ 1 ， 2 ， … ， }的一個滿射函數，它滿足：如果x和y有相同角色，那麼與之相鄰接的點的角色集合也相同。
  13. Its vertices are located at all points of the form ( i1, i2 ) or each vertex has six neighbors. the six neighbors of the vertex v are the set of vertices the set of edges e the model of the hexagonal lattice the usual way to imbed the hexagonal lattice is such that its face are regular hexagons. the vertices are the points. the origin is in the center of one of the hexagons and the periods are (, 0 ) and ( 0, 3 )

    頂點集合為為整數邊的集合為相鄰}正六邊形點格模型為：平面是由正六邊形點格組成，它的頂點坐標為其中，原點在一個正六邊形的中心，周期為（ 3 ~ （ 1 / 2 ） ， 0 ）和（ 0 ， 3 ）我們可以把它在豎直方向壓縮1 3 ~ （ 1 / 2 ）倍使它成為周期圖。
  14. In this paper, we first introduce the achivements of the research on bruck - reilly semigroups in these years, then we study block - separating congruences lattices on e - bisimple semigroups. let / be the set of natu ral numbers, and i the set of all nonnegative integers

    設i為自然數集合， i ~ 0為所有非負整數集合， t為任意幺半群， g為幺半群t中所有單位組成的群，用1來記t中的幺元。
  15. Secondly, in the first phase, this paper solves the inventory supplement sub - problem through integer programming model, using the reduction of vehicle routes as the breakthrough to this problem, divides a whole distribution region into many customer subsets by radius - circle partitioning method, determines the optimal number of vehicle of service distribution region, applies two practice - oriented conclusions to reduce the number of routes on the basis of customer grouping, thus decreases considerably the variable scale of integer programming, and solves the problem through professional software to fix inventory supplement plan in plan period

    其次，在第一階段使用整數規劃數學模型來規劃庫存補充計劃子問題，以減少車輛巡迴路線數目為求解該整數規劃的突破口，提出與固定劃分策略（ fpp ）相似的客戶分組思想，通過徑?環切割法把整個配送區域劃分成多個客戶子集，實現客戶分組並確定服務整個配送區域的最佳車輛數目。在客戶分組的基礎上建立了精簡路線的整數模型，然後通過運用兩條基於實際經驗的判斷來進一步減少巡迴路線數目，進而極大地減少了整數規劃的變量規模，並利用專業的求解軟體來求解該整數規劃問題，從而確定計劃期的庫存補充計劃。
  16. Wang rongming ( 1993 ) calculated the extinction probabilities for a clas s of random walk in a random environment with the set of non - negative integers as state space

    汪榮明（ 1993 ）求出了狀態空間為非負整數集的隨機環境中隨機游動的滅絕概率，並得到明確的表達式。
  17. You can then treat each named value as an instance of that class, providing you with compile - time type safety that a named set of integers can t

    然後，可以將每個指定的值看作是那個類的一個實例，這為您提供了指定的整數集合所無法提供的編譯時類型安全。
  18. By choosing the tune scale to be the set of real numbers, it yields a differential equation, and by choosing the time scale to be the set of integers, it yields a difference equation

    如果選擇時間模是實數集r ，它就是通常的微分方程；如果選擇時間模是整數集z ，那麼它就是差分方程了。
  19. Extinction probabilities for the generalized random walk in random environments with the set of non - negative integers as state space

    求出了狀態空間為非負整數集的隨機環境中廣義隨機游動的滅絕概率。
  20. Solomon ( 1975 ) introduced the concept of random walk in a random environment, proved the existence of the model on the set of integers, and obtained its limit theorems

    Solomon （ 1975 ）引進了隨機環境中隨機游動的概念，在整數集上證明了該模型的存在性，並得到了它的極限定理。
分享友人
分享到 Line

分享到臉書