• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.385-392
• /
• 2003

Using a fuzzy filter, a new congruence relation induced by the fuzzy filter is given in lattice implication algebras, and some of their properties are investigated.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.153-163
• /
• 2003

The fuzzification of a positive implicative filter is considered, and some of properties are investigated. The relation among fussy filter, fuzzy n-fold implicative filter, and fuzzy n-fold positive implication filter is discussed.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.491-500
• /
• 2006

In this paper, we define intuitionistic fuzzy subalgebras of B-algebras which is related to several classes of algebras such as BCI/BCK-algebras. We could obtain some important results for the homomorphic image and equivalence relations on IFS(X).

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.563-568
• /
• 2006

We introduce how to construct a non-unimodal level O-sequence which has all different local maxima as many as we desire.

• Journal of applied mathematics & informatics
• /
• v.5 no.1
• /
• pp.91-98
• /
• 1998

In [6] Y. B. Jun et al. fuzzified the concept of BCK-filters in BCK-algebrs and investigated its properties. In this paper we investigate further properties of fuzzy BCK-filters.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.1023-1030
• /
• 2012

Rough sets and rough filter in BE-algebras are established an some related their properties are discussed.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.380-392
• /
• 2000

This paper proposes a qualitative reasoning approach for the spatial configuration of mechanisms that could be applied in the early phase of the conceptual design. The spatial configuration problem addressed in this paper involves the relative direction and position between the input and output motion, and the orientation of the constituent primitive mechanisms of a mechanism. The knowledge of spatial configuration of a primitive mechanism is represented in a matrix form called spatial configuration matrix. This matrix provides a compact and convenient representation scheme for the spatial knowledge, and facilitates the manipulation of the relevant spatial knowledge. Using this spatial knowledge of the constituent primitive mechanisms, the overall configuration of a mechanism is described and identified by a spatial configuration state matrix. This matrix is obtained by using a qualitative reasoning method based on sign algebra and is used to represent the qualitative behavior of the mechanism. The matrix-based representation scheme allows handling the involved spatial knowledge simultaneously and the proposed reasoning method enables the designer to predict the spatial behavior of a mechanism without knowing specific dimension of the components of the mechanism.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.2
• /
• pp.249-259
• /
• 2022

Let 𝓐 be a unital C^*-algebra. Then it follows that $\sum\limits_{i=1}^{n}(a_ia^*_i)^{\frac{1}{2}}{\leq}\sqrt{n}\(\sum\limits_{i=1}^{n}a_ia^*_i\)^{\frac{1}{2}}$, ∀n ∈ ℕ, ∀a₁, …, a_n ∈ 𝓐. By modifications of arguments of Botelho-Andrade, Casazza, Cheng, and Tran given in 2019, for certain n-tuple x = (a₁, …, a_n) ∈ 𝓐ⁿ, we give a method to compute a positive element c_x in the C^*-algebra 𝓐 such that the equality $$\sum\limits_{i=1}^{n}(a_ia^*_i)^{\frac{1}{2}}=c_x\sqrt{n}\(\sum\limits_{i=1}^{n}a_ia^*_i\)^{\frac{1}{2}}$$ holds. We give an application for the integral of Kasparov. We also derive a formula for the exact constant for the continuous ℓ₁ - ℓ₂ inequality.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1525-1532
• /
• 2011

The $m{\times}n$ Boolean matrix A is said to be of Boolean rank r if there exist $m{\times}r$ Boolean matrix B and $r{\times}n$ Boolean matrix C such that A = BC and r is the smallest positive integer that such a factorization exists. We consider the the sets of matrix ordered pairs which satisfy extremal properties with respect to Boolean rank inequalities of matrices over nonbinary Boolean algebra. We characterize linear operators that preserve these sets of matrix ordered pairs as the form of $T(X)=PXP^T$ with some permutation matrix P.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1141-1144
• /
• 2002

The research on computer graphics(CG) has been actively studied and developed. Namely, many surface/solid models have been proposed in the field of computer aided geometric design as well as the one of CG. Since it is difficult to visualize the complex shape exactly, an approximation by generating a set of meshes is usually used. Therefore it is important to guarantee the quality of the approximation in consideration of the computational cost. In this paper, a mesh generation algorithm will be proposed for a surface defined by Lie algebra. The proposed algorithm considers the quality in the meaning of validation of invariants obtained by the mesh, using automatic differentiation.