• Journal of the Korea Concrete Institute
• /
• v.27 no.4
• /
• pp.331-341
• /
• 2015

The main purpose of this study is reducing the cost and effort for characterization of tensile strength of fiber reinforced concrete, in order to use in structural design. For this purpose, in this study, test for fiber reinforced concrete was carried out. Because fiber reinforced concrete is consisted of diverse material, it is hard to define the correlation between mix proportions and strength. Therefore, compressive strength test and tensile strength test were carried out for the range of smaller than 100 MPa of compressive strength and 0.25~1% of steel fiber volume fraction. as a results of test, two types of tensile strength were highly affected by compressive strength of concrete. However, increase rate of tensile strength was decreased with increase of compressive strength. Increase rate of tensile strength was decreased with increase of fiber volume fraction. Database was constructed using previous research data. Because estimation equations for tensile strength of fiber reinforced concrete should be multiple variable function, linear regression is hard to apply. Therefore, in this study, we decided to use the ANN(Artificial Neural Network). ANN was constructed using multiple layer perceptron architecture. Sigmoid function was used as transfer function and back propagation training method was used. As a results of prediction using artificial neural network, predicted values of test data and previous research which was randomly selected were well agreed with each other. And the main effective parameters are water-cement ratio and fiber volume fraction.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.1
• /
• pp.127-136
• /
• 2009

This paper proposes an on-line mining algorithm of moving trajectory patterns in RFID data streams considering changing characteristics over time and constraints of single-pass data scan. Since RFID, sensor, and mobile network technology have been rapidly developed, many researchers have been recently focused on the study of real-time data gathering from real-world and mining the useful patterns from them. Previous researches for sequential patterns or moving trajectory patterns based on stream data have an extremely time-consum ing problem because of multi-pass database scan and tree traversal, and they also did not consider the time-changing characteristics of stream data. The proposed method preserves the sequential strength of 2-lengths frequent patterns in binary relationship table using the time-evolving graph to exactly reflect changes of RFID data stream from time to time. In addition, in order to solve the problem of the repetitive data scans, the proposed algorithm infers candidate k-lengths moving trajectory patterns beforehand at a time point t, and then extracts the patterns after screening the candidate patterns by only one-pass at a time point t+1. Through the experiment, the proposed method shows the superior performance in respect of time and space complexity than the Apriori-like method according as the reduction ratio of candidate sets is about 7 percent.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.41 no.3
• /
• pp.173-184
• /
• 2013

A multi-level design optimization framework for aerodynamic design of rotary wing such as propeller and helicopter rotor blades is presented in this study. Strategy of the proposed framework is to enhance aerodynamic performance by sequentially applying the planform and sectional design optimization. In the first level of a planform design, we used a genetic algorithm and blade element momentum theory (BEMT) based on two-dimensional aerodynamic database to find optimal planform variables. After an initial planform design, local flow conditions of blade sections are analyzed using high-fidelity CFD methods. During the next level, a sectional design optimization is conducted using two dimensional Navier-Stokes analysis and a gradient based optimization algorithm. When optimal airfoil shape is determined at the several spanwise locations, a planform design is performed again. Through this iterative design process, not only an optimal flow condition but also an optimal shape of an EAV propeller blade is obtained. To validate the optimized propeller-blade design, it is tested in wind-tunnel facility with different flow conditions. An efficiency, which is slightly less than the expected improvement of 7% predicted by our proposed design framework but is still satisfactory to enhance the aerodynamic performance of EAV system.

• Journal of Korean Society of Steel Construction
• /
• v.25 no.4
• /
• pp.389-398
• /
• 2013

The structural provisions of rectangular CFT (concrete-filled tubular) columns in the 2005/2010 AISC Specification, ACI 318-08, and EC4 were comparatively analyzed as a preliminary study for establishing the unified standards for composite structures. The provisions analyzed included those related to the nominal strength, the effect of confinement, plate slenderness, effective flexural stiffness, and the material strength limitations. Small or large difference can be found among the provisions of AISC, ACI, and EC4. Generally, the 2010 AISC Specification provides the revised provisions which reflect up-to-date test results and tries to minimize the conflict with the ACI provisions. For example, the 2010 AISC Specification introduced a more finely divided plate slenderness limits for CFT columns. In seismic applications, the plate slenderness limits required for highly and moderately ductile CFT columns were separately defined. However, the upper cap limitations on material strengths in both the AISC and EC4 provisions are too restrictive and need to be relaxed considering the high-strength material test database currently available. This study found that no provisions reviewed in this paper provide a generally satisfactory method for predicting the P-M interaction strength of CFT columns under various material combinations. It is also emphasized that a practical constitutive model, which can reasonably reflect the stress-strain characteristics of confined concrete of rectangular CFT columns, is urgently needed for a reliable prediction of the P-M interaction strength.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2005.05b
• /
• pp.209-214
• /
• 2005

