• 제목/요약/키워드: Complexity Theory

검색결과 428건 처리시간 0.024초

Effects of Feedback Types on Writing Accuracy, Fluency, and Complexity

  • Park, Chongwon
    • 영어어문교육
    • /
    • 제17권4호
    • /
    • pp.207-227
    • /
    • 2011
  • This paper investigates how two different modes of feedback (selective vs. comprehensive) affect selected students' writing development in terms of three different types of measurement (accuracy, fluency, and complexity). 139 university students participated in the study, and 278 writing samples were analyzed. The results of the study indicate that participants who received selective feedback wrote more accurately and fluently than their counterparts. However, in terms of complexity, both selective and comprehensive groups showed no sign of improvement in semester-based investigations. The results of this study support Skehan's (2009) theory of trade-off effects, suggesting that 'natural' tension exists between accuracy and complexity when resources are limited. Moreover, this finding contrasts with the theory of Cognition Hypothesis, which proposes that task complexity will be associated with increases in complexity and accuracy. In the study, selected participants (N=21) strongly nominated their error sources as unfamiliarity toward using key words, usage, transition, and sentence types. This study not only contributes to the accumulation of our current knowledge in the related area of theory, but offers educational implications for those who are dealing with intermediate-level students when deciding what particular teaching content should constitute a priority within a limited instructional period.

  • PDF

The Effects of Emergent Leader on Team Cognitive Complexity and Team Performance

  • Choi, Kyoosang
    • Journal of the Korean Data Analysis Society
    • /
    • 제20권6호
    • /
    • pp.2781-2792
    • /
    • 2018
  • From a cognitive perspective, this study investigates the role of emergent leaders in developing team cognition and affecting team performance. With application of the cognitive complexity theory, this study hypothesizes that emergent leaders' cognitive complexity will be positively associated with team cognitive complexity, and that team cognitive complexity will be positively associated with team performance. In addition, team cognitive complexity is hypothesized to mediate the effect of the cognitive complexity of emergent leaders on team performance. To test the research hypotheses, data were obtained from 100 teams comprising a total of 339 undergraduate students who participated in a business simulation game. The findings of this study suggests that the cognitive complexity of emergent leaders is a significant predictor of team cognitive complexity, and that team cognitive complexity is positively related to team performance. Moreover, team cognitive complexity significantly mediates the effect of emergent leaders' cognitive complexity and team performance.

확장된 근사 알고리즘을 이용한 조합 방법 (Rule of Combination Using Expanded Approximation Algorithm)

  • 문원식
    • 디지털산업정보학회논문지
    • /
    • 제9권3호
    • /
    • pp.21-30
    • /
    • 2013
  • Powell-Miller theory is a good method to express or treat incorrect information. But it has limitation that requires too much time to apply to actual situation because computational complexity increases in exponential and functional way. Accordingly, there have been several attempts to reduce computational complexity but side effect followed - certainty factor fell. This study suggested expanded Approximation Algorithm. Expanded Approximation Algorithm is a method to consider both smallest supersets and largest subsets to expand basic space into a space including inverse set and to reduce Approximation error. By using expanded Approximation Algorithm suggested in the study, basic probability assignment function value of subsets was alloted and added to basic probability assignment function value of sets related to the subsets. This made subsets newly created become Approximation more efficiently. As a result, it could be known that certain function value which is based on basic probability assignment function is closely near actual optimal result. And certainty in correctness can be obtained while computational complexity could be reduced. by using Algorithm suggested in the study, exact information necessary for a system can be obtained.

형태속성이 미학 특성 인지 과정에 미치는 영향에 관한 연구 (A Study on the Roles of Shape Properties in Evaluation of Aesthetics values on Shapes)

  • 차명열
    • 한국실내디자인학회논문집
    • /
    • 제14권2호
    • /
    • pp.197-205
    • /
    • 2005
  • In estimating designed architectural buildings, many factors in various design domains such as function, structure, form, environment may be considered and then a building design might be selected or modified as final design from many possible design results. This paper proposed a method to obtain complexity values from two dimensional drawings which are floor plans or elevations. The Complexity values could be turned into esthetic values. The method has been developed based on information theory, shape pattern representation and cognitive theory. Results of measuring complexity value can make the computer evaluate and select final results produced from automatic design processes by the computer That is to say, aesthetic values based on order and chaos can be measured using complexity values and then some results having superior values can be selected as final result. Also some cognitive processes as perception of two dimensional drawings are discussed using shape representations. Aesthetic values could be varied in terms of shape properties such as size, individualities and knowledge as well as order and chaos.

유사도 기반의 웹 어플리케이션 구조 복잡도 (A Structural Complexity Metric for Web Application based on Similarity)

  • 정우성;이은주
    • 한국컴퓨터정보학회논문지
    • /
    • 제15권8호
    • /
    • pp.117-126
    • /
    • 2010
  • 소프트웨어 복잡도는 대상 시스템의 유지보수성을 평가하는 주요한 메트릭인데 기존의 웹 어플리케이션 기반 복잡도는 대부분 단순히 개수 기반으로 정의되어 실제 개발자나 유지보수자의 관점에서 느끼는 이해도를 반영하기 어렵다. 이를 보완하기 위하여 정보이론의 엔트로피를 이용하여 복잡도를 정의할 수 있으나, 개별 페이지의 정보량을 동일하게 취급하고 있다. 본 논문에서는 웹 어플리케이션의 구조 복잡도를 유사도 및 정보이론에 기반하여 제안하였다. 즉, 엔트로피에 기반하되, 기존의 유사도를 이용하여 타 페이지들과 유사성이 높은 페이지의 내부 정보량은 그렇지 않은 페이지보다 낮도록 정의하여 이러한 단점을 보완하였다. 또한 관점에 따라 각기 다른 유사도를 적용할 수 있도록 함으로써 복잡도를 여러 관점에서 측정할 수 있도록 하였다. 이후 복잡도 속성을 이용하여 이론적으로 검증하였고, 사례 연구를 통하여 본 기법의 유용성을 보였다.

