• Journal of the Korean Institute of Landscape Architecture
• /
• v.35 no.4
• /
• pp.57-70
• /
• 2007

As a basic element of Jeju landscape, Oreum offers a beautiful and aesthetic view. Considering topographical and geological research achievements, however, an effort to discover implicit value in terms of landscape characteristics and value has been ignored. This paper has investigated the characteristics and value of landscape by Oreum focusing on Jeju landscape characteristics and eco-touristic value and discussed a scheme to maximize the values. Under a theme of 'Sustainable Development' of the RIO Declaration, tour industry has recently changed its focus from eco-tourism to gee-tourism. Fortunately, Jeju Oreum has very distinctive and unique landscape with depressed crater at a crest. Nevertheless, it's very difficult to see a true aspect of Oreum from the street or over the car window. Therefore, it's urgent to begin a research on how to make advantage of and preserve Oreum landscape in order to maximize its landscape values and improve its potential as a tourist attraction. Through diverse programs such as sky leisure sports(ex: light airplane and helicopter riding, paragliding), sky watching, and mountain hiking, in particular, a possibility that Oreum can succeed as LBD(Learning by Doing)-based tour program with volcanic features needs to be examined. Besides, it's also a good idea to develop Oreum tour program or Oreum Museum as an alternative plan. Above all, however, it's most urgent to protect the existing Oreum and restore ecological and landscape beauty of Oreum through proper land use.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1098-1115
• /
• 2010

An inseparable challenge associated with every random access network is the design of an efficient Collision Resolution Algorithm (CRA), since collisions cannot be completely avoided in such network. To maximize the collision resolution efficiency of a popular CRA, namely Binary Exponential Backoff (BEB), we propose a reactive backoff algorithm. The proposed backoff algorithm is reactive in the sense that it updates the contention window based on the previously selected backoff value in the failed contention stage to avoid a typical type of collision, referred as cross-collision. Cross-collision would occur if the contention slot pointed by the currently selected backoff value appeared to be present in the overlapped portion of the adjacent (the previous and the current) windows. The proposed reactive algorithm contributes to significant performance improvements in the network since it offers a supplementary feature of Cross Collision Exclusion (XCE) and also retains the legacy collision mitigation features. We formulate a Markovian model to emulate the characteristics of the proposed algorithm. Based on the solution of the model, we then estimate the throughput and delay performances of WLAN following the signaling mechanisms of the Distributed Coordination Function (DCF) considering IEEE 802.11b system parameters. We validate the accuracy of the analytical performance estimation framework by comparing the analytically obtained results with the results that we obtain from the simulation experiments performed in ns-2. Through the rigorous analysis, based on the validated model, we show that the proposed reactive cross collision exclusionary backoff algorithm significantly enhances the throughput and reduces the average packet delay in the network.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.69-78
• /
• 2006

The client request scheduling techniques for web server can classified into the scheduling techniques considering a document size to be requested and not. The scheduling techniques considering a document site to be requested provides a better average response time than another As the size-based SRPT(Shortest Remaining Processing Time first) is typical, and the most of scheduling techniques considering a web document size are based on SRPT. Most of existing researches, however, have not considered the feature of HTTP/1.1 which enable the clients to request concurrent multiple inlined-contents in a HTML document via each connection. In this paper we propose a connection scheduling technique with the scheduling window which provides a better response time in HTTP/1.1. The experimental results show that the performance with the proposed approach is improved about $10\%$ more than the connection scheduling with SRPT.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.699-704
• /
• 2001

ABSTRACT In this paper, a new hybrid modular recurrent TDNN (time-delay neural network)-HMM (hidden Markov model) architecture for speech recognition has been studied. In TDNN, the recognition rate could be increased if the signal window is extended. To obtain this effect in the neural network, a high-level memory generated through a feedback within the first hidden layer of the neural network unit has been used. To increase the ability to deal with the temporal structure of phonemic features, the input layer of the network has been divided into multiple states in time sequence and has feature detector for each states. To expand the network from small recognition task to the full speech recognition system, modular construction method has been also used. Furthermore, the neural network and HMM are integrated by feeding output vectors from the neural network to HMM, and a new parameter smoothing method which can be applied to this hybrid system has been suggested.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.9
• /
• pp.811-819
• /
• 2014

Activity recognition is a key component in identifying the context of a user for providing services based on the application such as medical, entertainment and tactical scenarios. Instead of applying numerous sensor devices, as observed in many previous investigations, we are proposing the use of smartphone with its built-in multimodal sensors as an unobtrusive sensor device for recognition of six physical daily activities. As an improvement to previous works, accelerometer, gyroscope and magnetometer data are fused to recognize activities more reliably. The evaluation indicates that the IBK classifier using window size of 2s with 50% overlapping yields the highest accuracy (i.e., up to 99.33%). To achieve this peak accuracy, simple time-domain and frequency-domain features were extracted from raw sensor data of the smartphone.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1872-1879
• /
• 2001

