• Journal of the Korea Society of Computer and Information
• /
• v.22 no.9
• /
• pp.73-80
• /
• 2017

In this paper, we design and implement a mobile game based on Kinect sensor. This game is a motion recognition maze game based on Kinect sensor using XNA Game Studio. The game consists of three stages. Each maze has different size and clear time limit. A player can move to the next stage only if the player finds the exit within a limited time. However, if the exit is not found within the time limit, the game ends. In addition, two kinds of mini games are included in the game. The first game is a fruit catch game using motion recognition tracking of the Kinect sensor, and player have to pick up a certain number of randomly falling fruits. If a player acquire a certain number of fruits at this time, the movement speed of the player is increased. However, if a player takes a skeleton that appears randomly, the movement speed will decrease. The second game is a Quiz game using the speech recognition function of the Kinect sensor, and a question from random genres of common sense, nonsense, ancient creature, capital, constellation, etc. are issued. If a player correctly answers more than 7 of 10 questions, the player gets useful items to use in finding the maze. This item is a navigator fairy that helps the player to escape the forest.

• Journal of Preventive Medicine and Public Health
• /
• v.13 no.1
• /
• pp.67-75
• /
• 1980

Natural increase rate in population is reached to 1.7% in 1975 fron 2.5% in 1966 because of the effect of Govermental Family Planning Program. The average number of present children and ideal children is just the same, 2.4 people, in this investigation. So, I assume that the number of present and ideal children is approaching each other. The rate of unmarried female workers who don't know even one thing about the know ledge of contraception was 23.9%, and especially that of rural women was 31.5% and 41.3% of them has never experienced contraception. 'Boy-preference' presented 60.1% of unmarried female workers and 79.1% of married women. 'Connection of a family line' related to 'Transfer to next generation of a family line' presented 38.0% and 'Trustworthiness' related to 'Leadership of a family' presented 26.0% (total 64.0%). As this point, Ive can find that this rate reveals the traditional sense of patriarchal system in society and family. The rate of women of experienced artificial abortion has been 52.1% and that of women using it as birth control caused by 'Many children' and 'Short brith-interval' 46.6% of women of experienced pregnancy. So, we can see that artificial abortion is a main cause of Maternal Health destruction.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.12
• /
• pp.1564-1574
• /
• 1999

In order to improve the efficiency of optimizing compilers, integration of register allocation and instruction scheduling has been extensively studied. One of the promising integration techniques is register allocation based on register-reuse chains. However, the generation of register-reuse chains in the previous approach was not completely systematic and consequently it creates unnecessarily dependencies that restrict instruction scheduling. This paper proposes a new register allocation technique based on a systematic generation of register-reuse chains. The first phase of the proposed technique is to generate register-reuse chains that are optimal in the sense that no additional dependencies are created. Thus, register allocation can be done without restricting instruction scheduling. For the case when the optimal register-reuse chains require more than available registers, the second phase reduces the number of required registers by merging the register-reuse chains. Chain merging always generates additional dependencies and consequently enforces the execution order of instructions. A heuristic is developed for the second phase in order to reduce additional dependencies created by merging chains. For matrix multiplication program, the number of registers resulting from the first phase is small enough to fit into available registers for most basic blocks. In addition, it is shown that the restriction to instruction scheduling is reduced by the proposed merging heuristic of the second phase.

• Communications for Statistical Applications and Methods
• /
• v.18 no.3
• /
• pp.319-331
• /
• 2011

In this paper, we propose automatic procedures for the model selection of various univariate time series data. Automatic model selection is important, especially in data mining with large number of time series, for example, the number (in thousands) of signals accessing a web server during a specific time period. Several methods have been proposed for automatic model selection of time series. However, most existing methods focus on linear time series models such as exponential smoothing and autoregressive integrated moving average(ARIMA) models. The key feature that distinguishes the proposed procedures from previous approaches is that the former can be used for both linear time series models and nonlinear time series models such as threshold autoregressive(TAR) models and autoregressive moving average-generalized autoregressive conditional heteroscedasticity(ARMA-GARCH) models. The proposed methods select a model from among the various models in the prediction error sense. We also provide an R package autots that implements the proposed automatic model selection procedures. In this paper, we illustrate these algorithms with the artificial and real data, and describe the implementation of the autots package for R.

• Journal of Microbiology and Biotechnology
• /
• v.18 no.9
• /
• pp.1518-1521
• /
• 2008

