• Journal of Intelligence and Information Systems
• /
• v.19 no.1
• /
• pp.19-33
• /
• 2013

In this research, a proposed Dynamic Virtual Ontology using Tags (DyVOT) supports dynamic search of resources depending on user's requirements using tags from social web driven resources. It is general that the tags are defined by annotations of a series of described words by social users who usually tags social information resources such as web-page, images, u-tube, videos, etc. Therefore, tags are characterized and mirrored by information resources. Therefore, it is possible for tags as meta-data to match into some resources. Consequently, we can extract semantic relationships between tags owing to the dependency of relationships between tags as representatives of resources. However, to do this, there is limitation because there are allophonic synonym and homonym among tags that are usually marked by a series of words. Thus, research related to folksonomies using tags have been applied to classification of words by semantic-based allophonic synonym. In addition, some research are focusing on clustering and/or classification of resources by semantic-based relationships among tags. In spite of, there also is limitation of these research because these are focusing on semantic-based hyper/hypo relationships or clustering among tags without consideration of conceptual associative relationships between classified or clustered groups. It makes difficulty to effective searching resources depending on user requirements. In this research, the proposed DyVOT uses tags and constructs ontologyfor effective search. We assumed that tags are extracted from user requirements, which are used to construct multi sub-ontology as combinations of tags that are composed of a part of the tags or all. In addition, the proposed DyVOT constructs ontology which is based on hierarchical and associative relationships among tags for effective search of a solution. The ontology is composed of static- and dynamic-ontology. The static-ontology defines semantic-based hierarchical hyper/hypo relationships among tags as in (http://semanticcloud.sandra-siegel.de/) with a tree structure. From the static-ontology, the DyVOT extracts multi sub-ontology using multi sub-tag which are constructed by parts of tags. Finally, sub-ontology are constructed by hierarchy paths which contain the sub-tag. To create dynamic-ontology by the proposed DyVOT, it is necessary to define associative relationships among multi sub-ontology that are extracted from hierarchical relationships of static-ontology. The associative relationship is defined by shared resources between tags which are linked by multi sub-ontology. The association is measured by the degree of shared resources that are allocated into the tags of sub-ontology. If the value of association is larger than threshold value, then associative relationship among tags is newly created. The associative relationships are used to merge and construct new hierarchy the multi sub-ontology. To construct dynamic-ontology, it is essential to defined new class which is linked by two more sub-ontology, which is generated by merged tags which are highly associative by proving using shared resources. Thereby, the class is applied to generate new hierarchy with extracted multi sub-ontology to create a dynamic-ontology. The new class is settle down on the ontology. So, the newly created class needs to be belong to the dynamic-ontology. So, the class used to new hyper/hypo hierarchy relationship between the class and tags which are linked to multi sub-ontology. At last, DyVOT is developed by newly defined associative relationships which are extracted from hierarchical relationships among tags. Resources are matched into the DyVOT which narrows down search boundary and shrinks the search paths. Finally, we can create the DyVOT using the newly defined associative relationships. While static data catalog (Dean and Ghemawat, 2004; 2008) statically searches resources depending on user requirements, the proposed DyVOT dynamically searches resources using multi sub-ontology by parallel processing. In this light, the DyVOT supports improvement of correctness and agility of search and decreasing of search effort by reduction of search path.

• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.55-79
• /
• 2013

In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1529-1532
• /
• 2003

