• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.879-884
• /
• 2003

Generally we use web cache in order to increase performance of web base system, and a replacement technique has a great influence on performance of web cache. A web cache replacement technique is different from a replacement technique of memory scope, and a unit substituted for is web object Also, as for the web object, a variation of user reference characteristics is very great. Therefore, a web cache replacement technique can reflect enough characteristics of this web object. But the existing web caching techniques were not able to reflect enough these object reference characteristics. A principal viewpoint of this study is reference characteristic analysis, an elevation of an object hit rate, an improvement of response time. First of all we analyzed a reference characteristics of an web object by log analysis. And we divide web cache storage scope using the result of reference characteristics analysis. In the experiment result, we can confirm that performance of an object-hit ratio and a response speed was improved than a conventional technique about a proposal technique.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.71-79
• /
• 2006

Address lookup is an essential function in the Internet routers, and it determines overall router performance. In this paper, we have thoroughly investigated the binary-search-based address lookup algorithms and proposed a new algorithm based on binary search on prefix lengths. Most of the existing binary search schemes perform binary search on prefix values, and hence the lookup speed is proportional to the length of prefixes or the log function of the number of prefixes. The previous algorithm based on binary search on prefix lengths has superior lookup performance than others. However, the algorithm requires very complicated pre-computation of markers and best matching prefixes in internal nodes since naive binary search is not possible in their scheme. This complicated pre-computation makes the composition of the routing table and incremental update very difficult. By using leaf-pushing, the proposed algorithm in this paper removes the complicated pre-computation of the Previous work in performing the binary search on prefix lengths. The performance evaluation results show that the proposed scheme has very good performance in lookup speed compared with previous works.

• Journal of Advanced Marine Engineering and Technology
• /
• v.28 no.1
• /
• pp.65-74
• /
• 2004

The heat transfer coefficient and pressure drop of $CO_2$(R-744) during gas cooling Process of carbon dioxide in a horizontal tube were investigated experimentally and theoretically. The experiments were conducted without oil in the refrigerant loop. The main components of the refrigerant loop consist of a receiver. a variable-speed pump. a mass flowmeter, an evaporator. and a gas cooler(test section). The main components of the water loop consist of a variable-speed Pump. an constant temperature bath. and a flowmeter. The gas cooler is a counterflow heat exchanger with refrigerant flowing in the inner tube and water flowing in the annulus The test section consists of smooth, horizontal stainless steel tube of 9.53 mm outer diameter and 7.75 mm inner diameter. The length of test section is 6 m. The refrigerant mass fluxes were 200 ~ 300 kg/($m^2{\cdot}s$) and the inlet pressure of the gas cooler varied from 7.5 MPa to 8.5 MPa. The main results were summarized as follows : The predicted correlation can evaluated the R-744 exit temperature from the gas cooler within ${\pm}10%$ for most of the experimental data, given only the inlet conditions. The predicted gas cooley capacity using log mean temperature difference showed relatively food agreement with gas cooler capacity within ${\pm}5%$. The pressure drop predicted by Blasius estimated the pressure drop on the $CO_2$ side within ${\pm}4.3%$. The predicted heat transfer coefficients using Gnielinski's correlation evaluated the heat transfer coefficients on the $CO_2$ side well within the range of experimental error. The predicted heat transfer coefficients using Gao and Honda's correlation estimated the heat transfer coefficients on the coolant side well within ${\pm}10\;%$. Therefore. The predicted equation's usefulness is demonstrated by analyzing data obtained in experiments.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.6
• /
• pp.492-505
• /
• 2022

This study is a study on the results of improving the logic to effectively transmit and decode compressed data in real time by improving the encoding and decoding performance of BL-beta codes that can be used for lossless real-time transmission of IoT sensing data. The encoding process of BL-beta code includes log function, exponential function, division and square root operation, etc., which have relatively high computational burden. To improve them, using bit operation, binary number pattern analysis, and initial value setting of Newton-Raphson method using bit pattern, a new regularity that can quickly encode and decode data into BL-beta code was discovered, and by applying this, the encoding speed of the algorithm was improved by an average of 24.8% and the decoding speed by an average of 5.3% compared to previous study.

• International Area Studies Review
• /
• v.15 no.1
• /
• pp.585-602
• /
• 2011

This study is to investigate the long run convergence behavior of the housing rent of Korean 21 cities, by using the Phillips and Sul (2007)'s newly developed panel convergence test method. The empirical result shows that the 21 Korean cities nationwide converge in four different groups according to the level of convergence. The 1st group is composed of 3 Seoul metropolitan cities, the 2nd group is composed of Bucheon, the 3rd group is composed of 10 cities such as Busan, Daegu, etc, and the 4th group is composed of 7 cities including Jeonju and Mokpo etc. About the speed of convergence among the member cities within the group, the 1st group has the highest speed and next the 4th group, followed by the 2nd group, and finally the 3rd group. The fact that the member cities of the 1st group with the highest rent level and the 4th group with the lowest rent level converges rapidly means the polarization of rent between the two groups. Finally, this paper suggests policy implications to relax the widening gap of individual income between the higher and the lower rent convergent groups.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.5023-5038
• /
• 2017

