• Title/Summary/Keyword: dynamic constraint satisfaction

Search Result 16, Processing Time 0.022 seconds

Pedagogically-Driven Courseware Content Generation for Intelligent Tutoring Systems

  • Hadji, Hend Ben;Choi, Ho-Jin;Jemni, Mohamed
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.12 no.1
    • /
    • pp.77-85
    • /
    • 2012
  • This paper describes a novel approach to adaptive courseware generation. This approach adopts its structure from existing intelligent tutoring systems and introduces a new component called pedagogical scenario model to support pedagogical flexibility in the adaptation process of courseware generation system. The adaptation is carried out using Dynamic Constraint Satisfaction Problem framework, which is a variant of classical Constraint Satisfaction Problem, to deliver courseware tailored to individual learner. Such a framework provides a high level of expressiveness to deal with the particular characteristics of courseware generation problem. Further, it automatically designs a sound courseware satisfying the design constraints imposed by the domain, the pedagogical scenario and learner models.

Dynamic Decision Making using Social Context based on Ontology (상황 온톨로지를 이용한 동적 의사결정시스템)

  • Kim, Hyun-Woo;Sohn, M.-Ye;Lee, Hyun-Jung
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.3
    • /
    • pp.43-61
    • /
    • 2011
  • In this research, we propose a dynamic decision making using social context based on ontology. Dynamic adaptation is adopted for the high qualified decision making, which is defined as creation of proper information using contexts depending on decision maker's state of affairs in ubiquitous computing environment. Thereby, the context for the dynamic adaptation is classified as a static, dynamic and social context. Static context contains personal explicit information like demographic data. Dynamic context like weather or traffic information is provided by external information service provider. Finally, social context implies much more implicit knowledge such as social relationship than the other two-type context, but it is not easy to extract any implied tacit knowledge as well as generalized rules from the information. So, it was not easy for the social context to apply into dynamic adaptation. In this light, we tried the social context into the dynamic adaptation to generate context-appropriate personalized information. It is necessary to build modeling methodology to adopt dynamic adaptation using the context. The proposed context modeling used ontology and cases which are best to represent tacit and unstructured knowledge such as social context. Case-based reasoning and constraint satisfaction problem is applied into the dynamic decision making system for the dynamic adaption. Case-based reasoning is used case to represent the context including social, dynamic and static and to extract personalized knowledge from the personalized case-base. Constraint satisfaction problem is used when the selected case through the case-based reasoning needs dynamic adaptation, since it is usual to adapt the selected case because context can be changed timely according to environment status. The case-base reasoning adopts problem context for effective representation of static, dynamic and social context, which use a case structure with index and solution and problem ontology of decision maker. The case is stored in case-base as a repository of a decision maker's personal experience and knowledge. The constraint satisfaction problem use solution ontology which is extracted from collective intelligence which is generalized from solutions of decision makers. The solution ontology is retrieved to find proper solution depending on the decision maker's context when it is necessary. At the same time, dynamic adaptation is applied to adapt the selected case using solution ontology. The decision making process is comprised of following steps. First, whenever the system aware new context, the system converses the context into problem context ontology with case structure. Any context is defined by a case with a formal knowledge representation structure. Thereby, social context as implicit knowledge is also represented a formal form like a case. In addition, for the context modeling, ontology is also adopted. Second, we select a proper case as a decision making solution from decision maker's personal case-base. We convince that the selected case should be the best case depending on context related to decision maker's current status as well as decision maker's requirements. However, it is possible to change the environment and context around the decision maker and it is necessary to adapt the selected case. Third, if the selected case is not available or the decision maker doesn't satisfy according to the newly arrived context, then constraint satisfaction problem and solution ontology is applied to derive new solution for the decision maker. The constraint satisfaction problem uses to the previously selected case to adopt and solution ontology. The verification of the proposed methodology is processed by searching a meeting place according to the decision maker's requirements and context, the extracted solution shows the satisfaction depending on meeting purpose.

건설 프로젝트 공정표 생성을 위한 사례기반 전문가시스템의 설계

  • 김현우;이경전;이재규
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.709-712
    • /
    • 1996
  • Generating a project network of a specific construction project is very time consuming and difficult task in the field. To effectiviely automate and support the planning process, we design a case-based project planning expert system inspired by the fact a human expert project planner uses previous cases for planning a new project. A construction project case consist of its specific characteristics and the corresponding project network (i.e. project plan). Using frame based representation. we represent the project features affecting the progress network and the entities composing the project plan such as the buildings, construction methods, WBS (work breakdown structure), activities, and resources. The project planning process runs through most similar case retrieval, case adaptation, and user requirement satisfaction. We represent the construction domain knowledge for each procedure using constraints and rules. We develop the methodology for constraint-based case adaption. Case adaptation process mainly consist of activity generation/deletion and predecence constraint satisfaction, for which we develop the dynamic constraint generation method and connect user-level requirement representation the system-level network modification knowledge. The methodology is being applied to the prototype for apartment construction project planning.

  • PDF