복잡계 패러다임의 특성과 전망 (Nature and Prospect of Complexity Paradigm)

  • 김문조
    • 과학기술학연구
    • /
    • 제3권2호
    • /
    • pp.1-27
    • /
    • 2003
  • 이 논문은 최근 자연과학 분야에서는 물론이요 사회과학과 더불어 인문예술 영역에 이르는 방대한 학문 영역에서 영향력을 행사하고 있는 복잡계 패러다임의 특성과 전망을 고찰하고자 한 것이다. 흔히 '전체론적 세계관'이라든가 '심층생태학적 관점' 등으로 대변되는 복잡성 패러다임은 개방체계적 사고의 연장선상에 위치한 것으로서, 일차적으로는 개방성, 성장성, 가형성, 否(부)의 엔트로피, 적극적 환류, 자기규제성, 자기목적성, 등종착성과 같은 개방체계적 속성을 함유한다. 그러나 지난 20여 년간 학제적 경계를 초월해 활발히 진전된 복잡계론은 종전의 개방체계론적 논의 수준을 넘어서는 새로운 착상이나 증거를 지속적으로 축적해 온 바, 여기서는 (1) 복잡계 이론이 형성되고 발전되어온 전개과정을 간략히 개관하고, (2) 비평형성, 비선형성, 소산구조 자기조직성, 프랙탈 기하학, 자동생산성 및 공진화와 같은 복잡계의 주요 특성들을 논의하며, (3) 니클라스 루만의 체계이론을 사례로 복잡계 패러다임의 사회과학적 적용을 검토한 후, (4) 복잡계 패러다임의 함의와 전망을 진단해 보고자 한다.

  • PDF

모든 $l{\times}n,\;n{\times}m,\;m{\times}k$ 불리언 행렬 사이의 중첩곱셈에 대한 연구 (A Study on the Two Consecutive Multiplications of All $l{\times}n,\;n{\times}m\;and\;m{\times}k$ Boolean Matrices)

  • 한재일
    • 한국IT서비스학회지
    • /
    • 제5권1호
    • /
    • pp.191-198
    • /
    • 2006
  • Boolean matrices have been successfully used in various areas, and many researches have been performed on them. However, almost all the researches focus on the efficient multiplication of two boolean matrices and no research has been shown to deal with the multiplication of all boolean matrices and their consecutive multiplications. The paper suggests a mathematical theory that enables the efficient consecutive multiplications of all $l{\times}n,\;n{\times}m,\;and\;m{\times}k$ boolean matrices, and discusses its computational complexity and the execution results of the consecutive multiplication algorithm based on the theory.

효율적인 D-클래스 계산을 위한 알고리즘 (Algorithm for Efficient D-Class Computation)

  • 한재일
    • 한국IT서비스학회지
    • /
    • 제6권1호
    • /
    • pp.151-158
    • /
    • 2007
  • D-class computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices and search for equivalent $n{\times}n$ Boolean matrices according to a specific equivalence relation. It is easy to see that even multiplying all $n{\times}n$ Boolean matrices with themselves shows exponential time complexity and D-Class computation was left an unsolved problem due to its computational complexity. The vector-based multiplication theory shows that the multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices can be done much more efficiently. However, D-Class computation requires computation of equivalent classes in addition to the efficient multiplication. The paper discusses a theory and an algorithm for efficient D-class computation, and shows execution results of the algorithm.

복잡계이론 기반하 EINSTein 모형을 이용한 상륙전 적용에 관한 연구 (A Study on Applying Amphibious Warfare Using EINSTein Model Based on Complexity Theory)

  • 이상헌
    • 한국국방경영분석학회지
    • /
    • 제32권2호
    • /
    • pp.114-130
    • /
    • 2006
  • 본 논문은 아인스타인 시뮬레이션모형을 활용하여 상륙전을 묘사하는 복잡계이론을 다룬다. 아인스타인모형은 지상전에서 창발적인 자기조직화를 실험하기 위한 행위자 기반 모델이다. 상륙전의 다양한 형태중 상륙기습, 상륙돌격작전을 아인스타인 모형을 이용 구축하였으며 다양한 입력요소의 변경을 통하여 공간적 요소와 정성적 요소에 따른 전투양상의 변화를 확인할 수 있다. 즉, 통신요소의 변경, 탐지센서의 변경, 병력 재배치, 병력의 분산과 집중, 정성요소의 변경 등을 통해서 기존 란체스터형 전투모형의 단점을 보완함과 동시에 다양한 형태의 전투에 대한 모의 가능성과 발전 가능성을 확인할 수 있다.

복잡성 이론과 기업경영: 프랙탈 경영방식을 중심으로 (Complexity Theory and Organization Management)

  • 이장우;박형규
    • 경영과학
    • /
    • 제15권2호
    • /
    • pp.239-257
    • /
    • 1998
  • Facing the globalization of world economy, intense market competition, radical change of information technology, firms are obliged to create a new type of organizations characterized by flexibility and adaptability to new and dynamic environments. This paper reviews the theories of complexity in physics briefly and discusses the implications of them on the management of business organizations. It analogizes the core concepts from complexity theories such as cooperative phenomena, self-organization, adaptation, positive feedback, and butterfly effect, and attempts to identify their implications on business management. Particularly, it suggests principles of 'Fractal' management which apply the fractal structure to the business organization.

  • PDF