• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.326-333
• /
• 2005

Many XML applications use XPath Patterns as a query language for XML documents. Two XPath patterns may have containment relationship, and the containment problem between two XPath patterns is a problem that determines whether one XPath pattern contains another XPath Pattern. Although the containment problem occurs in many applications, it is known as a co-NP complete. A homomorphism problem, which is a sufficient condition for the containment problem, is solved in polynomial time. We first discuss applications that replace the containment problem with the homomorphism problem, and maintaining homomorphism information among XPath patterns will benefit those applications. Then, we propose a lattice structure, called POX (Partially Ordered Set of XPath Patterns), and develop algorithms for maintaining it. As our analyses show, the algorithms can efficiently maintain POX in polynomial time.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.1
• /
• pp.59-64
• /
• 2011

In 2001, the notion of a fuzzy poset defined on a set X via a triplet (L, G, I) of functions with domain X ${\times}$ X and range [0, 1] satisfying a special condition L+G+I = 1 is introduced by J. Negger and Hee Sik Kim, where L is the 'less than' function, G is the 'greater than' function, and I is the 'incomparable to' function. Using this approach, we are able to define a special class of fuzzy posets, and define the 'skeleton' of a fuzzy poset in view of major relation. In this sense, we define the linear discrepancy of a fuzzy poset of size n as the minimum value of all maximum of I(x, y)${\mid}$f(x)-f(y)${\mid}$ for f ${\in}$ F and x, y ${\in}$ X with I(x, y) > $\frac{1}{2}$, where F is the set of all injective order-preserving maps from the fuzzy poset to the set of positive integers. We first show that the definition is well-defined. Then, it is shown that the optimality appears at the same injective order-preserving maps in both cases of a fuzzy poset and its skeleton if the linear discrepancy of a skeleton of a fuzzy poset is 1.

• East Asian mathematical journal
• /
• v.5 no.2
• /
• pp.191-198
• /
• 1989

It is shown that a near-ring N which has no nonzero nilpotent elements is a partially ordered set where $x{\leq}y$ if and only if $yx=x^2$. Also it is shown that $(N,{\leq})$ is infinitely distributive for central elements that is $r(supx_i)=sup(rx_i)$ for every central element r of N and any subset $\{x_i\}$ of N. By using some lemmas we showed that a near-ring without nilpotent elements is isomorphic to a direct product of near-fields if and only if N is hyperatomic and orthogonally complete under the condition that every idempotent of N is central.

• Honam Mathematical Journal
• /
• v.28 no.2
• /
• pp.185-196
• /
• 2006

A scheme based on the cryptography for enforcing multilevel security in a system where hierarchy is represented by a partially ordered set was first introduced by Akl et al. But the key generation algorithm of Akl et al. is infeasible when there is a large number of users. In 1985, MacKinnon et al. proposed a paper containing a condition which prevents cooperative attacks and optimizes the assignment in order to overcome this shortage. In 2005, Kim et al. proposed key management systems for multilevel security using one-way hash function, RSA algorithm, Poset dimension and Clifford semigroup in the context of modern cryptography. In particular, the key management system using Clifford semigroup of imaginary quadratic non-maximal orders is based on the fact that the computation of a key ideal $K_0$ from an ideal $EK_0$ seems to be difficult unless E is equivalent to O. We, in this paper, show that computing preimages under the bonding homomorphism is not difficult, and that the multilevel cryptosystem based on the Clifford semigroup is insecure and improper to the key management system.

• The Journal of Information Technology and Database
• /
• v.3 no.1
• /
• pp.97-108
• /
• 1996

In this paper we obtain several function defined on finite partially ordered sets(posets) which may indicate constraints of comparability on sets of teams(tasks, etc.) for which evaluation is computationally simple, a relatively rare condition in graph-based algorithms. Using these functions a set of numerical coefficients and associated distributions obtained from a computer simulation of certain families of random graphs is determined. From this information estimates may be made as to the actual linearity of complicated posets. Applications of these ideas is to all areas where obtaining rankings from partial information in rational ways is relevant as in, e.g., team_, scaling_, and scheduling theory as well as in theoretical computer science. Theoretical consideration of special and desirable properties of various functions is provided permitting judgment concerning sensitivity of these functions to changes in parameters describing (finite) posets.

• The Pure and Applied Mathematics
• /
• v.21 no.2
• /
• pp.113-120
• /
• 2014

In this paper, we first show that for any space X, there is a ${\sigma}$-complete Boolean subalgebra of $\mathcal{R}$(X) and that the subspace {${\alpha}{\mid}{\alpha}$ is a fixed ${\sigma}Z(X)^{\sharp}$-ultrafilter} of the Stone-space $S(Z({\Lambda}_X)^{\sharp})$ is the minimal basically disconnected cover of X. Using this, we will show that for any countably locally weakly Lindel$\ddot{o}$f space X, the set {$M{\mid}M$ is a ${\sigma}$-complete Boolean subalgebra of $\mathcal{R}$(X) containing $Z(X)^{\sharp}$ and $s_M^{-1}(X)$ is basically disconnected}, when partially ordered by inclusion, becomes a complete lattice.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.4
• /
• pp.605-610
• /
• 2013

