• Title/Summary/Keyword: triangular subset

Search Result 8, Processing Time 0.021 seconds

TRIANGULAR SUBSETS AND COASSOCIATED PRIME IDEALS

  • Chung, Sang-Cho
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.9 no.1
    • /
    • pp.17-25
    • /
    • 1996
  • We study the relationship between a property of a triangular subset and coassociated prime ideals of the module of generalized fractions induced by the triangular subset, and investigate coassociated prime ideals of modules of generalized fractions defined by some special triangular subsets.

  • PDF

WEAK IMPLICATIVE FILTERS OF BE-ALGEBRAS

  • RAO, M. SAMBASIVA
    • Journal of applied mathematics & informatics
    • /
    • v.35 no.5_6
    • /
    • pp.513-528
    • /
    • 2017
  • The concept of weak implicative filters is introduced in BE-algebras. Some characterizations of weak implicative filters are derived in terms of filters of a BE-algebra. Fuzzification is applied to the class of weak implicative filters. Some properties of fuzzy weak implicative filters are studied with respect to fuzzy relations and homomorphisms. The notion of triangular normed fuzzy weak implicative filters is introduced in BE-algebras and their properties are studied.

IDEALS IN THE UPPER TRIANGULAR OPERATOR ALGEBRA ALG𝓛

  • Lee, Sang Ki;Kang, Joo Ho
    • Honam Mathematical Journal
    • /
    • v.39 no.1
    • /
    • pp.93-100
    • /
    • 2017
  • Let $\mathcal{H}$ be an infinite dimensional separable Hilbert space with a fixed orthonormal base $\{e_1,e_2,{\cdots}\}$. Let $\mathcal{L}$ be the subspace lattice generated by the subspaces $\{[e_1],[e_1,e_2],[e_1,e_2,e_3],{\cdots}\}$ and let $Alg{\mathcal{L}}$ be the algebra of bounded operators which leave invariant all projections in $\mathcal{L}$. Let p and q be natural numbers($p{\leqslant}q$). Let $\mathcal{B}_{p,q}=\{T{\in}Alg\mathcal{L}{\mid}T_{(p,q)}=0\}$. Let $\mathcal{A}$ be a linear manifold in $Alg{\mathcal{L}}$ such that $\{0\}{\varsubsetneq}{\mathcal{A}}{\subset}{\mathcal{B}}_{p,q}$. If $\mathcal{A}$ is an ideal in $Alg{\mathcal{L}}$, then $T_{(i,j)}=0$, $p{\leqslant}i{\leqslant}q$ and $i{\leqslant}j{\leqslant}q$ for all T in $\mathcal{A}$.

Some Properties of Generalized Fractions

  • Lee, Dong-Soo;Chung, Sang-Cho
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.7 no.1
    • /
    • pp.153-164
    • /
    • 1994
  • Let A be a commutative ring with identity and M an A-module. When $U_n$ is a triangular subset of $A_n$, Sharp and Zakeri defined a module of generalized fractions $U_n^{-n}M$. In [SZ3], they described a relation of the Monomial Conjecture and a module of generalized fractions under the condition of a Noetherian local ring. In this paper, we investigate some properties of non-zero generalized fractions and give a generalization of results of Sharp and Zakeri for an arbitrary ring.

  • PDF

ALL POSSIBLE HIERARCHICAL QUADRATIC REGRESSIONS FOR RESPONSE SURFACES

  • KIM SUNG-SOO;KWON SOON-SUN;PARK SUNG-HYUN
    • Journal of the Korean Statistical Society
    • /
    • v.34 no.3
    • /
    • pp.209-218
    • /
    • 2005
  • In response surfaces analysis, we often proceed by supposing that, over a limited region of factor space, a polynomial of only first or second degree might adequately approximate the true function. To find the best subset model, all possible quadratic regressions for response surfaces can be very valuable to get optimum solutions under some reasonable experimentations. However, there is a very hard computational burden to get all possible quadratic regressions. In practice, it is sufficient to consider only hierarchical models. In this paper, we propose an algorithm to get all possible hierarchical quadratic regressions for fitting response surfaces.

Optimization of FCM-based Radial Basis Function Neural Network Using Particle Swarm Optimization (PSO를 이용한 FCM 기반 RBF 뉴럴 네트워크의 최적화)

  • Choi, Jeoung-Nae;Kim, Hyun-Ki;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.11
    • /
    • pp.2108-2116
    • /
    • 2008
  • The paper concerns Fuzzy C-Means clustering based Radial Basis Function neural networks (FCM-RBFNN) and the optimization of the network is carried out by means of Particle Swarm Optimization(PSO). FCM-RBFNN is the extended architecture of Radial Basis Function Neural Network(RBFNN). In the proposed network, the membership functions of the premise part of fuzzy rules do not assume any explicit functional forms such as Gaussian, ellipsoidal, triangular, etc., so its resulting fitness values directly rely on the computation of the relevant distance between data points by means of FCM. Also, as the consequent part of fuzzy rules extracted by the FCM - RBFNN model, the order of four types of polynomials can be considered such as constant, linear, quadratic and modified quadratic. Weighted Least Square Estimator(WLSE) are used to estimates the coefficients of polynomial. Since the performance of FCM-RBFNN is affected by some parameters of FCM-RBFNN such as a specific subset of input variables, fuzzification coefficient of FCM, the number of rules and the order of polynomials of consequent part of fuzzy rule, we need the structural as well as parametric optimization of the network. In this study, the PSO is exploited to carry out the structural as well as parametric optimization of FCM-RBFNN. Moreover The proposed model is demonstrated with the use of numerical example and gas furnace data set.

Genetic Optimization of Fuzzy C-Means Clustering-Based Fuzzy Neural Networks (FCM 기반 퍼지 뉴럴 네트워크의 진화론적 최적화)

  • Choi, Jeoung-Nae;Kim, Hyun-Ki;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.3
    • /
    • pp.466-472
    • /
    • 2008
  • The paper concerns Fuzzy C-Means clustering based fuzzy neural networks (FCM-FNN) and the optimization of the network is carried out by means of hierarchal fair competition-based parallel genetic algorithm (HFCPGA). FCM-FNN is the extended architecture of Radial Basis Function Neural Network (RBFNN). FCM algorithm is used to determine centers and widths of RBFs. In the proposed network, the membership functions of the premise part of fuzzy rules do not assume any explicit functional forms such as Gaussian, ellipsoidal, triangular, etc., so its resulting fitness values directly rely on the computation of the relevant distance between data points by means of FCM. Also, as the consequent part of fuzzy rules extracted by the FCM-FNN model, the order of four types of polynomials can be considered such as constant, linear, quadratic and modified quadratic. Since the performance of FCM-FNN is affected by some parameters of FCM-FNN such as a specific subset of input variables, fuzzification coefficient of FCM, the number of rules and the order of polynomials of consequent part of fuzzy rule, we need the structural as well as parametric optimization of the network. In this study, the HFCPGA which is a kind of multipopulation-based parallel genetic algorithms(PGA) is exploited to carry out the structural optimization of FCM-FNN. Moreover the HFCPGA is taken into consideration to avoid a premature convergence related to the optimization problems. The proposed model is demonstrated with the use of two representative numerical examples.