Welcome![Sign In][Sign Up]
Location:
Search - 001.z

Search list

[Windows Develop001.File.Joiner.and.Splitter.v4.0.5.0-RedT_nled.z

Description: test of vhdl 74 code
Platform: | Size: 3492864 | Author: kang | Hits:

[WEB Code001

Description: 网站模板页,可以实现征战网页。希望大家支持!谢谢!-Web page templates, you can achieve campaign page. Hope you will support! Thank you!
Platform: | Size: 229376 | Author: 孔锋 | Hits:

[matlabz-0.01-0.001

Description: 这是一个comsol转化成的matlab程序,可以做出z轴的循环-This is a comsol into the matlab program, you can make the z-axis of the loop
Platform: | Size: 3072 | Author: 吴伟平 | Hits:

[matlabr20.001

Description: 这是一个comsol转化成matlab程序,可以做出z轴循环,求出感应电量-This is converted into a comsol matlab program, you can make the z-axis loop, find the sensor power
Platform: | Size: 3072 | Author: 吴伟平 | Hits:

[JSP/Javadate-001

Description: This function returns a string value. The contents of the string are implementation dependent, but are intended to represent the Date in a convenient, human-readable form in the current time z.
Platform: | Size: 3072 | Author: biningqie | Hits:

[Othercode

Description: David A. Huffman published his paper A Method for the Construction of Minimum-Redundancy Codes , and hence printed his name in the history of computer science. As a professor who gives the final exam problem on Huffman codes, I am encountering a big problem: the Huffman codes are NOT unique. For example, given a string aaaxuaxz , we can observe that the frequencies of the characters a , x , u and z are 4, 2, 1 and 1, respectively. We may either encode the symbols as { a =0, x =10, u =110, z =111}, or in another way as { a =1, x =01, u =001, z =000}, both compress the string into 14 bits. Another set of code can be given as { a =0, x =11, u =100, z =101}, but { a =0, x =01, u =011, z =001} is NOT correct since aaaxuaxz and aazuaxax can both be decoded the code 00001011001001. The students are submitting all kinds of codes, and I need a computer program to help me determine which ones are correct and which ones are not.- David A. Huffman published his paper A Method for the Construction of Minimum-Redundancy Codes , and hence printed his name in the history of computer science. As a professor who gives the final exam problem on Huffman codes, I am encountering a big problem: the Huffman codes are NOT unique. For example, given a string aaaxuaxz , we can observe that the frequencies of the characters a , x , u and z are 4, 2, 1 and 1, respectively. We may either encode the symbols as { a =0, x =10, u =110, z =111}, or in another way as { a =1, x =01, u =001, z =000}, both compress the string into 14 bits. Another set of code can be given as { a =0, x =11, u =100, z =101}, but { a =0, x =01, u =011, z =001} is NOT correct since aaaxuaxz and aazuaxax can both be decoded the code 00001011001001. The students are submitting all kinds of codes, and I need a computer program to help me determine which ones are correct and which ones are not.
Platform: | Size: 2048 | Author: 毕假思索 | Hits:

CodeBus www.codebus.net