최근 인터넷과 모바일 시스템이 급속히 발달함에 따라 이를 통하여 지리정보와 같은 공간데이터를 제공하는 서비스가 증가하였다. 이는 대용량 데이터에 대한 관리 및 빠른 처리와 급증하는 사용자에 대한 높은 동시처리량 및 높은 안정성을 요구하였고, 이를 해결하기 위하여 비공유 공간 데이터베이스 클러스터가 개발되었다. 비공유 공간 데이터베이스 클러스터는 고가용성을 위한 구조로서 문제가 발생할 경우 다른 백업노드가 대신하여 서비스를 지속시킨다. 그러나 기존의 비공유 공간 데이터베이스 클러스터는 클러스터 구성에 대한 회복을 위하여 로그를 계속 유지하므로 로그를 남기기 위해 보통의 질의처리 성능이 저하되었으며 로그 유지를 위한 비용이 증가하였다. 또한 노드단위의 로그를 갖기 때문에 클러스터 구성에 대한 회복이 직렬적으로 이루어져 고가용성을 위한 빠른 회복이 불가능 하였다. 따라서 본 논문에서는 비공유 공간 데이터베이스 클러스터에서 고가용성을 위한 병렬 회복 기법을 제안한다. 이를 위해 클러스터 구성에 대한 회복을 위한 클러스터 로그를 정의한다. 정의된 클러스터 로그는 마스터 테이블이 존재하는 노드에서 그룹내 다른 노드가 정지된 것을 감지할 때 남기기 시작한다. 정지된 노드는 자체회복을 마친 후 클러스터 구성에 대한 회복을 하는 단계에서 존재하는 복제본 테이블 각각에 대한 클러스터 로그를 병렬적으로 받아 회복을 한다. 따라서 정지된 노드가 발생할 경우에만 클러스터 로그를 남기므로 보통의 질의처리의 성능 저하가 없고 클러스터 로그 유지 비용이 적으며, 클러스터 구성에 대한 회복시 테이블단위의 병렬적인 회복으로 대용량 데이터인 공간데이터에 대해 빠르게 회복할 수 있어 가용성을 향상시킨다.들을 문법으로 작성하였으며, PGS를 통해 생성된 어휘 정보를 가지고 스캐너를 구성하였으며, 파싱테이블을 가지고 파서를 설계하였다. 파서의 출력으로 AST가 생성되면 번역기는 AST를 탐색하면서 의미적으로 동등한 MSIL 코드를 생성하도록 시스템을 컴파일러 기법을 이용하여 모듈별로 구성하였다.적용하였다.n rate compared with conventional face recognition algorithms. 아니라 실내에서도 발생하고 있었다. 정량한 8개 화합물 각각과 총 휘발성 유기화합물의 스피어만 상관계수는 벤젠을 제외하고는 모두 유의하였다. 이중 톨루엔과 크실렌은 총 휘발성 유기화합물과 좋은 상관성 (톨루엔 0.76, 크실렌, 0.87)을 나타내었다. 이 연구는 톨루엔과 크실렌이 총 휘발성 유기화합물의 좋은 지표를 사용될 있고, 톨루엔, 에틸벤젠, 크실렌 등 많은 휘발성 유기화합물의 발생원은 실외뿐 아니라 실내에도 있음을 나타내고 있다.>10)의 $[^{18}F]F_2$를 얻었다. 결론: $^{18}O(p,n)^{18}F$ 핵반응을 이용하여 친전자성 방사성동위원소 $[^{18}F]F_2$를 생산하였다. 표적 챔버는 알루미늄으로 제작하였으며 본 연구에서 연구된 $[^{18}F]F_2$가스는 친핵성 치환반응으로 방사성동위원소를 도입하기 어려운 다양한 방사성의 약품개발에 유용하게 이용될 수 있을 것이다.었으나 움직임 보정 후 영상을 이용하여 비교한 경우, 결합능 변화가 선조체 영역에서 국한되어 나타나며 그 유의성이 움직임 보정 전에 비하여 낮음을 알 수 있었다. 결론: 뇌활성화 과제 수행시에 동반되는

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.6
• /
• pp.354-367
• /
• 2010

There are many methods for analyzing patterns in time series data. Although stock data represents a time series, there are few studies on stock pattern analysis and prediction. Since people believe that stock price changes randomly we cannot predict stock prices using a scientific method. In this paper, we measured the degree of the randomness of stock prices using Kolmogorov complexity, and we showed that there is a strong correlation between the degree and the accuracy of stock price prediction using our semi-global alignment method. We transformed the stock price data to quantized string sequences. Then we measured randomness of stock prices using Kolmogorov complexity of the string sequences. We use KOSPI 690 stock data during 28 years for our experiments and to evaluate our methodology. When a high Kolmogorov complexity, the stock price cannot be predicted, when a low complexity, the stock price can be predicted, but the prediction ratio of stock price changes of interest to investors, is 12% prediction ratio for short-term predictions and a 54% prediction ratio for long-term predictions.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.2
• /
• pp.117-122
• /
• 2014

