• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.77-86
• /
• 2000

Consumers facing a large number of brands to choose from are known to use simplified heuristic to screen a set of relevant brands called the consideration set from the whole alternatives, Purchase decisions are then made from the brands in the consideration set, Two approaches have been suggested to model the two-stage choice process., One is to treat the con-sideration set as a crisp set (e.g Roberts and Lattin 1991) The other is to treat the set as a fuzzy set (e.g. Fortheringham 1988) The paper empirically compares the two types of models using data for soft drinks sneakers and departments. The results show that a model employing the crisp set approach fits the data better than that with the fuzzy set approach and better than a single-stage choice logit model.

• East Asian mathematical journal
• /
• v.27 no.3
• /
• pp.261-271
• /
• 2011

In this paper, fuzzy ${\alpha}^*$-set, fuzzy C-set, fuzzy AB-set, fuzzy t-set, fuzzy B-set, etc., are introduced in the sense of Sostak [12] and Ramadan [9]. By using these sets, a decomposition of fuzzy continuity and complete fuzzy continuity are provided. Characterization of smooth fuzzy extremally disconnected spaces is also obtained in this connection.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.2
• /
• pp.84-91
• /
• 1997

This paper reports the effort for developing this new Unified Manufacturing Instruction Set and its environment, called here UniSet, to deal with difficulties in set up and operation of Flexible Manufacturing Cells, UniSet has been developed as a non-exclusive unified manufacturing instruction set based on com- parisons of the prevailing machine tool and programming primitives. UniSet allows programmers to deal with only one instruction set, if they so desire, in a single coherent enviroment, rather than numerous machine programming languges. The software system is coded in an Object-Oriented Programming (OOP) language, Smalltalk, and derives its paradigm from the OO philosophy. Test results are also includ- ed to demonstrate the applicability of the approach employed.

• Journal of applied mathematics & informatics
• /
• v.41 no.4
• /
• pp.741-752
• /
• 2023

A new variant of vertex edge domination, namely semi total vertex edge domination has been introduced in the present paper. A subset S of the vertex set V of a graph G is said to be a semi total vertex edge dominating set(stved - set), if it is a vertex edge dominating set of G and each vertex in S is within a distance two of another vertex in S. An stved-set of G having minimum cardinality is said to be an γ_stve(G)- set and its cardinality is denoted by γ_stve(G). Bounds for γ_stve(G) - set have been given in terms of various graph theoretic parameters and graphs attaining the bounds have been characterized. In particular, bounds for trees have been obtained and extremal trees have been characterized.

• Korean Journal of Child Studies
• /
• v.36 no.3
• /
• pp.175-194
• /
• 2015

The purpose of this preliminary study was to investigate the validity of the 'Attachment Q-set' as a measuring tool for 5 years attachment stability. The subjects comprised 18 boys and 15 girls aged 5 in a daycare center in G city, in Kyongnam. The instruments used in this study were 'Attachment Q-set', ASCT, and IPPA-R. Based on experts' rating, the Q-set was modified, reducing it from 90 to 75 items, and used a Likert 5-points scale. ASCT scores as well as types were compared with the scores of the Q-set and IPPA-R. The attachment type was classified into either secure or insecure. The IPPA-R score of the secure infants was significantly higher than the insecure, and correlated with the ASCT score. However, there was no significant correlation between the Q-set score with the attachment types or the ASCT scores. The Q-set scores were partially correlated with the IPPA-R. This results were discussed in terms of the Q-set's invalidity for rating attachment levels of 5 years as well as the limitations imposed by the subjects' restrictive numbers.

• Bulletin of the Korean Chemical Society
• /
• v.28 no.3
• /
• pp.386-390
• /
• 2007

