ljsc

说明：  Circle Through Three Points

说明：  在dos下声音的处理pc喇叭发声,声卡技术,WAV文件的播放技术(voice processing pc speakers audible, audio technology, WAV file playback technology)

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

上传程序用于解析Novatel输出range 信息，解析结果已经验证。(The upload process is used to resolve the Novatel output range information, analytical results have been verified.)

模拟终端，和几种目录文件操作的系统命令，dir,cd,md,del等(analog terminal, and several catalog operation of the system commands, dir, cd, md, del etc.)

this is the library to compress and decompress any file. I found it on Net

控制台下的字符串管理程序，并且带有好看的节面（使用其他人的库）(String under the console management program, and with a good-looking face of the section (using other people s libraries))

模拟电信计费系统的设计与实现 要求：（1） 计费功能。根据存放在源数据文件中的通话记录和长途费率文件对每一条通话记录计算其通话费用，并将结果保存在费用文件中。其中： 通话费的计算方法如下： 通话费＝长途电话费＋本地电话费 长途电话费＝费率（元/分钟）×通话时长（分钟） (通话时长不满1分钟的按1分钟计算) 本地电话费为：3分钟以内0.5元，以后每3分钟递增0.2元。 （2） 话费查询。输入一个电话号码，从费用文件中统计该电话号码的所有本地话费、长途话费，并从用户文件中查找其用户名，最后在屏幕上显示： 用户名 电话号码 本地话费 长途话费 话费总计 （3） 话单查询。输入一个电话号码，查询并在屏幕显示该用户的所有通话记录，格式为： 用户名 主叫电话号码 被叫电话号码 通话时长 (Design and implementation of simulation of telecommunication billing system Requirements: (1) the charging function. According to the calculation of the call charges stored in the source data file in the call records and the long rate documents for each call record, and save the results in cost file. Among them: The following conversation method to calculate the fee: Long distance telephone calls =+ local telephone fee Long distance telephone fee = rate (yuan/minute)* call time (minutes) (call time less than 1 minutes to 1 minutes) Local call: 3 minutes 0.5 yuan, increasing 0.2 yuan every 3 minutes later. (2) calls inquiries. Enter a phone number, all local calls, long-distance calls statistics the phone number from the cost in the file, and find the user name from user file, and finally displayed on the screen: The user name phone number local calls long distance charges charges totaling (3) if a single query. Enter a phone number, query and display all the call records of th)

调度问题的回溯算法，算法中的经典问题。问题描述：假设有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.)

通信原理实验指导书,包括全部通信原理章节,原理分析,硬件解释,编程指导等(The communication principle experiment instruction book, including all the communication principle chapter, the principle analysis, the hardware explanation, the programming instruction and so on)