• Title/Summary/Keyword: Algorithmic

Search Result 385, Processing Time 0.038 seconds

AN ALGORITHMIC APPROACH TO THE MARKOV CHAIN WITH TRANSITION PROBABILITY MATRIX OF UPPER BLOCK-HESSENBERG FORM

  • Shin, Yang-Woo;Pearce, C.E.M.
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.2
    • /
    • pp.403-426
    • /
    • 1998
  • We present an algorithm to find an approximation for the stationary distribution for the general ergodic spatially-inhomogeneous block-partitioned upper Hessenberg form. Our approximation makes use of an associated upper block-Hessenberg matrix which is spa-tially homogeneous except for a finite number of blocks. We treat the MAP/G/1 retrial queue and the retrial queue with two types of customer as specific instances and give some numerical examples. The numerical results suggest that our method is superior to the ordinary finite-truncation method.

Design of Fanin-Constrained Multi-Level Logic Optimization System (Fanin 제약하의 다단 논리 최적화 시스템의 설계)

  • 임춘성;황선영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.4
    • /
    • pp.64-73
    • /
    • 1992
  • This paper presents the design of multi-level logic optimization algorithm and the development of the SMILE system based on the algorithm. Considering the fanin constraints in algorithmic level, SMILE performs global and local optimization in a predefined sequence using heuristic information. Designed under the Sogang Silicon Compiler design environment, SMILE takes the SLIF netlist or Berkeley equation formats obtained from high-level synthesis process, and generates the optimized circuits in the same format. Experimental results show that SMILE produces the promising results for some circuits from MCNC benchmarks, comparable to the popularly used multi-level logic optimization system, MIS.

  • PDF

APPLICATION OF DEGREE REDUCTION OF POLYNOMIAL BEZIER CURVES TO RATIONAL CASE

  • PARK YUNBEOM;LEE NAMYONG
    • Journal of applied mathematics & informatics
    • /
    • v.18 no.1_2
    • /
    • pp.159-169
    • /
    • 2005
  • An algorithmic approach to degree reduction of rational Bezier curves is presented. The algorithms are based on the degree reduction of polynomial Bezier curves. The method is introduced with the following steps: (a) convert the rational Bezier curve to polynomial Bezier curve by using homogenous coordinates, (b) reduce the degree of polynomial Bezier curve, (c) determine weights of degree reduced curve, (d) convert the Bezier curve obtained through step (b) to rational Bezier curve with weights in step (c).

Finite element analysis of welding process in consideration of transformation plasticity in welding (용접에서 발생하는 변태소성을 고려한 용접공정의 유한요소 해석)

  • 임세영
    • Proceedings of the KWS Conference
    • /
    • 2003.05a
    • /
    • pp.210-212
    • /
    • 2003
  • Finite element analysis of welding processes, which entail phase evolution, heat transfer and deformation, is considered in this paper. Attention focuses on numerical implementation of the thermo-elastic-plastic constitutive equation proposed by Leblond et al in consideration of the transformation plasticity. Based upon the multiplicative decomposition of deformation gradient, hyperelastic formulation is employed for efficient numerical integration, and the algorithmic consistent moduli for elastic-plastic deformations including transformation plasticity are obtained in the closed form. The convergence behavior of the present implementation is demonstrated via a couple of numerical example.

  • PDF

DEGREE ELEVATION OF B-SPLINE CURVES AND ITS MATRIX REPRESENTATION

  • LEE, BYUNG-GOOK;PARK, YUNBEOM
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.4 no.2
    • /
    • pp.1-9
    • /
    • 2000
  • An algorithmic approach to degree elevation of B-spline curves is presented. The new algorithms are based on the blossoming process and its matrix representation. The elevation method is introduced that consists of the following steps: (a) decompose the B-spline curve into piecewise $B{\acute{e}}zier$ curves, (b) degree elevate each $B{\acute{e}}zier$ piece, and (c) compose the piecewise $B{\acute{e}}zier$ curves into B-spline curve.

  • PDF

