• Title/Summary/Keyword: SET K-cover

Search Result 214, Processing Time 0.371 seconds

Analysis of Land Cover Change of Coastal Sand Dunes in Yangyang Using Aerial Photographs (항공사진을 활용한 양양 해안사구 지역의 토지피복 변천 분석)

  • Han, Gab-Soo;Kim, Kyeong-Nam
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.13 no.2
    • /
    • pp.107-118
    • /
    • 2010
  • The purpose of this study was to set the boundary of the coastal sand dunes and to analyze the change characteristics of land cover types using aerial photographs on Osan and Dongho coastal sand dunes in Yangyang. The boundaries of sand dunes were established using digital soil map, and land cover maps were made for each year using aerial photographs. As results of analysis, both beach and farmland areas have been decreased, since 1974 and forest area was relatively increased due to planting and forest growth. Facilities and bare land have been greatly increased since 1992. Loss of wetland, and beach due to these changes had an impact on the ecosystem destruction of sand dunes.

EDGE COVERING COLORING OF NEARLY BIPARTITE GRAPHS

  • Wang Ji-Hui;Zhang Xia;Liu Guizhen
    • Journal of applied mathematics & informatics
    • /
    • v.22 no.1_2
    • /
    • pp.435-440
    • /
    • 2006
  • Let G be a simple graph with vertex set V(G) and edge set E(G). A subset S of E(G) is called an edge cover of G if the subgraph induced by S is a spanning subgraph of G. The maximum number of edge covers which form a partition of E(G) is called edge covering chromatic number of G, denoted by X'c(G). It is known that for any graph G with minimum degree ${\delta},\;{\delta}-1{\le}X'c(G){\le}{\delta}$. If $X'c(G) ={\delta}$, then G is called a graph of CI class, otherwise G is called a graph of CII class. It is easy to prove that the problem of deciding whether a given graph is of CI class or CII class is NP-complete. In this paper, we consider the classification of nearly bipartite graph and give some sufficient conditions for a nearly bipartite graph to be of CI class.

Neighborhood coreness algorithm for identifying a set of influential spreaders in complex networks

  • YANG, Xiong;HUANG, De-Cai;ZHANG, Zi-Ke
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.2979-2995
    • /
    • 2017
  • In recent years, there has been an increasing number of studies focused on identifying a set of spreaders to maximize the influence of spreading in complex networks. Although the k-core decomposition can effectively identify the single most influential spreader, selecting a group of nodes that has the largest k-core value as the seeds cannot increase the performance of the influence maximization because the propagation sphere of this group of nodes is overlapped. To overcome this limitation, we propose a neighborhood coreness cover and discount heuristic algorithm named "NCCDH" to identify a set of influential and decentralized seeds. Using this method, a node in the high-order shell with the largest neighborhood coreness and an uncovered status will be selected as the seed in each turn. In addition, the neighbors within the same shell layer of this seed will be covered, and the neighborhood coreness of the neighbors outside the shell layer will be discounted in the subsequent round. The experimental results show that with increases in the spreading probability, the NCCDH outperforms other algorithms in terms of the affected scale and spreading speed under the Susceptible-Infected-Recovered (SIR) and Susceptible-Infected (SI) models. Furthermore, this approach has a superior running time.

A Note on S-closed Space and RC-convergence. (S-closed 공간(空間)과 RC 수렴(收斂)에 관하여)

  • Han, Chun-Ho
    • Journal of Industrial Technology
    • /
    • v.5
    • /
    • pp.47-49
    • /
    • 1985
  • Semi-open을 기초로 하여 만들어진 S-closed 공간의 일반적인 성질을 살펴보고 S-closed 공간과 (maximum) filterbase와의 관계를 조사하였다. 이를 바탕으로 regular closed된 cover C, regular open set인 족(族) C, rc-accumulation, (maximum) filterbase에서의 관계(關係)를 살펴 보았다. Mapping theory에서 almost-open almost-continuous map f가 almost continuous되는 것을 보였다.

  • PDF

