• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2023.11a
• /
• pp.17-18
• /
• 2023

This study aims to compare the hardness value development characteristics according to the water-cement ratio during a series of experiments to develop a setting estimator for an AI-based concrete finishing automation system. For the test variables, water-cement ratios are varied with 30, 40 and 50%. Proctor penetration test and surface hardness test by setting time estimator are conducted to estimate the setting time. For the effect of water-cement ratios, they did not affect the surface hardness either, while initial set time and final set time are not constant with water-cement ratios.

• Journal of the Korea Concrete Institute
• /
• v.16 no.1 s.79
• /
• pp.70-78
• /
• 2004

Although set accelerating agents are used generally in New Austrian Tunneling Method, the standards for test methods and quality of set accelerating agents are not prescribed domestically. In this study, the proprieties of the various standards and the characteristics of set accelerating agents for shotcrete were evaluated. The alkali contents of set accelerating agents based on silicate, aluminate and cement were higher than those of alkali-free ones. From the result, it is thought that the quality control of aggregate should be enhanced and that the number of test cycle of alkali-aggregate reaction should be increased. The setting times of cement paste with set accelerating agents based on silicate and alkali-free ones were different largely with mixing methods. Compressive strength of mortar with set accelerating agents based on silicate, aluminate and cement at one day satisfied the specifications of Korea Concrete Institute. However, the strength ratio compared to control mix at 28 days showed as $50{\~}65\%$ except for the alkali-free set accelerating agents. As a results of setting time and strength test, the establishment of domestic standards that can reflect the characteristics of materials and construction methods of tunnels and that can increase quality of set accelerating agents is required immediately.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.103-110
• /
• 1998

In case of traditional Rule-Based Reasoning(RBR) and Case-Based Reasoning(CBR), although knowledge is reasoned either by one of them or by the integration of RBR and CBR, there is a problem that much time should be consumed by numerous rules and cases. In order to improve this time-consuming problem, in this paper, a new type of reasoning technique, which is a kind of integration of reduced RB and CB, is to be introduced. Such a new type of reasoning uses Rough Set, by which we can represent multi-meaning and/or random knowledge easily. In Rough Set, solution is to be obtained by its own complementary rules, using the process of RB and CB into equivalence class by the classification and approximation of Rough Set. and then using reduced RB and CB through the integrated reasoning.

• Biomedical Science Letters
• /
• v.24 no.3
• /
• pp.230-238
• /
• 2018

Human enteric Adenovirus-41 (HuEAdV-41) causes gastroenteritis, which detected by the polymerase chain reaction (PCR) base diagnostic system for clinical, food, environmental, fish and shellfish samples. We developed improved PCR and nested PCR primer set which had high specificity, sensitivity and reduced times. In this study, we compared seventeen conditions reported in the previous study that was using the PCR based HuEAdV-41 detection system, and non-enteric Adenovirus were detected in nine conditions. The most sensitive detection condition was up to 25 copies however it took 184 minutes of PCR reaction time. In this study, the PCR primer set developed had same level of sensitivity, it reduced the time of detection for clinical, food and seafood samples to 112 minutes. Developed nested PCR primer set needed 112 minutes but detected up to approximately 1 copy. In addition, developed PCR and nested PCR primer set was validated with twenty samples of underground water at random, of which ten samples showed specific band without non-specific reaction. We expect this study will be used to diagnose HuEAdV-41 from various samples.

• Journal of Information Technology Applications and Management
• /
• v.12 no.3
• /
• pp.27-39
• /
• 2005

The Semantic Web has increased the interest in ontologies recently Ontology is an essential component of the semantic web and continues to change and evolve. We consider versions management schemes in ontology. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and temporal dimension. Our change specification is represented by a set of changes. A set of changes consists of instance data change, structural change, and identifier change. In order to support a query in ontology versions, we consider temporal dimension includes valid time. Ontology versioning brings about massive amount of versions to be stored and maintained. We present the ontology versions management schemes that are 1) storing all the change sets, 2) storing the aggregation of change sets periodically, and 3) storing the aggregation of change sets using an adaptive criterion. We conduct a set of experiments to compare the performance of each versions management schemes. We present the experimental results for evaluating the performance of the three version management schemes from scheme 1 to scheme 3. Scheme 1 has the least storage usage. The average response time in Scheme 1 is extremely large, those of Scheme 3 is smaller than Scheme 2. Scheme 3 shows a good performance relatively.

• KIISE Transactions on Computing Practices
• /
• v.21 no.4
• /
• pp.315-319
• /
• 2015

This paper addresses the design and implementation of an Android application for real-time precise motion control. To provide stable real-time performance, we implemented the application in two parts: Android service in the form of a daemon process, which periodically transfers a set of position commands for all motors through a real-time fieldbus, and Android UI application, which generates and delivers the set of position commands to the Android service. To support such a real-time motion control application, we use multi-core partitioning, which partitions the processor cores into a real-time partition to be used by the real-time motion control service and a non-real-time partition to be used by the Android application, and set up a shared buffer between them for communication. Our experiments show that we can obtain a motion control period of 2 ms with 99% task activation jitters less than ${\pm}55{\mu}s$ for a configuration where each of the four threads controls two motors in a group.

• 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 Society of Computer and Information
• /
• v.25 no.9
• /
• pp.193-201
• /
• 2020

In this study, we developed a simulation app that performs the Test-and-Set algorithm. The test-and-set algorithm is a highly difficult algorithm, so this simulation app was created for learners who have difficulty understanding it. Learners who want to understand the Test-and-Set algorithm gather to form a team, and use this simulation app to discuss and practice, and these teams can practice at the same time. The test-and-set, which is assumed to be a machine language, is not interrupted by using a queue, and it can be seen that the configured simulation app performs well in all three conditions of 'mutual exclusion', 'progress', and 'bounded waiting' that must be solved in the critical area problem.

• Journal of Korean Society of Rural Planning
• /
• v.20 no.2
• /
• pp.1-10
• /
• 2014

Smartphones change the picture of data and information sharing and make it possible to share various real-time flooding data and information. The vulnerability indicators of farmland inundation is needed to calculate the risk of farmland flood based on changeable hydro-meteorological data over time with morphologic characteristics of flood-damaged areas. To find related variables show the vulnerability of farmland inundation using the binary-logit model and correlation analysis and to provide vulnerability indicators were estimated by fuzzy set method. The outputs of vulnerability indicators were compared with the results of Monte Carlo simulation (MCS) for verification. From the result vulnerability indicators are applicable to mobile_based information system of farmland inundation.

• Journal of Computing Science and Engineering
• /
• v.6 no.4
• /
• pp.287-293
• /
• 2012

We introduce a methodology for the study of the application-level performance of time-sharing parallel jobs on a set of compute nodes in high performance clusters and report our findings. We assume that parallel jobs arriving at a cluster need to share a set of nodes with the jobs of other users, in that they must compete for processor time in a time-sharing manner and other limited resources such as memory and I/O in a space-sharing manner. Under the assumption, we developed a methodology to simulate job arrivals to a set of compute nodes, and gather and process performance data to calculate the percentage slowdown of parallel jobs. Our goal through this study is to identify a better combination of jobs that minimize performance degradations due to resource sharing and contention. Through our experiments, we found a couple of interesting behaviors for overlapped parallel jobs, which may be used to suggest alternative job allocation schemes aiming to reduce slowdowns that will inevitably result due to resource sharing on a high performance computing cluster. We suggest three job allocation strategies based on our empirical results and propose further studies of the results using a supercomputing facility at the San Diego Supercomputing Center.