Matlab-Read-and-keep-the-text

信号员相干时候的DOA 估计应用了其它DOA估计算法(Members of coherent signals when the DOA is estimated that the application of the other DOA estimation algorithm)

实现火箭的垂直发射，并在重力作用下实现转弯。(Achieve vertical launch rocket and turn under the influence of gravity.)

基于粗糙集的模糊分类模型的MATLAB代码。可用(MATLAB code based on fuzzy rough set classification model. Available)

IEEE 802.11a标准，利用matlab进行仿真。包括信道，发射机，接收机，调制，解调，交织，维特比译码，导频(IEEE 802.11a standard, the use of matlab simulation. Including channels, transmitters, receivers, modulation, demodulation, interleaving, Viterbi, Pilot)

FAST K-NEAREST NEIGHBORS SEARCH (FAST K-NEAREST NEIGHBORS SEARCH Description You can find the description at: http://www.advancedmcode.org/gltree.html A Pro Version has been published on: http://www.advancedmcode.org/gltree-pro-version-a-fast-nearest-neighbour-library-for-matlab-and-c.html Acknowledgements The author wishes to acknowledge the following in the creation of this submission: K-NEAREST NEIGHBOURS AND RADIUS (RANGE) SEARCH This submission has inspired the following: K-NEAREST NEIGHBOURS AND RADIUS (RANGE) SEARCH, FAST K-NEAREST NEIGHBOURS SEARCH 3D VERSION MATLAB release MATLAB 7.5 (R2007b) Other requirements Need a mex compiler Zip File Content Other Files BuildGLTree2DFEX.cpp, BuildGLTree2DFEX.m, DeleteGLTree2DFEX.cpp, DeleteGLTree2DFEX.m, GLTree2DFEX.cpp, GLTree2DFEX.h, license.txt, NNSearch2DFEX.cpp, NNSearch2DFEX.m, TestMexFiles.m )

This paper presents a new and efficient approach for capacitor placement in radial distribution systems (RDS) that determine the optimal locations and size of capacitor with an objective of improving the voltage profile and reduction of power loss. The solution methodology has two parts: in part one the loss sensitivity factors (LSF) are used to select the candidate locations for the capacitor placement and in part two a new algorithm that employs Dijkstra Algorithm (DA) is used to estimate the optimal size of capacitors at the optimal buses determined in part one. The main advantage of the proposed method is that it does not require any external control parameters. The other advantage is that it handles the objective function and the constraints separately. The proposed method is applied to 33 & 69 RDS. The solutions obtained by the proposed method are compared with other methods. The proposed method has outperformed the other methods in terms of the quality of solution. OPTIMAL C

Poly alphabetic cipher in C

自已做的直扩系统的simulink仿真，包括信号源的生成，捕获与跟踪，解扩解调全过程(To do their own DS systems simulink simulation, including the signal source of the generation, capture and track the entire process of despreading demodulation)

周东华教授的强跟踪滤波器程序 两个功能子函数 三个针对不同对象模型的主程序 无错误 直接运行出图(Professor Zhou Donghua Strong Tracking Filter Functions program two functional object model three different error-free run directly on a map the main program)

In the computer science field of artificial intelligence, a genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic (also sometimes called a metaheuristic) is routinely used to generate useful solutions to optimization and search problems.[1] Genetic algorithms belong to the larger class of evolutionary algorithms (EA), which generate solutions to optimization problems using techniques inspired by natural evolution, such as inheritance, mutation, selection, and crossover. Genetic algorithms find application in bioinformatics, phylogenetics, computational science, engineering, economics, chemistry, manufacturing, mathematics, physics, pharmacometrics and other fields.