The project Adventure is a simple text-based adventure game. The game, as given, involves the hero trying to find his way from a deep dark forest to home and his true love. There s very little else the player can do apart from moving from place to place. It s not really very interesting. This project can be of use beyond the given, rather boring forest adventure though. You can use it as a basis for developing your own adventure game with different, more interesting commands, areas, items, people and so on. The package ope.adventure contains classes to describe the game world.
标签： game text-based The Adventure
上传时间： 2014-01-15
上传用户：cursor
1.24位真彩色->256色灰度图。 2.预处理:中值滤波。 3.二值化:用一个初始阈值T对图像A进行二值化得到二值化图像B。 初始阈值T的确定方法是:选择阈值T=Gmax-(Gmax-Gmin)/3,Gmax和Gmin分别是最高、最低灰度值。 该阈值对不同牌照有一定的适应性,能够保证背景基本被置为0,以突出牌照区域。 4.削弱背景干扰。对图像B做简单的相邻像素灰度值相减,得到新的图像G,即Gi,j=|Pi,j-Pi,j-1|i=0,1,…,439 j=0,1,…,639Gi,0=Pi,0,左边缘直接赋值,不会影响整体效果。 5.用自定义模板进行中值滤波 区域灰度基本被赋值为0。考虑到文字是由许多短竖线组成,而背景噪声有一大部分是孤立噪声,用模板(1,1,1,1,1)T对G进行中值滤波,能够得到除掉了大部分干扰的图像C。 6.牌照搜索:利用水平投影法检测车牌水平位置,利用垂直投影法检测车牌垂直位置。 7.区域裁剪,截取车牌图像。
上传时间： 2014-01-08
上传用户：songrui
SimMetrics is a Similarity Metric Library, e.g. from edit distance s (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman). Work provided by UK Sheffield University funded by (AKT) an IRC sponsored by EPSRC, grant number GR/N15764/01.
标签： e.g. Levenshtein SimMetrics Similarity
上传时间： 2014-01-22
上传用户：cc1
It s a note about data structure. Tree---self balancing and rotate
标签： balancing structure rotate about
上传时间： 2014-03-11
上传用户：stewart·
It s a note on data structure---AVL tree, very clear and useful!
标签： structure useful clear note
上传时间： 2015-09-06
上传用户：wkchong
a file about dsp f2812 s power
上传时间： 2014-11-03
上传用户：diets
It s a some program which can do some typing and editing
标签： some program editing typing
上传时间： 2015-09-14
上传用户：璇珠官人
Computer System, A Programmer s Perspective全书
标签： Perspective Programmer Computer System
上传时间： 2014-09-07
上传用户：l254587896
O Reilly - Java 1.5 Tiger A Developer S Notebook JDK1.5的新特性
标签： 1.5 Developer Notebook Reilly
上传时间： 2013-12-26
上传用户：zl5712176
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included 2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value
标签： Traveling Salesman solution Problem
上传时间： 2013-12-22
上传用户：ruixue198909
