• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.129-138
• /
• 2006

Various techniques have been applied to solve the maximal covering problem. Tabu search is also one of them. But, existing researches were lacking of the synthetic analysis and the effort for performance improvement about neighborhood search techniques such as hill-climbing search and simulated annealing including tabu search. In this paper, I introduce the way to improve performance of neighborhood search techniques through various experiments and analyses. Basically, all neighborhood search algorithms use the k-exchange neighborhood generation method. And I analyzed how the performance of each algorithm changes according to various parameter settings. Experimental results have shown that simple hill-climbing search and simulated annealing can produce better results than any other techniques. And I confirmed that simple hill-climbing search can produce similar results as simulated annealing unlike general case.

• Korean Journal of Agricultural Science
• /
• v.41 no.3
• /
• pp.163-167
• /
• 2014

The average temperatures for year and winter season have been risen by $0.7{\circ}C$ and $1.4{\circ}C$, respectively, during the last 30 years. Recently abnormal climate phenomena occurred frequently results in severe loss of vegetable crops grown in Korea. Specially, Chinese cabbages grown in the southern area of Korea are often significantly affected by sudden cold waves during winter season before harvest. This experiment was conducted to find out a potential role of covering materials on the protection of frost damage of 'Bularm' chinese cabbage in the winter season. The lowest temperature was $-15.8^{\circ}C$ in non-covering, $-8.1^{\circ}C$ in the PE film covering and $-4.6^{\circ}C$ in the non-woven fabric covering with PE film, respectively. The cumulative times below $4.0^{\circ}C$ were 145.5 hours for the non-covering treatment, 94 hours in the PE film covering and 14.5 hours in the non-woven fabric covering with PE film, respectively. The symptoms of frost damage were severe at non-covering chinese cabbages compared to polyethylene film (PE) non-woven fabric with PE covering ones. Microscopic studies showed the normal anatomical structure of palisade and spongy tissue of cabbage leaves covered with non-woven fabric with PE film. Leaf cells, however, were slightly damaged in cabbages covered with PE film alone, and both palisade and spongy cells were were completely collapsed in uncovered cabbages. The result of this study suggests that chinese cabbages is required to be covered with non-woven fabric with PE film to minimize the frost damage by sudden cold wave below $-7^{\circ}C$.

• Journal of Korean Society of Transportation
• /
• v.17 no.2
• /
• pp.137-147
• /
• 1999

This paper studies on the optimal bus network design in the framework of the set covering theory. The theory enables to cover passenger's loading and alighting areas as the set, and maximize the covering set as much as possible. In other words, it calculates the minimal set of the bus routes for covering whole bus passengers demand. After the optimal set of the bus routes is generated by the set covering theory, multimodal traffic equilibrium assignment is used for evaluating the generated set in terms of passenger's mode and route choice behavior. Whilst most previous works on it have been based on analyzing a specific route in a limited area, this study seeks to optimize the whole bus network.

• Honam Mathematical Journal
• /
• v.36 no.3
• /
• pp.695-706
• /
• 2014

Various properties of digital covering spaces have been substantially used in studying digital homotopic properties of digital images. In particular, these are so related to the study of a digital fundamental group, a classification of digital images, an automorphism group of a digital covering space and so forth. The goal of the present paper, as a survey article, to speak out utility of digital covering theory. Besides, the present paper recalls that the papers [1, 4, 30] took their own approaches into the study of a digital fundamental group. For instance, they consider the digital fundamental group of the special digital image (X, 4), where X := $SC^{2,8}_4$ which is a simple closed 4-curve with eight elements in $Z^2$, as a group which is isomorphic to an infinite cyclic group such as (Z, +). In spite of this approach, they could not propose any digital topological tools to get the result. Namely, the papers [4, 30] consider a simple closed 4 or 8-curve to be a kind of simple closed curve from the viewpoint of a Hausdorff topological structure, i.e. a continuous analogue induced by an algebraic topological approach. However, in digital topology we need to develop a digital topological tool to calculate a digital fundamental group of a given digital space. Finally, the paper [9] firstly developed the notion of a digital covering space and further, the advanced and simplified version was proposed in [21]. Thus the present paper refers the history and the process of calculating a digital fundamental group by using various tools and some utilities of digital covering spaces. Furthermore, we deal with some parts of the preprint [11] which were not published in a journal (see Theorems 4.3 and 4.4). Finally, the paper suggests an efficient process of the calculation of digital fundamental groups of digital images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.180-187
• /
• 2002

The decoding method using covering polynomials is an extended form of error-trapping decoding, and is a simple and effective means to implement decoders for cyclic codes. Covering polynomials can be used for soft-decision decoding as well as for decoding beyond the bounded distance of the code. The implementation complexity is proportional to the number of covering polynomials employed. In this paper, the soft-decision decoding procedure using covering polynomials is described, and the procedure is applied to the [23,12] Golay code. A new set of covering polynomials is derived for the procedure, which is presented as a generalized closed-form solution. The set can be efficiently utilized for decoding a class of cyclic codes including the Golay code. Computer simulation of the described procedure is performed to show the trade-offs between the decoder performance and complexity. It is demonstrated that soft-decision decoding of the Golay code using the derived set of covering polynomials has less than 0.2dB deviation from the optimal performance of maximum-likelihood decoding, with a reduced complexity when compared to the Chase Algorithm 2 combined with hard-decision decoding that has nearly identical performance.

• Korean Journal of Soil Science and Fertilizer
• /
• v.48 no.2
• /
• pp.138-145
• /
• 2015

