• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3A
• /
• pp.184-194
• /
• 2005

One of the most important factors that decide the overall performance of RFID system is anti-collision algorithm. By enhancing the anti-collision algorithm, we can increase the number of RFID tags that can be processed in unit time. Two anti-collision algorithms are most widely prevailed: one is ALOHA-based protocol and the other is a binary tree walking method, but these are still under research. In this paper, we suggest an anti-collision algorithm named AAC(Address Allocating and Calling) using pre-distributed random address, which is much faster and more efficient than existing ones. Finally, we evaluate our scheme using mathematical analysis and computer simulation.

• Journal of Korean Society of Rural Planning
• /
• v.14 no.3
• /
• pp.37-51
• /
• 2008

This study aims to build a model dealing with the location decision of new manufacturing firms and their land demand. The model is composed with 1) the binary logit model structure identifying a future probability of manufacturing firms to locate in a city and their land demand; and 2) the land use suitability of the land demand. The model was empirically tested in the case of Anseong City. We used establishment-level data for the manufacturing industry from the Report on Mining and Manufacturing Survey. 48 industry groups were scrutinized to find the location probability in the city and their land demand via logit model with the dependent variables: number of employment, land capital, building capital, total products, and value-added for a new industry since 2001. It is forecasted that the future land areas (to 2025) for the manufacturing industries in the city are $5.94km^2$ and additional land demand for clustering the existing industries scattered over the city is $2.lkm^2$. Five industrial complex locations were identified through the land use suitability analysis.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.470-471
• /
• 2018

This paper presents a design method for combinational digital logic systems using time domain based multiplexing and common multi-terminal extension decision diagrams. The proposed method can reduce the 1)hardware, 2)logic levels and 3)pins. In the logic system design, we use two types of decision diagrams(DDs), that is the common binary decision diagrams and CMTEDDs. Also, we propose an algorithms to derive common multiple-terminal binary decision diagrams from CBDDs, and CMTEDDs from CMTBDDs. The CMTEDDs over CBDDs is more compactness in terms of number of non-terminal nodes, where the nodes for output selection variables are not included in the non-terminal nodes. In the logic design, each non-terminal nodes of an CBDDs and an CMTEDDs is realized by a multiplexer(MUX). In addition, we compare the proposed TDBM realization with the conventional one.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9B
• /
• pp.1092-1097
• /
• 2011

An anti-collision protocol which tries to minimize the collision probability and identification time is the most important factor in all identification technologies. This paper focuses on methods to improve the efficiency of tag's process in identification systems. Our scheme, Binary Slotted Query Tree (BSQT) algorithm, is a memoryless protocol that identifies an object's ID more efficiently by removing the unnecessary prefixes of the traditional Query Tree (QT) algorithm. With enhanced QT algorithm, the reader will broadcast 1 bit and wait the response from the tags but the difference in this scheme is the reader will listen in 2 slots (slot 1 is for 0 bit Tags and slot 2 is for 1 bit Tags). Base on the responses the reader will decide next broadcasted bit. This will help for the reader to remove some unnecessary broadcasted bits which no tags will response. Numerical and simulation results show that the proposed scheme decreases the tag identification time by reducing the overall number of request.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.682-687
• /
• 2010

The IEEE 802.15.4a specification targets the low-rate (LR) Impulse-radio (IR) ultra-wideband (UWB) system which is now widely applied in the WPANs considering rather short distance communications with low complexity and power consumption. The physical (PHY) layer uses concatenated coding with mixed binary phase-shift keying and binary pulse-position modulation (BPSK-BPPM), and direct sequence spreading with time hopping in order that both coherent and non-coherent receiver architectures are supported. In this paper, the performances of multiple access schemes compliant with IEEE 802.15.4a specification are investigated with energy detection receiver, which allow avoiding the complex channel estimation needed by a coherent receiver. However, the performance of energy detection receiver is severely degraded by multi-user interference (MUI), which largely diminishes one of the most fascinating advantages of UWB, namely robustness to MUI as well as the possibility to allow parallel transmissions. So as to improve the performance of multiple access schemes, we propose to apply the novel TH sequences as well as to increase the number of TH positions. The simulation results show that our novel multiple access schemes significantly improve the performance against MUI.

• ETRI Journal
• /
• v.28 no.1
• /
• pp.51-58
• /
• 2006

