• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.832-835
• /
• 1987

This paper proposes a new method of generating binary random sequences using a randomly sampled M-sequence. In this paper two methods of sampling are proposed. Expected values of the autocorrelation function of the sequence generated by these methods are calculated theoretically. From the results of computer simulation, it is shown that using these methods, we can get binary random sequences which have good random properties.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.405-414
• /
• 2004

This paper considers overload control in telecommunication networks. Markov-modulated Bernoulli process ( MMBP ) has been extensively used to model bursty traffics with time-correlation. Thus, we investigate the transient behavior of the queueing system MMBP/D/l/K queue with two thresholds. The model is analyzed recursively by using the generating function method. We obtain the transient queue length distribution and waiting time distribution at an arbitrary time. The transient behavior of the queueing system helps observing the temporary system behavior.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.453-460
• /
• 2006

A discrete-time priority queueing system with place reservation discipline is studied, in which two different types of packets arrive according to batch geometric streams. It is assumed that there is a reserved place in the queue. Whenever a high-priority packet enters the queue, it will seize the reserved place and make a new reservation at the end of the queue. Low-priority arrivals take place at the end of the queue in the usual way. Using the probability generating function method, the joint distribution of system state and the delay distribution for each type are obtained.

• Journal of the Korean Mathematical Society
• /
• v.42 no.3
• /
• pp.517-527
• /
• 2005

This paper considers a discrete-time queueing system with variable service capacity. Using the supplementary variable method and the generating function technique, we compute the joint probability distribution of queue length and remaining service time at an arbitrary slot boundary, and also compute the distribution of the queue length at a departure time.

• Honam Mathematical Journal
• /
• v.46 no.1
• /
• pp.136-145
• /
• 2024

In this paper we obtained several properties that the characteristic polynomial of the unit-primitive matrix satisfies. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In fact, Xin and Zhong ([4]) showed it earlier. However, we provide a simpler method here.

• Korean Journal of Cognitive Science
• /
• v.6 no.3
• /
• pp.25-40
• /
• 1995

This paper proposes a generating method of fuzzy rules by genetic and descent method (GAGDM),and its applied to classification problems.The number of inference rules and the shapes of membership function in the antecedent part are detemined by applying the genetic algorithm,and the real numbers of the consequent parts are derived by using the descent method.The aim of the proposed method is to generation a minmun set of fuzzy rules that can correctly classify all training patterns,and fiteness function of GA defined by the aim of th proposed method.Finally,in order to demonstrate the effectiveness of the present method,simulation results are shown.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.12
• /
• pp.1216-1222
• /
• 2009

This article describes a simple method for generating the walking trajectory for the biped humanoid robot. The method used a simple inverted model instead of complex multi-mass model and a reasonable explanation for the model simplification is included. The problem of gait trajectory generation is to find the solution from the desired ZMP trajectory to CoG trajectory. This article presents the analytic solution for the bipedal gait generation on the bases of ZMP trajectory. The presented ZMP trajectory has Fourier series form, which has finite or infinite summation of sine and cosine functions, and ZMP trajectory can be designed by calculating the coefficients. From the designed ZMP trajectory, this article focuses on how to find the CoG trajectory with analytical way from the simplified inverted pendulum model. Time segmentation based approach is adopted for generating the trajectories. The coefficients of the function should be designed to be continuous between the segments, and the solution is found by calculating the coefficients with this connectivity conditions. This article also has the proof and the condition of solution existence.

• International journal of advanced smart convergence
• /
• v.12 no.4
• /
• pp.142-146
• /
• 2023

We present a method for generating 3D structures and rendering objects by combining VAE (Variational Autoencoder) and GAN (Generative Adversarial Network). This approach focuses on generating and rendering 3D models with improved quality using residual learning as the learning method for the encoder. We deep stack the encoder layers to accurately reflect the features of the image and apply residual blocks to solve the problems of deep layers to improve the encoder performance. This solves the problems of gradient vanishing and exploding, which are problems when constructing a deep neural network, and creates a 3D model of improved quality. To accurately extract image features, we construct deep layers of the encoder model and apply the residual function to learning to model with more detailed information. The generated model has more detailed voxels for more accurate representation, is rendered by adding materials and lighting, and is finally converted into a mesh model. 3D models have excellent visual quality and accuracy, making them useful in various fields such as virtual reality, game development, and metaverse.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.15-17
• /
• 2006

This paper presents a new global intensity compensation method for extracting moving object in a visual surveillance system by compensating time variant intensity changes of background region. The method that compensates a little changes of intensity due to time variant illumination change and automatic gain control of camera is called global intensity compensation. The proposed method expresses global intensity change with a mapping table to describe complex form of intensity change while the previous method models this global intensity change with a simple function as a straight line. The proposed method builds the mapping table by calculating the cross histogram between two images and then by selecting an initial point for generating the mapping table by using Hough transform applied to the cross histogram image. Then starting from the initial point, the mapping table is generated according to the proposed algorithm based on the assumption that reflects the characteristic of global intensity change. Experimental results show that the proposed method makes the compensation error much smaller than the previous GIC method

• Korean Journal of Remote Sensing
• /
• v.27 no.5
• /
• pp.573-586
• /
• 2011

The MTF(modulation transfer function) is one of parameters to evaluate the performance of imaging systems. Also, it can be used to restore information that is lost by a harsh space environment (radioactivity, extreme cold/heat condition and electromagnetic field etc.), atmospheric effects and falloff of system performance etc. This paper evaluated the MTF values of images taken by DubaiSat-1 satellite which was launched in 2009 by EIAST(Emirates Institute for Advanced Science and Technology) and Satrec Initiative. Generally, the MTF was assessed using various methods such as a point source method and a knife-edge method. This paper used the slanted-edge method. The slantededge method is the ISO 12233 standard for the MTF measurement of electronic still-picture cameras. The method is adapted to estimate the MTF values of line-scanning telescopes. After assessing the MTF, we performed the MTF compensation by generating a MTF convolution kernel based on the PSF(point spread function) with image denoising to enhance the image quality.