This directory contains the memtest 8051 firmware for the Anchor Chips EZ-USB chip. The purpose of this software is to test the different memory segments in the Ez-Usb chip. This example will output the string "good" on the 7 segment LED if the mem test passes, or it will output the first address where the memtest fails.
标签： directory the contains firmware
上传时间： 2013-12-16
上传用户：gdgzhym
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
标签： represented integers group items
上传时间： 2016-01-17
上传用户：jeffery
EPS_Java Projec is JAVA program can display charts, and handle waypoints, track, and routes. It reads output from the gpstrans program. gpstrans can communicate with Garmin GPS navigators.
标签： and waypoints EPS_Java display
上传时间： 2016-01-22
上传用户：2404
This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen.
标签： code implementing directory algorithm
上传时间： 2014-01-15
上传用户：woshini123456
ucos的WINDOWS版！通过官方的移植版制作，重新创建了VC工程，使用WIN32界面而不是原版的控制台窗口，可以很方便的在上面移植UCGUI，只要修改底层绘图函数即可！并且程序中可以输出调试信息到OUTPUT窗口，可以很方便地进行模拟开发。
上传时间： 2014-01-16
上传用户：czl10052678
A new cable fault location method based on wavelet reconstruction is proposed. In this method the difference between the currents of faulty phase and sound phase under the high voltage pulse excitation is used as the measured signal and is decomposed in multi-scale by wavelet transform, then reconstructed in single scale. Comparing with traditional fault location method by travelling wave, the presented method will not be interfered by the reflected wave from the branch joint of cables or from other positions where the impedances are not matched and not be influenced by fault types, otherwise, the reflected waves can be recognized even the faulty position is near to the measuring terminal, at the same time, the influence of the wave speed uncertainty can be reduced. The correctness of the proposed method is proved by simulation results.
标签： method reconstruction location proposed
上传时间： 2016-02-04
上传用户：maizezhen
简单C编译器生成的目标代码是8086的汇编代码（16位），可以在一般的PC上被像MASM之类的汇编编译程序编译，生成可执行文件后，在DOS或Windows控制台下运行。 实现的语言定义如下: 语言类似于tiny语言，不支持过程调用，也就是只有一个main函数，无其他函数和全局变量 基本语句：注释语句（/*…*/），输入语句(int input(void) )，输出语句（void output(int) )，赋值语句。这里的输入输出语句实际上类似于函数调用，可以看作是本语言内部的函数 算术运算符：+、—、*、/ 数据类型：整数.
上传时间： 2016-02-06
上传用户：bakdesec
词典 Time Limit:3000MS Memory Limit:65536K Total Submit:2349 Accepted:603 Description 你旅游到了一个国外的城市。那里的人们说的外国语言你不能理解。不过幸运的是，你有一本词典可以帮助你。 Input 首先输入一个词典，词典中包含不超过100000个词条，每个词条占据一行。每一个词条包括一个英文单词和一个外语单词，两个单词之间用一个空格隔开。而且在词典中不会有某个外语单词出现超过两次。词典之后是一个空行，然后给出一个由外语单词组成的文档，文档不超过100000行，而且每行只包括一个外语单词。输入中出现单词只包括小写字母，而且长度不会超过10。 Output 在输出中，你需要把输入文档翻译成英文，每行输出一个英文单词。如果某个外语单词不在词典中，就把这个单词翻译成“eh”。 Sample Input dog ogday cat atcay pig igpay froot ootfray loops oopslay atcay ittenkay oopslay Sample Output cat eh loops Hint 输入比较大，推荐使用C语言的I / O函数。
标签： Limit Description Accepted 65536K
上传时间： 2016-02-22
上传用户：fandeshun
这是VC的例子WriteAVI的代码，创建文件output.avi,说明如何生成avi文件的例子。
上传时间： 2016-02-23
上传用户：时代电子小智
很好的搜索： 给你很多长度不定的木棒，将他们分成几组，每组中的总长度作为这组的标示值，请给出一种分组方法，能使得所有标示值中的最小值最大。 Input 多组，每组两行，第一行是一个N和K，代表有N根木棒，分成K组，第二行是N个数字，代表木棒的长度。（N不超过100，K不超过20，每根木棒长度不超过1000） Output 输出所有标示值中的最小值的最大值。 Sample Input 5 3 1 3 5 7 9 5 3 89 59 68 35 29 Sample Output 8 89
上传时间： 2013-12-23
上传用户：nairui21
