• Journal of applied mathematics & informatics
• /
• 제40권5_6호
• /
• pp.1137-1150
• /
• 2022

Consider the quantum algebra U_q(sl₂) over field 𝓕 (char(𝓕) = 0) with equitable generators x^±1, y and z, where q is fixed nonzero, not root of unity scalar in 𝓕. Let V denote a finite dimensional irreducible module for this algebra. Let Λ ∈ End(V), and let {A₁, A₂, A₃} = {x, y, z}. First we show that if Λ, A₁ is a Leonard pair, then this Leonard pair have four types, and we show that for each type there exists a Leonard pair Λ, A₁ in which Λ is a linear combination of 1, A₂, A₃, A₂A₃. Moreover, we use Λ to construct 𝚼 ∈ U_q(sl₂) such that 𝚼, A^-1₁ is a Leonard pair, and show that 𝚼 = I + A₁Φ + A₁ΨA₁ where Φ and Ψ are linear combination of 1, A₂, A₃.

• International Journal of Computer Science & Network Security
• /
• 제23권6호
• /
• pp.193-201
• /
• 2023

In this paper, we consider the maximum scatter traveling salesman problem (MSTSP), a travelling salesman problem (TSP) variant. The problem aims to maximize the minimum length edge in a salesman's tour that travels each city only once in a network. It is a very complicated NP-hard problem, and hence, exact solutions can be found for small sized problems only. For large-sized problems, heuristic algorithms must be applied, and genetic algorithms (GAs) are found to be very successfully to deal with such problems. So, this paper develops a hybrid GA (HGA) for solving the problem. Our proposed HGA uses sequential sampling algorithm along with 2-opt search for initial population generation, sequential constructive crossover, adaptive mutation, randomly selected one of three local search approaches, and the partially mapped crossover along with swap mutation for perturbation procedure to find better quality solution to the MSTSP. Finally, the suggested HGA is compared with a state-of-art algorithm by solving some TSPLIB symmetric instances of many sizes. Our computational experience reveals that the suggested HGA is better. Further, we provide solutions to some asymmetric TSPLIB instances of many sizes.

• Journal of Applied and Pure Mathematics
• /
• 제5권3_4호
• /
• pp.187-196
• /
• 2023

This study is about spin half add operations in 𝓑₂ and 𝓑₃. The burden of technological structures has increased due to the increase in the use of today's technological applications or the processes in the digital systems used. This has increased the importance of fast transactions and storage areas. For this, less transactions, more gain and storage space are foreseen. We have handle tit (triple digit) system instead of bit (binary digit). 729 is reached in 3⁶ in 𝓑₃ while 256 is reached with 2⁸ in 𝓑₂. The volume and number of transactions are shortened in 𝓑₃. The limited storage space at the maximum level is storaged. The logic connectors and the complement of an element in 𝓑₂ and the course of the connectors and the complements of the elements in 𝓑₃ are examined. "Carry" calculations in calculating addition and "borrow" in calculating difference are given in 𝓑₃. The logic structure 𝓑₂ is seen to embedded in the logic structure 𝓑₃. This situation enriches the logic structure. Some theorems and lemmas and properties in logic structure 𝓑₂ are extended to logic structure 𝓑₃.

• Journal of applied mathematics & informatics
• /
• 제41권5호
• /
• pp.989-999
• /
• 2023

The aim of this paper is to study the projective curvature tensor field of the Curvature tensor Rⁱ_jkh on a recurrent non Riemannian space admitting recurrent affine motion, which is also decomposable in the form Rⁱ_jkh=Xⁱ Y_jkh, where Xⁱ and Y_jkh are non-null vector and tensor respectively. In this paper we decompose Special Pseudo Projective Curvature Tensor Field. In the sequal of decomposition we established several properties of such decomposed tensor fields. We have considered the curvature tensor field Rⁱ_jkh in a Finsler space equipped with non symmetric connection and we study the decomposition of such field. In a special Pseudo recurrent Finsler Space, if the arbitrary tensor field 𝜓ⁱ_j is assumed to be a covariant constant then, in view of the decomposition rule, 𝜙_kh behaves as a recurrent tensor field. In the last, we have considered the decomposition of curvature tensor fields in Kaehlerian recurrent spaces and have obtained several related theorems.

