tensorflow预测股票涨跌

该压缩包主要是pyqt5的开发资料，需要设计界面等的同学可以下载。(The compressed packet is mainly pyqt5 development information.)

MATLAB 结巴分词的工具包，用于很多中文分词的模式识别代码程序，利用已有函数工具包提高工作效率，内有安装说明(MATLAB jieba toolkit, used for many Chinese word segmentation pattern recognition code programs, using existing function toolkits to improve work efficiency, with installation instructions)

说明：  abaqus python实现建立批量螺钉连接，并自动建立MPC(ABAQUS Python realizes the establishment of batch screw connection and the automatic establishment of MPC)

语义依存方法的详细操作和编程思想，简明易懂，可以跟着编程(The detailed operation and programming idea of the semantic dependency method are concise and easy to understand, and can be followed by programming)

说明：  python编程约40例，有词频统计、读写文件、有网络爬虫、绘制图像等例程(Python programming about 40 examples, including word frequency statistics, reading and writing files, network crawlers, drawing images and other routines)

采用模糊 C 均值法，通过对 sonar、iris 数据进行无监督分类。 模糊 C 均值算法 C 均值（HCM）：把 N 个样本{

一款tornado开发的restful微信公众号开发服务，速度很快，框架简单明了易懂！！！！！！

说明：  图着色局部搜索,图着色问题（Graph Coloring Problem, GCP） 又称着色问题，是最著名的NP-完全问题之一。道路着色问题（Road Coloring Problem）是图论中最著名的猜想之一。 数学定义：给定一个无向图G=（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory. Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)

segmentation using region growing in an image

基于django的框架 python开发(Framework python development based on django)