• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.3
• /
• pp.123-127
• /
• 2001

The prediction method of the parameter C/sub gs/ of CMOS transistor is proposed by calculating the mobil charge in inversion layer of COMS transistor. This parameter C/sub gs/ decided on the cutoff frequency in MOS transistor in RF range and coupled input and output. This parameter C/sub gs/ in RF range is very important parameter in small signal circuit model. This proposed method is contributed to developing software of extracting parameter value in equivalent circuit model. The method provide the important information to construct a RF nonlinear model for multifinger gate MOSFET. This method will be very valuable to develop a large signal MOSFET model for nonlinear RF IC design.

• Steel and Composite Structures
• /
• v.20 no.5
• /
• pp.1119-1131
• /
• 2016

As a first attempt, an inverse hybrid numerical method for small scale parameter estimation of functionally graded (FG) nanobeams using measured frequencies is presented. The governing equations are obtained with the Eringen's nonlocal elasticity assumptions and the first-order shear deformation theory (FSDT). The equations are discretized by using the differential quadrature method (DQM). The discretized equations are transferred from temporal domain to frequency domain and frequencies of the nanobeam are obtained. By applying random error to these frequencies, measured frequencies are generated. The measured frequencies are considered as input data and inversely, the small scale parameter of the beam is obtained by minimizing a defined functional. The functional is defined as root mean square error between the measured frequencies and calculated frequencies by the DQM. Then, the conjugate gradient (CG) optimization method is employed to minimize the functional and the small scale parameter is obtained. Efficiency, convergence and accuracy of the presented hybrid method for small scale parameter estimation of the beams for different applied random error, boundary conditions, length-to-thickness ratio and volume fraction coefficients are demonstrated.

• Proceedings of the KSME Conference
• /
• 2001.06b
• /
• pp.335-340
• /
• 2001

It is important to model the mechanical structure precisely and reasonably in predicting the dynamic characteristics, controlling the vibration, and designing the structure dynamics. In the finite element modeling, the errors can be contained from the physical parameters, the approximation of the boundary conditions, and the element modeling. From the dynamic test, more precise dynamic characteristics can be obtained. Model updating using parameter modification is appropriate when the design parameter is used to analyze the input parameter like finite element method. Finite element analysis for cantilever and simply supported beams with uniform area and shape change are carried out as model updating examples. Mass and stiffness matrices are updated by comparing test and analytical modal frequencies. The result shows that the updated frequencies become closer to the test frequencies.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.11b
• /
• pp.1260-1265
• /
• 2001

It is important to model the mechanical structure precisely and reasonably in predicting the dynamic characteristics, controlling the vibration, and designing the structural dynamics. In the finite element modeling, the errors can be contained from the physical parameters, the approximation of the boundary conditions, and the element modeling, From the dynamic test. more precise dynamic characteristics can be obtained. Model updating using parameter modification is appropriate when the design parameter is used to analyze the input parameter like finite element method. Finite element analysis for free-free-free-free(FFFF) and clamped-free-free-free(CFFF) plate with uniform area and shape change are carried out as model updating examples, Mass and stiffness matrices are updated by comparing test and analytical modal frequencies. The result shows that the updated frequencies become closer to the test frequencies.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.601-604
• /
• 2000

In this paper, we compare the classification performance of both data fusion and clustering algorithms (Data Bagging, Variable Selection Bagging, Parameter Combining, Clustering) to logistic regression in consideration of various characteristics of input data. Four factors used to simulate the logistic model are (1) correlation among input variables (2) variance of observation (3) training data size and (4) input-output function. Since the relationship between input & output is not typically known, we use Taguchi design to improve the practicality of our study results by letting it as a noise factor. Experimental study results indicate the following: Clustering based logistic regression turns out to provide the highest classification accuracy when input variables are weakly correlated and the variance of data is high. When there is high correlation among input variables, variable bagging performs better than logistic regression. When there is strong correlation among input variables and high variance between observations, bagging appears to be marginally better than logistic regression but was not significant.

• Language and Information
• /
• v.9 no.1
• /
• pp.69-92
• /
• 2005

