• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제11권2호
• /
• pp.143-151
• /
• 2007

Nowadays there are practically no mathematical courses in which Computer Algebra Systems (CAS) programs, such as MATHEMATlCA, Maple, and TI-89/92, are not used to some extent. However, generally the usage of these programs is reduced to illustration of computing processes: calculation of integrals, differentiation, solution of various equations, etc. This is obtained by usage of standard command of type: Solve [...] in MATHEMATICA. At the same time the main difficulties arise at teaching nonconventional mathematical courses such as coding theory, discrete mathematics, cryptography, Scientific computing, which are gaining the increasing popularity now. Now it is impossible to imagine a modern engineer not having basic knowledge in discrete mathematics, Cryptography, coding theory. Digital processing of signals (digital sound, digital TV) has been introduced in our lives.

• 충청수학회지
• /
• 제20권4호
• /
• pp.457-463
• /
• 2007

We show that any filter of Tarski algebra can be de-composed into the union of some sets. Moreover, we introduce the notion of expansions of filters in Tarski algebras, and discuss the notion of ${\sigma}$-primary filters in Tarski algebras. Finally, we show that there is no non-trivial quadratic Tarski algebras on a field X with $|X|{\geq}3$.

• 대한수학회보
• /
• 제40권3호
• /
• pp.425-435
• /
• 2003

In this paper, a new kind of matrices, i.e., $level-{\kappa}$ II-circulant matrices is considered. Algorithms for computing minimal polynomial of this kind of matrices are presented by means of the algorithm for the Grobner basis of the ideal in the polynomial ring. Two algorithms for finding the inverses of such matrices are also presented based on the Buchberger's algorithm.

• 대한수학회지
• /
• 제44권6호
• /
• pp.1291-1312
• /
• 2007

We study some extremal problems on the Cartan-Hartogs domains. Through computing the minimal circumscribed Hermitian ellipsoid of the Cartan-Hartogs domains, we get the $Carath\acute{e}odory$ extremal mappings between the Cartan-Hartogs domains and the unit hyperball, and the explicit formulas for computing the $Carath\acute{e}odory$ extremal value.

• 대한수학회보
• /
• 제46권4호
• /
• pp.789-802
• /
• 2009

We show that computation of a sequence of Richelot isogenies from specified supersingular Jacobians of genus-2 curves over $\mathbb{F}_p$ can be executed in $\mathbb{F}_{p2}$ or $\mathbb{F}_{p4}$ . Based on this, we describe a practical algorithm for computing a Richelot isogeny sequence.

• 충청수학회지
• /
• 제22권2호
• /
• pp.123-129
• /
• 2009

We introduce the notion of Smarandache GT-algebras, and the notion of Smarandache GT-filters of the Smarandache GT- algebra related to the Tarski algebra, and related some properties are investigated.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.127-139
• /
• 2007

In this paper, we investigate a discrete-time non-autonomous predator-prey system with the Beddington-DeAngelis functional response. By using the coincidence degree and the related continuation theorem as well as some priori estimates, easily verifiable sufficient criteria are established for the existence of positive periodic solutions.

• 대한수학회논문집
• /
• 제28권4호
• /
• pp.833-850
• /
• 2013

We present an algorithm for computing the Hausdorff distance between two parametric curves in $\mathbb{R}^n$, or more generally between two sets of parametric curves in $\mathbb{R}^n$. During repeated subdivision of the parameter space, we prune subintervals that cannot contain an optimal point. Typically, our algorithm costs O(logM) operations, compared with O(M) operations for a direct, brute-force method, to achieve an accuracy of $O(M^{-1})$.

• 대한수학회논문집
• /
• 제34권4호
• /
• pp.1353-1364
• /
• 2019

Modified Lagrange functional for solving an elastic problem with a crack is considered. Two formulations of a crack problem are investigated. The first formulation concerns a problem where a crack extending to the outer boundary of the domain. In the second formulation, we consider a problem with an internal crack. Duality ratio is established for initial and dual problem in both cases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권7호
• /
• pp.2512-2529
• /
• 2015

Wireless mesh networks (WMNs) provide an efficient and flexible method to the field of wireless networking, but also bring many security issues. A mesh point may lose all of its available links during its movement. Thus, the mesh point needs to handover to a new mesh point in order to obtain access to the network again. For multi-domain WMNs, we proposed a new ID-based signcryption scheme and accordingly present a novel ID-based handover protocol for mesh points. The mutual authentication and key establishment of two mesh points which belong to different trust domains can be achieved by using a single one-round message exchange during the authentication phase. The authentication server is not involved in our handover authentication protocol so that mutual authentication can be completed directly by the mesh points. Meanwhile, the data transmitted between the two mesh points can be carried by the authentication messages. Moreover, there are no restrictions on the PKG system parameters in our proposed multi-domain ID-based signcryption scheme so our handover scheme can be easily applied to real WMNs circumstances. Security of the signcryption scheme is proved in the random oracle model. It shows that our protocol satisfies the basic security requirements and is resistant to existing attacks based on the security of the signcryption. The analysis of the performance demonstrates that the protocol is efficient and suitable for the multi-domain WMNs environment.