• Journal of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.217-225
• /
• 1996

An orthomodular lattice (abbreviated by OML) is an ortholattice L which satisfies the orthomodular law: if x $\leq$ y, then $y = x \vee (x' \wedge y)$ [5]. A Boolean algebra B is an ortholattice satisfying the distributive law : $x \vee (g \wedge z) = (x \vee y) \wedge (x \vee z) \forall x, y, z \in B$.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.6
• /
• pp.862-867
• /
• 1995

In this paper a method to perform Exclusive-OR operation between two tabular type Boolean expressions is presented. The proposed method allows to solve the switching equations and the simultaneous equations in a rather direct manner, compared with Unger's method.

• Journal of the Korean Institute of Gas
• /
• v.3 no.3 s.8
• /
• pp.29-33
• /
• 1999

ln this study, a computerized prototype program was developed with frequency analysis system as a main system and data base as sub-items to utilize data. Through use of gate-by-gate analysis and minimal cut set using boolean algebra, the frequency analysis program peformed the qualitative approach for the accident development path and a quantitative risk analysis. In conclusion, it is thought that the resulting installation will be effective for lessening the probability of accidents through use of this lower cost software.

• Research in Mathematical Education
• /
• v.11 no.2
• /
• pp.143-151
• /
• 2007

Nowadays there are practically no mathematical courses in which Computer Algebra Systems (CAS) programs, such as MATHEMATlCA, Maple, and TI-89/92, are not used to some extent. However, generally the usage of these programs is reduced to illustration of computing processes: calculation of integrals, differentiation, solution of various equations, etc. This is obtained by usage of standard command of type: Solve [...] in MATHEMATICA. At the same time the main difficulties arise at teaching nonconventional mathematical courses such as coding theory, discrete mathematics, cryptography, Scientific computing, which are gaining the increasing popularity now. Now it is impossible to imagine a modern engineer not having basic knowledge in discrete mathematics, Cryptography, coding theory. Digital processing of signals (digital sound, digital TV) has been introduced in our lives.

• Journal of the Korean Mathematical Society
• /
• v.42 no.6
• /
• pp.1111-1120
• /
• 2005

Hong and Nel in [8] obtained a number of spectral dualities between a cartesian closed topological category X and a category of algebras of suitable type in X in accordance with the original formalism of Porst and Wischnewsky[12]. In this paper, there arises a dual adjointness S $\vdash$ C between the category X = Lim of limit spaces and that A of MV-algebras in X. We firstly show that the spectral duality: $S(A)^{op}{\simeq}C(X^{op})$ holds for the dualizing object K = I = [0,1] or K = 2 = {0, 1}. Secondly, we study a duality between the category of Tychonoff spaces and the category of semi-simple MV-algebras. Furthermore, it is shown that for any $X\;\in\;Lim\;(X\;{\neq}\;{\emptyset})\;C(X,\;I)$ is densely embedded into a cube $I^/H/$, where H is a set.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.5
• /
• pp.845-856
• /
• 2009

A block of an orthomodular lattice L is a maximal Boolean subalgebra of L. A site is a subalgebra of an orthomodular lattice L of the form S = A $\cap$ B, where A and B are distinct blocks of L. An orthomodular lattice L is called with finite sites if |A $\cap$ B| < $\infty$ for all distinct blocks A, B of L. We prove that there exists a weakly path-connected orthomodular lattice with finite sites which is not path-connected and if L is an orthomodular lattice such that the height of the join-semilattice [ComL]$\vee$ generated by the commutators of L is finite, then L is pathconnected.

• The Pure and Applied Mathematics
• /
• v.7 no.1
• /
• pp.61-69
• /
• 2000

Let($X^{\ast},\tau^{\ast}$) be the space with one point Lindeloffication topology of space (X,$\tau$). This paper offers the definition of the space with one point Lin-deloffication topology of a topological space and proves that the retraction regu-lar closed function f: $K^{\ast}(X^{\ast}$) defined f($A^{\ast})=A^{\ast}$ if p $\in A^{\ast}$ or ($f(A^{\ast})=A^{\ast}-{p}$ if $p \in A^{\ast}$ is a homomorphism. There are two examples in this paper to show that the retraction regular closed function f is neither a surjection nor an injection.

• Journal of the Optical Society of Korea
• /
• v.9 no.3
• /
• pp.111-118
• /
• 2005

In this paper, a new optical parallel binary arithmetic processor (OPBAP) capable of computing arbitrary n-bit look-ahead carry full-addition is proposed and implemented. The conventional Boolean algebra is considered to implement OPBAP by using two schemes of optical logic processor. One is space-variant optical logic gate processor (SVOLGP), the other is shadow-casting optical logic array processor (SCOLAP). SVOLGP can process logical AND and OR operations different in space simultaneously by using free-space interconnection logic filters, while SCOLAP can perform any possible 16 Boolean logic function by using spatial instruction-control filter. A dual-rail encoding method is adopted because the complement of an input is needed in arithmetic process. Experiment on OPBAP for an 8-bit look-ahead carry full addition is performed. The experimental results have shown that the proposed OPBAP has a capability of optical look-ahead carry full-addition with high computing speed regardless of the data length.

• Journal of Applied and Pure Mathematics
• /
• v.5 no.1_2
• /
• pp.1-8
• /
• 2023

This study is on a Boolean B or Boolean lattice L in abstract algebra with closed binary operation *, complement and distributive properties. Both Binary operations and logic properties dominate this set. A lattice sheds light on binary operations and other algebraic structures. In particular, the construction of the elements of this L set from idempotent elements, our definition of k-order idempotent has led to the expanded definition of the definition of the lattice theory. In addition, a lattice offers clever solutions to vital problems in life with the concept of logic. The restriction on a lattice is clearly also limit such applications. The flexibility of logical theories adds even more vitality to practices. This is the main theme of the study. Therefore, the properties of the set elements resulting from the binary operation force the logic theory. According to the new definition given, some properties, lemmas and theorems of the lattice theory are examined. Examples of different situations are given.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.722-725
• /
• 2008

복합질환(complex disease)의 원인과 작용 모델을 찾기 위해 여러 가지 통계적인 방법들과 기계 학습(machine learning)의 방법 등이 사용되고 있다. 소수 SNP의 작용모델을 찾는 방법은 많이 알려져 있지만 다수 SNP의 작용 모델을 효과적으로 찾는 방법은 거의 연구되어 있지 않다. 본 연구에서는 원인 SNP들의 작용을 부울 식(boolean expression)으로 나타내고, 유전 알고리즘(genetic algorithm)을 이용하여 예측 정확도가 높은 부울 식을 구성하였으며 실제 자료와 생성된 자료에 대하여 제안한 모델의 성능을 측정하였다.