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

In this paper, we obtain close characterizations of flows near a saddle set which is one of the interesting unstable closed sets. Also, we consider some conditions that closed sets are to be stable.

• The Journal of Society for e-Business Studies
• /
• v.4 no.2
• /
• pp.59-79
• /
• 1999

In order to construct a successful electronic commerce system, three main essential factors must be satisfied to obtain the best effective outcomes. The three main essential factors are as follows : economic factor, effectiveness factor and convenient factor. In order to understand the role of these three factors, one must have some insight knowledge about security to assist him to implement these three factors in his construction of an electronic commerce system. This paper analyses a implementation mechanism of security systems based on the SET 1.0 standard for electronic commerce systems, thus providing an effective plan for the construction of a security system in the SET-based electronic commerce field. This paper helps to analyse the elements of security vulnerabilities in the SET 1.0 standard implementation and also helps to understand the SET 1.0 protocol.

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

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

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

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.1
• /
• pp.45-52
• /
• 2013

We show that a nontrivial transitive set is $C^1$-stably limit shadowable if and only if the transitive set is hyperbolic.

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.45-53
• /
• 2009

As the point sampling technology evolves rapidly, there has been increasing need in generating tool path from dense point set without creating intermediate models such as triangular meshes or surfaces. In this paper, we present a new tool path generation method from point set using Euclidean distance fields based on Algebraic Point Set Surfaces (APSS). Once an Euclidean distance field from the target shape is obtained, it is fairly easy to generate tool paths. In order to compute the distance from a point in the 3D space to the point set, we locally fit an algebraic sphere using moving least square method (MLS) for accurate and simple calculation. This process is repeated until it converges. The main advantages of our approach are : (1) tool paths are computed directly from point set without making triangular mesh or surfaces and their offsets, and (2) we do not have to worry about no local interference at concave region compared to the other methods using triangular mesh or surface model. Experimental results show that our approach can generate accurate enough tool paths from a point set in a robust manner and efficiently.

• Korean Journal of Mathematics
• /
• v.29 no.1
• /
• pp.1-12
• /
• 2021

A dominating set S of a graph G is said to be nonsplit dominating set if the subgraph ⟨V - S⟩ is connected. The minimum cardinality of a nonsplit dominating set is called the nonsplit domination number and is denoted by ��ns(G). For a minimum nonsplit dominating set S of G, a set T ⊆ S is called a forcing subset for S if S is the unique ��ns-set containing T. A forcing subset for S of minimum cardinality is a minimum forcing subset of S. The forcing nonsplit domination number of S, denoted by f��ns(S), is the cardinality of a minimum forcing subset of S. The forcing nonsplit domination number of G, denoted by f��ns(G) is defined by f��ns(G) = min{f��ns(S)}, where the minimum is taken over all ��ns-sets S in G. The forcing nonsplit domination number of certain standard graphs are determined. It is shown that, for every pair of positive integers a and b with 0 ≤ a ≤ b and b ≥ 1, there exists a connected graph G such that f��ns(G) = a and ��ns(G) = b. It is shown that, for every integer a ≥ 0, there exists a connected graph G with f��(G) = f��ns(G) = a, where f��(G) is the forcing domination number of the graph. Also, it is shown that, for every pair a, b of integers with a ≥ 0 and b ≥ 0 there exists a connected graph G such that f��(G) = a and f��ns(G) = b.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.1
• /
• pp.13-18
• /
• 2004

We defined Cantor dimensions of a perturbed Cantor set, and investigated a relation between these dimensions and Hausdorff and packing dimensions of a perturbed Cantor set. In this paper, we introduce another expressions of the Cantor dimensions. Using these, we study some informations which can be derived from power equations induced from contraction ratios of a perturbed Cantor set to give its Hausdorff or packing dimension. This application to a deranged Cantor set gives us an estimation of its Hausdorff and packing dimensions, which is a generalization of the Cantor dimension theorem.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.1
• /
• pp.83-90
• /
• 2013

Intervals can be used in the representation of uncertainty. In this regard, we consider monotone interval-valued set functions and the Choquet integral. This paper investigates characterizations of monotone interval-valued set functions and provides applications of the Choquet integral with respect to monotone interval-valued set functions, on the space of measurable functions with the Hausdorff metric.