• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.217-232
• /
• 2003

QoS routing can improve network performance while providing support for QoS guarantees. These benefits, however, comes with additional routing costs such as more complex and frequent route computation and the protocol overheads to exchange dynamic network state information. Moreover, little has been done to mininize the impact of the QoS traffic to the best effort traffic or to enhance the routine Performance of the best effort traffic when QoS routing is deployed. In this paper, it is proposed that a sewer based routing mechanism, which supports the QoS routing without incurring the QoS routing protocol overhead for the network state update exchanges and enhances the performance of the best effort traffic without affecting the performance of QoS routing. Simulation results show that the proposed scheme enhances the routing performance for the QoS traffic while reducing the routing protocol overhead. The routing performance of the best traffic is also improved with virtually no impact to the routine performance of the QoS traffic. The proposed scheme is shown to be especially effective when the ratio of QoS traffic is high, that is, when the impact of the QoS traffic to the performance of best effort traffic is significant.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.669-680
• /
• 2011

R-trees are widely used in various areas such as geographical information systems, CAD systems and spatial databases in order to efficiently index multi-dimensional data. As data sets used in these areas grow in size and complexity, however, range query operations on R-tree are needed to be further faster to meet the area-specific constraints. To address this problem, there have been various research efforts to develop strategies for acceleration query processing on R-tree by using the buffer mechanism or parallelizing the query processing on R-tree through multiple disks and processors. As a part of the strategies, approaches which parallelize query processing on R-tree through Graphics Processor Units(GPUs) have been explored. The use of GPUs may guarantee improved performances resulting from faster calculations and reduced disk accesses but may cause additional overhead costs caused by high memory access latencies and low data exchange rate between GPUs and the CPU. In this paper, to address the overhead problems and to adapt GPUs efficiently, we propose a novel approach which uses a GPU as a buffer to parallelize query processing on R-tree. The use of buffer algorithm can give improved performance by reducing the number of disk access and maximizing coalesced memory access resulting in minimizing GPU memory access latencies. Through the extensive performance studies, we observed that the proposed approach achieved up to 5 times higher query performance than the original CPU-based R-trees.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.2
• /
• pp.14-25
• /
• 1999

The IEEE standard 1149.1, which was proposed to increase the observability and the controllability in I/O pins, makes it possible the board level testing. In the boundary-scan environments, many shift operations are required due to their serial nature. This increases the test application time and the test application costs. To reduce the test application time, the method based on the parallel opereational multiple scan paths was proposed, but this requires the additional I/O pins and the internal wires. Moreover, it is difficult to make the designs in conformity to the IEEE standard 1149.1 since the standard does not support the parallel operation of data shifts on the scan paths. In this paper, the multiple scan path access algorithm which controls two scan paths simultaneously with one test bus is proposed. Based on the new algorithm, the new algorithm, the new board level BIST architecture which has a relatively small area overhead is developed. The new BIST architecture can reduce the test application time since it can shift the test patterns and the test responses of two scan paths at a time. In addition, it can reduce the costs for the test pattern generation and the test response analysis.

• Journal of the Korean Home Economics Association
• /
• v.27 no.2
• /
• pp.21-30
• /
• 1989

The U.S. response to increased international competition was examined in the present study in order to have more comprehensive understanding of the U.S. textile and clothing market. The method employed to conduct the study was the analysis of the written materials, interview with professionals, and the survey of the actual situations of the U.S. textile and apparel industries. The results are summarized as follows; 1. Official U.S. textile and apparel trade policy has been quite has been quite protective since 1950's. The protective trend has been embodied in Japan Cotton Textile Export Control (reciprocal trade agreement signed by the U.S. and Japan in 1957), Short Term Arrangement Regarding International Trade in Cotton Textiles, Long Term Cotton Textile Arrangement (1962∼1973), and Multi-fiber Arrangement (1974∼). Other governmental programs designed to improve the competitiveness of the U.S. textile and apparel industries include Long-term Textile and Apparel Products Export-expansion Program, and 807 Trade to take labor cost advantage. 2. Along with the quite protective governmental trade policy, the corporate responses have been made such as new sourcing mixes, investment in technology, specialization in the textile and apparel industries, and recent strategies pursued by retailer's. The apparel industry was subject to pressure from imports that increased at moderate levels, and the U.S. textile and apparel industries have made extensive efforts to adjust to the increasing competition from abroad. The textile and apparel industries have taken steps to increase labor productivity through automation, to speed management to create and introduce new products and new methods, and have lowered indirect overhead costs. Several industrywide promotion campaigns have attempted to establish a greater public awareness of international competition and to develop a preference for apparel produced in the United States. 3. Regarding these response of the U.S. and other situations of world textile and apparel trade market, much of the sense of crisis that pervades Korean textile and apparel industries has to do with the problem of adjusting government and corporate policy. Textile and apparel industry of Korea faces on going pressure to reduce costs, improve quality, increase service, develop new markets, diversify, and differentiate itself from its foreign competitors. The strategies that have been adopted in the past have generally worked in the past, but the time has come to adopt strategies that reflect present conditions. If this is not done, then we stand to lose large segments of these industries, which once lost will not easily be regenerated.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.6 s.324
• /
• pp.49-58
• /
• 2004

The existing route re-establishment methods which intend to extend the lifetime of the network attempt to find a new route in order not to overly consume energy of certain nodes. These methods outperforms other routing algorithms in the network lifetime aspect because that they try to consume energy evenly for the entire network. However, these algorithms involve heavy signaling overheads because they find new routes based on flooding method and route re-establishment occurs often. Because of the overhead they often can not achieve the level of performance they intend to. In this paper, we propose a new route selection algorithm which takes into account costs for the packet transmission and the route re-establishment. Since the proposed algerian considers future route re-establishment costs when it first find the route, it spends less energy to transmit given amount of data while evenly consuming energy as much as possible. Simulation results show that the proposed algorithm outperforms the existing route re-establishment methods in that after simulation it has the largest network energy which is the total summation of remaining energy of each node, the smallest energy consumed for route re-establishment, and the smallest energy needed for maintaining a session.

