• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.2
• /
• pp.109-118
• /
• 2012

As a result of the prevalence of smartphone, various mobile services became faster by LTE networks. Because many mobile devices are used more wireless services, heavy signaling traffic for authentication could be generated. Authentication is an important factor in wireless networks to identify devices; it is the start of wireless networks. This paper analyzes previous patterns for more effective authentication in accessing of another external networks. We propose a fast authentication scheme for minimizing of signaling cost between the authentication server and external networks. And we calculate the rate of authentication occurrence in LTE networks using mathematical modeling as well as the change of signaling cost for authentication in various network environments. Finally, we calculate the optimized number of authentication data and show the effectiveness for authentication signaling costs.

• The KIPS Transactions:PartA
• /
• v.19A no.3
• /
• pp.161-168
• /
• 2012

The study of Cloud based system is emerging to become the core technology in IT field due to the tremendous growth of Cloud Computing. Researches to deliver applications to Thin-Client based mobile virtual machine and Desktop as a Service(DaaS) using Cloud Computing are conducted actively. In this paper, we propose a Cloud system to run the mobile application in the mobile Thin-Client device and resource allocation mechanism Dynamic Resource Allocation Manager for Mobile Application(DRAMMA). Thus, through performance check, we show DRAMMA has improved the utilization of Cloud system, less migration of virtual machines and decreased the error rate of resource allocation. Also our proposed system delivers service more efficiently than the previous resource allocation algorithm.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.11
• /
• pp.529-536
• /
• 2015

When rendering both three-dimensional objects and photo images together, the non-photorealistic rendering results are in visual discord since the two contents have their own independent color distributions. This paper proposes a non-photorealistic rendering technique which renders both three-dimensional objects and photo images such as cartoons and sketches. The proposed technique computes the color distribution property of the photo images and reduces the number of colors of both photo images and 3D objects. NPR is performed based on the reduced colormaps and edge features. To enhance the natural scene presentation, the image region segmentation process is preferred when extracting and applying colormaps. However, the image segmentation technique needs a lot of computational operations. It takes a long time for non-photorealistic rendering for large size frames. To speed up the time-consuming segmentation procedure, we use GPGPU for the parallel computing using the GPU. As a result, we significantly improve the execution speed of the algorithm.

• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.407-416
• /
• 2009

To support an efficient management of software verification and validation activities, much research has been conducted to predict defects in early phase. And defect prediction models have been proposed to predict defects. But the generality of the models has not been experimentally studied for other software system. In other words, most of prediction models were applied only to the same system that had been used to build the prediction models themselves. Therefore, we performed an experiment to explore generality of major prediction models. In the experiment, we applied three defects prediction models to three different systems. As a result, we cannot find their generality of defect prediction capability. The cause is analyzed to result from a different metric distribution between the systems.

• Smart Media Journal
• /
• v.4 no.3
• /
• pp.50-55
• /
• 2015

In this paper, we present background modeling method based on Gaussian mixture model to subtract background for night-time video surveillance. In night-time video, it is hard work to distinguish the object from the background because a background pixel is similar to a object pixel. To solve this problem, we change the pixel of input frame to more advantageous value to make the Gaussian mixture model using scaled histogram stretching in preprocessing step. Using scaled pixel value of input frame, we then exploit GMM to find the ideal background pixelwisely. In case that the pixel of next frame is not included in any Gaussian, the matching test in old GMM method ignores the information of stored background by eliminating the Gaussian distribution with low weight. Therefore we consider the stacked data by applying the difference between the old mean and new pixel intensity to new mean instead of removing the Gaussian with low weight. Some experiments demonstrate that the proposed background modeling method shows the superiority of our algorithm effectively.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.421-428
• /
• 2005

A new method of Semi-fragile image watermarking which ensures the integrity of the contents of digital image is presented. Proposed watermarking scheme embeds watermark in the form of quantization noise on the wavelet transform coefficients in a specific mid frequency subbands selected from a wavelet packet decomposition based on energy distribution of wavelet transform coefficients. By controlling the strength of embedded watermark using HVS (Human Visual System) characteristic, it is imperceptible by a human viewer while robust against non-malicious attack such as compression for storage and/or transmission. When an attack is applied on the original image, it is highly probable that wavelet transform coefficients not only at the exact attack positions but also the neighboring ones are modified. Therefore, proposed authentication method utilizes whether both current coefficient and its neighbors are damaged. together. So it can efficiently detect and accurately localize attacks inflicted on the content of original image. Decision threshold for authentication can be user controlled for different application areas as needed.