A cryptography for enforcing hierarchic groups in a system where hierarchy is represented by a partially ordered set was introduced by Akl et al. But the key generation algorithm of Akl et al. is infeasible when there is a large number of users. To overcome this shortage, in 1985, MacKinnon et al. proposed a paper containing a condition which prevents cooperative attacks and optimizes the assignment. In 2005, Kim et al. proposed the key management systems for using one-way hash function, RSA algorithm, poset dimension and Clifford semigroup in the context of modern cryptography, the key management system using Clifford semigroup of imaginary quadratic non-maximal orders. We, in this paper, show that Kim et al. cryptosystem is insecure in some reasons and propose a revised cryptosystem.

• Honam Mathematical Journal
• /
• v.36 no.2
• /
• pp.253-261
• /
• 2014

In this paper, we first will show that for any space X and any Wallman sublattice $\mathcal{A}$ of $\mathcal{R}(X)$ with $Z(X)^{\sharp}{\subseteq}\mathcal{A}$, (${\Phi}^{-1}_{\mathcal{A}}(X)$, ${\Phi}_{\mathcal{A}}$) is the minimal quasi-F cover of X if and only if (${\Phi}^{-1}_{\mathcal{A}}(X)$, ${\Phi}_{\mathcal{A}}$) is a quasi-F cover of X and $\mathcal{A}{\subseteq}\mathcal{Q}_X$. Using this, if X is a locally weakly Lindel$\ddot{o}$f space, the set {$\mathcal{A}|\mathcal{A}$ is a Wallman sublattice of $\mathcal{R}(X)$ with $Z(X)^{\sharp}{\subseteq}\mathcal{A}$ and ${\Phi}^{-1}_{\mathcal{A}}(X)$ is the minimal quasi-F cover of X}, when partially ordered by inclusion, has the minimal element $Z(X)^{\sharp}$ and the maximal element $\mathcal{Q}_X$. Finally, we will show that any Wallman sublattice $\mathcal{A}$ of $\mathcal{R}(X)$ with $Z(X)^{\sharp}{\subseteq}\mathcal{A}{\subseteq}\mathcal{Q}_X$, ${\Phi}_{\mathcal{A}_X}:{\Phi}^{-1}_{\mathcal{A}}(X){\rightarrow}X$ is $z^{\sharp}$-irreducible if and only if $\mathcal{A}=\mathcal{Q}_X$.

• Journal of KIISE:Software and Applications
• /
• v.32 no.8
• /
• pp.730-741
• /
• 2005

Layered Architecture is a kind of nodule decomposition techniques, which decomposes a program by generality This paper proposes a ]aver based method for recovering layered architecture from object-oriented program and checking conformance against architectural document. To specify the rules for layered style in object-oriented program, we define a partially ordered set on modules by module use relationship and module layer relationship by module override relationship. The meaning of module layer relationship is explained with an example from design patterns. Steps to recover layered architecture from program are described and a metamodel for the recovery is proposed. Architecture recovery is performed on source codes from open-source software project, and the implication of parts that do not conform to its architectural document is discussed. As a result of checking, it is pointed out that, although the parts are considered allowable exceptions of layered architecture, their modifications should be controlled carefully.

• The Korean Journal of Franchise Management
• /
• v.12 no.4
• /
• pp.41-54
• /
• 2021

Purpose: Delivery food orders are on the rise due to the COVID 19 pandemic. Many customers are ordering food through delivery apps rather than visiting restaurants to eat out. Delivery application platforms are growing due to the development of O2O. Most of the people who provide gig worker for delivery applications are rider. Rider provides labor on their own terms and have more work flexibility and autonomy than ordinary workers. Trust can be transferred from a well-known entity to an unknown entity. From the customer's point of view of using the delivery application, trust can be seen through the third-party trust of the delivery application platform-rider-customer. Therefore, this study intends to investigate the effect on delivery application trust and rider trust through the well-known characteristics of delivery applications. Research design, data, and methodology: This study was conducted on Korean consumers over 20 years of age who have ordered food through a delivery application for the past month. After educating 5 investigators about the purpose of this study, 60 copies of the survey were conducted per person. During the investigation period, from September 2 to September 26, 2021, 322 copies were collected over 25 days. Among the collected questionnaires, 37 were excluded from insincere or partially unanswered, and 285 were used for analysis. In addition, the collected data were analyzed using SPSS 25.0 and AMOS 25.0. Result: As a result of the study, convenience, price, and variety of restaurants were found to have a significant positive (+) effect on app trust, but design did not have a significant effect on app trust. Also, it was found that convenience had a significant positive (+) effect on trust in rider, but design, price, and variety of restaurants did not have a significant effect. App trust was found to have a significant positive (+) effect on rider trust and intention to use, and it was found to have a significant positive (+) effect on rider trust and intention to use. Conclusions: First, this study established a structural framework between delivery application characteristics-delivery-app trust-rider trust-intention to use. Second, in this study, it was found that customer trust in well-known delivery applications was transferred to less-known rider trust. Third, the delivery application should increase the convenience of use. Fourth, delivery application should set the delivery fee appropriately. Fifth, delivery application must continuously train the rider.