Pattern recognition in cognitive agents is based on (i) the uninterpreted input data (e.g. parameter values) provided by the agent's hardware devices and (ii) and interpreted patterns (e.g. templates) provided by the agent's memory. Computationally, the task consists in finding the memory data corresponding best to the input data, for any given input. Once the best fitting memory data have been found, the input is recognized by applying to it the interpretation which happens to be stored with the memorized pattern. This paper presents a fast converging procedure which starts from a few initially recognized items and then analyzes the remainder of the input by systematically checking for items shown by memory to have been related to the initial items in previous encounters. In this way, known patterns are tried first, and only when they have been exhausted, an elementary exploration of the input is commenced. Efficiency is improved further by choosing the candidate to be tested next according to frequency.

• Proceedings of the KIEE Conference
• /
• 1990.11a
• /
• pp.421-424
• /
• 1990

An iterative learning control scheme for exact-tracking control and parameter estimation of uncertain robotic systems is presented. In the learning control structure, tracking and feedforward input converge globally and asymptotically as iteration increases. Since convergence of parameter errors depends only on the persistent exciting condition of system trajectories along the iteration independently of length of trajectories, it may be achieved with only system trajectories of small duration. In addition, these learning control schemes are expected to be effectively applicable to time-varying parametric systems as well as time-invariant systems, for the parameter estimation is performed at each fixed time along the iteration. Finally, no usage of acceleration signal and no in version of estimated inertia matrix in the parameter estimator makes these learning control schemes more feasible.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.9
• /
• pp.1021-1030
• /
• 1992

When using a least squares estimator with exponential forgetting factor to identify continuous-time deterministic system, the problem of determining minimum eigenvalue is described in this paper. It is well known fact that the convergence rate of parameter estimates relies on various factors consisting of the estimator and especially, theirproperties can be directly affected by all eigenvalues in the parameter error differential equation. Fortunately, there exists only one adjusting eigenvalue in the given estimator and then, the parameter convergence rates depend on this minimum eigenvalue. In this note, a new result to determine the minimum eigenvalue is proposed. Under the assumption that the input has as many spectral lines as the number of parameter estimates, it can be proven that the minimum eigenvalue converges to a constant value, which is a function of the forgetting factor and the parameter estimates number.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.9
• /
• pp.1171-1180
• /
• 1995

In this paper, we present a 3-D object recognition system in which the 3-D Hough transform domain is employed to represent the 3-D objects. In object modeling step, the features for recognition are extracted from the CAD models of objects to be recognized. Since the approach is based on the CAD models, the accuracy and flexibility are greatly improved. In matching stage, the sensed image is compared with the stored model, which is assumed to yield a distortion (location and orientation) in the 3-D Hough transform domain. The high dimensional (6-D) parameter space, which defines the distortion, is decomposed into the low dimensional space for an efficient recognition. At first we decompose the distortion parameter into the rotation parameter and the translation parameter, and the rotation parameter is further decomposed into the viewing direction and the rotational angle. Since we use the 3-D Hough transform domain of the input images directly, the sensitivity to the noise and the high computational complexity could be significantly alleviated. The results show that the proposed 3-D object recognition system provides a satisfactory performance on the real range images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1B
• /
• pp.17-24
• /
• 2008

The effect of the variable packet size on the LRD characteristic of the MMPP traffic model is investigated. When we generate packet traffic for the performance evaluation of IP packet network, MMPP model can be used to generate packet interarrival time. And a random length of packet size from a certain distribution can be assigned to each packet. However, there is a possibility that the variable packet size might change the LRD characteristic of the original MMPP model. In this study, we investigate this possibility. For this purpose the 'refined traffic' is defined, where packet arrival time is generated according to the MMPP model and a random packet length from a specific distribution is assigned to each generated packet. Hurst parameter of the refined traffic is estimated and compared with the original Hurst parameter, which is the input parameter of the MMPP model. We also investigate the effect of the packet size distribution on the queueing performance of the MMPP traffic model and the relationship between the Hurst parameter and queueing performance.