• Journal of the Korea institute for structural maintenance and inspection
• /
• v.19 no.5
• /
• pp.92-103
• /
• 2015

Box-Wilson experimental design method, known as central composite design, is the design of any information-gathering exercises where variation is present. This method was devised to gather as much data as possible in spite of the low design cost. This method was employed to model the effect of mixing factors on several performances of 60 MPa high strength self compacting concrete and to numerically calculate the optimal mix proportion. The nonlinear relations between factors and responses of HSSCC were approximated in the form of second order polynomial equation. In order to characterize five performances like compressive strength, passing ability, segregation resistance, manufacturing cost and density depending on five factors like water-binder ratio, cement content, fine aggregate percentage, fly ash content and superplasticizer content, the experiments were made at the total 52 experimental points composed of 32 factorial points, 10 axial points and 10 center points. The study results showed that Box-Wilson experimental design was really effective in designing the experiments and analyzing the relation between factor and response.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.4
• /
• pp.334-348
• /
• 2005

The goal of next generation digital broadcasting is offering the interaction among consumers and providers as well as variety services. One of the important factors for this new broadcasting environment keeps the interoperability among providers and consumers since the environment is distributed. Therefore a standard metadata for digital broadcasting is required and TV-Anytime metadata is one of the metadata standards for digital broadcasting. The terminal nodes of TV-Anytime metadata are defined by using MPEG-7 metadata. MPEG-7 metadata is standard metadata for describing multimedia content. Therefore, if we use the MPEG-7 metadata for describing broadcasting content can offer multimedia search services like content-based search by the extension of metadata. The efficient management system for these metadata is important for offering the services with high Duality on real broadcasting environment TV-Anytime metadata and MPEG-7 metadata are technically defined using a single XML schema, so its instances are XML data. Currently, a lot of systemsfor managing XML data are proposed in many researchers and we can expect to adapt these systems for managing broadcasting metadata. But the methods used in these systems are not specific methods for managing broadcasting metadata because of methods for general-purpose. In this paper, we find the properties of broadcasting metadata and develop an efficient metadata management system that is based on the found properties. Since our systemis implemented on real broadcasting environment, we expect that the system is most efficient and suitable. Also our system is interoperable since we use XQuery as query language for querying broadcasting metadata.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.98-113
• /
• 2002

In this paper, we present advanced algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Advanced multi-level successive elimination algorithms(AMSEA) are based on the Multi-level successive elimination algorithm(MSEA)[1]. The first algorithm is that when we calculate the sum of absolute difference (SAD) between the sum norms of sub-blocks in MSEA, we use the partial distortion elimination technique. By using the first algorithm, we can reduce the computations of MSEA further. In the second algorithm, we calculate SAD adaptively from large value to small value according to the absolute difference values between pixels of blocks. By using the second algorithm, the partial distortion elimination in SAD calculation can occur early. So, the computations of MSEA can be reduced. In the third algorithm, we can estimate the elimination level of MSEA. Accordingly, the computations of the MSEA related to the level lower than the estimated level can be reduced. The fourth algorithm is a very fast block matching algorithm with nearly 100% motion estimation accuracy. Experimental results show that AMSEA are very efficient algorithms for the estimation of motion vectors.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.6
• /
• pp.1-8
• /
• 2018

FRP is a new material that is light, has high strength and high durability, and is emerging as a third construction material inside and outside of countries. However, very few studies have been done on curved FRP construction materials that can be used for tunnels or arched bridges. Because a small composite panel specimen is smaller than a full-size specimen, it can be used in a variety of experiments under different conditions. Therefore, in this study, experiments were performed on a void section, a solid section, a connected solid section, and a sand-coating solid section. The results of the experiment show that the connection of composite curved panels with longitudinal connections provides almost equivalent performance to that of a single panel. However, it is necessary to strengthen the connections, since the connections that are most susceptible to damage will break first.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.201-213
• /
• 2006

A time-series database is a set of time-series data sequences, each of which is a list of changing values of the object in a given period of time. Subsequence matching is an operation that searches for such data subsequences whose changing patterns are similar to a query sequence from a time-series database. This paper addresses a performance issue of time-series subsequence matching. First, we quantitatively examine the performance degradation caused by the window size effect, and then show that the performance of subsequence matching with a single index is not satisfactory in real applications. We argue that index interpolation is fairly useful to resolve this problem. The index interpolation performs subsequence matching by selecting the most appropriate one from multiple indexes built on windows of their inherent sizes. For index interpolation, we first decide the sites of windows for multiple indexes to be built. In this paper, we solve the problem of selecting optimal window sizes in the perspective of physical database design. For this, given a set of query sequences to be peformed in a target time-series database and a set of window sizes for building multiple indexes, we devise a formula that estimates the cost of all the subsequence matchings. Based on this formula, we propose an algorithm that determines the optimal window sizes for maximizing the performance of entire subsequence matchings. We formally Prove the optimality as well as the effectiveness of the algorithm. Finally, we perform a series of extensive experiments with a real-life stock data set and a large volume of a synthetic data set. The results reveal that the proposed approach improves the previous one by 1.5 to 7.8 times.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.5
• /
• pp.940-947
• /
• 2006

