• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.20 no.7
• /
• pp.81-91
• /
• 2006

Recently, G.A studies have studied and demonstrated that artificial intelligence like G.A networks, G.A PI controller. The design techniques of PI controller using G.A with the newly proposed teaming algorithm was presented, and the designed controller with AC servo motor system. The goal of this paper is to design the AC servo motor using genetic algorithm and to control drive robot. And in this paper, we propose a genetic algorithms approach to find an optimal or near optimal input variables for genetic algorithm PI controller. Our experimental results show that this approach increases overall classification accuracy rate significantly. Finally, we executed for the implementation of high performance speed control system. It is used a 16-bit DSP, IMS320LF2407, which is capable of the high speed and floating point calculation.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.7 no.4
• /
• pp.1-14
• /
• 2004

In this study, we propose Linktable based on extended TB-Tree(LTB-Tree) which can improve the performance of existing TB (Trajectory-Bundle)-tree proposed for indexing the trajectory of moving objects in GIS Applications. In addition, in order to evaluate proposed indexing scheme, we take into account as follows. At first, we select existing R*-tree, TB-tree, and LTB-tree as the subject of performance evaluation. Secondly, we make use of random data set and real data set as experimental data. Thirdly, we evaluate the performance with respect to the variation of size of memory buffer by considering the restriction of available memory of a given system. Fourth, we test them by using the experimental data set with a variation of data distribution. Finally, we think over insertion and retrieval performance of trajectory query and range query as experimental measures. The experimental results show that the proposed indexing scheme, LTB-tree, gains better performance than traditional other schemes with respect to the insertion and retrieval of trajectory query.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.11
• /
• pp.7273-7284
• /
• 2015

The purpose of this study was to investigate the effect size of non-pharmacological intervention applied to patients with anxiety disorder and to provide information about evidence-based intervention. Twenty three studies were selected for meta-analysis through a systematic review of domestic studies. We searched journal articles published in Korea up to May, 2015 using the key words "Anxiety Disorders (MeSH)" and "Treatment or Intervention". Meta-analysis was performed using a random effects model, and the effect sizes on each of anxiety and depression were calculated. The effect size for anxiety of non-pharmacological intervention in this study was Hedges' g=1.693 (95% CI; 1.267-2.120), indicating a large effect size. The effect size for depression was Hedges's g=1.571 (95% CI; 0.481-2.661), indicating a large effect size. It is significant that this study systematically synthesized the study results for non-pharmacological intervention effects applied to patients with anxiety disorders in Korea. It also established a basis that can be applied to nursing intervention.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.712-720
• /
• 1994

In digital mobile communication systems, the convolutional coding is considered as the optimum error correcting scheme. Recently, the Viterbi algorithm is widely used for the decoding of convolutional code. Most Viterbi decoder has been proposed in conde rate R=1/2 or 2/3 with memory components (m) less than 3. which degrades the error correcting capability because of small code constraints (K). We consider the design method for typical code rate R=1/2, K=7(171,133) convolutional code with memory components, m=6. In this paper, a novel construction method is presented which combines maximum likelihood decoding with a state transition double detection and comparison method. And the designed circuit has the error-correcting capability of random 2 bit error. As the results of logic simulation, it is shown that the proposed Viterbi decoder exactly corrects 1 bit and 2 bit error signal.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.7
• /
• pp.1621-1630
• /
• 2009

There is a lot of recent research to provide services of dynamic distributed contents in P2P-based distributed environment. Distributed services of contents objects, however, have problems in QoS and dynamic management of segments. This paper proposed a new segment management method for the service of P2P-based distributed contents. The proposed method manages groups by the SGM(Segment Group Manager). The SGM manages streaming efficiently by the grouping of segments to be served in P2P environment. The segments in the same group cooperate for improved QoS using the management structure based on the distance and relationship. The distance-based management structure is for the improvement of retrieval efficiency while the relationship-based management structure is for the improvement of service ratio. The simulation results of the proposed method showed improvements in average transmission efficiency and average service rate. The improvement is 8% - 30% in average transmission efficiency and 10% - 30% in average service rate.

• The KIPS Transactions:PartB
• /
• v.14B no.6
• /
• pp.461-472
• /
• 2007

