本系统设计并建立一个由微控制器控制的洗衣机控制系统。要求完成以下基本控制功能：给水和排水的自动控制,用户定时时间的设定,电机的正反转,各种定时和故障报警电路,定时开、关机的控制,三分钟延时启动的保护,具有键盘设定功能.设计相应的A/D、D/A、键盘、显示接口和传感器测量水位电路，可在线键盘参数设置、定时检测、显示、报警，其中控制输出部分采用模拟量或开关量进行控制。
上传时间： 2014-09-03
上传用户：gonuiln
一道程序编译顺序的考题，涉及到函数调用的先后顺序及运算符号的优先级等问题。下面我展开给你讲。 C的程序编译总是从main函数开始的，这道题的重点在“fun（（int）fun（a+c,b）,a-c）） ”语句。 系统首先要确定最外层 fun()函数的实参，第一个参数的确定需要递归调用fun()函数（不妨称其为内层函数）。内层函数的两个参数分别为x=a+b=2+8=10、y=b=5,执行函数体x+y=10+5=15,于是得外层函数的参数x=15。其另一个参数y=a-c=2-b=-6,再次执行函数体,得最终返回值x+y=15+(-6)=9。
标签： 程序编译
上传时间： 2014-12-03
上传用户：徐孺
This example sets up the PLL in x10/2 mode, divides SYSCLKOUT by six to reach a 25Mhz HSPCLK (assuming a 30Mhz XCLKIN). The clock divider in the ADC is not used so that the ADC will see the 25Mhz on the HSPCLK. Interrupts are enabled and the EVA is setup to generate a periodic ADC SOC on SEQ1. Two channels are converted, ADCINA3 and ADCINA2.
标签： SYSCLKOUT example divides HSPCLK
上传时间： 2014-01-25
上传用户：ljt101007
Matlab连续系统的数字PID控制程序，可实现A/D，D/A功能，符合现场实际情况。
上传时间： 2013-12-09
上传用户：tedo811
Playfair Cipher 1.not even the large number of keys in a monoalphabetic cipher provides security 2.one approach to improving security was to encrypt multiple letters 3.the Playfair Cipher is an example 4.invented by Charles Wheatstone in 1854,but named after his friend Baron Playfair Playfair Key Matrix 1.a 5X5 matrix of letters based on a keyword 2.fill in letters of keyword (sans duplicates) 3.fill rest of matrix with other letters Encrypting and Decrypting -plaintext is encrypted two letters at a time 1. if a pair is a repeated letter, insert filler like X’ 2. if both letters fall in the same row, replace each with letter to right (wrapping back to start from end) 3. if both letters fall in the same column, replace each with the letter below it (again wrapping to top from bottom) 4. otherwise each letter is replaced by the letter in the same row and in the column of the other letter of the pair
标签： monoalphabetic Playfair provides security
上传时间： 2017-05-25
上传用户：变形金刚
Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely balanced. -If the height of this binary tree is h, then leaves can be at level h or level h-1. -All leaves at level h are as far to the left as possible. -The data associated with all descendants of a node are smaller than the datum associated with this node. Implementation 1.using a linear array not a binary tree. -The sons of A(h) are A(2h) and A(2h+1). 2.time complexity: O(n log n)
标签： followingconditions tree completely satisfying
上传时间： 2017-05-25
上传用户：2467478207
Compression using lempel-ziv -for a dictionary size of 2k -provide dictionary Lempel ziv algorithm is a dictionary based algorithm that addresses byte sequences from former contents instead of the original data. This algorithm consists of a rule for parsing strings of symbols from a finite alphabet into substrings, whose lengths do not exceed a prescribed integer and a coding scheme which maps these substrings sequentially into uniquely decipherable code words of fixed length. The strings are selected so that they have nearly equal probability of occurrence. Frequently-occurring symbols are grouped into longer strings while occasional symbols appear in short strings.
标签： dictionary Compression lempel-ziv provide
上传时间： 2014-01-07
上传用户：我们的船长
) 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.
标签： code Compression huffman provide
上传时间： 2017-05-30
上传用户：yuchunhai1990
一个有关applet教程的书籍，书名：WebLogic Server Using Applets with BEA WebLo g i c Se r v e r 6 .0 Document D a t e : M a r c h 6 , 2001 BEA WebLogic Server
上传时间： 2017-06-01
上传用户：ecooo
编写一个java应用程序。用户从键盘输入一个1-9999之间的数，程序将判断这个数是几位数，并判断这个数是否回文数。回文数是指将数含有的数字逆序排列后得到的数和原数相同，例如12121,4224,6778776等都是回文数。 1）程序具有判断用户的输入是否为合法整数的功能。对非法输入（例如含有字母）要进行处理。 2）要判断输入数的位数，并输出相关信息。 3）要判断是否回文数。 二、二战期间，英国情报人员获取德军的一机密电报，电报的内容为： bzdz izu sxgzd vs lh ,vpzg woflsh vs vwrh vhlsddlmp glm wrw gzy vsg .gflyz gstfzu bvsg gzsd hdmlp vml lm ,hghzvy wmz hwiry mvvdgvy izd z hzd vivsg ,ltz tmlo tmlO 情报人员已经知道，这段电报的加密方式为： 1. 首先将字符串的顺序颠倒。 2. 字母互换的规律为：A->Z, B-Y, C-X...X->C, Y->B, Z-A a->z, b->y, c-x...x->c, y->b, z->a. 3. 非字母字符保持不变。 请编程帮助情报人员破译这份机密电报。给出注释良好的源程序和程序运行后的结果。
上传时间： 2017-06-02
上传用户：dengzb84
