ruido

很全的中断手册。 INT 00 - CPU-generated - DIVIDE ERROR INT 01 - CPU-generated - SINGLE STEP (80386+) - DEBUGGING EXCEPTIONS INT 02 - external hardware - NON-MASKABLE INTERRUPT INT 03 - CPU-generated - BREAKPOINT INT 04 - CPU-generated - INTO DETECTED OVERFLOW INT 05 - PRINT SCREEN CPU-generated (80186+) - BOUND RANGE EXCEEDED INT 06 - CPU-generated (80286+) - INVALID OPCODE INT 07 - CPU-generated (80286+) - PROCESSOR EXTENSION NOT AVAILABLE INT 08 - IRQ0 - SYSTEM TIMER CPU-generated (80286+) . . .(Very wide manual interruption. INT 00- CPU-generated- DIVIDE ERRORINT 01- CPU-generated- SINGLE STEP (80386+)- DEBUGGING EXCEPTIONSINT 02- external hardware- NON-MASKABLE INTERRUPTINT 03- CPU-generated- BREAKPOINTINT 04- CPU-generated- INTO DETECTED OVERFLOWINT 05- PRINT SCREEN CPU-generated (80186+)- BOUND RANGE EXCEEDEDINT 06- CPU-generated (80286+)- INVALID OPCODEINT 07- CPU-generated (80286+)- PROCESSOR EXTENSION NOT AVAILABLEINT 08- IRQ0- SYSTEM TIMER CPU-generated ( 802862B !)...)

matlab基于角点信息和透视变换的图像镶嵌 其中包括给定图片(matlab based on the corner of information and perspective transformation of the image mosaics including the given picture)

this matlab source code is for introduction

matlab编写的RBF神经网络两相流流型辨识程序(RBF neural network matlab prepared flow pattern identification procedure)

基于MATLAB的锁相环程序，内附详细说明(PLL based on MATLAB program, like a friend to study a)

线性调频信号脉压的编码程序，基础程序可以好好学习下，希望有帮助！(LFM pulse compression coding procedures, based on the program can learn under, want to help!)

Aptina AR0134 video imaging sensor datasheet

power tracking ac source with arduino

设定循环检测次数，这里设为只循环一次 tip_l=1 设定hough变换的遍历步径 xl=30 ％设定线段起始点 xr=60 ％设定线段终止点(Set the number of cycle detection, here is set to cycle only once tip_l = 1 set hough transform Path traversal step xl = 30 set line segment starting point xr = 60 set line segment termination point)

说明：  C++源代码，递归实现。原问题描述：鼓上蚤时迁到一个山洞里去盗宝，里面有n件宝贝，价值分别是a1,a2......an，并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包，能装的东西最大价值是K，他只能进洞一次，请问他最多能带出多少？ 要求：输入K，n，a1，a2......an 输出：他能最多带出的宝物价值 (C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures)