• Clean Technology
• /
• v.29 no.3
• /
• pp.217-226
• /
• 2023

The amount of hydrogen adsorbed in arrays of single walled carbon nanotubes (SWNTs) was studied as a function of nanotube diameter and distance between the nearest-neighbor nanotubes on square arrangements using a grand canonical Monte Carlo simulation. The influence of the geometry of a triangle array with the same diameters and distances was also studied. Hydrogen-carbon and hydrogen-hydrogen interactions were modeled with Lennard-Jones potentials for short range interactions and electrostatic interactions were added for hydrogen-hydrogen pairs to consider quantum contributions at low temperatures. At 194.5 K, Type I isotherms for large-diameter SWNTs and Type IV isotherms without hysteresis between adsorption and desorption processes for wider tube separations were observed. At 200 bars, the gravimetric hydrogen storage capacity of the SWNTs was reached or exceeded the US Department of Energy (DOE) target, but the volumetric capacity was about 70% of the DOE target. At 77 K, a two-step adsorption was observed, corresponding to a monolayer formation step followed by a condensation step. Hydrogen was adsorbed first to the inner surface of the nanotubes, then to the outer surface, intratubular space and the interstitial channels between the nanotube bundles. The simulation indicated that SWNTs of various diameters and distances in a wide range of configurations exceeded the DOE gravimetric and volumetric targets at under 1 bar.

• Journal of the Korean Magnetics Society
• /
• v.15 no.1
• /
• pp.1-6
• /
• 2005

In this study we investigate the electronic structure and magnetism of transition metal (TM = Ti, Cr, Mn, Fe, Co, Ni, Ru, Pd, Ag ) deped ZnO($TM_{0.25}Zn_{0.75}O$), which are expected to have Curie temperature. Full-potential Linearized Augmented Plane Wave(FLAPW) metod is adopted with exchange-correlation potential expressed as general gradient approximation(GGA). The calculated magnetic moments of ($TM_{0.25}Zn_{0.75}O$) are 0.83, 3.03, 4.03, 3.48, 2.47, 1.56, 0.43, 0.75, 0.01 ${\mu}_B$ for TM = Ti, Cr, Mn, Fe, Co, Ni, Ru, Pd, Ag, respectively. The nearest neighbor O atom to the transition metal is calculated to have a significant magnetic moment of about 0.1${\mu}_B$, ?? 새 strong hybridization between O-p and TM-d bands. As the results, the systems may have larger magnetic moments in total, compared to the corresponding isolated atoms. The 3d TM doped systems exhibit the half-metallic character except Co, wheres the 4d TM doped systems behave like normal metals and low spin polarization at the Fermi levels.

• Journal of Korean Society for Geospatial Information Science
• /
• v.23 no.2
• /
• pp.3-9
• /
• 2015

Since changes in land use in urban space cause traffic volume and it is closely related to traffic accidents. Therefore, an analysis on the causes of traffic accidents is judged to be an essential factor to establish the measure to reduce traffic accidents. In this regard, the analysis was conducted on the clustering by using the nearest neighbor indexes with regard to the occurrence frequencies of commercial and residential zone based on traffic accident data of the past five years (2009-2013) with the target of local small-medium sized city, Jinju-si. The analysis results, obtained in this study, are as follows: the occurrence frequency of traffic accidents was the highest in spring and the lowest in winter respectively. The clustering of traffic accident occurrence at nighttime was stronger than at daytime. In addition, terms of the analysis on the clustering of traffic accident according to land use, changes according to the seasons was not significant in commercial areas, while clustering density in winter tended to become significantly lower in residential areas. The analysis results of traffic accident types showed that the side-right angle collision of cars was the highest in frequency occurrence, and widespread in both commercial areas and residential areas. These results can provide us with important information to identify the occurrence pattern of traffic accidents in the structure of urban space, and it is expected that they will be appropriately utilized to establish measures to reduce traffic accidents.

• Journal of Navigation and Port Research
• /
• v.47 no.4
• /
• pp.231-238
• /
• 2023

The position of a light buoy is always flexible due to the influence of external forces such as tides and wind. The position can be checked through AIS (Automatic Identification System) or RTU (Remote Terminal Unit) for AtoN. As a result of analyzing the position data for the last five years (2017-2021) of a light buoy, the average position error was 15.4%. It is necessary to detect position error data and obtain refined position data to prevent navigation safety accidents and management. This study aimed to detect position error data and obtain refined position data by DBSCAN Clustering position data obtained through AIS or RTU for AtoN. For this purpose, 21 position data of Gunsan Port No. 1 light buoy where RTU was installed among western waters with the most position errors were DBSCAN clustered using Python library. The minPts required for DBSCAN Clustering applied the value commonly used for two-dimensional data. Epsilon was calculated and its value was applied using the k-NN (nearest neighbor) algorithm. As a result of DBSCAN Clustering, position error data that did not satisfy minPts and epsilon were detected and refined position data were acquired. This study can be used as asic data for obtaining reliable position data of a light buoy installed with AIS or RTU for AtoN. It is expected to be of great help in preventing navigation safety accidents.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.546-553
• /
• 2007