• Journal of Power Electronics
• /
• v.11 no.5
• /
• pp.759-766
• /
• 2011

This paper focuses on monitoring and predicting the short circuit faults of the rotor windings of large turbo-generator systems. For the purpose of increasing efficiency and decreasing maintenance cost, a method that combines the HHT (Hilbert Huang Transform) with a wavelet has been studied. This method is based on analyzing a classical Albright detecting coil. Due to the Empirical Mode Decomposition (EMD) and the Intrinsic Mode Functions (IMF) of the HHT the exact location of a short circuit of rotor windings may be given. However, a part of the useful information is eliminated by the unreasonable decomposing scale of the wavelet. Based on the thermodynamics modeling method, this study was illustrated with a 50MW turbo-generator system that is installed in Northern China. The analysis results, which have very good agreement with those of a previous study, show that the method of combining the HHT with a wavelet is an effective way to analyze and predict the short circuit faults of the rotor windings of large generators, such as supercritical turbo-generator systems and wind turbo-generator systems. This work can offer a useful reference for analyzing smart grids by improving the power quality of a distribution network that is supplied by a turbo-generator system.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.865-874
• /
• 2002

HTTP (HyperText Transfer Protocol) is a transfer protocol used by the World Wide Web distributed hypermedia system to retrieve the objects. Because HTTP is a connection oriented protocol, it uses TCP (Transmission control Protocol) as a transport layer. But it is known that HTTP interacts with TCP badly. it is discussed about factors affecting the performance or HTTP over TCP, the transaction time obtained by the per-transaction TCP connections for HTTP access and the TCP slow-start overheads, and the transaction time for T-TCP (Transaction TCP) which is one or methods improving the performance or HTTP over TCP. Average waiting time and average turnaround time are important parameters to satisfy QoS (Quality of Service) of end users. Formulas for calculating two parameters are derived. Such formulas can be used for the environment in which each TCP or T-TCP transaction time is same or different. Some experiments and computational experiences indicate that the proposed formulas are well acted, can be applied to the environment which the extension of bandwidth is necessary, and time characteristics of T-TCP are superior to that of TCP. Also, the load distribution method of web server based on the combination of bandwidths is discussed to reduce average waiting time and average turnaround time.

• The KIPS Transactions:PartD
• /
• v.11D no.6
• /
• pp.1269-1276
• /
• 2004

The Parameter Estimation for software existing reliability models, Goel-Okumoto, Yamada-Ohba-Osaki model was reviewed and Rayleigh model based on Rayleigh distribution was studied. In this paper, we discusses comparison of parameter estimation using maximum likelihood estimator and Bayesian estimation based on Gibbs sampling to analysis of the estimator' pattern. Model selection based on sum of the squared errors and Braun statistic, for the sake of efficient model, was employed. A numerical example was illustrated using real data. The current areas and models of Superposition, mixture for future development are also employed.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.775-782
• /
• 2005

In this paper, we propose multicast technique in order to reduce the required network bandwidth by n times, by merging the adjacent multicasts depending on the number of HENs (Head-End-Nodes) n that request the same video. Allowing new clients to immediately join an existing multicast through patching improves the efficiency of the multicast and offers services without any initial latency. A client might have to download data through two channels simultaneously, one for multicast and the other for patching. The more the frequency of requesting the video is, the higher the probability of caching it among HENs increases. Therefore, the requests for the cached video data can be served by HENs. Multicast from server is generated when the playback time exceeds the amount of cached video data. Since the interval of multicast can be dynamically expanded according to the popularity of videos, it can be reduced the server's workload and the network bandwidth. We perform simulations to compare its performance with that of conventional multicast. From simulation results, we confirm that the Proposed multicast technique offers substantially better performance.