基本矩阵运算 : + - *, power, transpose, trace, determinant, minor, matrix of minor, cofactor, matrix of cofactor, adjoint, inverse, gauss, gaussjordan, linear transformation, LU decomposition , Gram-Schmidt process, similarity. b) Basic vectors functions : norm, distance, innerproduct,coldim, rowdim, rank, nullity. *
标签： matrix minor determinant transpose
上传时间： 2013-12-09
上传用户：541657925
LVQ学习矢量化算法源程序 This directory contains code implementing the Learning vector quantization network. Source code may be found in LVQ.CPP. Sample training data is found in LVQ1.PAT. Sample test data is found in LVQTEST1.TST and LVQTEST2.TST. The LVQ program accepts input consisting of vectors and calculates the LVQ network weights. If a test set is specified, the winning neuron (class) for each neuron is identified and the Euclidean distance between the pattern and each neuron is reported. Output is directed to the screen.
标签： implementing quantization directory Learning
上传时间： 2015-05-02
上传用户：hewenzhi
很好的linux内核调试软件 兼辕马，没有密码。 The ia64 and ix86 directories contain versions of kdb prior to v2.0 (kdb version v2.0, not the kernel version). Older versions of kdb had complete patches for each architecture it supported, each patch included all the common kdb code. This format was awkward to maintain and use for multiple platforms. Starting with kdb v2.0 there is a common patch against each kernel which contains all the architecture independent code plus separate architecture dependent patches. Either use an old style (v1.8 or v1.9) kdb patch or use a new style (v2.0) common patch plus the corresponding architecture dependent patch.
上传时间： 2014-01-21
上传用户：wyc199288
用C语言实现最短路径算法中的Bellman-Ford算法，这个算法可以用来解决信号处理中的一些问题。bellman_ford.c为源程序；distance.txt文件存放各界点之间的距离，以99999表示无穷大；bellman_ford.txt文件是输出文件，存放每轮循环得到的中间值，以及最后得到的到各个节点的最短距离，如果图包含负回路，文件中返回FALSE。
标签： Bellman-Ford 算法 C语言 最短路径
上传时间： 2013-12-31
上传用户：阳光少年2016
This text surrounds the development of the electric power SCADA system exactly, aiming at the present condition of the our country electric power charged barbed wire net currently, according to the oneself at the e- lectric power protect the profession after the electricity in seven years of development, design and adjust to try the experience on the scene from following severals carry on the treatise:Is the emergence to the system of SC- ADA and developments to introduce first Carry on the introduction elucidation to applied present condition and the development foregrounds of various terminal equipments communication agreement(rules invite) the next in order Then is the elucidation to the windows the bottom according to the mfc the plait distance environment an- d VC++6.0 plait distance softwares Carry on the more detailed treatise to the realization of the procedure struct- ure frame and the source code again End is the applied case example give examples.
标签： the development surrounds electric
上传时间： 2014-10-28
上传用户：liuchee
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
标签： Implemented following compile command
上传时间： 2014-01-01
上传用户：lhc9102
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included 2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value
标签： Traveling Salesman solution Problem
上传时间： 2013-12-22
上传用户：ruixue198909
Linux是一個Open Source的UNIX-like作業系統，除了有著廣大的支援社群以外，穩定、模組化、擁有廣大的應用免費應用軟體支援是它主要的優點。ARM嵌入式處理器則是目前應用在嵌入式系統領域中，佔有率最高的處理器，同時也是Linux核心目前所能夠支援的處理器之一，然而要使得Linux在ARM嵌入式處理器上運作，勢必要經過移植 (porting) 的過程，也就是要將平台相依 (platform dependent) 的部分做適當的修改
标签： UNIX-like Source Linux Open
上传时间： 2015-11-08
上传用户：dengzb84
A system simulation environment in Matlab/Simulink of RFID is constructed in this paper. Special attention is emphasized on the analog/RF circuit.Negative effects are concerned in the system model,such as phase noise of the local oscillator,TX-RX coupling,reflection of the environment, AWGN noise,DC offset,I/Q mismatch,etc.Performance of the whole system can be evaluated by changing the coding method,parameters of building blocks,and operation distance.Finally,some simulation results are presented in this paper.
标签： environment constructed simulation Simulink
上传时间： 2014-01-09
上传用户：zhangliming420
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
标签： Traveling Salesman solution Problem
上传时间： 2013-12-04
上传用户：从此走出阴霾
