NIOAccess

worldFIP从节点功能实现，如果需要更多请联系我，csuzhsh@gmail.com(WorldFIP function from the node implementation, if need more please contact me, csuzhsh@gmail.com)

题目：打印出杨辉三角形（要求打印出10行题目：输入3个数a,b,c，按大小顺序输出。 题目：输入数组，最大的与第一个元素交换，最小的与最后一个元素交换，输出数组。 题目：有n个整数，使其前面各数顺序向后移m个位置，最后m个数变成最前面的m个数 题目：编写一个函数，输入n为偶数时，调用函数求1/2+1/4+...+1/n,当输入n为奇数时，调用函数1/1+1/3+...+1/n(Topic: Print out the Triangle (10 lines required to print out the Title: Enter the 3 numbers a, b, c, according to the order of output. Title: input array, the largest exchange with the first element, the smallest and the last element of the exchange, output array. Topic: There are n integers, to move back in front of the order m of the number of positions, finally becoming the foremost m m the number of number of topics: write a function, the input n is even, the call function evaluation 1/2+1/4+...+ 1/n, when the input n is odd, call the function 1/1+1/3+...+ 1/n)

this an example of Http proxyServer.

Contains the generics, enumerations, static imports, automatically split open a case, using the foreach, variable parameter, such as reflection

说明：  pwm小车，内有视频，功能强大，讲解详实，是一个不可多得的pwm小车入门。(PWM car, with video, powerful function, detailed explanation, is a rare introduction to PWM car.)

网络五子棋，可以进行局域网和广域网的互联游戏，具有悔棋，保存，等功能。欢迎下载！-network, LAN and WAN connectivity games, with he never cheat in spain, preservation, and other functions. Welcome to download!

计算智能课中要求圆形packing问题这里给出了圆形packing问题的一个编程例子(Computational Intelligence lesson circular packing problem requires a programming example given here circular packing problem)

说明：  利用opencv录制视屏并保存彩色的视频，(Record video with opencv and save video)

一种著名的增量PCA方法,能够以增量的方式获取主成分(a famous incremental PCA algorithm. It can obtain the principal component incrementally)

说明：  UCOSII在VS2017上的移植，亲测可以用(UCOS II Portable For Visual Studio 2017)