CDMA

FLKT是C++之父写的教材中用到的GUI库。(FLTK (pronounced "fulltick") is a cross-platform C++ GUI toolkit for UNIX® /Linux® (X11), Microsoft® Windows® , and MacOS® X. FLTK provides modern GUI functionality without the bloat and supports 3D graphics via OpenGL® and its built-in GLUT emulation. FLTK is designed to be small and modular enough to be statically linked, but works fine as a shared library. FLTK also includes an excellent UI builder called FLUID that can be used to create applications in minutes. FLTK is provided under the terms of the GNU Library Public License, Version 2 with exceptions that allow for static linking. )

三维路径规划算法，蚁群算法实现，注释详细清晰，程序完整(Three-dimensional path planning algorithm, ant colony algorithm, detailed notes clear, complete procedures)

用matlab程序编写，附带源码以及说明书，用于GPS定位技术方面整周模糊度固定的计算小工具(Using matlab programming, with source code and instructions, GPS positioning technology integer ambiguity fixed for computing gadgets)

用于提取心电信号的特征，包含时域，频域，RR interval相关特征(used for ECG signal feature extraction, including time domain, frequency domain and RR interval related features)

This program has evolved over time and uses programming

Learning Automata Algorithms A collection of machine learning programs which contains some of Learning Automata algorithms such as Tsetline, Krinisky, Krylov, LRI, LIP, LRR, LReP, SoftMax, SampleAverage and Random strategy. All of these developed in MATLAB 6.5

一种自适应滤波算法，可进行lms和rls算法学习和实现(An adaptive filtering algorithm, LMS and RLS algorithms can be learning and implementation )

Draws Black-Scholes surface for European call Compute expected payoff for European call & Illustrates risk neutrality Apply Netwon s Method to N(x) + exp(x) = 2.(Draws Black-Scholes surface for European call Compute expected payoff for European call & Illustrates risk neutrality Apply Netwon s Method to N(x)+ exp(x) = 2.)

将年月日时分秒转换为某一基准年开始的总秒数(The date(YYYY，MM，DD，hh，mm，ss) is converted to a base year of the total number of seconds.)

一种遗传算法和萤火虫算法相结合的新型元启发式算法，经过测试，算法具有良好的性能。(Capacitated facility location problem (CFLP) is a well-known combinatorial optimization problem with applications in distribution and production planning that is classified as an NP-Hard problem. The aim is to determine where to locate facilities and how to move commodities such that the customers’ demands are satisfied and the total cost minimized. In this paper, a new hybrid optimization method called Hybrid Evolutionary Firefly-Genetic Algorithm is proposed, which is inspired by social behavior of fireflies and the phenomenon of bioluminescent communication. The method combines the discrete Firefly Algorithm (FA) with the standard Genetic Algorithm (GA). It is devoted to the detailed description of the problem, and an adaption of the algorithm. Computational results on random generated problems consisting of 2000 locations and 2000 customers are reported. )