Scheduling System for Effective Assignment of Repair Warrant Job in Constraint Satisfaction Problems (효율적인 유지보수 작업배정을 위한 CSP기반의 스케줄링 시스템)

  • 심명수;조근식
    • Journal of Intelligence and Information Systems
    • /
    • v.6 no.2
    • /
    • pp.99-110
    • /
    • 2000
  • 오늘날의 기업은 상품을 판매하는 것 뿐만 아니라 기업의 신용과 이미지를 위해 그 상품에 대한 사후처리(After Service) 업무에 많은 투자를 하고 있다. 이러한 양질의 사후서비스를 고객에게 공급하기 위해서는 많은 인력을 합리적으로 관리해야 하며 요청되는 고장수리 서비스 업무의 신속한 해결을 위해 업무를 인력에게 합리적으로 배정을 해야 한다. 그러므로, 회사의 비용을 최소화하면서 정해진 시간에 요청된 작업을 처리하기 위해서는 인력들에게 작업을 배정하고 스케줄링하는 문제가 발생된다. 본 논문에서는 이러한 문제를 해결하기 위해서 화학계기의 A/S작업을 인력에게 합리적으로 배정 하는 스케줄링 시스템에 관한 연구이다. 먼저 스케줄링 모델을 HP사의 화학분석 및 시스템을 판매, 유지보수 해주는 Y사의 작업 스케줄을 분석하여 필요한 도메인과 고객서비스전략과 인력관리전략에서 제약조건을 추출하였고 여기에 스케줄링 문제를 해결하기 위한 방법으로 제약만족문제(CSP) 해결기법인 도메인 여과기법을 적용하였다. 도메인 여과기법은 제약조건에 의해 변수가 갖는 도메인의 불필요한 부분을 여과하는 것으로 제약조건과 관련되어 있는 변수의 도매인 크기가 축소되는 것이다. 또한, 스케줄링을 하는데에 있어서 비용적인 측면에서의 스케줄링방법과 고객만족도에서의 스케줄링 방법을 비교하여 가장 이상적인 해를 찾는데 트래이드오프(Trade-off)를 이용하여 최적의 해를 구했으며 실험을 통해 인력에게 더욱 효율적으로 작업들을 배정 할 수 있었고 또한, 정해진 시간에 많은 작업을 처리 할 수 있었으며 작업을 처리하는데 있어 소요되는 비용을 감소하는 결과를 얻을 수 있었다.

  • PDF

A Backtracking Search Framework for Constraint Satisfaction Optimization Problems (제약만족 최적화 문제를 위한 백트래킹 탐색의 구조화)

  • Sohn, Surg-Won
    • The KIPS Transactions:PartA
    • /
    • v.18A no.3
    • /
    • pp.115-122
    • /
    • 2011
  • It is very hard to obtain a general algorithm for solution of all the constraint satisfaction optimization problems. However, if the whole problem is separated into subproblems by characteristics of decision variables, we can assume that an algorithm to obtain solutions of these subproblems is easier. Under the assumption, we propose a problem classifying rule which subdivide the whole problem, and develop backtracking algorithms fit for these subproblems. One of the methods of finding a quick solution is efficiently arrange for any order of the search tree nodes. We choose the cluster head positioning problem in wireless sensor networks in which static characteristics is dominant and interference minimization problem of RFID readers that has hybrid mixture of static and dynamic characteristics. For these problems, we develop optimal variable ordering algorithms, and compare with the conventional methods. As a result of classifying the problem into subproblems, we can realize a backtracking framework for systematic search. We also have shown that developed backtracking algorithms have good performance in their quality.

A Study on the Dynamic Scheduling for Distributed Management Systems (분산관리 시스템을 위한 동적 스케쥴링의 연구)

  • Chung, Nam-Kee
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.2
    • /
    • pp.207-216
    • /
    • 1995
  • Constructing a distributed management system has its own advantages in addressing the issue of implementing a quick responsive management system in dynamically changing environment of enterprise. We suggest a basic scheduling methodology applicable to a distributed production management system. A new concept of "flexible schedule" is introduced as a tool to accommodate dynamically changing situations of job shops. Then a search technique (referred to as CSP-CBA search) is presented to obtain such a schedule for the job shop scheduling problem, which is converted into a constraint satisfaction problem(CSP), by using the constraint based analysis(CBA). This approach is tested on more than 100 test problems. The results show that the suggested approach required shorter CPU time and solved more problems in given time than another fixed schedule method.

  • PDF

