• Title/Summary/Keyword: heuristics

Search Result 517, Processing Time 0.024 seconds

The Effects of Tasks Setting for Mathematical Modelling in the Complex Real Situation (실세계 상황에서 수학적 모델링 과제설정 효과)

  • Shin, Hyun-Sung;Lee, Myeong-Hwa
    • Journal of the Korean School Mathematics Society
    • /
    • v.14 no.4
    • /
    • pp.423-442
    • /
    • 2011
  • The purpose of this study was to examine the effects of tasks setting for mathematical modelling in the complex real situations. The tasks setting(MMa, MeA) in mathematical modelling was so important that we can't ignore its effects to develop meaning and integrate mathematical ideas. The experimental setting were two groups ($N_1=103$, $N_2=103$) at public high school and non-experimental setting was one group($N_3=103$). In mathematical achievement, we found meaningful improvement for MeA group on modelling tasks, but no meaningful effect on information processing tasks. The statistical method used was ACONOVA analysis. Beside their achievement, we were much concerned about their modelling approach that TSG21 had suggested in Category "Educational & cognitive Midelling". Subjects who involved in experimental works showed very interesting approach as Exploration, analysis in some situation ${\Rightarrow}$ Math. questions ${\Rightarrow}$ Setting models ${\Rightarrow}$ Problem solution ${\Rightarrow}$ Extension, generalization, but MeA group spent a lot of time on step: Exploration, analysis and MMa group on step, Setting models. Both groups integrated actively many heuristics that schoenfeld defined. Specially, Drawing and Modified Simple Strategy were the most powerful on approach step 1,2,3. It was very encouraging that those experimental setting was improved positively more than the non-experimental setting on mathematical belief and interest. In our school system, teaching math. modelling could be a answer about what kind of educational action or environment we should provide for them. That is, mathematical learning.

  • PDF

Ramp Activity Expert System for Scheduling and Co-ordination (공항의 계류장 관리 스케줄링 및 조정을 위한 전문가시스템)

  • Jo, Geun-Sik;Yang, Jong-Yoon
    • Journal of Advanced Navigation Technology
    • /
    • v.2 no.1
    • /
    • pp.61-67
    • /
    • 1998
  • In this paper, we have described the Ramp Activity Coordination Expert System (RACES) which can solve aircraft parking problems. RACES includes a knowledge-based scheduling problem which assigns every daily arriving and departing flight to the gates and remote spots with the domain specific knowledge and heuristics acquired from human experts. RACES processes complex scheduling problem such as dynamic inter-relations among the characteristics of remote spots/gates and aircraft with various other constraints, for example, custome and ground handling factors at an airport. By user-driven modeling for end users and knowledge-driven near optimal scheduling acquired from human experts, RACES can produce parking schedules of aircraft in about 20 seconds for about 400 daily flights, whereas it normally takes about 4 to 5 hours by human experts. Scheduling results in the form of Gantt charts produced by the RACES are also accepted by the domain experts. RACES is also designed to deal with the partial adjustment of the schedule when unexpected events occur. After daily scheduling is completed, the messages for aircraft changes and delay messages are reflected and updated into the schedule according to the knowledge of the domain experts. By analyzing the knowledge model of the domain expert, the reactive scheduling steps are effectively represented as rules and the scenarios of the Graphic User Interfaces (GUI) are designed. Since the modification of the aircraft dispositions such as aircraft changes and cancellations of flights are reflected to the current schedule, the modification should be notified to RACES from the mainframe for the reactive scheduling. The adjustments of the schedule are made semi-automatically by RACES since there are many irregularities in dealing with the partial rescheduling.

  • PDF

