• 제목/요약/키워드: Problem Representation

검색결과 798건 처리시간 0.025초

AN OPTIMIZATION APPROACH FOR COMPUTING A SPARSE MONO-CYCLIC POSITIVE REPRESENTATION

  • KIM, KYUNGSUP
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제20권3호
    • /
    • pp.225-242
    • /
    • 2016
  • The phase-type representation is strongly connected with the positive realization in positive system. We attempt to transform phase-type representation into sparse mono-cyclic positive representation with as low order as possible. Because equivalent positive representations of a given phase-type distribution are non-unique, it is important to find a simple sparse positive representation with lower order that leads to more effective use in applications. A Hypo-Feedback-Coxian Block (HFCB) representation is a good candidate for a simple sparse representation. Our objective is to find an HFCB representation with possibly lower order, including all the eigenvalues of the original generator. We introduce an efficient nonlinear optimization method for computing an HFCB representation from a given phase-type representation. We discuss numerical problems encountered when finding efficiently a stable solution of the nonlinear constrained optimization problem. Numerical simulations are performed to show the effectiveness of the proposed algorithm.

투영법에 의한 성형계획문제의 시각적 표현에 관하여 (On the Visual Representation of Linear Programming Problem by a Projection Method)

  • 김우제;박순달
    • 한국경영과학회지
    • /
    • 제18권3호
    • /
    • pp.101-111
    • /
    • 1993
  • The purpose of this paper is to show the graphic representation of a linear programming problem by a projection method. First, we develop a projection method which conserves the optimality in the projected space, and next we introduce an algorithm to visualize the feasible solution set and the solution process by the projection method. Finally, we give an example to represent a 4-dimensional linear programming problem graphically.

  • PDF

Object Tracking based on Relaxed Inverse Sparse Representation

  • Zhang, Junxing;Bo, Chunjuan;Tang, Jianbo;Song, Peng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권9호
    • /
    • pp.3655-3671
    • /
    • 2015
  • In this paper, we develop a novel object tracking method based on sparse representation. First, we propose a relaxed sparse representation model, based on which the tracking problem is casted as an inverse sparse representation process. In this process, the target template is able to be sparsely approximated by all candidate samples. Second, we present an objective function that combines the sparse representation process of different fragments, the relaxed representation scheme and a weight reference prior. Based on some propositions, the proposed objective function can be solved by using an iteration algorithm. In addition, we design a tracking framework based on the proposed representation model and a simple online update manner. Finally, numerous experiments are conducted on some challenging sequences to compare our tracking method with some state-of-the-art ones. Both qualitative and quantitative results demonstrate that the proposed tracking method performs better than other competing algorithms.

인적자원관리 분야의 지식표현체계에 관한 연구 (A Study on Knowledge Representation Schemes for Use in Human Resource Management Problem Domains)

  • 변대호
    • Asia pacific journal of information systems
    • /
    • 제7권1호
    • /
    • pp.85-97
    • /
    • 1997
  • This paper is concerned with knowledge representation schemes best suited for human resource management (HRM) problem domains including human resource planing, selection, placement, compensations, performance evaluation, training and labor-management relations. In order to suggest the scheme we consider two research gods. First, we evaluate and prioritize. The knowledge representation techniques of frames rules, semantic nets and predicate logic that hove been recommended to managerial domains. The combined Analytic Hierarchy Process technique is employed to combine individual judgments effectively between two different expert groups. As a result if we are to select a single knowledge representation technique, a frame representation is best for most HRM domains and to combine frames with others is another choice. Second as a strategy for knowledge representation schemes we show some examples for each damn in terms of labeled semantic nets and two types of rules derived from the semantic nets. We propose nine knowledge components as ontologies. The labeled semantic nets con provide some benefits compared with conventional one. More clearly definea node rode information maces it easy to find the ac information. In the rule sets, the variables are the node of the semantic nets. The consistency of rules is validated by the relationship of the knowledge components.

  • PDF

조응관계 실타래 풀기 (Untangling Anaphoric Threads)

  • 정소우
    • 한국언어정보학회지:언어와정보
    • /
    • 제8권2호
    • /
    • pp.1-25
    • /
    • 2004
  • This paper examines two different approaches to resolving a theoretical problem which the bottom-up approach version of Discourse Representation Theory of Kamp et al. (2003) faces in dealing with anaphoric relations between pronouns and their potential antecedents in conditional sentences where consequent clauses precede their corresponding conditional clauses. In one of the approaches, every element is processed in the order of occurrence and conditional operators in a non-sentence-initial position cause the ongoing DR to split in two with the same index. The definition of accessibility is accordingly modified so that the right DR can be accessible from the left DR. In the other approach, a different type of discourse representation structure, K ${\Leftarrow}$ K, is introduced, which allows us to resolve the target problem without modifying accessibility proposed in Kamp et al. (2003). Compatibility of these two approaches with the bottom-up version of DRT is evaluated by examining their applicability to the analysis of quantified sentences where pronominal expressions precede generalized quantifiers.

  • PDF

XML 기반 리듬 편집 및 재생 시스템 개발 (Development of a Rhythm Editing and Playing System Based on XML)

  • 손원성;이용규
    • 한국정보처리학회논문지
    • /
    • 제7권5호
    • /
    • pp.1341-1350
    • /
    • 2000
  • Much research has been performed to represent music information on computers. However, one problem of the previous approaches is that music information cannot be hared with other music systems since they have used their own representation schemes. In order to resolve this problem, we have developed a new scheme for representing, editing, and playing rhythms among music information based on XML which is a web standard language. We present a RDML (Rhythm Description Markup Language) to exactly describe rhythm information such as beats, musical instruments, and performance information, which is much simpler thant previous representation schemes. Moreover, the RDML representation can be played by converting it into SMIL representation. Because our approach is based on the web standard, the music information can be shared on the web.

  • PDF

