• The Pure and Applied Mathematics
• /
• v.29 no.1
• /
• pp.93-102
• /
• 2022

The impact of programming languages in the research sector has helped lot of researchers to broaden their view and extend their work without any limitation. More importantly, even the complex problems can be solved in no matter of time while converting them into a programming language. This convenience provides upper hand for the researchers as it places them in a comfort zone where they can work without much stress. With this context, we have converted the research problems in Topology into programming language with the help of Python. In this paper, we have developed a Python program to find the weaker form of closed sets namely alpha closed set, semi closed set, pre closed set, beta closed set and regular closed set.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.1
• /
• pp.29-35
• /
• 2016

In this paper, we consider a convex optimization problem with a convex integrable objective function and a geometric constraint set. We characterize the solution set of the problem when we know its one solution.

• Kyungpook Mathematical Journal
• /
• v.32 no.1
• /
• pp.21-30
• /
• 1992

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

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

In this paper, we characterize a vector-valued convex set function by its epigraph. The concepts of a vector-valued set function and a vector-valued concave set function we given respectively. The definitions of the conjugate functions for a vector-valued convex set function and a vector-valued concave set function are introduced. Then a Fenchel duality theorem in multiobjective programming problem with set functions is derived.

• Asia Marketing Journal
• /
• v.21 no.1
• /
• pp.45-64
• /
• 2019

A great deal of research has explored individuals' attempts to simplify choices by constructing a consideration set. This research aims to investigate which construction strategy, either inclusion or exclusion, is more likely to be adopted and how the adoption of a particular construction strategy can affect consideration set size while identifying the moderating role of chronic indecisiveness in the construction process. The findings of Study 1 indicate that individuals are more likely to adopt an inclusion strategy to reduce a consideration set to a more manageable size, and that an exclusion strategy results in a larger consideration set. In Study 2, the findings reveal that high-indecisiveness individuals are less likely than low-indecisiveness individuals to select an inclusion strategy, but that high-indecisiveness individuals adopting an inclusion strategy are able to reduce the number of alternatives in a consideration set to a manageable size on par with the size of a consideration set formed by low-indecisiveness individuals without elevating the level of perceived difficulty. The current research contributes to the stream of research on consideration set construction and indecisiveness, and offers useful practical implications for overcoming indecisiveness. Limitations and avenues for further research are also discussed.

• Nuclear Engineering and Technology
• /
• v.25 no.3
• /
• pp.457-469
• /
• 1993

JEF-1-based 50-group cross section set for fast reactor calculations was generated using NJOY system. The set was then examined by analyzing measured integral quantities such as criticality and central reaction rate ratios for 27 fast critical assemblies. The calculated results using the new set were also compared with those of ENDF/B-IV or-V-based fast set. In general, the JEF-1-based set shows an improvement in predicting measured integral quantities in comparison with the previous set. With a few exceptions, JEF-1 results are comparable to those of ENDF/B-V.

• Journal of the Korean Society for information Management
• /
• v.11 no.1
• /
• pp.81-102
• /
• 1994

Accordmg to the development of various information retneval system suitable for Korean database, many researchers have realized the need of R Test ColleAon which can be r d y used for evaluatmg a retneval system. Therefore, This study developed the TEST SET whch helps ob&vely evaluatmg the retrieval performance of an Hangul Automatic Indexer or Korean Information Retrieval System. The developed Test Set has four files such as: 1) Korean Document Set( * . all): 2) Natural Language Query Set(KTsetnq1): 3) Boolean Query Set(Ktset.bq1): 4) Query-Relevance Judgment Set ( KTsetrel) .

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.4
• /
• pp.743-753
• /
• 2000

In the space $C_1(X)$ of real-valued continuous functions with $L_1-norm$, every bounded set has a relative Chebyshev center in a finite-dimensional subspace S. Moreover, the set function $F\rightarrowZ_S(F)$ corresponding to F the set of its relative Chebyshev centers, in continuous on the space B[$C_1(X)$(X)] of nonempty bounded subsets of $C_1(X)$ (X) with the Hausdorff metric. In particular, every bounded set has a relative Chebyshev center in the closed convex set S(F) of S and the set function $F\rightarrowZ_S(F)$(F) is continuous on B[$C_1(X)$ (X)] with a condition that the sets S(.) are equal.

• Journal of the Chungcheong Mathematical Society
• /
• v.16 no.2
• /
• pp.1-10
• /
• 2003

We compare a self-similar measure on a self-similar Cantor set with a quasi-self-similar measure on a deranged Cantor set. Further we study some properties of a self-similar measure on a self-similar Cantor set.