• 정보교육학회논문지
• /
• 제19권1호
• /
• pp.11-20
• /
• 2015

소프트웨어 교육의 중요성과 함께 Computational Thinking 교육에 대한 연구가 활발히 논의되고 있지만 실제 초등교과와 연계하여 개발된 프로그램은 많지 않다. 이에 본 연구는 수학교과에서 Computational Thinking을 적용한 교육 프로그램을 개발하였다. 우선 수학에서의 CT 적용 방안을 3가지 모델로 설정하였고 CT기반 수학의 수업을 달성하기 위한 교수 학습 자료를 개발하였다. 개발된 자료를 수업에 적용하여 학습자의 긍정적인 만족도를 도출하였다. 또한 학교 적용 타당성 검증을 위하여, 전문가들을 대상으로 타당도 검사를 실시한 결과 자료가 학교 현장에 도움이 될 뿐만 아니라 학생의 CT능력 신장에도 도움이 된다는 결과가 나왔다.

• 한국전산구조공학회논문집
• /
• 제34권4호
• /
• pp.191-197
• /
• 2021

분자동역학에서의 원자들의 유도전하를 계산하기 위해서는 유도전하를 미지수로 하는 선형방정식을 풀어야 하는데 원자들의 위치가 변화할 때마다 필요한 계산이므로 상당한 계산비용이 요구된다. 따라서 효율적인 유도전하 계산 방법은 다양한 시스템을 해석하기 위해서 필수적이다. 본 연구에서는 constraints가 존재하는 Lagrange 방정식의 해에 대한 선형 시스템, 즉 saddle point를 가지는 문제를 해결하기 위해서 Uzawa method를 도입하였다. Uzawa 매개변수가 수렴 속도에 영향을 미치는 단점을 극복하고 행렬 연산의 효율성을 위해서 Schur complement와 preconditioned conjugate gradient (PCG) 방법을 통해 계산의 효율성을 극대화하는 가속 Uzawa algorithm을 적용한다. 두 금속 나노입자가 전기장에 놓여진 분자동역학 수치모델을 통해서 제시된 방법이 유도전하계산의 수렴성, 효율성 측면에서 모두 향상된 결과를 도출함을 확인하였다. 특히 기존의 가우스 소거법에 의한 계산보다 약 1/10으로 계산비용이 절감되었고, 기본 Uzawa method에 비하여 conjugate gradient (CG)의 높은 수렴성이 입증되었다.

• 한국수학사학회지
• /
• 제23권3호
• /
• pp.141-168
• /
• 2010

수학적 의사소통은 수학 교수 학습 과정에서 학습에 참여하는 사람들 간에 수학적 아이디어를 교환하는데 필수적인 활동이다. 2007년 개정 수학과 교육과정에서는 수학적 의사소통 능력의 신장을 여러 영역에서 명시하고 있다. 이에 따라 편찬된 '고등학교 수학' 18종 교과서에는 의사소통 문제를 다루는 코너가 마련되어 있고, 실제 학교 현장의 교사들은 수학 수업 시간에 어떤 과제를 어떤 방식으로 의사소통을 해야 할지에 대해 알고 싶어 한다. 이렇게 수학적 의사소통이 수학 교육에서 해결해야 할 중요한 문제로 부각되는 시점에서 본 논문은 수학적 의사소통에 대하여 고찰해 보고, 이를 토대로 '고등학교 수학' 교과서에 수록된 의사소통 관련 코너의 내용을 분석하여 유형화하고 나아가 각 유형에 적절한 의사소통 활동을 제시함으로써 차후에 개정될 교과서의 실질적인 의사소통 코너 마련을 위한 정보 및 교사들에게 수학적 의사소통이 활발한 수학 수업을 안내할 수 있는 틀을 제공하는 것을 목적으로 한다.

• Journal of applied mathematics & informatics
• /
• 제26권3_4호
• /
• pp.457-469
• /
• 2008