As ontologies are used widely, interest for semantic similarity search is also increasing. In this paper, we suggest a query evaluation scheme for k-nearest neighbor query, which retrieves k most similar objects to the query object. We use the best match method to calculate the semantic similarity between objects and use the signature tree to index annotation information of objects in database. The signature tree is usually used for the set similarity search. When we use the signature tree in similarity search, we are required to predict the upper-bound of similarity for a node; the highest similarity value which can be found when we traverse into the node. So we suggest a prediction function for the best match similarity function and prove the correctness of the prediction. And we modify the original signature tree structure for same signatures not to be stored redundantly. This improved structure of signature tree not only reduces the size of signature tree but also increases the efficiency of query evaluation. We use the Gene Ontology(GO) for our experiments, which provides large ontologies and large amount of annotation data. Using GO, we show that proposed method improves query efficiency and present several experimental results varying the page size and using several node-splitting methods.

• Journal of Distribution Science
• /
• v.16 no.1
• /
• pp.87-99
• /
• 2018

Purpose - The Export Infrastructure Strengthening Program(EISP) is a project to expand exports of agri-food products through providing customized export information to food distribution companies and supporting overseas information activities. A total of 39.6 billion won was provided by 2016. So, the purpose of this study is to analyze whether EISP is effective for expanding exports of agri-food products. Research design, data, and methodology - A simple average difference between the export performance of the policy beneficiaries and the non-policy beneficiaries can be biased if the export capacity or inherent characteristics of the enterprise are not taken into consideration. In order to solve the problem of such a bias, the propensity score matching(PSM) method has been employed in this study. PSM is a method of converting the characteristics of an export company into an index through logit analysis and then reducing the matching to one dimension to improve the accuracy of the performance measurement. Results - The balancing test was conducted to determine how the characteristics of the policy beneficiary group and the matched policy non-beneficiary group corresponded to each other. As a result of the test, we could not reject the null hypothesis that there was no difference between the two groups, so that after the matching, the two groups were similar and the explanatory variables were well controlled. Using the nearest neighbor matching with propensity score estimating through logit analysis, we estimated average treatment effect on the treated(ATT). The food companies participating the EISP had the effect of increasing the exports of $ 5.88 million. As a result, the number of export contracts increased by 11.77, the number of exporting countries by 7.52, the number of export items by 47.51, and the number of buyers' consultation by 3.50. And overseas marketing expenses increased by 35.92 million won. Except for the number of export contracts, other export performance results showed statistically significant results. Conclusions - As the EISP has a positive effect on the expansion of agro-food exports, efforts should be made to find out the limitations or problems of the policy in the future and to make a greater contribution to the increase of exports.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.463-476
• /
• 2006

R-trees have been traditionally optimized for the I/O performance with the disk page as the tree node. Recently, researchers have proposed cache-conscious variations of R-trees optimized for the CPU cache performance in main memory environments, where the node size is several cache lines wide and more entries are packed in a node by compressing MBR keys. However, because there is a big difference between the node sizes of two types of R-trees, disk-optimized R-trees show poor cache performance while cache-optimized R-trees exhibit poor disk performance. In this paper, we propose a cache and disk optimized R-tree, called the PR-tree (Prefetching R-tree). For the cache performance, the node size of the PR-tree is wider than a cache line, and the prefetch instruction is used to reduce the number of cache misses. For the I/O performance, the nodes of the PR-tree are fitted into one disk page. We represent the detailed analysis of cache misses for range queries, and enumerate all the reasonable in-page leaf and nonleaf node sizes, and heights of in-page trees to figure out tree parameters for best cache and I/O performance. The PR-tree that we propose achieves better cache performance than the disk-optimized R-tree: a factor of 3.5-15.1 improvement for one-by-one insertions, 6.5-15.1 improvement for deletions, 1.3-1.9 improvement for range queries, and 2.7-9.7 improvement for k-nearest neighbor queries. All experimental results do not show notable declines of the I/O performance.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.625-634
• /
• 2002

In this paper, we conducted various experiments with Bayesian networks in order to analyze clinical data of infertility patients. With these experiments, we tried to find out inter-dependencies among important factors playing the key role in clinical pregnancy, and to compare 3 different kinds of Bayesian network classifiers (including NBN, BAN, GBN) in terms of classification performance. As a result of experiments, we found the fact that the most important features playing the key role in clinical pregnancy (Clin) are indication (IND), stimulation, age of female partner (FA), number of ova (ICT), and use of Wallace (ETM), and then discovered inter-dependencies among these features. And we made sure that BAN and GBN, which are more general Bayesian network classifiers permitting inter-dependencies among features, show higher performance than NBN. By comparing Bayesian classifiers based on probabilistic representation and reasoning with other classifiers such as decision trees and k-nearest neighbor methods, we found that the former show higher performance than the latter due to inherent characteristics of clinical domain. finally, we suggested a feature reduction method in which all features except only some ones within Markov blanket of the class node are removed, and investigated by experiments whether such feature reduction can increase the performance of Bayesian classifiers.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.3
• /
• pp.59-66
• /
• 2016

