Internationalization The Java盲 2 platform provides internationalization features that let you separate culturally dependent data from the application (internationalization) and adapt it to as many cultures as needed (localization).
標(biāo)簽： Internationalization internationalization platform features
上傳時間： 2017-04-29
上傳用戶：hakim
伸展樹，基本數(shù)據(jù)結(jié)構(gòu)，The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.
標(biāo)簽： 樹
上傳時間： 2017-05-07
上傳用戶：JIUSHICHEN
ZigBee路由協(xié)議指的是ZigBee規(guī)范中規(guī)定的與路由相關(guān)的功能和算法部分，主要包括不同網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)下ZigBee協(xié)議數(shù)據(jù)單元的路由方式、路由發(fā)現(xiàn)和路由維護(hù)等內(nèi)容。為了達(dá)到低成本、低功耗、可靠性高等設(shè)計(jì)目標(biāo)，ZigBee網(wǎng)絡(luò)采用了Cluster-Tree與AODV路由相結(jié)合的路由算法。該包實(shí)現(xiàn)了ZIGBEE路由算法在NS2下的模擬
標(biāo)簽： ZigBee 路由協(xié)議 路由 算法
上傳時間： 2017-05-14
上傳用戶：WMC_geophy
一個實(shí)現(xiàn)struts+spring+hebernate的例子，外加一個JavaScript實(shí)現(xiàn)的tree的都OK了。
標(biāo)簽： hebernate struts spring
上傳時間： 2013-11-25
上傳用戶：skhlm
Huffman codes 1.In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0 s and 1 s? 2.To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. 3.This problem can be solved by using an extended binary tree which is used in the 2-way merging problem. the sourse code is to encode and decode the Huffman.
標(biāo)簽： telecommunication represent messages Huffman
上傳時間： 2013-12-22
上傳用戶：ztj182002
Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound. 2.If a constant subtracted from any row or any column of the cost matrix, an optimal solution does not change.
標(biāo)簽： branch-and-strategy Salesperson Traveling solution
上傳時間： 2013-12-29
上傳用戶：璇珠官人
) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
標(biāo)簽： code Compression huffman provide
上傳時間： 2017-05-30
上傳用戶：yuchunhai1990
Buses are a powerful and efficient modeling construct. Using them to produce optimal code is dependent on following a basic set of best practices. This document provides a set of patterns that can be followed the best results
標(biāo)簽： efficient construct powerful modeling
上傳時間： 2013-12-15
上傳用戶：cc1015285075
Index NAME 總覽 (SYNOPSIS) 警告 (WARNING) 描述 (DESCRIPTION) 選項(xiàng) (OPTIONS) 總體選項(xiàng) (Overall Option) 語言選項(xiàng) (LANGUAGE OPTIONS) 預(yù)處理器選項(xiàng) (Preprocessor Option) 匯編器選項(xiàng) (ASSEMBLER OPTION) 連接器選項(xiàng) (LINKER OPTION) 目錄選項(xiàng) (DIRECTORY OPTION) 警告選項(xiàng) (WARNING OPTION) 調(diào)試選項(xiàng) (DEBUGGING OPTION) 優(yōu)化選項(xiàng) (OPTIMIZATION OPTION) 目標(biāo)機(jī)選項(xiàng) (TARGET OPTION) 機(jī)器相關(guān)選項(xiàng) (MACHINE DEPENDENT OPTION) 代碼生成選項(xiàng) (CODE GENERATION OPTION) PRAGMAS 文件 (FILE) 另見 (SEE ALSO) BUGS 版權(quán) (COPYING) 作者 (AUTHORS) [中文版維護(hù)人] [中文版最新更新] 《中國Linux論壇man手冊頁翻譯計(jì)劃》 NAME gcc,g++-GNU 工程的 C和 C++編譯器(egcs-1.1.2
標(biāo)簽： DESCRIPTION SYNOPSIS OPTIONS Overall
上傳時間： 2014-01-03
上傳用戶：evil
The emphasis of this book is on real-time application of Synopsys tools, used to combat various problems seen at VDSM geometries. Readers will be exposed to an effective design methodology for handling complex, submicron ASIC designs. Significance is placed on HDL coding styles, synthesis and optimization, dynamic simulation, formal verification, DFT scan insertion, links to layout, physical synthesis, and static timing analysis. At each step, problems related to each phase of the design flow are identified, with solutions and work-around described in detail. In addition, crucial issues related to layout, which includes clock tree synthesis and back-end integration (links to layout) are also discussed at length. Furthermore, the book contains in-depth discussions on the basics of Synopsys technology libraries and HDL coding styles, targeted towards optimal synthesis solution.
標(biāo)簽： application real-time Synopsys emphasis
上傳時間： 2017-07-05
上傳用戶：waitingfy
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
