期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Identifying Game Processes Based on Private Working Sets 被引量:1
1
作者 Jinfeng Li Li Feng +3 位作者 Longqing Zhang Hongning Dai Lei Yang Liwei Tian 《Computers, Materials & Continua》 SCIE EI 2020年第10期639-651,共13页
Fueled by the booming online games,there is an increasing demand for monitoring online games in various settings.One of the application scenarios is the monitor of computer games in school computer labs,for which an i... Fueled by the booming online games,there is an increasing demand for monitoring online games in various settings.One of the application scenarios is the monitor of computer games in school computer labs,for which an intelligent game recognition method is required.In this paper,a method to identify game processes in accordance with private working sets(i.e.,the amount of memory occupied by a process but cannot be shared among other processes)is introduced.Results of the W test showed that the memory sizes occupied by the legitimate processes(e.g.,the processes of common native windows applications)and game processes followed normal distribution.Using the T-test,a significant difference was identified between the legitimate processes and C/S-based computer games,in terms of the means and variances of their private working sets.Subsequently,we derived the density functions of the private working sets of the considered game processes and those of the legitimate processes.Given the private working set of a process and the derived probability density functions,the probability that the process is a legitimate process and the probability that the process is a game process can be determined.After comparing the two probabilities,we can easily determine whether the process is a game process or not.As revealed from the test results,the recognition accuracy of this method for C/S-based computer games was approximately 90%. 展开更多
关键词 Game process recognition private working set comparative analysis
下载PDF
A Fast Algorithm for Training Large Scale Support Vector Machines
2
作者 Mayowa Kassim Aregbesola Igor Griva 《Journal of Computer and Communications》 2022年第12期1-15,共15页
The manuscript presents an augmented Lagrangian—fast projected gradient method (ALFPGM) with an improved scheme of working set selection, pWSS, a decomposition based algorithm for training support vector classificati... The manuscript presents an augmented Lagrangian—fast projected gradient method (ALFPGM) with an improved scheme of working set selection, pWSS, a decomposition based algorithm for training support vector classification machines (SVM). The manuscript describes the ALFPGM algorithm, provides numerical results for training SVM on large data sets, and compares the training times of ALFPGM and Sequential Minimal Minimization algorithms (SMO) from Scikit-learn library. The numerical results demonstrate that ALFPGM with the improved working selection scheme is capable of training SVM with tens of thousands of training examples in a fraction of the training time of some widely adopted SVM tools. 展开更多
关键词 SVM Machine Learning Support Vector Machines FISTA Fast Projected Gradient Augmented Lagrangian working set Selection DECOMPOSITION
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部