• Journal of the Korea Concrete Institute
• /
• v.29 no.4
• /
• pp.379-387
• /
• 2017

The objective of this study is to develop sustainable PVA fiber-reinforced cementitious composites (FRCCs) that could exhibit comparable strength level to normal PVA FRCCs with no recycled materials. To evaluate mechanical properties of the FRCCs, compressive, flexural and direct tensile tests were conducted. In addition to the test, to calculate amount of carbon dioxide ($CO_2$) emission at the stage of manufacturing the FRCCs, life cycle inventory data base (LCI DB) were referenced from domestic and Japan. From the test results, the mechanical properties such as compressive, flexural and direct tensile strengths were decreased as the replacement ratio of recycled materials increased. And it was determined that the amount of $CO_2$ emission was reduced for the specimens with higher water-binder ratio (W/B) and replacement ratios. It was also found that binder intensity ($B_i$) value was higher as replacement ratio of fly ash (FA) increased. This result means that larger amount of FA is need to deliver one unit of a given performance indicator (1 MPa of strength) of FRCCs compared to that of ordinary portland cement (OPC). As a result, it could be concluded that FRCCs with W/B 45% replaced by FA 25% and recycled sand (RS) 25% is desirable for both target performance and $CO_2$ emission.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.46 no.4
• /
• pp.290-296
• /
• 2018

In this study, the cold test and the numerical analysis were carried out according to the shape parameters of the test model in order to confirm the operation range of high altitude environment simulation test facility for the supersonic vehicle. The blockage ratio, angle and length ratio were considered as the design parameters. The blockage rate is expected to be limited in the region of more than 40% due to the normal shock and expansion fan. It was confirmed that the angle of model should be selected at the size of 45 degrees or less due to the influence of the strong shock wave. There was no difference in performance between the lengths of 8 times the model diameter. Finally, we obtained the performance database according to the shape parameters of the conical test model and confirmed the operable range of the semi-freejet type high altitude environment simulation test facility.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.3
• /
• pp.32-39
• /
• 2018

Raman spectra exhibit differences in intensity depending on the measuring equipment and environmental conditions even for the same material. This restricts the pattern recognition approach of Raman spectroscopy and is an issue that must be solved for the sake of its practical application, so as to enable the reusability of the Raman database and interoperability between Raman devices. To this end, previous studies assumed the existence of a transfer function between the measurement devices to obtain a direct spectral correction. However, this method cannot cope with other conditions that cause various intensity distortions. Therefore, we propose a classification method using linear intensity calibration which can deal with various measurement conditions more flexibly. In order to evaluate the performance of the proposed method, a Raman library containing 14033 chemical substances was used for identification. Ten kinds of chemical Raman spectra measured using three different Raman spectroscopes were used as the experimental data. The experimental results show that the proposed method achieves 100% discrimination performance against the intensity-distorted spectra and shows a high correlation score for the identified material, thus making it a useful tool for the identification of chemical substances.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.2
• /
• pp.301-314
• /
• 2016

Juels and Sudan's fuzzy vault scheme has been applied to various researches due to its error-tolerance property. However, the fuzzy vault scheme does not consider the difference between people's preferences, even though the authors instantiated movie lover' case in their paper. On the other hand, to make secure and high performance face authentication system, Nyang and Lee introduced a face authentication system, so-called fuzzy face vault, that has a specially designed association structure between face features and ordinary fuzzy vault in order to let each face feature have different weight. However, because of optimizing intra/inter class difference of underlying feature extraction methods, we can easily expect that the face authentication system does not successfully decrease the face authentication failure. In this paper, for ensuring the flexible use of the fuzzy vault scheme, we introduce the bucket structure, which differently implements the weighting idea of Nyang and Lee's face authentication system, and three distribution functions, which formalize the relation between user's weight of preferences and system implementation. In addition, we suggest a matchmaker scheme based on them and confirm its computational performance through the movie database.

• KIISE Transactions on Computing Practices
• /
• v.22 no.3
• /
• pp.133-138
• /
• 2016

Motion detection algorithms based on difference image are classified into background subtraction and previous frame subtraction. 1) Background subtraction is a convenient and effective method for detecting foreground objects in a stationary background. However in real world scenarios, especially outdoors, this restriction, (i.e., stationary background) often turns out to be impractical since the background may not be stable. 2) Previous frame subtraction is a simple technique for detecting motion in an image. The difference between two frames depends upon the amount of motion that occurs from one frame to the next. Both these straightforward methods fail when the object moves very "slightly and slowly". In order to efficiently deal with the problem, in this paper we present an algorithm for motion detection that incorporates "reflected light area" and "difference image". This reflected light area is generated during the frame production process. It processes multiplex difference image and AND-arithmetic of bitwise. This process incorporates the accuracy of background subtraction and environmental adaptability of previous frame subtraction and reduces noise generation. Also, the performance of the proposed method is demonstrated by the performance assessment of each method using Gait database sample of CASIA.

• Journal of Internet Computing and Services
• /
• v.6 no.4
• /
• pp.59-73
• /
• 2005

