• Journal of the Economic Geographical Society of Korea
• /
• v.9 no.3
• /
• pp.379-395
• /
• 2006

The purpose of this study is to analyze the spatial characteristics of travel patterns and travel behaviors of transit users in the Metropolitan Seoul area. We apply the data mining techniques to explore the travel patterns of transit users from the T-money card database which has been produced over 10,000,000 transaction records per day. The database contains the information of locations and times of origin, transfer, and destination points for each transaction as well as the informations of transit modes taken via the transaction. We develop an data mining algorithm to explore traversal patterns from the enormous information. The algorithm determines the travel sequences of each passenger, and produce the volumes of support on each points (stops) of transportation networks in the Metropolitan Seoul area. In order to visualize the spatial patterns of travel demands for transit systems we apply GIS techniques, and attempt to investigate the spatial characteristics of travel patterns and travel demand. Subway stops located in the Gangnam area appear the highest peak for the travel origin and destination, while the CBD in the Gangbuk stands at the second position. Two or three sub-peaks appear at the densely populated residential areas developed as the high-rise apartment complex. Subway stations located along the Subway Line 2, especially from Guro to Samsung receive heavy travel demand (total support), while bus stops located at the CBD in the Gangbuk stands the highest travel demand by bus.

• Korean journal of communication and information
• /
• v.45
• /
• pp.220-254
• /
• 2009

Presidential TV debates serve as an important instrument for the general viewers to evaluate the candidates’ character, to examine their policy, and finally to make an important political decisions to cast ballots. Every words candidates utter in the course of entire election campaign exert influence of a certain significance by delivering their ideas and by creating clashes with their respective opponents. This study focuses on the conceptual venue, coined as ‘stasis’ by ancient rhetoricians, in which the clashes take place, and examines the words selection made by each candidates, the manners in which they form stasis, call for evidence, educate the public, and finally create a legitimate form of political argumentation. The study applied computer based content analysis using KrKwic and UCINET software to analyze semantic networks among the candidates. The results showed three major candidates, namely Lee Myung Bak, Jung Dong Young, and Lee Hoi Chang, displayed separate patterns in their use of language, by selecting the words that are often neglected by their opponents. Apparently, the absence of stasis and the lack of speaking mutual language significantly undermined the effects of debates. Central questions regarding issues of North Korea failed to meet basic requirements, and the respondents failed to engage in effective argumentation process.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.4
• /
• pp.193-205
• /
• 2003

There has been so many research activities about robot soccer system in the many research fields, for example, intelligent control, communication, computer technology, sensor technology, image processing, mechatronics. Especially researchers research strategy for attacking in the field of strategy, and develop intelligent strategy. Then, soccer robots cannot defense completely and efficiently by using simple defense strategy. Therefore, intention extraction of attacker is needed for efficient defense. In this thesis, intention extractor of soccer robots is designed and developed based on FMMNN(Fuzzy Min-Max Neural networks ). First, intention for soccer robot system is defined, and intention extraction for soccer robot system is explained.. Next, FMMNN based intention extractor for soccer robot system is determined. FMMNN is one of the pattern classification method and have several advantages: on-line adaptation, short training time, soft decision. Therefore, FMMNN is suitable for soccer robot system having dynamic environment. Observer extracts attack intention of opponents by using this intention exactor, and this intention extractor is also used for analyzing strategy of opponent team. The capability of developed intention extractor is verified by simulation of 3 vs. 3 robot succor simulator. It was confirmed that the rates of intention extraction each experiment increase.

• Spatial Information Research
• /
• v.21 no.2
• /
• pp.23-33
• /
• 2013

W ith the recent advancement of IoT (Internet of Things) technology, there has been much interest in the spatial query processing which energy-efficiently acquires sensor readings from sensor nodes inside specified geographical area of interests. Therefore, various kinds of spatial query processing algorithms and distributed spatial indexing methods have been proposed. They can minimize energy consumption of sensor nodes by reducing wireless communication among them using in-network spatial filtering technology. However, they cannot optimize multiple spatial queries which w ill be w idely used in IoT, because most of them have focused on a single spatial query optimization. Therefore, we propose a new multiple spatial query optimization algorithm which can energy-efficiently process multiple spatial queries in a sensor network. The algorithm uses a concept of 'query merging' that performs the merged set after merging multiple spatial queries located at adjacent area. Here, our algorithm makes a decision on which is better between the merged and the separate execution of queries. For such the decision making, we additionally propose the cost estimation method on the spatial query execution. Finally, we analyze and clarify our algorithm's distinguished features using the spatial indexing methods of GR-tree, SPIX, CPS.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.5
• /
• pp.137-142
• /
• 2016

