• Title/Summary/Keyword: Linear Algebra

Search Result 283, Processing Time 0.033 seconds

New GPU computing algorithm for wind load uncertainty analysis on high-rise systems

  • Wei, Cui;Luca, Caracoglia
    • Wind and Structures
    • /
    • v.21 no.5
    • /
    • pp.461-487
    • /
    • 2015
  • In recent years, the Graphics Processing Unit (GPU) has become a competitive computing technology in comparison with the standard Central Processing Unit (CPU) technology due to reduced unit cost, energy and computing time. This paper describes the derivation and implementation of GPU-based algorithms for the analysis of wind loading uncertainty on high-rise systems, in line with the research field of probability-based wind engineering. The study begins by presenting an application of the GPU technology to basic linear algebra problems to demonstrate advantages and limitations. Subsequently, Monte-Carlo integration and synthetic generation of wind turbulence are examined. Finally, the GPU architecture is used for the dynamic analysis of three high-rise structural systems under uncertain wind loads. In the first example the fragility analysis of a single degree-of-freedom structure is illustrated. Since fragility analysis employs sampling-based Monte Carlo simulation, it is feasible to distribute the evaluation of different random parameters among different GPU threads and to compute the results in parallel. In the second case the fragility analysis is carried out on a continuum structure, i.e., a tall building, in which double integration is required to evaluate the generalized turbulent wind load and the dynamic response in the frequency domain. The third example examines the computation of the generalized coupled wind load and response on a tall building in both along-wind and cross-wind directions. It is concluded that the GPU can perform computational tasks on average 10 times faster than the CPU.

Square and Cube Root Algorithms in Finite Field and Their Applications (유한체상의 제곱근과 세제곱근을 찾는 알고리즘과 그 응용)

  • Cho, Gook Hwa;Ha, Eunhye;Koo, Namhun;Kwon, Soonhak
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.12
    • /
    • pp.1031-1037
    • /
    • 2012
  • We study an algorithm that can efficiently find square roots and cube roots by modifying Tonelli-Shanks algorithm, which has an application in Number Field Sieve (NFS). The Number Field Sieve, the fastest known factoring algorithm, is a powerful tool for factoring very large integer. NFS first chooses two polynomials having common root modulo N, and it consists of the following four major steps; 1. Polynomial Selection 2. Sieving 3. Matrix 4. Square Root. The last step of NFS needs the process of square root computation in Number Field, which can be computed via square root algorithm over finite field.

WEYL@S THEOREMS FOR POSINORMAL OPERATORS

  • DUGGAL BHAGWATI PRASHAD;KUBRUSLY CARLOS
    • Journal of the Korean Mathematical Society
    • /
    • v.42 no.3
    • /
    • pp.529-541
    • /
    • 2005
  • An operator T belonging to the algebra B(H) of bounded linear transformations on a Hilbert H into itself is said to be posinormal if there exists a positive operator $P{\in}B(H)$ such that $TT^*\;=\;T^*PT$. A posinormal operator T is said to be conditionally totally posinormal (resp., totally posinormal), shortened to $T{\in}CTP(resp.,\;T{\in}TP)$, if to each complex number, $\lambda$ there corresponds a positive operator $P_\lambda$ such that $|(T-{\lambda}I)^{\ast}|^{2}\;=\;|P_{\lambda}^{\frac{1}{2}}(T-{\lambda}I)|^{2}$ (resp., if there exists a positive operator P such that $|(T-{\lambda}I)^{\ast}|^{2}\;=\;|P^{\frac{1}{2}}(T-{\lambda}I)|^{2}\;for\;all\;\lambda)$. This paper proves Weyl's theorem type results for TP and CTP operators. If $A\;{\in}\;TP$, if $B^*\;{\in}\;CTP$ is isoloid and if $d_{AB}\;{\in}\;B(B(H))$ denotes either of the elementary operators $\delta_{AB}(X)\;=\;AX\;-\;XB\;and\;\Delta_{AB}(X)\;=\;AXB\;-\;X$, then it is proved that $d_{AB}$ satisfies Weyl's theorem and $d^{\ast}_{AB}\;satisfies\;\alpha-Weyl's$ theorem.

