• The KIPS Transactions:PartD
• /
• v.10D no.2
• /
• pp.195-210
• /
• 2003

In this paper, we propose an enhanced concurrency control algorithm that maximizes the concurrency of multi-dimensional index structures. The factors that deteriorate the concurrency of index structures are node splits and minimum bounding region (MBR) updates in multi-dimensional index structures. The proposed concurrency control algorithm introduces PLC(Partial Lock Coupling) technique to avoid lock coupling during MBR updates. Also, a new MBR update method that allows searchers to access nodes where MBR updates are being performed is proposed. To reduce the performance degradation by node splits the proposed algorithm holds exclusive latches not during whole split time but only during physical node split time that occupies the small part of a whole split process. For performance evaluation, we implement the proposed concurrency control algorithm and one of the existing link technique-based algorithms on MIDAS-3 that is a storage system of a BADA-4 DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm in terms of throughput and response time. Also, we propose a recovery protocol for our proposed concurrency control algorithm. The recovery protocol is designed to assure high concurrency and fast recovery.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.8
• /
• pp.112-119
• /
• 2004

This paper develops a computer model of a cabover type large truck for estimating the effects of the mounted method of frame on handling performance. The computer model considers two mounted methods of frame; flange mounted and web mounted. Frame is modeled by finite elements using MSC/NASTRAN in order to consider the flexibility of frame. The reliability of the developed computer model is verified by comparing the actual vehicle test results with the simulation results. The actual vehicle test is performed in a double lane change course, and lateral acceleration, yaw rate, and roll angle are measured. To estimate the effects of the mounted method of frame on handling performance, simulations are performed with the flange mounted and web mounted frame. Simulation results show that the web mounted frame＇s variations of roll angle, lateral acceleration, and yaw rate are larger than the flange mounted frame＇s variations, especially in the high test velocity and the second part of the double lane course. Also, simulation results show that the web mounted frame＇s tendencies of roll angle, lateral acceleration, and yaw rate advance the flange mounted frame＇s tendencies, especially in the high test velocity and the second part of the double lane course.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.15 no.6 s.99
• /
• pp.731-737
• /
• 2005

This paper evaluates dynamic performance of a cab over type large-sized truck for estimating the effects of frame's torsional characteristics using a computer model. The computer model considers two mounting methods of frame, flange mounting and web mounting. Frame is modeled by finite elements using MSC/NASTRAN In order to consider the flexibility of frame. The torsional test of the frame is conducted In order to validate the modeled finite element model. A load cell is used to measure the load applied to the frame. An angle sensor is used to measure the torsional angle. An actuator is used to apply a load to the frame. To estimate the effects of frame's torsional characteristics on dynamic performance, simulations are performed with the flange mounting and web mounting frame. Simulation results show that the web mounting frame's variations of roll angle, lateral acceleration, and yaw rate are larger than the flange mounting frame's variations, especially in the high velocity and the second part of the double lane course.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.246-249
• /
• 2022

최근 들어 세계적으로 크게 관심을 받는 메타버스 및 몰입형(가상현실, 확장현실, 및 라이트필드) 콘텐츠 서비스의 응용 범위를 확대하기 위해서는 3D 객체의 실시간 전송을 위한 압축 기술이 필요하다. ISO/IEC 23090 MPEG-I Part 5 로 2021 년 표준화 완료된 V-PCC (Video-based Point Cloud Compression)는 이러한 산업계의 관심 및 필요에 의해서 국제 표준화된 동적 3D 포인트 클라우드 객체 부호화 기술이다. V-PCC 기술의 압축 성능은 기존 산업계 기술에 비해 매우 우수하나, 부호화기의 연산 복잡도가 매우 높다는 단점을 가지고 있다. 본 논문에서는 V-PCC 부호화기에서 가장 높은 연산 복잡도를 갖는 법선 추정 알고리즘의 결합 고속화 기법을 제안한다. 법선 추정은 2 개의 알고리즘으로 구성되어 있다. 첫번째는 "방향을 무시하는 법선 추정 알고리즘(normal estimation)"이고, 두번째는 첫번째 알고리즘에서 추정된 법선들을 대상으로 하는 "법선 방향 추정 알고리즘(normal orientation)"이다. 본 논문에서 제안하는 고속화 기법은 2 개 알고리즘을 결합하여 첫번째 법선 추정 알고리즘에서 획득한 부가 정보를 두번째 법선 방향 추정 알고리즘에서 활용함으로써 연산량을 대폭 줄이고, 또한 법선 방향 추정 알고리즘 내의 우선순위 큐 자료구조를 변경하여 추가적인 고속화를 달성한다. 7 개 테스트 영상에 대한 실험 결과, 압축 효율 저하 없이 법선 방향 추정 알고리즘의 속도를 평균 89.2% 향상시킬 수 있다.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.80-94
• /
• 2003

