5 articles for “CPU time usage”

Set a search alert

Research ArticleOpen accessIn the keywordsNumerical Solution of the Taylor-Quette Flow Problem: A Commodious Statistical ApproachAyoob Karimi, Hassan Zeytoonian, Shahin NavardiProblem statement: The main problem in solving of the Boltzmann equation by statistical methods is its long computational time (CPU time). The problem of decreasing of CPU time usage in statistical solution methods of Boltzmann equation for rarefied vortex flows was studied. Approach: In this study the Boltzmann equation in a rarefied Taylor-Quette flow regime was solved using the new … …Physics International, Vol. 1, Issue 1 · 31 Mar 2010 · 7,780 accessesView PDF Cite

Research ArticleOpen accessIn the abstractPerformance Analysis of Two Famous Cryptographic Algorithms on Mixed DataEmmanuel Abidemi Adeniyi et al.The rapid development of digital data sharing has made information security a crucial concern in data communication. The information security system heavily relies on encryption methods. These algorithms employ strategies to increase data secrecy and privacy by obscuring the information, which only those parties who have the accompanying key can decode or decrypt. Nevertheless, these methods also use a lot … …Journal of Computer Science, Vol. 19, Issue 6 · 29 May 2023 · 6,020 accessesView PDF Cite

Research ArticleOpen accessIn the abstractAnomaly Detection Algorithms for Streaming Data: Performance ComparisonZirije HasaniToday’s most of the data are streaming time-series data, where is very important anomaly detection over this data because gives significant information of possible critical situations. Detecting anomalies in big streaming data is yet difficult task because we have to process them in real time, even before they are stored and instantly alarm on potential threats. For real time streaming … …Journal of Computer Science, Vol. 16, Issue 7 · 18 Jul 2020 · 7,288 accessesView PDF Cite

Research ArticleOpen accessIn the abstractRecommendation Engine Formation Using Depth First Search and Genetic ApproachJ. S. Kanchana, S. SujathaThe requirement of online users in the website varies dynamically. The recommendation of web pages consisting of user expected information and data is performed by the online recommendation system. The recommendation engine must be self-adaptive and accurate. The existing algorithm uses Depth First Search (DFS) and bee's foraging approach to create navigation profiles by categorizing the current user activity. The … …Journal of Computer Science, Vol. 11, Issue 1 · 15 Sep 2014 · 7,343 accessesView PDF Cite

Research ArticleOpen accessIn the abstractQUANTITATIVE EVALUATION OF JOB AND RESOURCES FOR BETTER SELECTION TO IMPROVE MAKESPAN IN GRID SCHEDULINGKrishnamoorthy Natarajan, Asokan Ramasamy, Sangeetha SubramanianThis study presents the Priority based ranking of jobs and resources to improve the Makespan in the grid scheduling problem. Grid environment’s effectiveness largely depends on scheduler’s effectiveness/efficiency as they act as local resource brokers. The scheduler is responsible to select resources/scheduling jobs so that users/application requirements are met regarding overall execution time (throughput) and the resources use cost. The … …Journal of Computer Science, Vol. 10, Issue 5 · 4 Jan 2014 · 6,554 accessesView PDF Cite