• Journal of the Korean Society of Hazard Mitigation
• /
• v.8 no.5
• /
• pp.147-153
• /
• 2008

Tractive forces by flowing water and ship generated waves are items that affect the stability of the low flow revetments among various external forces exerting on those revetments. Bank revetment stability by these external forces is analysed in this study. The study area is the section of the test construction area changing the artificial revetments to ecological revetments in Han river. Tractive forces are computed using the calculated flow velocity using RMA-2 model. The stability is analyzed comparing the calculated tractive forces with permissible tractive forces of the revetments in the study area. The calculated tractive forces at section number 93 is higher than permissible tractive forces in that section, so the section is estimated hydraulically unstable. The calculated tractive forces for the storm of 10th August 2007 are small compared to the permissible tractive forces in all sections. The sections are considered to be hydraulically stable, but have been eroded in some parts. The reason for the erosion is considered to have insufficient time for the plants taking root, and be exerted composite forces such as forces by ship generated waves. Ship generated waves by the excursion boats and small boats called river taxi was calculated. Wave forces by these calculated waves are computed and compared with the supporting forces of the revetment material. The external forces exerted by the ships in Han River on the revetments is very little compared with the permissible supporting forces of the revetments, so the revetments are estimated hydraulically stable. But considering the composite forces are exerted simultaneously, the stability consideration should include these composite forces.

• Journal of Korean Society of Steel Construction
• /
• v.16 no.2 s.69
• /
• pp.181-190
• /
• 2004

A new inelastic design method performing iterative calculations using secant stiffness was developed. Since the proposed design method uses linear analysis, it is convenient and stable in numerical analysis. At the same time, the proposed design method can accurately estimate the inelastic strength and ductility demands of the members by performing iterative calculation. In the present study, the procedure of the proposed design method was established. Design examples using the proposed method were presented, and its advantages were highlighted by comparisons with existing design methods using elastic or plastic analysis. Unlike the existing inelastic design methods performing the preliminary design on the structure and checking its validity using nonlinear analysis, the proposed integrated analysis-design method can directly calculate the strength and ductility demands of each member. In addition, the proposed design method can address the inelastic design strategy intended by the engineer, such as strength and ductility limits of members and the design concept of strong-column and weak-beam. As a result, economical and safe design can be achieved.

• Journal of KIISE
• /
• v.44 no.9
• /
• pp.992-1004
• /
• 2017

To assess image quality accurately, an image quality assessment (IQA) metric is required to reflect the human visual system (HVS) properly. In other words, the structure, color, and contrast ratio of the image should be evaluated in consideration of various factors. In addition, as mobile embedded devices such as smartphone become popular, a fast computing speed is important. In this paper, the proposed IQA metric combines color similarity, gradient similarity, and phase similarity synergistically to satisfy the HVS and is designed by using optimized pooling and quantization for fast computation. The proposed IQA metric is compared against existing 13 methods using 4 kinds of evaluation methods. The experimental results show that the proposed IQA metric ranks the first on 3 evaluation methods and the first on the remaining method, next to VSI which is the most remarkable IQA metric. Its computing speed is on average about 20% faster than VSI's. In addition, we find that the proposed IQA metric has a bigger amount of correlation with the HVS than existing IQA metrics.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2827-2835
• /
• 2000

In recent years, much attention has been focused on improving I/O devices' processing speed which is essential in such large data processing areas as multimedia data processing. And studies on high-performance parallel file systems are considered to be one of such efforts. In this paper, an efficient disk allocation scheme is proposed for high-performance parallel file systems. In other words, the concept of a parallel disk file's parallelism is defined using data declustering characteristic of a given parallel file. With the concept, an efficient disk allocation scheme is proposed which calculates the appropriate degree of data declustering on disks for each parallel file in order to obtain the maximum throughput when more than one parallel file is used at the same time. Since, calculation for obtaining the maximum throughput is too complex as the number of parallel files increases, an approximate disk allocation algorithm is also proposed in this paper. The approximate algorithm is very simple and especially provides very good results when I/O workload is high. In addition, it has shown that the approximate algorithm provides the optimal disk allocation for the maximum throughput when the arrival rate of I/O requests is infinite.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.5
• /
• pp.521-529
• /
• 2003

In this paper we present an improved method by using demographic information for overcoming the similarity miss-calculation from the sparsity problem in collaborative filtering recommendation systems. The similarity between a pair of users is only determined by the ratings given to co-rated items, so items that have not been rated by both users are ignored. To solve this problem, we add virtual neighbor's rating using demographic information of neighbors for improving prediction accuracy. It is one kind of extentions of traditional collaborative filtering methods using the peason correlation coefficient. We used the Grouplens movie rating data in experiment and we have compared the proposed method with the collaborative filtering methods by the mean absolute error and receive operating characteristic values. The results show that the proposed method is more efficient than the collaborative filtering methods using the pearson correlation coefficient about 9% in MAE and 13% in sensitivity of ROC.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.1-10
• /
• 2004

This paper proposes the method that design CLUT(color look-up table) simultaneously processing gamut mapping and color space conversion using only CLUT without complex computation. After CLUT is constructed using scanner gamut and printer gamut, the scanner gamut is extended to include original scanner gamut. This extended scanner gamut is used as input CIE $L^{*}$ $a^{*}$ $b^{*}$ values for CLUT. Then CMY values are computed by using gamut mapping. Input RGB image of scanner is converted into CIE $L^{*}$ $a^{*}$ $b^{*}$ by using regression function. CIE $L^{*}$ $a^{*}$ $b^{*}$ values of scanner are converted into CMY values without computation of additional gamut mapping using the proposed CLUT. In the experiments, the proposed method resulted in the similar color difference, but reduced the complexity computation than the direct computing method to process gamut mapping and color space conversion respectively.espectively.ively.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.4
• /
• pp.63-74
• /
• 2021

