• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.10 no.1
• /
• pp.95-105
• /
• 2006

The speed of hard disk which is based on mechanical operation is more slow than processor. The growth of processor speed is rapid by semiconductor technology, but the growth of disk speed which is based on mechanical operation is not enough. Buffer cache in main memory and disk cache in disk controller have been used in computer system to solve the speed gap between processor and I/O subsystem. In this paper, an efficient buffer cache and disk cache management scheme was proposed to restrict duplicated disk block between buffer cache and disk cache. The performance of the proposed algorithm was evaluated by simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3128-3149
• /
• 2018

A number of effective methods for multiple-attribute group decision making (MAGDM) with interval-valued intuitionistic fuzzy numbers (IVIFNs) have been proposed in recent years. However, the different methods frequently yield different, even sometimes contradictory, results for the same problem. In this paper a novel criterion to determine the advantages and disadvantages of different methods is proposed. First, the decision-making process is divided into three parts: translation of experts' preferences, aggregation of experts' opinions, and comparison of the alternatives. Experts' preferences aggregation is considered the core step, and the quality of the collective matrix is considered the most important evaluation index for the aggregation methods. Then, methods to calculate the similarity measure, correlation, correlation coefficient, and energy of the intuitionistic fuzzy matrices are proposed, which are employed to evaluate the collective matrix. Thus, the optimal method can be selected by comparing the collective matrices when all the methods yield different results. Finally, a novel approach for aggregating experts' preferences with IVIFN is presented. In this approach, experts' preferences are mapped as points into two-dimensional planes, with the plant growth simulation algorithm (PGSA) being employed to calculate the optimal rally points, which are inversely mapped to IVIFNs to establish the collective matrix. In the study, four different methods are used to address one example problem to illustrate the feasibility and effectiveness of the proposed approach.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.34 no.10
• /
• pp.389-398
• /
• 1985

Recently maximum power demand of our country has become to be under the great in fluence of electric cooling and air conditioning demand which are sensitive to weather conditions. This paper presents the technique and algorithm to forecast the long-term maximum power demand considering the characteristics of electric power and weather variable. By introducing a weather load model for forecasting long-term maximum power demand with the recent statistic data of power demand, annual maximum power demand is separated into two parts such as the base load component, affected little by weather, and the weather sensitive load component by means of multi-regression analysis method. And we derive the growth trend regression equations of above two components and their individual coefficients, the maximum power demand of each forecasting year can be forecasted with the sum of above two components. In this case we use the coincident dry bulb temperature as the weather variable at the occurence of one-day maximum power demand. As the growth trend regression equation we choose an exponential trend curve for the base load component, and real quadratic curve for the weather sensitive load component. The validity of the forecasting technique and algorithm proposed in this paper is proved by the case study for the present Korean power system.

• International conference on construction engineering and project management
• /
• 2009.05a
• /
• pp.1625-1629
• /
• 2009

The new paradigm called 'Low Carbon Green Growth' involved in reducing greenhouse gas is on the rise as a critical issue worldwide. The essential of Kyoto protocol issued in 1997 is to achieve the sustainable economic growth environments by converting existing production system to eco-friendly one. The protocol imposes the liability to reduce greenhouse gas to the countries joined to it. The paradigm is directly involved in the energy consumption and environmental pollution caused by construction activities. Value Engineering which are mainly applied in the design phase in practice is a measure to improve the value of a constructed facility by analyzing and/or appraising the functions and costs of it. However, an appropriate method which assesses eco-friendliness of constructed facility has not been propose by researchers. This paper proposes a method which assesses the performance involved in eco-friendliness of constructed facility using Value Engineering (VE) in the design phase. The method estimates the environmental cost relative to the amounts of energy consumption and environmental pollution occurred over the entire project life cycle. The database called "Life Cycle Inventory DB", which stores information about the amounts of environmental pollution, is used. The algorithm which retrieves the amounts of environmental pollutions from the DB and converts them into environmental costs is developed. The algorithm is implemented into a system which quantifies the eco-friendliness of constructed facility in the design phase using VE.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.64-70
• /
• 2003

