• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.3
• /
• pp.345-356
• /
• 1995

The aim of this paper is to analyze the batch service queueing model M/M(a, b ; ${\mu}_k/1$) under general bulk service rule with mean service rate ${\mu}_k$ for a batch of k units, where $a{\leq}k{\leq}b$. This queueing model consists of the two-dimensional state space so that it is characterized by two-dimensional state Markov process. The steady-state solution and performane measure of this process are derived by using Matrix Geometric method. Meanwhile, a new approach is suggested to calculate the two-dimensional traffic density R which is used to obtain the steady-state solution. In addition, to determine the optimal service initiation threshold a, a decision model of this queueing system is developed evaluating cost of service per batch and cost of waiting per customer. In a job order production system, the decision-making procedure presented in this paper can be applicable to determining when production should be started.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.3
• /
• pp.395-400
• /
• 2011

In this paper, we propose an study of the facial emotion recognition considering the dynamical variation of emotional state in facial image sequences. The proposed system consists of two main step: facial image based emotional feature extraction and emotional state classification/recognition. At first, we propose a method for extracting and analyzing the emotional feature region using a combination of Active Shape Model (ASM) and Facial Action Units (FAUs). And then, it is proposed that emotional state classification and recognition method based on Hidden Markov Model (HMM) type of dynamic Bayesian network. Also, we adopt a Harmony Search (HS) algorithm based heuristic optimization procedure in a parameter learning of HMM in order to classify the emotional state more accurately. By using all these methods, we construct the emotion recognition system based on variations of the dynamic facial image sequence and make an attempt at improvement of the recognition performance.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.4
• /
• pp.1657-1662
• /
• 2017

Facial expression recognition systems using video devices have emerged as an important component of natural human-machine interfaces which contribute to various practical applications such as security systems, behavioral science and clinical practices. In this work, we present a new method to analyze, represent and recognize human facial expressions using a sequence of facial images. Under our proposed facial expression recognition framework, the overall procedure includes: accurate face detection to remove background and noise effects from the raw image sequences and align each image using vertex mask generation. Furthermore, these features are reduced by principal component analysis. Finally, these augmented features are trained and tested using Hidden Markov Model (HMM). The experimental evaluation demonstrated the proposed approach over two public datasets such as Cohn-Kanade and AT&T datasets of facial expression videos that achieved expression recognition results as 96.75% and 96.92%. Besides, the recognition results show the superiority of the proposed approach over the state of the art methods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.2 s.332
• /
• pp.23-38
• /
• 2005

The state of channel between two or more wireless terminals is changed frequently due to noise or multiple environmental conditions in wireless network. In this paper, we analyze packet transmission time and queue length in a time-varying channel of packet based Wireless Networks. To reflect the feature of the time-varying channel, we model the channel as two-state Markov model and three-state Markov model Which are transformed to SFG(Signal Flow Graph) model, and then the distribution of the packet transmission can be modeled as Gaussian distribution. If the packet is arrived with Poisson distribution, then the packet transmission system is modeled as M/G/1. The average transmission time and the average queue length are analyzed in the time-varying channel, and are verified with some simulations.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.1043-1050
• /
• 2022

Markov chains and Monte Carlo Simulation were applied to account for the probabilistic nature of pavement deterioration over time using data collected in the field. The primary purpose of this study was to evaluate pavement network performance of Western Australia (WA) by applying the existing pavement management tools relevant to WA road construction networks. Two approaches were used to analyze the pavement networks: evaluating current pavement performance data to assess WA State Road networks and predicting the future states using past and current pavement data. The Markov chains process and Monte Carlo Simulation methods were used to predicting future conditions. The results indicated that Markov chains and Monte Carlo Simulation prediction models perform well compared to pavement performance data from the last four decades. The results also revealed the impact of design, traffic demand, and climate and construction standards on urban pavement performance. This study recommends an appropriate and effective pavement engineering management system for proper pavement design and analysis, preliminary planning, future pavement maintenance and rehabilitation, service life, and sustainable pavement construction functionality.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.194-204
• /
• 2008

