-
Emv Reader Writer v8.6
说明： emv software for computers
- 2020-07-03 12:22:18下载
- 积分：1
-
ban
插值与拟合的matlab实现，一些自适应信号处理的算法，处理信号的时频分析。( Interpolation and fitting matlab implementation, Some adaptive signal processing algorithms, When processing a signal frequency analysis.)
- 2017-03-17 16:58:54下载
- 积分：1
-
Quadrotor_Controller
matlab无人机地面仿真,研究如何使用PID控制飞行，并通过调整参数影响飞行姿态调节(matlab Unmanned Aerial Vehicle Ground Simulation)
- 2021-04-26 15:48:45下载
- 积分：1
-
通讯录实现新建,添加查找,删除,的基本功能
简易
通讯录实现新建,添加查找,删除,的基本功能
简易-Address Book in new, add to find, delete, the basic functions of the Summary
- 2022-02-21 06:46:58下载
- 积分：1
-
s1 today plugin,for all you need
s1 today plugin,for all you need
- 2022-07-12 22:54:03下载
- 积分：1
-
并行openmp
说明： Openmp for parallel computing samples!!!
- 2020-06-22 09:40:06下载
- 积分：1
-
tc工具grep的源程序代码
tc工具grep的源程序代码-tc grep tool for the source code
- 2022-02-01 19:09:27下载
- 积分：1
-
将C语言写的程序代码转换成pascal代码，用过还可以！
将C语言写的程序代码转换成pascal代码，用过还可以！-to write C-language code into pascal code can be used also.
- 2022-06-12 08:31:01下载
- 积分：1
-
11
说明： This article introduces two new configurations for precision current sources and current mirrors. Both
circuits use n-p-n bipolar devices, but one provides a current source while the other provides a current sink. This
permits the use of current sources in IC designs implemented with processes that do not allow p-n-p devices.
Analog building blocks such as voltage-to-current converters, active loads, and sink and source current mirrors
can be constructed from the new circuits using only n-p-n devices. Furthermore, because these circuits achieve
the required precision without the use of high-gain amplifiers, the bandwidths of the circuits are large compared to conventional configurations. The source currents are dependent on a single reference voltage and exhibit good temperature sensivitity
- 2010-03-29 09:23:55下载
- 积分：1
-
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小...
本算法使用分治法求解最近点对问题。事先用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.
- 2022-01-25 16:01:13下载
- 积分：1
