空时正交编码源程序，参考文献： V.Tarokh,H. Jafarkhani,and A. R. Calderbank "Space-Time Codes from
％Orthogonal Designs",IEEE Trans. Inform. Theory VOL. 45,NO. 5,JULY 1
libraw1394 is the only supported interface to the kernel side raw1394 of
the Linux IEEE-1394 subsystem, which provides direct access to the connected
1394 buses to user space. Through libraw1394/raw1394, applications can directly
send to and receive from other nodes without requiring a kernel driver ...
MULTIDIMENSIONAL SCALING in matlab by Mark Steyvers 1999
％needs optimization toolbox
％Modified by Bruce Land
％--Data via globals to anaylsis programs
％--3D plotting with color coded groups
％--Mapping of MDS space to spike train temporal profiles as described in
％Aronov, et.al. "Neural codin ...
This version of malloc for VxWorks contains two different algorithms. One is the BSD based Kingsley "bucket" allocator which has some unique fragmentation behavior. The other is Doug Lea s well tested allocator that tries to minimize fragmentation while keeping the speed/space requirements.
非常实用 ...
ReBEL is a Matlabtoolkit of functions and scripts, designed to
facilitate sequential Bayesian inference (estimation) in general state
space models. This software consolidates research on new methods for
recursive Bayesian estimation and Kalman filtering by Rudolph van der
Merwe and Eric A. Wan. The ...
This paper deals with the problem of speech enhancement when a
corrupted speech signal with an additive colored noise is the only
information available for processing. Kalman filtering is known as
an effective speech enhancement technique, in which speech signal
is usually modeled as autoregressive ...
This paper deals with the problem of speech enhancement when
only a corrupted speech signal is available for processing. Kalman
filtering is known as an effective speech enhancement technique,
in which speech signal is usually modeled as autoregressive (AR)
model and represented in the state-space d ...
回溯（b a c k t r a c k i n g）是一种系统地搜索问题解答的方法。为了实现回溯，首先需要为问题定义一个解空间（ solution space），这个空间必须至少包含问题的一个解（可能是最优的）。在迷宫老鼠问题中，我们可以定义一个包含从入口到出口的所有路径的解空间；在具有n 个对象的0 / 1背包问题中（见1 . 4节和2 . 2节） ...
