• Journal of Educational Research in Mathematics
• /
• v.8 no.2
• /
• pp.485-494
• /
• 1998

This study is on the theory of Piaget's reflective abstraction and the mechanism of the development of knowledge and the history of algebra and its application to understand the difficulties that many students have in learning algebra. Piaget considers the development of knowledge as a linear process. The stages in the construction of different forms of knowledge are sequential and each stage begins with reorganization. The reorganization consists of the projection onto a higher level from the lower level and the reflection which reconstructs and reorganizes within a lager system that is transferred by profection. Piaget shows that the mechanisms mediating transitions from one historical period to the next are analogous to those mediating the transition from one psychogenetic stage to the next and characterizes the mechanism as the intra, inter, trans sequence. The historical development of algebra is characterized by three periods, which are intra inter, transoperational. The analysis of the history of algebra by the mechanism explains why the difficulties that students have in learning algebra occur and shows that the roles of teachers are important to help students to overcome the difficulties.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.965-983
• /
• 2014

Concurrent behaviors of multithreaded programs cannot be described effectively by automata-based models. Thus, concurrent program intrusion attempts cannot be detected. To address this problem, we proposed the process algebra-based detection model for multithreaded programs (PADMP). We generate process expressions by static binary code analysis. We then add concurrency operators to process expressions and propose a model construction algorithm based on process algebra. We also present a definition of process equivalence and behavior detection rules. Experiments demonstrate that the proposed method can accurately detect errors in multithreaded programs and has linear space-time complexity. The proposed method provides effective support for concurrent behavior modeling and detection.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.3
• /
• pp.155-162
• /
• 2012

This study proposes an integrated approach that uses both a fuzzy service FMEA (failure mode and effect analysis) and HOQ (house of quality) matrix algebra in designing and improving a service system. The fuzzy service FMEA methodology applies the customer satisfaction to the fuzzy RPN model. We fuzzify only the service satisfaction that consist in two failure factors, intangible service and tangible service, to more effectively assess the customer satisfactions on service encounters. Proposed fuzzy service satisfactions with triangle membership function are defuzzified by using the Fuzzy Inference System, and these are eventually identified the ranks on the potential fail points. HOQ matrices are constructed from cause-effect relationships. It is possible for these relationship matrix to find a linear approximation solution on the engineering attributes. Thus, in order to demonstrate how the proposed methods work, practical sample of the A/S part in S Electronic Co. provides for the ranking of the engineering attributes which has been successfully implemented.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.1103-1106
• /
• 2000

Recently, the research on computer graphics (CG) has been actively studied and developed. Namely, many surface/solid models have been proposed in the field of computer aided geometric design as well as the one of CG. Since it is difficult to visualize the complex shape exactly, an approximation by generating a set of meshes is usually used. Therefore it is important to guarantee the quality of the approximation in consideration of the computational cost. In this paper, a mesh generation algorithm will be proposed for a surface defined by linear tie algebra The proposed algorithm which considers the quality in the meaning of validation of invariants obtained by the mesh.

• Journal of the Korean Society for Railway
• /
• v.12 no.2
• /
• pp.267-275
• /
• 2009

Max-plus algebra is a nonlinear system comprised of two operations, maximization (max) and addition (Plus), which are corresponding to the addition and the multiplication in conventional algebra, respectively. This methodology is applicable to many discrete event systems containing the state transition with the maximization and addition operation. Timetable with connection is one of such systems. We present the method based on max-plus algebra, which can make up timetable considering transfer and analyse its stability and robustness. In this study, it will be shown how to make up the timetable of the urban train and analyse its stability using Max-Plus algebra.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.1
• /
• pp.15-28
• /
• 2018