Bacteria sense their population density and coordinate the expression of target genes, including virulence factors in Gram-negative bacteria, by the N-acylhomoserine lactones (AHLs)-dependent quorum sensing (QS) mechanism. In contrast, several soil bacteria are able to interfere with QS by enzymatic degradation of AHLs, referred to as quorum quenching. A potent AHL-degrading enzyme, AiiA, from Bacillus thuringiensis has been reported to effectively attenuate the virulence of bacteria by quorum quenching. However, little is known about the role of AiiA in B. thuringiensis itself. In the present study, an aiiA-defective mutant was generated to investigate the role of AHA in rhizosphere competence in the root system of pepper. The aiiA mutant showed no detectable AHL￢-egrading activity and was less effective for suppression of soft-rot symptom caused by Erwinia carotovora on the potato slice. On the pepper root, the survival rate of the aiiA mutant significantly decreased over time compared with that of wild type. Interestingly, viable cell count analysis revealed that the bacterial number and composition of E. carotovora were not different between treatments of wild type and the aiiA mutant. These results provide evidence that AHA can play an important role in rhizosphere competentce of B. thuringiensis and bacterial quorum quenching to Gram-negative bacteria without changing bacterial number or composition.

• Management Science and Financial Engineering
• /
• v.11 no.2
• /
• pp.19-43
• /
• 2005

This paper considers a variation of the customer order scheduling problem, and the variation is the case where the machine-job assignment is fixed. We examine the parallel machine environment, and the objective is to minimize the sum of the completion times of the batches. While a machine can process only one job at a time, different machines can simultaneously process different jobs in a batch. The recognition version of this problem is known to be NP-complete in the strong sense even if there exist only two parallel machines. When there are an arbitrary number of parallel machines, we establish three lower bounds and develop a dynamic programming (DP) algorithm which runs in exponential time on the number of batches. We present two simple but intuitive heuristics, SB and GR, and find some special cases where SB and GR generate an optimal schedule. We also find worst case upper bounds on the relative error. For the case of the two parallel machines, we show that GR generates an optimal schedule when processing times of all batches are equal. Finally, the heuristics and the lower bounds are empirically evaluated.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.8 s.179
• /
• pp.2100-2107
• /
• 2000

The wavelet theory is relatively a new development and now acquires popularity and much interest in many areas including mathematics and engineering. This work presents an adaptive wavelet method for a numerical solution of partial differential equations in a collocation sense. Due to the multi-resolution nature of wavelets, an adaptive strategy can be easily realized it is easy to add or delete the wavelet coefficients as resolution levels progress. Typical wavelet-collocation methods use interpolating wavelets having no vanishing moment, but we propose a new wavelet-collocation method on modified interpolating wavelets having 2 vanishing moments. The use of the modified interpolating wavelets obtained by the lifting scheme requires a smaller number of wavelet coefficients as well as a smaller condition number of system matrices. The latter property makes a preconditioned conjugate gradient solver more useful for efficient analysis.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.344-347
• /
• 1995

The standard estimation and filtering theory are well known and has recently been incorporated with the H$_{\infty}$ optimization techniques where the parametrizations of all estimators and filters are utilized. The issue of reducing its order is always of interest. This paper presents a method for synthesizing low-order stable state estimators. The method presented in this paper is based on the utilization of a free parameter function contained in the parametrization of all state estimators. The results obtained in the paper are compared with standard results on low-order estimators. Both results are shown to be the same in a sense of its orders, but the approaches taken are largely different. It is also shown in the paper that the method can easily and directly be extended to the Kalman filters and the H$_{\infty}$ (sub)optimal filters. Consequently, the orders of all state estimators, Kalman filters, and H$_{\infty}$ filters are shown to be reduced down to the number of states minus the number of outputs, respectively.ly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2499-2522
• /
• 2017

Multi-hop networks are a low-setup-cost solution for enlarging an area of network coverage through multi-hop routing. Carrier sense multiple access with collision avoidance (CSMA/CA) is frequently used in multi-hop networks. Multi-hop networks face multiple problems, such as a rise in contention for the medium, and packet loss under heavy-load, saturated conditions, which consumes more bandwidth due to re-transmissions. The number of re-transmissions carried out in a multi-hop network plays a major role in the achievable quality of service (QoS). This paper presents a statistical, analytical model for the end-to-end delay of contention-based medium access control (MAC) strategies. These strategies schedule a packet before performing the back-off contention for both differentiated heterogeneous data and homogeneous data under saturation conditions. The analytical model is an application of Markov chain theory and queuing theory. The M/M/1 model is used to derive access queue waiting times, and an absorbing Markov chain is used to determine the expected number of re-transmissions in a multi-hop scenario. This is then used to calculate the expected end-to-end delay. The prediction by the proposed model is compared to the simulation results, and shows close correlation for the different test cases with different arrival rates.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.73-77
• /
• 2007

In this paper, we propose a VLSI architecture of an LMS filter based on a Cyclo-static scheduler for fast computation of LMS filteing algorithm which is widely used in adptive filtering area. This process is composed of two steps: scheduling and circuit synthesis. The scheduling step accepts a fully specified flow graph(FSFG) as an input, and generates an optimal Cyclo-static schedule in the sense of the sampling rate, the number of processors, and the input-output delay. Then the generated schedule is transformed so that the number of communication edges between the processors. The circuit synthesis part translates the modified schedule into a complete circuit diagram by performing resource allocations. The VLSI layout generation can be performed easily by an existing silicon compiler.