DM9000AE的中文手册。很难得得哦。LOCAL BUS芯片现推荐一款DM9000AE网卡芯片，其基本特性是48PIN，10/100MLOCAL-BUS interface，工作模式8/16bit, 有AUTO－Mdix(自动翻转）、TCP/Ip加速（check SUM offload)减轻CPU负担，提高整机效能，20ns响应时间。2.5V/3.3V低功耗。广泛应用在IPTV、IPSETBOX、VOD、IPCAMERA、IPVIDEOPHONE等产品.
上传时间： 2015-05-02
上传用户：dyctj
数字运算，判断一个数是否接近素数 A Niven number is a number such that the SUM of its digits divides itself. For example, 111 is a Niven number because the SUM of its digits is 3, which divides 111. We can also specify a number in another base b, and a number in base b is a Niven number if the SUM of its digits divides its value. Given b (2 <= b <= 10) and a number in base b, determine whether it is a Niven number or not. Input Each line of input contains the base b, followed by a string of digits representing a positive integer in that base. There are no leading zeroes. The input is terminated by a line consisting of 0 alone. Output For each case, print "yes" on a line if the given number is a Niven number, and "no" otherwise. Sample Input 10 111 2 110 10 123 6 1000 8 2314 0 Sample Output yes yes no yes no
上传时间： 2015-05-21
上传用户：daguda
某幼儿园按如下方法依次给A，B，C，D，E五个小孩发糖果。将全部糖果的一半再加二分之一块糖果发给第一个小孩；将剩下糖果的三分之一再加三分之一块糖果发给第二个小孩；将剩下糖果的四分之一再加四分之一块糖果发给第三个小孩；将剩下糖果的五分之一再加五分之一块糖果发给第四个小孩；将最后剩下的11块糖果发给第五个小孩。每个小孩得到的糖果数均为整数。试确定原来共有多少块糖果？每个小孩各得到多少块糖果？ 要求结果的输出格式为 SUM＝糖果总数 xa＝A得到的糖果数 xb＝B得到的糖果数 xc＝C得到的糖果数 xd＝D得到的糖果数 xe＝E得到的糖果数
标签：
上传时间： 2015-06-02
上传用户：叶山豪
51串行令牌格式 a51编译 Read data from serial port and write into buffer DPTR pointed in XRAM if a data frame is received and calculate the check SUM if a information frame is received return control byte only
标签： data pointed buffer serial
上传时间： 2015-06-14
上传用户：极客
暂时只支持jpeg2000支持的 cdf97 和spline53 可以这样来测试： x=imread( E:\study\jpeg2000\images\lena.tif ) ％ see the decomposition coefficients y=wavelift(x, 1, spl53 ) using spline 5/3 wavelet figure subplot(1,2,1) imshow(x) subplot(1,2,2) imshow(mat2gray(y)) ％ see the reconstruction precision yy=wavelift(x, 5) using cdf 9/7 wavelet ix=wavelift(yy,-5) inverse SUM(SUM((double(x)-ix).^2))
标签： 2000 imageslena studyjpeg imread
上传时间： 2014-01-14
上传用户：懒龙1988
merge sort give a set S of n integers and another integer x, determine whether or not there exits two elements in S whose SUM is exactly x.
标签： determine integers another integer
上传时间： 2013-12-23
上传用户：xmsmh
附录MATLAB 图像处理命令 1．applylut 功能： 在二进制图像中利用lookup 表进行边沿操作。 语法： A = applylut(BW,lut) 举例 lut = makelut( SUM(x(:)) == 4 ,2) BW1 = imread( text.tif ) BW2 = applylut(BW1,lut) imshow(BW1) figure, imshow(BW2) 相关命令： makelut 2．bestblk 功 举例
标签： applylut lut MATLAB lookup
上传时间： 2015-09-08
上传用户：gundamwzc
Distribution generator Here is a simple generator which can build some distributions with given properties. Distributions generator (compile with -lm) Typical use might be: ./distributions -u -m 1 -M 10 -n 100 -s 500 Generates a distribution of 100 uniform random numbers between 1 and 10, such that the SUM of numbers is 500. ./distributions -p -2.2 -m 1 -M 100 -n 200 -s 500 Idem with 200 numbers between 1 and 100 following a power law with exponent -
标签： generator distributions Distribution simple
上传时间： 2014-01-27
上传用户：sammi
Implement the step 2 of two-level logic minimization. Our goal is to find the minimum (exact minimum) SUM-of-products expression for a given function.
标签： minimization Implement the two-level
上传时间： 2014-01-09
上传用户：无聊来刷下
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
