网站首页

TryDialer_WinNT_Service_to_dial_DSL_PPOE_Connectio

于 2009-01-18 发布文件大小:11KB

 0  179

下载积分: 1 下载次数: 34

我要下载

代码说明：

WinNT Service to automaticaly deal and control ADSL (ISDN) PPoE internet connection. Usefull on Windows servers and routers.

文件列表：

aMain.dfm
aMain.pas
aMainPinger.dfm
aMainPinger.pas
aSMain.dfm
aSMain.pas
InetProbe.dpr
Project1.dpr
ShutDown.pas
TestPrj.dpr
TryDialerSvc.dpr
Unit1.dfm
Unit1.pas

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

cpubbs_simulate_mouse
虚拟鼠标，通过设定鼠标坐标使鼠标移动，不需要实际操控鼠标(A virtual mouse, by setting the mouse coordinates of the mouse movement, mouse does not require actual manipulation of)

2009-10-31 18:57:10下载

积分：1
XIANXING
线性表的建立与基本运算1.采用表尾挂入法建立一个以la为头的单链表2.采用表首插入法建立一个yilb为头指针的单链表3.就地逆转以lb为头指针的单链表。还有矩阵的链式存贮及运算。以一个c函数创建任一稀疏矩阵的十字链表。以一个c函数从十字链表的头指针起按行序及三元组形式输出十字链表中各节点的值

2009-06-17 12:49:15下载

积分：1
jisuanqi
小的计算器，适合初学者，虽然简陋了点，但很清楚(Calculator, suitable for beginners)

2012-06-21 20:26:55下载

积分：1
lendning
一个关于精馏塔建模的matlab仿真程序,很经典的,值得大家来学习学习(Modeling of a rectification tower of matlab simulation program, very classic, worth to learning how to learn)

2017-08-07 21:04:58下载

积分：1
shenyangbusquerysystem
沈阳公交查询系统沈阳公交查询系统(Shenyang Shenyang Bus Inquiry System Bus Inquiry System)

2008-05-27 21:04:20下载

积分：1
APF20170323_2nd
主要用于解决运动体可自主避障的轨迹规划问题，程序所使用的方法为人工势场法(Path Planning for UAVs with No-fly Zones)

2018-01-01 10:24:03下载

积分：1
calc
类WinXP计算器，不习惯或对Win7计算器功能不满足的用户和适用。(It s a calculate similar to the WinXP system, it s very useful to the user of dissatisfact to the Win7 system.)

2012-01-05 22:00:12下载

积分：1
Biology--612517Edit__0061Applet_558
源码Biology 612517Edit__0061Applet_558是一个不错的源码，用来学习参考会是一个不错的选择(Source Biology- 612517 edit__0061applet_558 is a good source code, is used to study the reference would be a good choice)

2017-02-28 13:14:23下载

积分：1
KillSbl
vs2005环境下编写的sbl病毒专杀工具，可以扫描文件中的sbl病毒，并集中清除(vs2005 environment prepared by the sbl virus Zhuanshagongju, you can scan documents in the sbl-virus, and focus on clear)

2010-01-31 23:19:02下载

积分：1
closest_pair
分治法思想，求最邻近点对，考虑将所给的n个点的集合S分成2个子集S1和S2，每个子集中约有n/2个点，然后在每个子集中递归地求其最接近的点对(Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its focus in each sub-the closest point)

2013-12-07 16:46:26下载

积分：1

696518资源总数
106222会员总数
14今日下载

TryDialer_WinNT_Service_to_dial_DSL_PPOE_Connectio

0 个回复

热门标签

热门下载