In this paper. we propose an enhanced concurrency control algorithm that minimizes the query delay efficiently. The factors that delay search operations and deteriorate the concurrency of index structures are node splits and MBR updates in multi dimensional index structures. In our algorithm, to reduce the query delay by split operations, we optimize exclusive latching time on a split node. It holds exclusive latches not during whole split time but only during physical node split time that occupies small part of whole split time. Also to avoid the query delay by MBR updates we introduce partial lock coupling(PLC) technique. The PLC technique increases concurrency by using lock coupling only in case of MBR shrinking operations that are less frequent than MBR expansion operations. For performance evaluation, we implement the proposed algorithm and one of the existing link technique-based algorithms on MIDAS-III that is a storage system of a BADA-III DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm In terms of throughput and response time.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1996.10a
• /
• pp.351-356
• /
• 1996

\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner. \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner. \ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner. \ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner \ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner. \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner, \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner BBA(Building Block Approach)\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner. \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner. \ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner \ulcorner\ulcorner \ulcorner\ulcorner \ulcorner \ulcorner \ulcorner\ulcorner \ulcorner\ulcorner\ulcorner \ulcorner\ulcorner\ulcorner\ulcorner.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.7
• /
• pp.18-25
• /
• 2014

To increase wireless capacity, the concurrent use of multiple wireless interfaces on different frequency bands, called aggregation, can be considered. In this paper, we focus on aggregation of multiple Wi-Fi interfaces with packet-level traffic spreading between the interfaces. Two aggregation schemes, link bonding and multipath TCP (MPTCP), are tested and compared in a dualband Wi-Fi radio system with their Linux implementation. Various test conditions such as traffic types, network delay, locations, interface failures and configuration parameters are considered. Experimental results show that aggregation increases throughput performance significantly over the use of a single interface. Link bonding achieves lower throughput than MPTCP due to duplicate TCP acknowledgements (ACKs) resulting from packet reordering and filtering such duplicate ACKs out is considered as a possible solution. However, link bonding is fast responsive to links' status changes such as a link failure. It is shown that different combinations of interface weights for packet spread in link bonding result in different throughput performance, envisioning a spatio-temporal adaptation of the weights. We also develop a mathematical model of power consumption and compare the power efficiency of the schemes applying different power consumption profiles.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.11 no.4
• /
• pp.1.1-11
• /
• 1974

A general and systematic method of organizing two-dimensional flexible cellular array which is capable of reclizing arbitrary combinational switching function is developed. A set of n functions of n variables is transformed to revalued functions of one variable. This set of functions form a semigroup under the normal operation which is defined in this paper. A systematic method of generating any functions using three base functions is presented. Three basic networks which are capable of realizing three base functions are designed using only one one-dimensional array. The algorithm is presented for lealizing arbitrary combinational switching functions by organizing this basic array in two.dimensional cellular array and by appropriately setting the parameters or the edge of the array.

• Annual Conference on Human and Language Technology
• /
• 1999.10d
• /
• pp.123-136
• /
• 1999

자연언어처리 분야에서 형태소 분석은 가장 기본적인 단계로서 응용 시스템의 목적에 따라 사용되는 형태소 분석기의 수준과 사용 정보가 달라진다. 기존의 형태소분석기의 기능을 다른 목적을 지닌 응용 시스템에서 사용하려 할 때, 분석수준과 사용정보의 이질성으로 인해 변경 또는 확장하는데 많은 어려움이 있다. 이러한 형태소 분석기의 변경과 확장에 대한 다양한 요구를 수용하기 위한 방법으로서 재사용가능한 모듈화된 형태소 분석기의 구현을 제안한다. 모듈화된 형태소 분석기는 구성 요소인 모듈들의 독립성과 재사용성을 보장하기 때문에 확장과 보수가 쉽고, 특정한 요구사항에 대하여 새로운 형태소 분석기를 구현하는데 기존의 모듈들을 사용함으로써 시스템의 개발 시간을 단축시킨다. 본 논문에서는 이러한 모듈들의 사용성을 보여주기 위해 전처리기, 형태소 분석기, 명사 추출기, 태거 등을 하나의 시스템 안에 모듈화된 개념으로 구현하였고, 형태소 분석기는 사전, 음운 변화 처리, 결합 검사, 분석 알고리즘 등을 모듈화하여 재사용할 수 있다는 것을 보여준다.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.2
• /
• pp.168-175
• /
• 1995

It has been commonly accepted for a while that a successful tool environment must provide for smooth interfaces between its tools. Recent integrated CASE environment must be-based on well-integrated data repository which supports a tightly coupled, consistent environment. For the maintenance tool, it requires a careful design of the maintenance chest's database. Information about a program exists in many different forms after analyses have been performed. It must be possible to associate and select objects for data repository from this information as necessary. This paper suggests a new integrated scheme for the data repository in building software maintenancec environment. The scheme provides many basic services, including storage and management of objects/entities and links/ relations; version and configuration control, query service, data interchange service.