实时数据采集

turboc code in dos a graphics program to crease some illusory object on screen

本文从现场总线控制系统的发展现状出发，遵循现场总线控制系统标准的体系结构，仍由通用组态软件实现监控管理功能，由现场总线智能仪表实现生产控制功能。但在连接通用组态软件与现场总线智能仪表的信息通道中，采用OPC服务器、OPCActiveX控件取代10驱动程序，实现与Matlba数据共享和互联，无干扰地增加Matlba强大的符号、数值计算、矩阵运算以及图形显示的功能，实施先进控制、优化控制。 -This article from the fieldbus control system development of the current situation, following the standard fieldbus control system architecture, generic configuration software is still realize monitoring and management functions, by the field bus intelligent instruments of production control functions. However, in general configuration software to connect with fieldbus intelligent instrument information channel, the use of OPC server, OPCActiveX controls to replace the 10 drivers, and realize data sharing and Matlba the Internet without interference to increase Matlba powerful symbols, numerical calculation, matrix calculation and graphical display features, the implementation of advanced control, optimal control.

图形化计算器 可实现加减乘除功能 可实现小数功能-graphic calculator can achieve the arithmetic function can be realized decimal function

TCL2543电压表中的应用，能通讯的测量表，内存的分配-TCL2543 voltage meter application that can communicate measurement tables, memory allocation

鳄鱼论坛，自己在网上找的，测试了，数据库是mysql的，方便用户使用，有需要的下载吧-Crocodile Forum, the Internet looking for their own testing, and database is mysql, user-friendly to use, there is a need to download bar. .

用VS2005 进行网站开发 一个项目案例 是北大青鸟的一个课程项目希望对大家有用-VS2005 for web site development with a project Beida Jade Bird case is a course project wishes to everyone useful

在光子晶体中，引入磁导率调制来计算PBG-In the photonic crystal, the introduction of magnetic conductivity modulation to calculate the PBG

PHP程序-拉风妹提供的PHP2001世纪网PHP留言板-PHP procedures-pull of the wind-mei PHP2001 century network PHP bulletin board

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.

type year and month, it will show the calender, an assignment in cla-type year and month, it will show the calender, an assignment in class