• Korean Journal of Poultry Science
• /
• v.42 no.1
• /
• pp.27-32
• /
• 2015

In this study, we used two breeds of chicken to identify genomic regions corresponding to necrotic enteritis (NE) resistance. We scanned the genomes of a resistant and susceptible line of Fayoumi and White Leghorn chickens (20 birds/line) using a chicken 60 K Illumina SNP panel. A total of 235 loci with divergently fixed alleles were identified across the genome in both breeds; particularly, several clusters of multiple loci with fixed alleles were found in five narrow regions. Moreover, consensus 15-SNP haplotypes that were shared by the resistant lines of both breeds were identified on chromosomes 3, 7 and 9. Genes responsible for NE resistance were identified in chicken lines selected for resistance and susceptibility. Annotation of the regions spanning clustered divergently fixed regions revealed a set of interesting candidate genes such as phosphoinositide-3-kinase, regulatory subunit 5, p101 (PIK3R5) and inositol 1,4,5-trisphosphate receptor 1 (ITPR1), which participate in immune response. Consensus haplotypes were found in regions containing possibly relevant genes, such as myostatin and myosin, which play important roles in muscle development. Thus, genome scans of divergent selection in multiple chicken lines and breeds can be used to identify genomic regions associated with NE resistance.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1157-1163
• /
• 2009

Let G be a graph with vertex set V(G) and let f be a nonnegative integer-valued function defined on V(G). A spanning subgraph F of G is called a fractional f-factor if $d^h_G$(x)=f(x) for all x $\in$ for all x $\in$ V (G), where $d^h_G$ (x) = ${\Sigma}_{e{\in}E_x}$ h(e) is the fractional degree of x $\in$ V(F) with $E_x$ = {e : e = xy $\in$ E|G|}. In this paper it is proved that if ${\delta}(G){\geq}{\frac{b^2(k-1)}{a}},\;n>\frac{(a+b)(k(a+b)-2)}{a}$ and $|N_G(x_1){\cup}N_G(x_2){\cup}{\cdots}{\cup}N_G(x_k)|{\geq}\frac{bn}{a+b}$ for any independent subset ${x_1,x_2,...,x_k}$ of V(G), then G has a fractional f-factor. Where k $\geq$ 2 be a positive integer not larger than the independence number of G, a and b are integers such that 1 $\leq$ a $\leq$ f(x) $\leq$ b for every x $\in$ V(G). Furthermore, we show that the result is best possible in some sense.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4242-4268
• /
• 2014

The Cyber-Physical System (CPS) is a term describing a broad range of complex, multi-disciplinary, physically-aware next generation engineered system that integrates embedded computing technologies (cyber part) into the physical world. In order to define and understand CPS more precisely, this article presents a detailed survey of the related work, discussing the origin of CPS, the relations to other research fields, prevalent concepts, and practical applications. Further, this article enumerates an extensive set of technical challenges and uses specific applications to elaborate and provide insight into each specific concept. CPS is a very broad research area and therefore has diverse applications spanning different scales. Additionally, the next generation technologies are expected to play an important role on CPS research. All of CPS applications need to be designed considering the cutting-edge technologies, necessary system-level requirements, and overall impact on the real world.

• Journal of The Korean Astronomical Society
• /
• v.48 no.6
• /
• pp.325-331
• /
• 2015

We study an association between the duration of solar activity and characteristics of the latitude distribution of sunspots by means of center-of-latitude (COL) of sunspots observed during the period from 1878 to 2008 spanning solar cycles 12 to 23. We first calculate COL by taking the area-weighted mean latitude of sunspots for each calendar month to determine the latitudinal distribution of COL of sunspots appearing in the long and short cycles separately. The data set for the long solar cycles consists of the solar cycles 12, 13, 14, 20, and 23. The short solar cycles include the solar cycles 15, 16, 17, 18, 19, 21, and 22. We then fit a double Gaussian function to compare properties of the latitudinal distribution resulting from the two data sets. Our main findings are as follows: (1) The main component of the double Gaussian function does not show any significant change in the central position and in the full-width-at-half-maximum (FWHM), except in the amplitude. They are all centered at ~ 11° with FWHM of ~ 5°. (2) The secondary component of the double Gaussian function at higher latitudes seems to differ in that even though their width remains fixed at ~ 4°, their central position peaks at ~ 22.1° for the short cycles and at ~ 20.7° for the long cycles with quite small errors. (3) No significant correlation could be established between the duration of an individual cycle and the parameters of the double Gaussian. Finally, we conclude by briefly discussing the implications of these findings on the issue of the cycle 4 concerning a lost cycle.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.31-46
• /
• 2021

Let a and b be positive integers, and let V (G), ��(G), and ��2(G) be the vertex set of a graph G, the minimum degree of G, and the minimum degree sum of two non-adjacent vertices in V (G), respectively. An even [a, b]-factor of a graph G is a spanning subgraph H such that for every vertex v ∈ V (G), dH(v) is even and a ≤ dH(v) ≤ b, where dH(v) is the degree of v in H. Matsuda conjectured that if G is an n-vertex 2-edge-connected graph such that $n{\geq}2a+b+{\frac{a^2-3a}{b}}-2$, ��(G) ≥ a, and ${\sigma}_2(G){\geq}{\frac{2an}{a+b}}$, then G has an even [a, b]-factor. In this paper, we provide counterexamples, which are highly connected. Furthermore, we give sharp sufficient conditions for a graph to have an even [a, b]-factor. For even an, we conjecture a lower bound for the largest eigenvalue in an n-vertex graph to have an [a, b]-factor.