순열 표현 기반의 협력적 공진화 알고리즘을 사용한 다단계 공급사슬 네트워크의 설계 (Multi-Stage Supply Chain Network Design Using a Cooperative Coevolutionary Algorithm Based on a Permutation Representation)

  • 한용호
    • 경영과학
    • /
    • 제29권2호
    • /
    • pp.21-34
    • /
    • 2012
  • This paper addresses a network design problem in a supply chain system that involves locating both plants and distribution centers, and determining the best strategy for distributing products from the suppliers to the plants, from the plants to the distribution centers and from the distribution centers to the customers. This paper suggests a cooperative coevolutionary algorithm (CCEA) approach to solve the model. First, the problem is decomposed into three subproblems for each of which the chromosome population is created correspondingly. Each chromosome in each population is represented as a permutation denoting the priority. Then an algorithm generating a solution from the combined set of chromosomes from each population is suggested. Also an algorithm evaluating the performance of a solution is suggested. An experimental study is carried out. The results show that our CCEA tends to generate better solutions than the previous CCEA as the problem size gets larger and that the permutation representation for chromosome used here is better than other representation.

Parametric Macro for Two-Dimensional Layout on the Auto-CAD System

  • Kim, Yunyong;Park, Jewoong
    • 한국해양공학회:학술대회논문집
    • /
    • 한국해양공학회 2000년도 추계학술대회 논문집
    • /
    • pp.253-260
    • /
    • 2000
  • In recent years, a number of successful nesting approaches have been developed by using the various heuristic algorithms, and due to their application potential several commercial CAD/CAM packages include a nesting module for solving the layout problem. Since a large portion of the complexity of the part nesting problem results from the overlapping computation, the geometric representation is one of the most important factors to reduce the complexity of the problem. The proposed part representation method can easily handle parts and raw materials with widely varying geometrical shape by using the redesigning modules. This considerably reduces the amount of processed data and consequently the run time of the computer. The aim of this research is to develop parametric macro for two-dimensional layout on the Auto-CAD system. Therefore, this research can be called "pre-nesting".

  • PDF

시각적 스키마 프로그램이 문장제 표상과 문제해결력에 미치는 효과 (Effects of the Schema-Based Instructional Program on Word Problem Representation and Solving Ability)

  • 김종백;이성원
    • 대한수학교육학회지:학교수학
    • /
    • 제13권1호
    • /
    • pp.155-173
    • /
    • 2011
  • 본 연구는 문장제를 표상하는 능력의 신장을 목적으로, 문장제를 시각적 스키마의 형태로 유형화하여 학생들에게 제시하는 스키마 기반 프로그램을 구성하고 그 효과성을 검증하고자 하였다. 초등학교 2학년 60명 학생들을 실험조건과 비교조건에 무선배치하고 초등학교 2학년 수학-가 두 개 단원의 내용을 정하여 실험조건에는 시각적 스키마 기반 프로그램(Visual Schema Based Program)을 제시하고 비교조건에는 현교육현장에서 활용되는 교사용 지도서에 근거하여 다이어그램이나 그래프와 같은 문제해결 전략을 제시하는 수업을 실시하였다. 프로그램 효과를 검증하기 위해 사전 검사를 공변인으로 하는 일원 공변량분석(Oneway ANCOVA)을 실시한 결과 스키마 조건의 학생들이 유의미하게 높은 문제해결력을 보여주었으며 이와 같은 결과는 사전 및 사후검사에서 사용된 문장제의 난이도를 고려했을 때 더욱 두드러지는 차이를 보여주었다. 더 나아가서 실험조건에 있는 학생들이 스키마를 사용하는 빈도와 문제에서 요구되는 스키마를 얼마나 정확하게 활용했는지에 따라 문제해결능력에 관계가 있는 지 분석한 결과 도구의 사용빈도와는 .50, 그리고 도구 사용의 정확성과 는 .58의 높은 상관관계가 있는 것으로 나타났다. 이와 같은 결과는 문제의 표상과 문장제 해결이 서로 높은 관계가 있으며 스키마 기반 프로그램이 문제의 표상능력을 높이며 문제해결력 향상에 긍정적인 영향을 미친다는 것을 보여준다.

  • PDF

유추적 사고에 의한 디자인 문제해결의 유형 - 연상된 단어와 스케치 분석을 중심으로 - (A Study on the Types of Design Problem Solving by Analogical Thinking - Focused on the Analysis of Associated Words and Sketch -)

  • 최은희;최윤아
    • 한국실내디자인학회논문집
    • /
    • 제16권2호
    • /
    • pp.63-70
    • /
    • 2007
  • Analogy in problem solving is similarity-based reasoning facilitated by verbal and visual operation. This similarity-based reasoning generally supports initial phase of idea search. Therefore, this study intends to infer the types of problem solving by tracing the analogy use of verbal and visual representation through a experimental research. According to the result of this research, the types of problem solving by analogy are classified into 'evolving', 'divergent', and 'poor conversion' type. Firstly, 'evolving type' is distinguished between 'combination type' associated different contents to develope a new design and 'transformation type' associated similar words and sketches to be continuously revised and developed. In these types usually structural analogy rather than surface analogy is used. Secondly, in 'divergent type' associated words or sketches are individually represented, and among them one design solution is selected. In this type usually surface analogy is used. Thirdly, in 'poor conversion type' interaction between verbal representation and visual representation does not go on smoothly, and the generation of idea is poor. In here surface analogy is mostly used. These findings could form the basis of skill development of idea generation and conversion in design education.