• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.2
• /
• pp.138-145
• /
• 2010

In this paper, we consider the information processing system, which organizes the collected data to meaningful information when the number of data collected from multiple sources reaches to a predetermined number, and performs any action by processing the collected data, or transmits to other devices or systems. We derive an analytical model to calculate the time until it takes to process information after starting to collect data. Therefore, in order to complete the processing data within certain time constraints, we develop some design criteria to control various parameters of the information processing system. Also, we analyze the discrete time model for packet switching networks considering data with no particular arrival nor drop pattern. We analyze the relationship between the number of required packets and average information processing time through numerical examples. By this, we show that the proposed model is able to design the system to be suitable for user's requirements being complementary the quality of information and the information processing time in the system with time constraints.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.2
• /
• pp.139-151
• /
• 1997

An ATM switching system may be designed so that communications between processors of its control part can be performed via its switching network rather than a separate inter-processor communications (IPC) network. In such a system, there should be interfaces to convent IPC traffic from message format to cell format and vice versa, that is, mechanisms to perform the SAR (Segmentation And Reassembly) sublayer functions. In this paper, we concern the cell reassembly mechanism among them, mainly focussed on buffer management schemes. We consider a few alternatives to implement cell reassembly function block, namely, separated buffering, reserved buffering and shared buffering in this paper. In case of separated and reserved buffering, we employ a continuous time Markov chain for the performance evaluation of cell reassembly mechanism, judicially defining the states of the mechanism. Performance measures such as measage loss probability, mean number of message queued in buffer and average reassembly delay are obtianed in closed forms. In case of shared buffering, we compare the alternatives for implementing cell reassembly function block using simulation because it is almost impossible to analyze the mechanism of shared buffering by analytical modeling. Some illustrations are given for the performance analysis of the alternatives to implement cell reassembly function block.

• Journal of Sensor Science and Technology
• /
• v.26 no.4
• /
• pp.286-291
• /
• 2017

With regards to heading estimation using gyroscope and magnetometer signals, magnetic disturbance added in the magnetometer signals is a main degradation factor in the estimation accuracy. Although there are a number of existing mechanisms that may properly compensate for the magnetic disturbances, they are designed to react only to the magnetic disturbances, but not to the time derivative of disturbances. Note that the sensors may experience abrupt changes in the magnetic disturbances, particularly for ambulatory applications. This paper proposes a magnetic disturbance model-embedded heading estimation filter for time-varying magnetic environments. The proposed magnetic disturbance model is based on a first-order Markov chain with a conditional switching technique depending on the time derivative of disturbances. Once a high amount of derivative is detected, the corrupted magnetometer signals are discarded to protect the filter from them. In our experimental results, the averaged heading error of tests was $1.46^{\circ}$, while that of the original approach without switching was $5.75^{\circ}$.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2805-2826
• /
• 2021

In most cases, the routing policy of networks shows a preference for a static one-to-one mapping of communication pairs to routing paths, which offers adversaries a great advantage to conduct thorough reconnaissance and organize an effective attack in a stress-free manner. With the evolution of network intelligence, some flexible and adaptive routing policies have already proposed to intensify the network defender to turn the situation. Routing mutation is an effective strategy that can invalidate the unvarying nature of routing information that attackers have collected from exploiting the static configuration of the network. However, three constraints execute press on routing mutation deployment in practical: insufficient route mutation space, expensive control costs, and incompatibility. To enhance the availability of route mutation, we propose an OpenFlow-based route mutation technique called Polymorphic Path Transferring (PPT), which adopts a physical and virtual path segment mixed construction technique to enlarge the routing path space for elevating the security of communication. Based on the Markov Decision Process, with considering flows distribution in the network, the PPT adopts an evolution routing path scheduling algorithm with a segment path update strategy, which relieves the press on the overhead of control and incompatibility. Our analysis demonstrates that PPT can secure data delivery in the worst network environment while countering sophisticated attacks in an evasion-free manner (e.g., advanced persistent threat). Case study and experiment results show its effectiveness in proactively defending against targeted attacks and its advantage compared with previous route mutation methods.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.1
• /
• pp.105-113
• /
• 1998

