• Research in Mathematical Education
• /
• v.12 no.1
• /
• pp.67-83
• /
• 2008

Promoting students' mathematics understanding is an important research theme in mathematics education. According to general theories of learning, mathematics understanding is close to active learning or significant learning. Thus, if a teacher wants to promote his/her students' mathematics understanding, he/she should pay attention to the students so that the students' thinking is in active situation. In the first part of this paper, some mathematics teachers' ideas about paying attention to their students in Chinese high school are given by questionnaire and interview. In the second part of this paper, we give some teaching episodes about how experienced mathematics teachers promote their students' mathematics understanding based on paying attention on them.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5592-5609
• /
• 2017

JPEG steganography detection is an active research topic in the field of information hiding due to the wide use of JPEG image in social network, image-sharing websites, and Internet communication, etc. In this paper, a new steganalysis method for content-adaptive JPEG steganography is proposed by integrating the evolutionary feature selection and classifier ensemble selection. First, the whole framework of the proposed steganalysis method is presented and then the characteristic of the proposed method is analyzed. Second, the feature selection method based on genetic algorithm is given and the implement process is described in detail. Third, the method of classifier ensemble selection is proposed based on Pareto evolutionary optimization. The experimental results indicate the proposed steganalysis method can achieve a competitive detection performance by compared with the state-of-the-art steganalysis methods when used for the detection of the latest content-adaptive JPEG steganography algorithms.

• Communications of the Korean Mathematical Society
• /
• v.31 no.1
• /
• pp.65-94
• /
• 2016

In 1812, Gauss obtained fifteen contiguous functions relations. Later on, 1847, Henie gave their q-analogue. Recently, good progress has been done in finding more contiguous functions relations by employing results due to Gauss. In 1999, Cho et al. have obtained 24 new and interesting contiguous functions relations with the help of Gauss's 15 contiguous relations. In fact, such type of 72 relations exists and therefore the rest 48 contiguous functions relations have very recently been obtained by Rakha et al.. Thus, the paper is in continuation of the paper [16] published in Computer & Mathematics with Applications 61 (2011), 620.629. In this paper, first we obtained 15 q-contiguous functions relations due to Henie by following a different method and then with the help of these 15 q-contiguous functions relations, we obtain 72 new and interesting q-contiguous functions relations. These q-contiguous functions relations have wide applications.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.2
• /
• pp.285-301
• /
• 2022

In this paper, we mainly study the random sampling and reconstruction of signals living in the subspace V^p(𝚽, 𝚲) of L^p(ℝ^d), which is generated by a family of molecules 𝚽 located on a relatively separated subset 𝚲 ⊂ ℝ^d. The space V^p(𝚽, 𝚲) is used to model signals with finite rate of innovation, such as stream of pulses in GPS applications, cellular radio and ultra wide-band communication. The sampling set is independently and randomly drawn from a general probability distribution over ℝ^d. Under some proper conditions for the generators 𝚽 = {𝜙_λ : λ ∈ 𝚲} and the probability density function 𝜌, we first approximate V^p(𝚽, 𝚲) by a finite dimensional subspace V^p_N (𝚽, 𝚲) on any bounded domains. Then, we prove that the random sampling stability holds with high probability for all signals in V^p(𝚽, 𝚲) whose energy concentrate on a cube when the sampling size is large enough. Finally, a reconstruction algorithm based on random samples is given for signals in V^p_N (𝚽, 𝚲).

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.4
• /
• pp.859-868
• /
• 2007

The present paper deals with the ordering problem for how to teach mathematical concepts successfully. Main object is the concept of continuous functions which is fundamental in analysis and topology. At first, the theoretical organization of this concept is investigated through several texts in related field, calculus, analysis and topology. And next, the historical order for this concept from the viewpoint of problem-solving is considered. Based on these two materials, we suggest a lecturing organization order in order to establish a balanced unification of three concepts - intuitive, logical and formal concepts.

• Bulletin of the Korean Mathematical Society
• /
• v.26 no.2
• /
• pp.139-149
• /
• 1989

