• Journal of the Korea Society of Computer and Information
• /
• v.3 no.2
• /
• pp.69-76
• /
• 1998

To test all internal faults in the case that the number of Primary Input is N, we need patterns that are composed of PI's of maximum 2N. In this paper, we proposed the method to reduce a search space by dividing the multiple output circuit into subcircuit that is related with output. And this method, called PBM(Partition-Based Method), can generate a set of test pattern. The method can effectively generate a test pattern for evaluating all fault of circuit, because the length of input pattern is smaller than that of full circuit and PBM doesn't search any signal line that is not concerned with detecting fault.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.1
• /
• pp.1-7
• /
• 2014

This paper proposes an efficient test wrapper design that reduces overall test time in multi-core SoC. After initial local wrapper solution sets for all the cores are determined using well-known Combine algorithm, proposed algorithm selects a dominant core which consumes the longest test time in multi-core SoC. Then, the wrapper characteristics in the number of TAM wires and the test time for other cores are adjusted based on test time of the dominant core. For some specific cores, the number of TAM wires can be reduced by increasing its test time for design space exploration purposes. These modified wrapper characteristics are added to the previous wrapper solution set. By expanding previous local wrapper solution set to global wrapper solution set, overall test time for Multi-core SoC can be reduced by an efficient test scheduler. Effectiveness of the proposed wrapper is verified on ITC'02 benchmark circuits using $B^*$-tree based test scheduler. Our experimental results show that the test time is reduced by an average of 4.7% when compared to that of employing previous wrappers.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.1
• /
• pp.68-75
• /
• 2009

As the recent performance of microprocessor is improving quickly, the necessity of cache is growing because of the increase of the access time of main memory. Every block of direct-mapped cache maps to one cache line. Although the mapping rule is simple, if different blocks map to one cache line, the miss ratio will be higher than the set-associative cache due to conflicts. In this paper, for the improvement of the direct-mapped cache of OpenRISC, 4-way set-associative cache is proposed. Four blocks of the main memory of the proposed cache map to one cache line so that the miss ratio is less than the direct-mapped cache. Pseudo-LRU Policy, which is one of the Line Replacement Policies, is used for decreasing the number of bits that store LRU value. The OpenRISC core including the 4-way set-associative cache was verified with FPGA emulation. As the result of performance measurement using test program, the performance of the OpenRISC core including the 4-way set-associative cache is higher than the previous one by 50% and the decrease of miss ratio is more than 15%.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.10
• /
• pp.13-21
• /
• 2014

The set covering problem (SCP) is one of representative combinatorial optimization problems, which is defined as the problem of covering the m-rows by a subset of the n-columns at minimal cost. This paper proposes a method utilizing Integer Programming-based Local Search (IPbLS) to solve the set covering problem. IPbLS is a kind of local search technique in which the current solution is improved by searching neighborhood solutions. Integer programming is used to generate neighborhood solution in IPbLS. The effectiveness of the proposed algorithm has been tested on OR-Library test instances. The experimental results showed that IPbLS could search for the best known solutions in all the test instances. Especially, I confirmed that IPbLS could search for better solutions than the best known solutions in four test instances.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.1
• /
• pp.37-47
• /
• 2011

Stock price index option market has various investment strategies that have been developed. Specially, arbitrage strategies are very important to be efficient in option market. The purpose of this study is to improve profit using rough set and Box spread by using past option trading data. Option trading data was based on an actual stock exchange market tick data ranging from 2001 to 2006. Validation process was carried out by transferring the tick data into one-minute intervals. Box spread arbitrage strategies is low risk but low profit. It can be accomplished by back-testing of the existing strategy of the past data and by using rough set, which limit the time line of dealing. This study can make more stable profits with lower risk if control the strategy that can produces a higher profit module compared to that of the same level of risk.

• The Journal of the Korea Contents Association
• /
• v.17 no.1
• /
• pp.39-49
• /
• 2017