The minimal pairs mean the pairs that have same phonotactics except just one sound in the sequences cause different lexical items. This paper proposes the searching tool of minimal pairs for efficiency of phonological researches with minimal pairs. We suggest a guide to develop Korean minimal pair searching programs by comparing to other programs. Proposing tool has user-friendly interface, minimizing key inputs, for linguistics who are not fluent in computer programs. And it serves the function which classifies the words in dictionary for the detailed researches. And for efficiency, it increases speed of dictionary loading by separating syllables through Unicode analysis, and optimizes dictionary structure for searching efficiency. The searching algorithm gains in speed by hashing algorithm using syllable counts. In our tool, the speed is improved more than earlier version about 5 times at converting dictionary and about 3 times at searching.

• The Journal of the Korea Contents Association
• /
• v.7 no.9
• /
• pp.81-88
• /
• 2007

Having been speed development of information delivery using the mobile phone, it is generalization. The Mobile has one of the importance for their information searcher as tool. It is widely recognized that tourism information can be defined as useful and reliable reference which significantly influence the traveler' decision-making. This paper presents pioneer and ongoing study of the method for the pinpionting mobile tourism information system with RTLS, 2D Barcode and mobile phone itself. And, this paper relief that benefit and influence of TCO a view on the business administration points.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.1
• /
• pp.15-30
• /
• 2007

The purpose of this study is to explore essential factors of influencing user's usage intentions on telematics services and to find relationships among factors. This study derives several variables and hypotheses through literature reviews on the extended research model based on Davis's Technology Acceptance Model. With the objective of statistical verification, derived variables were sorted into meaningful categories through various statistical packages. These were included multiple regression analysis to improve the reliability of survey data. The demand analysis was conducted by targeting on users who have previously experienced telematics services. Indicated analyzed results which 'suitability', 'localization', and 'instant connectivity' variables were positively related to the user's usage intentions, especially accuracy of information variable. The factors of influencing the usage intention on telematics services can be useful empirical data in order to analyze the market trends and to suggest industrial or political guideline of telematics services.

• Annual Conference on Human and Language Technology
• /
• 1994.11a
• /
• pp.409-415
• /
• 1994

Hitel 과 같은 전자정보 시스템은 사용자가 원하는 정보를 체계적으로 얻을 수 있도록 하기 위하여 메뉴들을 적당히 계층적으로 구성하여 제공하고 있다. 그러나, 보통 이 메뉴들의 계층이 정확한 분류법에 기초하여 만들어지지 않았을 뿐 아니라 그 양도 엄청나게 방대하여, 이 메뉴 계층을 이용하여 사용자가 원하는 정보를 얻기가 쉽지 않다. 실험적으로 보통 Hitel을 자주 이용하는 사람들도 자신이 주로 이용하는 메뉴들의 구성만 이해하고 있을뿐, 사용하지 않는 부분의 메뉴들의 구성은 잘 알지 못하는 것이 일반적이었다. 따라서 Hitel을 자주 이용하는 사용자도 자신이 이용해 보지 않은 정보를 얻기 쉽지 않으며, 더더욱 초보자에게는 이 메뉴계층을 이용하여 원하는 정보를 얻기가 쉽지 않은 실정이다. 본 연구에서는 정보검색 기술을 이용하여 Hitel과 같은 전자정보 시스템에서 사용자가 쉽게 자신이 원하는 정보를 얻을 수 있는 보조 시스템을 개발하고자 한다. 본 시스템은 사용자가 메뉴계층을 이용하기 전에 간략한 자연어로 입력을 주면, 여기에 적합한 메뉴나 실제 정보를 검색해 낸다. 따라서 사용자는 이 메뉴정보를 이용하여 메뉴계층을 쉽게 따라갈 수 있을 뿐 아니라, 경우에 따라서는 원하는 실제 정보를 검색하기 때문에 메뉴계층을 탐색할 필요가 없다. 본 연구에서는 자연어 입력을 최장 일치 방법으로 의미있는 명사들을 추출하여 불리한 질의어로 만든 후, 명사들 사이의 관계가 표현된 시소러스를 이용하여 이 질의어를 확장시킨다. 다음에 이 질의어들을 메뉴들과 부분/정확부합을 통하여 관련된 메뉴들을 찾아낸 후, 이들의 계층과제를 고려하여 최종 메뉴들을 검색한다. 본 시스템은 현재 C언어로 만들어져 구동중이며, 정확한 실험은 아직 하지 않았지만 높은 검색율을 보이고 있다. industrialized, was improved by introducing pressure in cooling procedure for both carbon and iron thermistors.er>$CHCl_3$>Hexane층 순으로 높은 활성을 나타냈다. 5. 아질산염소거능은 끝순, 들깨잎, 콩나물이 우수하였고 그중 들깨잎이 저해율 72%로 가장 높았으며, 용매분획 중에는 BuOH과 water추출물의 활성이 가장 높았다. 6. ACE 저해 효과는 고구마 부위별로는 끝순이 괴근에 비하여 1.5배 높았고, 들깨잎, 콩나물, 시금치보다 $1.9{\sim}3.7$배 높았다. 용매분획별로는 EtOAc, BuOH, water 추출물이 높은 활성을 보였다. 7. 이상을 종합하여 볼 때 고구마 끝순에는 페놀화합물이 다량 함유되어 있어 높은 항산화 활성을 가지며, 아질산염소거능 및 ACE저해활성과 같은 생리적 효과도 높아 기능성 채소로 이용하기에 충분한 가치가 있다고 판단된다.등의 관련 질환의 예방, 치료용 의약품 개발과 기능성 식품에 효과적으로 이용될 수 있음을 시사한다.tall fescue 23%, Kentucky bluegrass 6%, perennial ryegrass 8%) 및 white clover 23%를 유지하였다. 이상의 결과를 종합할 때, 초종과 파종비율에 따른 혼파초지의 건물수량과 사료가치의 차이를 확인할 수 있었으며, 레드 클로버 + 혼파 초지가 건물수량과 사료가치를 높이는데 효과적이었다.\ell}$ 이었으며 , yeast extract 첨가(添加)하여 배양시(培養時)는 yeast extract 농도(濃度)가 증가(增加)함에 따라 단백질(蛋白質) 함량(含量)도 증가(增加)하였다. 7. CHS-

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.1
• /
• pp.47-58
• /
• 2013