In this paper, we study the existence of positive solutions for the following nonlinear m-point boundary value problem with p-Laplacian: $\{{{{(\phi_p(u'))'\;+\;f(t,u(t))=0, \;0<t<1,} \atop u'(0)={\sum}{^{m-2}_{i=1}}\;a_iu'(\xi_i),} \atop u(1)={\sum}{^k_{i=1}}\;b_iu(\xi_i)\;-\;{\sum}{^s_{i=k+1}}\;b_iu(\xi_i)\;-\;{\sum}{^{m-2}_{i=s+1}}\;b_iu'(xi_i),}$ where ${\phi}_p(s)$ is p-Laplacian operator, i.e., ${\phi}_p(s)=\mid s\mid^{p-2}s$, p>1, ${\phi}_q\;=\;({\phi}_p)^{-1}$, $\frac{1}{p}+\frac{1}{q}=1$, $1\;{\leq}\;k\;{\leq}\;s\;{\leq}m\;-\;2$, $b_i\;{\in}\;(0,+{\infty})$ with $0\;<\;{\sum}{^k_{k=1}}\;b_i\;-\;{\sum}{^s_{i=k+1}}\;b_i\;<\;1$, $0\;<\;{\sum}{^{m-2}_{i=1}}\la_i\;<\;1$, $0\;<\;{\xi}_1\;<\;{\xi}_2\;<\;{\cdots}\;<\;{\xi}_{m-2}\;<\;1$, $f\;{\in}\;C([0,\;1]\;{\times}\;[0,\;+{\infty}),\;[0,\;+{\infty}))$. We show that there exists one or two positive solutions by using fixed-point theorem for operator on a cone. The conclusions in this paper essentially extend and improve the known results.

• Journal of applied mathematics & informatics
• /
• 제33권1_2호
• /
• pp.173-183
• /
• 2015

A radio k-labeling f of a graph G is a function f from V (G) to $Z^+{\cup}\{0\}$ such that $d(x,y)+{\mid}f(x)-f(y){\mid}{\geq}k+1$ for every two distinct vertices x and y of G, where d(x, y) is the distance between any two vertices $x,y{\in}G$. The span of a radio k-labeling f is denoted by sp(f) and defined as max$\{{\mid}f(x)-f(y){\mid}:x,y{\in}V(G)\}$. The radio k-labeling is a radio labeling when k = diam(G). In other words, a radio labeling is an injective function $f:V(G){\rightarrow}Z^+{\cup}\{0\}$ such that $${\mid}f(x)=f(y){\mid}{\geq}diam(G)+1-d(x,y)$$ for any pair of vertices $x,y{\in}G$. The radio number of G denoted by rn(G), is the lowest span taken over all radio labelings of the graph. When k = diam(G) - 1, a radio k-labeling is called a radio antipodal labeling. An antipodal labeling for a graph G is a function $f:V(G){\rightarrow}\{0,1,2,{\ldots}\}$ such that $d(x,y)+{\mid}f(x)-f(y){\mid}{\geq}diam(G)$ holds for all $x,y{\in}G$. The radio antipodal number for G denoted by an(G), is the minimum span of an antipodal labeling admitted by G. In this paper, we investigate the exact value of the radio number and radio antipodal number for the circulant graphs G(4k + 2; {1, 2}).

• Journal of applied mathematics & informatics
• /
• 제30권5_6호
• /
• pp.871-882
• /
• 2012

For a connected graph G of order $n$, an ordered set $S=\{u_1,u_2,{\cdots},u_k\}$ of vertices in G is a linear edge geodetic set of G if for each edge $e=xy$ in G, there exists an index $i$, $1{\leq}i$ < $k$ such that e lie on a $u_i-u_{i+1}$ geodesic in G, and a linear edge geodetic set of minimum cardinality is the linear edge geodetic number $leg(G)$ of G. A graph G is called a linear edge geodetic graph if it has a linear edge geodetic set. The linear edge geodetic numbers of certain standard graphs are obtained. Let $g_l(G)$ and $eg(G)$ denote the linear geodetic number and the edge geodetic number, respectively of a graph G. For positive integers $r$, $d$ and $k{\geq}2$ with $r$ < $d{\leq}2r$, there exists a connected linear edge geodetic graph with rad $G=r$, diam $G=d$, and $g_l(G)=leg(G)=k$. It is shown that for each pair $a$, $b$ of integers with $3{\leq}a{\leq}b$, there is a connected linear edge geodetic graph G with $eg(G)=a$ and $leg(G)=b$.