• Proceedings of the Korea Society for Simulation Conference
• /
• 한국시뮬레이션학회 1999년도 추계학술대회 논문집
• /
• pp.192-196
• /
• 1999

본 연구에서는 변환을 취하지 않고 M/G/c 시스템의 고객수분포를 구하는 방법으로 2단계 분석을 제시한다. I 단계에서는 마코비안 서비스를 따르는 전통적인 고객수분포로부터 출발하여 여기에 새롭게 정의된 모수를 도입해서 근사하여 고객수가 c명일 때까지의 분포를 구한다. II단계에서는 선수 작업으로 하나의 대기행렬을 각각의 고객의 대기공간으로 구별하여 나눈 후에 현재 시스템내의 고객수에 따라 고객의 도착시점에서 바라 본 대기공간의 부하 유형별로 나누고, 해당 대기공간에 부하를 주는 정도에 따라 정리된 식으로부터 축차적으로 고객수분포를 유도한다. 유도된 고객수분포로부터 평균 시스템 체재시간과 평균 대기시간 등을 구하고 이를 시뮬레이션과 비교하여, 본 근사법의 유용성을 논의한다.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• 제38권11호
• /
• pp.913-921
• /
• 1989

This paper deals with a pole placement indirect adaptive control algorithm for discrete-time linear plants with arbitrary zeros. The resulting closed-loop control system is shown to be globally stable subject to the assumptions that an external input is persistently exciting and a lower bound on the magnitude of the Sylvester resultant of the plant numerator and denominator polynomials is known. The problem of controllability of the plant estimate in indirect adaptive control is handled by using an extended parameter correction. The validity of the proposed control algorithm is assured through simulation for a second-order plant.

• Korean Journal of Optics and Photonics
• /
• 제14권3호
• /
• pp.224-229
• /
• 2003

We realized a depolarizer based on two 2$\times$2 directional couplers and single mode optical fiber. A reduction method for the degree of polarization is demonstrated by using computer simulation, which is verified experimentally. The degree of polarization is -20 dB for the polarized input beam of spectral width less than 0.05 nm. The experimental results verify that the polarization noise, which is due to the change of the input polarization state, can be reduced by making the fiber-ring delay-line length greater thanthecoherencelengthofthesource.

• Journal of Advanced Navigation Technology
• /
• 제19권6호
• /
• pp.574-580
• /
• 2015

The stability condition of linear discrete interval systems with a time-varying delay time is considered. The considered system has interval system matrices for both non-delayed and delayed states with time-varying delay time within given interval values. The proposed condition is derived by using Lyapunov stability theory and expressed by very simple inequality. Compared to previous results, the stability issue on the interval systems is expanded to time-varying delay. Furthermore, the new condition can imply the existing results on the time-invariant case and show the relation between interval time-varying delay time and stability of the system. The proposed condition can be applied to find the stability bound of the discrete interval system. Some numerical examples are given to show the effectiveness of the new condition and comparisons with the previously reported results are also presented.

• Korean Journal of Cognitive Science
• /
• 제22권4호
• /
• pp.347-364
• /
• 2011

In this paper, we propose a automatic image bases extraction method for visual image reconstruction from brain activity using Non-negative Matrix Factorization (NMF). Image bases are basic elements to construct and present a visual image. Previous method used brain activity that evoked by predefined 361 image bases of four different sizes: $1{\times}1$, $2{\times}1$, $1{\times}2$, $2{\times}2$, and $2{\times}2$. Then the visual stimuli were reconstructed by linear combination of all the results from these image bases. While the previous method used 361 predefined image bases, the proposed method automatically extracts image bases which represent the image data efficiently. From the experiments, we found that the proposed method reconstructs the visual stimuli better than the previous method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제20권3호
• /
• pp.527-535
• /
• 2016

Statistical optimization algorithms have been variously developed to estimate the 3D shape and motion. However, statistical approaches are limited to analyze the sensitive effects of SfM(Shape from Motion) according to the camera's geometrical position or viewing angles and so on. This paper propose the quantitative estimation method about the uncertainties of an observation matrix by using camera imaging configuration factors predict the reconstruction ambiguities in SfM. This is a very efficient method to predict the final reconstruction performance of SfM algorithm. Moreover, the important point is that our method show how to derive the active guidelines in order to set the camera imaging configurations which can be expected to lead the reasonable reconstruction results. The experimental results verify the quantitative estimates of an observation matrix by using camera imaging configurations and confirm the effectiveness of our algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• 제49권2호
• /
• pp.9-16
• /
• 2012

In this paper, the beamforming and user scheduling scheme for device-to-device (D2D) underlaying celullar networks with partial channel state information is investigated. In the proposed scheme, cellular users whose channels are nearly orthogonal to the channel between base station and D2D receiver are selected for unitary beamforming so as to minimize the interference to the D2D receiver. The interference caused by underlaying D2D communication can be minimized by reducing the D2D transmitter's transmission power. To enhance the cellular users' throughput further, we also investigate codebook generation method in which each code vector belongs to multiple unitary code matrices. From simulation results, we show that the proposed beamforming and user scheduling scheme mitigates D2D interference to the cellular networks and the codebook generation method improves cellular users' throughput.

• Journal of the Korean Institute of Intelligent Systems
• /
• 제22권5호
• /
• pp.549-554
• /
• 2012

In this paper, we consider the optimal fuzzy filter of nonlinear discrete-time with estimation error variance constraint. First, the Takagi and Sugeno(T-S) fuzzy model is employed to approximate the nonlinear system. Next, the error state is mean square bounded, and the steady state variance of the estimation error of each state is not more than the individual predefined value. It is shown that, the addressed problem can be carried out by solving linear matrix inequality(LMI) and some algebraic quadratic matrix inequalities. Finally, some examples are provided to illustrate the design procedure and expected performance through simulations.

• Journal of the Korea institute for structural maintenance and inspection
• /
• 제7권4호
• /
• pp.109-120
• /
• 2003

The state-of-art of curved box girder bridge with cross section design has advanced in various area. In these days, several analytical techniques for behaviors of curved box girder bridges cross section are available to engineers. The transfer matrix method is extensively used for the structural analysis because its merit in the theoretical background and applicability. The technique is attractive for implementation on a numerical solution by means of a computer program coded in Fortran language with a few elements. To demonstrate this fact, it gives good results which compare well with finite element method. Therefore, this paper proposed the static analysis method of curved box bridge with cross section by transfer matrix method based on pure-torsional theory and the optimal span ratio/variable cross section ratio of 3 span continuous curved box girder bridge.

• The Journal of the Korea institute of electronic communication sciences
• /
• 제16권3호
• /
• pp.533-540
• /
• 2021

To evaluate the performance of a system, one-dimensional 3-neighborhood cellular automata(CA) based pseudo-random generators are widely used in many fields. Although two-dimensional CA and one-dimensional 5-neighborhood CA have been applied for more effective key sequence generation, designing symmetric one-dimensional 5-neighborhood CA corresponding to a given primitive polynomial is a very challenging problem. To solve this problem, studies on one-dimensional 5-neighborhood CA synthesis, such as synthesis method using recurrence relation of characteristic polynomials and synthesis method using Krylov matrix, were conducted. However, there was still a problem with solving nonlinear equations. To solve this problem, a symmetric one-dimensional 5-neighborhood CA synthesis method using a transition matrix of 90/150 CA and a block matrix has recently been proposed. In this paper, we detail the theoretical process of the proposed algorithm and use it to obtain symmetric one-dimensional 5-neighborhood CA corresponding to high-order primitive polynomials.