As the Internet technology advances, data on the web is increasing sharply. Many research study about incremental learning for classifying effectively in data increasing. Web document contains the time-series data such as published date. If we reflect time-series data to classification, it will be an effective classification. In this study, we analyze the time-series variation of the words. We propose an efficient classification through dividing the dataset based on the analysis of time-series information. For experiment, we corrected 1 million online news articles including time-series information. We divide the dataset and classify the dataset using SVM and $Na{\ddot{i}}ve$ Bayes. In each model, we show that classification performance is increasing. Through this study, we showed that reflecting time-series information can improve the classification performance.

• Journal of Korean Library and Information Science Society
• /
• v.47 no.4
• /
• pp.289-307
• /
• 2016

This paper introduces a software system and process model for constructing domain-specific relation extraction datasets semi-automatically. The system uses a set of terms such as genes, proteins diseases and so forth as inputs and then by exploiting massive biological interaction database, generates a set of term pairs which are utilized as queries for retrieving sentences containing the pairs from scientific databases. To assess the usefulness of the proposed system, this paper applies it into constructing a genic interaction dataset related to Alzheimer's disease domain, which extracts 3,510 interaction-related sentences by using 140 gene names in the area. In conclusion, the resulting outputs of the case study performed in this paper indicate the fact that the system and process could highly boost the efficiency of the dataset construction in various subfields of biomedical research.

• Korean Journal of Social Welfare
• /
• v.62 no.3
• /
• pp.141-162
• /
• 2010

This paper tries to provide empirical support for a formal model of social policy development which has been presented in a former paper of this study. In the direct democracy, median voter's social policy preference is critical because he is Condorcet winner in a pair-wise pure majority voting. But, in the more general setting, we should think of various political institutions as a collective choice device. For this reason, I draw a formal model which formulates three contrasting types of political institutions which are distinguished by the developments of political democracy and the differences of electoral rules. Comparative patterns of key variables which measure political institutions, social policy developments, and social policy preference provide support for my arguments. My empirical results suggest that three political institutions are associated with very different policy outcomes. Compared to other institutions, committee system entails more targeted subsidy, less universal benefit. On the contrary, proportional elections produce more universal benefit, less targeted subsidy.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.183-191
• /
• 2011

This paper suggests emergency medical service vehicle (ambulance) algorithm when the emergency patient occurs in order to be sufficient the maximum permission time T of arrival about all sectors in one city that is divided in the various areas. This problem cannot be solved in polynomial times. One can obtains the solution using the integer programming. In this paper we suggest vertex set (or dominating set) algorithm and easily decide the location of ambulances. The core of the algorithm decides the location of ambulance is to the maximum degree vertex among the neighborhood of minimum degree vertex. For the 33 sectors Ostin city in Texas, we apply $3{\leq}T{\leq}20$ minutes. The traditional set cover algorithm with integer programming cannot obtains the solution in several T in 18 cases. But, this algorithm obtains solution for all of the 18 cases.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1996.05c
• /
• pp.535-540
• /
• 1996

원자로에서 연소되고 나온 사용후핵연료는 영구 처분하기 이전에 대부분 수조(pool)속에 임시로 저장되어 관리되고 있다. 이와 같이 관리되고 있는 사용후핵연료속에 핵폭발 장치로 전용될수 있는 매우 민감한 핵물질인 플루토늄이 다량 포함되어 있기 때문에, 원자력의 평화적 이용·개발을 위한 핵활동의 투명성을 확보하기 위해서는 국가사찰 수행시 현장 적용 가능한 사용후핵연료 검증 기술과 장비를 확보하는 것이 필요하다. 이를 위해 사용후핵연료봉 및 사용후핵연료 집합체 검증을 휘한 고분해능 감마선 분광분석 시스템을 개발하여 현장 테스트를 수행한다. 이를 바탕으로 강화되는 핵비확산 체제와 통제관련 기술의 발전에 대비하고 우리 나라의 국가계량관리체제(SSAC) 확립에 필요한 자체적인 사찰 기술을 개발하여 국가사찰에 적용하는 것이 비파괴측정기술 개발 목적이다.