• Proceedings of the National Institute of Ecology of the Republic of Korea
• /
• v.2 no.1
• /
• pp.32-41
• /
• 2021

South Korea presently harbors less than 800 long-tailed gorals (Naemorhedus caudatus), an endangered species. I report for the first time on the taxonomic status and genetic diversity of the Korean species using non-invasive fecal sampling based on mitochondrial cytochrome b gene sequence analyses. To determine the taxonomic status of this species, I reconstructed a consensus neighbor-joining tree and generated a minimum spanning network combining haplotype sequences obtained from feces with a new goral-specific primer set developed using known sequences of the Korean goral and related species (e.g., Russian goral, Chinese goral, Himalayan goral, Japanese serow, etc.). I also examined the genetic diversity of this species. The Korean goral showed only three different haplotypes. The phylogenetic tree and parsimony haplotype network revealed a single cluster of Korean and Russian gorals, separate from related species. Generally, the Korean goral has a relatively low genetic diversity compared with that of other ungulate species (e.g., moose and red deer). I preliminarily showcased the application of non-invasive fecal sampling to the study of genetic characteristics, including the taxonomic status and genetic diversity of gorals, based on mitochondrial DNA. More phylogenetic studies are necessary to ensure the conservation of goral populations throughout South Korea.

• Journal of the Korean Mathematical Society
• /
• v.59 no.4
• /
• pp.757-774
• /
• 2022

Let a and b be positive even integers. An even [a, b]-factor of a graph G is a spanning subgraph H such that for every vertex v ∈ V (G), d_H(v) is even and a ≤ dH(v) ≤ b. Let κ(G) be the minimum size of a vertex set S such that G - S is disconnected or one vertex, and let σ₂(G) = min_uv∉E(G) (d(u)+d(v)). In 2005, Matsuda proved an Ore-type condition for an n-vertex graph satisfying certain properties to guarantee the existence of an even [2, b]-factor. In this paper, we prove that for an even positive integer b with b ≥ 6, if G is an n-vertex graph such that n ≥ b + 5, κ(G) ≥ 4, and σ₂(G) ≥ ${\frac{8n}{b+4}}$, then G contains an even [4, b]-factor; each condition on n, κ(G), and σ₂(G) is sharp.

• Journal of the Korean Mathematical Society
• /
• v.45 no.6
• /
• pp.1613-1622
• /
• 2008

Let G be a graph with vertex set V(G) and edge set E(G), and let g, f be two nonnegative integer-valued functions defined on V(G) such that $g(x)\;{\leq}\;f(x)$ for every vertex x of V(G). We use $d_G(x)$ to denote the degree of a vertex x of G. A (g, f)-factor of G is a spanning subgraph F of G such that $g(x)\;{\leq}\;d_F(x)\;{\leq}\;f(x)$ for every vertex x of V(F). In particular, G is called a (g, f)-graph if G itself is a (g, f)-factor. A (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. Let F = {$F_1$, $F_2$, ..., $F_m$} be a factorization of G and H be a subgraph of G with mr edges. If $F_i$, $1\;{\leq}\;i\;{\leq}\;m$, has exactly r edges in common with H, we say that F is r-orthogonal to H. If for any partition {$A_1$, $A_2$, ..., $A_m$} of E(H) with $|A_i|=r$ there is a (g, f)-factorization F = {$F_1$, $F_2$, ..., $F_m$} of G such that $A_i\;{\subseteq}E(F_i)$, $1\;{\leq}\;i\;{\leq}\;m$, then we say that G has (g, f)-factorizations randomly r-orthogonal to H. In this paper it is proved that every (0, mf - (m - 1)r)-graph has (0, f)-factorizations randomly r-orthogonal to any given subgraph with mr edges if $f(x)\;{\geq}\;3r\;-\;1$ for any $x\;{\in}\;V(G)$.

• Journal of the Korean Geographical Society
• /
• v.46 no.6
• /
• pp.724-737
• /
• 2011

The goal of solving a contiguous land acquisition problem is to find an optimal cluster of land parcels so that one can move from an acquired parcel to another without leaving the cluster. In many urban and regional planning applications, criteria such as acquisition cost and compactness of acquired parcels are important. Recent research has demonstrated that spatial contiguity can be formulated in a mixed integer programming framework. Spatial compactness, however, is typically formulated in an approximate manner using parameters such as external border length or other shape indices of acquired land parcels. This paper first develops an alternative measure of spatial compactness utilizing the characteristics of the internal structure of a contiguous set of land parcels and then incorporates this new measure into a mixed integer program of contiguous land acquisition problems. A set of computational experiments are designed to demonstrate the use of our model in a land acquisition context.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4B
• /
• pp.346-353
• /
• 2011

Routing schemes that service applications with various delay times, maintaining the long network life time are required in wireless sensor & actor networks. However, it is known that network lifetime and hop count of trees used in routing methods have the tradeoff between them. In this paper, we propose a Pareto Ant Colony Optimization algorithm to find the Pareto tree set such that it optimizes these both tradeoff objectives. As it enables applications which have different delay times to select appropriate routing trees, not only satisfies the requirements of various multiple applications but also guarantees long network lifetime. We show that the Pareto tree set found by proposed algorithm consists of trees that are closer to the Pareto optimal points in terms of hop count and network lifetime than minimum spanning tree which is a representative routing tree.