Digital Library[ Search Result ]
An Efficient Algorithm for Diversified Top-k Subgraph Querying
http://doi.org/10.5626/JOK.2024.51.2.103
Subgraph matching is a core and important problem in graph analysis. The subgraph matching problem is to find all embeddings of the query graph in the data graph. However, the output results from previously proposed algorithms often overlap with each other, and thus interesting results are often missed. For this purpose, the diversified top-k subgraph querying problem is proposed. The diversified top-k subgraph querying problem is to find k embeddings that have the highest coverage among embeddings of the query graph in the data graph. In this paper, we present an algorithm for the diversified top-k subgraph querying problem and demonstrate that it finds diversified top-k results efficiently compared to existing algorithms.
Effective Fuzzing Technique with Command Line Option Mutation/Selection
Ahcheong Lee, Yunho Kim, Moonzoo Kim
http://doi.org/10.5626/JOK.2022.49.11.981
Command line option determines how Command Line Interface (CLI) program executes. Therefore, selecting and using proper command line options determines the performance and effectiveness of testing in terms of coverage and bug detection power. In this paper, we propose PAW (Program option-AWare fuzzer) which automatically selects useful command line options to improve the effectiveness of fuzz testing. In the first 10% of fuzzing time, PAW generates diverse command line options by mutating existing options, and it decides which options are useful ones using branch coverage. For the remaining 90% of the time, PAW focuses on executing the selected, useful options for effective testing. We implemented PAW on top of AFL++ which is the state-of-the-art fuzzer, and we evaluated PAW on ten real-world C programs by comparing coverage with AFL++ and Angora. PAW showed higher branch coverage results and crash detection power on the ten C programs.
Korean Text Summarization using MASS with Copying and Coverage Mechanism and Length Embedding
Youngjun Jung, Changki Lee, Wooyoung Go, Hanjun Yoon
http://doi.org/10.5626/JOK.2022.49.1.25
Text summarization is a technology that generates a summary including important and essential information from a given document, and an end-to-end abstractive summarization model using a sequence-to-sequence model is mainly studied. Recently, a transfer learning method that performs fine-tuning using a pre-training model based on large-scale monolingual data has been actively studied in the field of natural language processing. In this paper, we applied the copying mechanism method to the MASS model, conducted pre-training for Korean language generation, and then applied it to Korean text summarization. In addition, coverage mechanism and length embedding were additionally applied to improve the summarization model. As a result of the experiment, it was shown that the Korean text summarization model, which applied the copying and coverage mechanism method to the MASS model, showed a higher performance than the existing models, and that the length of the summary could be adjusted through length embedding.
Deep Neural Network Structure Selection Using Coverage Methods
http://doi.org/10.5626/JOK.2021.48.1.82
Recently, there has been an immense increase in the use of neural networks in various fields. Consequently, diverse, studies have been conducted to verify and test deep neural networks. One of the most popular studies aimed to test the coverage method about deep neural networks. This study proposes a novel idea that the test coverage can be used in finding the optimal deep neural network structure for given training data using various test coverage methods. To this end, it calculates test coverages for multiple neural network structures that are trained for predicting temperature with the same dataset and select the most suitable neural network. Specifically, the proposed method successfully finds the optimal deep neural network structure out of a total of thirteen neural network structures consisting of one to three Long-Short Term Memory (LSTM) layers and a fully connected layer with 2 to 20 neurons.
Resolution of Answer-Repetition Problems in a Generative Question-Answering Chat System
http://doi.org/10.5626/JOK.2018.45.9.925
A question-answering (QA) chat system is a chatbot that responds to simple factoid questions by retrieving information from knowledge bases. Recently, many chat systems based on sequence-to-sequence neural networks have been implemented and have shown new possibilities for generative models. However, the generative chat systems have word repetition problems, in that the same words in a response are repeatedly generated. A QA chat system also has similar problems, in that the same answer expressions frequently appear for a given question and are repeatedly generated. To resolve this answer-repetition problem, we propose a new sequence-to-sequence model reflecting a coverage mechanism and an adaptive control of attention (ACA) mechanism in a decoder. In addition, we propose a repetition loss function reflecting the number of unique words in a response. In the experiments, the proposed model performed better than various baseline models on all metrics, such as accuracy, BLEU, ROUGE-1, ROUGE-2, ROUGE-L, and Distinct-1.
Game Theoretic Cache Allocation Scheme in Wireless Networks
Tra Huong Thi Le, Do Hyeon Kim, Choong Seon Hong
http://doi.org/10.5626/JOK.2017.44.8.854
Caching popular videos in the storage of base stations is an efficient method to reduce the transmission latency. This paper proposes an incentive proactive cache mechanism in the wireless network to motivate the content providers (CPs) to participate in the caching procedure. The system consists of one/many Infrastructure Provider (InP) and many CPs. The InP aims to define the price it charges the CPs to maximize its revenue while the CPs compete to determine the number of files they cache at the InP’s base stations (BSs). We conceive this system within the framework of Stackelberg game where InP is considered as the leader and CPs are the followers. By using backward induction, we show closed form of the amount of cache space that each CP renting on each base station and then solve the optimization problem to calculate the price that InP leases each CP. This is different from the existing works in that we consider the non-uniform pricing scheme. The numerical results show that InP’s profit in the proposed scheme is higher than in the uniform pricing.
Transformation Method for a State Machine to Increase Code Coverage
YoungDong Yoon, HyunJae Choi, HeungSeok Chae
Model-based testing is a technique for performing the test by using a model that represents the behavior of the system as a system specification. Industrial domains such as automotive, military/aerospace, medical, railway and nuclear power generation require model-based testing and code coverage-based testing to improve the quality of software. Despite the fact that both model-based testing and code coverage-based testing are required, difficulty in achieving a high coverage using model-based testing caused by the abstraction level difference between the test model and the source code, results in the need for performing model-based testing separately. In this study, to overcome the limitations of the existing model-based testing, we proposed the state machine transformation method to effectively improve the code coverage using the protocol state machine, one of the typical modeling methods is used as the test model in model-based testing, as the test model. In addition, we performed a case study of both systems and analyzed the effectiveness of the proposed method.
A Study on Quality Assurance of Embedded Software Source Codes for Weapon Systems by Improving the Reliability Test Process
Kyeong Yong Kwon, Joon Seok Joo, Tae Sik Kim, Jin Woo Oh, Ji Hyun Baek
In the defense field, weapon systems are increasing in importance, as well as the weight of the weapon system embedded software development as an advanced technology. As the development of a network-centric warfare has become important to secure the reliability and quality of embedded software in modern weapons systems in battlefield situations. Also, embedded software problems are transferred to the production stage in the development phase and the problem gives rise to an enormous loss at the national level. Furthermore, development companies have not systematically constructed a software reliability test. This study suggests that approaches about a quality-verification- system establishment of embedded software, based on a variety of source code reliability test verification case analysis.
Search
Journal of KIISE
- ISSN : 2383-630X(Print)
- ISSN : 2383-6296(Electronic)
- KCI Accredited Journal
Editorial Office
- Tel. +82-2-588-9240
- Fax. +82-2-521-1352
- E-mail. chwoo@kiise.or.kr