hp-Version of the Finite Element Analysis for Reissner-Mindlin Plates (Reissner-Mindlin 평판의 hp-Version 유한요소해석)

  • 우광성;이기덕
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1992.10a
    • /
    • pp.39-44
    • /
    • 1992
  • This paper is concerned with formulations of the hierarchical $C^{o}$-plate element on the basis of Reissner-Mindlin plate theory. On reason for the development of the aforementioned element is that it is still difficult to construct elements based on h-version concepts which are accurate and stable against the shear locking effects. An adaptive mesh refinement and selective p-distribution of the polynomial degree using hp-version of the finite element method we proposed to verify the superior convergence and algorithmic efficiency with the help of the clamped L-shaped plate problems.s.

  • PDF

A Study on Algorithm Composition Patterns of Learners in Elementary Software Education (초등학교 소프트웨어교육에서 학습자의 알고리즘 구성 패턴 연구)

  • Kim, Jeongrang
    • Journal of The Korean Association of Information Education
    • /
    • v.24 no.1
    • /
    • pp.11-19
    • /
    • 2020
  • Software education is provided for 6th grade students. This study explored the algorithmic composition patterns of elementary school students. After investigating the algorithm for the 6th grade students, the algorithmic pattern of the learner was explored by calculating the cyclomatic complexity of MacCabe based on the structural programming technique. Students often use one or two choice structures to solve problems, which tend to be biased towards the starting and ending points of the problem. It is also passive in the use of selection structures. Algorithm composition depends on visible objects and one's own background. Therefore, in elementary school software education, it is necessary to present the task of thinking about the algorithm structure in the context of the algorithm and the students' experiences in accordance with the algorithm composition pattern.

Developing Pre-service Teachers' Computational Thinking : Analysis of the Five Core CT Competencies (예비교원의 Computational Thinking(CT) 역량 계발 방안 : CT의 5가지 핵심 역량 분석)

  • Choi, Hyungshin
    • Journal of The Korean Association of Information Education
    • /
    • v.20 no.6
    • /
    • pp.553-562
    • /
    • 2016
  • Although software education pursues developing learners' computational thinking skills, more studies are needed in terms of designing software education lessons to enhance CT skills and to measure the effects of the lessons. This study aims to investigate the effects of a course designed to enhance pre-service teachers' CT skills by using CT-based teaching materials. Through a literature review the study has selected the five core competencies of CT: algorithmic thinking, evaluation, problem decompositions, abstraction, and generalization. The participants of the study are 47 pre-service teachers who took the one-semester course in a national university of education. A survey was developed and conducted and qualitative analyses on the team projects were performed focusing on the core competencies of CT. The results revealed pre-service teachers' perceived degree of experiencing CT and their competencies represented in their projects. The present study provides important implications to future software education programs in terms of designing and implementing of software education.

The Influences of Computer-Assisted Instruction Emphasizing the Particulate Nature of Matter and Problem-Solving Strategy on High School Students' Learning in Chemistry (물질의 입자성과 문제 해결 전략을 강조한 컴퓨터 보조 수업이 고등학생들의 화학 학습에 미치는 효과)

  • Noh, Tae-Hee;Kim, Chang-Min;Cha, Jeong-Ho;Jeon, Kyung-Moon
    • Journal of The Korean Association For Science Education
    • /
    • v.18 no.3
    • /
    • pp.337-345
    • /
    • 1998
  • This study examined the influences of computer-assisted instruction(CAl) upon high school students' conceptual understanding, algorithmic problem solving ability, learning motivation, and attitudes toward chemistry instruction. CAl programs were designed to supply animated molecular motions for emphasizing the particulate dynamic nature of matter and immediate feedbacks according to students' response types at each stage of four stage problem-solving strategy(understanding, planning, solving, and reviewing). The CAl and control groups (2 classes) were selected from a girls high school in Seoul, and taught about gas law for four class hours. Data analysis indicated that the students at the CAl group scored significantly higher than those at the control group in the tests on conceptual understanding and algorithmic problem solving ability. In addition, the students at the CAl group performed significantly better in the tests on the learning motivation and attitudes toward chemistry instruction.

  • PDF