• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.2
• /
• pp.82-90
• /
• 2002

BDD have become widely used for various CAD applications because Boolean functions can be represented uniquely and compactly by using BDD. The size of the BDD representation for a function is very sensitive to the choice of orderings on the input variable. Therefore, it is very important to find a good variable ordering which minimize the size of the BDD. Since finding an optimal ordering is NP-complete, several heuristic algorithms have been proposed to find good variable orderings. In this paper, we propose a variable ordering algorithm, Faster-${\mu}$0, based on the ${\mu}$0(microcanonical optimization). In the Faster-${\mu}$0 algorithm, the initialization phase is replaced with a shifting phase to produce better solutions in a fast local search. We find values for algorithm parameters experimentally and the proposed algorithm has been experimented on well known benchmark circuits and shows superior performance compared to various existing algorithms.

• Spatial Information Research
• /
• v.11 no.3
• /
• pp.261-274
• /
• 2003

The effective probability-based tile pre-fetching algorithm and the collaborative cache replacement algorithm are able to reduce the response time for user's requests by transferring tiles which will be used in advance and determining tiles which should be removed from the restrictive cache space of a client based on the future access probabilities in Web GISs(Geographical Information Systems). The Web GISs have multi-level abstracted data for the quick response time when zoom-in and zoom-out queries are requested. But, the previous pre-fetching algorithm is applied on only two-dimensional pre-fetching space, and doesn't consider expanded pre-fetching space for multi-level abstracted data in Web GISs. In this thesis, a probability-based pre-fetching algorithm for multi-level abstracted in Web GISs was proposed. This algorithm expanded the previous two-dimensional pre-fetching space into three-dimensional one for pre-fetching tiles of the upper levels or lower levels. Moreover, we evaluated the effect of the proposed pre-fetching algorithm by using a simulation method. Through the experimental results, the response time for user requests was improved 1.8%∼21.6% on the average. Consequently, in Web GISs with multi-level abstracted data, the proposed pre-fetching algorithm and the collaborative cache replacement algorithm can reduce the response time for user requests substantially.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.509-516
• /
• 2009