• Korea Journal of Hospital Management
• /
• v.6 no.2
• /
• pp.37-69
• /
• 2001

A new cost management system, called Activity Based Costing (ABC) system, has arisen to solve the limitation of a Traditional Cost Accounting (TCA) system until last two decades and ABC has been applied by many companies. TCA systems have limitation in tracing cost because they arbitrarily allocate overhead cost to the cost objects without standard for direct cost distribution. ABC is an accounting system that assigns costs to products or services based on the resources they consume. The costs of all activities are traced to the products for which they are performed. Therefore ABC is a cost management system that provides a matrix to accurately quantify consumed resources triggered by activities and activities triggered by products and services. There is little implementation of ABC in the health services field, one of service industries, due to complicated and many activities, and volatile cost object. However, the necessity for applying reasonable cost accounting system is largely issuing as strategy responding hostile environment, and financial pressure, and it is imperative to implement the Activity Based Costing (ABC) system. Therefore, this study presents the framework to develop ABC system for total health service organizations. Cost objects in this study base on medical service activities per health insurance claim from one general hospital located in Metropolitan Statistical Areas (MSAs). Medical service activities include all health insurance claims in the hospital. The purpose of the study is presenting useful tools and basic frame to develop Activity Based Costing system for health service organizations which want to use ABC system. The steps to develop ABC system for health service organizations are following: 1. Identifying of activity centers; 2. Definition of cost objects and activity by activity center; 3. Analysis of activity and tracing activity contribution; 4. Allocation of direct cost for specific activity; 5. Allocation of indirect cost for specific activity; 6. Allocation of depreciation for facilities, applicants, and consumption goods; 7. Allocation of administration cost; 8. Allocation of cost among activity centers; and 9. Tracing cost of cost objects by activity center. This study identified necessary information from existing reports which hospitals generally made by each step, and defined outcome which had to be produced in each step using this information. The steps of this study had limitation to apply all different size hospitals because the steps were structured ABC system by one hospital, however, this study used similar basic framework and methods with general cases. When a health service organization want to apply Activity Based Costing (ABC) system on all activities of it in future days, this study is very useful to design system structure in the health service organization.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.538-550
• /
• 2006

XML Keyword search enables us to get information easily without knowledge of structure of documents and returns specific and useful partial document results instead of whole documents. Element level query processing makes it possible, but computational complexity, as the number of documents grows, increases significantly overhead costs. In this paper, we present document-level ranking scheme over XML documents which predicts results of element-level processing to reduce processing cost. To do this, we propose the notion of 'keyword proximity' - the correlation of keywords in a document that affects the results of element-level query processing using path information of occurrence nodes and their resemblances - for document ranking process. In benefit of document-centric view, it is possible to reduce processing time using ranked document list or filtering of low scored documents. Our experimental evaluation shows that document-level processing technique using ranked document list is effective and improves performance by the early termination for top-k query.

• The Journal of the Korea Contents Association
• /
• v.11 no.2
• /
• pp.126-134
• /
• 2011

Recently, many researchers are interested in using join queries to correlate sensor readings stored in different regions. In the conventional algorithm, the preliminary join coordinator collects the synopsis from sensor nodes and determines a set of sensor readings that are required for processing the join query. Then, the base station collects only a part of sensor readings instead of whole readings and performs the final join process. However, it has a problem that incurs communication overhead for processing the preliminary join. In this paper, we propose a novel energy-efficient in-network join scheme that solves such a problem. The proposed scheme determines a preliminary join coordinator located to minimize the communication cost for the preliminary join. The coordinator prunes data that do not contribute to the join result and performs the compression of sensor readings in the early stage of the join processing. Therefore, the base station just collects a part of compressed sensor readings with the decompression table and determines the join result from them. In the result, the proposed scheme reduces communication costs for the preliminary join processing and prolongs the network lifetime.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.109-118
• /
• 2010

Proxy mobile IPv6 (PMIPv6) protocol is a network-based mobility management protocol to support mobility for IPv6 nodes without host involvement. In PMIPv6, the Mobile Access Gateway (MAG) incurs a high signaling cost to update the location of a mobile node to the remote Local Mobility Anchor (LMA) if it moves frequently. This increases network overhead on the LMA, wastes network resources, and lengthens the delay time. Therefore, we propose a new mobility management scheme for minimizing signaling cost using the pointer forwarding. Our proposal can reduce signaling costs by registration with the neighbor MAG instead of the remote LMA using the pointer forwarding. The cost analysis using imbedded Markov chain presented in this paper shows that our proposal can achieve performance superior that of PMIPv6 scheme.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.9 no.2
• /
• pp.57-66
• /
• 1991

This study aims to study the present situation of our national surveying system, in fields such as professional surveyor system, the surveying industry, the consultancy pricing system. The problems are identified to present an improvement plan for the system. The professional surveyor system was compared to other systems in the Asia Zone and the surveying industry related laws and regulations, were compared with those of foreign countries as well as with the regulations of the architectural industry. The improvements suggested include upgrading of surveying technology and of surveying personnel, increase investment into education and research and development. The government should support in policy upgrading such as providing aids to small scale companies and in distributing the concentrated activities in the capital city to other regional areas. Also the pricing for the surveying activities and consulting activities should he adjusted in fields such as price items, grades of surveyors and overhead costs.