• Journal of Korea Game Society
• /
• v.14 no.2
• /
• pp.67-76
• /
• 2014

Recently there have been many interests on tangible sport games that can recognize the motions of players. In this paper, we propose essential technologies required for tangible games, which are methods for swing motion recognition and the calculation of shuttle cock's trajectory. When a user carries out a badminton swing while holding a smartphone with his hand, the motion signal generated by smartphone-embedded acceleration sensors is transformed into a feature vector through a Daubechies filter, and then its swing type is recognized using a k-NN based method. The method for swing motion presented herein provides an advantage in a way that a player can enjoy tangible games without purchasing a commercial motion controller. Since a badminton shuttle cock has a particular flight trajectory due to the nature of its shape, it is not easy to calculate the trajectory of the shuttle cock using simple physics rules about force and velocity. In this paper, we propose a method for calculating the flight trajectory of a badminton shuttle cock in which the wind effect is considered.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.1
• /
• pp.75-81
• /
• 2016

The main characters play leading roles in novels. In the previous studies, they recognize the main characters in a novel mainly based on dictionaries that built beforehand. In English, names begin with upper cases and are used with some words. In this paper, we propose a recognition method for main characters name in Korean novels by using predicates, rules and weights. We first recognize candidates for the characters name by predicates and propose some rules to exclude candidates that cannot be characters. We assign importances for candidates, considering weights that given by the number of candidates appeared in a sentence. Finally, if the importance of the character is more than a threshold, we decide that the character is one of main characters. The results from the experiments for 300 novels show that an average accuracy is 85.97%. The main characters name may be used to grasp relationships among characters, character's action and tendency.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.13 no.1
• /
• pp.39-45
• /
• 1999

Because of internal voids in insulators give rise to partial discharge(PD), which cause local breakdown and even entire insulation breakdown. Treeing due to PD is one of the main causes of breakdown of the insulating materials and nrluction of the insulation life. 1berefore the necessity for establishing a rrethod to diagnose the aging of insulation materials and to predict the breakdown of insulation has becorne irrportant. From this viewpoint, our studies diagnose insulation degradation using the rrethod of computer sensing system, which has PD and acoustic emission(AE) sensing system. To use advantages of these two methods can be used effectiveiy to search for treeing location and PD in sorre materials. In analysis rrethod of degradation, we analyzed the PD and AE pulses by regression analysis, corrpared to these obtained the correlation coefficient and retermination coefficient by T-distribution and saw that PD and AE pulses show a similar pattern on the whole. This has a similar teIlrency to the results of the research by Yoshimura and Fujita.Fujita.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2003.05a
• /
• pp.81-86
• /
• 2003

The studies on automatic ship collision avoidance system, which have been carried out last 10 years, are facing on new situation due to newly developed high technology such as computer and other information system. It was almost impossible to make it used in real navigation 3-4 years ago because of the absence of the tool to get other ship's information, however recently developed technology suggests new possibility. This study is carried out to develop the algorithm of automatic ship collision support system. The NOMOTO ship's mathematic model is adopted in simulation for its simplicity. The fuzzy reason rules are used for course-keeping system and for the calculation of Collision Risk using TCPA/DCPA. Moreover‘encounter type’ between two ships is analyzed based on Regulations for Preventing Collisions at Sea and collision avoidance action is suggested, Some situations are simulated to verity the developed algorithm and appropriate avoidance action is shown in the simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.505-513
• /
• 2009

Z. Cao had proposed NFRM(new fuzzy reasoning method) which infers in detail using relation matrix. In spite of the small inference rules, it shows good performance than mamdani's fuzzy inference method. But the most of fuzzy systems are difficult to make fuzzy inference rules in the case of MIMO system. The past days, We had proposed the MIMO fuzzy inference which had extended a Z. Cao's fuzzy inference to handle MIMO system. But many times and effort needed to determine the relation matrix elements of MIMO fuzzy inference by heuristic and trial and error method in order to improve inference performances. In this paper, we propose a MIMO fuzzy inference method with the learning ability witch is used a gradient descent method in order to improve the performances. Through the computer simulation studies for the inverse kinematics problem of 2-axis robot, we show that proposed inference method using a gradient descent method has good performances.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.11
• /
• pp.2765-2770
• /
• 2014