This paper deals with a production line which consists of two production stages that are separated by a finite storage buffer. The inventory level in the storage buffer controls the production rate of the preceding stage. That is, the production rate becomes high (low) when the buffer inventory is low (high). We analyze the system characteristics utilizing the Markov process theory and then find an optimal control policy which maximizes a given system profit function. Also, a sensitivity analysis is made to examine the effects of various system parameters on the system performances.

• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.5
• /
• pp.440-449
• /
• 2013

We consider a reverse supply chain with a production facility and a recovery facility, and address the joint control of production and disposal decisions for sustainable operations. Demands are satisfied from on-hand inventory of serviceable products, replenished via manufacturing or remanufacturing. Sold products may be returned after usage and each returned product is disposed of or accepted for recovery. Accepted returned products are converted into serviceable products after remanufacturing process. Formulating the model as a Markov decision process, we characterized the structure of the optimal production and disposal policy as two monotone switching curves under a special condition. Three types of heuristic policies are presented and their performance is numerically compared.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.4E
• /
• pp.21-27
• /
• 1996

In this paper, we propose a discriminative training algorithm for the stochastic segment model (SSM) in continuous speech recognition. As the SSM is usually trained by maximum likelihood estimation (MLE), a discriminative training algorithm is required to improve the recognition performance. Since the SSM does not assume the conditional independence of observation sequence as is done in hidden Markov models (HMMs), the search space for decoding an unknown input utterance is increased considerably. To reduce the computational complexity and starch space amount in an iterative training algorithm for discriminative SSMs, a hybrid architecture of SSMs and HMMs is programming using HMMs. Given the segment boundaries, the parameters of the SSM are discriminatively trained by the minimum error classification criterion based on a generalized probabilistic descent (GPD) method. With the discriminative training of the SSM, the word error rate is reduced by 17% compared with the MLE-trained SSM in speaker-independent continuous speech recognition.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.36-42
• /
• 1997

This paper proposes a high-speed contention resolution scheme featuring high flexibility to the bursty traffic for an input buffering ATM switching architecture and its hardware strategy. The scheme is based on the threshold on the occupancy of the input buffer. As the proposed scheme utilizes the threshold, it has high flexibility to the fluctuations of the input traffic. The hardware strategy for the proposed policy is provided with the aim of the simple structure that achieves the reduction of the signal path and the power consumption. The performance on the average buffer size of the proposed policy is performed and compared with the conventional schame under the bursty traffic through both the analysis based on the markov hain and the simulation. The relations among the parameters on the proposed policy is analyzed to improve the performance.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.08a
• /
• pp.225-230
• /
• 1998

In this paper, a Kalman filter approach for enhancing speech signals degraded by statistically independent additive nonstationary noise is developed. The autoregressive hidden markov model is used for modeling the statistical characteristics of both the clean speech signal and the nonstationary noise process. In this case, the speech enhancement comprises a weighted sum of conditional mean estimators for the composite states of the models for the speech and noise, where the weights equal to the posterior probabilities of the composite states, given the noisy speech. The conditional mean estimators use a smoothing spproach based on two Kalmean filters with Markovian switching coefficients, where one of the filters propagates in the forward-time direction with one frame. The proposed method is tested against the noisy speech signals degraded by Gaussian colored noise or nonstationary noise at various input signal-to-noise ratios. An app개ximate improvement of 4.7-5.2 dB is SNR is achieved at input SNR 10 and 15 dB. Also, in a comparison of conventional and the proposed methods, an improvement of the about 0.3 dB in SNR is obtained with our proposed method.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.6
• /
• pp.11-22
• /
• 1996

We address an issue of channel sharing among users by using a random assignment-transmitter-based (RA-T) spread-spectrum transmission scheme which permits the contention mode only in the transmission of a header while avoiding collision during the data packet transmission. Once the header being successfully received, the data packet is ready for reception by switching to one of programmable matched-filters. But the receoption may be blocked due to limited number of matched-filters so that this effect is taken into account in our analysis. For realistic analysis, we integrate detection performance at the physical level with channel activity at the link level through a markov chain model. We also consider an acknowledgement scheme to notify whether the header is correctly detcted and the data packet can be processed continuously, which aims at reducing the interference caused unwanted data transmission. It is shown that receiver complexity can be greatly reduced by choosing a proper number of RA codes at the cost of only a little throughput degradation.