On freshmen's academic achievements of college mathematics and the efficient methods of education (이공계열 대학 신입생의 기초 수학분야 학업성취도 및 효율적인 교육 방안에 대한 연구)

  • Kim, Byung Hak;Kim, Jae Woong;Kim, Jiyun
    • Communications of Mathematical Education
    • /
    • v.31 no.1
    • /
    • pp.1-15
    • /
    • 2017
  • The university entrance examination in deeply related to high school education, adaptation and study ability in university. In this point of view, we investigate the scholastic achievement to the Calculus 1,2, linear algebra and differential equation from academic year 2006 to 2016. The above four subjects contain elementary and essential contents to study for science and engineering major in university. We compare and analyse the data of scholastic achievement and system of various university entrance examination, and we discuss and propose the methods of improvements for adaptation to each major field and study ability.

Trends of Compiler Development for AI Processor (인공지능 프로세서 컴파일러 개발 동향)

  • Kim, J.K.;Kim, H.J.;Cho, Y.C.P.;Kim, H.M.;Lyuh, C.G.;Han, J.;Kwon, Y.
    • Electronics and Telecommunications Trends
    • /
    • v.36 no.2
    • /
    • pp.32-42
    • /
    • 2021
  • The rapid growth of deep-learning applications has invoked the R&D of artificial intelligence (AI) processors. A dedicated software framework such as a compiler and runtime APIs is required to achieve maximum processor performance. There are various compilers and frameworks for AI training and inference. In this study, we present the features and characteristics of AI compilers, training frameworks, and inference engines. In addition, we focus on the internals of compiler frameworks, which are based on either basic linear algebra subprograms or intermediate representation. For an in-depth insight, we present the compiler infrastructure, internal components, and operation flow of ETRI's "AI-Ware." The software framework's significant role is evidenced from the optimized neural processing unit code produced by the compiler after various optimization passes, such as scheduling, architecture-considering optimization, schedule selection, and power optimization. We conclude the study with thoughts about the future of state-of-the-art AI compilers.

Updating DEM for Improving Geomorphic Details (미기복 지형 표현을 위한 DEM 개선)

  • Kim, Nam-Shin
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.12 no.1
    • /
    • pp.64-72
    • /
    • 2009
  • The method to generate a digital elevation model(DEM) from contour lines causes a problem in which the low relief landform cannot be clearly presented due to the fact that it is significantly influenced by the expression of micro landform elements according to the interval of contours. Thus, this study attempts to develop a landcover burning method that recovers the micro relief landform of the DEM, which applies buffering and map algebra methods by inputting the elevation information to the landcover. In the recovering process of the micro landform, the DEM was recovered using the buffering method and elevation information through the map algebra for the landcover element for the micro landform among the primary DEM generation, making landcover map, and landcover elements. The recovering of the micro landform was applied based on stream landforms. The recovering of landforms using the buffering method was performed for the bar, which is a polygonal element, and wetland according to the properties of concave/convex through generating contours with a uniform interval in which the elevation information applied to the recovered landform. In the case of the linear elements, such as bank, road, waterway, and tributary, the landform can be recovered by using the elevation information through applying a map algebra function. Because the polygonal elements, such as stream channel, river terrace, and artificial objects (farmlands) are determined as a flat property, these are recovered by inputting constant elevation values. The results of this study were compared and analyzed for the degree of landform expression between the original DEM and the recovered DEM. In the results of the analysis, the DEM produced by using the conventional method showed few expressions in micro landform elements. The method developed in this study well described wetland, bar, landform around rivers, farmland, bank, river terrace, and artificial objects. It can be expected that the results of this study contribute to the classification and analysis of micro landforms, plain and the ecology and environment study that requires the recovering of micro landforms around streams and rivers.

  • PDF

A Case Study on Students' Mathematical Concepts of Algebra, Connections and Attitudes toward Mathematics in a CAS Environment (CAS 그래핑 계산기를 활용한 수학 수업에 관한 사례 연구)

  • Park, Hui-Jeong;Kim, Kyung-Mi;Whang, Woo-Hyung
    • Communications of Mathematical Education
    • /
    • v.25 no.2
    • /
    • pp.403-430
    • /
    • 2011
  • The purpose of the study was to investigate how the use of graphing calculators influence on forming students' mathematical concept of algebra, students' mathematical connection, and attitude toward mathematics. First, graphing calculators give instant feedback to students as they make students compare their written answers with the results, which helps students learn equations and linear inequalities for themselves. In respect of quadratic inequalities they help students to correct wrong concepts and understand fundamental concepts, and with regard to functions students can draw graphs more easily using graphing calculators, which means that the difficulty of drawing graphs can not be hindrance to student's learning functions. Moreover students could understand functions intuitively by using graphing calculators and explored math problems volunteerly. As a result, students were able to perceive faster the concepts of functions that they considered difficult and remain the concepts in their mind for a long time. Second, most of students could not think of connection among equations, equalities and functions. However, they could understand the connection among equations, equalities and functions more easily. Additionally students could focus on changing the real life into the algebraic expression by modeling without the fear of calculating, which made students relieve the burden of calculating and realize the usefulness of mathematics through the experience of solving the real-life problems. Third, we identified the change of six students' attitude through preliminary and an ex post facto attitude test. Five of six students came to have positive attitude toward mathematics, but only one student came to have negative attitude. However, all of the students showed positive attitude toward using graphing calculators in math class. That's because they could have more interest in mathematics by the strengthened and visualization of graphing calculators which helped them understand difficult algebraic concepts, which gave them a sense of achievement. Also, students could relieve the burden of calculating and have confidence. In a conclusion, using graphing calculators in algebra and function class has many advantages : formulating mathematics concepts, mathematical connection, and enhancing positive attitude toward mathematics. Therefore we need more research of the effect of using calculators, practical classroom materials, instruction models and assessment tools for graphing calculators. Lastly We need to make the classroom environment more adequate for using graphing calculators in math classes.

