• Annual Conference on Human and Language Technology
• /
• 2009.10a
• /
• pp.160-164
• /
• 2009

최근 인터넷 및 컴퓨터의 사용이 활발해짐에 따라 문서의 디지털화가 빠르게 진행되고 있다. 이런 변화에 따라 수학식이 많이 사용되는 과학, 공학, 수학 등의 분야와 관련된 문서들을 검색해야할 필요성이 늘어가고 있다. 그러나 현재 일반 검색엔진은 텍스트 검색만을 제공하며 별도의 수학식 검색은 제공하지 않는다. 따라서 본 논문에서는 수학식 검색이 가능하도록 수학식의 색인 방법 및 랭킹 방법을 제안한다. 제안하는 색인 방법은 MathML로 입력되는 수학식을 후위 표기법과 일반 색인 방법의 두 가지로 색인하며, 언어모델을 사용하여 질의에 적합한 수학식을 랭킹한다. 일반 검색 엔진의 성능과 비교하기 위하여 2-포아송 모델과 제안 모델을 비교하였으며, 그 결과 제안 모델의 성능이 더 우수함을 보였다.

• Journal for History of Mathematics
• /
• v.18 no.4
• /
• pp.39-48
• /
• 2005

Many researchers consider Mesopotamian mathematics as the earliest form of mathematics. The aim of this article is to provide a brief overview of the environmental and social background which made mathematical development. Historically. mathematics is always a product of society. So it is valuable to study historical background which have produced mathematics.

• Journal of applied mathematics & informatics
• /
• v.41 no.6
• /
• pp.1181-1191
• /
• 2023

This paper investigates Young inequalities for matrices, a problem closely linked to operator theory, mathematical physics, and the arithmetic-geometric mean inequality. By obtaining new inequalities for unitarily invariant norms, we aim to derive a fresh Young inequality specifically designed for matrices.To lay the foundation for our study, we provide an overview of basic notation related to matrices. Additionally, we review previous advancements made by researchers in the field, focusing on Young improvements.Building upon this existing knowledge, we present several new enhancements of the classical Young inequality for nonnegative real numbers. Furthermore, we establish a matrix version of these improvements, tailored to the specific characteristics of matrices. Through our research, we contribute to a deeper understanding of Young inequalities in the context of matrices.

• Journal of the Korean School Mathematics Society
• /
• v.16 no.4
• /
• pp.797-820
• /
• 2013

This study intended on analyzing the error patterns of mathematic problem posing sentences by the 100 elementary pre-teachers and discussing about the solutions. The results showed that the problem posing sentences have five error patterns: phonological error patterns, word error patterns, sentence error patterns, meaning error patterns, and notation error patterns. Divided into fourteen specific error patterns, they are as in the following. 1) Phonological error patterns are consisted of the 'ㄹ' addition error pattern and the abbreviated word error pattern. 2) Words error patterns are divided with the inappropriate usage of word error pattern and the inadequate abbreviation error pattern, which are formulized four subgroups such as the case maker, ending of the word, inappropriate usage of word, and inadequate abbreviation of article or word error pattern in detail. 3) Sentence error patterns are assumed four kinds of forms: the reference, ellipsis of sentence component, word order, and incomplete sentence error pattern. 4) Meaning error patterns are composed the logical contradiction and the ambiguous meaning. 5) Notation error patterns are formed four patterns as the spacing, punctuation, orthography of Hangul, and spelling rules of foreign words in Korean. Furthermore, the solutions for these error patterns were discussed: First, it has to be perceived the differences between spoken and written language. Second, it has to be rejected the spoken expressions in written contexts. Third, it should be focused on the learning of the basic sentence patterns during the class. Forth, it is suggested that the word meaning should have the logical development perception based on what it means. Finally, it is proposed that the system of spelling of Korean has to be learned. In addition to these suggestions, a new understanding is necessary regarding writing education for college students.

• Journal of the Korean Mathematical Society
• /
• v.44 no.5
• /
• pp.1163-1184
• /
• 2007

In this presentation dedicated to the tricentennial birth anniversary of the great eighteenth-century Swiss mathematician, Leonhard Euler (1707-1783), we begin by remarking about the so-called Basler problem of evaluating the Zeta function ${\zeta}(s)$ [in the much later notation of Georg Friedrich Bernhard Riemann (1826-1866)] when s=2, which was then of vital importance to Euler and to many other contemporary mathematicians including especially the Bernoulli brothers [Jakob Bernoulli (1654-1705) and Johann Bernoulli (1667-1748)], and for which a fascinatingly large number of seemingly independent solutions have appeared in the mathematical literature ever since Euler first solved this problem in the year 1736. We then investigate various recent developments on the evaluations and representations of ${\zeta}(s)$ when $s{\in}{\mathbb{N}}{\backslash}\;[1],\;{\mathbb{N}}$ being the set of natural numbers. We emphasize upon several interesting classes of rapidly convergent series representations for ${\zeta}(2n+1)(n{\in}{\mathbb{N}})$ which have been developed in recent years. In two of many computationally useful special cases considered here, it is observed that ${\zeta}(3)$ can be represented by means of series which converge much more rapidly than that in Euler's celebrated formula as well as the series used recently by Roger $Ap\'{e}ry$ (1916-1994) in his proof of the irrationality of ${\zeta}(3)$. Symbolic and numerical computations using Mathematica (Version 4.0) for Linux show, among other things, that only 50 terms of one of these series are capable of producing an accuracy of seven decimal places.

