• Journal of electromagnetic engineering and science
• /
• v.11 no.2
• /
• pp.133-142
• /
• 2011

Coded cooperation that integrates channel coding in cooperative transmission has gained a great deal of interest in wireless relay networks. The performance analysis of coded cooperation protocol with multiple relays is investigated in this paper. We show that the diversity order achieved by the coded cooperation in a multi-relay wireless network is not only dependent on the number of cooperating relays but is also dependent on the code-rate of the system. We derive the code-rate bound, which is required to achieve the full diversity gain of the order of cooperating nodes. The code-rate required to achieve full diversity is a linearly decreasing function of the number of available relays in the network. We show that the instantaneous channel state information (CSI)-based relay selection can effectively alleviate this code-rate bound. Analysis shows that the coded cooperation with instantaneous CSI-based relay selection can achieve the full diversity, for an arbitrary number of relays, with a fixed code-rate. Finally, we develop tight upper bounds for the bit error rate (BER) and frame error rate (FER) of the relay selection based on coded cooperation under a Rayleigh fading environment. The analytical upper bounds are verified with simulation results.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.162-172
• /
• 1999

For VBR video traffic, Motion-Picture Experts Group(MPEG) coding algorithm was adopted as the standard coding algorithm by International Telecommunication Union(ITU). In this paper, we propose a traffic model of an MPEG coded video traffic in frame level and cell level, and develop an approximate model for evaluating performance of a ATM multiplexer with homogeneous MPEG video sources by considering burst-level variation of aggregated traffics. For homogeneous MPEG video traffics which are frame-synchronized, the performance of the ATM multiplexer is influenced by source correlation at the multiplexing time. When sources are highly correlated, we decompose the aggregated cell streams by the frame-type and model multiplexing process during a frame time as n*D/D/1/K queueing model and suggest an approximate method for obtaining CLP of the ATM multiplexer. In the case that sources are highly correlated, the solution has the meaning of the upper bounds of performance of the ATM multiplexer. For the verification of our model, we compare the solution of our model with simulation resets. As the number of sources increases. The CLP obtained from our model approaches to simulation results, and gives upper bounds of simulation results.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.107.6-107
• /
• 2001

Genetic alogorithm(GA) is a well-known global optimization algorithm. However, as the searching bounds grow wider., performance of local optimization deteriorates. In this paper, we propose a hybrid algorithm which integrates the gradient algorithm and GA so as to reinforce the performance of local optimization. We apply this algorithm to the system identification of second order RLC circuit. Identification results show that the proposed algorithm gets the better and robust performance to find the exact values of RLC elements.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.1085-1090
• /
• 1989

In this paper, an adaptive control method is presented to guarantee the ultimate boundedness of uncertain systems with partially known uncertainty bounds. This method, with a conventional linear compensator, is used to improve the performance of the trajectory tracking of a robotic manipulator with uncertainties. The proposed method is simulated under several different environments, and its performance is compared with the computed torque method. The simulation results show that the proposed method is well suited for high-performance operation of uncertain robotic systems.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.60-65
• /
• 1991

In this paper, robust controllers which guarantee the stability and the quadratic performance in the presence of the state and the input matrix uncertainties are presented. Modified quadratic performance indices which include the model uncertainties are proposed for continuous and discrete time linear systems. And it is shown that the solution of the proposed optimal performance problem is the robust controller.

• Geotechnical Engineering
• /
• v.2 no.3
• /
• pp.67-78
• /
• 1986

This paper presents how to determine the system reliability of a typical shallow foundation constituted four potential correlated failure modes of hearing capacity (BCM), consolidation settlement (CSM), moment (MFM), and tension shear (PCM). Through the idenfication of the distinct and different modes and evaluation of range of system reliability, the obtained conclusions are as follows; 1. The CSM and the PCM are the lowest and highest of reliability indices of single performance function, and the BCM and the MFM are medium of them. 2. For the correlated failure modes, the hi-modal bounds Is narrower and lower of failure probability than the unimodal bounds. Not to be overestimated, therefore, the system reliability should be based on the second-order bounds using correlated performance functions.

• Journal of the Society of Naval Architects of Korea
• /
• v.40 no.5
• /
• pp.1-9
• /
• 2003

To predict the powering performance of full scale ships from the towing tank tests, resistance, propeller open water and self-propulsion tests are conducted. Model tests inevitably include the experimental error defined as the sum of two types of uncertainties, bias and precision errors. The induced errors in each element of model test are propagated through various routes and correlated with one another. The correlation coefficients are very important in the uncertainty analysis. The coefficient gives a direction(increase or decrease) for a value of error in individual elements. If the coefficient is not used accurately, the error bounds of the individual elements are overestimated or underestimated. In this study, the new methodology is applied to the uncertainty analysis of HMRI's towing tank tests, thus error bounds of each element is suggested and verified by several repetitive experiments.

• Journal of Korean Society for Quality Management
• /
• v.35 no.2
• /
• pp.99-105
• /
• 2007

Most of systems used in real fields are considered as multistate systems with multistate components. As one of methods for performance evaluation of the system, reliability analysis has been popularly used. In this paper, we propose an improved reliability analysis method which is based on state space decomposition method of Aven (1985). In deriving upper bounds, our method uses sets of unspecified states whereas Aven (1985) excludes sets of unacceptance states. Also, closer lower bounds to an exact reliability are obtained by considering of importance of min-path vectors.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.21-31
• /
• 1998

Ordering is used to reduce the amount of fill-ins in the Cholesky factor of an symmetric definite matrix. One of most efficient ordering methods is the minimum degree ordering method. In this paper. we propose the two techniques to improve the performance of the minimum degree ordering which are implemented using clique storage structure. One is node absorption which is a generalized version of clique absorption. The other technique is using the lower bounds of degree to suspend the degree updates of nodes. finally, we provide computational results on the problems on NETLIB. These results show that the proposed techniques reduce the number of degree updates and the computational time considerably.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.71-77
• /
• 2009

Using the results of the expected busy periods for the dyadic Min(N, D) and Max(N, D) operating policies in a controllable M/G/1 queueing model, an important relation between them is derived. The derived relation represents the complementary property between two operating policies. This implies that it could be possible to obtained desired system characteristics for one of the two operating policies from the corresponding known system characteristics for the other policy. Then, upper and lower bounds of expected busy periods for both dyadic operating policies are also derived.