• Bulletin of the Korean Mathematical Society
• /
• v.40 no.3
• /
• pp.365-371
• /
• 2003

In this paper, some limit functions of the iteration of the skew product in the stable sets are investigated, which is associated with finitely generated semigroup for the class M, under some additional conditions.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.149-152
• /
• 2011

A Multi-Vision needs an image adjust of each product to make the same picture quality for all products when it's installed. Owing to this reason need individual control. This document request indivisual control method for each product with the Remote controller. To realize this method need make Set ID and Picture ID on the UI and need daisy chain of cable to connect Remocon code(IR Signal) In to Out, After allocation the Set ID for each product. Picture ID of the product which want to change picture quality make equal to Set ID. And the product which is same Set ID and Picture ID is only controlled through decoding of Remocon code to Scaler.

• The Pure and Applied Mathematics
• /
• v.5 no.1
• /
• pp.45-54
• /
• 1998

We study the space-times that have a unique terminal indecomposable past set or a unique terminal indecomposable future set and examine their causal boundary, and we investigate some conditions for the warped product space-times of the form (a, b) ${\times}_fF$ to have a unique terminal indecomposable past set or a unique terminal indecomposable future set.

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.4
• /
• pp.853-867
• /
• 2013

In this paper we study the cardinality of the dot product set generated by two subsets of vector spaces over finite fields. We notice that the results on the dot product problems for one set can be simply extended to two sets. Let E and F be subsets of the d-dimensional vector space $\mathbb{F}^d_q$ over a finite field $\mathbb{F}_q$ with q elements. As a new result, we prove that if E and F are subsets of the paraboloid and ${\mid}E{\parallel}F{\mid}{\geq}Cq^d$ for some large C > 1, then ${\mid}{\Pi}(E,F){\mid}{\geq}cq$ for some 0 < c < 1. In particular, we find a connection between the size of the dot product set and the number of lines through both the origin and a nonzero point in the given set E. As an application of this observation, we obtain more sharpened results on the generalized dot product set problems. The discrete Fourier analysis and geometrical observation play a crucial role in proving our results.

• The Pure and Applied Mathematics
• /
• v.11 no.2
• /
• pp.149-154
• /
• 2004

We show that the Choquet boundary of the tensor product of two real function algebras is the product of their Choquet boundaries.

• The Pure and Applied Mathematics
• /
• v.29 no.4
• /
• pp.255-275
• /
• 2022

In this paper, we introduce a new system of set-valued variational inclusion problems in semi-inner product spaces. We use resolvent operator technique to propose an iterative algorithm for computing the approximate solution of the system of set-valued variational inclusion problems. The results presented in this paper generalize, improve and unify many previously known results in the literature.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.2
• /
• pp.9-16
• /
• 2018

Recently, as various IP set-top boxes based on Android OS have been widely used in general households and public facilities, complaints about services and set-top boxes have continued to increase as much as other smart devices. In order to reduce this problem, the manufacturer performs the testing work before the product is commercialized. However, the testing can reduce potential defects in the product, but it can not prove that the product is free of defects. Therefore, the quality of the product can vary depending on how effective testing techniques are introduced. In this paper, we propose a new exploratory testing method that minimizes test case creation time and makes it easier to plan and execute test while simultaneously learning how to run the product under test. Using the first proposed method, the test time is reduced by about 16.7 hours and the defect detection rate is 25.4% higher than the formal specification-based testing method. Informally, the test time was shortened by about 4.7 hours and the defect detection rate was 13% higher than the informal experience-based testing method.

• Annals of Fuzzy Mathematics and Informatics
• /
• v.16 no.3
• /
• pp.261-284
• /
• 2018

In this paper, we recall the definition of soft set, fuzzy soft set, hesitant fuzzy set and hesitant fuzzy soft set and some of their examples. We define the concept of hesitant fuzzy soft multiset which combines hesitant fuzzy soft set and soft multiset theory. We also define basic terms in hesitant fuzzy soft multiset with relevant examples. Some basic operations such as restricted intersection, extended intersection, union, restricted union, AND-product and OR-product and their properties are given, supported with illustrative examples. We finally establish some important results, including De Morgan's inclusions and laws.

• Kyungpook Mathematical Journal
• /
• v.58 no.4
• /
• pp.589-597
• /
• 2018

For $A,B{\in}M_2(\mathbb{C})$, let the Jordan product be AB + BA and G(A) the eigenvalue inclusion set, the Gershgorin set of A. Characterization is obtained for maps ${\phi}:M_2(\mathbb{C}){\rightarrow}M_2(\mathbb{C})$ satisfying $$G[{\phi}(A){\phi}(B)+{\phi}(B){\phi}(A)]=G(AB+BA)$$ for all matrices A and B. In fact, it is shown that such a map has the form ${\phi}(A)={\pm}(PD)A(PD)^{-1}$, where P is a permutation matrix and D is a unitary diagonal matrix in $M_2(\mathbb{C})$.

• Kyungpook Mathematical Journal
• /
• v.63 no.1
• /
• pp.123-129
• /
• 2023

For an ordered set W = {w₁, w₂, . . . , w_k} of vertices and a vertex v in a connected graph G, the k-vector r(v|W) = (d(v, w₁), d(v, w₂), . . . , d(v, w_k)) is called the metric representation of v with respect to W, where d(x, y) is the distance between the vertices x and y. A set W is called a resolving set for G if distinct vertices of G have distinct metric representations with respect to W. The minimum cardinality of a resolving set for G is its metric dimension dim(G), and a resolving set of minimum cardinality is a basis of G. The corona product, G ⊙ H of graphs G and H is obtained by taking one copy of G and n(G) copies of H, and by joining each vertex of the ith copy of H to the ith vertex of G. In this paper, we obtain bounds for dim(G ⊙ K₁), characterize all graphs G with dim(G ⊙ K₁) = dim(G), and prove that dim(G ⊙ K₁) = n - 1 if and only if G is the complete graph K_n or the star graph K_1,n-1.