• Title/Summary/Keyword: MAX-CUT

Search Result 96, Processing Time 0.02 seconds

Max k-Cut based Clustering Algorithm for Wireless Sensor Networks (무선 센서 네트워크에서의 Max k-Cut기반의 클러스터링 알고리즘)

  • Kim, Jae-Hwan;Chang, Hyeong-Soo
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.2
    • /
    • pp.98-107
    • /
    • 2009
  • In this paper, we propose a novel centralized energy-efficient clustering algorithm, called "MCCA : Max k-Cut based Clustering Algorithm for Wireless Sensor Networks." The algorithm does not use location information and constructs clusters via a distributive Max k-Cut based cluster-head election method, where only relative and approximate distance information with neighbor nodes is used and nodes, not having enough energy, are excluded for cluster-heads for a specific period. We show that the energy efficiency performance of MCCA is better than that of LEACH, EECS and similar to BCDCP's by simulation studies.

Inapproximability of the Max-cut Problem with Negative Weights

  • Hong, Sung-Pil
    • Management Science and Financial Engineering
    • /
    • v.14 no.1
    • /
    • pp.87-90
    • /
    • 2008
  • We show that when a max-cut problem is allowed native-weight edges, to decide if the problem has a cut of a positive weight is NP-hard. This implies that there is no polynomial time algorithm which guarantees a cut whose objective value is no less than $1/p(<I>)$ times the optimum for any polynomially computable polynomial p, where denotes the encoding length of an instance I.

A Spanning Tree-based Representation and Its Application to the MAX CUT Problem (신장 트리 기반 표현과 MAX CUT 문제로의 응용)

  • Hyun, Soohwan;Kim, Yong-Hyuk;Seo, Kisung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.12
    • /
    • pp.1096-1100
    • /
    • 2012
  • Most of previous genetic algorithms for solving graph problems have used a vertex-based encoding. We proposed an edge encoding based new genetic algorithm using a spanning tree. Contrary to general edge-based encoding, a spanning tree-based encoding represents only feasible partitions. As a target problem, we adopted the MAX CUT problem, which is well known as a representative NP-hard problem, and examined the performance of the proposed genetic algorithm. The experiments on benchmark graphs are executed and compared with vertex-based encoding. Performance improvements of the spanning tree-based encoding on sparse graphs was observed.

