• Journal of Korea Game Society
• /
• v.14 no.5
• /
• pp.127-136
• /
• 2014

NPC in game is an important factor to increase the fun of the game by cooperating with player or confrontation with player. NPC's behavior patterns in the previous games are limited. Also, there is not much difference in NPC's ability among the existing games because it's designed to FSM. Therefore, players who have matched with NPCs which have the characteristics may have difficulty to play. This paper is for improving the problem and production and evaluation of the game NPC behavior model based on wolves hunting model in real life. To achieve it, first, the research surveys and studies behavior states for wolves to capture prey in the real world. Secondly, it is implemented using the Unity3D engine. Third, this paper compares the implemented state transition probability to state transition probability in real world, state transition probability in general game. The comparison shows that the number of state transitions of NPCs increases, proportions of implemented NPC behavior patterns converges to probabilities of state transition in real-world. This means that the aggressive behavior pattern of NPC implemented is similar to the wolf hunting behavior pattern of the real world, and it can thereby provide more player experience.

• Studies on Korean Youth
• /
• v.30 no.2
• /
• pp.333-363
• /
• 2019

The purpose of this study is to explore the transitional relationship between high school students' latent classes of academic factors and their latent classes of physical health factors. We used data taken from high school students in the Korea Child-Youth Happiness Index survey for 2017. The relationship between the two types of latent classes were analyzed by means of transition probabilities. In the latent class analysis on academic factors, three latent classes were drawn out as a best-fit model. Stress, academic achievement and private education factors appeared on a straight line. They were classified into 'low academic stress, academic achievement, and private education groups,', 'middle academic stress, academic achievement, and private education group', and 'high academic stress, academic achievement, and private education groups', respectively. In the latent class analysis of physical health factors, three latent classes were drawn as a best-fit model. They were classified into a 'frequent treatment group' that had a middle level of subjective health satisfaction, a high body mass index, and experiences of outpatient and hospitalization treatments, a 'low subjective health satisfaction group' that had remarkably lower subjective health satisfaction, and a 'health group' that had a high level of health satisfaction and condition. The relationship between the two types of latent classes were analyzed on the basis of transitional probabilities. As a result, it was found that the 'high academic stress, academic achievement, and private education group' had the highest probability of being involved in the 'frequent treatment group' or the 'low subjective health satisfaction group'. Based on a person-centered approach, it was found that the latent group with high risk in terms of their academic factors was likely to belong to a relatively unhealthy latent group. This study confirmed the transitional relationship between academic factors and physical health factors. This implies that it is necessary to select physical health risk groups according to academic factors and to consider effective intervention and tailored approaches which are most appropriate to the subjects.

• The Journal of the Acoustical Society of Korea
• /
• v.10 no.2
• /
• pp.29-35
• /
• 1991

In this paper, we discuss the method of recognizing allophone unit isolated words using hidden Markov model(HMM). Frist we constructed allophone lexicon by extracting allophones from training data and by training allophone HMMs. And then to recognize isolated words using allophone HMMs, it is necessary to construct word dictionary which contains information of allophone sequence and inter-allophone transition probability. Allophone sequences are represented by allophone HMMs. To see the effects of inter-allophone transition probability and to determine optimal probabilities, we performend some experiments. And we showed that small number of traing data and simple train procedure is needed to train word HMMs of allophone sequences and that not less performance than word unit HMM is obtained.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.739-743
• /
• 2008

In this paper, we introduce a method for automatically generating accompaniment music, according to user's input melody. The initial accompaniment chord is generated by analyzing user's input melody. Then next chords are generated continuously based on markov chain probability table in which transition probabilities of each chord are defined. The probability table is learned according to reinforcement learning mechanism using sample data of existing music. Also during playing accompaniment, the probability table is learned and refined using reward values obtained in each status to improve the behavior of playing the chord in real-time. The similarity between user's input melody and each chord is calculated using pitch class histogram. Using our method, accompaniment chords harmonized with user's melody can be generated automatically in real-time.

• Journal of KIISE:Software and Applications
• /
• v.34 no.2
• /
• pp.131-139
• /
• 2007

