• Journal of Elementary Mathematics Education in Korea
• /
• v.23 no.1
• /
• pp.75-92
• /
• 2019

The 2015 revised mathematics curriculum encourages students to use graphs in newspapers and the Internet as materials when teaching graphs, and to experience a series of statistical problem-solving processes that collect, classify, organize, graph and interpret data. The graphs that the students learn through traditional textbooks were a single type of graphs. In particular, the graphs of the 5th and 6th grade groups were only increased in numbers, but the basic concepts were repeated in the 3rd and 4th grades. Fortunately, from the 2009 revision curriculum, it is possible to select the graph suitable for the situation while comparing the characteristics of some graphs. In most cases, the graphs used in the real world are presented in the form of a compounded infographics. The purpose of this study is to analyze and analyze the manifestations of information processing competence elements emphasized in the 2015 revised curriculum through the statistical project class using the informal graphic in the fifth grade of elementary school. And we suggested a concrete class plan.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.6
• /
• pp.804-806
• /
• 2007

The usual arithmetic operations on real numbers can be extended to arithmetical operations on fuzzy intervals by means of Zadeh's extension principle based on a t-norm T. Dombi and Gyorbiro proved that addition is closed if the Dombi t-norm is used with two bell-shaped fuzzy intervals. Recently, Hong [Fuzzy Sets and Systems 158(2007) 739-746] defined a broader class of bell-shaped fuzzy intervals. Then he study t-norms which are consistent with these particular types of fuzzy intervals as applications of a result proved by Mesiar on a strict f-norm based shape preserving additions of LR-fuzzy intervals with unbounded support. In this note, we give a direct proof of the main results of Hong.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.169-178
• /
• 1996

Geographically dispersed computing system is made of computers interconnected by a telecommunications network. To make the system operated efficiently, system designer must determine the allocation of data files to each node. In designing such distributed computing system, the most important issue is the determination of the numbers and the locations where database files are allocated. This is commonly referred to as the file allocation problem (FAP)[3]. The proposed model is a 0/l integer programming problem minimizing the sum of file storage costs and communication(query and update) costs. File allocation problem belongs to the class of NP-Complete problems. Because of the complexity, it is hard to solve. So, this paper presents an efficient heuristic algorithm to solve the file allocation problem using Tabu Search Technique. By comparing the optimal solutions with the heuristic solutions, it is believed that the proposed heuristic algorithm gives good solutions. Through the experimentation of various starting points and tabu restrictions, this paper presents fast and efficient method to solve the file allocation problem in the distributed computing system.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.1-19
• /
• 1998

In this Kdynote address, two types of information granules are considered : (ⅰ) one for set assignments of a concept descriptor and (ⅱ) the other for truthood assignment to the concept description verifier. The first is, the process which specifies the assignment of an object to a clump, a class, a group, etc., and hence defines the set membership with a relational constraint. the second is the assignment of the degree of truthood or the membership specification of the abstract concept of truthood which specifies the " veristic" constraint associated with the concept descriptor. The combination of these two distinct assignments let us generate four set and logic theories. This then leads to the concern of normal forms and their derivation from truth tables for each of these theories. In this regard, some of the fundamental issues arising in this context are discussed and certain preliminary answers are provided in order to highlight the consequences of these theories.

• Publications of The Korean Astronomical Society
• /
• v.32 no.1
• /
• pp.251-255
• /
• 2017

Submillimetre and millimetre-wave surveys with Herschel and the South Pole Telescope have revolutionised the discovery of strong gravitational lenses. Their follow-ups have been greatly facilitated by the multi-wavelength supplementary data in the survey fields. The forthcoming Euclid optical/near-infrared space telescope will also detect strong gravitational lenses in large numbers, and orbital constraints are likely to require placing its deep survey at the North Ecliptic Pole (the natural deep field for a wide class of ground-based and space-based observatories including AKARI, JWST and SPICA). In this paper I review the current status of the multi-wavelength survey coverage in the NEP, and discuss the prospects for the detection of strong gravitational lenses in forthcoming or proposed facilities such as Euclid, FIRSPEX and SPICA.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1117-1127
• /
• 2011

In this paper, a class of more general delayed viral infection model with lytic immune response is proposed by Song et al.[1] ([Journal of Mathematical Analysis Application 373 (2011), 345-355). We derive the basic reproduction numbers $R_0$ and $R_0^*$ 0 for the viral infection, and establish that the global dynamics are completely determined by the values of $R_0$ and $R_0^*$. If $R_0{\leq}1$, the viral-free equilibrium $E_0$ is globally asymptotically stable; if $R_0^*{\leq}1$ < $R_0$, the immune-free equilibrium $E_1$ is globally asymptotically stable; if $R_0^*$ > 1, the chronic-infection equilibrium $E_2$ is globally asymptotically stable by using the method of Lyapunov function.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.819-833
• /
• 2013

Computing global features based on local features using a bio-inspired framework has shown promising performance. However, for some tough applications with large intra-class variances, a single local feature is inadequate to represent all the attributes of the images. To integrate the complementary abilities of multiple local features, in this paper we have extended the efficacy of the bio-inspired framework, HMAX, to adapt heterogeneous features for global feature extraction. Given multiple global features, we propose an approach, designated as parameterized metric learning, for high dimensional feature fusion. The fusion parameters are solved by maximizing the canonical correlation with respect to the parameters. Experimental results show that our method achieves significant improvements over the benchmark bio-inspired framework, HMAX, and other related methods on the Caltech dataset, under varying numbers of training samples and feature elements.

• IE interfaces
• /
• v.18 no.1
• /
• pp.10-21
• /
• 2005

With the increasing proliferation of World Wide Web, electronic mail systems have become very widely used communication tools. Researches on e-mail classification have been very important in that e-mail classification system is a major engine for e-mail response management systems which mine unstructured e-mail messages and automatically categorize them. In this research we compare the performance of Naive Bayesian learning and Centroid-Based Classification using the different data set of an on-line shopping mall and a credit card company. We analyze which method performs better under which conditions. We compared classification accuracy of them which depends on structure and size of train set and increasing numbers of class. The experimental results indicate that Naive Bayesian learning performs better, while Centroid-Based Classification is more robust in terms of classification accuracy.

• Korean Management Science Review
• /
• v.25 no.2
• /
• pp.25-42
• /
• 2008

CDMA/TOD with asymmetric capacity allocation between uplink and downlink is a highly attractive solution to support the next generation mobile systems. This is because flexible asymmetric allocation of capacity to uplink and downlink usually improves the utilization of the limited bandwidth. In this paper, we mathematically formulate an optimal timeslot and code allocation problem, which is to maximize the total utility considering the numbers of codes(channels) allocated to each data class and the forced terminations of previously allocated codes. We also suggest a real-time integrated timeslot and code allocation scheme using Lagrangean relaxation and subgradient optimization techniques. Experimental results show that the proposed scheme provides high-quality solutions in a fast time.

• Communications of the Korean Mathematical Society
• /
• v.12 no.4
• /
• pp.935-950
• /
• 1997

When $\tau$ is a quasi-definite moment functional on P, the vector space of all real polynomials, we consider a symmetric bilinear form $\phi(\cdot,\cdot)$ on $P \times P$ defined by $$ \phi(p,q) = \lambad p(a)q(a) + \mu p(b)q(b) + <\tau,p'q'>, $$ where $\lambda,\mu,a$, and b are real numbers. We first find a necessary and sufficient condition for $\phi(\cdot,\cdot)$ and show that such orthogonal polynomials satisfy a fifth order differential equation with polynomial coefficients.