-
实例有关说明： 数据源：本实例使用的数据源在本章实例MyOdbcSmpl目录中，数据源为ACCESS数据源，数 据文件为Mydb.mdb。请根据本章2.4.1...
实例有关说明： 数据源：本实例使用的数据源在本章实例MyOdbcSmpl目录中，数据源为ACCESS数据源，数 据文件为Mydb.mdb。请根据本章2.4.1创建ODBC数据源中所指示的ODBC数据源管 理器（ODBC32.exe）来创建和配置数据源MyDB（也可以命名为其他名称）。 执行结果：本章实例的执行结果MyOdbcSmpl目录中的可执行文件MyOdbcSmpl.exe。在数据 源中选择刚配置的MyDB，在数据表或视图中选择要查询的表或视图，选择查询的 列，如果有查询条件，请在查询条件中输入，最后确定是否输出显示查询结果， 缺省为显示，单击“执行”按钮，执行查询并显示查询结果，在SQL语句框中显 示执行的查询。-Note : Data Source : The data used by the examples in this chapter source directory MyOdbcSmpl example, ACCESS data source for data sources, data files for Mydb.mdb. Requests under this chapter 2.4.1 create ODBC data source as directed by the ODBC Data Source Manager (ODBC32.exe) to create and configure data sources MyDB (also named other names). Outcome : examples of this chapter MyOdbcSmpl results of the implementation of the directory MyOdbcSmpl.exe executable files. The data sources to choose just the MyDB configuration, the data in Table View or choose to check the table or view, the choice for the series, if there are inquiries conditions, the conditions for the imp
- 2022-11-01 23:00:03下载
- 积分：1
-
trainreset：有许多列车需要开车出站的作用。
TrainReset:there are many trains need to drive out of the station .In terms of their numbers from small to large.There are only three railways used to place the trains ,and also need the same order.-TrainReset : there are many trains need to drive out of the sta tion. In terms of their numbers from small to deviation ge.There are only three railways used to place t he trains, and also need the same order.
- 2022-07-14 05:15:14下载
- 积分：1
-
sorting
包括冒泡排序，插入排序和快速排序的方法，帮助理解三种排序的差异性(Methods include bubble sort, insertion sort, and quick sort, to help understand the difference between the three sorting)
- 2015-01-07 12:27:01下载
- 积分：1
-
算法是一种字符串匹配算法！源代码介绍…
bm算法是串的一种匹配算法！本源代码介绍了bm算法的c实现。-bm algorithm is a string matching algorithm! Source code introduced bm Algorithm c achieve.
- 2023-05-22 10:20:03下载
- 积分：1
-
Realiza inventarios no terminado
Realiza inventarios no terminado
- 2022-01-22 03:52:35下载
- 积分：1
-
三层数据库考试系统，很不错的，大家可以看看。
三层数据库考试系统，很不错的，大家可以看看。-Three-tier examination system database, it is good, we will look at.
- 2023-03-25 20:40:03下载
- 积分：1
-
VB实现的三
VB实现的三层结构的整体教学实例（少见）
- 2023-05-28 04:00:04下载
- 积分：1
-
Josephus
实现约瑟夫问题的4种算法，并有计时功能进行效率测试(4 algorithms to resolve Josephus Problem with timing counter for testing efficiency)
- 2012-12-20 12:36:46下载
- 积分：1
-
This is a data structure and algorithm book all algorithm source code, the conte...
这是一本数据结构与算法书中所有算法的源代码,内容非常丰富,值得一看.-This is a data structure and algorithm book all algorithm source code, the content is very rich overseas.
- 2022-04-27 03:35:59下载
- 积分：1
-
new-DV-Hop-code
改进DV-Hop定位算法
首先设置初始量，布置了一个范围为100×100m2的区域，其上随机分布100个传感器节点，其中有10个信标节点，节点的通信半径为30m。
第二步在正方形区域内产生均匀分布的随机拓扑，随机产生节点坐标并将其中十个选定为信标节点，其余九十个设为未知节点，然后画出节点分布图。
第三步通过最短路径法计算未知节点与每个信标节点的最小跳数。
第四步根据前面记录的其他信标节点的位置信息和相距跳数估算平均每跳的实际距离，用跳数估计距离的方法得出未知节点到信标节点的距离。
第五步用极大似然估计法求未知节点坐标
(Improved DV-Hop localization algorithm first set the initial amount, layout 100100m2 the area of a range of 100 sensor nodes randomly distributed on the 10 beacon node, the node communication radius of 30m. The second step in the square area to generate uniformly distributed random topology, random coordinates of the nodes and ten of the selected beacon node, the remaining 90 is set to unknown node, and then draw the node distribution diagram. The third step is to calculate the minimum number of hops of the unknown node and each beacon node through the shortest path method. The fourth step according to the location information of the other beacon nodes in the previous record and away from hops to estimate the average hop distance and hop count to estimate the distance to come to the distance of the unknown node to beacon nodes. The fifth step maximum likelihood estimation method and the unknown coordinates of the nodes)
- 2020-10-12 22:27:31下载
- 积分：1
