Laborator 8 - Scripturi shell

说明：  图着色局部搜索,图着色问题（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.)

编写地震波程序 用于 将反应谱转换为地震波(translate the wave of sismic)

ABAQUS损伤开裂二次开发，其中包括inp文件和二次开发for文件(BAQUS damage cracking secondary development, including inp files and secondary development for files)

参数识别和模态分析神经网络应用于桥梁结构评估。(System identification)

说明：  viterbi decode by verilog

说明：  基于压缩感知的多入多出毫米波信道估计算法源代码(Millimeter Wave Channel Estimation Based on Compressed Sensing)

说明：  neural network code for artificial intelligence

混沌理论中相空间程序，可以在预测中使用，效果好 -Chaos Theory in the phase-space program can be used in forecasting, effective

说明：  这是一个变电站的监控程序，数据库采用的是sql server7.0(This is a substation of the monitoring program, the database is used in sql server7.0)

说明：  深度，多视角聚类，半非负矩阵分解，l21范式，线性，非线性(deep multi-view semi-nonnegative matrix factorization)