Heavy metal pollution in agricultural field near the abandoned metal mines is a critical problem in Korea. General remediation technique is to apply chemical amendments and soil covering. However, there is no specific guidelines for conducting soil covering. Therefore, main objective of this research was to determine optimum soil covering technique with microcosm experiment. Three different chemical amendments, lime stone (LS), steel slag (SS), and acid mine drainage sludge (AMDS), were examined and varied soil covering depth, 20, 30, 40cm, was applied to determine optimum remediation technique. Bioavailable heavy metal concentration in soil and total concentration of heavy metals in crop were monitored. Result showed that average heavy metal concentration in varied soil covering depth was ordered as 40 cm ($14.5mg\;kg^{-1}$) < 20 cm ($14.6mg\;kg^{-1}$) < 30 cm ($16.0mg\;kg^{-1}$) and also heavy metal concentration in crop was ordered as 40 cm ($100{\mu}g\;kg^{-1}$) < 30 cm ($183{\mu}g\;kg^{-1}$) < 20 cm ($190{\mu}g\;kg^{-1}$). In terms of chemical amendments, average heavy metal concentration was decreased as AMDS ($150{\mu}g\;kg^{-1}$) < SS ($151{\mu}g\;kg^{-1}$) < LS ($154{\mu}g\;kg^{-1}$). Overall, depth of soil covering should be over 30 cm to minimize bioaccumulation of heavy metals and SS and LS could be applied in heavy metal contaminated soil for remediation purposes.

• Kyungpook Mathematical Journal
• /
• v.33 no.2
• /
• pp.221-230
• /
• 1993

• Bulletin of the Korean Mathematical Society
• /
• v.21 no.2
• /
• pp.67-75
• /
• 1984

Let X be a topological space. We consider a groupoid G over X and the quotient groupoid G/N for any normal subgroupoid N of G. The concept of groupoid (topological groupoid) is a natural generalization of the group(topological group). An useful example of a groupoid over X is the foundamental groupoid .pi.X whose object group at x.mem.X is the fundamental group .pi.(X, x). It is known [5] that if X is locally simply connected, then the topology of X determines a topology on .pi.X so that is becomes a topological groupoid over X, and a covering space of the product space X*X. In this paper the concept of the locally simple connectivity of a topological space X is applied to the groupoid G over X. That concept is defined as a term '1-connected local subgroupoid' of G. Using this concept we topologize the groupoid G so that it becomes a topological groupoid over X. With this topology the connected groupoid G is a covering space of the product space X*X. Further-more, if ob(.overbar.G)=.overbar.X is a covering space of X, then the groupoid .overbar.G is also a covering space of the groupoid G. Since the fundamental groupoid .pi.X of X satisfying a certain condition has an 1-connected local subgroupoid, .pi.X can always be topologized. In this case the topology on .pi.X is the same as that of [5]. In section 4 the results on the groupoid G are generalized to the quotient groupoid G/N. For any topological groupoid G over X and normal subgroupoid N of G, the abstract quotient groupoid G/N can be given the identification topology, but with this topology G/N need not be a topological groupoid over X [4]. However the induced topology (H) on G makes G/N (with the identification topology) a topological groupoid over X. A final section is related to the covering morphism. Let G$_{1}$ and G$_{2}$ be groupoids over the sets X$_{1}$ and X$_{2}$, respectively, and .phi.:G$_{1}$.rarw.G$_{2}$ be a covering spimorphism. If X$_{2}$ is a topological space and G$_{2}$ has an 1-connected local subgroupoid, then we can topologize X$_{1}$ so that ob(.phi.):X$_{1}$.rarw.X$_{2}$ is a covering map and .phi.: G$_{1}$.rarw.G$_{2}$ is a topological covering morphism.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.537-545
• /
• 2005

The aim of this paper is to solve the open problem on product properties of digital covering maps raised from [5]. Namely, let us consider the digital images $X_1 {\subset}Z^{n_{0}}$ with $k_0-adjacency$, $Y_1{\subset}Z^{n_{1}}$ with $k_3-adjacency$, $X_2{\subset}Z^{n_{2}}$ with $k_2-adjacency$ and $Y_2{\subset}Z^{n_{3}}$ with $k_3-adjacency$. Then the reasonable $k_4-adjacency$ of the product image $X_1{\times}X_2$ is determined by the $k_0-$ and $k_2-adjacency$ and the suitable k_5-adjacency$ is assumed on $Y_1{\times}Y_2$ via the $k_1-$ and $k_3-adjacency$ [3] such that each of the projection maps is a digitally continuous map, e.g., $p_1\;:\;X_1{\times}X_2{\rightarrow}X_1$ is a digitally ($k_4,\;k_1$)-continuous map and so on. Let us assume $h_1\;:\;X_1{\rightarrow}Y_1$ to be a digital $(k_0, k_1)$-covering map and $h_2\;:\;X_2{\rightarrow}Y_2$ to be a digital $(k_2,\;k_3)$-covering map. Then we show that the product map $h_1{\times}h_2\;:\;X_1{\times}X_2{\rightarrow}Y_1{\times}Y_2$ need not be a digital $(k_4,k_5)$-covering map.

• Fashion & Textile Research Journal
• /
• v.2 no.3
• /
• pp.227-233
• /
• 2000

The purpose of this study was to develop the High Functional Covering machine and the Compound Twister to produce the high value added textile goods and to meet the consumer's needs. For the study, 8 yarns and 12 fabrics were made with two developed machines and the tensile characteristics of the samples were tested and analysed. The result indicated that the sample fabrics kept their elongation regardless of buffering process. Elongation of the sample yarns was higher than those of yarns made with a traditional covering method. Elastic recovery of the sample fabrics was more effected by the recovery rate than by the number of extension and the characteristics of the sample yarns and fabrics were comparable to the yarns and fabrics made with a traditional covering method in terms of the position of Spandex yarns in their yarn structure and buffering effect.