• Title/Summary/Keyword: generalization

Search Result 2,133, Processing Time 0.036 seconds

SOME PROPERTIES OF GM MODULES AND MR GROUPS

  • Cho, Yong Uk
    • Korean Journal of Mathematics
    • /
    • v.16 no.3
    • /
    • pp.281-290
    • /
    • 2008
  • The purpose of this paper, GM modules are defined as a generalization of AGR rings. Also, from the faithful GM-property, we get a commutativity of rings. Finally, for a nearring R, we will introduce MR groups, and also derive some properties of GM modules and MR groups.

  • PDF

T2, R1, and Semi-R1 Spaces

  • Dorsett, Charles
    • Kyungpook Mathematical Journal
    • /
    • v.19 no.2
    • /
    • pp.159-163
    • /
    • 1979
  • In this paper $T_0$-identification spaces are used to prove that the semi-$R_1$ separation axiom is not a generalization of the $R_1$ separation axiom and to determine conditions, which together with $R_1$, do and do not imply semi-$R_1$.

  • PDF

NEIGHBORHOOD SPACES AND P-STACK CONVERGENCE SPACES

  • Park, Sang-Ho
    • East Asian mathematical journal
    • /
    • v.21 no.1
    • /
    • pp.27-39
    • /
    • 2005
  • We will define p-stack convergence spaces and show that each neighborhood structure is uniquely determined by p-stack convergence structure. Also, we will show that p-stack convergence spaces are a generalization of neighborhood spaces.

  • PDF

PSEUDO-BCI ALGEBRAS

  • Dudek, Wieslaw A.;Jun, Young-Bae
    • East Asian mathematical journal
    • /
    • v.24 no.2
    • /
    • pp.187-190
    • /
    • 2008
  • As a generalization of BCI-algebras, the notion of pseudo-BCI algebras is introduced, and some of their properties are investigated. Characterizations of pseudo-BCI algebras are established. Some conditions for a pseudo-BCI algebra to be a pseudo-BCK algebra are given.

  • PDF

Feature selection using genetic algorithm for constructing time-series modelling

  • Oh, Sang-Keon;Hong, Sun-Gi;Kim, Chang-Hyun;Lee, Ju-Jang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.102.4-102
    • /
    • 2001
  • An evolutionary structure optimization method for the Gaussian radial basis function (RBF) network is presented, for modelling and predicting nonlinear time series. Generalization performance is significantly improved with a much smaller network, compared with that of the usual clustering and least square learning method.

  • PDF

ON COMMON FIXED POINT THEOREMS IN FUZZY METRIC SPACES

  • Cho, Seong-Hoon
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.1_2
    • /
    • pp.523-533
    • /
    • 2006
  • In this paper we have a common fixed point theorem which is a generalization of result of [12] and we characterize the conditions for continuous self mappings S, T of complete fuzzy metric space (X, M, *) have a uniqe common fixed point in X.

A STUDY OF THE BILATERAL FORM OF THE MOCK THETA FUNCTIONS OF ORDER EIGHT

  • Srivastava, Bhaskar
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.18 no.2
    • /
    • pp.117-129
    • /
    • 2005
  • We give a generalization of bilateral mock theta functions of order eight and show that they are $F_q$-functions. We also give an integral representation for these functions. We give a relation between mock theta functions of the first set and bilateral mock theta functions of the second set.

  • PDF

SEMI-HOMOMORPHISMS OF BCK-ALGEBRAS

  • Lee, Kyoung Ja;Jun, Young Bae
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.22 no.2
    • /
    • pp.131-139
    • /
    • 2009
  • As a generalization of a homomorphism of BCK-algebras, the notion of a semi-homomorphism of BCK-algebras is introduced, and its characterization is given. A condition for a semi-homomorphism to be a homomorphism is provided.

  • PDF

Survey of Traveling Salesman Problem

  • Kim, Chang-Eun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.13 no.22
    • /
    • pp.65-69
    • /
    • 1990
  • Two different algorithms for traveling salesman problem(TSP) will be discussed. One is the engineering approach to the TSP. The other one is Branch-and-Bound algorithm to take advantage of the special structure of combinational problems. Also a generalization of TSP will be presented.

  • PDF