A variety of actuators fur an implantable artificial heart have been studied. They, all, however, share the disadvantages of a complicated energy conversion mechanism and of the need to use bearings. A ferrofluidic actuator directly drives magnetic fluids by applying a magnetic field to these fluids; it does not require bearings. In this study, the feasibility of a ferrofluidic actuator for an implantable artificial heart was studied. An way of two Poles of ring solenoids was mounted near the acrylic tube $({\phi}\;7.4mm)$. A rubber sack (volume : $2m{\ell}$ was connected to both ends of the acrylic tube. The sack were encased in a rigid chamber that had inlet and outlet ports. The acrylic tube and the rubber sack were filled with water encased in a rigid chamber magnetic fluid and the iron cylinder were immersed in the water. Two experiment method was conducted. 1) distance between stoppers were 72mm and 2) distance between stoppers were 104mm. A stroke volume was stability and $0.96m{\ell}$ was obtained in the experiment 1 and $1.92m{\ell}$ in the experiment 2. The energy efficiency of Experiment method 2 is about five times than Experiment method 2. A magnetic fluid-driven blood pump could be feasible if the magnetic fluid with high magnetization (3 times yester than the current value) is developed.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.6
• /
• pp.307-312
• /
• 2016

Markerless tracking for augmented reality using Homography can augment virtual objects correctly and naturally on live view of real-world environment by using correct pose and direction of camera. The RANSAC algorithm is widely used for estimating Homography. CS-RANSAC algorithm is one of the novel algorithm which cooperates a constraint satisfaction problem(CSP) into RANSAC algorithm for increasing accuracy and decreasing processing time. However, CS-RANSAC algorithm can be degraded performance of calculating Homography that is caused by selecting feature points which estimate low accuracy Homography in the sampling step. In this paper, we propose feature point filtering method based on CS-RANSAC for efficient planar Homography estimating the proposed algorithm evaluate which feature points estimate high accuracy Homography for removing unnecessary feature point from the next sampling step using Symmetric Transfer Error to increase accuracy and decrease processing time. To evaluate our proposed method we have compared our algorithm with the bagic CS-RANSAC algorithm, and basic RANSAC algorithm in terms of processing time, error rate(Symmetric Transfer Error), and inlier rate. The experiment shows that the proposed method produces 5% decrease in processing time, 14% decrease in Symmetric Transfer Error, and higher accurate homography by comparing the basic CS-RANSAC algorithm.

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.399-404
• /
• 2002

Along the evolution of information and communication technologies, manufacturing embedded systems such as PDA (personal digital assistant), HPC (hand -held PC), settop box. and information appliance became realistic. And RTOS (real-time operating system) and filesystem have been played essential re]os within the embedded systems as well. For the filesystem of embedded systems, flash memory has been used extensively instead of traditional hard disk drives because of embedded system's requirements like portability, fast access time, and low power consumption. Other than these requirements, nonvolatile storage characteristic of flash memory is another reason for wide adoption in industry. However, there are some technical challenges to cope with to use the flash memory as an indispensable component of the embedded systems. These would be relatively slow cleaning time and the limited number of times to write-and-clean. In this paper, a new cleaning policy is proposed to overcome the problems mentioned above and relevant performance comparison results will be provided. Ranking cleaning policy(RCP) decides when and where to clean within the flash memory considering the cost of cleaning and the number of times of cleaning. This method will maximize not only the lifetime of flash memory but also the performance of access time and manageability. As a result of performance comparison, RCP has showed about 10 ~ 50% of performance evolution compared to traditional policies, Greedy and Cost-benefit methods, by write throughputs.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.775-782
• /
• 2001

Recently the use of Linux OS is increasing to tremendous figures. But due to the fact that Linux is distributed on an open-source policy, the need of security is an upcoming question which leads to widespread development of security on a Linux based environment. Cryptography, however, can cause various problems because of difficulty of key management. A lot of researchers have been concentrating on the key recovery technique to eliminate the reverse effect of using these kinds of security and to promote positive aspects of using it. In this thesis I am suggesting an mechanism based on the key recovery technique, as a method to save time in recovery and resetting a disconnection between two end-users through IPSec (IP Security) protocols in a VPN (Virtual Private Network) environment. The main idea of the newly suggested mechanism, KRFSH (Key Recovery Field Storage Header), is to store the information of the session in advance for the case of losing the session information essential to establish a tunnel connection between a SG and a host in the VPN environment, and so if necessary to use the pre-stored information for recovery. This mechanism is loaded on the IPSec based FreeS/WAN program (Linux environment), and so the VPN problem mentioned above is resolved.

• Resources Recycling
• /
• v.7 no.3
• /
• pp.3-10
• /
• 1998

Simulated waste liquid containing 50 ppm cobalt ion was treated by adsorbing colloidal flotation using Fe(III) or Al(IlI) as flocclant and a sodium lamyl sulfate as a collector. Parameters such as pH, surfactant concentration, Fe(III) or Al(III) concentration, gas flow rate, etc., W앙e considered. The flotation with Fe(III) showed 99.8% removal efficiency of cohalt on the conditions of initial cobalt ion concentration 50 ppm, pH 9.5, gas flow rate 70 ml/min, and flotation time 30 min. When the waste solution, was treated with 35% $H_2O_2$ prior to adsorbing colloidal flotation, the optimal pH for removing cobalt shifted m to weak alkaline range and flotation could be applied in wider range of pH as compared to non-use of $H_2O_2$. Additional use of 20 ppm Al(III) after precipitation of 50 ppm Co(II) with 50 ppm Fe(III) made the optimal pH range for preferable flotation w wider. Foreign ions such as, $NO_3^-$, $SO_4^{2-}$, $Na^+$, $Ca^{2+}$ were adopted and their effects were observed. Of which sulfate ion was f found to be detrimental to removal of cob퍼t ion by flotation. Coprecipitation of Co ion with Fe(III) and Al(III) resulted in b better removal efficiency of cobalt IOn 피 the presence of sulfate ion.