FTFrimpong Twum

Frimpong Twum

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Frimpong Twum has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Neural Architecture Search CNN for Alzheimer’s Disease Classification

    by Nicodemus Songose Awarayi, Frimpong Twum, James Ben Hayfron-Acquah, Kwabena Owusu-Agyemang

    The evolution of automated machine learning (AutoML) is gradually reengineering the design of deep learning architectures for various imaging tasks. AutoML effectively develops model architectures and tunes hyperparameters through neural architecture search (NAS). Deep learning model architecture design is generally considered a tedious and time-consuming task that requires mastery skills to develop robust and better-performing models for imaging tasks. Again, the model's hyperparameters must be well-tuned to ensure optimal performances, which can be tedious and time-consuming if the hyperparameters are manually selected; using existing hyperparameter optimization algorithms can be expensive regarding resources. This study addresses these challenges in developing an optimal convolutional neural network (CNN) for classifying Alzheimer's (AD). The study, therefore, adopted a NAS approach to generate a CNN model architecture using a customized search space comprising only CNN patterns implemented with a NAS framework. The search was done for ten (10) trials, yielding a CNN architecture with an accuracy of 95.85% and a loss of 0.22. Training the model with a 10-fold cross-validation approach using a 0.0009 learning rate for 150 epochs improved the model's performance. The model recorded 97.17% accuracy, 97.21% precision, 97.14% recall, and a 0.99 area under the curve (AUC) in classifying AD as one of AD, mild cognitive impairment (MCI), and normal control (NC). The model obtained 98.06%, 98.66%, and 98.62% accuracy on binary classes of AD/NC, AD/MCI, and NC/MCI, respectively. The model generally showed robustness and better performance than existing CNN architectures.

  • Open Access

    Cryptographic Solutions for Data Security in Cloud Computing:

    by John Kwao Dawson, Frimpong Twum, James Benjamin Hayfron Acquah, Yaw Marfo Missah

    Due to the recent explosion in the amount of data being created by various social media platforms, e-commerce websites, and other businesses, a paradigm shift from on-site data centers to the cloud is required. Concerns about privacy and secrecy have been a major obstacle to the mainstream adoption of cloud computing. The best approach to protect the confidentiality and privacy of cloud data is by using cryptographic techniques. Researchers have developed several cryptographic algorithms, but they all have lengthy, linear, predictable, memory-intensive execution times. The performance of the CPU, memory, run-time trend, and throughput of the three cryptographic schemes: Enhanced RSA (ERSA), Non-Deterministic Cryptographic Scheme (NCS), and Enhanced Homomorphic Scheme (EHS) are compared using RAsys. The experiment’s results demonstrated that NCS and EHS produced non-linear and non-deterministic run times. Again, NCS and EHS produced the lowest throughput and memory consumption for text and numeric data types when data sizes of 5n*102(KB(∈1,2,4,10,20,40) were processed. However, ERSA produced a run-time trend that was deterministic, linear, and predictable


  • Open Access

    Ensuring Privacy and Confidentiality of Data on the Cloud Using an Enhanced Homomorphism Scheme

    by John Kwao Dawson, Frimpong Twum, James Hayfron Acquah, Yaw Marfo Missah

    Cloud computing is one of the widest phenomena embraced in information technology. This result from numerous advantages associated with it making many organizations and individuals offload their data to the cloud. Encryption schemes restrict access to data from unauthorized clients, helping attain confidentiality and privacy. The modification of the ciphertext of clients’ data on the cloud demand downloading, deciphering, editing, and finally uploading back to the cloud by sharing their private key with the cloud service provider making it tedious. The application of homomorphism, allows computation to be performed on ciphertext with no decipher activity which helps to avoid the surfacing of sensitive client data stored on the cloud. In this paper, an Enhanced Homomorphism Scheme (EHS) is proposed based on Good Prime Numbers (GPN), Linear Congruential Generator (LCG), Fixed Sliding Window Algorithm (FSWA), and Gentry’s homomorphism scheme. A dataset from the Kaggle database was used to test the proposed algorithm. A variety of tests were conducted using the proposed algorithm such as the Uniqueness of ciphertext, addition and multiplication property of full homomorphism, and the execution times using 2^n (n ∈ 2,3,4,5) data sizes. A comparison of the execution time of the proposed EHS was conducted with the New Fully Homomorphism Scheme (NFHS), and the Enhanced Homomorphism Encryption Scheme (EHES). From the comparison, the proposed EHS algorithm had the lowest encryption time when a data size of 24kb was executed but with a higher decryption time of 567.6667 ± 96.38911when a data size of 8kb was used. On the other hand, with a data size of 32kb, EHES had the highest decryption time of 1274ms with the proposed EHS having the lowest decryption time of 551.2222 ± 82.68746 indicating a decryption percentage decrease of 56.73%. This confirms that execution times are dependent on the size of the encryption key but not on data size.