• Title/Summary/Keyword: mathematical algorithms

Search Result 588, Processing Time 0.025 seconds

APPLICATION OF A FUZZY EXPERT MODEL FOR POWER SYSTEM PROTECTION

  • Kim, C.J.;B.Don-Russell
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1074-1077
    • /
    • 1993
  • The objective of this paper is to develop a fuzzy logic based decision-making system to detect low current faults using multiple detection algorithms. This fuzzy system utilizes a fuzzy expert model which executes an operation without complicated mathematical models. This fuzzy system decides the performance weights of the detection algorithms. The weights and the turnouts of the detection algorithms discriminate faults from normal events. This system can also be a generic group decision-making tool for other areas of power system protection.

  • PDF

CONSTRUCTIVE WAVELET COEFFICIENTS MEASURING SMOOTHNESS THROUGH BOX SPLINES

  • Kim, Dai-Gyoung
    • Journal of the Korean Mathematical Society
    • /
    • v.33 no.4
    • /
    • pp.955-982
    • /
    • 1996
  • In surface compression applications, one of the main issues is how to efficiently store and calculate the computer representation of certain surfaces. This leads us to consider a nonlinear approximation by box splines with free knots since, for instance, the nonlinear method based on wavelet decomposition gives efficient compression and recovery algorithms for such surfaces (cf. [12]).

  • PDF

AN EXTENDED THEOREM FOR GRADIENTS AND SUBGRADIENTS

  • Rhee, Hyang Joo
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.24 no.2
    • /
    • pp.351-357
    • /
    • 2011
  • In this paper, we introduce certain concepts which we will provide us with a perspective and insight into the problem of calculating best approximations. The material of this paper will be mainly, but not only, used in developing algorithms for the one-sided and two-sided sided approximation problem.

NORMALIZED DUALITY MAPPING AND GENERALIZED BEST APPROXIMATIONS

  • Park, Sung Ho;Rhee, Hyang Joo
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.24 no.4
    • /
    • pp.849-862
    • /
    • 2011
  • In this paper, we introduce certain concepts which provide us with a perspective and insight into the generalization of orthogonality with the normalized duality mapping. The material of this paper will be mainly, but not only, used in developing algorithms for the best approximation problem in a Banach space.

TG-SPSR: A Systematic Targeted Password Attacking Model

  • Zhang, Mengli;Zhang, Qihui;Liu, Wenfen;Hu, Xuexian;Wei, Jianghong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2674-2697
    • /
    • 2019
  • Identity authentication is a crucial line of defense for network security, and passwords are still the mainstream of identity authentication. So far trawling password attacking has been extensively studied, but the research related with personal information is always sporadic. Probabilistic context-free grammar (PCFG) and Markov chain-based models perform greatly well in trawling guessing. In this paper we propose a systematic targeted attacking model based on structure partition and string reorganization by migrating the above two models to targeted attacking, denoted as TG-SPSR. In structure partition phase, besides dividing passwords to basic structure similar to PCFG, we additionally define a trajectory-based keyboard pattern in the basic grammar and introduce index bits to accurately characterize the position of special characters. Moreover, we also construct a BiLSTM recurrent neural network classifier to characterize the behavior of password reuse and modification after defining nine kinds of modification rules. Extensive experimental results indicate that in online attacking, TG-SPSR outperforms traditional trawling attacking algorithms by average about 275%, and respectively outperforms its foremost counterparts, Personal-PCFG, TarGuess-I, by about 70% and 19%; In offline attacking, TG-SPSR outperforms traditional trawling attacking algorithms by average about 90%, outperforms Personal-PCFG and TarGuess-I by 85% and 30%, respectively.

GENERALIZED RELAXED PROXIMAL POINT ALGORITHMS INVOLVING RELATIVE MAXIMAL ACCRETIVE MODELS WITH APPLICATIONS IN BANACH SPACES

  • Verma, Ram U.
    • Communications of the Korean Mathematical Society
    • /
    • v.25 no.2
    • /
    • pp.313-325
    • /
    • 2010
  • General models for the relaxed proximal point algorithm using the notion of relative maximal accretiveness (RMA) are developed, and then the convergence analysis for these models in the context of solving a general class of nonlinear inclusion problems differs significantly than that of Rockafellar (1976), where the local Lipschitz continuity at zero is adopted instead. Moreover, our approach not only generalizes convergence results to real Banach space settings, but also provides a suitable alternative to other problems arising from other related fields.