pp.Hartman and G. Stampacchia [6] proved the following theorem in 1966: If f:X.rarw. $R^{n}$ is a continuous map on a compact convex subset X of $R^{n}$ , then there exists $x_{0}$ ..mem.X such that $x_{0}$ , $x_{0}$ -x>.geq.0 for all x.mem.X. This remarkable result has been investigated and generalized by F.E. Browder [1], [2], W. Takahashi [9], S. Park [8] and others. For example, Browder extended this theorem to a map f defined on a compact convex subser X of a topological vector space E into the dual space $E^{*}$; see [2, Theorem 2]. And Takahashi extended Browder's theorem to closed convex sets in topological vector space; see [9, Theorem 3]. In Section 2, we obtain some variational inequalities, especially, generalizations of Browder's and Takahashi's theorems. The generalization of Browder's is an earlier result of the first author [8]. In Section 3, using Theorem 1, we improve and extend some known fixed pint theorems. Theorems 4 and 8 improve Takahashi's results [9, Theorems 5 and 9], respectively. Theorem 4 extends the first author's fixed point theorem [8, Theorem 8] (Theorem 5 in this paper) which is a generalization of Browder [1, Theroem 1]. Theorem 8 extends Theorem 9 which is a generalization of Browder [2, Theorem 3]. Finally, in Section 4, we obtain variational inequalities for multivalued maps by using Theorem 1. We improve Takahashi's results [9, Theorems 21 and 22] which are generalization of Browder [2, Theorem 6] and the Kakutani fixed point theorem [7], respectively.ani fixed point theorem [7], respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4275-4291
• /
• 2021

With the unprecedented growth of textual information on the Internet, an efficient automatic summarization system has become an urgent need. Recently, the neural network models based on the encoder-decoder with an attention mechanism have demonstrated powerful capabilities in the sentence summarization task. However, for paragraphs or longer document summarization, these models fail to mine the core information in the input text, which leads to information loss and repetitions. In this paper, we propose an abstractive document summarization method by applying guidance signals of key sentences to the encoder based on the hierarchical encoder-decoder architecture, denoted as KI-HABS. Specifically, we first train an extractor to extract key sentences in the input document by the hierarchical bidirectional GRU. Then, we encode the key sentences to the key information representation in the sentence level. Finally, we adopt key information representation guided selective encoding strategies to filter source information, which establishes a connection between the key sentences and the document. We use the CNN/Daily Mail and Gigaword datasets to evaluate our model. The experimental results demonstrate that our method generates more informative and concise summaries, achieving better performance than the competitive models.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.1
• /
• pp.13-29
• /
• 2007

In this paper, we first present a method for finding the implicit equation of the curve given by rational parametric equations. The method is based on the computation of $Gr\"{o}bner$ bases. Then, another method for implicitization of curve and surface is given. In the case of rational curves, the method proceeds via giving the implicit polynomial f with indeterminate coefficients, substituting the rational expressions for the given curve and surface into the implicit polynomial to yield a rational expression $\frac{g}{h}$ in the parameters. Equating coefficients of g in terms of parameters to 0 to get a system of linear equations in the indeterminate coefficients of polynomial f, and finally solving the linear system, we get all the coefficients of f, and thus we obtain the corresponding implicit equation. In the case of polynomial surfaces, we can similarly as in the case of rational curves obtain its implicit equation. This method is based on characteristic set theory. Some examples will show that our methods are efficient.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1195-1219
• /
• 2017

In this paper, the limit behavior of solution for the $Schr{\ddot{o}}dinger$ equation with random dispersion and time-dependent nonlinear loss/gain: $idu+{\frac{1}{{\varepsilon}}}m({\frac{t}{{\varepsilon}^2}}){\partial}_{xx}udt+{\mid}u{\mid}^{2{\sigma}}udt+i{\varepsilon}a(t){\mid}u{\mid}^{2{\sigma}_0}udt=0$ is studied. Combining stochastic Strichartz-type estimates with $L^2$ norm estimates, we first derive the global existence for $L^2$ and $H^1$ solution of the stochastic $Schr{\ddot{o}}dinger$ equation with white noise dispersion and time-dependent loss/gain: $idu+{\Delta}u{\circ}d{\beta}+{\mid}u{\mid}^{2{\sigma}}udt+ia(t){\mid}u{\mid}^{2{\sigma}_0}udt=0$. Secondly, we prove rigorously the global diffusion-approximation limit of the solution for the former as ${\varepsilon}{\rightarrow}0$ in one-dimensional $L^2$ subcritical and critical cases.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.1
• /
• pp.267-296
• /
• 2018

This paper studies the Cauchy problem and blow-up phenomena for a new generalized Camassa-Holm equation with cubic nonlinearity in the nonhomogeneous Besov spaces. First, by means of the Littlewood-Paley decomposition theory, we investigate the local well-posedness of the equation in $B^s_{p,r}$ with s > $max\{{\frac{1}{p}},\;{\frac{1}{2}},\;1-{\frac{1}{p}}\},\;p,\;r{\in}[0,{\infty}]$. Second, we prove that the equation is locally well-posed in $B^s_{2,r}$ with the critical index $s={\frac{1}{2}}$ by virtue of the logarithmic interpolation inequality and the Osgood's Lemma, and it is shown that the data-to-solution mapping is $H{\ddot{o}}lder$ continuous. Finally, we derive two kinds of blow-up criteria for the strong solution by using induction and the conservative property of m along the characteristics.