Three-dimensional real-time graphics are a prevalent technology nowadays, thanks to the steady rise of processing power and specialized graphics hardware. One of the goals of computer graphics most sought after and difficult to achieve is to reproduce realistic outdoor environments featuring dense forests.
标签： Three-dimensional technology real-time prevalent
上传时间： 2014-01-15
上传用户：坏天使kk
一个开源heml语意分析器 ekhtml: The El-Kabong HTML parser SUMMARY: El-Kabong: A speedy, yet forgiving, SAX-stylee HTML parser. PROJECT INFORMATION: Web Site: ekhtml.sourceforge.net The web site contains links to locations where one can: - file bugs - join mailing lists - download the latest release - browse documentation - get CVS information BUILDING: See the file INSTALL for information、目标代码生成、符号表的构造和运行时存储空间的组织等8部分组成。
标签： El-Kabong forgiving SUMMARY ekhtml
上传时间： 2014-12-08
上传用户：dapangxie
/* Check_SST_39VF400A Check manufacturer and device ID /* CFI_Query CFI Query Entry/Exit command sequence /* Erase_One_Sector Erase a sector of 2048 words /* Erase_One_Block Erase a block of 32K words /* Erase_Entire_Chip Erase the contents of the entire chip /* Program_One_Word Alter data in one word /* Program_One_Sector Alter data in 2048 word sector /* Program_One_Block Alter data in 32K word block
标签： manufacturer Check_SST CFI_Query command
上传时间： 2013-12-15
上传用户：jjj0202
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
标签： Implemented following compile command
上传时间： 2014-01-01
上传用户：lhc9102
Hard-decision decoding scheme Codeword length (n) : 31 symbols. Message length (k) : 19 symbols. Error correction capability (t) : 6 symbols One symbol represents 5 bit. Uses GF(2^5) with primitive polynomial p(x) = X^5 X^2 + 1 Generator polynomial, g(x) = a^15 a^21*X + a^6*X^2 + a^15*X^3 + a^25*X^4 + a^17*X^5 + a^18*X^6 + a^30*X^7 + a^20*X^8 + a^23*X^9 + a^27*X^10 + a^24*X^11 + X^12. Note: a = alpha, primitive element in GF(2^5) and a^i is root of g(x) for i = 19, 20, ..., 30. Uses Verilog description with synthesizable RTL modelling. Consists of 5 main blocks: SC (Syndrome Computation), KES (Key Equation Solver), CSEE (Chien Search and Error Evaluator), Controller and FIFO Register.
标签： symbols length Hard-decision Codeword
上传时间： 2014-07-08
上传用户：曹云鹏
使用到的参数跟谈到弹性网络的那一章里头所讲的是一样的， ke 则是终止条件。如果 step 被打勾，则程式在每一步之间会暂停 100毫秒（或其他使用者输入的数值）。如果 Random 被打勾，则程式会以系统时间作为乱数产生器的种子数，否则，就以使用者输入的数（ Random 右边那一格）为种子数。 你可以利用 load 来载入推销员问题档与其最佳解，如此便可比较弹性网络所找出来的解与最佳解差了多少。 Central, Radius, and Error 这三个参数的前两个，只影响弹性网络的起使位置和大小，对求解没有影响。第三个参数代表城市与网络点之间的容忍距离，也就是说，如果某城市与某网络点之间的距离，小于容忍距离，那就把这个城市当成是被该网络点所拜访。 按下小 w按钮会将目前的结果与参数值写到“en.out”这个档案。使得我们可以很方便地来比较不同参数的效果。
上传时间： 2013-12-17
上传用户：84425894
it contains many classic Test Problems for Unconstrained Optimization such as camel6,treccani,goldstein,branin, shubert1,Ackley,dejong,dejong1,dejong2, dpower,rastrigin,Griewangk,Schwefel, rosenbrock2 and step. the package have the contour and mesh figures of these problem. it also give m files of these problems,and you can easily get your view of figures.
标签： Unconstrained Optimization contains Problems
上传时间： 2015-09-17
上传用户：bcjtao
Robustnesstochangesinilluminationconditionsaswellas viewing perspectives is an important requirement formany computer vision applications. One of the key fac-ors in enhancing the robustness of dynamic scene analy-sis that of accurate and reliable means for shadow de-ection. Shadowdetectioniscriticalforcorrectobjectde-ection in image sequences. Many algorithms have beenproposed in the literature that deal with shadows. How-ever,acomparativeevaluationoftheexistingapproachesisstill lacking. In this paper, the full range of problems un-derlyingtheshadowdetectionareidenti?edanddiscussed.Weclassifytheproposedsolutionstothisproblemusingaaxonomyoffourmainclasses, calleddeterministicmodeland non-model based and statistical parametric and non-parametric. Novelquantitative(detectionanddiscrimina-ionaccuracy)andqualitativemetrics(sceneandobjectin-dependence,?exibilitytoshadowsituationsandrobustnesso noise) are proposed to evaluate these classes of algo-rithms on a benchmark suite of indoor and outdoor videosequences.
标签： Robustnesstochangesinillumination conditionsaswellas perspectives requirement
上传时间： 2014-01-23
上传用户：whenfly
//Basic packet sending test at the MAC level, used for internal testing only. //This packet test has one node sending out a variety of //differently formatted packets to two assumed destination nodes.
标签： packet test internal sending
上传时间： 2014-08-21
上传用户：CSUSheep
Verilog and VHDL状态机设计，英文pdf格式 State machine design techniques for Verilog and VHDL Abstract : Designing a synchronous finite state Another way of organizing a state machine (FSM) is a common task for a digital logic only one logic block as shown in engineer. This paper will discuss a variety of issues regarding FSM design using Synopsys Design Compiler . Verilog and VHDL coding styles will be 2.0 Basic HDL coding presented. Different methodologies will be compared using real-world examples.
上传时间： 2013-12-19
上传用户：change0329
