• 제목/요약/키워드: simple algebra

검색결과 111건 처리시간 0.03초

The Analytical Transfer Matrix Method Combined with Supersymmetry: Coulomb Potential

  • Sun, Ho-Sung
    • Bulletin of the Korean Chemical Society
    • /
    • 제28권3호
    • /
    • pp.408-412
    • /
    • 2007
  • Combining the analytical transfer matrix method with supersymmetry algebra, a new quantization condition is suggested. To demonstrate the efficiency of the new quantization condition, the eigenenergies of the Coulomb potential are analytically derived. The scattering-led phase shifts are also determined and they are the same for all Coulomb potential states. It is found that the new quantization condition is mathematically simple and exact.

전동차용 견인전동기의 열유동 특성에 관한 전산해석 (Numerical Analysis on Heat Transfer and Fluid Flow Characteristics of Traction Motor for Electric Car)

  • 남성원;김영남;채준희
    • 한국철도학회:학술대회논문집
    • /
    • 한국철도학회 1998년도 추계학술대회 논문집
    • /
    • pp.137-143
    • /
    • 1998
  • Numerical simulation is conducted to clarify the heat transfer and fluid flow characteristics of traction motor for electric car SIMPLE algorithm based on finite volume method is used to make linear algebra equation. The governing equations are solved by TDMA(TriDiagonal Matrix Algorithm) with line-by-line method and block correction. From the results of simulation, the characteristics of cooling pattern is strongly affected by the size of hole in stator core. In the case of high rotational speed of rotor, temperature difference along the axial direction is more decreased than that of low rotational speed.

  • PDF

PRIMENESS AND PRIMITIVITY IN NEAR-RINGS

  • Wendt, Gerhard
    • 대한수학회지
    • /
    • 제58권2호
    • /
    • pp.309-326
    • /
    • 2021
  • In near-ring theory several different types of primitivity exist. These all imply several different types of primeness. In case of near-rings with DCCN most of the types of primeness are known to imply primitivity of a certain kind. We are able to show that also so called 1-prime near-rings imply 1-primitivity. This enables us to classify maximal ideals in near-rings with chain condition with the concept of 1-primeness which leads to further results in the structure theory of near-rings.

통신차단규칙을 따르는 유한버퍼 단순 조립형 대기행렬 망에서의 안정대기시간 (Stationary Waiting Times in Simple Fork-and-Join Queues with Finite Buffers and Communication Blocking)

  • 서동원;이승만
    • 한국시뮬레이션학회논문지
    • /
    • 제19권3호
    • /
    • pp.109-117
    • /
    • 2010
  • 본 연구에서는 3개의 단일서버 노드(기계 1, 기계 2, 조립기계)로 구성된 단순 조립형 대기행렬 망의 안정대기시간에 대해 분석한다. 하나의 재생도착과정을 가정하며, 각 기계의 서비스시간은 서로 독립이며 상수 또는 겹침이 없는 시간으로 가정한다. 기계 1과 기계 2는 무한크기의 버퍼를 가지며, 조립기계는 각 기계로부터의 이송되는 부품을 위해 2개의 유한버퍼를 가진다. 각 기계는 FIFO 규칙과 통신차단규칙에 따라 서비스를 제공한다. 단순 조립형 대기행렬 망의 안정대기시간에 대한 간결한 표현식을 (max,+)-대수를 활용하여 유한버퍼의 크기에 대한 함수의 형태로 도출하였다. 이러한 표현식으로부터 평균, 고차평균, 꼬리확률과 같은 다양한 성능 특성치들의 값을 구할 수 있다.

Meromorphic functions, divisors, and proective curves: an introductory survey

  • Yang, Ko-Choon
    • 대한수학회지
    • /
    • 제31권4호
    • /
    • pp.569-608
    • /
    • 1994
  • The subject matter of this survey has to do with holomorphic maps from a compact Riemann surface to projective space, which are also called algebrac curves; the theory we survey lies at the crossroads of function theory, projective geometry, and commutative algebra (although we should mention that the present survey de-emphasizes the algebraic aspect). Algebraic curves have been vigorously and continuously investigated since the time of Riemann. The reasons for the preoccupation with algebraic curves amongst mathematicians perhaps have to do with-other than the usual usual reason, namely, the herd mentality prompting us to follow the leads of a few great pioneering methematicians in the field-the fact that algebraic curves possess a certain simple unity together with a rich and complex structure. From a differential-topological standpoint algebraic curves are quite simple as they are neatly parameterized by a single discrete invariant, the genus. Even the possible complex structures of a fixed genus curve afford a fairly complete description. Yet there are a multitude of diverse perspectives (algebraic, function theoretic, and geometric) often coalescing to yield a spectacular result.

  • PDF

