• Journal of applied mathematics & informatics
• /
• v.39 no.5_6
• /
• pp.689-701
• /
• 2021

The purpose of this paper is to optimize the number of source places required for the unique representation of the destination using the tools of graph theory. A subset S of vertices of a graph G is called a rational resolving set of G if for each pair u, v ∈ V - S, there is a vertex s ∈ S such that d(u/s) ≠ d(v/s), where d(x/s) denotes the mean of the distances from the vertex s to all those y ∈ N[x]. A rational resolving set is called minimal rational resolving set if no proper subset of it is a rational resolving set. In this paper we study varieties of minimal rational resolving sets defined on the basis of its complements and compute the minimum and maximum cardinality of such sets, respectively called as lower and upper rational metric dimensions for power of a path P_n analysing various possibilities.

• 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.

• Wind and Structures
• /
• v.31 no.4
• /
• pp.321-334
• /
• 2020

Engineering type tropical cyclone (TC) wind field models are used to estimate TC wind hazard. Some of the models are well-calibrated using observation data, while others are not extensively compared and verified. They are all proxies to the real TC wind fields. The computational effort for their use differs. In the present study, a comparison of the predicted wind fields is presented by considering three commonly used models: the gradient wind field model, slab-resolving model, and a linear height-resolving model. These models essentially predict the horizontal wind speed at a different height. The gradient wind field model and linear height-resolving model are simple to use while the nonlinear slab-resolving model is more compute-intensive. A set of factors is estimated and recommended such that the estimated TC wind hazard by using these models becomes more consistent. The use of the models, including the developed set of factors, for estimating TC wind hazard over-water and over-land is presented by considering the historical tracks for a few sites. It is shown that the annual maximum TC wind speed can be adequately modelled by the generalized extreme value distribution.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.250-252
• /
• 2002

In most Multi-Agent Systems (MAS), agents are required to achieve their own goals. An agent's goals, however, can conflict with others either when agents compete with earth other to achieve a common goal or when they have to use a set of limited resources to accomplish agents'divergent goals. In this paper, we consider that a BDI architecture, as a shorthand fur belief, desire, and intention in any agent-based systems, is a core component of agents' mental attitudes and represent resource-bounded BDI agents in logic programming framework. We propose an algorithm in which BDI agents with different goals solve their problems through negotiation resolving goal conflicts.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.75-77
• /
• 1998

Perhaps one of the most versatile approaches to learning in practical domains lies in case based reasoning. To date, however, most case based reasoning systems have tended to focus on relatively simple domains. The current study involves the development of a decision support system for a complex production process with a limited database. This paper presents a set of critical issues underlying CBR, then explores their consequences for a complex domain. Finally, the performance of the system is examined for resolving various types of quality control problems.

• Animal cells and systems
• /
• v.6 no.2
• /
• pp.145-151
• /
• 2002

Phylogenetic signal present in the mitochondrial 16S ribosomal RNA gene (16S rDNA) and the nuclear large subunit ribosomal RNA gene (28S rDNA) was explored to assess their utility in resolving family level relationships of the superfamily Tephritoidea. These two genes were chosen because they appear to evolve at different rates, and might contribute to resolve both shallow and deeper phylogenetic branches within a highly diversified group. For the 16S rDNA data set, the number of aligned sites was 1,258 bp, but 1,204 bp were used for analysis after excluding sites of ambiguous alignment. Among these 1,204 sites, 662 sites were variable and 450 sites were informative for parsimony analysis. For the 28S rDNA data set, the number of aligned sites was 1,102 bp, but 1,000 bp were used for analysis after excluding sites of ambiguous alignment. Among these 1000 sites, 235 sites were variable and 95 sites were informative for parsimony analysis. Our analyses suggest that: (1) while 16S rDNA is useful for resolving more recent phylogenetic divergences, 28S rDNA can be used to define much deeper phylogenetic branches; (2) the combined analysis of the 16S and 28S rDNAs enhances the overall resolution without losing phylogenetic signal from either single gene analysis; and (3) additional genes that evolve at intermediate rates between the 16S and 28S rDNAs are needed to further resolve relationships among the tephritoid families.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.39-42
• /
• 2000

Extensible Markup Language(XML) is fast emerging as the dominant standard for representing data in the World Wide Web. Sophisticated query engines that allow users to effectively tap the data stored in XML documents will be crucial to exploiting the full power of XML. While there has been a great deal of activity recently proposing new semi-structured data models and query languages for this purpose, this paper explores the more conservative approach of using traditional relational database engines for processing XML documents conforming to Document Type Descriptors(DTDs). In this paper, we describe how to generate relational schemas from XML DTDs. The main issues that must be addressed inc]ode (a) dealing with the complexity of DTD element specifications (b) resolving the conflict between the two-level nature of relational schemas (table and attribute) vs. the arbitrary nesting of XML DTD schemas and (c) dealing with set-valued attributes and recursion. We now propose a set of transformations that can be used to "simplify" any arbitrary DTD without undermining the effectiveness of queries over documents conforming to that DTD.

• Journal of the Society of Naval Architects of Korea
• /
• v.42 no.6 s.144
• /
• pp.583-592
• /
• 2005

The turbulent free surface flow around a self-propelled KRISO 138K LNG Carrier is numerically simulated using the finite volume based multi-block RANS code, WAVIS developed at HRISO. The realizable k-$\varepsilon$ turbulence model with a wail function is employed for the turbulence closure. The free surface is captured with the Level-Set method and body forces are used to model the effects of a propeller without resolving the detail blade flow. In order to obtain an accurate free surface solution and stable convergence, the computations are executed with a proper fine grid refinement around the free surface and with an adoption of implicit discretization scheme for the Level-Set formulation. The computed velocity vectors at the several stations and wave patterns show a good agreement with the experimental results measured at the KRISO towing tank.

• The Journal of the Korea Contents Association
• /
• v.9 no.11
• /
• pp.455-464
• /
• 2009

To overcome article-oriented search functions and provide author-oriented ones, a namesake problem for author names should be solved. Author disambiguation, proposed as its solution, assigns identifiers of real individuals to author name entities. Although recent state-of-the-art approaches to author disambiguation have reported above 90% performance, there are few academic information services which adopt author-resolving functions. This paper describes a large-scale test set for author disambiguation which was created by KISTI to foster author resolution researches. The result of these researches can be applied to academic information systems and make better service. The test set was constructed from DBLP data through web searches and manual inspection, Currently it consists of 881 author names, 41,673 author name entities, and 6,921 person identifiers.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.2
• /
• pp.125-130
• /
• 2003

This paper presents a simple method of supervised word sense disambiguation using decision lists based on syntactic clues. This approach focuses on the syntactic relations between the given ambiguous word and surrounding words in context for resolving a given sense ambiguity. By identifying and utilizing only the single best disambiguation evidence in a given context instead of combining a set of clues, the algorithm decides the correct sense. Experiments with 10 Korean verbs show that adding syntactic clues to a basic set of surrounding context words improves 33% higher performance than baseline accuracy. In addition, our method using decision lists is 3% higher than a method using integration of all disambiguation evidences.