Current growth of VLSI design depends critically on the research and development (If automatic layout tool. Automatic layout is composed of placement assigning a specific shape to a block and arranging the block on the layout surface and routing finding the interconnection of all the nets. Algorithms Performing placement and routing impact on Performance and area of VLSI design. Channel routing is a problem assigning each net to a track after global routing and minimizing the track that assigned each net. In this paper we propose a genetic algorithm searching solution space for the netlist partitioning problem for 4-layer channel routing. We compare the performance of proposed genetic algorithm(GA) for channel routing with that of simulated annealing(SA) algorithm by analyzing the results which are the solution of given problems. Consequently experimental results show that out proposed algorithm reduce area over the SA algorithm.

• Korean Journal of Soil Science and Fertilizer
• /
• v.48 no.5
• /
• pp.556-563
• /
• 2015

Chinese cabbage is one of the most important vegetables in Korea and a target crop for market stabilization as well. Remote sensing has long been used as a tool to extract plant growth, cultivated area and yield information for many crops, but little research has been conducted on Chinese cabbage. This study refers to the derivation of simple Chinese cabbage growth prediction equation by using RapidEye derived vegetation index. Daesan-myeon area in Gochang-gun, Jeollabuk-do, Korea is one of main producing district of Chinese cabbage. RapidEye multi-spectral imagery was taken on the Daesan-myeon five times from early September to late October during the Chinese cabbage growing season. Meanwhile, field reflectance spectra and five plant growth parameters, including plant height (P.H.), plant diameter (P.D.), leaf height (L.H.), leaf length (L.L.) and leaf number (L.N.), were measured for about 20 plants (ten plants per plot) for each ground survey. The normalized difference vegetation index (NDVI) for each of the 20 plants was measured using an active plant growth sensor (Crop $Circle^{TM}$) at the same time. The results of correlation analysis between the vegetation indices and Chinese cabbage growth data showed that NDVI was the most suited for monitoring the L.H. (r=0.958~0.978), L.L. (r=0.950~0.971), P.H. (r=0.887~0.982), P.D. (r=0.855~0.932) and L.N. (r=0.718~0.968). Retrieval equations were developed for estimating Chinese cabbage growth parameters using NDVI. These results obtained using the NDVI is effective provided a basis for establishing retrieval algorithm for the biophysical properties of Chinese cabbage. These results will also be useful in determining the RapidEye multi-spectral imagery necessary to estimate parameters of Chinese cabbage.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1572-1593
• /
• 2018

The diversity and fast growth of Internet traffic volume are highly influenced by mobile and computer applications being developed. Moreover, the developed applications are too dynamic to be identified and monitored by network administrators. Several approaches have been proposed to identify network applications, however, are still not robust enough to identify modern applications. This paper proposes both, TSA (Traffic collection, Signature generation and Applications identification) system and a derived algorithm so called CSP (Contiguous Sequential Patterns) to identify applications for management and security in IP networks. The major focus of this paper is the CSP algorithm which is automated in two modules (Signature generation and Applications identification) of the proposed system. The proposed CSP algorithm generates DNA-like unique signatures capable of identifying applications and their individual services. In this paper, we show that the algorithm is suitable for generating efficient signatures to identify applications and application services in high accuracy.

• Journal of Korea Multimedia Society
• /
• v.14 no.10
• /
• pp.1323-1334
• /
• 2011

This paper suggests the border based HSFI algorithm to hide sensitive frequent itemsets. Node formation of FP-Tree which is different from the previous one uses the border to minimize the impacts of nonsensitive frequent itemsets in hiding process, including the organization of sensitive and border information, and all transaction as well. As a result of applying HSFI algorithms, it is possible to be the example transaction database, by significantly reducing the lost items, it turns out that HSFI algorithm is more effective than the existing algorithm for maintaining the quality of more improved database.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1359-1371
• /
• 1999

In this paper, we propose an efficient explicit rate (ER) feedback switch algorithm for available bit rate (ABR) flow control. In order to improve the disadvantages of existing ER feedback switch algorithms with congestion avoidance, the proposed scheme adjusts the target utilization dynamically according to the queue length and its growth rate. also, we investigate the performance of the proposed switch algorithm and compare it with ERICA and NIST switches using simulation. Simulation results show that the proposed switch algorithm can control the cell emission rate of a source rapidly according to variations of available link bandwidth by using dynamic adaptation of target utilization. It also exhibits a better performance than the existing ER feedback switches in terms of queue length and link utilization.

• Journal of Digital Contents Society
• /
• v.16 no.2
• /
• pp.257-262
• /
• 2015

Recently, the interests of mobile GIS technology is increasing with the spread of wireless network, the improvement of mobile device's performances, and the growth of demands about mobile services. Providing services in a wireless environment with existing wired-based GIS solutions have many limitations such as slow communication, processing rates and screen size. In this paper, we propose a cache algorithm on client side to solve the above problems. The proposed algorithm demonstrates the performance improvement over known studies by utilizing unit time and spatial proximity. In addition, this paper conducts a performance evaluation to measure the improvement in algorithm efficiency and analyzes the results of the performance evaluation. When spatial data queries are conducted, according to our performance evaluation, hit rate has been improved over the existing algorithms.