cbba-master

说明：  主要为matlab 2010 之前更改的dmod函数，用于ask，fsk，psk等数字信号的调制。(It is mainly DMOD function changed before matlab 2010, which is used for the modulation of ask, FSK, PSK and other digital signals.)

资源描述一个关于单片机led灯的实验，有Isis图和编程代码，刚入门的初级人士可以看看

对二维码进行识别，将简单的二维码图像进行剪切，量化，去噪，矫正，最后识别出二维码的信息。

说明：  有问题联系我，驱动小车，l298n，stm32f103zet6，(Contact me if you have any questions. Drive the car, l298n, stm32f103zet6.)

列主元消去法解方程组编程 -Out PCA solution of equations elimination Programming

巴西电商数据集，含九张分类表，可用于电子商务数据统计分析。(Brazilian e-commerce data set, including nine classifications, can be used for statistical analysis of e-commerce data.)

说明：  LJ-V7000 系列通信库，为客户提供通过应用程序控制LJ-V7000 系列的通信接口（Win32 DLL）。具体使用方法。(LJ-V7000 Series Communication Library)

非线性降维, 使用者必须自己准备数据，可以对立面的参数进行修改(nonlinear dimesion reduction,This package is free for academic usage. You can run it at your own risk.)

说明：  实现网页动态背景，鼠标点击有炫酷特效，演示：gugudy.vip(Realize the dynamic background of web page)

旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)