• Journal of applied mathematics & informatics
• /
• 제2권2호
• /
• pp.69-74
• /
• 1995

In this paper we define small and large(or big) automata. We investigate some algebraic properties associated with them

• Journal of applied mathematics & informatics
• /
• 제8권3호
• /
• pp.811.1-818
• /
• 2001

• Journal of applied mathematics & informatics
• /
• 제8권3호
• /
• pp.811.2-818
• /
• 2001

• 대한수학교육학회지:학교수학
• /
• 제19권3호
• /
• pp.553-570
• /
• 2017

본 연구는 21세기 필수 능력으로 거론되는 계산적 사고의 의미를 살펴보고, 수학교과에서 CT 교육의 가능성 여부와 그 선행 조건을 탐색할 목적으로 수행되었다. 선행연구를 통해 컴퓨터, 학교교육, 수학교육에서의 CT의 정의와 구성 요소를 조사하였으며 본 연구에서는 수학교과에서 CT를 수학적 문제해결 관련 사고로 보았다. CT-컴퓨팅(컴퓨터 활용)-수학교육 세 영역 사이의 관계 고찰에서 컴퓨팅환경에서 유용한 CT이나 수학교육에는 포함되지 않는 영역에 주목하였다. CT와 수학교육의 통합논의에서는 컴퓨터가 전통적 수학교육의 보조 수단으로 허용되는 우리나라 수학교육 현황을 고려할 때, '컴퓨팅 환경에서의 수학적 문제해결'에 주목할 필요가 있다고 보았다. 수학교육에서 CT 교육은 컴퓨팅 환경 조성을 전제로 수학교과에서 수학 관련 과제에 해결을 위한 코딩, 문제해결, STEAM 교육 맥락에서 수학과 CT의 통합을 제시하였으며 이를 위하여 CT 통합을 지원하는 수학교육과정 마련 등 제반 조건을 논의하였다.

• Journal of applied mathematics & informatics
• /
• 제30권3_4호
• /
• pp.395-411
• /
• 2012

Several methods with order higher than that of Newton methods which are of order 2 have been reported in literature for solving nonlinear equations. The focus of most of these methods was to economize on/minimize the number of function evaluations per iterations. We have demonstrated here that there are several computational pit-falls, such as the violation of fixed-point theorem, that one could encounter while using these methods. Further it was also shown that the overall computational complexity could be more in these high-order methods than that in the second-order Newton method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권6호
• /
• pp.2497-2517
• /
• 2020

For compressed sensing (CS) applications, it is significant to construct deterministic measurement matrices with good practical features, including good sensing performance, low memory cost, low computational complexity and easy hardware implementation. In this paper, a deterministic construction method of bipolar measurement matrices is presented based on binary sequence family (BSF). This method is of interest to be applied for sparse signal restore and image block CS. Coherence is an important tool to describe and compare the performance of various sensing matrices. Lower coherence implies higher reconstruction accuracy. The coherence of proposed measurement matrices is analyzed and derived to be smaller than the corresponding Gaussian and Bernoulli random matrices. Simulation experiments show that the proposed matrices outperform the corresponding Gaussian, Bernoulli, binary and chaotic bipolar matrices in reconstruction accuracy. Meanwhile, the proposed matrices can reduce the reconstruction time compared with their Gaussian counterpart. Moreover, the proposed matrices are very efficient for sensing performance, memory, complexity and hardware realization, which is beneficial to practical CS.

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.639-647
• /
• 2005

We count the number of maximal independent sets of binary trees and planted plane trees.

• Journal of applied mathematics & informatics
• /
• 제12권1_2호
• /
• pp.375-384
• /
• 2003

We introduce some algorithms for computing Mathematics and also give some questions based on the results from computations using CoCoA and Splus.

• Journal of applied mathematics & informatics
• /
• 제32권5_6호
• /
• pp.707-719
• /
• 2014

In this paper, we investigate a variational discretization approximation of elliptic optimal control problems with control constraints. The state and the co-state are approximated by piecewise linear functions, while the control is not directly discretized. By using some proper intermediate variables, we derive a second-order convergence in $L^2$-norm and superconvergence between the numerical solution and elliptic projection of the exact solution in $H^1$-norm or the gradient of the exact solution and recovery gradient in $L^2$-norm. Then we construct a posteriori error estimates by using the superconvergence results and do some numerical experiments to confirm our theoretical results.

• Journal of applied mathematics & informatics
• /
• 제31권3_4호
• /
• pp.479-490
• /
• 2013

In this paper, we investigate a priori error estimates and superconvergence of varitional discretization for nonlinear parabolic optimal control problems with control constraints. The time discretization is based on the backward Euler method. The state and the adjoint state are approximated by piecewise linear functions and the control is not directly discretized. We derive a priori error estimates for the control and superconvergence between the numerical solution and elliptic projection for the state and the adjoint state and present a numerical example for illustrating our theoretical results.