• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.609-612
• /
• 2008

Let G = (V, E) be a simple undirected graph. The Minimum Vertex Cover (MVC) problem is to find a minimum subset C of V such that for every edge, at least one of its endpoints should be included in C. Like many other graph theoretic problems this problem is also known to be NP-hard. In this paper, we propose a genetic algorithm called LeafGA for MVC problem and show the performance of the proposed algorithm by applying it to several published benchmark graphs.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2004.03b
• /
• pp.425-432
• /
• 2004

In this paper, the results of the numerical analysis for the minimum depth of soil cover have been compared with those of currently suggested codes. Based on this comparison, the minimum depth of soil cover for the structures with long spans was suggested. Results showed that the actual depth of the soil cover required against soil failure over a circular and low-profile arch structure does not vary significantly with the size of the span and for the circular structure, the minimum depth of the soil cover was about 1.5m, and for the low-profile arch structures, below about 1.6m. And the previously established code in which the minimum depth of soil cover is defined to linearly increase with the increase in the span (CHBDC, 2001) was very conservative. For the structure with the relieving slab, the maximum live load thrust was reduced by about 36 percent and the maximum moment about 81 percent. The numerical analysis gave more conservative estimation of the live-load thrusts than the other design methods.

• Journal of the Korean Geotechnical Society
• /
• v.20 no.5
• /
• pp.67-78
• /
• 2004

Soil-steel bridges are made of flexible corrugated steel plates buried in the well-compacted granular soil. One kind of possible collapses of these structures could be initiated by shear or tension failure in the soil cover subjected to vehicle loads. Current design codes provide the requirements for the minimum depth of the soil cover to avoid problems associated with soil cover failures. However, these requirements were developed for short span (less than 7.7 m) structures which are made of unstiffened plates of standard corrugation (150$\times$50 m). Numerical analyses were carried out to investigate the behavior of long span soil steel bridges according to thickness of the soil cover. The span of structures were up to 20 m and deep corrugated plates (381$\times$140 m) were used. The analysis showed that the minimum cover depth of 1.5 m could be sufficient to prevent the soil cover failure in the structures with a span exceeding 10 m. Additional analyses were performed to verify the reinforcement effect of the concrete relieving slab which can be a special feature to reduce the live-load effects. Analyses revealed that the bending moment of the conduit wall with a relieving slab was less than 20% of that without a relieving slab in a case of shallow soil cover conditions.

• Journal of the Korean GEO-environmental Society
• /
• v.15 no.7
• /
• pp.23-30
• /
• 2014

This paper deals with the characteristics of deformation of the underground corrugated steel plate culverts constructed in the areas where the minimum depth of within 1.5 m soil cover is not secured in the bottom of highways. The underground corrugated steel plate culverts at shallow depth are often designed and constructed with the consideration of the minimum depth of soil cover according to the design standards, which was made in order to minimize any deformation. Additionally, if under unfavorable conditions, slabs are set up for stress relaxation to disperse and minimize the weight of loads transferred to the corrugated steel plate culverts. Nevertheless, if the underground corrugated steel plate culverts are built in areas where the minimum depth of soil cover inevitably cannot be secured, there may occur some deformation. In this paper, a research was carried out to identify the characteristics of deformation in areas where the minimum depth of soil cover is not secured. The result shows that there existed the deterioration of pavement and in its smoothness around the corners of slabs for stress relaxation. To this end, this paper studied the structural stability of the underground corrugated steel plate culverts established in the areas with no minimum depth of soil cover secured, with the consideration of causes and solutions of pavement deterioration.

• Journal of the Chungcheong Mathematical Society
• /
• v.19 no.4
• /
• pp.403-408
• /
• 2006

A pebbling move on a connected graph G is taking two pebbles off of one vertex and placing one of them on an adjacent vertex. The domination cover pebbling number ${\psi}(G)$ is the minimum number of pebbles required so that any initial configuration of pebbles can be transformed by a sequence of pebbling moves so that the set of vertices that contain pebbles forms a domination set of G. We determine the domination cover pebbling number for fans, fuses, and pseudo-star.

• Journal of Forest and Environmental Science
• /
• v.39 no.4
• /
• pp.235-245
• /
• 2023