Location-based services (LBSs) are expected to process a large number of spatial queries, such as shortest path and k-nearest neighbor queries that arrive simultaneously at peak periods. Deploying more LBS servers to process these simultaneous spatial queries is a potential solution. However, this significantly increases service operating costs. Recently, batch processing solutions have been proposed to process a set of queries using shareable computation. In this study, we investigate the problem of batch processing moving k-nearest neighbor (MkNN) queries in dynamic spatial networks, where the travel time of each road segment changes frequently based on the traffic conditions. LBS servers based on one-query-at-a-time processing often fail to process simultaneous MkNN queries because of the significant number of redundant computations. We aim to improve the efficiency algorithmically by processing MkNN queries in batches and reusing sharable computations. Extensive evaluation using real-world roadmaps shows the superiority of our solution compared with state-of-the-art methods.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.67-70
• /
• 2000

최근 들어, 인터넷의 폭넓은 보급과 급속한 대중화에 따라 네트워크를 통하여 음성을 전송하거나 저장하려는 시도가 많이 이루어지고 있다. 본 논문에서는 네트워크를 통한 멀티미디어 전송에서 음성부호화 표준으로 널리 상용되는 ITU-T G.723.1 dual-rate speech coder의 효율적인 다채널 구현을 위한 고속 알고리듬을 제안한다. 고속 알고리듬은 부호화 과정에서 많은 계산량을 차지하는 적응 코드북 검색과 고정 코드북 검색 과정에 적용된다. 적응 코드북 검색 과정에서는 지연과 이득을 동시에 찾는 기존의 방법 대신, 지연과 이득을 순차적으로 검색함으로써 계산량을 개선하였다. 전송률에 따라 다른 알고리듬을 사용하는 고정 코드북 검색 과정에서는 다음과 같은 고속 알고리듬을 제안한다. MP-MLQ(Multi-Pulse Maximum Likely Quantization) 방법을 사용하는 높은 전송률(6.3 kbit/s)인 경우, 펄스를 등 간격으로 검색함으로써 계산량을 줄였다. ACELP(Algebraic CELP) 방법을 사용하는 낮은 전송률(5.3 kbit/s)인 경우는 기존의 nested-loop 검색방법 대신, 펄스를 쌍으로 나누어 순차적으로 찾는 depth-first tree 검색 방법을 적용하여 계산량을 감소시켰다. 제안된 고속 알고리듬에 대해 주관적 음질 평가 방법을 수행한 결과, 제안된 방법이 기존의 방법에 비해 음질의 저하가 없음을 확인하였다. 고정 소수점 DSP인 TMS320C6201을 사용하여 고속 알고리듬을 구현한 결과, 높은 전송률의 경우에는 10.29 MIPS, 낮은 전송률의 경우에는 8.70 MIPS의 연산량으로 구현 가능함을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.1-3
• /
• 2002

백본 라우터에서의 최장 길이 프리픽스 검색(LPM: Longest Prefix Matching) 속도를 향상시키기 위해 활발히 연구된 방식들은 계산 량과 사용 메모리 량을 교환하는 방식들이다. 이러한 방식들은 성능향상을 위해서 대용량의 포워딩 테이블(Forwarding Table)을 캐쉬(Cache)에 저장할 수 있는 소용량 인덱스 테이블(Index Table)로 압축함으로써 고속 캐쉬 접근 회수와 그 계산량은 증가하는 대신 저속 메모리 접근 회수를 줄이는 방식이다.〔1〕본논문에서는 저속 메모리 사용량이 증가하는 반면 저속 메모리의 접근 빈도와 계산량을 동시에 감소시키는 FPLL(Fixed Prefix Length Lookup) 방식을 소개한다. 이 방식은 포워딩 엔트리(Entry)들을 프리픽스의 상위 비트(Bit)에 의해 그룹으로 나누고, 각 그룹에 속하는 엔트리들을 같은 길이로 정렬한다. FPLL에서의 LPM검색은 목적지 주소가 속하는 그룹들의 길이를 계산하여 검색할 최장 프리픽스의 길이를 미리 결정하고, 결정된 프리픽스를 키(key)로 하여 해시 테이블(Hash Table)로 구성된 포워딩 테이블에서 완전 일치(Exact Matching) 검색을 한다. 완전 일치 검색을 위해 같은 그룹에 속한 엔트리들을 정렬할 필요가 있는데 이 정렬을 위해 여분의 포워딩 테이블 엔트리가 생성된다. 3만개 엔트리를 갖는 Mae-West〔2〕 경우에, FPLL방식은 12만개 정도의 여분의 엔트리가 추가로 생성되는 대신에 1번 캐쉬 접근과 O(1)의 복잡도를 갖는 해시 테이블 검색으로 LPM 검색을 수행한다.

• Journal of Navigation and Port Research
• /
• v.28 no.3
• /
• pp.199-205
• /
• 2004

We have developed a composite grid method for the solution of the radiation problem We divide the domain into two different grids; one is a moving grid system and the other is a fixed grid system. This numerical method is applied to calculation of the radiation forces generated by the submerged plate oscillating near a free surface. The experimental data are compared with the numerical ones obtained by the present method and a linear potential theory. As a result, we can confirm the accuracy of the present method. Finally, Lie have evaluated the effect of nonlinear and viscous damping on the hydrodynamic forces acting on the submerged plate.