The Stream Control Transmission Protocol(SCTP) is a reliable transport layer protocol that provides several features. Multihoming is the one of the features and allows an association(SCTP's term for a connection) between two endpoints to use multiple paths. One of the paths, called a primary path, is used for initial data transmission and in the case of retransmission an alternate path is used. SCTP's current retransmission policy attempts to improve the chance of success by sending all retransmissions to an alternate destination address. However, SCTP's current retransmission policy has been shown to actually degrade performance in many circumstances. It is because that, due to Karn's algorithm, successful retransmissions on the alternate path cannot be used to update RTT(Round-Trip Time) estimation for the alternate path. In this paper we propose a scheme to avoid such performance degradation. We utilize 2bits which is not used in the flag field of DATA and SACK chunks to disambiguate original transmissions from retransmissions and to keep RTT and RTO(Retransmission Time-Out) values more accurate.

• Smart Media Journal
• /
• v.4 no.2
• /
• pp.26-33
• /
• 2015

In this paper, we propose an efficient automatic pedestrian removal system from a frame in a video sequence. It firstly finds pedestrians from the frame using a Histogram of Oriented Gradient(HOG) / Linear-Support Vector Machine(L-SVM) classifier, searches for proper background patches, and then the patches are used to replace the deleted pedestrians. Background patches are retrieved from the reference video sequence and a modified feather blender algorithm is applied to make boundaries of replaced blocks look naturally. The proposed system, is designed to automatically detect object and generate natural-looking patches, while most existing systems provide search operation in manual. In the experiment, the average PSNR of the replaced blocks is 19.246

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.23-29
• /
• 2012

Injured peoples usually care their body at medical institutions. But if they need some more rehabilitation to the affected area thus exist. These medical institutions according to the scale there are significant differences in rehabilitation programs, most of the small-scale rehabilitation program for medical doctors and patients to be progression of the conversation is an issue. In this paper, in a small medical facility rehabilitation to assist in the accuracy and reliability, physical contact and force sensors that can measure a combination of substitution and the tactile sensor and tactile sensor alternative with a similar function is proposed. Perceptron neural networks by applying the contact evaluation according to the algorithm to determine the pattern is applied.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.13 no.2 s.29
• /
• pp.169-172
• /
• 2007

This paper presents circuit models and control algorithms of distributed generation system(DGS) which consists of Z-type converter and PWM inverter. Z-type converter which employs both the L and C passive components and shoot-through zero vectors instead qf the conventional DC/DC converter in order to step up DC-link voltage. Discrete time sliding mode control with the asymptotic observer is used for current control. This system am be used for power conversion of DC renewable energy.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.163-163
• /
• 2021

하천에서의 화학사고는 자연적 및 인위적인 원인으로 인해 발생할 수 있으며, 이러한 화학사고가 발생하게 되면 수환경 변화를 야기해 생태계나 인간에게 악영향을 발생시킬 수 있어 신속한 초기대응이 필요하다. 하천으로 유입된 화학물질의 평가에 대한 연구는 활발하게 진행되고 있지만, 화학사고 초기대응을 위한 연구는 미비한 실정이다. 초기대응을 위해서는 현장에서 측정이 용이한 지표를 활용해야하며, 이 지표를 이용해 유출된 화학물질에 대한 정보를 취득 할 수 있어야 한다. 하천의 주요 지점에는 pH 및 EC 등을 실시간으로 측정하는 자동측정망을 운영하고 있는데, 이러한 측정항목들을 지표로 활용한다면 하천 화학사고 대응을 위한 중요한 기초자료로 활용될 수 있을 것이다. 또한 측정된 데이터를 머신러닝 기법을 적용한다면 화학사고 발생 시 초기대응을 위한 기초자료로 활용될 수 있을 것이다. 본 연구에서는 분석한 유해화학물질은 총 26종이며, pH 및 EC를 화학물질들의 특성을 파악하기 위한 대체지표로 선정하였다. 화학물질의 농도변화에 따른 대체지표 변화를 측정하였으며, 실험결과를 바탕으로 성질이 유사한 화학물질들을 Group별로 분류하여 데이터베이스를 구축하였다. 구축된 데이터베이스를 바탕으로 머신러닝 기법인 Decision Tree, Random Forest, Gradient Boosting, XG Boosting에 적용해 각 알고리즘에 대한 성능 평가를 진행하여 가장 우수한 성능의 머신러닝 기법을 선정한다. 본 연구 결과를 바탕으로 선정된 머신러닝 기법을 활용한다면 향수 수환경 화학사고 발생 시 유출된 유해화학물질에 대한 정보를 제공할 수 있으며 그에 따른 신속한 대응의 기초자료로 활용될 수 있을 것으로 판단된다.

• Journal of The Korean Association of Information Education
• /
• v.22 no.2
• /
• pp.223-230
• /
• 2018

Software education will be implemented in elementary, middle and high schools from the 2018 school year. One of the core contents of software education is algorithm education. As with other subjects, algorithmic education can also be seen as the success of students' initiative. And students' initiative learning can lead to increasing students' interest and commitment. In this paper, I propose the concept of software battle by applying sports games to algorithm education. The software battle defined that the programmed objects play to solve a given problem without human intervention in the virtual world. This can be applied to various topics. In this paper, I tried to apply it to sorting numbers which is a representative subject of algorithm education. The results of applying the algorithm education to the software battles showed a positive response, although the students felt the unfamiliar side. This indicates that the software battle can be used as one of the various education methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.141-151
• /
• 2012

This paper suggests more simple algorithm than Hungarian algorithm for assignment problem. Hungarian algorithm selects minimum cost of row and column, and subtracts minimum cost from each cost. Then, performs until the number of minimum lines with 0 equals the number of rows. But, the proposed algorithm selects the minimum cost for each rows only. From the start point with over 2 to the target point with null selects in column, fixes the maximum opportunity cost that the difference of the cost of starting point and target point, and moves the cost less than opportunity cost th more than previous cost. For the 25 balance and 7 unbalance assignment problems, This algorithm gets the optimal solution same as Hungarian algorithm. This algorithm improves the time complexity $O(n^3)$ of Hungarian algorithm to $O(n^2)$, and do not performs the transformation process from unbalance to balance assignment in Hungarian algorithm. Therefore, this algorithm can be alter Hungarian algorithm in assignment problem.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.5
• /
• pp.489-495
• /
• 2014

A micro-genetic algorithm (MGA) is one of the improved forms of a genetic algorithm. It is used to reduce the number of iterations and the computing resources required by using small populations. The efficiency of MGAs has been proved through many problems, especially problems with 3-5 design variables. This study proposes an optimization algorithm based on the sequential design of experiments (SDOE) and an MGA. In a previous study, the authors used the SDOE technique to reduce trial-and-error in the conventional approximate optimization method by using the statistical design of experiments (DOE) and response surface method (RSM) systematically. The proposed algorithm has been applied to various mathematical examples and a structural problem.