变速精灵 ，用VB编写的，能加个任何程序

FAQ系统，后台问题填写，前台问题展示

这时一个EJB网络书店销售的好程序，大家有机会可以下载下来研究-EJB network when a good bookstore sales procedures, we have a chance to study can be downloaded from

.net开发arcgis.一个很好的开发demo，值得借鉴。ArcGIS Server动态添加数据的功能-ArcGIS Server dynamically add data features.

基于Web技术的通用监控平台 以互连网为核心的技术革命，正给人类工作、生活，乃至生存带来巨大变化。如何将已有的应用系统与蒸蒸日上的互连网技术结合起来，进一步提高企业的运作效率和企业形象，得到了企业的广泛关注。上海Foxboro有限公司在工业智能自动化领域为广大用户提供了优秀的产品和服务，随着互连网技术的发展和应用，为了进一步满足客户的需求，公司提出将现有的IA系列产品SCADA与Web技术有机结合起来，实现基于Web技术的SCADA通用监控平台。-Universal Web-based technology platform to monitor the Internet as the core of the technological revolution, is to the human work, life, and even bring about great changes in survival. How to existing application systems and the success of the combination of Internet technology to further enhance the operational efficiency and corporate image, has been widespread concern in the enterprise. Shanghai Foxboro Company Limited in the industrial field of intelligent automation to provide customers with excellent products and services, with Internet development and application of technology, in order to further meet customer demand, the company proposed to the existing SCADA and IA products Web technology combine Web-based SCADA common monitoring platform.

用c++写的计算器，扩展了计算器带括号的计算功能-Written by c++ calculator, expanded computing power calculator with brackets

c# VSchart实时曲线Demo源码，可以帮助你快速编写基于VSchart的实时曲线程序。

经纬度转换的程序-coordinates conversion procedures----------------------------

VC.NET转换成VC6.0的程序源码.将VC.NET工程转换成VC6.0工程的程序源码-VC.NET VC6.0 into the program source code. VC.NET project will be converted into VC6. 0 works procedures FOSS

K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其 加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.

主要介绍TYPEA 协议的初始化和防冲突的主流程，希望对学习者有帮助。-introduce TYPE A protocal initialization and anti-collision main flow, hope to help beginner to learn TYPEA.