Eye Gaze Tracking System Under Natural Head Movements (머리 움직임이 자유로운 안구 응시 추정 시스템)

  • ;Matthew, Sked;Qiang, Ji
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.41 no.5
    • /
    • pp.57-64
    • /
    • 2004
  • We proposed the eye gaze tracking system under natural head movements, which consists of one narrow-view field CCD camera, two mirrors which of reflective angles are controlled and active infra-red illumination. The mirrors' angles were computed by geometric and linear algebra calculations to put the pupil images on the optical axis of the camera. Our system allowed the subjects head to move 90cm horizontally and 60cm vertically, and the spatial resolutions were about 6$^{\circ}$ and 7$^{\circ}$, respectively. The frame rate for estimating gaze points was 10~15 frames/sec. As gaze mapping function, we used the hierarchical generalized regression neural networks (H-GRNN) based on the two-pass GRNN. The gaze accuracy showed 94% by H-GRNN improved 9% more than 85% of GRNN even though the head or face was a little rotated. Our system does not have a high spatial gaze resolution, but it allows natural head movements, robust and accurate gaze tracking. In addition there is no need to re-calibrate the system when subjects are changed.

Massive Parallel Processing Algorithm for Semiconductor Process Simulation (반도체 공정 시뮬레이션을 위한 초고속 병렬 연산 알고리즘)

  • 이제희;반용찬;원태영
    • Journal of the Korean Institute of Telematics and Electronics D
    • /
    • v.36D no.3
    • /
    • pp.48-58
    • /
    • 1999
  • In this paper, a new parallel computation method, which fully utilize the parallel processors both in mesh generation and FEM calculation for 2D/3D process simulation, is presented. High performance parallel FEM and parallel linear algebra solving technique was showed that excessive computational requirement of memory size and CPU time for the three-dimensional simulation could be treated successively. Our parallelized numerical solver successfully interpreted the transient enhanced diffusion (TED) phenomena of dopant diffusion and irregular shape of R-LOCOS within 15 minutes. Monte Carlo technique requires excessive computational requirement of CPU time. Therefore high performance parallel solving technique were employed to our cascade sputter simulation. The simulation results of Our sputter simulator allowed the calculation time of 520 sec and speedup of 25 using 30 processors. We found the optimized number of ion injection of our MC sputter simulation is 30,000.

  • PDF

Investigating the Hierarchical Nature of Content and Cognitive Domains in the Mathematics Curriculum for Korean Middle School Students via Assessment Items (평가 문항을 활용한 중학교 수학 교육과정의 내용 및 인지행동의 위계성 조사)

  • Song, Mi-Young;Kim, Sun-Hee
    • School Mathematics
    • /
    • v.9 no.2
    • /
    • pp.223-240
    • /
    • 2007
  • The purpose of this study was to investigate the degree to which the middle school mathematics curriculum matched the item difficulty levels of representative mathematics items. The items used in this study were developed for the National Assessment of Educational Achievement. Ranks for difficulty values of the 60 multiple-choice item were calculated via both Classical Test Theory and Item Response Theory and correlated with the rank order of the mathematics content and cognitive domains sequence. There are six content domains; number and operation, algebra, measurement, figure, pattern and function, and probability and statistics. The cognitive domains include computation, understanding, reasoning and problem-solving. Results suggest a congruence between cognitive domain's sequence and item difficulty levels of items based on that sequence. This finding indicates that the linear or hierarchical assumptions concerning the sequence appears to be reasonable. The characteristics of items that were exceptions to this trend were addressed.

  • PDF