• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1666-1672
• /
• 2009

Since wide display devices have recently become popular for communication activity, it is desirable for effective communication to share those displays in an efficient way. VNC(Virtual Network Computing) is a desktop sharing software, which transmits the desktop screen and the related events to other computers on different places. So, through VNC, it is possible for more than two users to share the same desktop screen at the same time. But it is very cumbersome to share wide display devices through the functions currently supported by VNC. In this paper, we describe the development of CoDisplay which is a VNC-based conference tool for efficient sharing of a wide display device. Conference participants connect to the wide display device through the associated network address, and transmit their desktop screen to the device. The control functions for the participants support the division of the display screen for multiple desktop screens and the switchover of desktop screens.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.5
• /
• pp.787-793
• /
• 2018

In this paper, we propose a new single carrier - frequency domain equalization (SC-FDE) structure to cope with narrow band interference. In the conventional SC-FDE structure, when a high-power narrow band interference exists, channel estimation and data recovery is difficult. To relieve from this problem, this paper proposes a new SC-FDE frame structure to enable frequency-domain channel estimation in the environments that exist narrow band interference. Specifically, in the conventional method, the channel estimation is performed in time-domain first and from that, the frequency-domain channel is obtained by Fourier transform. In contrast, we proposed a new SC-FDE structure to enable frequency-domain channel estimation directly from received signals without time-domain channel estimation. The receiver performance improvement is verified through computer simulation. According to the results, the proposed technique can detect the signal with less than 2 dB loss compared with jammer-free environments, while the conventional method does not communicate with each other.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.213-218
• /
• 2004

Recently MIP becomes more important for the macro mobility support in the emergence of the global system such as IMT-2000. However this Protocol suffers from many weaknesses on the location management. MIPv4 regional registration is presented for the local registration of MNs. MIPv6 can benefit from the reduced mobility signaling with external networks by employing a local MAP, that is called HMIPv6. The total signaling cost of HMIPv6 is rapidly increased by the number of CNs of an MN when the MN moves around between MAPs. In this paper, we propose a new location management scheme in MIPv6 that reduces the total signaling cost in the location update based on HMIPv6 Here the MN does not send the BU to CNs and HA when it moves around between MAPs. Instead it informs the current location by transferring the modified BU to the previous MAP. According to the results of the performance analysis, we determine the upper bound for the number of forwarding links allowed among adjacent MAPs without the BU information.

• The KIPS Transactions:PartC
• /
• v.18C no.2
• /
• pp.89-96
• /
• 2011

ASR is an excellent program security technique that protects various data memory areas without run-time overhead. ASR hides the addresses of variables from attackers by reordering variables within a data memory area; however, it can be broken by brute force attacks because of a limited data memory space. In this paper, we propose Multiple ASR to overcome the limitation of previous ASR approaches. Multiple ASR separates a data memory area into original and duplicated areas, and compares variables in each memory area to detect an attack. In original and duplicated data memory areas variables are arranged in the opposite order. This makes it impossible to overwrite the same variables in the different data areas in a single attack. Although programs with Multiple ASR show a relatively high run-time overhead due to duplicated execution, programs with many I/O operations such as web servers, a favorite attack target, show 40~50% overhead. In this paper we develop and test a tool that transforms a program into one with Multiple ASR applied.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.3
• /
• pp.129-134
• /
• 2015

Since automatic social engineering based spam attacks induce for users to click or receive the short message service (SMS), e-mail, site address and make a relationship with an unknown friend, it is very easy for them to active in online social networks. The previous spam detection schemes only apply manual filtering of the system managers or labeling classifications regardless of the features of social networks. In this paper, we propose the spam detection metric after reflecting on a couple of features of social networks followed by analysis of real social network data set, Twitter spam. In addition, we provide the online social networks based unsupervised scheme for automated social engineering spam with self organizing map (SOM). Through the performance evaluation, we show the detection accuracy up to 90% and the possibility of real time training for the spam detection without the manager.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.3
• /
• pp.193-204
• /
• 2006

In most existing distributed Web systems, incoming requests are distributed to servers via Domain Name System (DNS). Although such systems are simple to implement, the address caching mechanism easily results in load unbalancing among servers. Moreover, modification of the DNS is necessary to load considering the server's state. In this paper, we propose a new dynamic load balancing method using dynamic DNS update and round-robin mechanism. The proposed method performs effective load balancing without modification of the DNS. In this method, a server can dynamically be added to or removed from the DNS list according to the server's load. By removing the overloaded server from the DNS list, the response time becomes faster. For dynamic scheduling, we propose a scheduling algorithm that considers the CPU, memory, and network usage. We can select a scheduling policy based on resources usage. The proposed system can easily be managed by a GUI-based management tool. Experiments show that modules implemented in this paper have low impact on the proposed system. Furthermore, experiments show that both the response time and the file transfer rate of the proposed system are faster than those of a pure Round-Robin DNS.

