• Journal of Information Processing Systems
• /
• v.12 no.3
• /
• pp.410-421
• /
• 2016

In this paper, we propose a framework that attempts to incorporate landmarks into a segment-based Mandarin speech recognition system. In this method, landmarks provide boundary information and phonetic class information, and the information is used to direct the decoding process. To prove the validity of this method, two kinds of landmarks that can be reliably detected are used to direct the decoding process of a segment model (SM) based Mandarin LVCSR (large vocabulary continuous speech recognition) system. The results of our experiment show that about 30% decoding time can be saved without an obvious decrease in recognition accuracy. Thus, the potential of our method is demonstrated.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.584-589
• /
• 1994

A time-varying nonlinear mathematical model was derived to consider the effect of change in roll radius on tension varation during winding and unwinding. A variable-gain PID controller was designed for tension control at start and stop in a multi-span continuous process system. The controller gains are updated at every control loop as roll radii continuously change. Computer simulation was carried out by using the mathematical model and the controller developed for a typical operating condition including acceleration and deceleration. When the variable-gain PID controller was used, the tension control performance was improved compared with that of existing control method during start-up and stop.

• Journal of the Korea Society for Simulation
• /
• v.14 no.3
• /
• pp.91-100
• /
• 2005

Grid computing is widely applicable to various fields of industry including process control and manufacturing, military command and control, transportation management, and so on. In a viewpoint of application area, grid computing can be classified to three aspects that are computational grid, data grid and access grid. This paper focuses on computational grid which handles complex and large-scale computing problems. Computational grid is characterized by system dynamics which handles a variety of processors and jobs on continuous time. To solve problems of system complexity and reliability due to complex system dynamics, computational grid needs scheduling policies that allocate various jobs to proper processors and decide processing orders of allocated jobs. This paper proposes a service prediction-based job scheduling model and present its scheduling algorithm that is applicable for computational grid. The service prediction-based job scheduling model can minimize overall system execution time since the model predicts the next processing time of each processing component and distributes a job to a processing component with minimum processing time. This paper implements the job scheduling model on the DEVS modeling and simulation environment and evaluates its efficiency and reliability. Empirical results, which are compared to conventional scheduling policies, show the usefulness of service prediction-based job scheduling.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.05a
• /
• pp.29-33
• /
• 2005

Grid computing is widely applicable to various fields of industry including process control and manufacturing, military command and control, transportation management, and so on. In a viewpoint of application area, grid computing can be classified to three aspects that are computational grid, data grid and access grid. This paper focuses on computational grid which handles complex and large-scale computing problems. Computational grid is characterized by system dynamics which handles a variety of processors and jobs on continuous time. To solve problems of system complexity and reliability due to complex system dynamics, computational grid needs scheduling policies that allocate various jobs to proper processors and decide processing orders of allocated jobs. This paper proposes the service prediction-based job scheduling model and present its algorithm that is applicable for computational grid. The service prediction-based job scheduling model can minimize overall system execution time since the model predicts a processing time of each processing component and distributes a job to processing component with minimum processing time. This paper implements the job scheduling model on the DEVSJAVA modeling and simulation environment and simulates with a case study to evaluate its efficiency and reliability Empirical results, which are compared to the conventional scheduling policies such as the random scheduling and the round-robin scheduling, show the usefulness of service prediction-based job scheduling.

• Management Science and Financial Engineering
• /
• v.19 no.2
• /
• pp.31-36
• /
• 2013

We propose a war-game model that is appropriate for a raid-type warfare in which, a priori, the maneuver of the attacker is relatively certain. The model is based on a multi-weapon extention of the Lanchester's law. Instead of a continuous time dynamic game with the differential equations from the Lanchester's law, however, we adopt a multi-period model relying on a time-discretization of the Lanchester's law. Despite the obvious limitation that two players make a move only on the discrete time epochs, the pragmatic model has a manifold justification. The existence of an equilibrium is readily established by its equivalence to a finite zero-sum game, the existence of whose equilibrium is, in turn, well-known to be no other than the LP-duality. It implies then that the war-game model dictates optimal strategies for both players under the assumption that any strategy choice of each player will be responded by a best strategy of her opponent. The model, therefore, provides a sound ground for finding an efficient reinforcement of a defense system that guarantees peaceful equilibria.

