• Journal of Internet Computing and Services
• /
• v.18 no.5
• /
• pp.23-30
• /
• 2017

For enjoying the convenience provided by location based services, the user needs to submit his or her location and query to the LBS server. So there is a probability that the untrusted LBS server may expose the user's id and location etc. To protect user's privacy so many approaches have been proposed in the literature. Recently, the approaches about using dummy are getting popular. However, there are a number of things to consider if we want to generate a dummy. For example, when generating a dummy, we have to take the obstacle and the distance between dummies into account so that we can improve the privacy level. Thus, in this paper we proposed an efficient dummy generation algorithm to achieve k-anonymity and protect user's privacy in LBS. Evaluation results show that the algorithm can significantly improve the privacy level when it was compared with others.

• Analytical Science and Technology
• /
• v.6 no.1
• /
• pp.39-45
• /
• 1993

We have examined Raman spectra of cis-peptide model complex, diketopiperazine in water and $D_2O$ with 320 nm through 218 nm excitation. Our study examines assignment of the resonance enhanced amide vibrations and characterizes their enhancement mechanism. Three resonance enhaned cis-peptide marker bands were observed in aqueous solution at 1676, 1533 and $806cm^{-1}$, which were assigned to the cis-amide I, II and S band, respectively. The $1533cm^{-1}$ amide II band, which is almost pure C-N stretching, was most dominant in water and shifted to $1520cm^{-1}$ upon N-deuteration. This band will be probably a potential probe band for cis-peptide moieties in proteins. The excitation profile data and an Albrecht A-term fit indicated that the cis-peptide vibrations derive their intensities from the 188 nm cis-peptide ${\pi}-{\pi}^*$ electronic transition. We Propose that the geometry of cis-peptide ${\pi}^*$ excited state is C-N bond displacement relative to that of electronic ground state.

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.557-567
• /
• 2015

Over the past decades, a variety of spatial saliency methods have been introduced. Recently, motion saliency has gained much interests, where motion data estimated from an image sequence are utilized. In general, motion saliency requires reliable motion data as well as image segmentation for producing satisfactory saliency map which poses difficulty in most natural images. To overcome this, we propose a motion-based saliency generation that enhances the spatial saliency based on the combination of spatial and motion saliencies as well as motion complexity without the consideration of complex motion classification and image segmentation. Further, an affinity model is integrated for the purpose of connecting close-by pixels with different colors and obtaining a similar saliency. In experiment, we performed the proposed method on eleven test sets. From the objective performance evaluation, we validated that the proposed method produces better result than spatial saliency based on objective evaluation as well as ROC test.

• Journal of Broadcast Engineering
• /
• v.21 no.2
• /
• pp.252-260
• /
• 2016

The performance of human detection system is affected by camera location and view angle. In 2D image acquired from such camera settings, humans are displayed in different sizes. Detecting all the humans with diverse sizes poses a difficulty in realizing a real-time system. However, if the size of a human in an image can be predicted, the processing time of human detection would be greatly reduced. In this paper, we propose a method that estimates human size by constructing an indoor scene in 3D space. Since the human has constant size everywhere in 3D space, it is possible to estimate accurate human size in 2D image by projecting 3D human into the image space. Experimental results validate that a human size can be predicted from the proposed method and that machine-learning based detection methods can yield the reduction of the processing time.

• Journal of Elementary Mathematics Education in Korea
• /
• v.15 no.1
• /
• pp.77-93
• /
• 2011

Jisuguimundo(地數龜文圖) is a magic hexagon created by Suk-Jung Choi in his book about three hundreds years ago in Korea. Recently attention is focused on jisuguimundo, and it is known that jisuguimundos exist when magic number is from 77 to 108, however a general method making jisuguimundos is not known so far. Up to now, methods of making jisuguimundos using computers are known. In this study, a method making jisuguimundos is suggested using pairs of two numbers with sum p and q ($p{\neq}q$) alternately when magic number is from 88 to 92, and from 94 to 98, without using computer in elementary math class as a task for problem solving. Mathematical theory is introduced for this method, and jisuguimundos are presented which are found out through this method. Elementary students are expected to make their own jisuguimundo using this method.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2011.04a
• /
• pp.419-423
• /
• 2011

