dipole_1

超宽带二进制相位调制和功率谱密度、波形图(Ultra-wideband binary-phase modulation and power spectral density, waveform graph)

基於遗传粒子群的最新改进算法基於遗传粒子群的最新改进算法(The latest improvements in genetic particle swarm algorithm )

CPM的一种相干解调，程序内容较为丰富，基本的函数都有。希望有用。(CPM of a coherent demodulation, the program more inclusive, have the basic function. Hope helpful.)

同步日期和时间的例子。(date and time synchronization example.)

Wireless sensor networks are new type of emerging networks with bunch of applications in all fields due to their low cost and low power scheme. As these networks follow open wireless communication, they undergo dynamic node problems and fault node detection due to malicious node activities.

外国一个大学生做了一个精确定位系统，这个系统几乎可以跟踪镜头里的任何物体。只要你能看见它，并把它选中。有兴趣的同学可以下载我传上来的源文件...是用matlab写的...demo文件也在里面 (A foreign university students made a precise positioning system that can track almost any object lens. As long as you can see it, and to select it. Interested students can download the source files I pass up ... with matlab ... demo files are written inside)

Iterative learning neural network control for nonlinear system trajectory tracking

扩散系统之浓度分布的装置。管中储放静止液体B，高度为L=10 ㎝，放置于充满A 气体的 环境中。假设与B 液体接触面之浓度为3 C 0 0.01mol m A = ，且此浓度不随时间改变 而改变，即在操作时间内( h = 10天)维持定值。气体A 在液体B 中之扩散系数为 D m s AB = 2×10− 9 2 。试决定以下两种情况下，气体A溶于液体B中之流通量(flux)。 (a) A 与B 不发生反应； (b) A 与B 发生以下之反应 A+ B→C ， A A − r = kC 其反应速率常数k = 2×10− 7 s− 1。 (Diffusion system of concentration reference device shown in Figure 3. Tube in the store still liquid B, L = 10 cm height, placed in full A gas environment. Assuming the contact surface of the liquid with the B concentration of 3 C 0 0.01mol m A =, and this concentration does not change with time and change, that is, the operating time (h = 10 days) to maintain constant. Gas A in liquid B, the diffusion coefficient D ms AB = 2 × 10-9 2. Decided the following two test cases, the gas dissolved in liquid B in the A liquid (flux). (A) A and B do not react (b) A and B of the following reaction occurs A+ B → C, AA- r = kC, the reaction rate constant k = 2 × 10-7 s-1.)

Layer KRR method document

A 4 bit twisted ring counter is a sequential circuit which produces the following sequence of output values: 0000, 1000, 1100, 1110, 1111, 0111, 0011, 0001 and then repeats. Design a circuit for a 4 bit twisted ring counter that uses four D flip flops. Draw a state transition diagram, a state table and a schematic for your circuit. Design an alternate implementation using just three flip flops and draw a state transition diagram, state table and a schematic for your circuit. If your designs are extended to implement an n bit twisted ring counter, how many flip flops are required using each of the two approaches. In what situations would you prefer the first method? In what situations would you prefer the second?