• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.405-415
• /
• 2005

Indexing techniques are used to implement selective tuning in wireless environments Indices are broadcast together with data to help mobile clients locate the required information. As a result, clients stay in doze mode most of the time. The drawback of this solution is that broadcast cycles are lengthened due to additional index information. In location-aware mobile services(LAMSs), it is important to reduce the query response time, since a late query response nay contain out-of-date information. In this paper, we present a broadcast-based spatial query processing method (BBS) designed to support k-NN query processing. In the BBS, broadcasted data objects are sorted sequentially based on their locations, and the server broadcasts the location dependent data along with an index segment. The performance of this scheme is investigated in relation to various environmental variables, such as the distributions of the data objects, the average speed of the clients and the size of the service area.

• Journal of the Korea Convergence Society
• /
• v.9 no.4
• /
• pp.47-55
• /
• 2018

In this paper, we propose a novel face recognition(FR) method that takes advantage of combining weighted deep local features extracted from multiple Deep Convolutional Neural Networks(DCNNs) learned with a set of facial local regions. In the proposed method, the so-called weighed deep local features are generated from multiple DCNNs each trained with a particular face local region and the corresponding weight represents the importance of local region in terms of improving FR performance. Our weighted deep local features are applied to Joint Bayesian metric learning in conjunction with Nearest Neighbor(NN) Classifier for the purpose of FR. Systematic and comparative experiments show that our proposed method is robust to variations in pose, illumination, and expression. Also, experimental results demonstrate that our method is feasible for improving face recognition performance.

• Journal of Korea Game Society
• /
• v.6 no.2
• /
• pp.13-22
• /
• 2006

As the development of games continues, the intelligence of NPC is becoming more and more important. Nowadays, the NPCs of MMORPGS are not only capable of simple actions like moving and attacking players, but also utilizing variety of skills and tactics as human-players do. This study suggests a method that grants characters used in RPG(Role-Playing Game) an ability of training and adaptation using Neural network and Genetic Algorithm. In this study, a simple game-play model is constructed to test how suggested intellect characters could train and adapt themselves to game rules and tactics. In the game-play model, three types of characters(Tanker, Dealer, Healer) are used. Intellect character group constructed by NN and GA, and trained by combats against enemy character group constructed by FSM. As the result of test, the proposed intellect characters group acquire an appropriate combat tactics by themselves according to their abilities and those of enemies, and adapt change of game rule.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.442-447
• /
• 2004

XML is normalized text form that is designed to transmit structured document in web as that propose in W3C (World Wide Web Consortium) in 1996. Function that this can overcome HTML's limit that use in existing in Internet and user define new tag to HTML by way to solve SGML's complexity added. There is many efforts to use storing this XML document in RDBMS but to relation style DB because XML document is tree structure structurally data SQL and perfect disaster caused by things that is language to ask a question accomplish XQuery that so it is W3C's XML standard query appear. After store XML informations including space information to RDBMS in this paper, Spatial XQuery through converter that is Sqatial XQuery2SQL through Spatial operator, Spatial function SQL of by Sqatial XQuery2SQL conversion algorithm that draw information in RDBMS after change embody wish to.

• Science of Emotion and Sensibility
• /
• v.18 no.3
• /
• pp.63-70
• /
• 2015

This study identified heart response of participants while listening to sounds which have 1/f fluctuations with exponent ${\alpha}$ gradient. The participants were engaged in emotional stress work. Prior studies related to 1/f fluctuation sound have reported that sound source can alleviate psychological and physiological state of users. Subjects of this study were exposed to sound with three levels of ${\alpha}$ gradient. Heart response of subjects were measured with Photoplethysmography(PPG) sensor simultaneously. The dependent variables of this study were beat per minute(BPM), very low frequency percent of pulse rate variability (VLF percent), the standard deviation of all normal RR intervals (SDNN), and high frequency power(HF power). Subject showed arousal response when exposed to sound with exponent ${\alpha}$ gradient of 3 whereas the sound with exponent ${\alpha}$ gradient of 1 and 2 resulted in relax effect. The characteristic of 1/f fluctuation sounds can be applied to alleviate stress for employers under emotional labor.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.1
• /
• pp.28-37
• /
• 2005

In our previous works, we suggested a method that extracts representative keywords from a few positive documents and assigns weights to them. To show the usefulness of the method, in this paper, we evaluate the performance of a famous classification algorithm called GIS(Generalized Instance Set) when it is combined with our method. In GIS algorithm, generalized instances are built from learning documents by a generalization function and then the K-NN algorithm is applied to them. Here, our method is used as a generalization function. For comparative works, Rocchio and Widrow-Hoff algorithms are also used as a generalization function. Experimental results show that our method is better than the others for the case that only positive documents are considered, but not when negative documents are considered together.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1518-1524
• /
• 2014

In this paper, a new method of spatial query, which is called Surround Search (SuSe) is suggested. This method makes it possible to search for the closest spatial object of interest to the user from a query point. SuSe is differentiated from the existing spatial object query schemes, because it locates the closest spatial object of interest around the query point. While SuSe searches the surroundings, the spatial object is saved on an R-tree, and MINDIST, the distance between the query location and objects, is measured by considering an angle that the existing spatial object query methods have not previously considered. The angle between targeted-search objects is found from a query point that is hidden behind another object in order to distinguish hidden objects from them. The distinct feature of this proposed scheme is that it can search the faraway or hidden objects, in contrast to the existing method. SuSe is able to search for spatial objects more precisely, and users can be confident that this scheme will have superior performance to its predecessor.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.2
• /
• pp.39-48
• /
• 2014

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.3
• /
• pp.60-68
• /
• 2007

In this paper, we propose an automatic facial expressions recognition system to analyze facial expressions (happiness, disgust, surprise and neutral) using tree structures based on heuristic rules. The facial region is first obtained using skin-color model and connected-component analysis (CCs). Thereafter the origins of user's eyes are localized using neural network (NN)-based texture classifier, then the facial features using some heuristics are localized. After detection of facial features, the facial expression recognition are performed using decision tree. To assess the validity of the proposed system, we tested the proposed system using 180 facial image in the MMI, JAFFE, VAK DB. The results show that our system have the accuracy of 93%.

• Science of Emotion and Sensibility
• /
• v.15 no.3
• /
• pp.345-354
• /
• 2012

The purpose of this study is finding alternative parameters of the HRV so as to minimize the subjective errors by STAI and BDI, could be have two types of significant correlation levels depending on normalized method. Particularly, the LF/HF presented as the quantitative physiological parameter that can reflect both state-anxiety and trait-anxiety.