• Korean Journal of Community Nutrition
• /
• v.15 no.3
• /
• pp.329-341
• /
• 2010

The purpose of this study was to examine vegetable & fruit (V/F) intakes, beliefs and self-efficacy regarding V/F consumption, nutrition knowledge and eating behavior of elementary students. A survey was conducted to the 4th graders (n = 234) at two elementary schools in Guri, Kyunggi-do. About one-fourth of subjects were overweight or obese. Subjects had 4.2 servings of V/F a day, consuming 340.2 g of V/F. Girls consumed significantly more amounts of vegetables than boys (p < 0.05). Girls were more favorable regarding V/F consumption (p < 0.01), and believed more strongly on advantages of having V/F such as “good for skin” constipation prevention (p < 0.001) and cancer prevention (p < 0.05). Boys felt more strongly in disadvantages or barriers of eating V/F, including mother's cooking time constraints (p < 0.01), lack of past experience of eating V/F, and family members' disliking of V/F (p < 0.05). Girls felt more confident in eating V/F (p < 0.05) than boys; they also felt more confident in specific items of "eating fruits/salads instead of cookies/chips for snack" and "eating fruit juice/vegetable juice instead of soda"(p < 0.01). Subjects showed low level of nutrition knowledge, especially in items such as balanced meals, recommended servings of V/F and vitamin deficiency. Compared to boys, girls had more desirable eating behavior such as eating adequate amount of meals (p < 0.001), having a variety of foods, eating fruits daily, and having fatty foods less frequently (p < 0.05). Intakes of Ca and K were quite below the recommended level, while the intakes of protein, Na and vitamin A intake were much above the Dietary Reference Intakes (DRI) for 9-11 old children. Nutrient intakes expressed as %DRI was higher in girls for vitamin A (p < 0.01), energy and riboflavin (p < 0.05). High V/F consumption group (${\geq}5$ servings of V/F a day) compared to the counterparts showed higher self-efficacy and had better eating behaviors. Nutrition education for children should focus on increasing consumption of V/F, by helping them to increase self-efficacy for eating V/F and to recognize the benefits and reduce the barriers of eating V/F, especially in boys. It is also needed to provide nutrition information for balanced meals or increasing V/F consumption, and help the children to adopt desirable eating behavior.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.2
• /
• pp.9-14
• /
• 2007

A signed 3-partite graph is a 3-partite graph in which each edge is assigned a positive or a negative sign. Let G(U, V, W) be a signed 3-partite graph with $U\;=\;\{u_1,\;u_2,\;{\cdots},\;u_p\},\;V\;=\;\{v_1,\;v_2,\;{\cdots},\;v_q\}\;and\;W\;=\;\{w_1,\;w_2,\;{\cdots},\;w_r\}$. Then, signed degree of $u_i(v_j\;and\;w_k)$ is $sdeg(u_i)\;=\;d_i\;=\;d^+_i\;-\;d^-_i,\;1\;{\leq}\;i\;{\leq}\;p\;(sdeg(v_j)\;=\;e_j\;=\;e^+_j\;-\;e^-_j,\;1\;{\leq}\;j\;{\leq}q$ and $sdeg(w_k)\;=\;f_k\;=\;f^+_k\;-\;f^-_k,\;1\;{\leq}\;k\;{\leq}\;r)$ where $d^+_i(e^+_j\;and\;f^+_k)$ is the number of positive edges incident with $u_i(v_j\;and\;w_k)$ and $d^-_i(e^-_j\;and\;f^-_k)$ is the number of negative edges incident with $u_i(v_j\;and\;w_k)$. The sequences ${\alpha}\;=\;[d_1,\;d_2,\;{\cdots},\;d_p],\;{\beta}\;=\;[e_1,\;e_2,\;{\cdots},\;e_q]$ and ${\gamma}\;=\;[f_1,\;f_2,\;{\cdots},\;f_r]$ are called the signed degree sequences of G(U, V, W). In this paper, we characterize the signed degree sequences of signed 3-partite graphs.

• Communications of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.435-445
• /
• 2017

Let D be a directed graph with p vertices and q arcs. A vertex out-magic total labeling is a bijection f from $V(D){\cup}A(D){\rightarrow}\{1,2,{\ldots},p+q\}$ with the property that for every $v{\in}V(D)$, $f(v)+\sum_{u{\in}O(v)}f((v,u))=k$, for some constant k. Such a labeling is called a V-super vertex out-magic total labeling (V-SVOMT labeling) if $f(V(D))=\{1,2,3,{\ldots},p\}$. A digraph D is called a V-super vertex out-magic total digraph (V-SVOMT digraph) if D admits a V-SVOMT labeling. In this paper, we provide a method to find the most vital nodes in a network by introducing the above labeling and we study the basic properties of such labelings for digraphs. In particular, we completely solve the problem of finding V-SVOMT labeling of generalized de Bruijn digraphs which are used in the interconnection network topologies.

• Journal of Digital Convergence
• /
• v.20 no.2
• /
• pp.345-351
• /
• 2022

