• Proceedings of the Korean Society of Computer Information Conference
• /
• 2013.07a
• /
• pp.87-88
• /
• 2013

본 논문에서는 응급 환자가 발생하여 가까운 병원이나 대형 병원에 도착하기 전에 환자의 정보를 이용하여 응급처치가 가능하도록 한다. 그리고 응급 의료 기관에서는 환자 진료 준비를 사전에 갖출 수 있도록 하여 응급 환자 진료의 효율성을 높였다. 우리가 흔히 연락을 쉽게 할 수 있는 119번호를 이용하여 다양한 복합 응급 신고를 접수하고 있고, 유관기관과 통합적 대응 체계를 구축하는 효율적 응급의료서비스 새로운 전략을 제시하고자 한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.26-29
• /
• 1998

This paper proposes a novel method to efficiently develop GUI based control software for a legged mobile robot. Although GUI is convenient it is a very burden to both a computer and its developer. In case of the mobile robot, these problems are more serious. The proposed method solves these problems by separating GUI from control software. An implementation based upon the proposed method demonstrates its effectiveness.

• International Journal of Computer Science & Network Security
• /
• v.22 no.1
• /
• pp.61-68
• /
• 2022

The present study was based on developing an AI based model to facilitate the academic registration needs of blind students. The model was developed to enable blind students to submit academic service requests and tasks with ease. The findings from previous studies formed the basis of the study where functionality gaps from the literary research identified by blind students were utilized when the system was devised. Primary simulation data were composed based on several thousand cases. As such, the current study develops a model based on archival insight. Given that the model is theoretical, it was partially applied to help determine how efficient the associated AI tools are and determine how effective they are in real-world settings by incorporating them into the portal that institutions currently use. In this paper, we argue that voice-activated personal assistant (VAPA), text mining, bag of words, and case-based reasoning (CBR) perform better together, compared with other classifiers for analyzing and classifying the text in academic request submission through the VAPA.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.3
• /
• pp.649-657
• /
• 2013

DTN flooding based routing protocol replicate the message copy to increase the delivery like hood that overloads the network resources. The probabilistic routing protocols reduce replication cost by forwarding the message to a node that holds high predictability value to meet its destination. However, the network traffic converges to high probable nodes and produce congestion that triggers the drop of previously stored messages. In this paper, we have proposed a routing protocol called as Connection frequency Buffer Aware Routing Protocol (CFBARP) that uses an adaptive method to maintain the information about the available buffer space at the receiver before message transmission. Furthermore, a frequency based method has been employed to determine the connection recurrence among nodes. The proposed strategy has performed well in terms of reducing message drop, message relay while increases the delivery probability.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.07a
• /
• pp.397-400
• /
• 2019

급격히 증가하는 자동차 수, 발전량 증가 등으로 인하여 미세먼지로 인한 환경오염이 심각한 사회문제로 대두되고 있는 실정이다. 50개가 넘는 국가들이 권고치 이상의 미세먼지로 인해 피해를 받고 있으며 각 피해국들은 미세먼지 저감 대책 및 발생을 최소화하기 위한 방안을 연구하고 있다. 하지만 현재 고정형 미세먼지 취득 드론으로는 다양한 포인트의 미세먼지 데이터를 수집하기 힘든 상황이며, 기존 드론을 활용한 방법에서 도 회전 날개의 영향으로 인해 정확한 데이터를 수집하기 힘든 실정이다. 본 논문에서는 드론과 특정 구조물을 활용한 미세먼지 수집 방법을 제안하고 이의 효율성을 보여주고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.866-869
• /
• 2015

감시 카메라 환경에서 돈사 내 개별 돼지들의 행동을 자동으로 관리하는 연구는 효율적인 돈사 관리 측면에서 중요한 이슈로 떠오르고 있다. 그러나 돼지들이 근접해 있을 경우 돼지들을 개별적으로 구분하기 어렵기 때문에 근접한 돼지들을 분리하는 방법이 필요하다. 본 논문에서는 시공간 정보를 이용하여 근접한 돼지를 개별적으로 분리하는 방법을 제안한다. 돈사 내 돼지의 행동 영상 중에서 두 마리의 돼지가 근접한 경우, 돼지가 근접하기 전의 정보와 돼지가 근접한 현재의 정보를 사용하여 새로운 프레임을 생성하고 생성된 프레임에서 돼지의 구분이 명확하지 않은 작은 부분은 영역확장 기법을 이용하여 근접한 돼지를 개별적으로 분리한다. 실험결과, 제안방법을 이용하여 근접한 돼지를 개별적으로 분리할 수 있다는 것을 확인하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.651-654
• /
• 2008

상황인지(Context-awareness)란 사용자의 상황을 인지하여 이를 통해 사용자에게 적합한 최적의 정보를 제공하는 것으로 현재 많은 연구가 진행되고 있다. 이미 상황인지를 위한 프레임워크들이 존재하지만, 작은 메모리가 요구되는 제한적인 하드웨어 상황에서 적용하기에 적합하게 설계된 프레임워크는 흔하지 않다. 이에 대한 문제점을 인식하여 하드웨어 리소스가 부족한 상황에서 빠르게 동작할 수 있는 프레임워크를 구상하여, 기존과는 다른 제한적인 환경 안에서 상황인지를 통해 사용자에게 맞는 최적의 서비스를 판단, 제공하는 모바일 오브젝트를 설계하였다.

• International Journal of Computer Science & Network Security
• /
• v.24 no.8
• /
• pp.125-134
• /
• 2024

With the great development of technology in all fields these days, including the financial field, people have gone into cryptocurrency trading, without prior knowledge or experience, which made them prey and coveted by hackers through phishing attacks. Therefore, we will study cases where people can be a victim of phishing because cryptocurrency occurs without an intermediary, such as banks and monetary institutions. It is a form of peer-to-peer transaction, physical wallets, and fake investing. This study aims to know the concept of a phishing attack on cryptocurrencies, and to measure the extent of peoples awareness of the security risks on these currencies. Previous literature will be reviewed, and a questionnaire will be published on traders who use cryptocurrency trading platforms, and then we collect data and analyze the answers provided, so that we can suggest educational solutions to these phishing problems.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.4
• /
• pp.139-145
• /
• 2018

In this paper, we propose the methodology and system to show weather information to spatial system. When using the spatial information system, it is easy and convenient to show information such as target location, mission contents, enemy threats and so on. However, drawing 1-dimensional weather information on 3-dimensional space in spatial information system is hard task. To fuse data, we need to add a spatial layer including weather information to spatial layers and perform space modeling for showing weather information as spatial data in a virtual space. The virtual space is shown by receiving meteorological data and then changing in real time through weather database linkage.