介绍嵌入式的视频,来自上海交通大学,是一个ARM培训的视频教程...

网上自我选择职业系统-online self-chosen career system

bwt压缩方式的源码-BWT compression of the source

两种交通工具选择，飞机和火车，供不同的用户选择，利用迪杰斯特拉算法实现不同的用户选择不同的交通工具，得到最佳旅游路线-The two modes of selection, planes and trains, for different users to choose to use Dijkstra algorithm different users select different modes of transport, the best tourist routes

用哈夫曼编码的思想对数据进行压缩-Huffman coding used to the idea of data compression

数据压缩Huffman算法-Huffman data compression algorithm

0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solution of a given n types of goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.

给定若干个字符及其对应的权重，建造一颗高度尽可能小的Huffman树及字符的Huffman编码。-given a number of characters and their corresponding weights, construction of a high as possible Huffman tree and the character of Huffman coding.

本代码为采用小波基进行图像压缩的代码程序，压缩率可以达到1/32。采用vc编写。-code for the use of wavelet image compression code procedures, compression ratio can reach 1/32. Prepared using vc.

在linux下解压缩rar的程序源代码 -decompress rar under the program source code