For simple undirected graph G=(V,E), L(2,1)-coloring of G is a nonnegative real-valued function f : V → [0,1,…,k] such that whenever vertices x and y are adjacent in G then |f(x)-f(y)|≥ 2 and whenever the distance between x and y is 2, |f(x)-f(y)|≥ 1. For a given L(2,1)-coloring c of graph G, the c-span is λ(c) = max{|c(v)-c(v)||u,v∈V}. L(2,1)-coloring number λ(G) = min{λ(c)} where the minimum is taken over all L(2,1)-coloring c of graph G. In this paper, based on Harary's Theorem, we use Tabu Search to figure out the existence of Hamiltonian Path in a complementary graph and confirmed that if λ(G) is equal to n(=|V|).

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1627-1638
• /
• 2018

In this paper, we study an special type of cyclic codes called skew cyclic codes over the ring ${\mathbb{F}}_p+v{\mathbb{F}}_p+v^2{\mathbb{F}}_p$, where p is a prime number. This set of codes are the result of module (or ring) structure of the skew polynomial ring (${\mathbb{F}}_p+v{\mathbb{F}}_p+v^2{\mathbb{F}}_p$)[$x;{\theta}$] where $v^3=1$ and ${\theta}$ is an ${\mathbb{F}}_p$-automorphism such that ${\theta}(v)=v^2$. We show that when n is even, these codes are either principal or generated by two elements. The generator and parity check matrix are proposed. Some examples of linear codes with optimum Hamming distance are also provided.

• East Asian mathematical journal
• /
• v.21 no.1
• /
• pp.61-64
• /
• 2005

Let R be a commutative ring with identity, and let $f,\;g_i(i=1,\;\ldots,\;n),\;g_{\alpha}(\alpha{\in}S)$ be elements of R. We show that the following statements are equivalent; (i) $X_f{\subseteq}{\cup}_{\alpha{\in}S}X_{g\alpha}$ only if $X_f{\subseteq}X_{g\alpha}$ for some $\alpha{\in}S$, (ii) $V(f){\subseteq}{\cup}_{\alpha{\in}S}V(g_{\alpha})$ only if $V(f){\subseteq}V(g_{\alpha})$ for some $\alpha{\in}S$, (iii) $V(f){\subseteq}{\cup}^n_{i=1}V(g_i)$ only if $V(f){\subseteq}V(g_i)$ for some i, (iv) Spec(R) is linearly ordered under inclusion.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.5
• /
• pp.63-71
• /
• 2003

In this paper we dicuss the dither-stripping methods by V-F(voltage to frequency) conversion of the output of angular velocity sensor which is for detecting the dither motion of the ring laser cavity. In this case, it is very important to evaluate the pulse-to-pulse scale factor between the ring lase output pulse and V-F output pulse, and also to compensate the zero offset of the V-F output pulse. In the case of the dither-stripping by the V-F conversion of angular velocity sensor output, there is a big angle uncertainty in the process of compensating the zero offset due to the dither noise for compensating the V-F output. By differential, the phase of the V-F output is changed. So, to compensate it, we change 90deg of the phase of angular velocity sensor output and delay half sampling time of the phase of ring laser output in advance. In this case the pulse-to-pulse scale factor can be evaluated by the standard deviation of each pulse. We can get the good result of the dither-stripping output by this angle differential method.

• Kyungpook Mathematical Journal
• /
• v.56 no.1
• /
• pp.69-81
• /
• 2016

For a positive integer k, a k-rainbow dominating function of a digraph D is a function f from the vertex set V (D) to the set of all subsets of the set $\{1,2,{\ldots},k\}$ such that for any vertex $v{\in}V(D)$ with $f(v)={\emptyset}$ the condition ${\cup}_{u{\in}N^-(v)}$ $f(u)=\{1,2,{\ldots},k\}$ is fulfilled, where $N^-(v)$ is the set of in-neighbors of v. A set $\{f_1,f_2,{\ldots},f_d\}$ of k-rainbow dominating functions on D with the property that $\sum_{i=1}^{d}{\mid}f_i(v){\mid}{\leq}k$ for each $v{\in}V(D)$, is called a k-rainbow dominating family (of functions) on D. The maximum number of functions in a k-rainbow dominating family on D is the k-rainbow domatic number of D, denoted by $d_{rk}(D)$. In this paper we initiate the study of the k-rainbow domatic number in digraphs, and we present some bounds for $d_{rk}(D)$.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.127-133
• /
• 2005

An f-coloring of a graph G = (V, E) is a coloring of edge set E such that each color appears at each vertex v $\in$ V at most f(v) times. The minimum number of colors needed to f-color G is called the f-chromatic index $\chi'_f(G)$ of G. Any graph G has f-chromatic index equal to ${\Delta}_f(G)\;or\;{\Delta}_f(G)+1,\;where\;{\Delta}_f(G)\;=\;max\{{\lceil}\frac{d(v)}{f(v)}{\rceil}\}$. If $\chi'_f(G)$= ${\Delta}$f(G), then G is of $C_f$ 1 ; otherwise G is of $C_f$ 2. In this paper, the classification problem of complete graphs on f-coloring is solved completely.

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

We show that if X is a space such that ${\beta}QF(X)=QF({\beta}X)$ and each stable $Z(X)^{\sharp}$-ultrafilter has the countable intersection property, then there is a homeomorphism $h_X:vQF(X){\rightarrow}QF(vX)$ with $r_X={\Phi}_{vX}{\circ}h_X$. Moreover, if ${\beta}QF(X)=QF({\beta}X)$ and $vE(X)=E(vX)$ or $v{\Lambda}(X)={\Lambda}(vX)$, then $vQF(X)=QF(vX)$.