Boolean Query Formulation From Korean Natural Language Queries using Syntactic Analysis (구문분석에 기반한 한글 자연어 질의로부터의 불리언 질의 생성)

  • Park, Mi-Hwa;Won, Hyeong-Seok;Lee, Geun-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.10
    • /
    • pp.1219-1229
    • /
    • 1999
  • 일반적으로 AND, OR, NOT과 같은 연산자를 사용하는 불리언 질의는 사용자의 검색의도를 정확하게 표현할 수 있기 때문에 검색 전문가들은 불리언 질의를 사용하여 높은 검색성능을 얻는다고 알려져 있지만, 일반 사용자는 자신이 원하는 정보를 불리언 형태로 표현하는데 익숙하지 않다. 본 논문에서는 검색성능의 향상과 사용자 편의성을 동시에 만족하기 위하여 사용자의 자연어 질의를 확장 불리언 질의로 자동 변환하는 방법론을 제안한다. 먼저 자연어 질의를 범주문법에 기반한 구문분석을 수행하여 구문트리를 생성하고 연산자 및 키워드 정보를 추출하여 구문트리를 간략화한다. 다음으로 간략화된 구문트리로부터 명사구를 합성하고 키워드들에 대한 가중치를 부여한 후 불리언 질의를 생성하여 검색을 수행한다. 또한 구문분석의 오류로 인한 검색성능 저하를 최소화하기 위하여 상위 N개 구문트리에 대해 각각 불리언 질의를 생성하여 검색하는 N-BEST average 방법을 제안하였다. 정보검색 실험용 데이타 모음인 KTSET2.0으로 실험한 결과 제안된 방법은 수동으로 추출한 불리언 질의보다 8% 더 우수한 성능을 보였고, 기존의 벡터공간 모델에 기반한 자연어질의 시스템에 비해 23% 성능향상을 보였다. Abstract There have been a considerable evidence that trained users can achieve a good search effectiveness through a boolean query because a structural boolean query containing operators such as AND, OR, and NOT can make a more accurate representation of user's information need. However, it is not easy for ordinary users to construct a boolean query using appropriate boolean operators. In this paper, we propose a boolean query formulation method that automatically transforms a user's natural language query into a extended boolean query for both effectiveness and user convenience. First, a user's natural language query is syntactically analyzed using KCCG(Korean Combinatory Categorial Grammar) parser and resulting syntactic trees are structurally simplified using a tree-simplifying mechanism in order to catch the logical relationships between keywords. Next, in a simplified tree, plausible noun phrases are identified and added into the same tree as new additional keywords. Finally, a simplified syntactic tree is automatically converted into a boolean query using some mapping rules and linguistic heuristics. We also propose an N-BEST average method that uses top N syntactic trees to compensate for bad effects of single incorrect top syntactic tree. In experiments using KTSET2.0, we showed that a proposed method outperformed a traditional vector space model by 23%, and surprisingly manually constructed boolean queries by 8%.

Fast Selection of Composite Web Services Based on Workflow Partition (워크플로우 분할에 기반한 복합 웹 서비스의 빠른 선택)

  • Jang, Jae-Ho;Shin, Dong-Hoon;Lee, Kyong-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.5
    • /
    • pp.431-446
    • /
    • 2007
  • Executable composite Web services are selected by binding a given abstract workflow with the specific Web services that satisfy given QoS requirements. Considering the rapidly increasing number of Web services and their highly dynamic QoS environment, the fast selection of composite services is important. This paper presents a method for quality driven comosite Web services selection based on a workflow partition strategy. The proposed method partitions an abstract workflow into two sub-workflows to decrease the number of candidate services that should be considered. The QoS requirement is also decomposed for each partitioned workflow. Since the decomposition of a QoS requirement is based on heuristics, the selection might fail to find composite Web services. To avoid such a failure, the tightness of a QoS requirement is defined and a workflow is determined to be partitioned according to the tightness. A mixed integer linear programming is utilized for the efficient service selection. Experimental results show that the success rate of partitioning is above 99%. Particularly, the proposed method performs faster and selects composite services whose qualities are not significantly different (less than 5%) from the optimal one.