• Journal of KIISE:Software and Applications
• /
• v.30 no.1_2
• /
• pp.93-102
• /
• 2003

A slant correction method for handwritten Korean strings based on analysis of stroke distribution, which effectively reflects structural properties of Korean characters, is presented in this paper. The method aims to deal with typical problems which have been frequently observed in slant correction of handwritten Korean strings with conventional approaches developed for English/European languages. Extracted strokes from a line of text image are classified into two clusters by applying the K-means clustering. Gaussian modeling is applied to each of the clusters and the slant angle is estimated from the model which represents the vertical strokes. Experimental results support the effectiveness of the proposed method. For the performance comparison 1,300 handwritten address string images were used, and the results show that the proposed method has more superior performance than other conventional approaches.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.403-406
• /
• 2011

한국해양연구원에서는 국토해양부의 지원을 받아 2010년 7월부터 새로운 개념의 해저로봇 개발에 착수하였다. 새로이 개발되는 해저로봇은 프로펠러 방식으로 추력을 얻는 기존의 해저로봇과는 달리 여러 개의 관절로 이루어진 6개의 다리를 이용하여 해저면에 근접해서 보행과 유영으로 이동하는 해저로봇으로 강조류와 악시계의 환경에서도 운용이 가능한 로봇이다. 이 해저보행로봇 시스템은 선상시스템과 완충기, 그리고 해저보행로봇으로 구성되며, 이들 사이는 광변환기를 통해서 광케이블로 연결된다. 선상시스템에는 해저로봇의 제어 및 모니터링을 위하여 10대의 컴퓨터가 설치되어 있고, 완충기와 해저로봇에 각각 1대의 입출력 컴퓨터가 내장되어 장착된 센서와 모터의 인터페이스를 담당한다. 본 논문에서는 해저보행로봇의 통신 시스템을 소개하고, 이 통신 시스템에서 사용되기 위하여 설계된 메시지의 통신 프로토콜을 설명한다. 해저보행로봇 시스템의 주 네트워크는 기가비트 이더넷이며, 안정된 통신 환경의 소규모 독립 네트워크이다. 완충기와 해저보행로봇에는 최대 100㎐로 동작하는 다양한 직렬 통신 방식을 갖는 다수의 센서와 모터가 장착되어 있는데, 입출력 컴퓨터가 이더넷 네트워크와의 인터페이스 역할을 수행하여 계층적 네트워크를 구성한다. 로봇 제어에서는 실시간성이 중요하기 때문에 이더넷에서 통신 메시지는 한 번의 전송으로 여러 컴퓨터에 전달할 수 있도록 멀티캐스팅을 사용하여 전송된다. 설계된 통신 프로토콜은 이러한 해저로봇 시스템의 특성에 적합한 간결한 구조로 설계되었으며, 최대 255개의 주소를 지정할 수 있고 255 종류의 메시지 형태를 설정할 수 있다.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.107-111
• /
• 2007

There exists a many-to-many mapping relationship between persons and their names. A person may have multiple names, and different persons may share the same name. These synonymous and homonymous names may severely deteriorate the recall and precision of the person search, respectively. This study addresses the characteristics of features for resolving homonymous author names appearing in citation data. As disambiguation features, previous works have employed citation-internal features such as co-authorship, titles of articles, titles of publications as well as citation-external features such as emails, affiliations, Web evidences. To the best of our knowledge, however, there has been no literature to deal with the influences of features on author disambiguation. This study analyzes the effect of individual features on author resolution using a large-scale test set for Korean.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.255-263
• /
• 2000

A multistage interconnection network is a suitable class of interconnection architecture for constructing large-scale multicomputers. Broadcast and multicast communication are fundamental in supporting collective communication operations such as reduction and barrier synchronization. In this paper, we propose a new multicast technique in wormhole-switched bidirectional multistage banyan networks for constructing large-scale multicomputers. To efficiently support broadcast and multicast with simple additional hardware without deadlock, we propose a two-phase multicast algorithm which takes only two transmissions to perform a broadcast and a multicast to an arbitrary number of desired destinations. We encode a header as a cube and adopt the most upper input link first scheme with periodic priority rotation as arbitration mechanism on contented output links. We coalesce the desired destination addresses into multiple number of cubes. And then, we evaluate the performance of the proposed algorithm by simulation. The proposed two-phase multicast algorithm makes a significant improvement in terms of latency. It is noticeable that the two-phase algorithm keeps broadcast latency as efficient as the multicast latency of fanout 2^m where m is the minimum integer satisfying $2^m{\geq} {\sqrt{N}}$ ( N is a network size).