A study of English vowel system (영어의 모음체계 연구)

  • Lee Jae-Young
    • MALSORI
    • /
    • no.38
    • /
    • pp.71-97
    • /
    • 1999
  • In this paper I have surveyed vowel phonemes in a variety of English accents and have proposed the vowel systems of English. The English accents covered in this paper include General American English, Northeastern American English, Western American English, Southern British English, Northern British English, Scottish English, Southern Irish English, Northern Irish English, Australian English, and New Zealand English. The vowel systems proposed here reflect the acoustic information of vowels and phonological aspects of English. This paper offers an Optimality Theory-based analysis of the English vowel systems by appealing to independently motivated constraints. This paper, following Flemming(1995), makes an assumption that the vowel system in question is selected in output as an optimal candidate by a given constraint ranking, the assumption which is different from the view that the vowel system is fixed in input. The analysis proposed here gives an answer to why a specific vowel system is selected and why dialectal variations come about. It is shown in this paper that the vowel system selected in a specific dialect comes from an optimal satisfaction of a given constraint ranking and that dialectal differences result from dynamic permutations of the same constraints. The constraint-based analysis proffered here accounts well for the similarities and differences among dialects in regard to the vowel system.

  • PDF

A Web-based Spatial Layout Planning System with Constraint Satisfaction Problems (웹 환경 하에서의 제약 만족 기법에 의한 공간 계획 시스템)

  • Jung, Jae-Eun;Jeon, Seung-Bum;Jo, Geun-Sik
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.2
    • /
    • pp.216-224
    • /
    • 2000
  • The spatial layout planning system allocates rectangular resources in the limited space according to user requirements, This system also can optimizes the spatial allocation problem to maximize the user's requirement. The spatial layout planning Problems for this system can be solved by searching a wide area of space since this problem entails the non-polynomial algorithm. By accommodating the user's dynamic requirements, the modification of a specific space and the redesign of the whole area can be accomplished. In this paper, the spatial layout planning problem is solved efficiently with a resource allocation method based on CSP. The dynamic constraints by adding user requirements are accommodated through the intelligent user Interface. The 3-D layout on the web environment by using VRML is also shown for providing for the visual verification of the 2-D layout and, thereafter, the additional modification of the 2-D layout.

  • PDF

An object-based preference-driven scheduling language and techniques for improving its perforance (객체에 근거한 선호도 제약 중심 스케줄링 언어와 성능향상 기법)

  • 이기철;문정모;송성헌
    • Korean Management Science Review
    • /
    • v.12 no.2
    • /
    • pp.43-62
    • /
    • 1995
  • For a complex scheduling system like time table construction, its optimal solution, if exists, is hard to obtain. In this paper, the scheduling environment is reasonably confined as where objects have their own events competing for better slots on boards, and objects have their own board slot preferences and belong to one or more classes of the society which globally constrains them. Here, two phase method is suggested, where the first phase is human-like preference driven and the second phase is for fine tuning by considering all the factors given. Designed and implemented in our system HI-SCHED are dynamic object switching, temporal-constraint-driven intelligent backtracking, case-based revisions, object-based approach, and so on. Some satisfaction degrees are also defined to measure the usefulness of our method. In addition, look-ahead dynamic object switching is considered, and additional global constraints are introduced and processed. A simple scheme is also used to verify the usefulness of the post processing scheme.

  • PDF

Dynamic Priority Search Algorithm Of Multi-Agent (멀티에이전트의 동적우선순위 탐색 알고리즘)

  • Jin-Soo Kim
    • The Journal of Engineering Research
    • /
    • v.6 no.2
    • /
    • pp.11-22
    • /
    • 2004
  • A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem(CSP) in which variables and constraints are distributed among multiple automated agents. ACSP is a problem to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI (Distributed AI) that are concerned with finding a consistent combination of agent actions can be formalized as distributed CAPs. In recent years, many new backtracking algorithms for solving distributed CSPs have been proposed. But most of all, they have common drawbacks that the algorithm assumes the priority of agents is static. In this thesis, we establish a basic algorithm for solving distributed CSPs called dynamic priority search algorithm that is more efficient than common backtracking algorithms in which the priority order is static. In this algorithm, agents act asynchronously and concurrently based on their local knowledge without any global control, and have a flexible organization, in which the hierarchical order is changed dynamically, while the completeness of the algorithm is guaranteed. And we showed that the dynamic priority search algorithm can solve various problems, such as the distributed 200-queens problem, the distributed graph-coloring problem that common backtracking algorithm fails to solve within a reasonable amount of time. The experimental results on example problems show that this algorithm is by far more efficient than the backtracking algorithm, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision-making. Therefore, these results imply that a flexible agent organization, in which the hierarchical order is changed dynamically, actually performs better than an organization in which the hierarchical order is static and rigid. Furthermore, we describe that the agent can be available to hold multiple variables in the searching scheme.

  • PDF