WordNet-Based Category Utility Approach for Author Name Disambiguation (저자명 모호성 해결을 위한 개념망 기반 카테고리 유틸리티)

  • Kim, Je-Min;Park, Young-Tack
    • The KIPS Transactions:PartB
    • /
    • v.16B no.3
    • /
    • pp.225-232
    • /
    • 2009
  • Author name disambiguation is essential for improving performance of document indexing, retrieval, and web search. Author name disambiguation resolves the conflict when multiple authors share the same name label. This paper introduces a novel approach which exploits ontologies and WordNet-based category utility for author name disambiguation. Our method utilizes author knowledge in the form of populated ontology that uses various types of properties: titles, abstracts and co-authors of papers and authors' affiliation. Author ontology has been constructed in the artificial intelligence and semantic web areas semi-automatically using OWL API and heuristics. Author name disambiguation determines the correct author from various candidate authors in the populated author ontology. Candidate authors are evaluated using proposed WordNet-based category utility to resolve disambiguation. Category utility is a tradeoff between intra-class similarity and inter-class dissimilarity of author instances, where author instances are described in terms of attribute-value pairs. WordNet-based category utility has been proposed to exploit concept information in WordNet for semantic analysis for disambiguation. Experiments using the WordNet-based category utility increase the number of disambiguation by about 10% compared with that of category utility, and increase the overall amount of accuracy by around 98%.

A Scenario-based Goal-oriented Approach for Use Case Modeling (유즈케이스 모델링을 위한 시나리오 근간의 목표(Goal)지향 분석 방안)

  • Lee, Jae-Ho;Kim, Jae-Seon;Park, Soo-Yong
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.4
    • /
    • pp.211-224
    • /
    • 2002
  • As system become larger and more complex, it is important to correctly analyze and specify user's requirements. Use case modeling is widely used in Object-Oriented Analysis and Design(OOAD) and Component-Based Development(CBD). It is useful to mitigate the complexity of the requirements analysis. However, use cases are difficult to be structured, to explicitly represent non-functional requirements, and to analyze what is affected by changes of use cases. To alleviate these problems, we propose scenario-based goal-oriented approach for use case modeling. The approach is to apply goal-oriented analysis method to use case model. Since goal-oriented analysis method is not systematic and heuristics is considerably involved, we adopted scenarios as the basis for the goal extraction. The proposed method is applied to City Bus Information Subsystem(CBIS) in Intelligent Transport Systems(ITS) domain. The proposed approach helps software engineer to analyze what is affected by use case's changes and represent non-functional requirements.

Implementation of an Efficient Microbial Medical Image Retrieval System Applying Knowledge Databases (지식 데이타베이스를 적용한 효율적인 세균 의료영상 검색 시스템의 구현)

  • Shin Yong Won;Koo Bong Oh
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.1 s.33
    • /
    • pp.93-100
    • /
    • 2005
  • This study is to desist and implement an efficient microbial medical image retrieval system based on knowledge and content of them which can make use of more accurate decision on colony as doll as efficient education for new techicians. For this. re first address overall inference to set up flexible search path using rule-base in order U redure time required original microbial identification by searching the fastest path of microbial identification phase based on heuristics knowledge. Next, we propose a color ffature gfraction mtU, which is able to extract color feature vectors of visual contents from a inn microbial image based on especially bacteria image using HSV color model. In addition, for better retrieval performance based on large microbial databases, we present an integrated indexing technique that combines with B+-tree for indexing simple attributes, inverted file structure for text medical keywords list, and scan-based filtering method for high dimensional color feature vectors. Finally. the implemented system shows the possibility to manage and retrieve the complex microbial images using knowledge and visual contents itself effectively. We expect to decrease rapidly Loaming time for elementary technicians by tell organizing knowledge of clinical fields through proposed system.

  • PDF