Rear view cameras which help to park or to drive backward has been distributed through after-market, but it is inconvenient because they do not provide views of left, right and front sides. Around view monitoring(AVM) systems which can monitor around vehicle at a glance have been developed and equipped by vehicle vendor but systematic studies on these systems is lack. While the AVM system which equipped on Infiniti cars of Nissan is adequate to monitor around vehicle at a glance, it has disadvantages that additional cabling because of using analog cables is required and image quality is lowered due to EMI/EMC intervention. The around view monitoring system implemented in this paper has advantages that there are no EMI/EMC problems because of using optical network and that cabling is simple because of using plug-and-play ways. Additionally, an advantage of MOST150 network is that camera nodes and display node can be easily installed in the form of plug-and-play.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1934-1939
• /
• 2013

In this paper, we consider the online scheduling problem of jobs with deadlines. The jobs arrive over time and the scheduling algorithm has no information about the arriving jobs in advance. The jobs have the processing time of the equal length and the goal of the scheduling algorithm is to maximize the number of jobs completed in their deadlines. The performance of the online algorithm is compared with that of the optimal algorithm which has the full information about all the jobs. The raio of the two performances is called the competitive ratio. In general, the ratio is unbouned. So the case that the online algorithm can have more resources than the optimal algorithm is considered, which is called the resource augmentation analysis. In this paper, the online algorithm have more machines. We show that the online algorithm can have the same performance as the optimal algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.429-434
• /
• 2017

In a graph G=(V, E) with n vertices, there is an unique box which is finally laid on each vertex. Thus each vertex and box is both numbered from 1 to n and the box i should be laid on the vertex i. But, the box ${\pi}$(i) is initially located on the vertex i according to a permutation ${\pi}$. In each step, the robot can walk along an edge of G and can carry at most one box at a time. Also when arriving at a vertex, the robot can swap the box placed there with the box it is carrying. The problem is to minimize the total step so that every vertex has its own box, that is, the shuffled boxes are sorted. In this paper, we shall find an upper bound of the minimum number of steps and show that the movement of the robot is found in $O(n^2)$ time when G is a cycle.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.301-314
• /
• 2001

Data mining refers to a set of techniques for discovering implicit and useful knowledge from large database. Many studies on data mining have been pursued and some of them have involved issues of temporal data mining for discovering knowledge from temporal database, such as sequential pattern, similar time sequence, cyclic and temporal association rules, etc. However, all of the works treat problems for discovering temporal pattern from data which are stamped with time points and do not consider problems for discovering knowledge from temporal interval data. For example, there are many examples of temporal interval data that it can discover useful knowledge from. These include patient histories, purchaser histories, web log, and so on. Allen introduces relationships between intervals and operators for reasoning about relations between intervals. We present a new data mining technique that can discover temporal relation rules in temporal interval data by using the Allen's theory. In this paper, we present two new algorithms for discovering algorithm for generating temporal relation rules, discovers rules from temporal interval data. This technique can discover more useful knowledge in compared with conventional data mining techniques.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.406-417
• /
• 2001

With the advances in multimedia databases on the World Wide Web, it becomes more important to provide users with the search capability of distributed multimedia data. While there have been many studies about the database selection and the collection fusion for text databases. The multimedia databases on the Web have autonomous and heterogeneous properties and they use mainly the content based retrieval. The collection fusion problem of multimedia databases is concerned with the merging of results retrieved by content based retrieval from heterogeneous multimedia databases on the Web. This problem is crucial for the search in distributed multimedia databases, however, it has not been studied yet. This paper provides novel algorithms for processing the collection fusion of heterogeneous multimedia databases on the Web. We propose two heuristic algorithms for estimating the number of objects to be retrieved from local databases and an algorithm using the linear regression. Extensive experiments show the effectiveness and efficiency of these algorithms. These algorithms can provide the basis for the distributed content based retrieval algorithms for multimedia databases on the Web.