• International Journal of Computer Science & Network Security
• /
• 제22권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.

• 컴퓨터교육학회논문지
• /
• 제17권4호
• /
• pp.33-44
• /
• 2014

국가 차원에서 교육과정을 이해하는 것은 해당 교과가 어느 정도의 위상을 갖고 있는지를 확인하는 것이다. 본 연구는 창의 인재 양성의 선두주자인 이스라엘의 교육과정과, 컴퓨터과학 교육의 현황을 분석하고, 우리나라 컴퓨터과학 교육의 방향에 대한 성찰을 제시하기 위한 목적이 있다. 이스라엘의 컴퓨터과학 교육은 중학교에서는 자연과학/기술 교과에 통합된 형태로, 고등학교에서는 독립교과로서 위상을 유지하고 있다. 2011년에는 중학교 컴퓨터과학 교육과정이 개발되면서 통합에서 독립교과로 변화하고 있었다. 따라서 본 연구는 우리나라의 컴퓨터과학 교육 또한 통합과 독립의 관점에서 교과의 위상이 논의되어야 함을 제시하였다.

• 정보교육학회논문지
• /
• 제23권6호
• /
• pp.655-663
• /
• 2019

소프트웨어 교육에 대한 관심이 늘어감에 따라 컴퓨터과학에 대한 관심도 높아지고 있다. 컴퓨터과학은 컴퓨터와 컴퓨터시스템의 이론과 원리를 학습하는 학문으로서 이러한 컴퓨터과학의 지식과 개념은 소프트웨어 교육의 근본이라고 할 수 있다. 최근에 컴퓨터를 사용하지 않고 컴퓨터 과학의 핵심 내용을 전달하는 방법으로 컴퓨터과학 언플러그드라는 학습 방법이 전 세계적으로 수업에 많이 활용되고 있다. CS 언플러그드는 다양한 놀이 활동을 중심으로 컴퓨터과학의 원리를 배우도록 하는 학습 방법이다. 그러나 문제는 이러한 CS 언플러그드 활동이 실제 컴퓨터과학에서 배우는 핵심교과와 얼마나 연관성이 있는지에 대한 분석 없이 단순한 놀이 수업으로만 이루어지는 것이다. 따라서 본 연구에서는 컴퓨터과학의 핵심 내용과 CS 언플러그드의 다양한 활동에 들어 있는 컴퓨터과학 핵심 내용을 분석하여 비교 연구를 하고자 한다.

• International Journal of Computer Science & Network Security
• /
• 제21권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
• /
• 제22권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
• /
• 제22권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.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2022년도 추계학술발표대회
• /
• pp.679-679
• /
• 2022

• International Journal of Computer Science & Network Security
• /
• 제24권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)
• /
• 제12권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.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2001년도 봄 학술발표논문집 Vol.28 No.1 (A)
• /
• 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.