• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2646-2648
• /
• 2002

This paper deals with a comparative evaluation of the reliability of control rod drive mechanisms including their driving methods for nuclear power plants. Basically there exist two types of electromagnetic-jack-type drive mechanisms in commercial use that are called as Control Rod Drive Mechanism and Control Element Drive Mechanism. Each type has corresponding drive sequence to make the movements of insertion and withdrawal. A state-space model is derived for each model graphically. Then the evaluation of the reliability is carried out on the programming tool called SHARPE. The evaluation does not give any meaningful numerical values for the reliability but just shows a relative degree to each other in view of reliability.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2003.05b
• /
• pp.90-95
• /
• 2003

For the safety driving of an automobile which is become individual requisites, a new Neural Network algorithm which recognized the load vehicles in real time is proposed. The proposed neural network technique is the real time computation method through the inter-node diffusion. In the network, a node corresponds to a state in the quantized input space. Each node is composed of a processing unit and fixed weights from its neighbor nodes as well as its input terminal. The most reliable algorithm derived for real time recognition of vehicles, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates. Through several simulation experiments, real time reconstruction of the nonlinear image information is processed. 1-D LIPN hardware has been composed and various experiments with static and dynamic signals have been implemented.

• ETRI Journal
• /
• v.34 no.2
• /
• pp.288-291
• /
• 2012

In this letter, a new online anomaly detection approach for software systems is proposed. The novelty of the proposed approach is to apply a new semantic kernel function for a support vector machine (SVM) classifier to detect fault-suspicious execution paths at runtime in a reasonable amount of time. The kernel uses a new sequence matching algorithm to measure similarities among program execution paths in a customized feature space whose dimensions represent the largest common subpaths among the execution paths. To increase the precision of the SVM classifier, each common subpath is given weights according to its ability to discern executions as correct or anomalous. Experiment results show that compared with the known kernels, the proposed SVM kernel will improve the time overhead of online anomaly detection by up to 170%, while improving the precision of anomaly alerts by up to 140%.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.415-416
• /
• 2006

In this paper, we proposed a new coding technique of digital hologram video using 3D scanning method and video compression technique. The proposed coding consists of capturing a digital hologram to separate into RGB color space components, localization by segmenting the fringe pattern, frequency transform using $M{\tiems}N$ (segment size) 2D DCT (2 Dimensional Discrete Cosine Transform) for extracting redundancy, 3D scan of segment to form a video sequence, motion compensated temporal filtering (MCTF) and modified video coding which uses H.264/AVC.

• East Asian mathematical journal
• /
• v.28 no.3
• /
• pp.265-280
• /
• 2012

In this paper, we introduce an iterative sequence by using a hybrid generalized $f$-projection algorithm for finding a common element of the set of fixed points of a relatively weak nonexpansive mapping an the set of solutions of a generalized variational inequality in a Banach space. Our results extend and improve the recent ones announced by Y. Liu [Strong convergence theorems for variational inequalities and relatively weak nonexpansive mappings, J. Glob. Optim. 46 (2010), 319-329], J. Fan, X. Liu and J. Li [Iterative schemes for approximating solutions of generalized variational inequalities in Banach spaces, Nonlinear Analysis 70 (2009), 3997-4007], and many others.

• Proceedings of the Korean Institute of Interior Design Conference
• /
• 2001.05a
• /
• pp.90-94
• /
• 2001

This study hypothesizes that the imageability of a particular environments is decided by the unity of each visual sequences. We selected Ch'angdok Palace as our subject due to its greater applicability for image construction among various Korean architectures and their street furnitures. we apply the analytical methods of formal aesthetics and symbolic aesthetics to Ch'angdok Palace's space compositional characteristics, we can find distinctive features. The conclusions are that Ch'angdok Palace contains high probability of imageability through the contrast and harmony of two themes, reality and the ideal, and the rational and the emotional.

• ETRI Journal
• /
• v.26 no.5
• /
• pp.405-412
• /
• 2004

MC-CDMA, a multicarrier (MC) modulation scheme based on code division multiple access (CDMA), is the most likely candidate for the next generation of mobile radio communications. The rate compatible punctured turbo (RCPT) coded hybrid automatic repeat request (HARQ) has been found to give improved throughput performance in a direct sequence (DS) CDMA system. However, the extent to which the RCPT HARQ improves the throughput performance of an MC-CDMA system has not been fully understood. In this paper, we apply the RCPT HARQ to MC-CDMA and evaluate by computer simulations its performance in a frequency selective Rayleigh fading channel. We found that the performance of RCPT HARQ MC-CDMA is almost insensitive to channel characteristics. The performance can be drastically improved with receive diversity combined with space-time transmit diversity. In addition, the comparison of RCPT HARQ MC-CDMA, orthogonal frequency division multiplexing, and DS-CDMA shows that under similar conditions the throughput of MC-CDMA is the best in a frequency selective fading channel.

• Kyungpook Mathematical Journal
• /
• v.51 no.4
• /
• pp.365-374
• /
• 2011

Related fixed point theorems on two or three metric spaces have been prove in different ways. However, so for the related fixed point theorem on fuzzy metric space have not been proved. Sharma, Deshpande and Thakur were the first who have establishe related fixed point theorem for four mappings on two complete fuzzy metric spaces. Their work was maiden in this line. In this paper we obtain a related fixed point theorem for six mappings on three complete fuzzy metric spaces. Of course this is a new result on this line.

• Journal of the Korea Computer Graphics Society
• /
• v.9 no.3
• /
• pp.15-21
• /
• 2003

An algorithm is developed for augmenting a real video with virtual graphics objects without computing Euclidean information. Real motion of the camera is obtained in affine space by a direct linear method using image matches. Then, virtual camera is provided by determining the locations of four basis points in two input images as initialization process. The four pairs of 2D location and its 3D affine coordinates provide Euclidean orthographic projection camera through the whole video sequence. Our method has the capability of generating views of objects shaded by virtual light sources, because we can make use of all the functions of the graphics library written on the basis of Euclidean geometry. Our novel formulation and experimental results with real video sequences are presented.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2001.11a
• /
• pp.46-51
• /
• 2001

For Fast Real-time Recognition of Nonlinear Error Data, a new Neural Network algorithm which recognized the map in real time is proposed. The proposed neural network technique is the real time computation method through the inter-node diffusion. In the network, a node corresponds to a state in the quantized input space. Each node is composed of a processing unit and fixed weights from its neighbor nodes as well as its input terminal. The most reliable algorithm derived for real time recognition of map, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates. Through several simulation experiments, real time reconstruction of the nonlinear map information is processed.