• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.05a
• /
• pp.595-598
• /
• 2020

IoU (Intersection over Union) is the most commonly used index in target detection. The core requirement of target detection is what is in the image and where. Based on these two problems, classification training and positional regression training are needed. However, in the process of position regression, the most commonly used method is to obtain the IoU of the predicted bounding box and ground-truth bounding box. Calculating bounding box regression losses should take into account three important geometric measures, namely the overlap area, the distance, and the aspect ratio. Although GIoU (Generalized Intersection over Union) improves the calculation function of image overlap degree, it still can't represent the distance and aspect ratio of the graph well. As a result of technological progress, Bounding-Box is no longer represented by coordinates x,y,w and h of four positions. Therefore, the IoU can be further optimized with the center point and aspect ratio of Bounding-Box.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.213-216
• /
• 2021

기술이 발전함에 따라 악성코드 또한 함께 발전하여 보안 위협이 증가되고 있다. 특히 PowerShell 과 같은 스크립트 언어를 사용하여 포렌식이 어려운 Fileless 악성코드가 지속적으로 증가하고 있다. 이에 본 논문에서 PowerShell 데이터셋을 활용하여 기존 패턴은 탐지할 수 없는 한계점을 가진 시그니처 또는 휴리스틱 기반 탐지 기법을 보완하여 기존의 악성코드들을 학습 및 새로운 악성코드를 추측하는 것이 가능한 심층 학습 기술, Graph Convolutional Networks 과 자카드 유사도를 활용하여 기존의 방식에 비해 더 효율적으로 탐지를 이루어 내는지를 판단해보려한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2024.05a
• /
• pp.869-870
• /
• 2024

다양한 형태의 다수 에이전트가 서비스하는 환경에서 사용자가 요청하는 서비스 명령은 단순할수록 사용성이 좋다. 하나의 서비스는 다양한 로봇이 유기적으로 수행해야 하며, 사용자가 서비스 명령에 대해 요구사항을 추가하면 이를 다수 로봇이 적절하게 처리하는 방법이 필요하다. 본 논문에서는 사용자가 요청한 서비스에 대해 로봇의 동작은 노드로, 동작 간의 관계는 에지로 표현하고 이를 통해 스케줄링 하는 방법론을 제공한다. 실험 결과, 다수 로봇 환경에서 사용자의 요구사항을 동적으로 대응하며 효율적으로 서비스가 수행됨을 확인하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.152-155
• /
• 2018

Over the past years, Link Flooding Attacks (LFAs) have been introduced as new network threats. LFAs are indirect DDoS attacks that selectively flood intermediate core links, while legacy DDoS attacks directly targets end points. Flooding bandwidth in the core links results in that a wide target area is affected by the attack. In the traditional network, mitigating LFAs is a challenge since an attacker can easily construct a link map that contains entire network topology via traceroute. Security researchers have proposed many solutions, however, they focused on reactive countermeasures that respond to LFAs when attacks occurred. We argue that this reactive approach is limited in that core links are already exposed to an attacker. In this paper, we present SDHoneyNet that prelocates vulnerable links by computing static and dynamic property on Software-defined Networks (SDN). SDHoneyNet deploys Honey Topology, which is obfuscated topology, on the nearby links. Using this approach, core links can be hidden from attacker's sight, which leads to effectively building proactive method for mitigating LFAs.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.495-504
• /
• 2008

Aspect Oriented Programming(AOP) is a relatively new programming paradigm and has properties that other programming paradigms don't have. This new programming paradigm provides new modularization of software systems by cross-cutting concerns. In this paper, we propose a regression test method for program evolution by AOP. By using JoinPoint, we can catch a pointcut-name which makes it possible to test the incorrect pointcut strength fault and the incorrect aspect precedence fault. Through extending proof rules to aspect, we can recognize failures to establish expected postconditions faults. We can also trace variables using set() and get() pointcut and test failures to preserve state invariant fault. Using control flow graph, we can test incorrect changes in control dependencies faults. In order to show the correctness of our proposed method, channel management system is implemented and tested by using proposed methods.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2384-2392
• /
• 1999