등식체계에서의 자동증명

  • 위규범
    • 한국수학사학회지
    • /
    • 제11권2호
    • /
    • pp.35-42
    • /
    • 1998
  • It is an undecidable problem to determine whether a given equation logically follows from a given set of equations. However, it is possible to give the answer to many instances of the problem, even though impossible to answer all the instances, by using rewrite systems and completion procedures. Rewrite systems and completion procedures can be implemented as computer programs. The new equations such a computer program generates are theorems that hold in the given equational theory. For example, a completion procedure applied on the group axioms generates simple theorems about groups. Mathematics students' teaming to know the existence and mechanisms of computer programs that prove simple theorems can be a significant help to promote the interests in abstract algebra and logic, and the motivation for studying.

  • PDF

RIEMANNIAN SUBMERSIONS OF SO0(2, 1)

  • Byun, Taechang
    • 대한수학회지
    • /
    • 제58권6호
    • /
    • pp.1407-1419
    • /
    • 2021
  • The Iwasawa decomposition NAK of the Lie group G = SO0(2, 1) with a left invariant metric produces Riemannian submersions G → N\G, G → A\G, G → K\G, and G → NA\G. For each of these, we calculate the curvature of the base space and the lifting of a simple closed curve to the total space G. Especially in the first case, the base space has a constant curvature 0; the holonomy displacement along a (null-homotopic) simple closed curve in the base space is determined only by the Euclidean area of the region surrounded by the curve.

스토리텔링 수학 교과서에서 공학적 도구의 활용과 미분적분학 단원에 관한 개발 사례 (A Case Study of Perceptions on Storytelling Mathematics Textbooks with Computer Algebra System)

  • 이상구;신준국;김경원
    • 한국수학교육학회지시리즈E:수학교육논문집
    • /
    • 제28권1호
    • /
    • pp.65-79
    • /
    • 2014
  • 스토리텔링 기법을 수학 교과서에 적용할 때, 스토리를 전개하는 방법에 따라 늘어나는 학습시간을 효율적으로 조절하는 것은 중요한 문제이다. 특히 고교과정의 수학은 중학교 과정과 비교하여 소화하여야 할 수학적 지식의 양과 질이 차별화 되므로, 각 단원에 적절한 스토리텔링 기법을 개발할 필요가 있다. 본 연구에서는 고등학교 미분적분학 단원을 중심으로, 공학적 도구를 활용하여 수학 문제 풀이에 요구되는 계산 시간을 줄여 개념학습 시간을 충분하게 확보하는 스토리텔링 교과서 개발 사례를 제시한다.

A Comparative Study of the Teaching Language of a Novice Teacher and an Expert Teacher in Algebra Instruction

  • Wang, Si-kai;Ye, Li-jun
    • 한국수학교육학회지시리즈D:수학교육연구
    • /
    • 제23권1호
    • /
    • pp.13-22
    • /
    • 2020
  • The effectiveness of mathematics classroom teaching is directly affected by the teaching language. Comparing the teaching language of a novice teacher in algebra instruction with an expert teacher from the perspective of pragmatics, it comes to a conclusion that: both teachers attach great importance to the use of the teaching language, with the proportion of the teaching language time more than 50%; the novice teacher uses the affirmative language frequently, twice as often as the expert teacher; the declarative language the novice teacher uses in the exploration is mostly to repeat students' answer, which takes up a short time; the novice teacher uses the teaching language too much in the consolidation, which causes fewer opportunities for students to think. Then we get the following revelations: streamline the teaching language and control the time of the teaching language reasonably; make good use of the affirmative language to provide students hints and necessary time for thinking; avoid simple restatement of the student's answer and use the declarative language ingeniously to improve the feedback quality; use the teaching language appropriately to help students accumulate basic experience in mathematics activities.

잰킷 행렬을 이용한 저밀도 부호의 구성 (Low Density Codes Construction using Jacket Matrices)

  • 문명룡;이광재;;황기연;이문호
    • 대한전자공학회논문지TC
    • /
    • 제42권8호
    • /
    • pp.1-10
    • /
    • 2005
  • 본 논문에서는 대수 이론과 관련된 일반화된 치환 행렬로부터 저밀도 부호의 명시적 구성을 고찰하였으며, 순환공식과 치환행렬에 관한 재킷 역 블록 행렬을 설계하였다. 설계 결과로부터 제안 기법은 저밀도 부호를 얻기 위한 간단하며, 고속화된 기법임을 알 수 있다. 또한, $\pi$-회전 LDPC(low density parity check) 부호와 같은 구조화 LDPC 부호 역시 저밀도 재킷 역 블록 행렬임을 증명하였다.