• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1108-1113
• /
• 2004

‘Set’ is a tool that is used frequently in designing computer programs. Because of the reason, ‘set constraints languages’ have been developed recently. In this research, we introduce ‘(Ab)(Cl) set unification’ problem and implement it using the ‘set equation rewriting in Prolog’. In this research we shows that the set unification, that is considered to be difficult to be implemented in procedural languages, ran be implemented easily using the non-deterministic control structure and the list data structure in logic language like Prolog. Our research uses the Ciao Prolog with GNU GPL, this is compared with other existing implementations which used expensive commercial Prolog, so anyone can use the result freely. Currently the result is being used for implementing a set constraint language.

• Journal of the Korean Dietetic Association
• /
• v.13 no.1
• /
• pp.1-14
• /
• 2007

The purpose of this study was to assess students’ preference on set menus served in school foodservice. Questionnaires were distributed to 4,050 students enrolled in 34 middle and high schools located in Seoul, Gyeonggi, and Gyeongnam provinces. The students were asked to assess their preferences on 78 set menus using a 5-point Likert-type scale(1 : very dislike - 5 : very like). Excluding responses with significant missing data, usable responses were 3,433. Data were analyzed with descriptive analysis, t-test, and one-way analysis of variance. There was no difference between middle and high school students in terms of set menu preferences. On the other hand, there was significant difference between boys' and girls' set menu preferences. Among the seven given set menu groups(rice and soup with side dishes, tangs, rice with toppings, fried rice, western foods, noodles.ddeokguk.dumpling soups, and bibimbaps), boys had higher preference scores for the rice and soup with side dishes, tangs, rice with toppings, and fried rice than that of girls. Fried rice set menus were chosen to be boys’ favorite menus while western food set menus were most preferred by the girls. Rice and soup with side dishes set menus were least preferred by both boys and girls.

• Communications of the Korean Mathematical Society
• /
• v.9 no.3
• /
• pp.687-700
• /
• 1994

Throughout this paper we will let H denote the complete Heyting algebra ($H, \vee, \wedge, *$) with order reversing involution *. 0 and 1 denote the supermum and the infimum of $\emptyset$, respectively. Given any set X, any element of $H^X$ is called H-fuzzy set (or, simply f.set) in X and will be denoted by small Greek letters, such as $\mu, \nu, \rho, \sigma$. $H^X$ inherits a structure of H with order reversing involution in natural way, by definding $\vee, \wedge, *$ pointwise (sam notations of H are usual). If $f$ is a map from a set X to a set Y and $\mu \in H^Y$, then $f^{-1}(\mu)$ is the f.set in X defined by f^{-1}(\mu)(x) = \mu(f(x))$. Also for $\sigma \in H^X, f(\sigma)$ is the f.set in Y defined by $f(\sigma)(y) = sup{\sigma(x) : f(x) = y}$ ([4]). A preorder R on a set X is reflexive and transitive relation on X, the pair (X,R) is called preordered set. A map $f$ from a preordered set (X, R) to another one (Y,T) is said to be preorder preserving (inverting) if for $x,y \in X, xRy$ implies $f(x)T f(y) (resp. f(y)Tf(x))$. For the terminology and notation, we refer to [10, 11, 13] for category theory and [7] for H-fuzzy semitopogenous spaces.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2C
• /
• pp.169-174
• /
• 2009

In this paper, we propose a new construction method of binary low correlation zone (LCZ) sequence set. New construction method applies Gray mapping to conventional quaternary LCZ sequence set that has specific property. The period of new binary sequence set is twice as that of used sequence set in construction, and maximum magnitude of correlation value within the LCZ and cardinality of new set is also twice as those of used quaternary sequence set. But the LCZ size is the same with that of used sequence set. If the used Quaternary sequence set is optimal, the constructed binary sequence set is optimal with high probability.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.27 no.5
• /
• pp.582-587
• /
• 2003