A Bottleneck Search Algorithm for Digraph Using Maximum Adjacency Merging Method (최대 인접 병합 방법을 적용한 방향 그래프의 병목지점 탐색 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.5
    • /
    • pp.129-139
    • /
    • 2012
  • Given digraph network $D=(N,A),n{\in}N,a=c(u,v){\in}A$ with source s and sink t, the maximum flow from s to t is determined by cut (S, T) that splits N to $s{\in}S$ and $t{\in}T$ disjoint sets with minimum cut value. The Ford-Fulkerson (F-F) algorithm with time complexity $O(NA^2)$ has been well known to this problem. The F-F algorithm finds all possible augmenting paths from s to t with residual capacity arcs and determines bottleneck arc that has a minimum residual capacity among the paths. After completion of algorithm, you should be determine the minimum cut by combination of bottleneck arcs. This paper suggests maximum adjacency merging and compute cut value method is called by MA-merging algorithm. We start the initial value to S={s}, T={t}, Then we select the maximum capacity $_{max}c(u,v)$ in the graph and merge to adjacent set S or T. Finally, we compute cut value of S or T. This algorithm runs n-1 times. We experiment Ford-Fulkerson and MA-merging algorithm for various 8 digraph. As a results, MA-merging algorithm can be finds minimum cut during the n-1 running times with time complexity O(N).

Improving Diagnostic Accuracy for Malignant Nodes and N Staging in Non-Small Cell Lung Cancer Using CT-Corrected FDG-PET (비소세포폐암에서 CT-보정 양전자단층촬영술을 이용한 악성 림프절 평가 및 N 병기 결정 성적 향상)

  • Lee, Eun-Jeong;Choi, Joon-Young;Lee, Kyung-Soo;Chung, Hyun-Woo;Lee, Su-Jin;Cho, Young-Seok;Choi, Yong;Choe, Yearn-Seong;Lee, Kyung-Han;Kwon, O-Jung;Shim, Young-Mog;Kim, Byung-Tae
    • The Korean Journal of Nuclear Medicine
    • /
    • v.39 no.4
    • /
    • pp.231-238
    • /
    • 2005
  • Purpose: We investigated prospectively whether the interpretation considering the patterns of FDG uptake and the findings of unenhanced CT for attenuation correction can improve the diagnostic accuracy for assessing malignant lymph node (LN) and N stage in non-small cell lung cancor (NSCLC) using CT-corrected FDG-PET (PET/CT). Materials & Methods: Subjects were 91 NSCLC patients (M/F 62/29, age: $60{\pm}9$ yr) who underwent PET/CT before in dissection. We evaluated the maximum SUV (maxSUV), patterns of FDG uptake, short axis diameter, and calcification of LN showing abnormally increased FDG uptake. Then we investigated criteria improving the diagnostic accuracy and correlated results with postoperative pathology. In step 1, in was classified as benign or malignant based on maxSUV only. In step 2, LN was regarded as benign if it had lower maxSUV than the cut-off value of step 1 or it had calcification irrespective of its maxSUV. In step 3, LN regarded as malignant in step 2 was classified as benign if they had indiscrete margin of FDG uptake. Results: Among 432 LN groups surgically resected (28 malignant, 404 benign), 71 showed abnormally increased FDG uptake. We determined the cut-off as maxSUV=3.5 using ROC curve analysis. The sensitivity, specificity, and accuracy for assessing malignant LN were 64.3%, 86.9%, 85.4% in step 1, 64.3%, 95.0%, 93.1% in step 2, and 57.1%, 98.0%, 95.4% in step3, respectively. The accuracy for assessing N stage was 64.8% in step 1, 80.2% in step 2, and 85.7% in step 3. Conclusion: interpreting PET/CT, consideration of calcification and shape of the FDG uptake margin along with maxSUV can improve the diagnostic accuracy for assessing malignant involvement and N stage of hilar and mediastinal LNs in NSCLC.

Analysis of characteristics of PHEMT's with gate recess etching method (게이트 리세스 식각 방법에 따른 PHEMT 특성 변화)

  • 이한신;임병옥;김성찬;신동훈;전영훈;이진구
    • Proceedings of the IEEK Conference
    • /
    • 2002.06b
    • /
    • pp.249-252
    • /
    • 2002
  • we have studied the characteristics of PHEMT's with gate recess etching method. The DC characterization of PHTMT fabricated with the wide single recess methods is a maximum drain current density of 319.4 ㎃/mm and a peak transconductance of 336.7 ㎳/mm. The RF measurements were obtained in the frequency range of 1~50GHz. At 50GHz, 3.69dB of 521 gain were obtained and a current gain cut-off frequency(f$_{T}$) of 113 CH and a maximum frequency of oscillation(f$_{max}$) of 172 Ghz were achieved from this device. On the other hand, a maximum drain current of 367 mA/mm, a peak transconduclancc of 504.6 mS/mm, S$_{21}$ gain of 2.94 dB, a current gain cut-off frequency(f$_{T}$) of 101 CH and a maximum frequency of oscillation(f$_{max}$) of 113 fa were achieved from the PHEMT's fabricated by the .narrow single recess methods.methods.

  • PDF

Edge Detection of Characters on the Rubber Tire Image Using Fuzzy $\alpha-Cut$ Set (퍼지 $\alpha$ 컷 집합에 의한 고무 타이어 영상의 문자 윤관선 추출)

  • 김경민;박중조;박귀태
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.6
    • /
    • pp.71-80
    • /
    • 1994
  • The purpose of this paper is to explore the use of fuzzy set theory for image processing and analysis. As an application example, the fuzzy method of edge detection is proposed to extract the edges of raised characters on tires.In general, Sobel, Prewitt, Robert and LoG filters are used to detect the edge, but it is difficult to detect the edge because of ambiguity of representations, noise and general problems in the interpretation of tire image. Therefore, in his paper, the fuzzy property plane has been extracted from the spatial domain using the ramp-mapping function. And then the ideas of fuzzy MIN and MAX are applied in removing noise and enhancement of the image simultaneously. From the result of MIN and MAX procedure a new fuzzy singleton is generated by extracting the difference between adjacent membership function values. And the edges are extracted by applying fuzzy $\alpha$-cut set to the fuzzy singletion, Finally, these ideas are applied to the tire images.

  • PDF

A Fundamental Approach for Developing Deformation Strength Based on Rutting Characteristics of Asphalt Concrete (소성변형과의 상관성에 근거한 아스팔트 콘크리트의 변형강도 개발을 위한 기초연구)

  • Kim, Kwang-Woo;Lee, Moon-Sup;Kim, Jun-Eun;Choi, Sun-Ju
    • International Journal of Highway Engineering
    • /
    • v.4 no.4 s.14
    • /
    • pp.23-39
    • /
    • 2002
  • This study dealt with developing a new approach for finding properties which might represent rut resistance characteristics of asphalt mixture under static loading. Two aggregates, a normal asphalt (pen 60-80) and 5 polymer-modified asphalts were used in preparation of 12 dense-graded mixtures. Marshall mix design was used in determination of OAC and each mixture at the OAC was prepared for a newly-developed Kim test on Marshall specimen (S=10cm) and gyratory specimen (S=15cm), and for wheel tracking test. Kim test used Marshall loading frame and specimens were conditioned for 30min at $60^{\circ}C$ before loading through Kim tester an apparatus consisting of a loading column and a specimen and column holder Diameter (D) of column was 3cm and 4cm with each column having different radius (r) of round cut at the bottom. The static load was applied at 50mm/min in axial direction of the specimen, not in diametral direction. The maximum load ($P_{max}$) and vertical deformation (y) at $P_{max}$ point were obtained from the test. A strength value was calculated based on the $P_{max}$ r, D and y by using the equation $K_D = 4P_{max}/{\pi}(D-2(r-\sqrt{2ry-y^2}))^2$ and is defined as the deformation strength ($kgf/cm^2$). The values of $P_{max}$/y and $K_I=K_D/y$ were also calculated. In general the leading column diameter and radius of round cut were significant factors affecting $K_D$ and $P_{max}$ values while specimen diameter was not. The statistical analyses showed the $K_D$ had the best correlation with rut depth and dynamic stability. The next best correlation was found from $P_{max}$ which was followed by $P_{max}$/y and $K_I$ in order.

  • PDF

Pattern classification on the basis of unnecessary attributes reduction in fuzzy rule-based systems (퍼지규칙 기반 시스템에서 불필요한 속성 감축에 의한 패턴분류)

  • Son, Chang-Sik;Kim, Doo-Ywan
    • Journal of Internet Computing and Services
    • /
    • v.8 no.3
    • /
    • pp.109-118
    • /
    • 2007
  • This paper proposed a method that can be simply analyzed instead of the basic general Fuzzy rule that its insufficient characters are cut out. Based on the proposed method. Rough sets are used to eliminate the incomplete attributes included in the rule and also for a classification more precise; the agreement of the membership function's output extracted the maximum attributes. Besides, the proposed method in the simulation shows that in order to verify the validity, compare the max-product result of fuzzy before and after reducing rule hosed on the rice taste data; then, we can see that both the max-product result of fuzzy before and after reducing rule are exactly the same; for a verification more objective, we compared the defuzzificated real number section.

  • PDF