In this paper, we propose a method of applying a lifting-based wavelet domain e-median filter (LBWDEMF) for image restoration. LBWDEMF helps in reducing the number of computations. An e-median filter is a type of modified median filter that processes each pixel of the output of a standard median filter in a binary manner, keeping the output of the median filter unchanged or replacing it with the original pixel value. Binary decision-making is controlled by comparing the absolute difference of the median filter output and the original image to a preset threshold. In addition, the advantage of LBWDEMF is that probabilities of encountering root images are spread over sub-band images, and therefore the e-median filter is unlikely to encounter root images at an early stage of iterations and generates a better result as iteration increases. The proposed method transforms an image into the wavelet domain using lifting-based wavelet filters, then applies an e-median filter in the wavelet domain, transforms the result into the spatial domain, and finally goes through one spatial domain e-median filter to produce the final restored image. Moreover, in order to validate the effectiveness of the proposed method we compare the result obtained using the proposed method to those using a spatial domain median filter (SDMF), spatial domain e-median filter (SDEMF), and wavelet thresholding method. Experimental results show that the proposed method is superior to SDMF, SDEMF, and wavelet thresholding in terms of image restoration.

• Journal of the Korean Chemical Society
• /
• v.58 no.6
• /
• pp.528-534
• /
• 2014

In some binary solution, closed miscibility loop of temperature-composition phase diagram occurs where both an upper critical solution temperature and a lower critical solution temperature exist. It is known that this phenomena occurs if specific interaction between molecules exists. There are several ways describing the specific interaction. In this work it is assumed that the total number of specific interactions is distributed according to binomial distribution. In this case, exact mathematical conditions for closed miscibility loop phase behavior are derived when the specific interaction is applied to regular solution theory, quasichemical theory and Flory-Huggins lattice theory. And we investigated the effect of parameters on the phase diagram. The phase diagram of water-nicotine is calculated and compared with experimental data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.6
• /
• pp.1288-1293
• /
• 2005

This paper presents a design method for multiple-output combinational digital logic systems using time domain based on multiplexing(TDBM) and common multi-terminal extension decision diagrams(CMTEDD). The CMIEDDs represents extension valued multiple-output functions, while TDBM systems transmit several signals on a single lines. The proposed method can reduce the 1)hardware, 2)logic levels and 3)pins. In the logic system design, we use two types of decision diagrams(DDs), that is the common binary decision diagrams(CBDDs) and CMTEDDs. Also, we propose an algorithms to derive common multiple-terminal binary decision diagrams(CMTBDD) from CBDDs, and CMTEDDs from CMTBDDs. The CMTEDDs over CBDDs is more compactness in terms of number of non-terminal nodes, where the nodes for output selection variables are not included in the non-terminal nodes. In the logic design, each non-terminal nodes of an CBDDs and an CMTEDDs is realized by a multiplexer(MUX). In addition, we compare the proposed TDBM realization with the conventional one.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7A
• /
• pp.727-734
• /
• 2004

Collision Management Protocol (CMP) efficiently resolves collisions when data frames are transmitted in networks consisting of HomPNA 3.0 asynchronous MAC mode device with random access. Unlike Distributed Fair Priority Queueing (DFPQ) algorithm in HomePNA 2.0 or Binary Exponential Backoff (BEB) algorithm in IEEE 802.11, order of retransmission is decided according to Collision Signaling Sequence (CSS) values allocated to each device. Thus, CMP can minimize the number of mean collisions because order of retransmission is decided in a deterministic way. In this paper. we evaluate the saturation performance of CMP in HomePNA 3.0 using an analytic method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.3
• /
• pp.576-599
• /
• 2013

Protocol reverse engineering is useful for many security applications, including intelligent fuzzing, intrusion detection and fingerprint generation. Since manual reverse engineering is a time-consuming and tedious process, a number of automatic techniques have been proposed. However, the accuracy of these techniques is limited due to the complexity of binary instructions, and the derived formats have missed constraints that are critical for security applications. In this paper, we propose a new approach for protocol format extraction. Our approach reasons about only the evaluation behavior of a program on the input message from concolic execution, and enables field identification and constraint inference with high accuracy. Moreover, it performs binary analysis with low complexity by reducing modern instruction sets to BIL, a small, well-specified and architecture-independent language. We have implemented our approach into a system called Icefex and evaluated it over real-world implementations of DNS, eDonkey, FTP, HTTP and McAfee ePO protocols. Experimental results show that our approach is more accurate and effective at extracting protocol formats than other approaches.