As multiview video applications become more popular, correspondence problem for stereo image matching plays an important role in expanding view points. Thus, we propose an efficient dense disparity estimation algorithm considering features of each image pair of multiview image sets. Main concepts of the proposed algorithm are based on the region-dividing-bidirectional-pixel-matching method. This algorithm makes matching process efficient and keeps the reliability of the estimated disparities. Other improvement have obtained by proposed cost function, matching window expanding technique, disparity regularization, and disparity assignment in ambiguous region. These techniques make disparities more stable by removing false disparities and ambiguous regions. The estimated disparities are used to synthesize intermediate views of multiview images. Computer simulation demonstrates the excellence of the proposed algorithm in both subjective and objective evaluations. In addition, processing time is reduced as well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.424-432
• /
• 2003

In this paper, an effective method of stereo image reconstruction through the regularized adaptive disparity estimation is proposed. Althougth the conventional adaptive disparity estimation method can sharply improve the PSNR of a reconstructed stereo image, but some problems of overlapping between the matching windows and disallocation of the matching windows can be occurred, because the matching window size changes adaptively in accordance with the magnitude of feature values. Accordingly, in thia paper, a new regularized adaptive disparity estimation technique is proposed. That is, by regularizing the estimated disparity vector with the neughboring disparity vectors, problems of the conventional adaptive disparity estimated scheme might be solved, and also the predicted stereo image can be more effectively reconstructed. From some experiments using the CCETT'S stereo image pairs of 'Man' and 'Claude', it is analyzed that the proposed disparity estimation scheme can improve PSNRs of the reconstructed images to 10.89dB, 6.13dB for 'Man' and 1.41dB, 0.81dB for 'Claude' by comparing with those of the conventional pixel-based and adaptive estimation method, respectively.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.451-454
• /
• 2005

Recently, many methods to analyze signal have been proposed and representative methods are the Fourier transform and wavelet transform. In these methods, the Fourier transform represents signal with combination cosine and sine at all locations in the frequency domain. However, it doesn't provide time information that particular frequency occurs in signal and depends on only the global feature of the signal. So, to improve these points the wavelet transform which is capable of multiresolution analysis has been applied to many fields such as speech processing, image processing and computer vision. And the wavelet transform, which uses changing window according to scale parameter, presents time-frequency localization. In this paper, we proposed a new approach using a wavelet of cosine and sine type and analyzed features of signal in a limited point of frequency-time plane.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.4
• /
• pp.43-49
• /
• 2019

The wired and wireless Internet is a useful window to easily acquire various types of media data. On the other hand, the public can easily get the media data including the object to which the personal information is exposed, which is a social problem. In this paper, we propose a method to robustly detect a target object that has exposed personal information using a learning algorithm and effectively block the detected target object area. In the proposed method, only the target object containing the personal information is detected using a neural network-based learning algorithm. Then, a grid-like mosaic is created and overlapped on the target object area detected in the previous step, thereby effectively blocking the object area containing the personal information. Experimental results show that the proposed algorithm robustly detects the object area in which personal information is exposed and effectively blocks the detected area through mosaic processing. The object blocking method presented in this paper is expected to be useful in many applications related to computer vision.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5179-5202
• /
• 2018

Transmission Control Protocol (TCP) is the most widely used protocol in the cloud data centers today. However, cloud data centers using TCP experience many issues as TCP was designed based on the assumption that it would primarily be used in Wide Area Networks (WANs). One of the major issues with TCP in the cloud data centers is the Incast issue. This issue arises because of the many-to-one communication pattern that commonly exists in the modern cloud data centers. In many-to-one communication pattern, multiple senders simultaneously send data to a single receiver. This causes packet loss at the switch buffer which results in TCP throughput collapse that leads to high Flow Completion Time (FCT). Recently, Software-Defined Networking (SDN) has been used by many researchers to mitigate the Incast issue. In this paper, a detailed survey of various SDN based solutions to the Incast issue is carried out. In this survey, various SDN based solutions are classified into four categories i.e. TCP Receive Window based solutions, Tuning TCP Parameters based solutions, Quick Recovery based solutions and Application Layer based solutions. All the solutions are critically evaluated in terms of their principles, advantages, and shortcomings. Another important feature of this survey is to compare various SDN based solutions with respect to different performance metrics e.g. maximum number of concurrent senders supported, calculation of delay at the controller etc. These performance metrics are important for deployment of any SDN based solution in modern cloud data centers. In addition, future research directions are also discussed in this survey that can be explored to design and develop better SDN based solutions to the Incast issue.