Beijing Mandarin Oriental Network Office System

通信仿真 jakes改进模型的程序,仿真基本理论-jakes improve communication simulation model of the process, simulation basic theory

带加权的寻路算法演示(DELPHI源码) 关于A*寻路算法的代码在网上有很多，但用DELPHI的比较少，本人花了一天时间找到这个，代码和界面都比较精炼，于是在关键处作了中文注释，但愿对朋友们有用。-with weighted routing algorithm Demo (DELPHI OSS) on the A* algorithm routing code on the Internet which is very , but with the DELPHI relatively small, I spent a whole day to find the time, code and interface are more refined, So the Department made a key Chinese translations, I hope that friends useful.

这是一个不错的ASP的翻页程序,和大家一起分享。-This is a good page of the ASP program, and the U.S. share.

ＶＢ编的一个计算器程序，绝对考虑到了计算器的每个细微功能，由于是初学者，所以语法可能有点不成熟，但对于初学者的学习很有帮助！-VB series a calculator program that takes into account the absolute calculator function of every nuance, as is the starter So syntax may be a bit premature, but for beginners learning helpful!

TI DSP C6000 系列Flash数据格式转换工具，可以将.out文件直接转换成.dat文件，在CCS中可以直接装入内存。这是很多人在找的工具。源码由于版权问题实在无法提供。实际上根本不需要源码。MD5:aae3a16546570ebe5712eb76fbd2f1f9 C6000_Flash_ToolKit.rar-TI C6000 DSP Flash data format conversion tools can be. out directly into documents. dat documents in the CCS can be directly loaded into memory. This is something many people are looking for the tools. FOSS because of copyright issues is unable to provide. In fact do not need the source code. MD5 : aae3a16546570ebe5712eb76fbd2f1f9 C6000_Fl ash_ToolKit.rar

自定义行列颜色的CListCtrl控件，包括改变字体大小及颜色。-Custom color ranks CListCtrl control, including changing the font size and color.

对seg2格式数据处理的一个包装类，标准c++编写，测试过没问题，希望和同仁共享-Seg2 format data to deal with a wrapper class, standards c++ Preparation, testing had no problem, hope and sharing Tongren

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

经典的点灯游戏. 如果需要点灯算法的话,我这里也有,我可以提供给大家.-classic games. If the algorithm needs to light lamps, I also have here, I can provide to the public.

软件源码PowerBuilderXieLieJiangZuo,PowerBuilder系列讲座-Software source code PowerBuilderXieLieJiangZuo