By use of a simple two-point extrapolation scheme estimating the correlation energies of the molecules along with the basis sets specifically targeted for extrapolation, we have shown that the MP2 basis set limit binding energies of large hydrogen-bonded complexes can be accurately predicted with relatively small amount of computational cost. The basis sets employed for computation and extrapolation consist of the smallest correlation consistent basis set cc-pVDZ and another basis set made of the cc-pVDZ set plus highest angular momentum polarization functions from the cc-pVTZ set, both of which were then augmented by diffuse functions centered on the heavy atoms except hydrogen in the complex. The correlation energy extrapolation formula takes the (X+1)-3 form with X corresponding to 2.0 for the cc-pVDZ set and 2.3 for the other basis set. The estimated MP2 basis set limit binding energies for water hexamer, hydrogen fluoride pentamer, alaninewater, phenol-water, and guanine-cytosine base pair complexes of nucleic acid by this method are 45.2(45.9), 36.1(37.5), 10.9(10.7), 7.1(6.9), and 27.6(27.7) kcal/mol, respectively, with the values in parentheses representing the reference basis set limit values. A comparison with the DFT results by B3LYP method clearly manifests the effectiveness and accuracy of this method in the study of large hydrogen-bonded complexes.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.3
• /
• pp.85-90
• /
• 2008

In this paper, we propose a new robot cleaning algorithm, which we call SetClean. The new algorithm cleans from the most less complex area. Sometimes, when the cleaning completion time can be longer or can not be estimated, cleaning larger area first is better than optimizing the whole time for cleaning. To do this, SetClean algorithm divides the whole area into cleanable sub-areas using Set Cover algorithm and cleans the area in the order of high efficiency that maximize the cleanable area per unit time. SetClean algorithm decides the navigation flow by considering not only the size of the area but also the distance from the current robot location to the area to be cleaned and the delay time caused by the number of turns within the area. The experimental results show the mechanism and performance of the SetClean algorithm.

• Communications of Mathematical Education
• /
• v.35 no.4
• /
• pp.413-423
• /
• 2021

This study investigated the empty set which is one of the mathematical objects. We inquired some misconceptions about empty set and the background of imposing empty set. Also we studied historical background of the introduction of empty set and the axiomatic system of Set theory. We investigated the nature of mathematical object through studying empty set, pure conceptual entity. In this study we study about the existence of empty set by investigating Alian Badiou's ontology known as based on the axiomatic set theory. we attempted to explain the relation between simultaneous equations and sets. Thus we pondered the meaning of the existence of empty set. Finally we commented about the thoughts of sets from a different standpoint and presented the meaning of axiomatic and philosophical aspect of mathematics.

• Journal of applied mathematics & informatics
• /
• v.42 no.3
• /
• pp.511-520
• /
• 2024

In this paper, we introduce the concept of split and non-split tree (D, C)- set of a connected graph G and its associated color variable, namely split tree (D, C) number and non-split tree (D, C) number of G. A subset S ⊆ V of vertices in G is said to be a split tree (D, C) set of G if S is a tree (D, C) set and ⟨V - S⟩ is disconnected. The minimum size of the split tree (D, C) set of G is the split tree (D, C) number of G, γ_χST (G) = min{|S| : S is a split tree (D, C) set}. A subset S ⊆ V of vertices of G is said to be a non-split tree (D, C) set of G if S is a tree (D, C) set and ⟨V - S⟩ is connected and non-split tree (D, C) number of G is γ_χST (G) = min{|S| : S is a non-split tree (D, C) set of G}. The split and non-split tree (D, C) number of some standard graphs and its compliments are identified.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.2
• /
• pp.169-175
• /
• 2020

This paper studied the SET situation in VLSI because the electronic devices exposed to SET can indicate irregular operation and output errors. The SET environment was established using the exponential static wave (iexp) in the fold-cascode comparator. The comparator was experimented with how it affected it by the SET. In a folded comparator that did not enter the SET situation, the propagation delay was measured at 0.26㎲ and the gain was 0.649. The MOSFET close to the output stage was measured sensitively in the folded comparator that entered the SET situation. And propagation delay was calculated from 0.36 to 0.37㎲ and the gain was 0.649. The mid-position MOSFET was calculated from 0.28 to 0.30㎲ and the gain was 0.649. The MOSFET, which is farthest from the output stage from the folded comparator, was calculated with the propagation delay between 0.25 and 0.26㎲ and the gain of 0.649. In SET situations, the MOSFET close to the output portion of the folded comparator was sensitive. And at the MOSFET far from the output, the same results were obtained as a normal folded comparator without the SET input.