To examine the effect of heat treatment temperature in finishing process on PET/PBT Fabric, PET/PBT Fabrics were treated at different relaxing temp., pre-set temp., and final-set temp.. The dimensions such as thickness and density were measured, and the handles were evaluated by Kawabata system. In relaxing which was wet heat treatment, thickness and bulkiness were increased, and NUMERI, FUKURAMI, SOFUTOSA, and THV also were increased but KOSHI was decreased with elevating temperature. With elevating pre-set temp., thickness and bulkiness were decreased, but KOSHI was increased. NUMERI, FUKURAMI, SOFUTOSA, and THV were the best at 180$^{\circ}C$ pre-set treatment. In final-set which was dry heat treatment like pre-set, thickness, bulkiness, NUMERI, HUKURAMI, SOFUTOSA, and THV were decreased, but KOSHI value was increased with elevating temperature. Therefore the best heat treatment condition was 130$^{\circ}C$ relaxing, 180$^{\circ}C$ pre-set, and 160$^{\circ}C$ final-set. And the handle of PET/PBT Fabric was affected much more by relaxing temp. than pre-set temp. and final-set temp.

• Journal of applied mathematics & informatics
• /
• v.39 no.1_2
• /
• pp.155-163
• /
• 2021

For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for each pair of vertices x, y in G there exist vertices u, v ∈ S such that x, y ∈ I[u, v]. The double geodetic number dg(G) is the minimum cardinality of a double geodetic set. Any double godetic set of cardinality dg(G) is called a dg-set of G. A connected double geodetic set of G is a double geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected double geodetic set of G is the connected double geodetic number of G and is denoted by dgc(G). A connected double geodetic set of cardinality dgc(G) is called a dgc-set of G. Connected graphs of order n with connected double geodetic number 2 or n are characterized. For integers n, a and b with 2 ≤ a < b ≤ n, there exists a connected graph G of order n such that dg(G) = a and dgc(G) = b. It is shown that for positive integers r, d and k ≥ 5 with r < d ≤ 2r and k - d - 3 ≥ 0, there exists a connected graph G of radius r, diameter d and connected double geodetic number k.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.6
• /
• pp.1743-1758
• /
• 2023

Automatic modulation classification is a critical algorithm for non-cooperative communication systems. This paper addresses the challenging problem of closed-set and open-set signal modulation classification in complex channels. We propose a novel approach that incorporates a self-learning filter and center-loss in Deep Residual Shrinking Networks (DRSN) for closed-set modulation classification, and the Opendistance method for open-set modulation classification. Our approach achieves better performance than existing methods in both closed-set and open-set recognition. In closed-set recognition, the self-learning filter and center-loss combination improves recognition performance, with a maximum accuracy of over 92.18%. In open-set recognition, the use of a self-learning filter and center-loss provide an effective feature vector for open-set recognition, and the Opendistance method outperforms SoftMax and OpenMax in F1 scores and mean average accuracy under high openness. Overall, our proposed approach demonstrates promising results for automatic modulation classification, providing better performance in non-cooperative communication systems.

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

Let $P_c(z)=z^n+c$ be a complex polynomial with an integer $n{\geq}2$. We derive a criterion that the critical orbit of $P_c$ escapes to infinity and investigate its applications to the degree-n bifurcation set. The intersection of the degree-n bifurcation set with the real line as well as with a typical symmetric axis is explicitly written as a function of n. A well-defined escape-time algorithm is also included for the improved construction of the degree-n bifurcation set.

• Journal of the Chungcheong Mathematical Society
• /
• v.9 no.1
• /
• pp.107-113
• /
• 1996

For continuous maps f of the circle to itself, we show that (1) the set of ${\omega}$-limit points is contained in the set of nonwandering points of $f^n$ for all $n{\geq}1$. (2) if the set of turning points of f is finite, then the set of accumulation points of non wandering set is contained in the set of non wandering points of $f^n$ for all $n{\geq}1$.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1911-1916
• /
• 2003

Parameter set of an LPV system is divided into a number of subsets so that robust feedback gains may be designed for each subset of parameters. A concept of quasi-invariant set is introduced, which allows finite steps of delay in reentrance to the set. A feasible and positively invariant set with respect to a gain-scheduled state feedback control can be easily obtained from the quasi-invariant set. A receding horizon control strategy can be derived based on this feasible and invariant set.