{"title":"Fake News Detection","authors":"Si Hong Long, M. P. Hamzah","doi":"10.1007/978-981-33-4069-5_25","DOIUrl":"https://doi.org/10.1007/978-981-33-4069-5_25","url":null,"abstract":"","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"12 1","pages":"295 - 303"},"PeriodicalIF":0.0,"publicationDate":"2021-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83285333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Issues and Challenges for Teaching Successful Programming Courses at National Secondary Schools of Malaysia","authors":"F. Salleh, D. A. Dewi, N. Liyana","doi":"10.1007/978-981-33-4069-5_41","DOIUrl":"https://doi.org/10.1007/978-981-33-4069-5_41","url":null,"abstract":"","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"72 1","pages":"501 - 513"},"PeriodicalIF":0.0,"publicationDate":"2021-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84549401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Scalable Cloud-Based Medical Adherence System with Data Analytic for Enabling Home Hospitalization","authors":"Abubaker Sherif, T. Haw, Ooi Chee Pun, Tan Yi Fei","doi":"10.1007/978-981-33-4069-5_34","DOIUrl":"https://doi.org/10.1007/978-981-33-4069-5_34","url":null,"abstract":"","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"14 1","pages":"417 - 426"},"PeriodicalIF":0.0,"publicationDate":"2021-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83180971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Contactless Patient Authentication for Registration Using Face Recognition Technology","authors":"Kian Yang Tay, Y. Pang, S. Ooi, Fan Ling. Goh","doi":"10.1007/978-981-33-4069-5_7","DOIUrl":"https://doi.org/10.1007/978-981-33-4069-5_7","url":null,"abstract":"","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"30 1","pages":"71 - 80"},"PeriodicalIF":0.0,"publicationDate":"2021-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77689811","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the Asymptotic Density of Prime k-tuples and a Conjecture of Hardy and Littlewood","authors":"L. T'oth","doi":"10.12921/cmst.2019.0000033","DOIUrl":"https://doi.org/10.12921/cmst.2019.0000033","url":null,"abstract":"In 1922 Hardy and Littlewood proposed a conjecture on the asymptotic density of admissible prime k-tuples. In 2011 Wolf computed the \"Skewes number\" for twin primes, i.e., the first prime at which a reversal of the Hardy-Littlewood inequality occurs. In this paper, we find \"Skewes numbers\" for 8 more prime k-tuples and provide numerical data in support of the Hardy-Littlewood conjecture. Moreover, we present several algorithms to compute such numbers.","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"51 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83185096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Aspects of Dynamical Simulations, Emphasizing Nosé and Nosé-Hoover Dynamics and the Compressible Baker Map","authors":"W. G. Hoover, C. G. Hoover","doi":"10.12921/cmst.2019.0000035","DOIUrl":"https://doi.org/10.12921/cmst.2019.0000035","url":null,"abstract":"Aspects of the Nose and Nose-Hoover dynamics developed in 1983-1984 along with Dettmann's closely related dynamics of 1996, are considered. We emphasize paradoxes associated with Liouville's Theorem. Our account is pedagogical, focused on the harmonic oscillator for simplicity, though exactly the same ideas can be, and have been, applied to manybody systems. Nose, Nose-Hoover, and Dettmann flows were all developed in order to access Gibbs' canonical ensemble directly from molecular dynamics. Unlike Monte Carlo algorithms dynamical flow models are often not ergodic and so can fail to reproduce Gibbs' ensembles. Accordingly we include a discussion of ergodicity, the visiting of all relevant microstates corresponding to the desired ensemble. We consider Lyapunov instability too, the usual mechanism for phase-space mixing. We show that thermostated harmonic oscillator dynamics can be simultaneously expanding, incompressible, or contracting, depending upon the chosen \"phase space\". The fractal nature of nonequilibrium flows is also illustrated for two simple two-dimensional models, the hard-disk-based Galton Board and the time-reversible Baker Map. The simultaneous treatment of flows as one-dimensional and many-dimensional suggests some interesting topological problems for future investigations.","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"33 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76229776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Nosé-Hoover, Dettmann, and Hoover-Holian Oscillators","authors":"W. G. Hoover, J. Sprott, C. G. Hoover","doi":"10.12921/cmst.2019.0000031","DOIUrl":"https://doi.org/10.12921/cmst.2019.0000031","url":null,"abstract":"To follow up recent work of Xiao-Song Yang on the Nose-Hoover oscillator we consider Dettmann's harmonic oscillator, which relates Yang's ideas directly to Hamiltonian mechanics. We also use the Hoover-Holian oscillator to relate our mechanical studies to Gibbs' statistical mechanics. All three oscillators are described by a coordinate $q$ and a momentum $p$. Additional control variables $(zeta, xi)$ govern the energy. Dettmann's description includes a time-scaling variable $s$, as does Nose's original work. Time scaling controls the rates at which the $(q,p,zeta)$ variables change. The ergodic Hoover-Holian oscillator provides the stationary Gibbsian probability density for the time-scaling variable $s$. Yang considered {it qualitative} features of Nose-Hoover dynamics. He showed that longtime Nose-Hoover trajectories change energy, repeatedly crossing the $zeta = 0$ plane. We use moments of the motion equations to give two new, different, and brief proofs of Yang's long-time limiting result.","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74768944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Study of memory effect in an economic order quantity model with quadratic type demand rate","authors":"Rituparna Pakhira, U. Ghosh, S. Sarkar","doi":"10.12921/CMST.2019.0000004","DOIUrl":"https://doi.org/10.12921/CMST.2019.0000004","url":null,"abstract":"The study of memory effect in an economic order quantity model has a great impact on the inventory system. Although business policy almost depends on the past experiences of the system, usually the classical inventory model does not include the past experience or memory effect, i.e. one important part of the system is ignored. Our purpose is to include memory or past experience in the inventory model. The purpose of this paper is to incorporate the existence of dynamic memory in an inventory model with shortage via fractional calculus. To derive the memory dependent inventory model associated with inventory holding cost, shortage cost has been developed. Analytical solution of the proposed inventory model has been solved via primal geometric programming method. Numerically long memory effect or short memory effect of the inventory system has been established. In this paper, an effort has also been made to compare the memory effect on the minimized total average cost and the optimal ordering interval using different numerical examples.","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"11 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88656788","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Interval Runge-Kutta Methods with Variable Step Sizes","authors":"A. Marciniak, B. Szyszka","doi":"10.12921/CMST.2019.0000006","DOIUrl":"https://doi.org/10.12921/CMST.2019.0000006","url":null,"abstract":"In a number of our previous papers we have presented interval versions of Runge-Kutta methods (explicit and implicit) in which the step size was constant. Such an approach has required to choose manually the step size in order to ensure an interval enclosure to the solution with the smallest width. In this paper we propose an algorithm for choosing automatically the step size which guarantees the best (i.e., the tiniest) interval enclosure. This step size is determined with machine accuracy.","PeriodicalId":10561,"journal":{"name":"computational methods in science and technology","volume":"35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77925948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}