• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.692-702
• /
• 2008

Path planning is gaining more weight in computer games and virtual reality as the number of self-moving characters increases. In the roadmap approach, the map of possible paths is built in advance to plan paths for a character, whose advantage is to provide high-quality paths. On the other hand, a disadvantage is that the road map doesn't reflect properties of characters such as their sizes because they move on the same map once the road map is constructed. In this paper we propose an efficient method to build a different road map for each character so that it can use its own map for path-planning. This method is efficient because the whole map is built once by applying the Visibility Graph regardless of the number of characters and walkable paths are incrementally inserted according to the sizes of characters. The effects of using separate roadmaps are demonstrated through simulations and the trade-offs accompanied with these effects are analyzed.

• Journal of the Korea Computer Graphics Society
• /
• v.20 no.2
• /
• pp.25-32
• /
• 2014

We present an example-based approach to synthesizing physically simulated Rube Goldberg machines in which a series of rigid body elements are sequentially triggered and driven along the causal chain. Given a set of elements, our goal is to automatically instantiate and arrange those elements to meet the user-specified requirements including the start and end positions, and the boundary of movement. To do so, we first sample small-scale machines consisting of only a few elements randomly, and represent the connectivity between every pair of components as a graph structure. Searching over possible paths in this graph solves our problem by finding a path that can be unrolled to satisfy the given requirements, and then assembling components sequentially along the solution path. In order to ensure that the machine works precisely in a physically simulated environment, we finally elaborate the layout of assembled components by a simple greedy algorithm. We demonstrate the usefulness of our approach by displaying a large diversity of Rube Goldberg machines built with only five kinds of elements.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.1-8
• /
• 2022

Recently, Google MedeiaPipe presents a novel approach for neural network-based hair segmentation from a single camera input specifically designed for real-time, mobile application. Though neural network related to hair segmentation is relatively small size, it produces a high-quality hair segmentation mask that is well suited for AR effects such as a realistic hair recoloring. However, it has undesirable segmentation effects according to hair styles or in case of containing noises and holes. In this study, the energy function of the test image is constructed according to the estimated prior distributions of hair location and hair color likelihood function. It is further optimized according to graph cuts algorithm and initial hair region is obtained. Finally, clustering algorithm and image post-processing techniques are applied to the initial hair region so that the final hair region can be segmented precisely. The proposed method is applied to MediaPipe hair segmentation pipeline.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.453-462
• /
• 2009

Studies on software plagiarism detection, prevention and judgement have become widespread due to the growing of interest and importance for the protection and authentication of software intellectual property. Many previous studies focused on comparing all pairs of submitted codes by using attribute counting, token pattern, program parse tree, and similarity measuring algorithm. It is important to provide a clear-cut model for distinguishing plagiarism and collaboration. This paper proposes a source code clustering algorithm using a probability model on extreme value distribution. First, we propose an asymmetric distance measure pdist($P_a$, $P_b$) to measure the similarity of $P_a$ and $P_b$ Then, we construct the Plagiarism Direction Graph (PDG) for a given program set using pdist($P_a$, $P_b$) as edge weights. And, we transform the PDG into a Gumbel Distance Graph (GDG) model, since we found that the pdist($P_a$, $P_b$) score distribution is similar to a well-known Gumbel distribution. Second, we newly define pseudo-plagiarism which is a sort of virtual plagiarism forced by a very strong functional requirement in the specification. We conducted experiments with 18 groups of programs (more than 700 source codes) collected from the ICPC (International Collegiate Programming Contest) and KOI (Korean Olympiad for Informatics) programming contests. The experiments showed that most plagiarized codes could be detected with high sensitivity and that our algorithm successfully separated real plagiarism from pseudo plagiarism.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1524-1531
• /
• 2004

This study analyzes a load balancing technique using Round Robin Algorithm. The study uses two software packages (Packet Capture and Round Robin Test Package) to check packet volume from Virtual Network structure (data generator, virtual server, Server1,2,3), and finds out traffic distribution toward Server1,2 and 3. The functions of implemented Round Robin Load Balancing Monitoring System include round robin testing, system monitoring, and graphical indication of data transmission and packet volume. As the result of the study shows, Round Robin Algorithm allows servers to ensure definite traffic distribution, unless incoming data loads differ much. Although error levels are high in some cases, they were eventually alleviated by repeated tests for a long period of time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.4
• /
• pp.846-853
• /
• 2004