수위, 우량, 유량, 유사량 등 수문자료중에서 유량자료는 가장 많은 쓰임새를 갖고 있음에도 불구하고 신뢰도가 낮은 이유로 인해 많은 문제점을 안고 있는 것이 현실이다. 이렇게 유량측정자료의 신뢰도가 낮은 이유는 크게 5가지로 들 수 있는데 1)측정 수행자의 잦은 교체 등에 따른 조사역량 부족, 2)수행자별 유량측정 및 분석방법 상이, 3)장비의 유속검정 등 관리미흡 및 성능 저하, 4)유량측정 상당시간 경과후 유량측정성과 정리로 오류 수정 곤란, 5)유량측정성과의 체계적인 관리 미흡 등이다. 이러한 문제점을 개선하고 현장에서의 유량측정 신뢰도를 향상시키기 위하여 (주)웹솔루스에서는 한국수자원공사의 용역을 통해 현장의 유량 측정 결과를 PDA를 이용하여 기록하고 이를 실시간으로 중앙의 서버로 전송하여 과거 자료의 분석을 통해 측정자료의 신뢰도를 검증함으로써 신뢰성 있는 유량측정자료를 측정하도록 지원하는 유량측정 신뢰도 향상 시스템을 개발하였고, 한국수자원공사와 공동으로 두개의 특허출원을 하였다(특허출원: 10-2002-0049188, 10-2005-11550). 현재 이 시스템은 2002년 8월 착수를 시작으로 9개월이 지난 2003년 3월에 시험판의 개발을 완료하고, 용담댐 유역의 주천교 등 5개 지점에 시험 적용하면서 많은 개선과 보완을 거쳐 2005년 현재에는 한국수자원공사에서 운영하고 있는 13개의 댐과 1개의 국가하천에 대하여 총 59개의 관측지점에서 활용되고 있으며, 현재(2005. 2월 기준)까지 1,660여건 이상의 전자야장이 데이터베이스에 구축되었으며, 유량측정성과 DB는 웹시스템(http://river.kowaco.or.kr)을 통해 운영되고 있다. 본 시스템 도입을 통해 유량측정성과가 체계적으로 관리되고 있으며, 향후 시스템에 대한 지속적인 유지관리가 이루어진다면 오랜기간에 걸쳐 축적된 많은 양의 유량자료는 수자원관리에 큰 역할을 수행할 수 있을것으로 판단된다. 개발계획 및 유역의 특성 등을 조사하고, 시험유역의 선정기준을 수립하여 연구의 목적과 부합되는 지구를 시험유역으로 선정하였으며 선정된 시험유역에 대하여 수문$\cdot$수질 조사 계획을 수립하고, 계측시설을 설치하여 시험운영을 실시하고, 향후 시험유역의 수문계측 및 관리방안을 수립하고자 한다.1종이었다. 이 중 한국 고유종은 11종이었고, 외래 어종은 검정우럭과 2종이 조사되었으며, Zacco platypus(피라미), Zacco temmincki(갈겨니), Acheilongnathus koreanus(칼납자루), Odontobutis platycephala(동사리), Coreoleuciscus splendidus(쉬리) 순으로 분포하고 있었고, Acheilognathus signifer(묵납자루)는 댐 건설 전에는 많이 분포하였으나 현장조사에서 서식을 확인 할 수 언어 개체수의 큰 감소내지 멸종된 것으로 추정되었다.에서 동시에 시행하였다. 수술 후 1년 내 시행한 심초음파에서 모든 환아에서 단지 경등도 이하의 승모판 폐쇄 부전 소견을 보였다. 수술 후 조기 사망은 없었으며, 합병증으로는 유미흉이 한 명에서 있었다. 술 후 10개월째 허혈성 확장성 심근증이 호전되지 않아 Dor 술식을 시행한 후 사망한 예를 제외한 나머지 6명은 특이 증상 없이 정상 생활 중이다 결론: 좌관상동맥 페동맥이상 기시증은 드물기는 하나, 영유아기에 심근경색 및 허혈성 심근증 또는 선천성 승모판 폐쇄 부전등을 초래하는 심각한 선천성 심질환이다. 그러나 진단 즉시 직접 좌관상동맥-대동맥 이식술로 수술적 교정을 해줌으로써 좋은 성적을 기대할 수 있음을 보여주었다.특히 교사들이 중요하게 인식하는 해방적 행동에 대한 목표를 강조하여 적용할 필요가 있음을 시사하고 있다.교하여 유의한 차이가 관찰되지 않았다. 또한 HSP 환자군에서도 $IL1RN^{*}2$ allele 빈도와 carria

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.943-957
• /
• 2014

Removing noise, called denoising, is an essential factor for the more intuitive and more accurate results in boundary image matching. This paper deals with a partial denoising problem that tries to allow a limited amount of partial noise embedded in boundary images. To solve this problem, we first define partial denoising time-series which can be generated from an original image time-series by removing a variety of partial noises and propose an efficient mechanism that quickly obtains those partial denoising time-series in the time-series domain rather than the image domain. We next present the partial denoising distance, which is the minimum distance from a query time-series to all possible partial denoising time-series generated from a data time-series, and we use this partial denoising distance as a similarity measure in boundary image matching. Using the partial denoising distance, however, incurs a severe computational overhead since there are a large number of partial denoising time-series to be considered. To solve this problem, we derive a tight lower bound for the partial denoising distance and formally prove its correctness. We also propose range and k-NN search algorithms exploiting the partial denoising distance in boundary image matching. Through extensive experiments, we finally show that our lower bound-based approach improves search performance by up to an order of magnitude in partial denoising-based boundary image matching.

• Journal of KIISE:Software and Applications
• /
• v.37 no.10
• /
• pp.788-801
• /
• 2010

Advancing of mobile device is remarkable, so the research on mobile input device is getting more important issue. There are lots of input devices such as keypad, QWERTY keypad, touch and speech recognizer, but they are not as convenient as typical keyboard-based desktop input devices so input strings usually contain many typing errors. These input errors are not trouble with communication among person, but it has very critical problem with searching in database, such as dictionary and address book, we can not obtain correct results. Especially, Hangeul has more than 10,000 different characters because one Hangeul character is made by combination of consonants and vowels, frequency of error is higher than English. Generally, suffix tree is the most widely used data structure to deal with errors of query, but it is not enough for variety errors. In this paper, we propose fast approximate Korean word searching system, which allows variety typing errors. This system includes several algorithms for applying general approximate string searching to Hangeul. And we present profanity filters by using proposed system. This system filters over than 90% of coined profanities.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.5
• /
• pp.225-230
• /
• 2015

In this paper, we propose an effective real-time visual loop closure detector, VILODE, which makes use of key frames and bag of visual words (BoW) based on SURF feature points. In order to determine whether the camera has re-visited one of the previously visited places, a loop closure detector has to compare an incoming new image with all previous images collected at every visited place. As the camera passes through new places or locations, the amount of images to be compared continues growing. For this reason, it is difficult for a visual loop closure detector to meet both real-time constraint and high detection accuracy. To address the problem, the proposed system adopts an effective key frame selection strategy which selects and compares only distinct meaningful ones from continuously incoming images during navigation, and so it can reduce greatly image comparisons for loop detection. Moreover, in order to improve detection accuracy and efficiency, the system represents each key frame image as a bag of visual words, and maintains indexes for them using DBoW database system. The experiments with TUM benchmark datasets demonstrates high performance of the proposed visual loop closure detector.

• Journal of KIISE:Software and Applications
• /
• v.31 no.9
• /
• pp.1233-1245
• /
• 2004

Though biometrics to authenticate a person is a good tool in terms of security and convenience, typical authentication algorithms using biometrics may not be executed on resource-constrained devices such as smart cards. Thus, to execute biometric processing on resource-constrained devices, it is desirable to develop lightweight authentication algorithm that requires only small amount of memory and computation. Also, among biological features, face is one of the most acceptable biometrics, because humans use it in their visual interactions and acquiring face images is non-intrusive. We present a new face authentication algorithm in this paper. Our achievement is two-fold. One is to present a face authentication algorithm with low memory requirement, which uses support vector machines (SVM) with the feature set extracted by genetic algorithms (GA). The other contribution is to suggest a method to reduce further, if needed, the amount of memory required in the authentication at the expense of verification rate by changing a controllable system parameter for a feature set size. Given a pre-defined amount of memory, this capability is quite effective to mount our algorithm on memory-constrained devices. The experimental results on various databases show that our face authentication algorithm with SVM whose input vectors consist of discriminating features extracted by GA has much better performance than the algorithm without feature selection process by GA has, in terms of accuracy and memory requirement. Experiment also shows that the number of the feature ttl be selected is controllable by a system parameter.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.271-281
• /
• 2006

Recently the need for Location-Based Service (LBS) has increased due to the development and widespread use of the mobile devices (e.g., PDAs, cellular phones, labtop computers, GPS, and RFID etc). The core technology of LBS is a moving-objects database that stores and manages the positions of moving objects. To search for information quickly, the database needs to contain an index that supports both real-time position tracking and management of large numbers of updates. As a result, the index requires a structure operating in the main memory for real-time processing and requires a technique to migrate part of the index from the main memory to disk storage (or from disk storage to the main memory) to manage large volumes of data. To satisfy these requirements, this paper suggests a unified index scheme unifying the main memory and the disk as well as migration policies for migrating part of the index from the memory to the disk during a restriction in memory space. Migration policy determines a group of nodes, called the migration subtree, and migrates the group as a unit to reduce disk I/O. This method takes advantage of bulk operations and dynamic clustering. The unified index is created by applying various migration policies. This paper measures and compares the performance of the migration policies using experimental evaluation.