• Journal of Soil and Groundwater Environment
• /
• v.12 no.6
• /
• pp.17-25
• /
• 2007

Convergent flow tracer test for 2 m (IW-1 well) and 5 m (IW-2 well) of test scale was conducted at the alluvial aquifer with high permeability and storativity. Pumping rate for convergent flow tracer test were $2,500m^3/day$, and the chloride tracer of 5 kg was instantaneously injected into IW-1 and IW-2 wells. Differences of first arrival time and peak concentration were analyzed by using the concentration breakthrough curves of chloride. Recovered chloride mass were analyzed by recovered cumulative mass curves. And, increment and decrement for chloride concentration were analyzed through chloride concentration versus recovered cumulative mass ratio graphs. Also, increment and decrement ratios of chloride concentration were estimated through linear regression analyses for increment and decrement intervals of chloride concentration. Longitudinal dispersivities were estimated by quot;Converging Radial Flow With Instantaneous Injectionquot; method using CATTI code. Longitudinal dispersivities estimated by CATTI code were 0.4152 m between pumping well and IW-1 well, and 3.2665 m between pumping well and IW-2 well. Longitudinal dispersivity was increased according to far distance from the pumping well. The longitudinal dispersivity according to distance were estimated as 0.21 between pumping well and IW-1 well, and 0.65 between pumping well and IW-2 well.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.7
• /
• pp.159-172
• /
• 2016

This paper presents a novel algorithm for searching evacuation paths in indoor disaster environments. The proposed method significantly improves the time complexity to find the paths to the evacuation exit by introducing a light-weight Disaster Evacuation Graph (DEG) for a building in terms of the size of the graph. With the DEG, the method also considers load balancing and bottleneck capacity of the paths to the evacuation exit simultaneously. The behavior of the algorithm consists of two phases: horizontal tiering (HT) and vertical tiering (VT). The HT phase finds a possible optimal path from anywhere of a specific floor to the evacuation stairs of the floor. Thus, after finishing the HT phases of all floors in parallel the VT phase begins to integrate all results from the previous HT phases to determine a evacuation path from anywhere of a floor to the safety zone of the building that could be the entrance or the roof of the building. It should be noted that the path produced by the algorithm. And, in order to define the range of graph to process, tiering scheme is used. In order to test the performance of the method, computing times and evacuation times are compared to the existing path searching algorithms. The result shows the proposed method is better than the existing algorithms in terms of the computing time and evacuation time. It is useful in a large-scale building to find the evacuation routes for evacuees quickly.

• Analytical Science and Technology
• /
• v.16 no.1
• /
• pp.32-38
• /
• 2003

The rapid and sensitive determination method of sildenafil and its related compounds (Vardenafil, Homosildenafil, Tadanafil.) has been investigated using high performance thin layer choromatography (HPTLC). Optimizing separation conditions and simultaneous determination method of these compounds were studied. The calibration curves of those compounds at 254 nm was found to be linear in the range of $1.0{\sim}56.5{\mu}g/mL$, respectively. The detection limts (LOD) and quantification limits (LOQ) of these were found to be $0.8{\sim}1.8{\mu}g/mL$ and $1.0{\sim}2.3{\mu}g/mL$. The coefficient of variation (C.V.) were less than 2.5%. Finally, the present method was applied to determine sildenafil and its related substances in dietary supplement.

• Analytical Science and Technology
• /
• v.33 no.6
• /
• pp.262-273
• /
• 2020

A fluorine content analysis method for krill oils, which is a representative oil formulation in foods, was developed in compliance with the Korea Food and Drug Ministry's "Guidelines for Validation of Testing Methods Related to Food". Using this method for krill oils, the presence of impurities was evaluated via combustion-ion chromatography (C-IC). A review of published technical data on fluorine in krill oils showed that while the traditional wet potentiometric method was typically used, it was not reliable. Moreover, there was no food testing/analysis laboratory in Korea to perform a fluorine test analysis on such an oil matrix. Therefore, we identified halogen (fluorine) tests, developed to national and international standards, and developed a test method suitable for krill oils by selecting a C-IC method that is sufficiently applicable to the oil matrix. Based on the characteristics of the oil matrix, the optimal test method was established through various experiments by reviewing the concerns related to loss and interference in the preparation and introduction of samples. The fluorine content test was carried out on 11 krill oil products that were purchased online. Most products (with the exception of only one) were found to contain less than the reporting limit obtained by the test method. Furthermore, after additional testing, a high fluorine content of approximately 2,000 ~ 3,000 mg/kg was detected on the krill surface, although the concentration varied depending on the area of the krill. A comparison with samples from two ISO/IEC 17025 testing laboratories confirmed that there was no significant difference in the statistical analysis results obtained by ANOVA among the three laboratories. A testing guide for fluorine content analysis was completed.