Forest fuel moisture content is a crucial factor influencing the combustion rate and fuel consumption during forest fires, significantly impacting the occurrence and spread of wildfires. In this study, meteorological data were gathered using a meteorological measuring device (HOBO data logger) installed in the south and north slopes of Kangwon National University Forest, as well as on bare land outside the forest, from November 1, 2021, to October 31, 2022. The objective was to analyze the relationship between meteorological data and fuel moisture content. Fuel moisture content from the ground cover on the south and north slopes was collected. Fallen leaves on the ground were utilized, with a focus on broad-leaved trees (Prunus serrulata, Quercus dentata, Quercus mongolica, and Castanea crenata) and coniferous trees (Pinus densiflora and Pinus koraiensis), categorized by species. Additionally, correlation analysis with fuel moisture content was conducted using temperature (average, maximum, and minimum), humidity (average, minimum), illuminance (average, maximum, and minimum), and wind speed (average, maximum, and minimum) data collected by meteorological measuring devices in the study area. The results indicated a significant correlation between meteorological factors such as temperature, humidity, illuminance, and wind speed, and the moisture content of fuels. Notably, exceptions were observed for the moisture content of the on the north slope and that of the ground cover of Prunus serrulata and Castanea crenata.

• Computers and Concrete
• /
• v.3 no.2_3
• /
• pp.145-161
• /
• 2006

This article involves architecting prototype-fuzzy expert system for designing the nominal cover thickness by means of fuzzy inference for quantitatively representing the environment affecting factor to reinforced concrete in chloride-induced corrosion environment. In this work, nominal cover thickness to reinforcement in concrete was determined by the sum of minimum cover thickness and tolerance to that defined from skill level, constructability and the significance of member. Several variables defining the quality of concrete and environment affecting factor (EAF) including relative humidity, temperature, cyclic wet and dry, and the distance from coast were treated as fuzzy variables. To qualify EAF the environment conditions of cycle degree of wet-dry, relative humidity, distance from coast and temperature were used as input variables. To determine the nominal cover thickness a qualified EAF, concrete grade, and watercement ratio were used. The membership functions of each fuzzy variable were generated from the engineering knowledge and intuition based on some references as well as some international codes of practice.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.85-93
• /
• 2011

The Vertex Coloring Problem hasn't been solved in polynomial time, so this problem has been known as NP-complete. This paper suggests linear time algorithm for Vertex Coloring Problem (VCP). The proposed algorithm is based on assumption that we can't know a priori the minimum chromatic number ${\chi}(G)$=k for graph G=(V,E) This algorithm divides Vertices V of graph into two parts as independent sets $\overline{C}$ and cover set C, then assigns the color to $\overline{C}$. The element of independent sets $\overline{C}$ is a vertex ${\upsilon}$ that has minimum degree ${\delta}(G)$ and the elements of cover set C are the vertices ${\upsilon}$ that is adjacent to ${\upsilon}$. The reduced graph is divided into independent sets $\overline{C}$ and cover set C again until no edge is in a cover set C. As a result of experiments, this algorithm finds the ${\chi}(G)$=k perfectly for 26 Graphs that shows the number of selecting ${\upsilon}$ is less than the number of vertices n.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.555-558
• /
• 2006

In recent years, urban development has expanded rapidly in Nawabshah City of Pakistan. A major effect associated with this population trend is transformation of the landscape from natural cover types to increasingly impervious urban land. The core objective of this study are to provide time-series information to define and measure the urban land cover changes of Nawabshah, Pakistan between the years 1992 and 2002, and to examine related urbanization impacts on air quality of the study area. Two multi-temporal Landsat images acquired in 1992 and 2002 together with standard topographical maps to measure land cover changes were used in this study. The image processing and data manipulation were conducted using algorithms supplied with the ERDAS Imagine software. An unsupervised classification approach, which uses a minimum spectral distance to assign pixels to clusters, was used with the overall accuracy ranging from 84 percent to 92 percent. Land cover statistics demonstrate that during the study period (1992-2002) extensive transformation of barren and vegetated lands into urban land have taken place in Nawabshah City. Results revealed that land cover changes due to urbanization has not only contaminated the air quality of the study area but also raised the health concerns for the local residents.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.1-11
• /
• 2010

The conditional covering problem is an important variation of well studied set covering problem. In the set covering problem, the problem is to find a minimum cardinality vertex set which will cover all the given demand points. The conditional covering problem asks to find a minimum cardinality vertex set that will cover not only the given demand points but also one another. This problem is NP-complete for general graphs. In this paper, we present an efficient algorithm to solve the conditional covering problem on interval graphs with n vertices which runs in O(n)time.