This paper presents an empirical evaluation on dimensionality reduction strategies by which dissimilarity-based classifications (DBC) can be implemented efficiently. In DBC, classification is not based on feature measurements of individual objects (a set of attributes), but rather on a suitable dissimilarity measure among the individual objects (pair-wise object comparisons). One problem of DBC is the high dimensionality of the dissimilarity space when a lots of objects are treated. To address this issue, two kinds of solutions have been proposed in the literature: prototype selection (PS)-based methods and dimension reduction (DR)-based methods. In this paper, instead of utilizing the PS-based or DR-based methods, a way of performing DBC in Eigen spaces (ES) is considered and empirically compared. In ES-based DBC, classifications are performed as follows: first, a set of principal eigenvectors is extracted from the training data set using a principal component analysis; second, an Eigen space is expanded using a subset of the extracted and selected Eigen vectors; third, after measuring distances among the projected objects in the Eigen space using $l_p$-norms as the dissimilarity, classification is performed. The experimental results, which are obtained using the nearest neighbor rule with artificial and real-life benchmark data sets, demonstrate that when the dimensionality of the Eigen spaces has been selected appropriately, compared to the PS-based and DR-based methods, the performance of the ES-based DBC can be improved in terms of the classification accuracy.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2020.06a
• /
• pp.261-261
• /
• 2020

물관리의 기본이 되는 연속적인 유량 자료 확보를 위해서는 정확도 높은 수위-유량 관계 곡선식 개발이 필수적이다. 수위-유량 관계곡선식은 모든 수문시설 설계의 기초가 되며 홍수, 가뭄 등 물재해 대응을 위해서도 중요한 의미를 가지고 있다. 그러나 일반적으로 유량 측정은 많은 비용과 시간이 들고, 식생성장, 단면변화 등의 통제특성(control)이 변함에 따라 구간분리, 기간분리와 같은 비선형적인 양상이 나타나 자료 해석에 어려움이 존재한다. 특히, 국내 하천의 경우 자연적 및 인위적인 환경 변화가 다양하여 지점 및 기간에 따라 세밀한 분석이 요구된다. 머신러닝(Machine Learning)이란 데이터를 통해 컴퓨터가 스스로 학습하여 모델을 구축하고 성능을 향상시키는 일련의 과정을 뜻한다. 기존의 수위-유량 관계곡선식은 개발자의 판단에 의해 데이터의 종류와 기간 등을 설정하여 회귀식의 파라미터를 산출한다면, 머신러닝은 유효한 전체 데이터를 이용해 스스로 학습하여 자료 간 상관성을 찾아내 모델을 구축하고 성능을 지속적으로 향상 시킬 수 있다. 머신러닝은 충분한 수문자료가 확보되었다는 전제 하에 복잡하고 가변적인 수자원 환경을 반영하여 유량 추정의 정확도를 지속적으로 향상시킬 수 있다는 이점을 가지고 있다. 본 연구는 머신러닝의 대표적인 알고리즘들을 활용하여 유량을 추정하는 모델을 구축하고 성능을 비교·분석하였다. 대상지역은 안정적인 수량을 확보하고 있는 한강수계의 거운교 지점이며, 사용자료는 2010~2018년의 시간, 수위, 유량, 수면폭 등 이다. 프로그램은 파이썬을 기반으로 한 머신러닝 라이브러리인 사이킷런(sklearn)을 사용하였고 알고리즘은 랜덤포레스트 회귀, 의사결정트리, KNN(K-Nearest Neighbor), rgboost을 적용하였다. 학습(train) 데이터는 입력자료 종류별로 조합하여 6개의 세트로 구분하여 모델을 구축하였고, 이를 적용해 검증(test) 데이터를 RMSE(Roog Mean Square Error)로 평가하였다. 그 결과 모델 및 입력 자료의 조합에 따라 3.67~171.46로 다소 넓은 범위의 값이 도출되었다. 그 중 가장 우수한 유형은 수위, 연도, 수면폭 3개의 입력자료를 조합하여 랜덤포레스트 회귀 모델에 적용한 경우이다. 비교를 위해 동일한 검증 데이터를 한국수문조사연보(2018년) 내거운교 지점의 수위별 수위-유량 곡선식을 이용해 유량을 추정한 결과 RMSE가 3.76이 산출되어, 머신러닝이 세분화된 수위-유량 곡선식과 비슷한 수준까지 성능을 내는 것으로 확인되었다. 본 연구는 양질의 유량자료 생산을 위해 기 구축된 수문자료를 기반으로 머신러닝 기법의 적용 가능성을 검토한 기초 연구로써, 국내 효율적인 수문자료 측정 및 수위-유량 곡선 산출에 도움이 될 수 있을 것으로 판단된다. 향후 수자원 환경 및 통제특성에 영향을 미치는 다양한 영향변수를 파악하기 위해 기상자료, 취수량 등의 입력 자료를 적용할 필요가 있으며, 머신러닝 내 비지도학습인 딥러닝과 같은 보다 정교한 모델에 대한 추가적인 연구도 수행되어야 할 것이다.