optimal coding 中文意思是什麼
-
It is aimed, from the perspectives of both speaker and hearer, to analyze and discuss the four cognitive and pragmatic factors influencing the coding and decoding of bridging reference : accessibility, givenness hierarch, shared knowledge, and optimal relevance as well as their roles in the coding and decoding of the special reference
從話語交際雙方出發，分析影響確定性橋接參照構建與解讀的若干認知語用因素可及性、已知性、共識性和最佳關聯性，以及它們在橋接參照構建和指稱確認過程中各自的作用。 -
In the proposed method, the controller takes the buffer length as congestion indication, takes sources quality and bandwidth utility as object function so as to learn on line. as the controller outputs, the coding rate for input traffic sources and the corresponding user percentage are used to adjust the cells " arrival rate to the multiplexer buffer. compared with the previous method where cells " arrival rate is tuned only by the encoding rate and the encoding rates for all input traffic sources are regulated in a body, the proposed method guarantee that the quality of cells are optimal while cell loss rate is minimized, which means quality of service is guaranteed
在該方法中，擁塞控制器以緩沖區大小信元作為擁塞指示，以信源質量和帶寬利用率作為目標函數進行在線學習，控制器輸出包括信源編碼率及其對應的用戶數在全部用戶中所佔的百分比，即根據信源編碼率及對應的用戶百分數調整信源輸入流，從而克服了以往擁塞控制方法中僅僅調整編碼率帶來的對所有信源進行整體調整的缺陷，使控制系統在信元損失率最小情況下確保信源輸入流質量最高，從而有效地利用了網路帶寬。 -
In this paper, a genetic algorithm was presented to solve the problem of the searching of the optimal coalition structure. we designd one - dimension chromosome coding structure and the corresponding improved uniformity crossover operator and the heuristic mutation operator
我們給出了一種求解最佳聯盟結構的gas演算法，設計出了一種簡單的一維自然數染色體編碼結構和改進的均勻交叉運算元以及啟發式變異運算元。 -
The intent is to clarify the concepts rather than to express optimal coding conciseness and style
其目的是闡明概念，而不是表述最佳的編碼簡明程度和風格。 -
Cascaded low - density erasure codes are based on sparse random bipartite graphs. very efficient linear time encoding and erasure recover algorithms with the arbitrarily near erasure channel capacity performance of the codes with respect to the algorithms have made them one of the most optimal coding techniques up to now
基於稀疏隨機二部圖的級聯型低密度糾刪碼因其線性時間的編譯碼演算法和可任意逼近刪除通道容量限而成為目前最佳編碼技術之一。 -
Coding of audio - visual objects - part 2 : visual. iso iec 14496 - 2 mpeg - 4 visual version 1, 1999. 9 lakhani g. optimal huffman coding of dct blocks
Cavlc熵編碼器採用上下文技術挖掘塊內系數的相關性，獲得了較高的編碼效率，但其設計來源於對4x4塊進行編碼。 -
Reinforcement learning algorithms that use cerebellar model articulation controller ( cmac ) are studied to estimate the optimal value function of markov decision processes ( mdps ) with continuous states and discrete actions. the state discretization for mdps using sarsa - learning algorithms based on cmac networks and direct gradient rules is analyzed. two new coding methods for cmac neural networks are proposed so that the learning efficiency of cmac - based direct gradient learning algorithms can be improved
在求解離散行為空間markov決策過程（ mdp ）最優策略的增強學習演算法研究方面，研究了小腦模型關節控制器（ cmac ）在mdp行為值函數逼近中的應用，分析了基於cmac的直接梯度演算法對mdp狀態空間離散化的特點，研究了兩種改進的cmac編碼結構，即：非鄰接重疊編碼和變尺度編碼，以提高直接梯度學習演算法的收斂速度和泛化性能。 -
In the last section, we show how entangled states are used in quantum dense coding, quantum cryptography and quantum teleportation. a new valuable scheme based on linear optical elements about teleportation of two - photon and multi - photon entangled states also has been proposed in this section. in this scheme t he probability of the successful teleportation is 50 %, which is optimal
量子糾纏在量子信息中的應用這一章中，我們將首先分別介紹量子糾纏在量子密集編碼，量子密鑰分佈，量子隱形傳態中的應用，然後提出一種利用線性光學方法實現糾纏態的隱形傳送方案，此方案的成功率為50 ，這也是目前為止最佳的成功幾率。 -
Ec employs a coding technology and some genetic operations. under the pressure of selection, which means " fits survive ", the algorithm can produce an optimal solution
它採用簡單的編碼技術來表示各種復雜的結構，並通過對編碼進行簡單的遺傳操作和優勝劣汰的自然選擇來指導學習和確定搜索的方向。 -
Dual coding hybrid genetic algorithm for optimal schedule of pumping stations in multi - sources water injection system
多源注水系統泵站優化調度的雙重編碼混合遺傳演算法 -
The coding of the variables that describe the problem is always large. in order to find the best optimal result, it needs the larger population and the longer course of optimization. that will spend much time and money, so the appropriate population size is a factor that affects the efficiency of genetic algorithm
在應用遺傳演算法時，初始種群的產生一般是隨機的，它往往需要的編碼長度很大，導致需要很大的種群規模或者很長的進化過程才能有較好的優化效果，這將耗費大量的計算時間和費用。 -
At the same time, this thesis analyz es the optimal resourse allocation problem in video coding and reviews recent advances in rate - distortorn optimized video coding
同時本文還分析了視頻編碼中的最佳資源分配問題，詳細討論了率失真優化理論在信源編碼和通道編碼中應用的最新進展。 -
In detail, they are bit - interleaved coded modulation ( with iterative decoding ), low - density parity - check codes and stf technology. by the performance analysis of bicm ( - id ), which can make code and modulation optimal separately, and achieve maximum possible coding diversity as well as modulation gain, guidelines for its design and an easy algorithm for siso are proposed. design of capacity - approaching of ldpc codes and efficient encoding of them as well as several kinds of its decoding algorithms are investigated
具體的講，就是討論了基於比特交織的編碼調制技術，並給出了映射方式的設計準則以及核心模塊siso的一種簡單的f - map演算法；研究了編碼最小漢明距隨碼長線性增加的ldpc碼的幾個方面的問題，包括接近香農限碼子集的度分佈對的設計、有效編碼器的實現和各種譯碼演算法的優缺點，並對基於ldpc碼的bicm應用於ofdm傳輸系統中的性能進行了模擬。 -
Throughputs of adaptive modu - lation, adaptive coding, and joint adaptation schemes are analyzed, and optimal switch - ing threshold of snr is obtained. in comparison with non - adaptive harq, adaptive schemes can get much higher throughput in the given cell. among the three adaptive schemes, adaptive modulation is t
分析了自適應調制、自適應編碼和聯合自適應方案在小區中的流量特性，得到了最優的切換門限，比較了自適應與非自適應harq的流量，以及三種自適應方案的優劣，其中自適應harq流量特性明顯好於非自適應harq 。 -
They are not meant to teach assembly language programming or to present an optimal coding solution
這些示例並不旨在講授匯編語言編程或介紹最佳的編碼解決方案。 -
Three improvements were proposed. that is : coding the chromosome with floating point numbers, selecting different optimal strategy according to the electric dimension of the target, utilizing subsection varying parameter genetic algorithm to avoid trapping in premature convergence. the optimization time was saved significantly after adopting these methods
針對球面和半球面結構的雷達吸波材料優化設計時間長，提出三點改進方法：染色體採用浮點數編碼；依據優化目標的電尺寸採用不同的優化策略；優化過程中採用分段變參數的優化方法。 -
A selection method of serm factorizations for linear transforms is presented. it is discovered that the near optimal results are almost everywhere and when the factorization error is small, the closer the permutation matrices, the closer the results. according this fact, a local search is proposed that based near optimal factorization method which can obtain the near optimal results. moreover, this method convergence very fast, can usually obtain useful results by very limited iterations. it is tested lossless image coding with the selection results and good results is obtained
通過大量的實驗，發現serm分解的近似最優結果是大量存在的，而且這些近似最優結果的分佈是分散的，當分解結果的誤差度量比較小時的時候，有當置換矩陣相近時，分解結果的誤差也相近的實驗事實。基於此觀察結果，給出了基於局部搜索的serm分解的近似最優分解方法，可以得到非常接近最優分解的結果。 -
This month, we revisit the subject from a different point of view - how the jvm handles thrown exceptions - and we ponder whether optimal exception coding should be considered a premature optimization or a best practice
這個月，我們換一個角度再來看這個主題jvm如何處理所拋出的異常並且我們要考慮，最理想的異常編碼應該看成是早期的優化還是最優方法？ -
In the optimal design of loop pipe networks, an improved genetic algorithm ( ipga ) based on integer coding is introduced in this paper. not only the problem of coding redundancy is avoided, but also the practicability and computation efficiency are greatly improved. also the optimal calibre combination scheme can be got within a larger solution space and the goal of less investment is realized
應用基於整數編碼的改進遺傳演算法進行環狀管網管徑優化設計，既可避免編碼冗餘問題，又可提高演算法的實用性和計算效率，並能在較大解空間范圍內獲得最優管徑組合方案以實現盡可能小的管網投資。 -
The visual quality of decoded video information is improved at some extent and psnr value of luminance parts is increased nearly 1 db in error - prone channel. 4. an adaptively rd - optimal coding algorithm was proposed to be aimed at the computing redundancy in h. 264 recommendation algorithm
針對h . 264標準率失真優化編碼演算法中存在的計算冗餘過大問題，提出了一種自適應率失真優化編碼演算法，將h . 264標準演算法中求解解碼重構視頻信息期望失真度的代數和平均演算法，改進為加權和平均演算法。
分享友人