• Journal of applied mathematics & informatics
• /
• 제22권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.

• 한국통신학회논문지
• /
• 제21권6호
• /
• pp.1390-1397
• /
• 1996

In this paper, in case of segmenting an image by a fuzzy entropy, an image segmentation algorithm is derived under an extended fuzzy entropy including the probabilistic including the probabilistic information in order to cover the toal uncertainty of information contained in fuzzy sets. By describing the image with fuzzysets, the total uncertainty of a fuzzy set consists of the uncertain information arising from its fuzziness and the uncertain information arising from the randomness in its ordinary set. To optimally segment all the boundary regions in the image, the total entropy function is computed by locally applving the fuzzy and Shannon entropies within the width of the fuzzy regions and the image is segmented withthe global maximum andlocal maximawhich correspond to the boundary regions. Comtional one by detecting theboundary regions more than 5 times.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.402-408
• /
• 2002

Multicast technology allows the transmission of data from one source node to a selected group of destination nodes. Multicast routes typically use trees, called multicast routing trees, to minimize resource usage such as cost and bandwidth by sharing links. Moreover, the quality of service (QoS) is satisfied by distributing data along a path haying no more than a given number of arcs between the root node of a session and a terminal node of it in the routing tree. Thus, a multicast routing tree for a session can be represented as a hop constrained Steiner tree. In this paper, we consider the hop-constrained multicast route packing problem with bandwidth reservation. Given a set of multicast sessions, each of which has a hop limit constraint and a required bandwidth, the problem is to determine a set of multicast routing trees in an arc-capacitated network to minimize cost. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a modified cover inequality is used to strengthen the integer programming formulation.

• 정보처리학회논문지A
• /
• 제8A권1호
• /
• pp.56-62
• /
• 2001

This paper presents a neural network based variable structure control scheme for nonlinear systems. In this scheme, a set of local variable structure control laws are designed on the basis of the linear models about preselected representative points which cover the range of the system operation of interest. From the combination of the set of local variable structure control laws, neural networks infer the approximate control input in between the operating points. The neural network based variable structure control alleviates the effects of model uncertainties, which cannot be compensated by the control techniques using feedback linearization. It also relaxes the discontinuity in the system’s behavior that appears when the control schemes based on the family of the linear models are applied to nonlinear systems. Simulation results of a ball and beam system, to which feedback linearization cannot be applied, demonstrate the feasibility of the proposed method.

• 한국의류학회지
• /
• 제31권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.

• 토지주택연구
• /
• 제11권1호
• /
• pp.109-116
• /
• 2020

This study aims to establish an approach to assess urban flood vulnerability by identifying social characteristics such as the road transportation and the vulnerable groups. Assessment procedures comprise three steps as: (1) composing the assessment criteria to reflect the urban characteristics; (2) calculating the weight; and (3) evaluating the vulnerability. The criteria were adopted by Delphi survey technique. Four criteria as land cover, residents, vulnerable areas, and disaster response were adopted in the current study. To determine the weight set of criteria, subjective and objective methods were combined. The weight set was determined using the combined method which reflects the Delphi method and Entropy analysis. In the process of data-based construction, GIS tools wwere used to extract administrative unit materials such as land cover, road status, and slope. Data on population and other social criteria were collected through the National Statistical Office and the Seoul Metropolitan statistical data. TOPSIS (Technique for Order of Preference by Similarity to Ideal Solution) technique, which uses materials from cell units in order to rank the closest distance to the best case and the farthest distance from the worst case by calculating the distances to the area of assessment, was applied to assess. The study area was the Dorimcheon basin, a flood special treatment area of Seoul city. The results from the current study indicates that the established urban flood vulnerability assessment approach is able to predict the inherent vulnerable factors in urban regions and to propose the area of priority control.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권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.

• Archives of Plastic Surgery
• /
• 제45권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.

• 대한수학회논문집
• /
• 제27권4호
• /
• pp.665-668
• /
• 2012

For a given graph G we consider a set S(G) of all symmetric matrices A = [$a_{ij}$] whose nonzero entries are placed according to the location of the edges of the graph, i.e., for $i{\neq}j$, $a_{ij}{\neq}0$ if and only if vertex $i$ is adjacent to vertex $j$. The minimum rank mr(G) of the graph G is defined to be the smallest rank of a matrix in S(G). In general the computation of mr(G) is complicated, and so is that of the maximum multiplicity MaxMult(G) of an eigenvalue of a matrix in S(G) which is equal to $n$ - mr(G) where n is the number of vertices in G. However, for trees T, there is a recursive formula to compute MaxMult(T). In this note we show that this recursive formula for MaxMult(T) also computes the path cover number $p$(T) of the tree T. This gives an alternative proof of the interesting result, MaxMult(T) = $p$(T).

• Investigative Magnetic Resonance Imaging
• /
• 제1권1호
• /
• pp.75-78
• /
• 1997

인체의 하지 MR Angiography(MRA)를 위한 하지전용 dual birdcage RF 코일을 설계, 제작하였으며 Volunteer실험을 하여 그 유용성을 보였다. 제안된 코일은 인체의 하지 전체의 영상을 위한 코일로 허벅지로부터 종아리까지 전체를 두 번의 영상을 통해 cover하게 된다. 기존의 방식대로 한 개의 코일을 옮기며 두 번 촬영할 경우 코일을 도중에 옮기게 외어 다리를 움직일 수밖에 없어 두 set의 영상이 완전히 연결이 되지 않지만 제안된 코일의 경우 침대만 움직이게 되므로 이런 문제가 없게 된다. 제안된 코일의 성능은 Volunteer의 하지 MRI 및 MRA를 얻어 확인했으며 임상적으로 매우 유용한 것으로 확인되었다.