This paper introduces implementation of a traffic distributed processing system on the Web Sever Networking. The study used two software packages （Packet Capture and Round-Robin Test Package） to check packet quantity from Virtual Network Structure (data generator, virtual server, Serve. 1, 2, 3), and could find out traffic distribution toward Server 1, 2, and 3. The functions of implemented Round-Robin Load Balancing Monitoring System include Round-Robin testing, system monitoring, and graphical indication of data transmission/packet quantity (figures ＆ diagram). As the result of the study shows, Round-Robin Algorithm ensured definite traffic distribution, unless incoming data loads differ much. Although error levels were high in some cases, they were eventually alleviated by repeated tests for a long period of time.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.05a
• /
• pp.198-201
• /
• 2005

DNA microarray 칩은 신약 개발, 유전적 질환 진단, Bio-molecular 상호작용 연구, 유전자의 기능연구 등 폭넓게 사용되고 있다. 이 논문은 cDNA mimcroarray 데이터를 분석하기 위한 웹형태의 시스템 개발에 대한 내용을 다룬다. 하나의 cDNA microarray에는 수 백에서 수 만개의 유전자가 심어져 있으며, 데이터를 분석할 때 대량의 데이터와 다양한 형태의 오류로 인해서 데이터간의 차이를 보정하는 분석 도구와 통계적 기법들이 사용되어야 한다. 본 논문에서는 가상 칩 뷰어를 이용하여 실제 microarray 데이터의 foreground intensity에서 백그라운드의 intensity를 제거하여 일반화된 칩 이미지를 생성한다. 이 가상 칩 뷰어는 여러 가지 필터효과와 서로 다른 두 형광의 차이를 조정하는 global normalization 기법을 사용하여 발현 유전자 분석을 시각적으로 할 수 있고, 중복된 마이크로어레이 칩 데이터를 통하여 시간이 많이 걸리는 분석전 칩의 유효성을 검토할 수 있다. 칩 데이터의 normalization을 위한 통계 방법으로 R 통계 도구와 linear 모델을 사용하여 microarray 칩의 유전자 발현 양상을 분석한다. 통계적 방법을 사용하지 않은 데이터를 추출, 이 데이터의 패턴 그래프 그리고 발현 레벨을 분류하여 마이크로어레이의 각 스팟의 유효성 검토의 정확성을 높였다. 이 시스템은 칩의 유효성 검토, 스팟의 유효성 검토, 유전자 선정에 대해 분석의 용이성과 정확성을 높일 수 있었다.

• Journal of the Korean School Mathematics Society
• /
• v.25 no.3
• /
• pp.225-241
• /
• 2022

The purpose of this study is to analyze and present what aspects of the concept of function prospective mathematics secondary teachers emphasize when designing a class that introduces the concept of function using curriculum and textbooks. For this purpose, virtual instruction and reflections on virtual instruction were analyzed. The results are as follows. The prospective mathematics secondary teachers consider and introduce the concepts of function as correspondences and processes. Their conception of function was consistently observed during virtual instruction and reflections on virtual instruction. The prospective mathematics secondary teachers' conception of function was closely related to the form of expressing functions. These results provi e implications for prospective mathematics secondary teachers' education for introducing the concept of function based on the dependent relation between variables presented in the 2015 revision of the national mathematics curriculum.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.5
• /
• pp.151-154
• /
• 2014

An energy of applications had consumed through the complexed inter-action with operating systems, run-time environments, compiler, and applications on various mobile devices. In these days, challenged researches are studying to reduce of energy consumptions that uses energy-oriented high-level and low-level compiler techniques on mobile devices. In this paper, we intented to reduce an energy consumption of Java mobile applications that applied a list instruction scheduling for energy dissipation from dalvik bytecode which extracted Android dex files. Through this works, we can construct the optimized power and energy environment on mobile devices with the limited power supply.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.3
• /
• pp.263-269
• /
• 2014

Flight test data visualization functions can improve an understanding of flight test results, test procedures, and the performance of a flight vehicle after flight tests. FlyingView was developed for researchers to analyse flight test data in a 3D virtual environment. It also can display X-Y plots using flight test data. It was developed and applied to flight tests of an air-to-ground weapon system of ADD. This paper describes the capabilities of FlyingView.