Software engineers are used to analyse the error behavior of computer programs using test cases which are collected for the testing phase when software errors are detected. In actual software testing and debugging, it is important to adopt dynamic slicing technique which is concerned on all the statements to be affected by the variables of current inputs and to use technique of its implementations. The traditional dynamic slicing has focused on the single slicing criterion algorithm. It has been thought that it is needed to develope and implement algorithm for used multiple criteria variables program slicing, which finds every slicing criterion variable where it is used multiple criteria variables. In this paper, we propose an efficient algorithm to make dynamic program slices when it has used multiple criteria variables. The results of the implementation are presented by the making table on execution history and the dynamic dependence graph. Also we can find that the proposed dynamic program slicing approach using multiple criteria variables is more efficient than the traditional single case algorithm on the practical testing environment.

• Journal of KIISE:Software and Applications
• /
• v.33 no.7
• /
• pp.615-623
• /
• 2006

A non-functional requirement is a property or quality that the proposed systems have to support the functional requirements. A non-functional requirement is reflected by quality attribute These non-functional requirements playa crucial role during system development, serving as selection criteria for choosing among decisions. It should be continuously considered through the software development process. In spite of the importance of the non-functional requirements, it received little attention because of ambiguousness and invisibility of non-functional requirements. Therefore non-functional model which is a process to analyze the non-functional requirement is proposed for improving the management efficiency of non-functional requirements. Also, this paper presents the trace among the UML diagrams to the conceptual model. According to the non-functional requirement development process, this paper achieved performance-based case study. After then, non-functional requirement should be traced using the UML diagrams.

• Journal of Software Assessment and Valuation
• /
• v.17 no.1
• /
• pp.51-58
• /
• 2021

Microservices are not only developed independently, but can also be run and deployed independently, ensuring more flexible scaling and efficient collaboration in a cloud computing environment. This impact has led to a surge in migrating to microservices-oriented application environments in recent years. In order to introduce microservices, the problem of identifying microservice units in a single application built with a single architecture must first be solved. In this paper, we propose an algorithm-based approach to identify microservices from legacy systems. A graph is generated using the meta-information of the legacy code, and a microservice candidate is extracted by applying a clustering algorithm. Modularization quality is evaluated using metrics for the extracted microservice candidates. In addition, in order to validate the proposed method, candidate services are derived using codes of open software that are widely used for benchmarking, and the level of modularity is evaluated using metrics. It can be identified as a smaller unit of microservice, and as a result, the module quality has improved.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.551-562
• /
• 2000

Content-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. GContent-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. Generally, the query image produced by a user is different from the intended target image. To overcome this problem, many image retrieval systems use the spatial relationships of the objects, instead of pixel coordinates of the objects. In this paper, a query-converting algorithm for an image retrieval system, which uses the spatial relationship of every two objects as an image feature, is proposed. The proposed algorithm converts the query image into a graph that has the minimum number of edges, by eliminating every transitive edge. Since each edge in the graph represents the spatial relationship of two objects, the elimination of unnecessary edges makes the retrieval process more efficient. Experimental results show that the proposed algorithm leads the smaller number of comparison in searching process as compared with other algorithms that do not guarantee the minimum number of edges.

• Journal of Internet Computing and Services
• /
• v.17 no.4
• /
• pp.51-60
• /
• 2016

Embedded software has requirements such as real-time and environment independency. The real-time requirement is affected from worst-case execution time of loaded tasks. Therefore, to guarantee real-time requirement, we need to determine a program's worst-case execution time using static analysis approach. However, the existing methods for worst-case execution time analysis do not consider the environment independency. Thus, in this paper, in order to provide environment independency, we propose a method for measuring task's execution time from the source codes. The proposed method measures the execution time through the control flow graph created from the source codes instead of the executable codes. However, the control flow graph created from the source code does not have information about execution time. Therefore, in order to provide this information, the proposed method identifies the relationships between statements in the source code and instructions in the executable code. By parameterizing those parts that are dependent on processors based on the relationships, it is possible to enhance the flexibility of the tool that measures the worst-case execution time.