Caching query results and reusing them in processing of subsequent queries is an important query optimization technique. Materialized view and view indexing are the representative examples of such a technique. The two schemes had received much attention for relational databases, and have been investigated for XML data since XML emerged as the standard for data exchange on the Web. In XML view indexing, XML view xv which is the result of an XML query is represented as an XML view index(XVI), a structure containing the identifiers of xv's underlying XML elements as well as the information on xv. Since XVI for xv stores just the identifiers of the XML elements not the elements themselves, when xv is requested, its XVI should be materialized against xv's underlying XML documents. In this paper, we address the problem of integrating an XML view index management system with an RDBMS based XML storage system. The proposed system was implemented in Java on Windows 2000 Server with each of two different commercial RDBMSs, and used in evaluating performance improvement through XML view indexing as well as its overheads. The experimental results revealed that XML view indexing was very effective with an RDBMS based XML storage system while its overhead was negligible.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.20 no.1
• /
• pp.161-182
• /
• 2018

We carried out a series of linear cutting machine tests to assess the cutting performance of a pick cutter in sedimentary rock. The specimens were Linyi sandstone from China and Concrete (rock-like material, conglomerate). Using the small scaled LCM system, we estimated the cutter force and specific energy under different cutting conditions. The cutter forces (cutting and normal) increased with penetration depth and cutter spacing in two rock types, and it was affected by the strength of specimens. On the other hand, the ratio of the peak cutter force to the mean cutter force was influenced by cutting characteristic and composition of rock rather than rock strength. The cutting coefficient was affected by the friction characteristic between rock and pick cutter rather than the cutting conditions. Therefore, the optimal cutting angle can be determined by considering of cutting coefficient and resultant force of pick cutter. The optimum cutting condition was determined from the relationship between the specific energy and cutting condition. For two specimens, the optimum s/p ratio was found to be two to four, and the specific energy decreased with the penetration depth. The result from this study can be used as background database to understand the cutting mechanism of a pick cutter, also it can be used to design for the mechanical excavator.

• Journal of KIISE
• /
• v.42 no.2
• /
• pp.242-254
• /
• 2015

In this paper, we address the problem of improving the performance of multi-step k-NN search using multi-dimensional indexes. Due to information loss by lower-dimensional transformations, existing multi-step k-NN search solutions produce a large tolerance (i.e., a large search range), and thus, incur a large number of candidates, which are retrieved by a range query. Those many candidates lead to overwhelming I/O and CPU overheads in the postprocessing step. To overcome this problem, we propose two efficient solutions that improve the search performance by reducing the tolerance of a range query, and accordingly, reducing the number of candidates. First, we propose a tolerance reduction-based (approximate) solution that forcibly decreases the tolerance, which is determined by a k-NN query on the index, by the average ratio of high- and low-dimensional distances. Second, we propose a coefficient control-based (exact) solution that uses c k instead of k in a k-NN query to obtain a tigher tolerance and performs a range query using this tigher tolerance. Experimental results show that the proposed solutions significantly reduce the number of candidates, and accordingly, improve the search performance in comparison with the existing multi-step k-NN solution.

• Journal of IKEEE
• /
• v.21 no.2
• /
• pp.136-141
• /
• 2017

In this paper, we propose an algorithm for memory optimization to apply deep learning to PC. The proposed algorithm minimizes the memory and computation processing time by reducing the amount of computation processing and data required in the conventional deep learning structure in a general PC. The algorithm proposed in this paper consists of three steps: a convolution layer configuration process using a random filter with discriminating power, a data reduction process using PCA, and a CNN structure creation using SVM. The learning process is not necessary in the convolution layer construction process using the discriminating random filter, thereby shortening the learning time of the overall deep learning. PCA reduces the amount of memory and computation throughput. The creation of the CNN structure using SVM maximizes the effect of reducing the amount of memory and computational throughput required. In order to evaluate the performance of the proposed algorithm, we experimented with Yale University's Extended Yale B face database. The results show that the algorithm proposed in this paper has a similar performance recognition rate compared with the existing CNN algorithm. And it was confirmed to be excellent. Based on the algorithm proposed in this paper, it is expected that a deep learning algorithm with many data and computation processes can be implemented in a general PC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.605-619
• /
• 2003

The main memory DBMS(MMDBMS) efficiently supports various database applications that require high performance since it employs main memory rather than disk as a primary storage. In this paper, we discuss the index manager of the Tachyon, a next-generation MMDBMS. Recently, the gap between the CPU processing and main memory access times is becoming much wider due to rapid advance of CPU technology. By devising data structures and algorithms that utilize the behavior of the cache in CPU, we are able to enhance the overall performance of MMDBMSs considerably. In this paper, we address the practical implementation issues and our solutions for them obtained in developing the cache-conscious index manager of the Tachyon. The main issues touched are (1) consideration of the cache behavior, (2) compact representation of the index entry and the index node, (3) support of variable-length keys, (4) support of multiple-attribute keys, (5) support of duplicated keys, (6) definition of the system catalog for indexes, (7) definition of external APIs, (8) concurrency control, and (9) backup and recovery. We also show the effectiveness of our approach through extensive experiments.