• Journal of the Korean Mathematical Society
• /
• v.51 no.4
• /
• pp.837-851
• /
• 2014

We consider ${\omega}$-chaos as defined by S. H. Li in 1993. We show that c-dense ${\omega}$-scrambled sets are present in every transitive system with two-sided limit shadowing property (TSLmSP) and that every transitive map on topological graph has a dense Mycielski ${\omega}$-scrambled set. As a preliminary step, we provide a characterization of dynamical properties of maps with TSLmSP.

• Kyungpook Mathematical Journal
• /
• v.46 no.2
• /
• pp.189-200
• /
• 2006

The semicontinuous quasi-uniformity is known to be one of the most important examples of transitive quasi-uniformities. The aim of this paper is to show that various facts in classical topology connected with the semicontinuous quasi-uniformity and semicontinuous real functions may be easily extended to pointfree topology via a construction introduced by the authors in a previous paper. Several consequences are derived.

• Bulletin of the Korean Mathematical Society
• /
• v.15 no.1
• /
• pp.29-34
• /
• 1978

• Journal of the Korea Society for Simulation
• /
• v.17 no.3
• /
• pp.75-83
• /
• 2008

A deadlock is a condition in which the excessive demand for the resources being used by others causes activities to stop and it is one of the important problems in process control system to detect and prevent deadlocks. While the reachability analyze methods or divide subnets for analyzing methods are well used, it requires a lot of times and effects to analyze the detection of the deadlock status. Furthermore, it could not be effective if the model is complex or huge. Therefore, it is necessary to develop a new and more efficient deadlock detection algorithm. In this paper, a deadlock detection conditions after analyzed the Petri Net using the transitive matrix has been proposed to solve these problems. For presenting the results, the suggested deadlock detection algorithm was also adapted to an illustrated FMS (Flexible Manufacturing System) model.

• Journal of KIISE:Software and Applications
• /
• v.27 no.3
• /
• pp.302-313
• /
• 2000

In English-Korean machine translation, transitive verb-objective collocation is utilized for accurate translation of an English verbal phrase into Korean. This paper presents an algorithm for correct verb translation based on the k-nearest neighbor learning. The semantic distance is defined on the WordNet for the k-nearest neighbor learning. And we also present algorithms for automatic collocation dictionary optimization. The algorithms extract transitive verb-objective pairs as training examples from large corpora and minimize the examples, considering the tradeoff between translation accuracy and example size. Experiments show that these algorithms optimized collocation dictionary keeping about 90% accuracy for a verb 'build'.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.3069-3077
• /
• 1997

This paper is concerned with a new paradigm for parallel evaluation of linear recursion rules which contain transitive dependency in a shared-nothing parallel architecture. For parallel evaluation of rules, we consider a shared-nothing parallel architecture that consists of a set of nodes and a message passing network to these nodes. An evaluation of normalized rules is a computation of the proof theoretic meaning of a collection of rules. We shall here define normalized recursion rules which contain transitive dependency, present an equivalent expression for the rule, propose a paradigm for Parallel evaluation of normalized rule based on the equivalent expression using join, partition, and transitive closure operations, and analyze response-time complexity.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.2
• /
• pp.297-307
• /
• 2014

The present paper gives the notion of a derivation on a CI-algebra X and investigates related properties. We define a set $Fix_d(X)$ by $Fix_d(X)=\{x{\in}X{\mid}d(x)=x\}$, where d is a derivation on a CI-algebra X. We show that $Fix_d(X)$ is a subalgebra of X. Also, we prove some one-to-one and onto derivation theorems. Moreover, we study a regular derivation on a CI-algebra and an isotone derivation on a transitive CI-algebra.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.02a
• /
• pp.391-403
• /
• 2002

I argue that the so-called psychological predicates like komapta ′thankful,′ mwusepta ′fearful,′ silhta ′loathsome,′ or kulipta ′missing′require a nominative subject and a locative or dative complement, challenging the claim, a conventional wisdom originated from Kuno(1973), that they are two-place "transitive adjectives" requiring a nominative direct object, I also show that those adjectives are subject to having the locative-dative complement extracted, which is ultimately realized as a focused subject or a topic. Thus, in this type of double nominative constructions, the first nominative is a focused subject, and the second nominative forms an embedded clause with the psychological predicate, which functions as the predicate of the whole sentence.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.99-107
• /
• 2010

This paper is a study about the relationships among topologies and intuitionistic fuzzy topology induced, respectively, by approximation operators and an intuitionistic fuzzy approximation operator associated with an approximation space (X, R), when the relation R on X is precisely reflexive and transitive. In particular, we consider an intuitionistic fuzzy approximation operator on an approximation space X (i.e., a set X with a reflexive and transitive relation on it), which turns out to be an intuitionistic fuzzy closure operator. This intuitionistic fuzzy closure operator gives rise to two saturated fuzzy topologies on X and it turns out that all the level topologies of one of the fuzzy topology coincide and equal to the topology analogously induced on X by a crisp approximation operator. These observations are then applied to intuitionistic fuzzy automata.

• Journal of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.453-467
• /
• 1997

A transitive permutation representation of a group G is said to be multiplicity-free if all of its irreducible constituents are distinct. The character corresponding to the action is called the permutation character, given by $(1_H)^G$, where H is the stabilizer of a point. Multiplicity-free permutation characters are of interest in the study of centralizer algebras and distance-transitive graphs, and all finite simple groups are known to have such characters. In this article, we extend to the alternating groups the result of J. Saxl who determined the multiplicity-free permutation representations of the symmetric groups. We classify all subgroups H for which $(1_H)^An, n > 18$, is multiplicity-free.