• Journal of the Korean Chemical Society
• /
• 제40권3호
• /
• pp.187-195
• /
• 1996

Ab initio SCF calculations have been carried out for the five conceivable trimers formed between one hydrogen cyanide and two hydrogen fluorides using a basis set of TZ＋P quality. Several ground state properties of these trimeric complexes have been evaluated, and compared with those of isolated monomers and appropriate dimers. Computed equilibrium geometries, stabilization energies, and dipole moments are given in order to suppliment the available experimental data. At this level of approximation, intramolecular bond distances are consistently shorter than experimental ones. However, intermolecular distances upon complex formation, and dipole moments are overestimated compared with experimental ones. HCN$(HF)_2$ trimer appears to be the most favourable among the five kinds of trimer complex, and also more stable than $(HCN)_2HF$. The typical features of the non-additivity of intermolecular interaction are relatively strong in the HCN$(HF)_2$ trimer.

• Journal of the Korean Institute of Intelligent Systems
• /
• 제15권4호
• /
• pp.406-411
• /
• 2005

In this paper, we present the area-based Q-learning to search a target object using multiple robot. To search the target in Markovian space, the robots should recognize their surrounding at where they are located and generate some rules to act upon by themselves. Under area-based Q-learning, a robot, first of all, obtains 6-distances from itself to environment by infrared sensor which are hexagonally allocated around itself. Second, it calculates 6-areas with those distances then take an action, i.e., turn and move toward where the widest space will be guaranteed. After the action is taken, the value of Q will be updated by relative formula at the state. We set up an experimental environment with five small mobile robots, obstacles, and a target object, and tried to search for a target object while navigating in a unknown hallway where some obstacles were placed. In the end of this paper, we presents the results of three algorithms - a random search, area-based action making (ABAM), and hexagonal area-based Q-teaming.

• The KIPS Transactions:PartA
• /
• 제14A권7호
• /
• pp.435-442
• /
• 2007

This paper is concerned with the mesh segmentation problem that can be applied to diverse applications such as texture mapping, simplification, morphing, compression, and shape matching for 3D mesh models. The mesh segmentation is the process of dividing a given mesh into the disjoint set of sub-meshes. We propose a method for segmenting meshes by simultaneously reflecting global and local geometric characteristics of the meshes. First, we extract sharp vertices over mesh vertices by interpreting the curvatures and convexity of a given mesh, which are respectively contained in the local and global geometric characteristics of the mesh. Next, we partition the sharp vertices into the $\kappa$ number of clusters by adopting the $\kappa$-means clustering method [29] based on the Euclidean distances between all pairs of the sharp vertices. Other vertices excluding the sharp vertices are merged into the nearest clusters by Euclidean distances. Also we implement the proposed method and visualize its experimental results on several 3D mesh models.

• International Journal of Highway Engineering
• /
• 제17권5호
• /
• pp.57-66
• /
• 2015

PURPOSES: Nighttime driving is very different from daytime driving because drivers must obtain nighttime sight-distances based on road lights and headlights. Unfortunately, nighttime driving conditions in Korea are far from ideal due to poor lighting and an insufficient number of road lights and inadequate operation and maintenance of delineators. This study is conducted to develop new standards for nighttime road visibility based on experiments of driver perception for nighttime visibility conditions. METHODS : In the study, perception level and satisfaction of nighttime visibility were investigated. A total of 60 drivers participated, including 34 older drivers and 31 young drivers. To evaluate driver perceptions of nighttime road visibility, fuzzy set theory was used because the conventional analysis methods for driver perception are limited in effectiveness for considering the characteristics of perception which are subjective and vague, and are generally expressed in terms of linguistic terminologies rather than numerical parameters. RESULTS : This study found that levels of nighttime visibility, as perceived by drivers, are remarkably similar to their satisfactions in different nighttime driving conditions with a log-function relationship. Older drivers evaluated unambiguously degree of nighttime visibility but evaluations by young drivers regarding it were unclear. CONCLUSIONS : A minimum value of brightness on roads was established as YUX 30, based on final analyzed results. In other words, road lights should be installed and operated to obtain more than YUX 30 brightness for the safety and comfort of nighttime driving.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제22권3호
• /
• pp.177-183
• /
• 2022

There is no known polynomial time algorithm for QAP that is a NP-complete problem. This paper suggests O(n²) polynomial time algorithm for random type quadratic assignment problem (QAP). The proposed algorithm suggests incremental augmenting matching strategy that is to set the matching set M={(l_i,f_j)} from l_i with minimum sum of distance in location matrix L and f_j with maximum sum of quantity in facility matrix F, and incremental augmenting of matching set M from M to l_i with minimum sum of distance and to f_j with maximum sum of quantity. Finally, this algorithm performs swap strategy that is to reflect the complex correlations of distances in locations and quantities in facilities. For the experimental data, this algorithm, in spite of O(n²) polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• Journal of KIISE:Databases
• /
• 제35권5호
• /
• pp.447-458
• /
• 2008

In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.

