The Round Robin (RR) CPU scheduling algorithm is a fair scheduling algorithm that gives equal time quantum to all processes. The choice of the time quantum is critical as it affects the algorithm's performance. This paper proposes a new algorithm that further improved on the Improved Round Robin CPU (IRR) scheduling algorithm by Manish and AbdulKadir. The proposed algorithm was implemented and benchmarked against five other algorithms available in the literature. The proposed algorithm compared with the other algorithms, produces minimal average waiting time (AWT), average turnaround time (ATAT), and number of context switches (NCS). Based on these results, the proposed algorithm should be preferred over other scheduling algorithms for systems that adopt RR CPU scheduling.

With improvement in computing and technological advancements, web-based applications are now ubiquitous on the Internet. However, these web applications are becoming prone to vulnerabilities which have led to theft of confidential information, data loss, and denial of data access in the course of information transmission. Cross-site scripting (XSS) is a form of web security attack which involves the injection of malicious codes into web applications from untrusted sources. Interestingly, recent research studies on the web application security centre focus on attack prevention and mechanisms for secure coding; recent methods for those attacks do not only generate high false positives but also have little considerations for the users who oftentimes are the victims of malicious attacks. Motivated by this problem, this paper describes an "intelligent" tool for detecting cross-site scripting flaws in web applications. is paper describes the method implemented based on fuzzy logic to detect classic XSS weaknesses and to provide some results on experimentations. Our detection framework recorded 15% improvement in accuracy and 0.01% reduction in the false-positive rate which is considerably lower than that found in the existing work by Koli et al. Our approach also serves as a decision-making tool for the users.

This paper presents rhotrix multiplication and introduces its implementation on process grid topologies. Covered in this work, are reviews of generalization cases of n-dimensional rhotrix multiplication. A parallel program based on MPI master-worker paradigm is implemented. By means of analyzing the time complexity and memory requirement for the method, the authors provided insight into how to fully utilize the algorithm for heart-oriented rhotrix multiplication in anticipation of establishing a standard for parallel rhotrix multiplication and to speed up its multiplication based on existing HPC tools.

The paper presents a generic reference architecture framework for collaboratory experiment virtual laboratory. The model presented is open source driven, flexible and based on modern tools and technologies. This in effect will allow geographically remote scientists with limited internal laboratory resources, access to wealth of experimental datasets, computing facilities, and distributed hard-to-duplicate laboratory devices. The key issues discussed are architectural design and choice of technology used for creating virtual laboratory. This architecture offers great levels of flexibility, simplicity, and interoperability that are needed to allow integration between heterogeneous distributed grid resources and its clients and executors. The framework, besides theoretical modelling, will provide a road map for future research and open questions.

This paper introduces a novel generalized concept of higher order heart-oriented rhotrix multiplication expression. The multiplication method we adapted is intended to maintain the unique properties associated with the initial definition of rhotrix. The special multiplication process can be used to solve various problems involving n x n rhotrices multiplication. Most importantly a generalized expression for representing n-dimensional rhotrix in a computational environment is presented. Sequential computational algorithm for higher order rhotrices multiplication is designed to buttress the mathematical expression, axioms and logic presented in this paper.. General Terms