• Journal of Mechanical Science and Technology
• /
• v.19 no.2
• /
• pp.558-566
• /
• 2005

We propose a feature-based multi-resolution representation of B-rep solid models using history-based Boolean operations based on the merge-and-select algorithm. Because union and subtraction are commutative in the history-based Boolean operations, the integrity of the models at various levels of detail (LOD) is guaranteed for the reordered features regardless of whether the features are subtractive or additive. The multi-resolution solid representation proposed in this paper includes a non-manifold topological merged-set model of all feature primitives as well as a feature-modeling tree reordered consistently with a given LOD criterion. As a result, a B-rep solid model for a given LOD can be provided quickly, because the boundary of the model is evaluated without any geometric calculation and extracted from the merged set by selecting the entities contributing to the LOD model shape.

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.593-598
• /
• 2003

Machine learning organizes knowledge for efficient and accurate reuse. This paper is concerned with methods of concept learning from examples, which glean knowledge from a training set of preclassified ‘objects’. Ideally, training facilitates classification of novel, previously unseen objects. However, every learning system relies on processing and representation assumptions that may be detrimental under certain circumstances. We explore the biases of a well-known learning system, ID3, review improvements, and introduce some improvements of our own, each designed to yield accurate and pedagogically sound classification.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.42-53
• /
• 2007

Looking back the history of formal treatment of linguistics, we cannot disregard the contribution of possible world semantics. Intensional logic of Montague semantics, DRT (Discourse Representation Theory), mental space, and situation theory are closely related to or compared with the notion of possible world. All these theories have commonly clarified the structure of belief context or uncertain knowledge, employing hypothesized worlds. In this talk, I firstly brief the pedigree of these theories. Next, I will introduce the recent development of modal logic for the representation of (i) knowledge and belief and (ii) time, in which belief modality is precisely discussed together with the accessibility among possible worlds. I will refer to BDI (belief-desire-intention) logic, CTL (computational tree logic), and sphere-based model in belief revision. Finally, I will discuss how these theories could be applied to the further development of analyses of natural language.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.509-516
• /
• 2001

As results of many genome projects, genomic sequences of many organisms are revealed. Various methods such as global alignment, local alignment are used to analyze the sequences of the organisms, and k -mer analysis is one of the methods for analyzing the genomic sequences. The k -mer analysis explores the frequencies of all k-mers or the symmetry of them where the k -mer is the sequenced base with the length of k. However, existing on-memory algorithms are not applicable to the k -mer analysis because a whole genomic sequence is usually a large text. Therefore, efficient data structures and algorithms are needed. String B-tree is a good data structure that supports external memory and fits into pattern matching. In this paper, we improve the string B-tree in order to efficiently apply the data structure to k -mer analysis, and the results of k -mer analysis for C. elegans and other 30 genomic sequences are shown. We present a visualization system which enables users to investigate the distribution and symmetry of the frequencies of all k -mers using CGR (Chaotic Game Representation). We also describe the method to find the signature which is the part of the sequence that is similar to the whole genomic sequence.

• Environmental Engineering Research
• /
• v.21 no.2
• /
• pp.152-163
• /
• 2016

Present study investigates the potential of cassava peel and rubber tree bark for the removal of Cr (VI) from aqueous solution. Removal efficiency of more than 99% was obtained during the kinetic adsorption experiments with dosage of 3.5 g/L for cassava peel and 8 g/L for rubber tree bark. By comparing popular isotherm models and kinetic models for evaluating the kinetics of mass transfer, it was observed that Redlich-Peterson model and Langmuir model fitted well ($R^2$ > 0.99) resulting in maximum adsorption capacity as 79.37 mg/g and 43.86 mg/g for cassava peel and rubber tree bark respectively. Validation of pseudo-second order model and Elovich model indicated the possibility of chemisorption being the rate limiting step. The multi-linearity in the diffusion model was further addressed using multi-sites models (two-site series interface (TSSI) and two-site parallel interface (TSPI) models). Considering the influence of interface properties on the kinetic nature of sorption, TSSI model resulted in low mass transfer rate (5% for cassava peel and 10% for rubber tree bark) compared to TSPI model. The study highlights the employability of two-site sorption model for simultaneous representation of different stages of kinetic sorption for finding the rate-limiting process, compared to the separate equilibrium and kinetic modeling attempts.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.2
• /
• pp.176-184
• /
• 2000

