• Title/Summary/Keyword: Complexity Theory

Search Result 425, Processing Time 0.029 seconds

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

  • Park, Chongwon
    • English Language & Literature Teaching
    • /
    • v.17 no.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
    • /
    • v.20 no.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 (확장된 근사 알고리즘을 이용한 조합 방법)

  • Moon, Won Sik
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.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 (형태속성이 미학 특성 인지 과정에 미치는 영향에 관한 연구)

  • Cha Myung-Yeol
    • Korean Institute of Interior Design Journal
    • /
    • v.14 no.2 s.49
    • /
    • 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 (유사도 기반의 웹 어플리케이션 구조 복잡도)

  • Jung, Woo-Sung;Lee, Eun-Joo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.8
    • /
    • pp.117-126
    • /
    • 2010
  • Software complexity is used to evaluate a target system's maintainability. The existing complexity metrics on web applications are count-based, so it is hard to incorporate the understandability of developers or maintainers. To make up for this shortcomings, entropy-theory can be applied to define complexity, however, it is assumed that information quantity of each paper is identical. In this paper, structural complexity of a web application is defined based on information theory and similarity. In detail, the proposed complexity is defined using entropy as the previous approach, but the information quantity of individual pages is defined using similarity. That is, a page which are similar with many pages has smaller information quantity than a page which are dissimilar to others. Furthermore, various similarity measures can be used for various views, which results in many-sided complexity measures. Finally, several complexity properties are applied to verify the proposed metric and case studies shows the applicability of the metric.

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

  • Kim Mun-Cho
    • Journal of Science and Technology Studies
    • /
    • v.3 no.2 s.6
    • /
    • pp.1-27
    • /
    • 2003
  • Complexity paradigm is a scientific amalgam that aims to unite a range of theoretical perspectives and research agendas across natural and social sciences. Proponents of complexity paradigm lay claims to an increasing number of areas of study, including artificial life, interpersonal networks, internal/international patterning of organizations, mapping of cyberspace, etc. All of those can be subsumed under the title, 'complexity turn.' Owing to the idea of open system, complexity paradigm has developed a number of new concepts/themes/perspectives that help to account for the complex mechanism of living and non-living creatures. A complex system comprises a number of properties such as disequilibrium, nonlinearity, dissipative structure, self-organization fractal geometry, autopoiesis, coevolution. Following a brief introduction to theoretical development, those properties are succinctly discussed. The complexity turn has provided a wealth of insights that enable to analyze system operations of any kind. It contributes a lot to illuminating the working of social system as well. The most remarkable attempt may be Niklas Luhmann's 'neofunctional system theory.' Merits and shortcomings of complexity paradigm were examined and its future prospect were assessed with the conclusion that complexity paradigm would continue to be useful both as effective transdisciplinary framework and powerful analytical tool.

  • PDF

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

  • Han, Jae-Il
    • Journal of Information Technology Services
    • /
    • v.5 no.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.

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

  • Han, Jae-Il
    • Journal of Information Technology Services
    • /
    • v.6 no.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.

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

  • Lee, Sang-Heon
    • Journal of the military operations research society of Korea
    • /
    • v.32 no.2
    • /
    • pp.114-130
    • /
    • 2006
  • This paper deals with complexity theory to describe amphibious warfare situation using EINSTein (Enhanced ISAAC Neural Simulation Tool) simulation model. EINSTein model is an agent-based artificial "laboratory" for exploring self-organized emergent behavior in land combat. Many studies have shown that existing Lanchester equations used in most war simulation models does not describe changes of combat. Future warfare will be information warfare with various weapon system and complex combat units. We have compared and tested combat results with Lanchester models and EINSTein model. Furthermore, the EINSTein model has been applied and analyzed to amphibious warfare model such as amphibious assault and amphibious sudden attack. The results show that the EINSTein model has a possibility to apply and analyze amphibious warfare more properly than Lanchester models.

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

  • Lee, Jang-Woo;Park, Hying-Gyu
    • Korean Management Science Review
    • /
    • v.15 no.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