The online collection of coarse-grained traffic information, such as the total number of flows, is gaining in importance due to a wide range of applications, such as congestion control and network security. In this paper, we focus on an active queue management scheme called SRED since it estimates the number of active flows and uses the quantity to indicate the level of congestion. However, SRED has several limitations, such as instability in estimating the number of active flows and underestimation of active flows in the presence of non-responsive traffic. We present a Markov model to examine the capability of SRED in estimating the number of flows. We show how the SRED cache hit rate can be used to quantify the number of active flows. We then propose a modified SRED scheme, called hash-based two-level caching (HaTCh), which uses hashing and a two-level caching mechanism to accurately estimate the number of active flows under various workloads. Simulation results indicate that the proposed scheme provides a more accurate estimation of the number of active flows than SRED, stabilizes the estimation with respect to workload fluctuations, and prevents performance degradation by efficiently isolating non-responsive flows.

• Asian Journal of Atmospheric Environment
• /
• v.10 no.2
• /
• pp.67-79
• /
• 2016

The forecasting of air pollution is an important and popular topic in environmental engineering. Due to health impacts caused by unacceptable particulate matter (PM) levels, it has become one of the greatest concerns in metropolitan cities like Karaj City in Iran. In this study, the concentration of $PM_{2.5}$ was predicted by applying a multilayer percepteron (MLP) neural network, a radial basis function (RBF) neural network and a Markov chain model. Two months of hourly data including temperature, NO, $NO_2$, $NO_x$, CO, $SO_2$ and $PM_{10}$ were used as inputs to the artificial neural networks. From 1,488 data, 1,300 of data was used to train the models and the rest of the data were applied to test the models. The results of using artificial neural networks indicated that the models performed well in predicting $PM_{2.5}$ concentrations. The application of a Markov chain described the probable occurrences of unhealthy hours. The MLP neural network with two hidden layers including 19 neurons in the first layer and 16 neurons in the second layer provided the best results. The coefficient of determination ($R^2$), Index of Agreement (IA) and Efficiency (E) between the observed and the predicted data using an MLP neural network were 0.92, 0.93 and 0.981, respectively. In the MLP neural network, the MBE was 0.0546 which indicates the adequacy of the model. In the RBF neural network, increasing the number of neurons to 1,488 caused the RMSE to decline from 7.88 to 0.00 and caused $R^2$ to reach 0.93. In the Markov chain model the absolute error was 0.014 which indicated an acceptable accuracy and precision. We concluded the probability of occurrence state duration and transition of $PM_{2.5}$ pollution is predictable using a Markov chain method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.11 no.1
• /
• pp.7-11
• /
• 1986

Throughout this paper we analyze the system at output point t of two stage cyclic queueing model. Our main result characterize the stochastic process (X$^{o}$ , T$^{o}$ ), the system at output point, as a Markov renewal process. The subsequent lemma exhibits the semi-Markov kernel of (X$^{o}$ , T$^{o}$ ) with state dependent feedback, the possibility of a reducible state space arises. A simple necessary and sufficient condition for the irreducibility of (X$^{o}$ , T$^{o}$ was determinded. This irreducibility implied that (X$^{o}$ , T$^{o}$ ) was aperiodic.

• Journal of Korean Institute of Industrial Engineers
• /
• v.11 no.2
• /
• pp.1-9
• /
• 1985

In this study, two stage transfer line with limited repair capability is modeled to formulate optimal dynamic repair priority policy. The method of Markov Chains is used to analyze the analytical model of this line. An efficient algorithm is developed, utilizing the block tridiagonal structure of the transition probability matrix, to obtain the steady state probabilities and system performance measures, such as the steady state production rate of the line and the average in-process inventory in the interstage buffer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3602-3620
• /
• 2016

Dynamic topology is one of the main influence factors on network performability. However, it was always ignored by the traditional network performability assessment methods when analyzing large-scale mobile ad hoc networks (MANETs) because of the state explosion problem. In this paper, we address this problem from the perspective of complex network. A two-layer hierarchical modeling approach is proposed for MANETs performability assessment, which can take both the dynamic topology and multi-state nodes into consideration. The lower level is described by Markov reward chains (MRC) to capture the multiple states of the nodes. The upper level is modeled as a small-world network to capture the characteristic path length based on different mobility and propagation models. The hierarchical model can promote the MRC of nodes into a state matrix of the whole network, which can avoid the state explosion in large-scale networks assessment from the perspective of complex network. Through the contrast experiments with OPNET simulation based on specific cases, the method proposed in this paper shows satisfactory performance on accuracy and efficiency.