• Journal of Intelligence and Information Systems
• /
• v.17 no.3
• /
• pp.63-77
• /
• 2011

The World Wide Web is a very large distributed digital information space. From its origins in 1991, the web has grown to encompass diverse information resources as personal home pasges, online digital libraries and virtual museums. Some estimates suggest that the web currently includes over 500 billion pages in the deep web. The ability to search and retrieve information from the web efficiently and effectively is an enabling technology for realizing its full potential. With powerful workstations and parallel processing technology, efficiency is not a bottleneck. In fact, some existing search tools sift through gigabyte.syze precompiled web indexes in a fraction of a second. But retrieval effectiveness is a different matter. Current search tools retrieve too many documents, of which only a small fraction are relevant to the user query. Furthermore, the most relevant documents do not nessarily appear at the top of the query output order. Also, current search tools can not retrieve the documents related with retrieved document from gigantic amount of documents. The most important problem for lots of current searching systems is to increase the quality of search. It means to provide related documents or decrease the number of unrelated documents as low as possible in the results of search. For this problem, CiteSeer proposed the ACI (Autonomous Citation Indexing) of the articles on the World Wide Web. A "citation index" indexes the links between articles that researchers make when they cite other articles. Citation indexes are very useful for a number of purposes, including literature search and analysis of the academic literature. For details of this work, references contained in academic articles are used to give credit to previous work in the literature and provide a link between the "citing" and "cited" articles. A citation index indexes the citations that an article makes, linking the articleswith the cited works. Citation indexes were originally designed mainly for information retrieval. The citation links allow navigating the literature in unique ways. Papers can be located independent of language, and words in thetitle, keywords or document. A citation index allows navigation backward in time (the list of cited articles) and forwardin time (which subsequent articles cite the current article?) But CiteSeer can not indexes the links between articles that researchers doesn't make. Because it indexes the links between articles that only researchers make when they cite other articles. Also, CiteSeer is not easy to scalability. Because CiteSeer can not indexes the links between articles that researchers doesn't make. All these problems make us orient for designing more effective search system. This paper shows a method that extracts subject and predicate per each sentence in documents. A document will be changed into the tabular form that extracted predicate checked value of possible subject and object. We make a hierarchical graph of a document using the table and then integrate graphs of documents. The graph of entire documents calculates the area of document as compared with integrated documents. We mark relation among the documents as compared with the area of documents. Also it proposes a method for structural integration of documents that retrieves documents from the graph. It makes that the user can find information easier. We compared the performance of the proposed approaches with lucene search engine using the formulas for ranking. As a result, the F.measure is about 60% and it is better as about 15%.

• Journal of KIISE:Software and Applications
• /
• v.33 no.1
• /
• pp.114-129
• /
• 2006

Ontology mapping is the task of finding semantic correspondences between two ontologies. In order to improve the effectiveness of ontology mapping, we need to consider the characteristics and constraints of data models used for implementing ontologies. Earlier research on ontology mapping, however, has proven to be inefficient because the approach should transform input ontologies into graphs and take into account all the nodes and edges of the graphs, which ended up requiring a great amount of processing time. In this paper, we propose a multi-strategic mapping approach to find correspondences between ontologies based on the syntactic or semantic characteristics and constraints of the topic maps. Our multi-strategic mapping approach includes a topic name-based mapping, a topic property-based mapping, a hierarchy-based mapping, and an association-based mapping approach. And it also uses a hybrid method in which a combined similarity is derived from the results of individual mapping approaches. In addition, we don't need to generate a cross-pair of all topics from the ontologies because unmatched pairs of topics can be removed by characteristics and constraints of the topic maps. For our experiments, we used oriental philosophy ontologies, western philosophy ontologies, Yahoo western philosophy dictionary, and Yahoo german literature dictionary as input ontologies. Our experiments show that the automatically generated mapping results conform to the outputs generated manually by domain experts, which is very promising for further work.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.116-126
• /
• 2015

