node in a network 中文意思是什麼

node in a network 解釋
網點
  • node : n 1 節；結；瘤；【蟲類】結脈。2 【植物；植物學】莖節；【醫學】硬結腫；結，節結；【天文學】交點。3...
  • in : adv 1 朝里，向內，在內。 A coat with a furry side in有皮裡子的外衣。 Come in please 請進來。 The ...
  • a : an 用在以母音音素開始的詞前〉 indefinite art 1 〈普通可數名詞第一次提到時，冠以不定冠詞主要表示類...
  • network : n. 1. 網眼織物。2. （鐵路、河道等的）網狀系統，網狀組織，廣播網，電視網，廣播[電視]聯播公司。3. 【無線電】網路，電路。4. 【計算機】電腦網路，網。
  1. Instead, a custom facing ratio is computed using a vector product utility node in the shading network

    相反地，一個特定的分形比率是在材質網路里使用一個積向量功能節點來計算的。
  2. To improve the accuracy of node trust evaluation in a distributed network, a trust model based on the experience of individuals is proposed, which establishes a new trust assessment system by introducing the experience factor and the comparative experience factor. the new evaluation system considers the differences between individuals and interactive histories between nodes, which solves the problem that nodes have inaccurate assessments due to the asymmetry of nodes to a certain extent. the algorithm analysis indicates that the new model uses different deviating values of tolerance evaluation for different individuals and uses different updating values embodying node individuation when updating feedback credibility of individuals, which evaluates the trust value more reasonably and more accurately. in addition, the proposed algorithm can be used in various trust models and has a good scalability

    為了提高分散式網路中各節點信任評價的準確度，提出了一種基於個體經驗的信任模型.該模型通過引入經驗因子和相對經驗因子的方法，建立了新的信任評價體系.這種新的信任評價體系考慮了個體節點的差異問題，在計算節點的信任值時考慮了節點間的交互歷史，這在一定程度上解決了由於節點的非對稱性而導致的信任評價不準確的問題.演算法分析表明:新模型能夠針對不同的個體節點，採用不同的最大容忍評價偏差，並且對個體節點的反饋可信度進行更新時，採用不同的更新值，體現了節點的個性化特徵，使信任評價更加準確合理.此外，所提出的新演算法能夠運用到多種信任模型中，具有很好的可擴展性
  3. Network nodes are divided into clusters in geocrp, sensor nodes send data to their cluster heads and these data are transferred between cluster heads until they reach the sink node, such a hierarchical network structure can increase scalability of the network

    Geocrp將網路中的節點劃分成簇，感知節點採集的數據首先傳送到其所在簇的簇頭，再通過簇頭之間的通信進行簇間中繼，直到到達匯聚節點。
  4. In the second section of chapter 2, the fact that the essential interest rates of all nodes differ from each other is discussed, a non - homogeneous differential equation model of interest rate - amount of circulating fund is established, and it is proved that the sum of the weighted interest rates of each node in the financial network still remains a constant and that the difference of the instant interest rates between two nodes will finally approach the difference between their basic interest rates. in the third section of chapter 2, the differential equation model of interest rate - amount of circulating fund in an open system is studied, the laws of changes of interest rate are taken into account when fund is injected into or withdrawn from the node or when fund is injected into the network or withdrawn from the network, and the stability of equilibrium solution is proved based upon lyapunov stability theory. in the last, the equation model of interest rate - amount of circulating fund in the financial network with time delay is studied, and a necessary and sufficient condition for the existence of periodic solution is obtained to the interest rate - amount of circulating fund equation with delay

    本文第二章首先建立了封閉系統的利率?流通量微分方程模型，證明了各結點利率加權和為常數即金融市場利率均衡原理，以及各結點利率極限為整個網路平均利率；其次在各結點基本利率不相同的情況下，建立了非齊次利率?流通量微分方程模型，證明了金融網路各結點利率加權和仍是一個常數，並證明了各結點兩兩之間的即時利率之差最終將穩定地趨于其基本利率差；此外，還研究了開放金融網路利率?流通量方程模型，考慮了結點自身追加資金和提走資金的情形以及網路外部注入資金和向外部轉移資金情形下的利率變化規律，用lyapunov穩定性理論證明了模型均衡解的穩定性；最後，還研究了具有時滯的金融網路利率?流通量方程模型，並給出了具有時滯金融網路的利率流通量方程具有周期解的充要條件。
  5. Packet flooding is a way to distribute routing information updates quickly to every node in a large network

    小包泛濫是在龐大網路上把路由更新資訊迅速地發布給所有節點的方法。
  6. The type of node structure realizing multi - granularity optical swithing in ason is put forward and a multi - granularity optical switch using this structure is developed. the software for controlling the node in ason is compiled. the experimental research is carried out with campus network as signalling network and the data network is of mesh architecture, which is a typical architecture in ason

    本文提出了一種適用於自動交換光網路的多粒度光交換節點結構，並採用該結構研製出了多粒度光交換機開發了ason的節點控制軟體數據網採用ason的典型結構格狀網，利用校園網作為信令網進行了實驗研究，驗證了ason的主要功能。
  7. As soon as you connect one of it ' s output attributes to another node in a shading network, it will be evaluated as part of that shading network

    在一個材質網路里你連接它的一個輸出屬性到另一個節點里，它就計算為那個材質網路的一部分。
  8. With regard to the flow regulation of the best - effort traffic, the controllable traffic in high speed computer communication networks, the present paper proposes a novel control theoretic approach that designs a proportional - integrative ( pi ) controller based on multi - rate sampling for congestion controlling. based on the traffic model of a single node and on system stability criterion, it is shown that this pi controller can regulate the source rate on the basis of the knowledge of buffer occupancy of the destination node in such a manner that the congestion - controlled network is asymptotically stable without oscillation in terms of the buffer occupancy of the destionation node ; and the steady value of queue length is consistent with the specified threshold value

    本文從控制理論的角度出發，針對計算機高速網際網路中最大服務交通流即能控交通流的調節問題提出了一種基於多速率采樣的具有比例積分（ pi ）控制器結構的擁塞控制理論和方法，在單個節點的交通流的模型基礎上，運用控制理論中的系統穩定性分析方法，討論如何利用信終端節點緩沖佔有量的比例加積分的反饋形式來調節信源節點的能控交通流的輸入速率，從而使被控網路節點的緩沖佔有量趨于穩定;同時使被控網路節點的穩定隊列長度逼近指定的門限值。
  9. Because bad weather ? thick fog, mainly ? can severely curtail the reach of these line - of - sight devices, each optical transceiver node, or link head, can be set up to communicate with several nearby nodes in a network arrangement

    因為壞天氣（主要是濃霧）會大幅縮短這些視線設備的傳輸距離，因此每個光收發節點（或稱連結端）的設立地點，必須可以和網路配置里的多個鄰近節點進行溝通。
  10. The main principles for the definition of the different nodes in a network are given, and the characteristic of the real - time control is thoroughly analyzed. furthermore, great emphasis has been put to discuss node design and network design

    文中討論了節點的組合原則，分析了網路的實時性，重點論述了節點設計、組網設計以及軟體設計。
  11. One defines break points based on node degree with comparing the amount of all backup protections in a mutiloop network. it is testified by practice to have legitimacy and feasibility with simple theory and improve efficiency a lot of protection coordination setting

    其一，運用網路節點度的概念，通過比較環網中所有保護的后備保護的數量的大小來確定斷點，理論上簡單合理，實踐證明正確可行，極大的提高了保護整定配合的效率。
  12. This, in turn, makes obvious the need for the concept of on - demand computing, which might be implemented on any configuration, from a simple cluster of servers to a network of 1024 - node sp2s

    而這又明顯地需要按需計算的概念（ on - demand computing ） ，按需計算可能是在任何配置下實現的，從簡單的服務器集群到有1024個節點的sp2網路。
  13. In communications ， a network topology in the form of a ring so that each node is connected only with two neighbours on each side

    在通信技術中，一種環形的網路拓樸，其中每個節點只在兩側各與相鄰的一個節點連接。
  14. I ve included the times for building with plain gcc, ccache gcc, and ccache distcc gcc in a four - node network with various values of concurrent distcc jobs

    其中包括使用普通gcc 、 ccache + gcc 、 ccache + distcc + gcc所需的編譯時間，編譯在一個四節點網路中進行並選用了不同的並發distcc作業數目值。
  15. Abstract by setting up a network model of data aggregation and using a bit - hop metric to quantify energy costs in wireless sensor networks, we formally analyze the problem of area - based data aggregation and obtain that data aggregation will definitely be energy efficient when the relative difference between the average lengths of the two shortest paths, which are from source sensor nodes to the sink and to the aggregation node respectively, is not less than the ratio of data correlation to the number of source sensor nodes

    摘要通過抽象出無線傳感器網路中區域數據回傳的網路模型，定量研究了區域數據聚合的節能條件，證明了先聚合再回傳比直接進行數據回傳所節省的相對路徑長度，如果大於等於數據相關性與源節點個數的比值時，區域數據聚合一定可以節省能耗，並進一步給出了當數據聚合點在網路的不同位置，或數據的空間相關性不同時，區域數據聚合的節能條件。
  16. The third chapter of the thesis makes a study of the equation of interest rate - amount, of circulating fund on limited occasions of sudden events, proves that the network average interest rates of different time periods are also different and change with the impulsive conditions, and makes clear the relationship between the network average interest rates of two neighboring time periods. as far as every node in the network is concerned, its instant interest rate will tend to, in the end, at the sum of the basic interest rate of every node and the growth rate of the network

    本文第三章研究了出現有限次突發事件時的利率?流通量方程，證明了不同時間段的網路平均利率也不相同，並且，隨脈沖條件的變化而變化，同時給出了相鄰兩個時間段網路平均利率之間的關系，就網路中每個結點而言，其即時利率最終穩定於結點基本利率與網路增長率之和。
  17. By assigning a " split ratio value " on the singular node, the singular equation in the network can be preserved

    另外為避免移除奇異方程式所造成的問題，在本研究中提出兩種解決之方法。
  18. Abstract : in a network system, overflow or overwrite of message buffer will cause missing of messages. for a timed token network, message transmission time and the message buffering space allocation in a node are very important issues on network real time capability. this paper analyses the message buffering mechanism, describes the relationship of message buffering space and message transmission bandwidth allocation, and proposes a space determination method of message buffer for ltpb network. the maximum space redundancy avoiding buffer overflow for “ send ” and “ receive ” buffers has been derived. it is found that the space of “ send ” and “ receive ” buffers is equal to the message size under condition that the message gap time is greater than message latency and node response time

    文摘:在網路系統中，節點緩沖區內消息發生覆蓋或溢出會造成消息的丟失，對于限時令牌網路，節點消息發送時間和消息緩沖容量的分配是影響消息實時性的重要因素.針對令牌傳遞網路分析了節點消息緩沖機制，說明了消息緩沖容量的確定與網路帶寬分配方法的關系，並提出了消息緩沖容量的確定方法，導出了避免消息覆蓋或溢出所需的最大發送和接收緩沖容量余度.指出在消息的產生間隔大於該消息的最大允許的延遲時間和接收節點響應時間的條件下，發送和接收端的消息緩沖容量等於被緩沖消息的長度
  19. In a network system, overflow or overwrite of message buffer will cause missing of messages. for a timed token network, message transmission time and the message buffering space allocation in a node are very important issues on network real time capability. this paper analyses the message buffering mechanism, describes the relationship of message buffering space and message transmission bandwidth allocation, and proposes a space determination method of message buffer for ltpb network. the maximum space redundancy avoiding buffer overflow for “ send ” and “ receive ” buffers has been derived. it is found that the space of “ send ” and “ receive ” buffers is equal to the message size under condition that the message gap time is greater than message latency and node response time

    在網路系統中，節點緩沖區內消息發生覆蓋或溢出會造成消息的丟失，對于限時令牌網路，節點消息發送時間和消息緩沖容量的分配是影響消息實時性的重要因素.針對令牌傳遞網路分析了節點消息緩沖機制，說明了消息緩沖容量的確定與網路帶寬分配方法的關系，並提出了消息緩沖容量的確定方法，導出了避免消息覆蓋或溢出所需的最大發送和接收緩沖容量余度.指出在消息的產生間隔大於該消息的最大允許的延遲時間和接收節點響應時間的條件下，發送和接收端的消息緩沖容量等於被緩沖消息的長度
  20. An algorithm for routing mobile agents is proposed to cover every node in a wireless sensor network

    摘要研究了一種基於移動代理的無線傳感網路節點覆蓋演算法。
分享友人
分享到 Line

分享到臉書