Big data is an emerging technology which deals with wide range of data sets with sizes beyond the ability to work with software tools which is commonly used for processing of data. When we consider a huge network, we have to process a large amount of network information generated, which consists of both normal and abnormal activity logs in large volume of multi-dimensional data. Intrusion Detection System (IDS) is required to monitor the network and to detect the malicious nodes and activities in the network. Massive amount of data makes it difficult to detect threats and attacks. Sequential Pattern mining may be used to identify the patterns of malicious activities which have been an emerging popular trend due to the consideration of quantities, profits and time orders of item. Here we propose a sequential pattern mining algorithm with fuzzy logic feature selection and fuzzy weighted support for huge volumes of network logs to be implemented in Apache Hadoop YARN, which solves the problem of speed and time constraints. Fuzzy logic feature selection selects important features from the feature set. Fuzzy weighted supports provide weights to the inputs and avoid multiple scans. In our simulation we use the attack log from NS-2 MANET environment and compare the proposed algorithm with the state-of-the-art sequential Pattern Mining algorithm, SPADE and Support Vector Machine with Hadoop environment.

• Journal of the Korean Society of Industry Convergence
• /
• v.21 no.1
• /
• pp.17-27
• /
• 2018

We propose a new approach to control a biped robot motion based on iterative learning of voice command for the implementation of smart factory. The real-time processing of speech signal is very important for high-speed and precise automatic voice recognition technology. Recently, voice recognition is being used for intelligent robot control, artificial life, wireless communication and IoT application. In order to extract valuable information from the speech signal, make decisions on the process, and obtain results, the data needs to be manipulated and analyzed. Basic method used for extracting the features of the voice signal is to find the Mel frequency cepstral coefficients. Mel-frequency cepstral coefficients are the coefficients that collectively represent the short-term power spectrum of a sound, based on a linear cosine transform of a log power spectrum on a nonlinear mel scale of frequency. The reliability of voice command to control of the biped robot's motion is illustrated by computer simulation and experiment for biped walking robot with 24 joint.

• Journal of Information Technology Applications and Management
• /
• v.11 no.2
• /
• pp.29-43
• /
• 2004

As the development of an information technique, gradually, mobile device is going to be miniaturized and operates at high speed. By such the requirements, the devices using a flash memory as a storage media are increasing. The flash memory consumes low power, is a small size, and has a fast access time like the main memory. But the flash memory must erase for recording and the erase cycle is limited. JFFS is a representative filesystem which reflects the characteristics of the flash memory. JFFS to be consisted of LSF structure, writes new data to the flash memory in sequential, which is not related to a file size. Mounting a filesystem or an error recovery is achieved through the sequential approach. Therefore, the mounting delay time is happened according to the file system size. This paper proposes a MJFFS to use a multi-checkpoint information to manage a mass flash file system efficiently. A MJFFS, which improves JFFS, divides a flash memory into the block for suitable to the block device, and stores file information of a checkpoint structure at fixed interval. Therefore mounting and error recovery processing reduce efficiently a number of filesystem access by collecting a smaller checkpoint information than capacity of actual files. A MJFFS will be suitable to a mobile device owing to accomplish fast mounting and error recovery using advantage of log foundation filesystem and overcoming defect of JFFS.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.50 no.4
• /
• pp.427-434
• /
• 2014

Although ex situ target strength (TS) measurements using dual- and split-beam systems have become the primary approach of estimating fish abundance, theoretical model estimation is a powerful tool for verifying the measurements, as well as for providing values when making direct measurements is difficult. TS values for 20 samples of live bambooleaf wrasse (Pseudolabrus japonicus) whose target length (TL) ranged between 13.7 and 21.3 cm were estimated theoretically using the Kirchhoff-ray mode model, and the TS values for 18 live fish samples were additionally measured at ${\sim}0^{\circ}$ tilt angle to the swimming aspect using a tethered method at a frequency of 120 kHz to verify the theoretical values. The digitizing intervals used to extract the fish body and swim bladder morphology in the X-ray photographs significantly affected the calculated TS patterns, but variations based on the speed of sound and density ratio values for the general range of fish flesh were relatively small (within 1 dB). Close agreement was observed between the measured and theoretical TS values, and the correlation between the average TS and body length of the fish could be calculated accurately as <$TS_{120kHz}$>= 20logTL (cm) -71.6 using the theoretical method.

• Journal of Computing Science and Engineering
• /
• v.9 no.3
• /
• pp.155-162
• /
• 2015

The last decade has seen a rapid growth in the use of mobile devices all over the world. With an increasing use of mobile devices, mobile applications are becoming more diverse and complex, demanding more computational resources. However, mobile devices are typically resource-limited (i.e., a slower-speed CPU, a smaller memory) due to a variety of reasons. Mobile users will be capable of running applications with heavy computation if they can offload some of their computations to other places, such as a desktop or server machines. However, mobile users are typically subject to dynamically changing network environments, particularly, due to user mobility. This makes it hard to choose good offloading decisions in mobile environments. In general, users' mobility can provide some hints for upcoming changes to network environments. Motivated by this, we propose a mobility model of each individual user taking advantage of the regularity of his/her mobility pattern, and develop an offloading decision-making technique based on the mobility model. We evaluate our technique through trace-based simulation with real log data traces from 14 Android users. Our evaluation results show that the proposed technique can help boost the performance of mobile devices in terms of response time and energy consumption, when users are highly mobile.