Evaluation of Diecasting Mold Cooling Ability by Decompression Cooling System (감압냉각장치를 이용한 다이캐스팅 금형의 냉각성능평가)

  • Kim, Eok-Soo;Park, Joo-Yul;Kim, Yong-Hyun;Son, Gi-Man;Lee, Kwang-Hak
    • Journal of Korea Foundry Society
    • /
    • v.29 no.5
    • /
    • pp.238-243
    • /
    • 2009
  • This study has been carried out to investigate the cooling ability improvement of diecasting mold by decompression cooling system. The decompression cooling system was applied to the new/used oil pump cover molds. The temperature of the surface mold applied the decompression cooling system fell to 15 degrees, especially in case of the used mold. The defect ratio of the oil pump cover manufactured by decompression cooling system has decreased from 2.8 percent to 0.2 percent. According to the results of the cooling ability improvement of diecasting mold by decompression cooling system, the decompression degree and supply pressure were set up the control item to apply the decompression cooling system to the diecasting mold in the industry field.

Impact of IPCC RCP Scenarios on Streamflow and Sediment in the Hoeya River Basin (대표농도경로 (RCP) 시나리오에 따른 회야강 유역의 미래 유출 및 유사 변화 분석)

  • Hwang, Chang Su;Choi, Chul Uong;Choi, Ji Sun
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.22 no.3
    • /
    • pp.11-19
    • /
    • 2014
  • This study is analyze future climate and land cover change affects behaviors for amount of streamflow and sediment discharge within basin. We used the climate forecast data in RCP 4.5 and 8.5 (2011-2100) which is opposite view for each other among RCP scenarios that are discussed for 5th report for IPCC. Land cover map built based on a social economic storyline in RCP 4.5/8.5 using Logistic Regression model. In this study we set three scenarios: one scenario for climate change only, one for land cover change only, one for Last both climate change and land cover change. It simulated amount of streamflow and sediment discharge and the result showed a very definite change in the seasonal variation both of them. For climate change, spring and winter increased the amount of streamflow while summer and fall decreased them. Sediment showed the same pattern of change steamflow. Land cover change increases the amount of streamflow while it decreases the amount of sediment discharge, which is believed to be caused by increase of impervious Surface due to urbanization. Although land cover change less affects the amount of streamflow than climate change, it may maximize problems related to the amount of streamflow caused by climate change. Therefore, it's required to address potential influence from climate change for effective water resource management and prepare suitable measurement for water resource.

A novel technique for large and ptotic breast reconstruction using a latissimus dorsi myocutaneous flap set at the posterior aspect, combined with a silicone implant, following tissue expander surgery

  • Ishii, Naohiro;Ando, Jiro;Shimizu, Yusuke;Kishi, Kazuo
    • Archives of Plastic Surgery
    • /
    • v.45 no.5
    • /
    • pp.484-489
    • /
    • 2018
  • Large and ptotic breast reconstruction in patients who are not candidates for a transverse rectus abdominalis myocutaneous flap and revision surgery for the contralateral breast remains challenging. We developed a novel breast reconstruction technique using a latissimus dorsi myocutaneous (LD m-c) flap set at the posterior aspect of the reconstructed breast, combined with an anatomical silicone breast implant (SBI), following tissue expander surgery. We performed the proposed technique in four patients, in whom the weight of the resected tissue during mastectomy was >500 g and the depth of the inframammary fold (IMF) was >3 cm. After over-expansion of the lower portion of the skin envelope by a tissue expander, the LD m-c flap was transferred to cover the lower portion of the breast defect and to achieve a ptotic contour, with the skin paddle set at the posterior aspect of the reconstructed breast. An SBI was then placed in the rest of the breast defect after setting the LD m-c flap. No major complications were observed during the follow-up period. The proposed technique resulted in symmetrical and aesthetically satisfactory breasts with deep IMFs, which allowed proper fitting of the brassiere, following large and ptotic breast reconstruction.

