Chap11

从控制台输入一个字符串，然后再输入想要查找的字符串，判断要查找的字符串是不是在第一次输入的字符串中出现过。(find substring in a source string)

说明：  在程序加载时出现，可以点击画面跳过。 2.登录窗口 只有在输入正确的用户名的密码时，点击登录，才能登录。 3.主体窗口 主体窗口中显示的是当天的话费清单。 4.显示窗口 显示窗口中显示的是当前的各路中断线的状态。 5.打印窗口 可以打印当天的话费清单。 6.退出程序 退出程序。 7.当前费用 可以结算出从当天的00:00:00到些时的费用总和，以及通话时第总和。 (in loading procedures there, click on the picture to skip. 2. Login window only in the correct user name password, click on Login can be logged. 3. The main window of the main window shows the list of the day's calls. 4. Show window display window shows the current rostrum were interrupted state. 5. Print window and print the same day the calls list. 6. Exit exit. 7. The current cost of clearing it out of 00:00:00 from the day when some of the costs of the total, and its total telephone conversation.)

rfid实例阅读程序，可实现超高频，高频，低频卡的读写( rfid实例阅读程序，可实现超高频，高频，低频卡的读写 RFID instance reading program, you can achieve ultra high frequency, high frequency, low frequency card read and write)

说明：  这是基于systemview平台的cdma下行链路仿真源码, 能满足cdma开发过程中的仿真需要,(This is the cdma downlink simulation source code based on systemview platform, which can meet the simulation needs in the cdma development process.)

用全选主元法高斯消去法求解线性方程组AX B(A guauss solver for linear system AX B)

调度问题的回溯算法，算法中的经典问题。问题描述：假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。(Scheduling problem backtracking algorithm is the classic problem. Problem Description: Suppose there are n-task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks.)

OPNET 无线仿真 PPT + 源码 好好学习吧(OPNET wireless simulation PPT source code)

Gives the user s desired number of Fibonacci Sequence

说明：  OPNET 无线仿真 PPT + 源码 好好学习吧(OPNET wireless simulation PPT source code)

to check the user has the administration rights is more complicated in windows 7, this is the sample to check it.