In this paper, we present a preprocessor which corrects word spacing errors and spelling correction errors simultaneously. The proposed expands noisy-channel model so that it corrects both errors in colloquial style sentences effectively, while preprocessing algorithms have limitations because they correct each error separately. Using Eojeol transition pattern dictionary and statistical data such as n-gram and Jaso transition probabilities, it minimizes the usage of dictionaries and produces the corrected candidates effectively. In experiments we did not get satisfactory results at current stage, we noticed that the proposed methodology has the utility by analyzing the errors. So we expect that the preprocessor will function as an effective error corrector for general colloquial style sentence by doing more improvements.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.7
• /
• pp.488-498
• /
• 2007

This paper presents a novel approach for representing the spatio-temporal topology of the camera network with overlapping and non-overlapping fields of view (FOVs) in Ubiquitous Smart Space (USS). The topology is determined by tracking moving objects and establishing object correspondence across multiple cameras. To track people successfully in multiple camera views, we used the Merge-Split (MS) approach for object occlusion in a single camera and the grid-based approach for extracting the accurate object feature. In addition, we considered the appearance of people and the transition time between entry and exit zones for tracking objects across blind regions of multiple cameras with non-overlapping FOVs. The main contribution of this paper is to estimate transition times between various entry and exit zones, and to graphically represent the camera topology as an undirected weighted graph using the transition probabilities.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.4
• /
• pp.40-49
• /
• 1994

In this paper, we propose methods for improving the performance of word recognition system. The ray stratey of the first method is to apply the inertia to the feature vector sequences of speech signal to stabilize the transitions between VQ cdoes. The second method is generating the new observation probabilities using the transition matrix of VQ codes as weights at the observation probability of the output symbol, so as to take into account the time relation between neighboring frames in DHMM. By applying the inertia to the feature vector sequences, we can reduce the overlapping of probability distribution of the response paths for each word and stabilize state transitions in the HMM. By using the transition matrix of VQ codes as weights in conventional DHMM. we can divide the probability distribution of feature vectors more and more, and restrict the feature distribution to a suitable region so that the performance of recognition system can improve. To evaluate the performance of the proposed methods, we carried out experiments for 50 DDD area names. As a result, the proposed methods improved the recognition rate by $4.2\%$ in the speaker-dependent test and $12.45\%$ in the speaker-independent test, respectively, compared with the conventional DHMM.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.56-66
• /
• 2014

We propose a novel opportunistic access scheme for cognitive radios in an interweave cognitive system, that considers the channel gain as well as the predicted idle channel probability (primary user occupancy: Busy/idle). In contrast to previous work where a cognitive user vacates a channel only when that channel becomes busy, the proposed scheme requires the cognitive user to switch to the channel with the next highest idle probability if the current channel's gain is below a certain threshold. We derive the threshold values that maximize the long term throughput for various primary user transition probabilities and cognitive user's relative movement.

• Journal of Korean Institute of Industrial Engineers
• /
• v.8 no.2
• /
• pp.15-21
• /
• 1982

This paper offers an alternative to the common probability generating function approach to the solution of steady state equations when a Markovian queue has a multivariate state space. Identifying states and substates and grouping them into vectors appropriately, we formulate a two - dimensional Markovian queue as a Markov chain. Solving the resulting matrix equations the transition point steady state probabilities (SSPs) are obtained. These are then converted into arbitrary time SSPs. The procedure uses only probabilistic arguments and thus avoids a large and cumbersome state space which often poses difficulties in the solution of steady state equations. For the purpose of numerical illustration of the approach we solve a Markovian queue with one server and two classes of customers.

• Journal of Korean Society for Quality Management
• /
• v.32 no.4
• /
• pp.156-168
• /
• 2004

This research investigates the statistical efficiency of variable sampling size & sampling interval(VSSI) $\bar{X}$ charts under two assignable causes. Algorithms for calculating the average run length(ARL) and average time to signal(ATS) of the VSSI $\bar{X}$ chart are proposed by employing Markov chain method. States of the process are defined according to the process characteristics after the occurrence of an assignable cause. Transition probabilities are carefully derived from the state definition. Statistical properties of the proposed chart are also investigated. A simple procedure for designing the proposed chart is presented based on the properties. Extensive sensitivity analyses show that the VSSI $\bar{X}$ chart is superior to the VSS or VSI $\bar{X}$ chart as well as to the Shewhart $\bar{X}$ chart in statistical sense, even tinder two assignable causes.