• Horticultural Science & Technology
• /
• 제35권2호
• /
• pp.276-286
• /
• 2017

Licorice, a traditional Korean medicinal plant, is recognized for its main active ingredient, glycyrrhizin. The level of glycyrrhizin in Chinese licorice (Glycyrrhiza uralensis) is lower than the reference level (2.5%) set by the Korean Pharmacopoeia, reducing its value as a medicinal herb. In this study, we aimed to overcome this problem by generating an interspecific licorice hybrid by crossing European licorice (G. glabra) with Chinese licorice, resulting in the production of 32 $F_1$ lines. A comparison of genetic traits revealed variations in glycyrrhizin content among lines, ranging from 1.5 to 5.6%, with a mean value of 3.2%; these values are higher than that of the parental plants. Additionally, 25 lines (78.1%) had a glycyrrhizin content greater than 2.5%, which is higher than the reference level set by the Korean Pharmacopoeia. Four of these lines had glycyrrhizin levels higher than the WHO recommended level of 4.0%. A comparison of phenotypic characteristics showed that the leaves of the hybrids possessed all of the characteristics of European and Chinese licorice; however, the stems of most hybrids had characteristics of European licorice. Finally, we determined the genetic distances of 34 samples of Glycyrrhiza plants (parents, 32 $F_1$ lines) by random amplified polymorphic DNA (RAPD); the $F_1$ lines showed a close genetic distance. We plan to develop to a cultivar using five of these lines (glycyrrhizin content < 4.0%).

• Journal of radiological science and technology
• /
• 제46권5호
• /
• pp.401-408
• /
• 2023

Thyroid uptake measurements can be subject to measurement errors due to the scoping and positioning of the thyroid gland. To compensate for these limitations, the clinical utility of the thyroid simultaneous counting method as an alternative to thyroid uptake measurement was analyzed and evaluated experimentally through quantitative analysis of images acquired after thyroid scanning. Experimental data were obtained using a Gamma camera (GE infinia), a thyroid uptake system (KOROID 1), and a thyroid neck phantom. Based on the thyroid uptake rate of 1-5% according to the protocol of thyroid scan test (^99mTcO₄ - , 370 MBq) in normal results, ^99mTcO₄ - was set in the range of 3.7-18.5 MBq (Matrix: 256×256, Scan time: 1 min, collimator: pin hole, phantom-collimator distances: 7 cm). The acquired images were corrected for the attenuation of isotopes due to the set-up time and half-life by applying the Auto Region of interest (ROI) drawing system, and the significance of the experimental results was evaluated by Multiple linear regression analysis (SPSS, ver. 22, IBM). The thyroid uptake rate showed a significant correlation between the dose and the measured counts when using the thyroid uptake system equipment. Meanwhile, the quantitative analysis counts of phantom images using Gamma camera also showed a significant correlation. Thus confirmed that the correlation between these two experiments was statistically significant (P<0.05). The simultaneous counting protocol, which indirectly measures thyroid uptake from thyroid scans, is likely to be clinically relevant if complemented by additional studies with different variables in patients with thyroid disease.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권11호
• /
• pp.2784-2799
• /
• 2012

Biological data have been increased exponentially in recent years, and analyzing these data using data mining tools has become one of the major issues in the bioinformatics research community. This paper focuses on the protein construction process in higher organisms where the deoxyribonucleic acid, or DNA, sequence is filtered. In the process, "unmeaningful" DNA sub-sequences (called introns) are removed, and their meaningful counterparts (called exons) are retained. Accurate recognition of the boundaries between these two classes of sub-sequences, however, is known to be a difficult problem. Conventional approaches for recognizing these boundaries have sought for solely enhancing machine learning techniques, while inherent nature of the data themselves has been overlooked. In this paper we present an approach which makes use of the data attributes inherent to species in order to increase the accuracy of the boundary recognition. For experimentation, we have taken the data sets for four different species from the University of California Santa Cruz (UCSC) data repository, divided the data sets based on the species types, then trained a preprocessed version of the data sets on neural network(NN)-based and support vector machine(SVM)-based classifiers. As a result, we have observed that each species has its own specific features related to the splice sites, and that it implies there are related distances among species. To conclude, dividing the training data set based on species would increase the accuracy of predicting splicing junction and propose new insight to the biological research.

• Journal of Digital Contents Society
• /
• 제2권2호
• /
• pp.179-189
• /
• 2001

This paper aims at faster processing and retrieval in fingerprint identification systems by reducing the amount of preprocessing and the size of the feature vector. The distribution of fingerprint directions is a set of local directions of ridges and furrows in small overlapped blocks in a fingerprint image. It is extracted initially as a set of 8-direction components through the Gabor filter bank. The discontinuous distribution of directions is smoothed to a continuous one and visualized as a direction image. Then the center of the distribution is selected as a reference point. A feature vector is composed of 192 sine values of the ridge angles at 32-equiangular positions with 6 different distances from the reference point in the direction image. Experiments show that the proposed algorithm performs the same level of correct identification as a conventional algorithm does, while speeding up the overall processing significantly by reducing the length of the feature vector.