搜索资源列表
code.rar
- 研究简单的两种场景下的802.11p协议的性能，分为简单直线对向行驶和简单直线同向行驶。其中使用了VanetMobiSim和NS2两个软件。,Study a simple two kinds of scenarios of the 802.11p protocol performance, divided into simple and straight right to the road and simply drive a straight line in the same directio
riddle.rar
- 【题目描述】 小伟报名参加中央电视台的智力大冲浪节目。本次挑战赛吸引了众多参赛者，主持人为了表彰大家的勇气，先奖励每个参赛者m元。先不要太高兴！因为这些钱还不一定都是你的。接下来主持人宣布了比赛规则： 首先，比赛时间分为n个时段(n≤500)，它又给出了很多小游戏，每个小游戏都必须在规定期限ti前完成(1≤ti≤n)。如果一个游戏没能在规定期限前完成，则要从奖励费m元中扣去一部分钱wi，wi为自然数，不同的游戏扣去的钱是不一样的。 ,【Descr iption】 Xiaowei subje
polynome.rar
- 多项式相乘的两种算法：直接相乘，分治法相乘,Polynomial multiplication of two algorithms: Direct multiply, multiply divided Act
shujufenxi
- Vc++6.0在数据分析方面计算一维数据组的数组特征（方差，均值，分为点等）-Vc++ 6.0 in the data analysis of the calculation of one-dimensional array of data sets characteristics (variance, mean, divided into points, etc.)
A-way-to-collecting-and-identifying-voice
- 利用Windows自带的声卡采集器，通过麦克风将声音采集。将录制的声音分为一系列频率，将基频进行比较，从而进行简单的声音识别。-Use Windows built-in sound card collector, through a microphone to capture sound. Will be divided into a series of recorded sound frequency, compared to the base frequency, thus a simple
ClosetPairs
- 本算法使用分治法求解最近点对问题。事先用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 probl
AD
- 数据采集程序，12位的A/D转换，且分为六个通道采入，对数据采集板卡的操作-Data collection procedures, 12 of the A/D conversion, and is divided into six-channel mining income, on the operation of data acquisition boards
proteldxp
- 短时间熟练PROTEL DXP操作，分为： smthome_protel_DXP_教程.part1.rar smthome_protel_DXP_教程.part2.rar smthome_protel_DXP_教程.part3.rar-PROTEL DXP short of skilled operations, divided into: smthome_protel_DXP_ tutorial. Part1.rarsmthome_protel_DXP_ tutorial. Par
shuzixinhaochuli
- 数字信号处理课程的有关实验，分为两部分，这是第一部分-Digital signal processing courses offered by the experiments, divided into two parts, this is the first part of
xinhaoshiyan
- 数字信号处理课程的有关实验，分为两部分，这是第儿部分-Digital signal processing courses offered by the experiments, divided into two parts, this is the first part of child
cross_speech_cancellation
- 传统双话筒降噪应用中，要求采用定向话筒对抗话音串扰问题，并且语音损伤较大，采用抗交叉串绕算法后，仅噪声被抵消，语音信号被保留。分为两个阶段，第一阶段，学习环境，第二阶段，抵消噪声。-Traditional dual-microphone noise reduction applications, the adoption of directional microphone voice against crosstalk, and a larger voice injury, using anti
aaa
- 点滴计数报警系统 用了检测技术、自动控制技术和电子技术。系统可以分为传感器检测部分和控制部分。-Drip count alarm system with a detection technology, automatic control technology and electronic technology. Sensor detection systems can be divided into parts and control part.
ISD1420
- ISD1420语音程序，能完成20个片段（它总的存储时间是20秒，随便你划分片段长度）的录音和播放。-ISD1420 voice procedures, to complete the 20 fragments (which the total storage time is 20 seconds, you just divided into fragment length) of the recording and playback.
dianti
- 本电梯控制器分为主控制器和分控制器。主控制器是电梯内部的控制器，每个楼层有一个分控制器。-The elevator controller is divided into the main controller and sub controller. Main controller is inside the elevator controllers, each floor there is a sub-controller.
EEPROM
- 电可擦除可编程只读存储器EEPROM可分为并行和串行两大类。并行EEPROM在读写数据是通过8位数据总线传输，而串行EEPROM的数据是一位一位的传输。虽然与并行EEPROM相比，串行传输数据较慢，但它体积小、专用I/O口少、低廉、电路简单等优点，因此广泛用于智能仪器、仪表设备中。-Electrically erasable programmable read-only memory EEPROM can be divided into two major categories of paral
powerbuilder9.0justaweek
- 很好的powerbuilder9.0的书籍，分为7天完成 根据书上的安排7天就会有很大的收获，本人亲自体验过，-Powerbuilder9.0 good books, divided into seven days to complete the arrangements on the basis of book seven days there will be a great harvest, I personally experienced,
DivideNum
- 将正整数n分为若干个不同的正整数之和，给出所有可能的拆分结果（数字相同而顺序不同的结果视为同一条结果，例如6=1+2+3和6=3+2+1，而6=2+4和6=3+3是两条符合条件的结果) -Will be a positive integer n is divided into a number of different positive integers and, given the results of all possible split (the same as the order o
Divided-and-keyboard-scan
- Divided by a variety of keyboard scan
Five-monkeys-divided-peach
- 五猴分桃问题是：五只猴子合作摘了很多桃子，感到累了，决定先去睡觉，醒后再分。不知过了多久，第一只猴子醒了，看见其它猴子都没有醒，就把所有桃子分为五堆，发现多一个，就吃了一个，拿走一堆，把剩下的又堆在一起走了。第2只猴子醒来，以为自己是第一个，也是把桃子分为五堆,也是多一个，就吃了一个，拿走一堆，剩下的又堆在一起走了。第3，4，5只猴子都是这样。现在问总共摘了多少桃子，每只猴子连吃再拿是多少？最后还剩多少？-The five monkeys sub peach issues: five monke
dehip (25)
- The whole book is divided into 4 chapters. The first chapter focuses on how to determine the so-called program analysis technology and the practical knowledge of typical part of the hot code that consumes the most CPU clock in the program