This study offers a $3{\times}2$ matrix on the development method pursuant to the level of readiness and necessity for IS of SMEs, and the Delphi method survey through the assistance of a panel of IT experts was employed. Upon analyzing the results, in all rounds, the 1st quadrant and 2nd quadrant resulted in a preference for leasing methods (ASP/SaaS) and the other quadrants resulted in a preference for outsourcing. Quadrants closer to the 1st quadrant showed a preference for leasing methods (ASP/SaaS) and quadrants closer to the 6th quadrant showed a preference for outsourcing. In the case of the IS implementation for the entire company, all three levels of readiness resulted in a preference for outsourcing. The point in which the implementation method changed depending on the level of readiness was when unit systems were implemented, and among the implementation methods, in-house development showed the lowest results.

• Journal of The Korean Association For Science Education
• /
• v.36 no.4
• /
• pp.629-641
• /
• 2016

Understanding of how teachers change instruction can help predict what kind of educational materials is supportive or appropriate. On the basis of this idea, we explored elementary teachers' PCK progression on specific topics of astronomy: planet size and distance in solar system. To identify the development of PCK over time, we utilized learning progression (LP) as a conceptual framework. The progression of teacher PCK can also be illustrated as the hypothetical pathway from novice to expert like LP. Eight 5th grade elementary teachers participated in this study. We observed participating teachers' astronomy classes with the same topic. In order to document topic-specific PCK of participating teachers, we developed an analytic protocol consisting of four categories: knowledge of curriculum, knowledge of teaching strategies, knowledge of assessment, and astronomical thinking practice. In addition, we monitored the changes in the four participating teachers' PCK for two years in order to validate the evidences of the PCK progression. Participating teachers in this study took some intervention by attending a four-week pre-meeting with the researchers to profile an adaptive instruction. Through this research, we profiled four and five different levels of PCK progressions in three knowledge components (curriculum, teaching strategies, student assessment) and one astronomical thinking practice (systems thinking), respectively. Participating teachers demonstrated various levels and pathways in each component of PCK. This study released the empirical evidences in fostering instructional scaffolding, which is appropriate to the level of PCK of science teachers on specific topic.