3464875676

pic basic pro son hal

VC6.0 MFC基于对话框的编程，如何切换到另一窗口(VC6.0 MFC based dialog ,how to switch to another window)

　　　实现以下的无损数据压缩方法 　　　LZ78和LZW算法； 给定若干个输入的字符串流，应用所编写的算法实现压缩，计算压缩比，然后再将压缩的码流进行解码，同输入的字符串流进行比较，判断输入输出码流是否一致。(Achieve the following lossless LZ78 and LZW data compression algorithm certain algorithms to a given input string stream to achieve compression applications written to calculate the compression ratio, and then decoding the compressed code stream, with the stream input string , and determines the input and output streams are the same.)

说明：  这是一个隐藏与显示鼠标的例子，相信对初学者有一定的帮助(This is an example of hiding and show the mouse, I believe there is some help for beginners)

说明：  采用模糊控制的思想，实现交通路口红绿灯时间的优化控制。 功能要求：(1) 采用模糊控制实现红绿灯控制，根据车流量的不同来控制红绿灯的显示时间。 (2) 模拟实际交通路况，简化编程难度，只考虑横竖方向的车流量，并不考虑车的拐弯，重点突出模糊控制算法 (Using fuzzy control theory to achieve the traffic intersection of time optimal control of traffic lights. Functional requirements: (1) using fuzzy control to achieve traffic light control, according to the different traffic flow to control the traffic lights display the time. (2) simulate the actual traffic and road conditions, simplify programming difficulty, only if they had to consider the direction of traffic flow, without considering turning vehicles, focused fuzzy control algorithm)

visual c++ 6.0 中 MFC应用教程(visual c++ 6.0 MFC application in the tutorial)

用vb.net编写的记事本原代码-vb.net using the notebook to prepare primitive code (Vb.net memo prepared by primitive code-vb.net using the notebook to prepare primitive code)

在Visual C++ 下面对EXcell的操作编程，可以任意下载，欢迎光顾(in Visual C below right EXcell programming operation can be downloaded arbitrary welcome to patronize)

基于研华PCI-1710HG数据采集卡基于动态链接库的计数器程序。用VC++6.0MFC实现。程序功能实现实时计数值显示及频率值显示。(Advantech PCI-1710HG-based data acquisition card is based on the dynamic link library counter program. With VC++6.0MFC achieved. Program features real-time count value display and frequency display.)

zoj094 Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. (Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. )