• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.163-167
• /
• 2008

This paper presents the analysis of tactile effects on different body parts according to the various vibration patterns. The experiments use a vibration pad made of 16 vibration elements in the form of $4{\times}4$ array. The vibration elements are controlled by a 8-bit microprocessor. The sound of gunshot initiates a vibration pattern on different body parts and its sensitivity is measured. The analysis of the experiments lead us to conclude that the vibration pad is the most realistic interface for shooting games and the shoulder part is the most sensitive part in the body. In addition, the most effective vibration pattern is the for the pattern which gives the sensation of spreading out from the center to the outside. This study analyzes the relationship between the human body parts and the tactile sensations by the various vibration patterns. The result of this study will be a good reference for user studies in the field of haptics based on the vibration.

• The Journal of the Korea Contents Association
• /
• v.2 no.3
• /
• pp.96-104
• /
• 2002

This paper has done a network performance test as well as result analysis of the test in a real campus gigabit network The inner network backbone consists of gigabit ethernet . The mean ratio of network use is below 1% age, and the maximum one comes to 10%. The floating capacity is still good enough to meet network flowing because the mean ratio of inner campus network as outer ones is 30.4% and the maximum one is merely 38.3%. But there appears a security problem. We must make a device blocking illegal approach to the client form outer network It is important that we can a away to manage the campus gigabit network efficiently on the basis of the given data from this performance test.

• Journal of Broadcast Engineering
• /
• v.5 no.2
• /
• pp.227-238
• /
• 2000

This paper, at first, provides analysis on loss pattern of Internet based on real experiments of the current Internet. Then, we propose an effective adaptive QoS management technique, in which measured loss pattern as well as PLR (Packet Loss Ratio) are used to select titrate of temporal scalability. level of FEC and retransmission This selection is also incorporated to the MPEG-4 error resilience tools and error concealment techniques. In order to minimize effect of packet loss, multimedia stream is segmented in the unit of group of Pictures (GOP) and interleaving and FEC are applied to the segment. Proposed algorithms are applied to build a VOD system.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.1-5
• /
• 2001

A new approach for determining global threshold value for image binarization is proposed in this paper. In the proposed algorithm, bit-plane information which involve the shapes of original image is used for dividing image into two parts object and background, and then compared each average values. Optimal threshold value are selected in center of two averages. Proposed method is relatively simple but robust and achieved good results in continuous tone images and document image.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.4
• /
• pp.499-504
• /
• 2002

In this paper, we analyzed the performance of FH/CPFSK system with differential detection in thermal noise, partial-band jamming noise and adjacent interference of all eight bit pattern. The parameters to analize performances of FH/CPFSK system have been used the bit rate, modulation index and performances of FH/CPFSK system with the differential detector have been presented with the optimum correlation function. And, we were compared with performance of FH/CPFSK and FH/BFSK system. In result, we could know that bit error probability of the approximation equation and exact equation nearly accorded in the high signal-to-noise ratio. And, we have been proved that FH/CPFSK system with differential detection according to jamming fraction ${\gamma}$ was worst to 3dB than FH/CPFSK system with limiter-discriminator. but was superior to 2dB than FH/BFSK.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.503-510
• /
• 2005

With the increasing importance of network protection from cyber threats, it is requested to develop a multi-gigabit rate pattern matching method for protecting against malicious attacks in high-speed network. This paper devises a high-speed pattern matching algorithm with TCAM by using an m-byte jumping window pattern matching scheme. The proposed algorithm significantly reduces the number of TCAM lookups per payload by m times with the marginally enlarged TCAM size which can be implemented by cascading multiple TCAMs. Due to the reduced number of TCAM lookups, we can easily achieve multi-gigabit rate for scanning the packet payload. It is shown by simulation that for the Snort nile with 2,247 patterns, our proposed algorithm supports more than 10 Gbps rate with a 9Mbit TCAM.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.12
• /
• pp.111-121
• /
• 2014

In this paper, we propose tree-based hybrid query tree architecture utilizing time slot. 4-Bit Pattern Slot Allocation(4-SL) has a 8-ary tree structure and when tag ID responses according to query of the reader, it applies a digital coding method, the Manchester code, in order to extract the location and the number of collided bits. Also, this algorithm can recognize multiple Tags by single query using 4 fixed time slots. The architecture allows the reader to identify 8 tags at the same time by responding 4 time slots utilizing the first bit($[prefix+1]^{th}$, F ${\in}$ {'0' or '1'}) and bit pattern from second ~ third bits($[prefix+2]^{th}{\sim}[prefix+3]^{th}$, $B_2{\in}$ {"00" or "11"}, $B_1{\in}$ {"01" or "10"}) in tag ID. we analyze worst case of the number of query nodes(prefix) in algorithm to extract delay time for recognizing multiple tags. The identification delay time of the proposed algorithm was based on the number of query-responses and query bits, and was calculated by each algorithm.

• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.526-539
• /
• 2012

This paper proposes a high capacity data hiding method using high frequence secret data indexing algorithm. Many novel data hiding methods based on LSB and PVD methods were presented to enlarge hiding capacity and provide an imperceptible quality. In this paper, first, calculating data iteration frequency of the secret message and make up the high frequency data index matrix (HFDT) using high frequence data's location information. Next, HFDT uses to that data hiding process on the cover image and recovering process on the stego image. The experimental results demonstrate the efficiency of the proposed high frequency secret data indexing method. For the data hiding method, experiments are conducted for four cases: 2 pattern secret data (2PD), 4 pattern secret data (4PD), 8 pattern secret data (8PD) and higher pattern secret data (HPD). When comparing the proposed method with other data hiding methods, for the HPD case, the results show that the proposed method has a good PSNR and more capacity, and for the other case, the results show that the proposed method has a higher PSNR and larger capacity.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.1
• /
• pp.28-37
• /
• 1999

In this paper. we developed a delay test architecture and test procedure for clocked 5-bit asynchronous counter circuit based on boundary scan architecture. To develope, we analyze the problems of conventional method on delay test for clocked sequential circuit in boundary scan architecture. This paper discusses several problems of delay test on boundary scan architecture for clocked sequential circuit. Conventional test method has some problems of improper capture timing, of same pattern insertion, of increase of test time. We suggest a delay test architecture and test procedure, is based on a clock count-generation technique to generate continuous clocks for clocked input of CUT. The simulation results or 5-bit counter shows the accurate operation and effectiveness of the proposed delay test architecture and procedure.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.1
• /
• pp.105-115
• /
• 2007

Data mining extracts interesting knowledge from a large database. Among numerous data mining techniques, research work is primarily concentrated on clustering and association rules. The clustering technique of the active research topics mainly deals with analyzing spatial and attribute data. And, the technique of association rules deals with identifying frequent patterns. There was an advanced apriori algorithm using an existing bit-clustering algorithm. In an effort to identify an alternative algorithm to improve apriori, we investigated FP-Growth and discussed the possibility of adopting bit-clustering as the alternative method to solve the problems with FP-Growth. FP-Growth using bit-clustering demonstrated better performance than the existing method. We used chess data in our experiments. Chess data were used in the pattern mining evaluation. We made a creation of FP-Tree with different minimum support values. In the case of high minimum support values, similar results that the existing techniques demonstrated were obtained. In other cases, however, the performance of the technique proposed in this paper showed better results in comparison with the existing technique. As a result, the technique proposed in this paper was considered to lead to higher performance. In addition, the method to apply bit-clustering to GML data was proposed.