Optimizing Similarity Threshold and Coverage of CBR (사례기반추론의 유사 임계치 및 커버리지 최적화)

  • Ahn, Hyunchul
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.8
    • /
    • pp.535-542
    • /
    • 2013
  • Since case-based reasoning(CBR) has many advantages, it has been used for supporting decision making in various areas including medical checkup, production planning, customer classification, and so on. However, there are several factors to be set by heuristics when designing effective CBR systems. Among these factors, this study addresses the issue of selecting appropriate neighbors in case retrieval step. As the criterion for selecting appropriate neighbors, conventional studies have used the preset number of neighbors to combine(i.e. k of k-nearest neighbor), or the relative portion of the maximum similarity. However, this study proposes to use the absolute similarity threshold varying from 0 to 1, as the criterion for selecting appropriate neighbors to combine. In this case, too small similarity threshold value may make the model rarely produce the solution. To avoid this, we propose to adopt the coverage, which implies the ratio of the cases in which solutions are produced over the total number of the training cases, and to set it as the constraint when optimizing the similarity threshold. To validate the usefulness of the proposed model, we applied it to a real-world target marketing case of an online shopping mall in Korea. As a result, we found that the proposed model might significantly improve the performance of CBR.

The Visualization Evaluation of Traffic Apps using Heuristics Techniques (휴리스틱 기법을 이용한 교통정보 어플리케이션의 시각화 평가)

  • Cho, Hyun-Ji;Nam, Doohee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.13 no.3
    • /
    • pp.89-95
    • /
    • 2014
  • Traffic information is closely related to our daily lives. Thanks to the development of portable electronic devices, we can get traffic information rather easily. In particular, Most of traffic informations are being provided through mobile apps due to the spread of smartphones. Accordingly, to improve usability is emerged significant challenge. Therefore, this paper perform comparative evaluation for four traffic mobile apps which is currently being offered in our country and draw user needs. Then we suggest direction of traffic information apps for the future. First, We summarized research trend on information visualization and techniques which is used to traffic mobile apps with introduction traffic mobile apps. We adopted heuristic evaluation technique which is suitable for evaluating visualization and drew evaluation elements for traffic information visualization. Then, We conducted a survey based on evaluation elements so we was able to give objectivity to evaluation of information visualization which was could subjective. Based on the results we could derive results of evaluation of visualization for four traffic mobile apps. We expect that the results of this study will be contributed to develop of traffic information visualization services.

An Analysis of Effectiveness of Economic Sanctions and Inducements and Implications for Policies towards North Korea Based on Theoretical Applications from Prospect Theory (경제제재와 경제지원의 효과 분석 및 대북정책에 대한 시사점: 전망이론적 논의)

  • Park, Ji-Youn;Jo, Dongho
    • KDI Journal of Economic Policy
    • /
    • v.35 no.1
    • /
    • pp.1-32
    • /
    • 2013
  • Economic sanctions and inducements are types of 'policy instruments' based on 'economic tools' to influence other international actors. Ongoing debates on sanctions and inducements have exposed drawbacks for relying on individual case studies. There are some studies in the literature that attempt theoretical analysis of sanctions and inducements, but they are mostly based on rational choice theory. In reality, however, there exist so many cases that cannot be explained by rational choice theory. These are called anomalies or exceptions. The literature introduces specific variables to interpret these anomalies and thus sacrifice the universality of the theory. From this point of view, prospect theory would present an effective tool to analyze economic sanctions and inducements. It is a behavioral economic theory that tries to model a decisions making process in reality. The theory says that people make decisions based on subjective value of losses and gains from an individual reference point, and that people evaluate these losses and gains using heuristics. Thus prospect theory could offer a different frame which has greater explanatory range without adding new variables. As a result of this study, target's losses of 'back down' towards economic sanctions loom larger when the reference point level increases, therefore, the effectiveness of sanctions decreases. However, target's losses of 'stand firm' towards economic inducements loom larger under the same condition of reference point, therefore, the effectiveness of inducements increases. The findings of the paper suggest meaningful implications to the economic policy towards North Korea.

  • PDF