Open Access Original Research Article
I. P. Oladoja, O. S. Adewale, S. A. Oluwadare, E. O. Oyekanmi
Cloud computing environments provide an apparition of infinite computing resources to cloud users so that they can increase or decrease resource consumption rate according to their demands. In the Cloud, computing resources need to be allocated and scheduled in a way that providers can achieve high resource utilization and users can meet their applications’ performance requirements with minimum expenditure. Due to these different intentions, there is the need to develop a scheduling algorithm to outperform appropriate allocation of tasks on resources. The paper focuses on the resource optimization using a threshold-based tournament selection probability for virtual machines used in the execution of tasks. The proposed approach was designed to create metatask and the proposed algorithm used was Median-Based improved Max-Min algorithm. The experimental results showed that the algorithm had better performance in terms of makespan, utilization of resources and throughput. The load balance of tasks was also fairly distributed on the two datacenters.
Open Access Original Research Article
S. M. Abdullah Al Shuaeb, Md. Kamruzzaman, Mohammad Hazrat Ali
Extracting the needed portion from a bounded region is an important task in image processing. Editing a map and extracting a region from the map is challenging. It is useful in some contexts to have a region in a separate sheet. In this image processing, we have used the Flood Fill algorithm to extract a region from the image map. To achieve that goal, we had worked in our study to separate a bounded region on a map. Usually, a scanned map may contain a lot of useless information. So we have to process the image to remove useless information from the map. We had quantized the image to a binary one. In the second phase, we have applied a gray color to separate the desired position from a map. Our main objective of the study to extract a bounded region from mapping an image that contains useless information and removes it. We have experimented with several maps and it works successfully.
Open Access Original Research Article
Obed Appiah, Dominic Otoo, Christopher Bombie Ninfaakang
Contact tracing has become one of the most useful tools for fighting the novel Corona Virus (COVID-19) pandemic worldwide. The underlining philosophy of contact tracing is determining people who have been in contact with infected persons and thus isolate them from becoming agents of onward transmission of the virus. Slow tracing of contacts and inconsistent or inaccurate information provided by patients usually leads to the spread of the virus along a trajectory at the healthcare systems' blindside. This has led to the proposal of app-based contact tracing solutions. This paper proposes an SQL-based framework that transforms simple interaction data entries into interaction graphs and applies graph theory to prioritize the contact tracing process. The framework returns nodes or individual IDs together with values called Risk_Points to enable individuals' selection for isolation and treatment. Results on simulated data show that the proposed framework can help slow the virus's rate of transmission.