Theoretical Consideration of the Components of Preservice Mathematics Teacher Training

  • Lee, Joong-Kwoen
    • Research in Mathematical Education
    • /
    • v.4 no.1
    • /
    • pp.23-31
    • /
    • 2000
  • This research elaborated five components for pre-service mathematics teacher training: 1) Mathematical content knowledge, 2) Pedagogical content knowledge, 3) Pedagogical reasoning, 4) System of training, and 5) Mathematics teachers' beliefs. For the effect teaching, mathematics teacher program should be reformed. The key to improvement should be concerntrated on developing knowledge about effective teaching and translating it into algorithms those teachses can learn and incorporate in their planning prior to teaching. A theory of instruction should specify the most effective sequences in which to present the materials to be learned.

  • PDF

Mathematical Algorithms for the Automatic Generation of Production Data of Free-Form Concrete Panels (비정형 콘크리트 패널의 생산데이터 자동생성을 위한 수학적 알고리즘)

  • Kim, Doyeong;Kim, Sunkuk;Son, Seunghyun
    • Journal of the Korea Institute of Building Construction
    • /
    • v.22 no.6
    • /
    • pp.565-575
    • /
    • 2022
  • Thanks to the latest developments in digital architectural technologies, free-form designs that maximize the creativity of architects have rapidly increased. However, there are a lot of difficulties in forming various free-form curved surfaces. In panelizing to produce free forms, the methods of mesh, developable surface, tessellation and subdivision are applied. The process of applying such panelizing methods when producing free-form panels is complex, time-consuming and requires a vast amount of manpower when extracting production data. Therefore, algorithms are needed to quickly and systematically extract production data that are needed for panel production after a free-form building is designed. In this respect, the purpose of this study is to propose mathematical algorithms for the automatic generation of production data of free-form panels in consideration of the building model, performance of production equipment and pattern information. To accomplish this, mathematical algorithms were suggested upon panelizing, and production data for a CNC machine were extracted by mapping as free-form curved surfaces. The study's findings may contribute to improved productivity and reduced cost by realizing the automatic generation of data for production of free-form concrete panels.

A Study of the Representation and Algorithms of Western Mathematics Reflected on the Algebra Domains of Chosun-Sanhak in the 18th Century (18세기 조선산학서의 대수 영역에 나타난 서양수학 표현 및 계산법 연구)

  • Choi, Eunah
    • Journal of the Korean School Mathematics Society
    • /
    • v.23 no.1
    • /
    • pp.25-44
    • /
    • 2020
  • This study investigated the representation and algorithms of western mathematics reflected on the algebra domains of Chosun-Sanhak in the 18th century. I also analyzed the co-occurrences and replacement phenomenon between western algorithms and traditional algorithms. For this purpose, I analyzed nine Chosun mathematics books in the 18th century, including Gusuryak and Gosasibijip. The results of this study are as follows. First, I identified the process of changing to a calculation by writing of western mathematics, from traditional four arithmetical operations using Sandae and the formalized explanation for the proportional concept and proportional expression. Second, I observed the gradual formalization of mathematical representation of the solution for a simultaneous linear equation. Lastly, I identified the change of the solution for square root from traditional Gaebangsul and Jeungseunggaebangbeop to a calculation by the writing of western mathematics.

ON THE LINEARIZATION OF DEFECT-CORRECTION METHOD FOR THE STEADY NAVIER-STOKES EQUATIONS

  • Shang, Yueqiang;Kim, Do Wan;Jo, Tae-Chang
    • Journal of the Korean Mathematical Society
    • /
    • v.50 no.5
    • /
    • pp.1129-1163
    • /
    • 2013
  • Based on finite element discretization, two linearization approaches to the defect-correction method for the steady incompressible Navier-Stokes equations are discussed and investigated. By applying $m$ times of Newton and Picard iterations to solve an artificial viscosity stabilized nonlinear Navier-Stokes problem, respectively, and then correcting the solution by solving a linear problem, two linearized defect-correction algorithms are proposed and analyzed. Error estimates with respect to the mesh size $h$, the kinematic viscosity ${\nu}$, the stability factor ${\alpha}$ and the number of nonlinear iterations $m$ for the discrete solution are derived for the linearized one-step defect-correction algorithms. Efficient stopping criteria for the nonlinear iterations are derived. The influence of the linearizations on the accuracy of the approximate solutions are also investigated. Finally, numerical experiments on a problem with known analytical solution, the lid-driven cavity flow, and the flow over a backward-facing step are performed to verify the theoretical results and demonstrate the effectiveness of the proposed defect-correction algorithms.