Unlike other non-destructive inspection method, AE Structural defects that are likely to grow in the operation status can be detected, and the advantage of being due to the continuous monitoring of large structures has been widely used to evaluate the stability. AE sensor used to detect sound wave that occurs between 20kHz to 20MHz. and Sound wave result may vary depending on sensor's sensitivity. In this paper, Tensile test conducted on STS 304 and SS400, and tries to detect the crack signal. In tensile test, specimens were conducted using different sensor sensitivity to the same tensile test condition. The crack signal parameters divided into 4 types of communities by conducting cluster analysis. It was demonstrated that crack signal of two sensor is not different by statistical analysis of null hypotheses. Based on the results, waveform of this tension test is crack signal.

• Journal of the Korean Chemical Society
• /
• v.13 no.4
• /
• pp.355-364
• /
• 1969

Cross-hybridizations between DNA of two pseudomonads and a xanthomonad suggested that the three DNA types had a considerable section in common. The existence of this common part was proved by hybridization of preselected DNA, i.e. DNA resulting from a previous hybridization between any one set of two DNA types, with the third type. It was thus shown that about 50% of the DNA of the three organisms was similar. This common part was isolated in pure state and its % (G+C) was found to be indentical to the overall base composition of the native DNA. The evolutionary drift in % (G+C) could thus not be detected. The total molecular weight of the chromosornal DNA/bacterial nucleoid was determined to be 2.4 ${\times} 10^9$daltons. It can therefore be estimated that the common putida-fluorescenspelargonii DNA part consists of some 2,000 cistrons. P. putida and P. fluorescens share an additional 1,300 cistrons, and all xanthomonads share at least an additional 1,000 cistrons.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.497-508
• /
• 2016

With a cloud storage service, data owners can easily access their outsourced data in cloud storage on different devices and at different locations, and can share their data with others. However, as the users no longer physically have possession of their outsourced data and the cloud still facing the existence of internal/external threats, the task of checking the data integrity is formidable. Over recent years, numerous schemes have been proposed to ensure data integrity in an untrusted cloud. However, the existing public auditing schemes use a third-party auditor(TPA) to execute high computation to check data integrity and may still face many security threats. In this paper, we first demonstrate that the scheme proposed by Zhang et al. is not secure against our two threat models, and then we propose a self-certified public auditing scheme to eliminate the security threats and guarantee a constant communication cost. Moreover, we prove the securities of our public auditing scheme under three security models.

• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1495-1502
• /
• 2015

Data compression involves a trade-off between delay time and data size. Greater delay times require smaller data sizes and vice versa. There have been many studies performed in the field of wireless sensor networks on increasing network life cycle durations by reducing data size to minimize energy consumption; however, reductions in data size result in increases of delay time due to the added processing time required for data compression. Meanwhile, as energy generation occurs periodically in solar energy-based wireless sensor networks, redundant energy is often generated in amounts sufficient to run a node. In this study, this excess energy is used to reduce the delay time between nodes in a sensor network consisting of solar energy-based nodes. The energy threshold value is determined by a formula based on the residual energy and charging speed. Nodes with residual energy below the threshold transfer data compressed to reduce energy consumption, and nodes with residual energy above the threshold transfer data without compression to reduce the delay time between nodes. Simulation based performance verifications show that the technique proposed in this study exhibits optimal performance in terms of both energy and delay time compared with traditional methods.

• The Journal of the Korea Contents Association
• /
• v.12 no.6
• /
• pp.9-20
• /
• 2012

In computer vision, it is very important to obtain reliable corresponding feature points. However, we know it is not easy to find the corresponding feature points exactly considering by scaling, lighting, viewpoints, etc. Lots of SIFT methods applies the invariant to image scale and rotation and change in illumination, which is due to the feature vector extracted from corners or edges of object. However, SIFT could not find feature points, if edges do not exist in the area when we extract feature points along edges. In this paper, we present a new placement method of marker to improve the performance of SIFT feature detection and matching between different view of an object or scene. The shape of the markers used in the proposed method is formed in a semicircle to detect dominant direction vector by SIFT algorithm depending on direction placement of marker. We applied De Bruijn sequence for the markers direction placement to improve the matching performance. The experimental results show that the proposed method is more accurate and effective comparing to the current method.