• International Journal of Computer Science & Network Security
• /
• v.22 no.6
• /
• pp.275-287
• /
• 2022

As a result, for the increasing expansion by the university faculties in the field of postgraduate studies, The Deanship of Graduate Studies at the university has been established in 1430 AH/2009 CE to specifically address the needs of the current and prospective graduate population to supervise postgraduate studies programs in coordination with the concerned faculties. This comes as a result for the university being certain of the importance of providing postgraduate studies opportunities that follow the bachelor's degree to qualify our ambitious youth appropriately. The University offers 72 different Graduate programs, awarding doctoral and master's degrees along with fellowships and diplomas in various disciplines like health, engineering, science, literary, and educational. Currently, the financial model for admission and students' payment is manual and paper based. This paper proposes to provide a user interface for Financial Management in Deanship of Graduate studies The basic purpose of the system was to minimize human interference and reduce mistakes placed by human interference, also to have efficient and a fast performance, and perform Electronic Data Interchange (EDI) for various tasks such as billing and scheduling details.

• The Journal of Korean Association of Computer Education
• /
• v.17 no.4
• /
• pp.33-44
• /
• 2014

To understand an educational curriculum at the national level is to check the status of the respective subjects involved. This study aimed at analyzing computer science education and educational curricula in Israel, a leader in fostering creative human resources, so as to suggest directions for computer science education in Korea. Israel's computer science education in middle schools is provided through integration with natural science and technology subjects, but in high school it is offered as an independent subject. In 2011, as the computer science educational curriculum for middle schools was developed, computer science evolved from an integrated to an independent subject. Accordingly, this study proposes the necessity to discuss the status of this subject from the viewpoint of integration and independence for computer science education in Korea.

• Journal of The Korean Association of Information Education
• /
• v.23 no.6
• /
• pp.655-663
• /
• 2019

Recent interest in software education has naturally led to interest in computer science. Computer science is the study of theory and principle of computer and computational systems. This knowledge and concept of computer science is fundamental to software education. Recently, "Computer Science (CS) Unplugged", which is an educational method for introducing students to concepts of computer science without using a computer, has been widely used in classes around the world. CS Unplugged is a method for learning the basic principles of computer science through diverse playing activities. The problem, however, is that these CS unplugged activities take place in class without an analysis of how closely they relate to the core subjects learned in real computer science. Therefore, in this study, we will study on the comparison between the core contents of computer science and the core contents of computer science contained in the various activities of CS Unplugged.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.103-111
• /
• 2021

Obesity affects individuals of all gender and ages worldwide; consequently, several studies have performed great works to define factors causing it. This study develops an effective method to trace obesity levels based on supervised data mining techniques such as Random Forest and Multi-Layer Perception (MLP), so as to tackle this universal epidemic. Notably, the dataset was from countries like Mexico, Peru, and Colombia in the 14- 61year age group, with varying eating habits and physical conditions. The data includes 2111 instances and 17 attributes labelled using NObesity, which facilitates categorization of data using Overweight Levels l I and II, Insufficient Weight, Normal Weight, as well as Obesity Type I to III. This study found that the highest accuracy was achieved by Random Forest algorithm in comparison to the MLP algorithm, with an overall classification rate of 96.7%.

• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.230-236
• /
• 2022

Objectives: The primary goal of this article is to compare the multiple algorithms used for deadlock handling methods and then outline the common method in deadlock handling methods. Methods: The article methodology begins with introducing a literature review studying different algorithms used in deadlock detection and many algorithms for deadlocks prevented, recovered, and avoided. Discussion and analysis of the literature review were done to classify and compare the studied algorithms. Findings: The results showed that the deadlock detection method solves the deadlock. As soon as the real-time deadlock detection algorithm is identified and indicated, it performs better than the non-real-time deadlock detection algorithm. Our novelty the statistics that we get from the percentages of reviewing outcomes that show the most effective rate of 47% is in deadlock prevention. Then deadlock detection and recovery with 28% finally, a rate of 25% for deadlock avoidance.

• International Journal of Computer Science & Network Security
• /
• v.22 no.12
• /
• pp.197-204
• /
• 2022

Sorting is an important data structure in many applications in the real world. Several sorting algorithms are currently in use for searching and other operations. Sorting algorithms rearrange the elements of an array or list based on the elements' comparison operators. The comparison operator is used in the accurate data structure to establish the new order of elements. This report analyzes and compares the time complexity and running time theoretically and experimentally of insertion, merge, and heap sort algorithms. Java language is used by the NetBeans tool to implement the code of the algorithms. The results show that when dealing with sorted elements, insertion sort has a faster running time than merge and heap algorithms. When it comes to dealing with a large number of elements, it is better to use the merge sort. For the number of comparisons for each algorithm, the insertion sort has the highest number of comparisons.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.11a
• /
• pp.679-679
• /
• 2022

• International Journal of Computer Science & Network Security
• /
• v.24 no.2
• /
• pp.15-24
• /
• 2024

One of the most significant issues in combinatorial optimization is the classical NP-complete conundrum known as the 0/1 Knapsack Problem. This study delves deeply into the investigation of practical solutions, emphasizing two classic algorithmic paradigms, brute force, and dynamic programming, along with the metaheuristic and nature-inspired family algorithm known as the Genetic Algorithm (GA). The research begins with a thorough analysis of the dynamic programming technique, utilizing its ability to handle overlapping subproblems and an ideal substructure. We evaluate the benefits of dynamic programming in the context of the 0/1 Knapsack Problem by carefully dissecting its nuances in contrast to GA. Simultaneously, the study examines the brute force algorithm, a simple yet comprehensive method compared to Branch & Bound. This strategy entails investigating every potential combination, offering a starting point for comparison with more advanced techniques. The paper explores the computational complexity of the brute force approach, highlighting its limitations and usefulness in resolving the 0/1 Knapsack Problem in contrast to the set above of algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3421-3437
• /
• 2018

With the enlargement of wireless technology, vehicular ad-hoc networks (VANETs) are rising as a hopeful way to realize smart cities and address a lot of vital transportation problems such as road security, convenience, and efficiency. To achieve data confidentiality, integrity and authentication applying lightweight cryptosystems is widely recognized as a rather efficient approach for the VANETs. The Khudra cipher is such a lightweight cryptosystem with a typical Generalized Feistel Network, and supports 80-bit secret key. Up to now, little research of fault analysis has been devoted to attacking Khudra. On the basis of the single nibble-oriented fault model, we propose a differential fault analysis on Khudra. The attack can recover its 80-bit secret key by introducing only 2 faults. The results in this study will provides vital references for the security evaluations of other lightweight ciphers in the VANETs.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.355-357
• /
• 2001

HTTP/1.1 standard reduces latencies and overhead from closing and re-establishing connections by supporting persistent connections as a default, which encourage multiple transfers of objects over one connection. HTTP/1.1, however, does not define explicitly connection-closing time but specifies a certain fixed holding time model. This model may induce wasting server’s resource when server maintains connection with the idle-state client that requests no data for a certain time. This paper proposes the mechanism of a heuristic connection management supported by the client-side under persistent HTTP, in addition to HTTP/1.1’s fixed holding time model on server-side. The client exploits the tag information within transferred HTML page so that decides connection-closing time. As a result, the mechanism allows server to use server’s resource more efficiently without server’s efforts.