A two-step open system(TOS) was proposed to relay between a healing platform and a repository of personal health documents. TOS was designed by taking into consideration the pubsub service based on large scale connections to monitor a provider's access/request process for health documents in real time. TOS, however, uses WebSocket as a communication protocol in case of pubsub. Given the operational environment of low quality wireless networks for mobile devices that are user terminals in a healing platform, there is a need to add a messaging protocol to support QoS as well as a transmission protocol. As a light messaging protocol optimized for mobile devices, MQTT defines reliable messaging QoS to consider a wireless network situation of low speed/low quality. This study designed an MQTT protocol-based message broker to support QoS in case of large scale connections and pubsub by taking into consideration mobile devices that are user terminals in a healing platform. After designing a model between TOS and MQTT message broker, the study implemented a prototype based on the proposed design and compared it with its counterparts from previous studies based on the performance indicators in a load-test with the MQTT client tool.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.5
• /
• pp.232-242
• /
• 2002

In a MPLS(Multiprotocol Label Switching) network, it is important to reduce the number of labels and LSP(Lable Switched Path)s for network resource management. MTP(Multipoint-to-Point) LSP can be used to solve this problem. In consideration of traffic engineering, MTP LSP must be chosen to enhance the availability of network and link utilization. Also, a fast mechanism to setup MTP LSPs is required for rerouting capability against link failure. In this paper, we propose a fast MTP LSP traffic engineering of multipath MTP LSP by using a mapping of a MTP LSP upon Diffserv PHBs(Per Hop Behavior) in a Diffserv-capable MPLS network. In the proposed traffic engineering, we determine multiple MTP LSPs in a hierarchical manner according to the characteristics of different services. By using Monte-Carlo method for traffic load balancing process, it provides fast rerouting capability in case of frequent link failure across large network. Out method produces to be nearly optimal within reasonable run-times. It's time complexity is in O( Cn$^2$logn) as conventional multipath routing and it is much faster than Linear Programming approach. Simulation results show that the proposed traffic engineering can be controlled effectively in an administrative manner and enhance the availability of network in comparison with conventional multipath routing.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.513-522
• /
• 2002

Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization which TCP congestion window size is fluctuated during congestion occurred and if RTT (Round Trip Time) is increased, three duplicate ACK packets is not a correct congestion signal because congestion maybe already disappeared and the host may send more packets until receive the three duplicate ACK packets. Recently there is increasing interest in solving end-to-end congestion control using active network frameworks to improve the performance of TCP protocols. ACC (Active congestion control) is a variation of TCP-based congestion control with queue management In addition traffic modifications nay begin at the congested router (active router) so that ACC will respond more quickly to congestion than TCP variants. The advantage of this method is that the host uses the information provided by the active routers as well as the end points in order to relieve congestion and improve throughput. In this paper, we model enhanced ACC, provide its algorithm which control the congestion by using information in core networks and communications between active routers, and finally demonstrate enhanced performance by simulation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.413-420
• /
• 2006

The speed of present-day network technology exceeds a gigabit and is developing rapidly. When using TCP/IP in these high-speed networks, a high load is incurred in processing TCP/IP protocol in a host CPU. To solve this problem, research has been carried out into TCP/IP Offload Engine (TOE). The TOE processes TCP/IP on a network adapter instead of using a host CPU; this reduces the processing burden on the host CPU. In this paper, we developed two software-based TOEs. One is the TOE implementation using an embedded Linux. The other is the TOE implementation using Lightweight TCP/IP (lwIP). The TOE using an embedded Linux did not have the bandwidth more than 62Mbps. To overcome the poor performance of the TOE using an embedded Linux, we ported the lwIP to the embedded system and enhanced the lwIP for the high performance. We eliminated the memory copy overhead of the lwIP. We added a delayed ACK and a TCP Segmentation Offload (TSO) features to the lwIP and modified the default parameters of the lwIP for large data transfer. With the aid of these modifications, the TOE using the modified lwIP shows a bandwidth of 194 Mbps.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

• The Journal of the Korea Contents Association
• /
• v.11 no.3
• /
• pp.26-35
• /
• 2011

In these days, internet environment are very quickly development as well on-line service have been using a online for the mission critical business around the world. As the amount of information to be processed by computers has recently been increased there has been cluster computing systems developed by connecting workstations server using high speed networks for high availability. but cluster computing technology are limited for a lot of IT resources. So, grid computing is an expanded technology of distributed computing technology to use low-cost and high-performance computing power in various fields. Although the purpose of Grid computing focuses on large-scale resource sharing, innovative applications, and in some case, high-performance orientation, it has been used as conventional distributed computing environment like clustered computer until now because grid middleware does not have common sharable information system. In order to use grid computing environment efficiently which consists of various grid middleware, it is necessary to have application-independent information system which can share information description and services, and expand them easily. This paper proposed new database architecture and load balancing for high availability through Grid technology.