Possible representation methods for the product structure have been compared and analyzed to determine optimal disassembly path of a product. Petri net is selected as the most optimal method to represent disassembly path of the product. In this method, a reachability tree for the product is generated and disassembly time for each path is calculated. A path with the smallest disassembly time is selected as the optimal path. A software far DPN(Disassembly Petri Net) has been developed and applied to search the optimal disassembly path for a ballpoint pen disassembly process as an example.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.838-840
• /
• 1999

In this paper, modeling and analysis of discrete event systems by temporal logic frame works and petri net is considered. The reachability tree of the petri net can be used to solve the safeness, boundedness, conservation and coverability problems of discrete event systems. But the reachability tree of the petri net do not solve reachability and liveness problems in general. We proposed a method that synthesised the petri net and the temporal logic frameworks. This method slove some problems of petri net by logical representation of temporal logic frameworks.

• Journal of Forest and Environmental Science
• /
• v.31 no.2
• /
• pp.73-77
• /
• 2015

Acquiring accurate quantitative and qualitative information is necessary for the technical and scientific management of forest stands. In this study, stratification and systematic random sampling methods were used to estimation of quantitative characteristics in study area. The estimator ($((E%)^2xT)$) was used to compare the systematic random and stratified sampling methods. 100 percent inventory was carried out in an area of 400 hectares; characteristics as: tree density, crown cover (canopy), and basal area were measured. Tree density of stands was compared through systemic random and stratified sampling methods. Findings of the study reveal that stratified sampling method gives a better representation of estimates than systematic random sampling.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.147-153
• /
• 2001

This paper presents techniques for discovering rules with elastic patterns. Elastic patterns are useful for discovering rules from data sequences with different sampling rates. For fast discovery of rules whose heads and bodies are elastic patterns, we construct a suffix tree from succinct forms of data sequences. The suffix tree is a compact representation of rules, and is also used as an index structure for finding rules matched to a target head sequence. When matched rules cannot be found, the concept of rule relaxation is introduced. Using a cluster hierarchy and a relaxation error, we find the least relaxed rules that provide the most specific information on a target head sequence. Performance evaluation through extensive experiments reseals the effectiveness of the proposed approach.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.277-280
• /
• 2007

통신 시스템에 대한 관심은 인터넷의 급격한 발전에 의해 가상공간의 출현과 유비쿼터스 컴퓨팅 환경 구축에 대한 요구가 증대됨에 따라 관련 이론 및 기술의 발전을 주도해 왔다. 이와 관련한 문제들 중에 가장 근간이 되는 문제들 중 하나는 최적 통신 걸침 나무 (OCST: Optimal Communication Spanning Tree) 문제이다. 본 논문에서는 이러한 최적 통신 걸침 나무 문제를 해결하기 위해 유전 알고리즘 (GA)를 이용한다. 유전 알고리즘을 이용함에 있어서 중요한 단계중 하나는 유전자표현을 어떻게 문제에 적합하게 설계하느냐이다. 본 논문에서는 걸침나무를 표현하기 위해 기존의 $Pr\ddot{u}fer$수 기반의 유전자 표현법을 개선하여 n개의 노드에 대해 n-2개의 숫자열로 표현가능하면서도 보다 더 최적 통신 걸침 문제에 적합하도록 고안한 새로운 유전자 표현법을 이용한다. 임의로 생성된 예제에 대한 수치 실험을 통해 통신시스템의 기본 문제 중 하나인 최적 통신 걸침 문제의 해법으로서의 제안 알고리즘의 유용성과 효율성을 확인한다.