The emphasis in genome projects has Been moving towards the sequence analysis in order to extract biological "meaning"(e.g., evolutionary history of particular molecules or their functions) from the sequence. Especially. palindromic or direct repeats that appear in a sequence have a biophysical meaning and the problem is to recognize interesting patterns and configurations of words(strings of characters) over complementary alphabets. In this paper, we propose an algorithm to identify variable length palindromic pairs(longer than a threshold), where we can allow gaps(distance between words). The algorithm is called palindrome algorithm(PA) and has O(N) time complexity. A palindromic pair consists of a hairpin structure. By composing collected palindromic pairs we build n-pair palindromic patterns. In addition, we dot some of the longest pairs in a circle to represent the structure of a DNA sequence. We run the algorithm over several selected genomes and the results of E.coli K12 are presented. There existed very long palindromic pair patterns in the genomes, which hardly occur in a random sequence.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.5
• /
• pp.1-11
• /
• 2022

With the development of deep learning technology, various research and development are underway to estimate preference rankings through learning, and it is used in various fields such as web search, gene classification, recommendation system, and image search. Approximation algorithms are used to estimate deep learning-based preference ranking, which builds more than k comparison sets on all comparison targets to ensure proper accuracy, and how to build comparison sets affects learning. In this paper, we propose a k-disjoint comparison set generation algorithm and a k-chain comparison set generation algorithm, a novel algorithm for generating paired comparison sets for crowd-sourcing-based deep learning affinity measurements. In particular, the experiment confirmed that the k-chaining algorithm, like the conventional circular generation algorithm, also has a random nature that can support stable preference evaluation while ensuring connectivity between data.

• Journal of the Korean Society for information Management
• /
• v.25 no.4
• /
• pp.131-148
• /
• 2008

The purposes of the study are to design a key-frame extraction algorithm for constructing the virtual storyboard surrogates and to evaluate the efficiency of the proposed algorithm. To do this, first, the theoretical framework was built by conducting two tasks. One is to investigate the previous studies on relevance and image recognition and classification. Second is to conduct an experiment in order to identify their frames recognition pattern of 20 participants. As a result, the key-frame extraction algorithm was constructed. Then the efficiency of proposed algorithm(hybrid method) was evaluated by conducting an experiment using 42 participants. In the experiment, the proposed algorithm was compared to the random method where key-frames were extracted simply at an interval of few seconds(or minutes) in terms of accuracy in summarizing or indexing a video. Finally, ways to utilize the proposed algorithm in digital libraries and Internet environment were suggested.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.8
• /
• pp.601-605
• /
• 2009

Recently, photo sharing and publishing based Social Network Sites(SNSs) are increasingly attracting the attention of academic and industry researches. Millions of users have integrated these sites into their daily practices to communicate with online people. In this paper, we propose an efficient face annotation and retrieval system under SNS. Since the system needs to deal with a huge database which consists of an increasing users and images, both effectiveness and efficiency are required, In order to deal with this problem, we propose a face annotation classifier which adopts an online learning and social decomposition approach. The proposed method is shown to have comparable accuracy and better efficiency than that of the widely used Support Vector Machine. Consequently, the proposed framework can reduce the user's tedious efforts to annotate face images and provides a fast response to millions of users.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2024.01a
• /
• pp.277-278
• /
• 2024

일반적으로 한국인은 식사를 위해 음식 메뉴를 고를 때 쉽게 결정하지 못하는 비율이 50% 이상으로 높다고 알려져 있다. 이러한 단순 고민 해결을 위해 다양한 음식이나 맛집을 추천해 주는 모바일 앱이나 서비스가 존재한다. 그러나 이들은 사용자가 평소 많이 검색했던 음식이나 맛집들을 위주로 찾아주거나, 랜덤으로 지정된 카테고리 내의 음식들 중 하나를 추천해주는 방식, 혹은 사용자 리뷰 점수가 높은 음식점을 우선적으로 추천해 주는 방식 등을 사용하고 있다. 따라서 기존의 추천 방식은 음식을 추천에 있어 사용자의 의도나 실질적인 연관성이 매우 낮고 평소 먹던 음식의 종류를 크게 벗어나지 않는 경우가 많아 음식 추천이라는 본래의 취지와는 멀어진다. 본 논문에서는 음식 메뉴를 선정하는데 있어 실질적인 영향을 주는 환경 요소인 계절, 기후 등의 날씨 정보를 기반으로 생성형 AI를 통해 적절한 음식을 추천하고 해당 음식을 판매하는 음식점과 그 위치를 알려주는 앱을 개발한다. 개발하는 앱은 바쁜 직장인들이나 매 끼니를 고민하는 학생 등의 메뉴 고민을 해결하는데 도움을 줄 수 있으며, 각종 배달 서비스 앱의 음식 추천 기능의 고도화에 활용될 수 있다.