multicasting

说明：  1.1 背包问题 有一个徒步旅行者，已知他能承受的旅行背包的重量不超过a（kg）。设有n种物品可供他选择装入背包，这n种物品分别编号为1，2，…，n。其中第i种物品每件的重量为ai（kg），其使用价值（指一件第i种物品对旅行者来说所带来的好处的一种数量指标）为ci（i＝1，2，…，n）。问这位旅行者应如何选择携带这n种物品的件数，使得总价值最大？ (1.1 knapsack problem is a hikers. he is known to travel to withstand the weight of the backpack not exceed a (kg). N Species with articles for his choice loaded backpack, n product were numbered 1, 2, ..., n. I first of which product each ai of the weight (kg), its value (i refers to a section of the types of items travelers the benefits brought by a number of indicators) for the ci (i = 1, 2, ..., n). Asked how travelers who choose to bring this product to the n pieces, making the total value of the largest?)

codage programmes pour la parole

由網路資源找的視覺密碼代碼,是1994年研究所提之版本,提供給大家參考(Visual cryptography code to find network resources, the proposed 1994 version, provided for your reference)

matlab发动机仿真模型，根据微分方程建立。包括传热模型，燃烧模型。(the matlab engine simulation model)

CONTROL OF A SYSTEM USING VARIABLE STRUCTURE CONTROLLER

四元数c++软件类库，四元数基本运算，非常好用(Quaternion c++ Software library, quaternion basic computing, very easy to use)

beamforming theory from the renovable engineers

Hilbert Vibration Decomposing (HVD)

说明：  ISOMAP代码，附数据，用于材料的缺陷检测(ISOMAP code with data for defect detection of materials)

说明：  矩阵LDLT分解与Cholesky分解 求矩阵A=（αij）20x20的LDLT分解与Cholesky分解(Matrix LDLT decomposition and Cholesky decomposition Matrix A = (αij) 20x20 of the LDLT decomposition and Cholesky decomposition)