KE_Upgrading

For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).

介绍Auto focus的文章，主要介绍了对焦技术，探测技术；包括频域分析、目标函数、目标函数效能验证、影像评估效能之因素、高斯低通滤波器参数的选取、自动对焦技术；以及相关实验结果与分析。(Introduction Auto focus of the article introduces the focus technology, detection technology including frequency domain analysis, the objective function, the objective function performance verification, image assessment of the effectiveness of the factors, Gaussian low-pass filter parameter selection, auto-focus technology and related experimental results and analysis.)

说明：  实现脊线提取，处理信号工具，基于小波变换，可以进行脊线提取(Ridges extraction and signal processing are implemented. Ridge extraction can be done based on wavelet transform.)

O-QPSK modulation and demodulation taking into account Multi-path Fading

说明：  通过MONTE CARLO仿真说明DS扩频信号在抑制正弦干扰方面的有效性(MONTE CARLO simulation shows through the DS spread spectrum signal is sinusoidal interference suppression in the effectiveness of)

Explore RGB using MAtlab program. Useful to extract the information based on the image

K-means with EM alogo

车灯线光源的优化设计方案 (Headlight design optimization)

解决由八个线性矩阵不等式所约束的最小化问题。(Solving the minimiztion problem which is bound to eight linear matrix inequalities .)

find the feature of ECG beat and PQRST wave