JACOBI_and_guass

矩阵的转置、行列式、秩，逆矩阵求法，矩阵的三角分解、qr分解，对称正定矩阵的乔里斯基分解及行列式值，奇异值分解，广义逆的奇异值分解，矩阵特征值与特征向量的各种计算方法(all kinds of computational method of transposition of matrix, determinant, rank, inverse of matrix,triangle decomposition, qr decomposition, cholesky decomposition and determinant value based on symmetry positive definite matrix, decomposition of singular value, decomposition of generalized inversal singular value, eigenvalue and eigenvector)

列举SQL服务器:本实例可以列举出计算机中所有的SQL SERVER 服务器和数据库.-cited SQL Server : This example can be cited of all computer server and SQL Server database.

mfc 开发的会议室 可以进行简单会议-mfc developer conference room can be a simple meeting

使用Winsock控件编写的TCP、UDP通信测试程序，支持CRC、XOR、SUM等通信校验方式，是一款比较使用的工程测试工具软件-Winsock controls prepared by the TCP, UDP communications test procedure, support CRC, XOR, SUM calibration methods such as communications, is a comparison of the use of engineering software testing tools

说明：  详细介绍了VLAN的划分以及802.1Q二层优先级的知识。(Details of the division of VLAN and 802.1Q Layer 2 priority of knowledge)

Labview与数据库Access及SQL Server的连接 基于ActiveX(Labview database connectivity Access and SQL Server ActiveX-based)

poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills. (poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills.)

仿真计算银行服务系统的顾客平均等待时间，可以修改程序参数（如顾客出现概率，最大服务时间，服务窗口数等）来计算顾客平均等待时间。(The average customer waiting time simulation system of banking services, you can modify the program parameters (such as customer probability, maximum service time, service number of windows, etc.) to calculate the average customer waiting time.)

说明：  nihao nid learn go Upload log: nihao nid

simulink module training