Pedicled Anterolateral Thigh Flaps for Reconstruction of Recurrent Trochanteric Pressure Ulcer

  • Bahk, Sujin;Rhee, Seung Chul;Cho, Sang Hun;Eo, Su Rak
    • Archives of Reconstructive Microsurgery
    • /
    • v.24 no.1
    • /
    • pp.32-36
    • /
    • 2015
  • The reconstruction of recurrent pressure sores is challenging due to a limited set of treatment options and a high risk of flap loss. Successful treatment requires scrupulous surgical planning and a multidisciplinary approach. Although the tensor fascia lata flap is regarded as the standard treatment of choice-it provides sufficient tissue bulk for a deep trochanteric sore defect-plastic surgeons must always consider the potential of recurrence and accordingly save the second-best tissues. With the various applications of anterolateral thigh (ALT) flaps in the reconstructive field, we report two cases wherein an alternative technique was applied, whereby pedicled ALT fasciocutaneous island flaps were used to cover recurrent trochanteric pressure sores. The postoperative course was uneventful without any complications. The flap provided a sound aesthetic result without causing a dog-ear formation or damaging the lower-leg contour. This flap was used as an alternative to myocutaneous flaps, as it can cover a large trochanteric defect, recurrence is minimized, and the local musculature and lower-leg contour are preserved.

A Study on the Jacket Pattern for Elderly Women (노년여성을 위한 재킷패턴 연구)

  • Bae, Ju-Hyeong;Kim, In-Sook
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.31 no.7
    • /
    • pp.1008-1019
    • /
    • 2007
  • The purpose of this study was to develop an appropriate jacket pattern for elderly women over sixty years old, providing a good fit and appearance. Results were as follows: The length of the jacket was made long enough to cover the area 22.0cm below the waistline. The waist back length was made 1.7cm longer than the actual size of the waist back length. The armhole length was made 0.5cm longer than B/4, enhacing the appearance and functionality while allowing freer movement of the arms. As for the front and back interscye breadths, the front interscye breadth was made 1.7cm larger than the actual size while the back interscye breadth was only 1.0cm larger, providing the front interscye breadth more space. The bust breadth was made 10.0cm larger than the bust circumference measure(B/4+2.5cm), the waist breadth was made 6.0cm larger than the waist circumference measure(W/4+1.5cm), The hip breadth was made 12.0cm larger than the him circumference measure(H/4+3.0cm). The sleeve length was made 3.0cm larger than the arm length measure, as the sleeve length of a jacket is usually long enough to cover the ulnar styloid. The sleeve width was made 5.0cm larger than the upper arm circumference measure, as the upper arm circumference measure of the model pattern was too large than necessary, worsening the overall appearance. The sleeve cap height was set at AH/4+4.7cm. The wrist circumference of 27.0cm was set, allowing 2/3 and 1/3 for the large sleeve and small sleeve respectively.

The Four Color Algorithm (4-색 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.5
    • /
    • pp.113-120
    • /
    • 2013
  • This paper proposes an algorithm that proves an NP-complete 4-color theorem by employing a linear time complexity where $O(n)$. The proposed algorithm accurately halves the vertex set V of the graph $G=(V_1,E_1)$ into the Maximum Independent Set (MIS) $\bar{C_1}$ and the Minimum Vertex Cover Set $C_1$. It then assigns the first color to $\bar{C_1}$ and the second to $\bar{C_2}$, which, along with $C_2$, is halved from the connected graph $G=(V_2,E_2)$, a reduced set of the remaining vertices. Subsequently, the third color is assigned to $\bar{C_3}$, which, along with $C_3$, is halved from the connected graph $G=(V_3,E_3)$, a further reduced set of the remaining vertices. Lastly, denoting $C_3$ as $\bar{C_4}$, the algorithm assigns the forth color to $\bar{C_4}$. The algorithm has successfully obtained the chromatic number ${\chi}(G)=4$ with 100% probability, when applied to two actual map and two planar graphs. The proposed "four color algorithm", therefore, could be employed as a general algorithm to determine four-color for planar graphs.