Recently Machine Learning algorithms are widely used to process Big Data in various applications and a lot of these applications are executed in run time. Therefore the speed of Machine Learning algorithms is a critical issue in these applications. However the most of modern iteration Machine Learning algorithms use a successive iteration technique well-known in Numerical Linear Algebra. But this technique has a very low convergence, needs a lot of iterations to get solution of considering problems and therefore a lot of time for processing even on modern multi-core computers and clusters. Tchebychev iteration technique is well-known in Numerical Linear Algebra as an attractive candidate to decrease the number of iterations in Machine Learning iteration algorithms and also to decrease the running time of these algorithms those is very important especially in run time applications. In this paper we consider the usage of Tchebychev iterations for acceleration of well-known K-Means and SVM (Support Vector Machine) clustering algorithms in Machine Leaning. Some examples of usage of our approach on modern multi-core computers under Apache Spark framework will be considered and discussed.

• The Journal of the Korea Contents Association
• /
• v.8 no.5
• /
• pp.276-286
• /
• 2008

In this paper, we introduce an adaptive e-Learning system for engineering mathematics which is based on computer algebra system (Mathematica) and on-line authoring environment. The system provides an assessment tool for individual diagnosis using Bayesian inference network. Using this system, an instructor can easily develop mathematical web contents via web interface. Examples of such content development are illustrated in the area of linear algebra, differential equation and discrete mathematics. The diagnostic module traces a student's knowledge level based on statistical inference using the conditional probability and Bayesian updating algorithm via Netica. As part of formative evaluation, we brought this system into real university settings and analyzed students' feedback using survey.

• Industrial Engineering and Management Systems
• /
• v.8 no.3
• /
• pp.155-161
• /
• 2009

We focus on discrete event systems with a structure of parallel processing, synchronization, and no-concurrency. We use max-plus algebra, which is an effective approach for controller design for this type of system, for modeling and formulation. Since a typical feature of this type of system is that the initial schedule is frequently changed due to unpredictable disturbances, we use a simple model and numerical examples to examine the possibility of applying the concepts of the feeding buffer and the project buffer of critical chain project management (CCPM) on max-plus linear discrete event systems in order to control the occurrence of an undesirable state change. The application of a CCPM-based framework on a max-plus linear discrete event system was proven to be effective.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3458-3481
• /
• 2021

Existing methods for blind identification of linear block codes without a candidate set are mainly built on the Gauss elimination process. However, the fault tolerance will fall short when the intercepted bit error rate (BER) is too high. To address this issue, we apply the reverse algebra approach and propose a novel "two-step-screening" algorithm by solving the linear error equations on the binary Galois field, or GF(2). In the first step, a recursive matrix partition is implemented to solve the system linear error equations where the coefficient matrix is constructed by the full codewords which come from the intercepted noisy bitstream. This process is repeated to derive all those possible parity-checks. In the second step, a check matrix constructed by the intercepted codewords is applied to find the correct parity-checks out of all possible parity-checks solutions. This novel "two-step-screening" algorithm can be used in different codes like Hamming codes, BCH codes, LDPC codes, and quasi-cyclic LDPC codes. The simulation results have shown that it can highly improve the fault tolerance ability compared to the existing Gauss elimination process-based algorithms.

• Journal of the Korean Mathematical Society
• /
• v.45 no.5
• /
• pp.1203-1220
• /
• 2008

Let V be an arbitrary system of weights on an open connected subset G of ${\mathbb{C}}^N(N{\geq}1)$ and let B (E) be the Banach algebra of all bounded linear operators on a Banach space E. Let $HV_b$ (G, E) and $HV_0$ (G, E) be the weighted locally convex spaces of vector-valued analytic functions. In this paper, we characterize self-analytic mappings ${\phi}:G{\rightarrow}G$ and operator-valued analytic mappings ${\Psi}:G{\rightarrow}B(E)$ which generate weighted composition operators and invertible weighted composition operators on the spaces $HV_b$ (G, E) and $HV_0$ (G, E) for different systems of weights V on G. Also, we obtained compact weighted composition operators on these spaces for some nice classes of weights.