• Asia-Pacific Journal of Business
• /
• v.14 no.4
• /
• pp.343-356
• /
• 2023

Purpose - This study attempted to predict short-term transportation demand using trains and getting off at Gangchon Station. Through this, we present numerical data necessary for future tourist inflow policies in the Gangchon area of Chuncheon and present related implications. Design/methodology/approach - This study collected and analyzed transportation demand data from Gangchon Station using the Gyeongchun Line and ITX-Cheongchun Train from January 2014 to August 2023. Winters exponential smoothing model and ARIMA model were used to reflect the trend and seasonality of the raw data. Findings - First, transportation demand using trains to get off at Gangchon Station in Chuncheon City is expected to show a continuous increase from 2020 until the forecast period is 2024. Second, the number of passengers getting off at Gangchon Station was found to be highest in May and October. Research implications or Originality - As transportation networks are improving nationwide and people's leisure culture is changing, the number of tourists visiting the Gangchon area in Chuncheon City is continuously decreasing. Therefore, in this study, a time series model was used to predict short-term transportation demand alighting at Gangchon Station. In order to calculate more accurate forecasts, we compared models to find an appropriate model and presented forecasts.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.7
• /
• pp.528-538
• /
• 2003

A SCCRS (Speech and Character Combined Recognition System) is developed for working on mobile devices such as PDA (Personal Digital Assistants). In SCCRS, the feature extraction is separately carried out for speech and for hand-written character, but the recognition is performed in a common engine. The recognition engine employs essentially CHMM (Continuous Hidden Markov Model), which consists of variable parameter topology in order to minimize the number of model parameters and to reduce recognition time. For generating contort independent variable parameter model, we propose the SSMS(Successive State and Mixture Splitting), which gives appropriate numbers of mixture and of states through splitting in mixture domain and in time domain. The recognition results show that the proposed SSMS method can reduce the total number of GOPDD (Gaussian Output Probability Density Distribution) up to 40.0% compared to the conventional method with fixed parameter model, at the same recognition performance in speech recognition system.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.2
• /
• pp.145-152
• /
• 2004

In this paper, an S(stochastic)-eigenvalue and its corresponding S-eigenvector concept for linear continuous-time systems with probabilistic uncertainties are proposed. The proposed concept is concerned with the perturbation of eigenvalues due to the stochastic variable parameters in the dynamic model of a plant. An S-eigenstructure assignment scheme via the Sylvester equation approach based on the S-eigenvalue/-eigenvector concept is also proposed. The proposed control design scheme based on the proposed concept is applied to a longitudinal dynamics of an open-loop-unstable aircraft with possible uncertainties in aerodynamic and thrust effects as well as separate dynamic pressure effects. These results explicitly characterize how S-eigenvalues in the complex plane may impose stability on the system.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.358-363
• /
• 1994

This paper presents the improvement of the SCHMM using discrete VQ and One-Pass algorithm for keywords recognition in Korean continuous speech. The SCHMM using discrete VQ is a simple model that is composed of a variable mixture gaussian probability density function with dynamic mixture number. One-Pass algorithm is improved such that recognition rates are enhanced by fathoming any undesirable semisyllable with the low likelihood and the high duration penalty, and computation time is reduced by testing only the frame which is dissimilar to the previously testd frame. In recognition experiments for speaker-dependent case, the improved One-Pass algorithm has shown recognition rates as high as 99.7% and has reduced compution time by about 30% compared with the currently abailable one-pass algorithm.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.176-179
• /
• 2000

This paper addresses a fuzzy controller for nonlinear systems control using a pole placement in a specified disk and fuzzy controller is redesign for Intelligent digital redesign method. for nonlinear system, we obtain continuous time state feedback gain that guarantee stability of globally TS fuzzy system. The feedback gain is satified pole placement in a specified disk region so that the closed loop system is stable, For digital control redesgin of continuous time TS fuzzy model, we does state matching and obtain feedback gain of digital controller. Finally, it is shown that the proposed method is feasible through a computer simulation.