Berkley DB data environment demo code, support multi

INDUCTION MOTOR RUN (Currents and speed as state variables) The motor is running at a specified load. After reaching steady state in an initialization first run, the initial conditions are established for a second run in which the load is pulsating. The dynamic equations are expressed in canonical first-order matrix form adopting currents and speed as state variables, and are solved using ODE45. The user has the choice of selecting one of three common (dq) reference frames: STATOR, ROTOR or SYNCHRONOUS. The torque, speed,and current responses are plotted. -INDUCTION MOTOR RUN (Currents and speed as state variables) The motor is running at a specified load. After reaching steady state in an initialization first run, the initial conditions are established for a second run in which the load is pulsating. The dynamic equations are expressed in canonical first-order matrix form adopting currents and speed

用于在产线根据产品要求,保存所有产品相关的文件信息.通过VC实现对文件的创建读写批处理等功能.-Used in production line according to product requirements, keep all product-related file information. VC achieved through the creation of the file read and write functions.

这是本人写的一个简单的JDBC连接数据库的文件-simple file of connecting jdbc to database

一个非常好用的asp同学录，需要的可以下载 -A very nice asp Classmates, need can be downloaded

用jBuilder9.0做的一个功能比较完整的产品数据库管理程序(sql)，具体如何配置数据源查看文件夹中的“使用说明”-jBuilder9.0 do with the function of a more complete product database management procedures (sql), the specific configuration data sources View folder "use"

一个自编的数据库，里面包含了数据库最基本的一些操做，比较全面-this is myself database codes，contains the basic application of the database,the content is overall

管理信息系统在VC中的灵活运用,提供个位变成爱好者和做毕业设计的人参考,完善和提高!-management information system in the VC flexible and provide 000 spaces become lovers and doing graduate of the reference design, improving and enhancing!

学生管理系统应用实例，希望对大家学习有帮忙，-Student management system application example, in the hope that we learn there to help,

dao创建数据库visual basic小程次序-visual basic database creation of small-order

时考虑到在哈夫曼中要每次挑选两个频率最小（即出现次数最小，我那个hNode里的value 是出现的次数），很自然的就想到了std::priority_queue容器，优先队列每次都会弹出队列 中权值最高的元素，这个特性无疑是实现哈夫曼算法的最佳选择。 ... -to consider the Huffman each selected to be the smallest two frequencies (that is, the minimum number, which I hNode"s value is the number of occurrences), it is natural to think of the std : : priority_queue containers, each priority queue queue will pop the top right elements, the Characteristics undoubtedly Huffman algorithm is the best choice. ...