Otherwetwork

通过ThreadPoolExecutor的方式，这样的处理方式让写的同学更加明确线程池的运行规则，规避资源耗尽的风险(Thread pools are not recommended to be created by Executors, but by ThreadPool Executor, which allows students to write more clearly about the rules of thread pools and avoid the risk of resource exhaustion.)

On the Implementation Mode of the Support Vector Machine

使用多线程进行文件的查找，有一个缺点就是占用的资源太多了，但是速度会快。(Using multi-threaded file search, there is a drawback is that the resources too much, but the speed will be faster.)

使用多线程进行文件的查找，有一个缺点就是占用的资源太多了，但是速度会快。(Using multi-threaded file search, there is a drawback is that the resources too much, but the speed will be faster.)

Windows core programming matching source code(Windows core programming matching the source code)

c语言之函数篇,从基础学起,让你彻底精通c语言的应用,(C language function, from the basic learning, so that you are thoroughly proficient in the application of the c language,)

可以显示当前正在运行的进程,选择截杀,可以为自己的进程添加注释(Can display the current running process, the choice put away, you can add a comment for your process)

主要的功能是创建用户使用的一个子进程，一般的子进程都是由system启动的，但是这个是当前用户启动的。(The main function is to create a user using a subset of the process, a subset of the general process is initiated by system, but this is the current user initiated.)

本程序用两种算法对五个进程进行调度，每个进程可有三个状态，并假设初始状态为就绪状态。初始优先数60。为了便于处理，程序中的运行时间以时间片为单位计算，各进程的优先数或轮转时间数以及进程需要运行的时间片数的初值均由用户给定。3） 在优先数算法中，进程每执行一次，优先数减3，CPU时间片数加1，进程还需要的时间片数减1，在轮转算法中，采用固定时间片，时间片数为2，进程每执行1次，CPU时间片数加2，进程还需要的时间数减2，并排列到就绪队列的尾上。(This procedure using two algorithms for five scheduling process, each process can have three states, and assuming that the initial state to the ready state. The initial priority number 60. To facilitate processing, the program runs in time for the unit time slices, each time slice process priority number or rotation time and the number of processes that need to run the initial value by the number given by the user. 3) the priority number algorithm, the process Each time, priority number minus 3, CPU time slices plus one, the process needs time slices minus one, in the Round Robin, the fixed time slice, the time slice number 2 , each process is d once, CPU time slices plus 2, the process needs time minus 2, and arranged into the tail of the ready queue.)

任务管理器小程序，有完整的源代码，C实现 (Similar to the windows task manager, with complete source code.)