• Honam Mathematical Journal
• /
• v.46 no.1
• /
• pp.82-100
• /
• 2024

The main objective of the study is to introduce ideals of Sheffer stroke Hilbert algebras by means of fuzzy points, and investigate some properties. The process of making (fuzzy) ideals and fuzzy deductive systems through the fuzzy points of Sheffer stroke Hilbert algebras is illustrated, and the (fuzzy) ideals and the fuzzy deductive systems are characterized. Certain sets are defined by virtue of a fuzzy set, and the conditions under which these sets can be ideals are revealed. The union and intersection of two fuzzy ideals are analyzed, and the relationships between aforementioned structures of Sheffer stroke Hilbert algebras are built.

• Communications of the Korean Mathematical Society
• /
• v.9 no.4
• /
• pp.881-889
• /
• 1994

Let ($X, \Beta, \mu$) be a measure space with the $\sigma$-algebra $\Beta$ and the probability measure $\mu$. Throughouth this article set equalities and inclusions are understood as being so modulo measure zero sets. A transformation T defined on a probability space X is said to be measure preserving if $\mu(T^{-1}E) = \mu(E)$ for $E \in B$. It is said to be ergodic if $\mu(E) = 0$ or i whenever $T^{-1}E = E$ for $E \in B$. Consider the sequence ${x, Tx, T^2x,...}$ for $x \in X$. One may ask the following questions: What is the relative frequency of the points $T^nx$ which visit the set E\ulcorner Birkhoff Ergodic Theorem states that for an ergodic transformation T the time average $lim_{n \to \infty}(1/N)\sum^{N-1}_{n=0}{f(T^nx)}$ equals for almost every x the space average $(1/\mu(X)) \int_X f(x)d\mu(x)$. In the special case when f is the characteristic function $\chi E$ of a set E and T is ergodic we have the following formula for the frequency of visits of T-iterates to E : $$ lim_{N \to \infty} \frac{$\mid${n : T^n x \in E, 0 \leq n $\mid$}{N} = \mu(E) $$ for almost all $x \in X$ where $$\mid$\cdot$\mid$$ denotes cardinality of a set. For the details, see [8], [10].

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.4
• /
• pp.1145-1153
• /
• 2014

Let G be a finite group and X be a union of conjugacy classes of G. Define C(G,X) to be the graph with vertex set X and $x,y{\in}X$ ($x{\neq}y$) joined by an edge whenever they commute. In the case that X = G, this graph is named commuting graph of G, denoted by ${\Delta}(G)$. The aim of this paper is to study the automorphism group of the commuting graph. It is proved that Aut(${\Delta}(G)$) is abelian if and only if ${\mid}G{\mid}{\leq}2$; ${\mid}Aut({\Delta}(G)){\mid}$ is of prime power if and only if ${\mid}G{\mid}{\leq}2$, and ${\mid}Aut({\Delta}(G)){\mid}$ is square-free if and only if ${\mid}G{\mid}{\leq}3$. Some new graphs that are useful in studying the automorphism group of ${\Delta}(G)$ are presented and their main properties are investigated.

• Kyungpook Mathematical Journal
• /
• v.47 no.3
• /
• pp.403-410
• /
• 2007

Using the belongs to relation (${\in}$) and quasi-coincidence with relation (q) between fuzzy points and fuzzy sets, the concept of (${\alpha}$, ${\beta}$)-fuzzy subalgebras where ${\alpha}$ and ${\beta}$ areany two of {${\in}$, q, ${\in}{\vee}q$, ${\in}{\wedge}q$} with ${\alpha}{\neq}{\in}{\wedge}q$ was already introduced, and related properties were investigated (see [3]). In this paper, we give a condition for an (${\in}$, ${\in}{\vee}q$)-fuzzy subalgebra to be an (${\in}$, ${\in}$)-fuzzy subalgebra. We provide characterizations of an (${\in}$, ${\in}{\vee}q$)-fuzzy subalgebra. We show that a proper (${\in}$, ${\in}$)-fuzzy subalgebra $\mathfrak{A}$ of X with additional conditions can be expressed as the union of two proper non-equivalent (${\in}$, ${\in}$)-fuzzy subalgebras of X. We also prove that if $\mathfrak{A}$ is a proper (${\in}$, ${\in}{\vee}q$)-fuzzy subalgebra of a CK/BCI-algebra X such that #($\mathfrak{A}(x){\mid}\mathfrak{A}(x)$ < 0.5} ${\geq}2$, then there exist two prope non-equivalent (${\in}$, ${\in}{\vee}q$)-fuzzy subalgebras of X such that $\mathfrak{A}$ can be expressed as the union of them.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.6
• /
• pp.432-443
• /
• 2005

Recent three-dimensional feature-based CAD systems based on solid or non-manifold modelling functionality have been widely used for product design in manufacturing companies. When product models associated with features are used in various downstream applications such as analysis, however, simplified and abstracted models at various levels of detail (LODs) are frequently more desirable and useful than the full detailed model. To provide multi-resolution models, the features need to be rearranged according to a criterion that measures the significance of the feature. However, if the features are rearranged, the resulting shape is possibly different from the original because union and subtraction Boolean operations are not commutative. To solve this problem, in this paper, the new concept of the effective zone of a feature is defined and identified using Boolean algebra. By introducing the effective zone, an arbitrary rearrangement of features becomes possible and arbitrary LOD criteria may be selected to suit various applications. Besides, because the effective zone of a feature is independent of the data structure of the model, the multi-resolution modelling algorithm based on the effective zone can be implemented on any 3D CAD system based on conventional solid representations as well as non-manifold topological (NMT) representations.

• Journal of the Korean Mathematical Society
• /
• v.60 no.2
• /
• pp.327-339
• /
• 2023

Let R be a commutative ring with identity and S be a multiplicatively closed subset of R. In this article we introduce a new class of ring, called S-multiplication rings which are S-versions of multiplication rings. An R-module M is said to be S-multiplication if for each submodule N of M, sN ⊆ JM ⊆ N for some s ∈ S and ideal J of R (see for instance [4, Definition 1]). An ideal I of R is called S-multiplication if I is an S-multiplication R-module. A commutative ring R is called an S-multiplication ring if each ideal of R is S-multiplication. We characterize some special rings such as multiplication rings, almost multiplication rings, arithmetical ring, and S-P IR. Moreover, we generalize some properties of multiplication rings to S-multiplication rings and we study the transfer of this notion to various context of commutative ring extensions such as trivial ring extensions and amalgamated algebras along an ideal.

• Kyungpook Mathematical Journal
• /
• v.63 no.2
• /
• pp.235-250
• /
• 2023

Let 1 ≤ p, q < ∞ be fixed, and let R = [r_jk] be an infinite scalar matrix such that 1 ≤ r_jk < ∞ and sup_j,k r_jk < ∞. Let 𝓑(𝑙_p, 𝑙_q) be the set of all bounded linear operator from 𝑙_p into 𝑙_q. For a fixed Banach algebra 𝐁 with identity, we define a new vector space S^R_p,q(𝐁) of infinite matrices over 𝐁 and a paranorm G on S^R_p,q(𝐁) as follows: let $$S^R_{p,q}({\mathbf{B}})=\{A:A^{[R]}{\in}{\mathcal{B}}(l_p,l_q)\}$$ and $G(A)={\parallel}A^{[R]}{\parallel}^{\frac{1}{M}}_{p,q}$, where $A^{[R]}=[{\parallel}a_{jk}{\parallel}^{r_{jk}}]$ and M = max{1, sup_j,k r_jk}. The existance of S^R_p,q(𝐁) equipped with the paranorm G(·) including its completeness are studied. We also provide characterizations of β -dual of the paranormed space.

• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.339-352
• /
• 2009

There are a number of formal methods for distributed real-time systems in ubiquitous computing to analyze and verify the behavioral, temporal and the spatial properties of the systems. However most of the methods reveal structural and fundamental limitations of complexity due to mixture of spatial and behavioral representations. Further temporal specification makes the complexity more complicate. In order to overcome the limitations, this paper presents a new formal method, called Timed Calculus of Abstract Real-Time Distribution, Mobility and Interaction(t-CARDMI). t-CARDMI separates spatial representation from behavioral representation to simplify the complexity. Further temporal specification is permitted only in the behavioral representation to make the complexity less complicate. The distinctive features of the temporal properties in t-CARDMI include waiting time, execution time, deadline, timeout action, periodic action, etc. both in movement and interaction behaviors. For analysis and verification of spatial and temporal properties of the systems in specification, t-CARDMI presents Timed Action Graph (TAG), where the spatial and temporal properties are visually represented in a two-dimensional diagram with the pictorial distribution of movements and interactions. t-CARDMI can be considered to be one of the most innovative formal methods in distributed real-time systems in ubiquitous computing to specify, analyze and verify the spatial, behavioral and the temporal properties of the systems very efficiently and effectively. The paper presents the formal syntax and semantics of t-CARDMI with a tool, called SAVE, for a ubiquitous healthcare application.

• School Mathematics
• /
• v.18 no.3
• /
• pp.589-609
• /
• 2016

In this study, researchers have modernly reinterpreted geometric solving of cubic equations presented by an arabic mathematician, Omar Khayyam in medieval age, and have considered the pedagogical significance of geometric solving of the cubic equations using two conic sections in terms of analytic geometry. These efforts allow to analyze educational application of mathematics instruction and provide useful pedagogical implications in school mathematics such as 'connecting algebra-geometry', 'induction-generalization' and 'connecting analogous problems via analogy' for the geometric approaches of cubic equations: $x^3+4x=32$, $x^3+ax=b$, $x^3=4x+32$ and $x^3=ax+b$. It could be possible to reciprocally convert between algebraic representations of cubic equations and geometric representations of conic sections, while geometrically approaching the cubic equations from a perspective of connecting algebra and geometry. Also, it could be treated how to generalize solution of cubic equation containing variables from geometric solution in which coefficients and constant terms are given under a perspective of induction-generalization. Finally, it could enable to provide students with some opportunities to adapt similar solving procedures or methods into the newly-given cubic equation with a perspective of connecting analogous problems via analogy.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.443-452
• /
• 1995

Object-oriented database systems have been proposed as an effective solution for providing the data management facilities of complex applications. Proving this claim and the investigation of related issues such as query processing have been hampered by the absence of a formal object-oriented query model. In this paper, we not only define a query model based on aggregation inheritance but also develop semantic rewriting rules which are applied to equivalence preserving rewrite rules in algebraic expression of a query. Analyzing semantically the query model, the query model can be optimized to logically object-oriented query processing. And algebra expresstions of a query can be optimized by applying equivalence preserving rewrite rules.