• Journal of information and communication convergence engineering
• /
• v.22 no.1
• /
• pp.7-13
• /
• 2024

User preferences and ratings may be anticipated by recommendation systems, which are widely used in social networking, online shopping, healthcare, and even energy efficiency. Constructing trustworthy recommender systems for various applications, requires the analysis and mining of vast quantities of user data, including demographics. This study focuses on holding elections with vague voter and candidate preferences. Collaborative user ratings are used by filtering algorithms to provide suggestions. To avoid information overload, consumers are directed towards items that they are more likely to prefer based on the profile data used by recommender systems. Better interactions between governments, residents, and businesses may result from studies on recommender systems that facilitate the use of e-government services. To broaden people's access to the democratic process, the concept of "e-democracy" applies new media technologies. This study provides a framework for an electronic voting advisory system that uses machine learning.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.23 no.4
• /
• pp.301-327
• /
• 2019

The proper orthogonal decomposition (POD) method for time-dependent problems significantly reduces the computational time as it reduces the original problem to the lower dimensional space. Even a higher degree of reduction can be reached if the solution is smooth in space and time. However, if the solution is discontinuous and the discontinuity is parameterized e.g. with time, the POD approximations are not accurate in the reduced space due to the lack of ability to represent the discontinuous solution as a finite linear combination of smooth bases. In this paper, we propose to post-process the sample solutions and re-initialize the POD approximations to deal with discontinuous solutions and provide accurate approximations while the computational time is reduced. For the post-processing, we use the Gegenbauer reconstruction method. Then we regularize the Gegenbauer reconstruction for the construction of POD bases. With the constructed POD bases, we solve the given PDE in the reduced space. For the POD approximation, we re-initialize the POD solution so that the post-processed sample solution is used as the initial condition at each sampling time. As a proof-of-concept, we solve both one-dimensional linear and nonlinear hyperbolic problems. The numerical results show that the proposed method is efficient and accurate.

• East Asian mathematical journal
• /
• v.38 no.2
• /
• pp.187-214
• /
• 2022

This study compares the functions of the Learning Management Systems (LMS) in three widely used Edu-Tech platforms, that support students' individualized learning by using the learning characteristics of the students. The rapid advances in artificial intelligence (AI) are broadening their impacts in the education industry, and play a broad role in supporting student learning. In many countries, online classes have become a norm due to the COVID-19 crisis, and the demand for Edu-Tech in classes has increased rapidly. As a result, many countries, including South Korea, are now preparing and implementing various policy measures to adopt Edu-Tech in the class setting. Therefore, in this study, we analyze and compare the structures and characteristics of the three widely used Edu-Tech platforms that support individualized mathematics learning. In particular, we compare the LMSs of the three platforms by considering the elements such as learning design, learning management, learner analysis, learning result analysis, and student management functions. The results of this study give implications in the future directions to take on how to build Edu-Tech platform models that promote students' individualized mathematics learning in public education.

• Journal of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.727-740
• /
• 2008

