Hive

追敢法,主要是n阶线形方程组Ax b的列主元高斯消去法的一个特殊情况,为上三角矩阵,通用程序如附件所示()

zookeeper的web管理系统,阿里员工创作(zookeeper web management system)

ssm学生信息管理系统(源码+数据库+文档)

本代码实现了最简单的走迷宫算法，迷宫是一个二维数组，暂时没实现自动生成迷宫，只是实现了自动找到出口的一个算法，感兴趣的可以下载下来研究，说不定会带给你一些灵感。(The source implementation of the easiest maze algorithm, the maze is a two-dimensional array, temporarily not automatically generated maze, just an algorithm to automatically find the export interested can download the study, and could give you some inspiration.)

mysql 数据库的学习经典书籍，成为mysql高手的必读书籍。(mysql database to learn classic books, reading books become mysql master.)

说明：  The famous Collatz sequence is generated by a method decribed as follows. Given a positive integer N, if it is odd, then replace it with 3*N+1. For even number N, use N/2 instead. You can get a sequence of number by this method. It is conjectured that the algorithm above will terminate at 1 for any integral input value. Despite the simplicity of the algorithm, it is unknown whether this conjecture is true. It has been verified, however, for all integers n such that 0 < n < 1,000,000 (and, in fact, for many more numbers than this.) (Input The first line contains a single integer T tells that there are T cases in the problem. Then for each case, there is an integers N. Output For each number N, output the sequence generated in a line, using coma as its separator. )

以组合大视场星敏感器的卫星自主导航方法为例,设计改进的广义卡尔曼滤波算法,通过仿真,可以看出该算法对减小采样周期所带来的轨()

Python是一种面向对象、解释型计算机程序设计语言，其应用领域非常广泛，包括数据分析、自然语言处理、机器学习、科学计算以及推荐系统构建等。 本书用Python语言来讲解算法的分析和设计。本书主要关注经典的算法，但同时会为读者理解基本算法问题和解决问题打下很好的基础。(Python is an object-oriented, interpretive computer programming language. It has a wide range of applications, including data analysis, natural language processing, machine learning, scientific computing and recommendation system construction. This book uses Python language to explain the analysis and design of algorithms. This book focuses on classical algorithms, but at the same time it will lay a good foundation for readers to understand basic algorithms and solve problems. The book consists of 11 chapters. The tree, graph, counting problem, inductive recursion, traversal, decomposition and merging, greedy algorithm, complex dependency, Dijkstra algorithm, matching and cutting problem, difficult problem and its dilution are introduced. The book has exercises and reference materials at the end of each chapter, which provides readers with more convenience for self-examination and further stu)

开源的axion的数据库代码，代码写的非常好(Axion database open source code, code written in a very good)

说明：  lstm比较火热，matlab2018B已经有相应的工具箱。(LSTM is relatively hot, matlab2018B already has the corresponding toolbox.)