关于电力系统无功优化的学术论文，改论文使用了连续二次规划的方法。...

很好的C++课件，适合初学者。ppt格式，希望对大家有帮助！-A very good C++ courseware is suitable for beginners. ppt format, you want to help!

是控制台程序，支持大部分的FTP命令。本程序设定用户名和密码都是toldo，FTP服务的主目录是C: emp，详见说明文件-Is a console program, to support most of the FTP commands. This procedure set the user name and password are toldo, FTP services, the main directory is C: temp, see the documentation

一个上海地图，jpg各式的，可以用来作为gis处理的原始数据-a Shanghai maps, a variety of jpg can be used as a gis of the original data

第一个例子，同样的混合变成，第一部分，是一个不错的vc和matlab结合的例子-first example, the same mixed into, the first part of a good combination of Matlab and vc example

手机上网越来越成为一种时尚。其关键技术－WAP也越来越受到人们的关注。此文档以问答的方式解答了WAP技术在应用中的难题，对WAP网页开发有很大的帮助。-mobile Internet is increasingly becoming a trend. Its key technology- WAP also attracting increasing attention.WAPWAP

利用开源的工作流项目JPBM开发的示例，演示报销流程.-JBPM

Fast OnlineUpdate for SuSE (fou4s)是一个bash脚本，它提供了YOU (YaST OnlineUpdate)的功能，但也可以在后台工作，检查每夜的更新。它支持断点下载和使用wget的代理。它也检查GPG签名。-Fast OnlineUpdate for SuSE (fou4s) is a bash script, it has provided YOU (YaST OnlineUpdate) function, but also may in the backstage work, inspect each night of renewal. It supports the break point to download and to use wget the proxy. It also inspects the GPG signature.

本例所使用的包的源描述超过了演示版限制的300行, 如果您需要对其进行编译与模拟,请与北京理工大学 ASIC研究所联系,获取Talent系统的完全版本. 联系方法: 电话:010-68912434 信函:北京理工大学ASIC研究所 刘明业 教授收 邮编:100081-In this case used to describe the source package for more than a demo version of the 300 line limit, if you need to be compiled with the simulation, please contact ASIC Institute of Beijing Institute of Technology to obtain the complete version of Talent system. Contact: Tel: 010-68912434 correspondence: Institute of Beijing Institute of Technology Professor Liu Mingye ASIC received Postcode: 100081

[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include int number //队列类型 typedef struct{ int q[20] -[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then

这个程序是阳历-阴历的转换程序，内容简单却很实用。想知道使用阴历生日朋友的阳历出生日期吗？用过本程序就知道了-the procedure is solar- lunar calendar conversion process is very simple and practical content. Wondered the use of the lunar calendar birthday friends solar calendar date of birth? Used this procedure will know