multiagent

飞思卡尔电磁试跑程序，六个传感器，很牛的底文件库，让电磁车飞起来，不一样的感觉，不一样的代码

虚拟电子秤 程序使用说明 1. 本程序只在Windows XP平台上经过完整测试，因此只能保证该程序在WinXP系统下运行正确。 2. 由于本程序使用了Access数据库，因此需要计算机上安装有Microsoft Access。 3. 将本程序下载到本地计算机后，需要建立与用户信息.mdb的ODBC连接。建立方法如下：进入开始菜单->控制面板->管理工具->数据源（ODBC），建立一个新的系统DSN：选择Add…->Microsoft Access Driver(*.mdb)，数据源名称为“LVTest_UserDB”，数据库选择用户信息.mdb。点击OK完成设置。 4. 运行虚拟电子秤_陈锡辉.vi，输入用户名：admin，密码：123456 登录系统。进入系统后可以更改密码或管理用户等等。()

帮助别人编写的VC小程序，利用vc面向对象编程技术编写基于文本框和对话框的小程序-To help others small program written in VC by using vc object-oriented programming techniques to prepare text-based dialog boxes and applets

A 3-node example for ad-hoc simulation with DSDV-A 3-node example for ad-hoc simulation with DSDV

浙大计算机网络课件。非计算机专业的。想看的看看吧-Zheda courseware computer network. Non-computer professional. Want to see it

matlab画出vonoroi图，利用PS、Hypemesh导入Abaqus生成Vonoroi模型(Matlab draws a vonoroi diagram, use PS, Hypemesh to generate Vonoroi model in Abaqus)

本算法使用分治法求解最近点对问题。事先用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.

This program is the realization of Adaboost selection algorithm in C++. Examples have been included in the zip file updated.

S32K开发板测试例程 各部分功能完全 调用即可使用(S32K development board test routines, all parts of the function can be fully invoked)

说明：  Stanford Cypher. Ebook 4