A ring R is called IFP, due to Bell, if ab=0 implies aRb=0 for $a,b{\in}R$. Huh et al. showed that the IFP condition need not be preserved by polynomial ring extensions. But it is shown that ${\sum}^n_{i=0}$ $E_{ai}E$ is a nonzero nilpotent ideal of E whenever R is an IFP ring and $0{\neq}f{\in}F$ is nilpotent, where E is a polynomial ring over R, F is a polynomial ring over E, and $a_i^{'s}$ are the coefficients of f. we shall use the term near IFP to denote such a ring as having place near at the IFPness. In the present note the structures of IFP rings and near-IFP rings are observed, extending the classes of them. IFP rings are NI (i.e., nilpotent elements form an ideal). It is shown that the near-IFPness and the NIness are distinct each other, and the relations among them and related conditions are examined.

• The Journal of Korean Association of Computer Education
• /
• v.23 no.4
• /
• pp.1-11
• /
• 2020

The purpose of this study is to propose the direction of AI education in K-12 education through investigating and analyzing aspects of the purpose, content, and methods of AI education as the curriculum and teacher training factors. We collected and analyzed 9 papers as the primary literature and 11 domestic and foreign policy reports as the secondary literature. The collected literatures were analyzed by applying a descriptive reviews, and the implications were derived by analyzing the curriculum components and TPACK elements for multi-dimensional analysis. As a result of this study, AI education targets were divided into three steps: AI users, utilizer, and developers. In K-12 education, the user and utilizer stages are appropriate, and artificial intelligence literacy must be included for user education. Based on the current computing thinking ability and coding ability for utilizer education, the implication was derived that it is necessary to target the ability to create creative output by applying the functions of artificial intelligence. In addition to the pedagogical knowledge and the ability to use the platform, The teacher training is necessary because teachers need content knowledge such as problem-solving, reasoning, learning, perception, and some applied mathematics, cognitive / psychological / ethical of AI.

• Journal of the Chungcheong Mathematical Society
• /
• v.8 no.1
• /
• pp.19-27
• /
• 1995

In 1974 H.Herrlich invented nearness spaces, a very fruitful concept which enables one to unify topological aspects. In this paper, we introduce the Lindel$\ddot{o}$f nearness structure, countably bounded nearness structure and countably totally bounded nearness structure. And we show that (X, ${\xi}_L$) is concrete and complete if and only if ${\xi}_L={\xi}_t$ in a symmetric topological space (X, t). Also we show that the following are equivalent in a symmetric topological space (X, t): (1) (X, ${\xi}_L$) is countably totally bounded. (2) (X, ${\xi}_t$) is countably totally bounded. (3) (X, t) is countably compact.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.283-293
• /
• 2007

This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. A sequence independent setup is required to process a job from a different group and jobs in each group are processed together. We consider the case of jobs whose processing times are a decreasing function of their starting time. The objectives of scheduling problems are to minimize the makespan and the total completion time, respectively. We also provide polynomial time algorithms to solve these problems.

• Kyungpook Mathematical Journal
• /
• v.50 no.2
• /
• pp.195-211
• /
• 2010

Let A be a locally finite total algebra of finite type such that $k^A(a_1,\cdots,a_n)\;{\neq}\;a_i$ ai for every operation $k^A$, elements $a_1,\cdots,a_n$ an and $1\;\leq\;i\;\leq\;n$. We show that the weak subalgebra lattice of A uniquely determines its (strong) subalgebra lattice. More precisely, for any algebra B of the same finite type, if the weak subalgebra lattices of A and B are isomorphic, then their subalgebra lattices are also isomorphic. Moreover, B is also total and locally finite.

• Annual Conference of KIPS
• /
• 2021.11a
• /
• pp.344-347
• /
• 2021

최근 환경문제에 관한 관심이 높아짐에 따라 전기차 시스템에 관한 연구개발도 활발히 진행되고 있다. 이에, 본 논문에서는 충전 가능성 예측을 위한 인공지능 기술과 학습 데이터의 무결성 보장, 데이터 속 개인정보 보호를 위한 블록체인 기술을 활용한 스마트 계약 중심의 효율적인 전기차 충전 시스템을 설계한다. 또한, 시스템 구현을 위한 충전 시스템의 충전 전, 충전 중, 충전 후로 나누어 제안하고, 충전소 선택 과정을 그림으로 보이며 실제 구현에 필요한 내용을 구성요소별로 제시한다.

• Communications of Mathematical Education
• /
• v.38 no.3
• /
• pp.459-486
• /
• 2024

The purpose of this study is to enhance understanding and utilization of the core mathematical principles of artificial intelligence, and to develop teaching and learning materials that apply algorithmic thinking and integrated methodologies. To achieve this, teaching and learning materials were developed to implement the concept of optimization through Python using ChatGPT, focusing on mean squared error and gradient descent, structured into a total of five sessions. These materials were applied to high school students, and observations of their understanding, learning methods, and attitudes showed positive responses. As a result, the effectiveness of the AI mathematics optimization teaching and learning materials developed in this study and their applicability in educational settings were confirmed.