• Structural Engineering and Mechanics
• /
• v.48 no.6
• /
• pp.849-878
• /
• 2013

This paper consists of two parts, which broadly examines solution techniques abilities for the structures with geometrical nonlinear behavior. In part I of the article, formulations of several well-known approaches will be presented. These solution strategies include different groups, such as: residual load minimization, normal plane, updated normal plane, cylindrical arc length, work control, residual displacement minimization, generalized displacement control, modified normal flow, and three-parameter ellipsoidal, hyperbolic, and polynomial schemes. For better understanding and easier application of the solution techniques, a consistent mathematical notation is employed in all formulations for correction and predictor steps. Moreover, other features of these approaches and their algorithms will be investigated. Common methods of determining the amount and sign of load factor increment in the predictor step and choosing the correct root in predictor and corrector step will be reviewed. The way that these features are determined is very important for tracing of the structural equilibrium path. In the second part of article, robustness and efficiency of the solution schemes will be comprehensively evaluated by performing numerical analyses.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.15 no.5 s.98
• /
• pp.527-535
• /
• 2005

This paper explains a general coupling system in terms of the system parameters. impedance of a cavity or mobility of a structure. To easily access the mechanism of the structural-acoustic coupled system, a simple expression is derived. A general coupled equation is also derived of a general coupled problem constituted a flexible structure and an opening boundary in terms of vector and matrix notation, and is analyzed the coupling phenomena using the understanding acquired simple coupled system. The paper shows that the general coupled equation is expanded version of the simple coupled equation by some limiting checks. The paper also shows that the degree of coupling is proportioned to a stiffness of the acoustic system and a modal coupling coefficient, but is in inverse proportion to a mass of the structural system and the difference of the excitation frequency and resonant frequency of the acoustic or structural system.

• Proceedings of the KIEE Conference
• /
• 1996.11a
• /
• pp.39-41
• /
• 1996

While the z-transform method is a basic mathematical tool to relate the signals only at the sampling instants in analyzing and designing sampled-data control systems, the modified z-transform which is a variation of the z-transform is widely used to represent the details of continuous signals between the sampling instants. Regarding the modified z-transform method, some properties were established to relate the modified z-transform to the regular z-transform. This paper will show that these properties, in their current forms, cause some analytic problems, when they are applied to the signals with discontinuities at the sampling instants, which accordingly limit their applications significantly. In this paper, those analytic problems will be investigated, and the theorems of the modified z-transform will be revised by adopting a new notation so that those can be correctly interpreted and used without any analytic problems in the analysis of sampled data systems. Also some useful schemes of applying the modified z-transform will be developed.

• Bulletin of the Korean Mathematical Society
• /
• v.22 no.2
• /
• pp.121-126
• /
• 1985

D.K. Harrison [5] has shown that if R and S are fields of characteristic different from 2, then two Witt rings W(R) and W(S) are isomorphic if and only if W(R)/I(R)$^{3}$ and W(S)/I(S)$^{3}$ are isomorphic where I(R) and I(S) denote the fundamental ideals of W(R) and W(S) respectively. In [1], J.K. Arason and A. Pfister proved a corresponding result when the characteristics of R and S are 2, and, in [9], K.I. Mandelberg proved the result when R and S are commutative semi-local rings having 2 a unit. In this paper, we prove the result when R and S are 2-fold full rings. Throughout this paper, unless otherwise specified, we assume that R is a commutative ring having 2 a unit. A quadratic space (V, B, .phi.) over R is a finitely generated projective R-module V with a symmetric bilinear mapping B: V*V.rarw.R which is nondegenerate (i.e., the natural mapping V.rarw.Ho $m_{R}$ (V, R) induced by B is an isomorphism), and with a quadratic mapping .phi.:V.rarw.R such that B(x,y)=(.phi.(x+y)-.phi.(x)-.phi.(y))/2 and .phi.(rx)= $r^{2}$.phi.(x) for all x, y in V and r in R. We denote the group of multiplicative units of R by U(R). If (V, B, .phi.) is a free rank n quadratic space over R with an orthogonal basis { $x_{1}$, .., $x_{n}$}, we will write < $a_{1}$,.., $a_{n}$> for (V, B, .phi.) where the $a_{i}$=.phi.( $x_{i}$) are in U(R), and denote the space by the table [ $a_{ij}$ ] where $a_{ij}$ =B( $x_{i}$, $x_{j}$). In the case n=2 and B( $x_{1}$, $x_{2}$)=1/2, we reserve the notation [ $a_{11}$, $a_{22}$] for the space.the space.e.e.e.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.10
• /
• pp.1773-1778
• /
• 2006

This paper propose the method of constructing the Digital Logic Systems based on the Improved Automatic Theorem Proving Techniques(IATP) over Finite Fields. The proposed method is as following. First, we discuss the background and the important mathematical properties for Finite Fields. Also, we discuss the concepts of the Automatic Theorem Proving Techniques(ATP) including the syntactic method and semantic method, and discuss the basic properties for the Alf. In this step, we define several definitions of the IAIP, Table Pseudo Function Tab and Equal. Next, we propose the T-gate as Building Block(BB) and describe the mathematical representation for the notation of T-gate. Then we discuss the important properties for the T-gate. Also, we propose the several relationships that are Identity relationship, Constant relationship, Tautology relationship and Mod R cyclic relationship. Then we propose Mod R negation gate and the manipulation of the don't care conditions. Finally, we propose the algorithm for the constructing the method of the digital logic systems over finite fields. The proposed method is more efficiency and regularity than my other earlier methods. Thet we prospect the future research and prospects.