In a distributed heterogeneous computing system, the performance of a parallel application greatly depends on its task scheduling algorithm. Therefore, in order to improve the performance, it is essential to consider some factors that can have effect on the performance of the parallel application in a given environment. One of the most important factors that affects the total execution time is a critical path. In this paper, we propose the CLTS algorithm for a task scheduling. The CLTS sets the priorities of all nodes to improve overall performance by applying leveling method to improve parallelism of task execution and by reducing the delay caused by waiting for execution of critical nodes in priority phase. After that, it conditionally uses insertion based policy or duplication based policy in processor allocation phase to reduce total schedule time. To evaluate the performance of the CLTS, we compared the CLTS with the DCPD and the HCPFD in our simulation. The results of the simulations show that the CLTS is better than the HCPFD by 7.29% and the DCPD by 8.93%. with respect to the average SLR, and also better than the HCPFD by 9.21% and the DCPD by 7.66% with respect to the average speedup.

• Applied Chemistry for Engineering
• /
• v.18 no.3
• /
• pp.245-250
• /
• 2007

Adsorption characteristics of 1,2-dichlorobenzene on the surface of heat treated silica gel were determined by the moment analysis. The heat treatment of the silica gel was performed at temperatures of 150, 500, and $800^{\circ}C$ and pulse-response of 1,2-dichlorobenzene was measured in a gas chromatograph equipped with thermal conductivity detector (TCD) using the packed column. Equilibrium adsorption constants and isosteric heat of adsorption were recorded the highest value at $500^{\circ}C$. This might be due to the increase of interaction between silica surface and 1,2-dichlorobenzene as the decrease of OH concentration and moisture by increase of heating temperature. Axial dispersion coefficient calculated by the moment method was about $0.046{\times}10^{-4}{\sim}1.033{\times}10^{-4}m^2/sec$ and pore diffusivity of heat treated silica gel at $500^{\circ}C$ measured the lowest value. Because heat treating at $800^{\circ}C$ caused the specific surface area to reduce, equilibrium adsorption constants and isosteric heat of adsorption were decreased.

• Polymer(Korea)
• /
• v.39 no.1
• /
• pp.136-143
• /
• 2015

Poly(vinyl alcohol) (PVA) was grafted onto the multiwalled carbon nanotube (MWCNT) using ultrasound in water and modified MWCNT/PVA nanocomposite was prepared. Modified MWCNT had a good affinity with PVA matrix and showed improved dispersion state along with uniform properties. Therefore, the electrical percolation threshold was observed at 0.1 wt% MWCNT. 3.0 wt% modified MWCNT/PVA composite had 50% higher tensile strength, 430% higher elongation at break, and 100% greater modulus. Since the modified MWCNT acted as a nucleation agent, the crystallization temperature increased to $8.5^{\circ}C$ and the crystallinity increased to 11.5% at 5.0 wt% loading concentration.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.11
• /
• pp.20-26
• /
• 1994

In this paper, we propose an algorithm on partitioning a network into several subsets where the cost of a net which connects nodes in k subsets is given as k(k-1)/2 indicating the typical pattern of complete graphs. This problem is one of generalizations for multiple-way partitioning proposed by Sanchis. $^{[5]}$ Its solution can be applied to resource allocation problem in distributed systems. The proposed algorithm expanded the algorithm of Fiduccia and Mattheyses$^{[3]}$ to handle the multiple-way partitioning simultaneously. It has time and space complexity linear to the size of the network. To evaluate the performance of the proposed algorithm, we implemented also a traditional cluster growth method which groups connected nodes for nets, and compared experimental results with those of the proposed algorithm. The proposed algorithm shows some enhancement made.