• Title/Summary/Keyword: Perfect matching

Search Result 58, Processing Time 0.03 seconds

Matching Preclusion Problem in Restricted HL-graphs and Recursive Circulant $G(2^m,4)$ (제한된 HL-그래프와 재귀원형군 $G(2^m,4)$에서 매칭 배제 문제)

  • Park, Jung-Heum
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.2
    • /
    • pp.60-65
    • /
    • 2008
  • The matching preclusion set of a graph is a set of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The matching preclusion number is the minimum cardinality over all matching preclusion sets. We show in this paper that, for any $m{\geq}4$, the matching preclusion numbers of both m-dimensional restricted HL-graph and recursive circulant $G(2^m,4)$ are equal to degree m of the networks, and that every minimum matching preclusion set is the set of edges incident to a single vertex.

SOME RESULTS ON FRACTIONAL n-FACTOR-CRITICAL GRAPHS

  • Yu, Jiguo;Bian, Qiuju;Liu, Guizhen;Wang, Na
    • Journal of applied mathematics & informatics
    • /
    • v.25 no.1_2
    • /
    • pp.283-291
    • /
    • 2007
  • A simple graph G is said to be fractional n-factor-critical if after deleting any n vertices the remaining subgraph still has a fractional perfect matching. For fractional n-factor-criticality, in this paper, one necessary and sufficient condition, and three sufficient conditions related to maximum matching, complete closure are given.

SOME RESULTS ON BINDING NUMBER AND FRACTIONAL PERFECT MATCHING

  • Zhu, Yan;Liu, Guizhen
    • Journal of applied mathematics & informatics
    • /
    • v.25 no.1_2
    • /
    • pp.339-344
    • /
    • 2007
  • The relationships between binding number and fractional edge (vertex)-deletability or fractional k-extendability of graphs are studied. Furthermore, we show that the result about fractional vertex-deletability are best possible.

Deterministic Private Matching with Perfect Correctness (정확성을 보장하는 결정적 Private Matching)

  • Hong, Jeong-Dae;Kim, Jin-Il;Cheon, Jung-Hee;Park, Kun-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.10
    • /
    • pp.502-510
    • /
    • 2007
  • Private Matching is a problem of computing the intersection of private datasets of two parties. One could envision the usage of private matching for Insurance fraud detection system, Do-not-fly list, medical databases, and many other applications. In 2004, Freedman et at. [1] introduced a probabilistic solution for this problem, and they extended it to malicious adversary model and multi-party computation. In this paper, we propose a new deterministic protocol for private matching with perfect correctness. We apply this technique to adversary models, achieving more reliable and higher speed computation.

Reactive- Loaded Interstitial Antenna (리엑턴스가 장하된 인체에 사용되는 삽입형 안테나)

  • Ahn, Hee-Ran;Myung, Noh-Hoon;Kim, Bumman
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.9
    • /
    • pp.979-984
    • /
    • 2003
  • A reactive-loaded interstitial antenna(RLIA) is proposed for 2.45 GHz. It basically consists of a coaxial cable and a reactive load(RL). The RL is tipped at the end of the antenna and contributes to almost perfect matching and desirable heating area. For the almost perfect matching, a matching technique based on transmission line theory is suggested and the RLIA immersed in muscle phantom is designed, fabricated, measured and compared. The measured return loss of the RLIA is - 28.377 dB, which may be considered the best among those reported. Due to the excellent matching performance, the RLIA can also be applied for the treatment of deep-seated tumor or cancer with only one RLIA.

ON SOMBOR INDEX OF BICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER

  • XIAOLING, SUN;JIANWEI, DU
    • Journal of Applied and Pure Mathematics
    • /
    • v.4 no.5_6
    • /
    • pp.249-262
    • /
    • 2022
  • Nowadays, it is an important task to find extremal values on any molecular descriptor with respect to different graph parameters. The Sombor index is a novel topological molecular descriptor introduced by Gutman in 2021. The research on determining extremal values for the Sombor index of a graph is very popular recently. In this paper, we present the maximum Sombor index of bicyclic graphs with given matching number. Furthermore, we identify the corresponding extremal bicyclic graphs.

Auto-segmentation of head and neck organs at risk in radiotherapy and its dependence on anatomic similarity

  • Ayyalusamy, Anantharaman;Vellaiyan, Subramani;Subramanian, Shanmuga;Ilamurugu, Arivarasan;Satpathy, Shyama;Nauman, Mohammed;Katta, Gowtham;Madineni, Aneesha
    • Radiation Oncology Journal
    • /
    • v.37 no.2
    • /
    • pp.134-142
    • /
    • 2019
  • Purpose: The aim is to study the dependence of deformable based auto-segmentation of head and neck organs-at-risks (OAR) on anatomy matching for a single atlas based system and generate an acceptable set of contours. Methods: A sample of ten patients in neutral neck position and three atlas sets consisting of ten patients each in different head and neck positions were utilized to generate three scenarios representing poor, average and perfect anatomy matching respectively and auto-segmentation was carried out for each scenario. Brainstem, larynx, mandible, cervical oesophagus, oral cavity, pharyngeal muscles, parotids, spinal cord, and trachea were the structures selected for the study. Automatic and oncologist reference contours were compared using the dice similarity index (DSI), Hausdroff distance and variation in the centre of mass (COM). Results: The mean DSI scores for brainstem was good irrespective of the anatomy matching scenarios. The scores for mandible, oral cavity, larynx, parotids, spinal cord, and trachea were unacceptable with poor matching but improved with enhanced bony matching whereas cervical oesophagus and pharyngeal muscles had less than acceptable scores for even perfect matching scenario. HD value and variation in COM decreased with better matching for all the structures. Conclusion: Improved anatomy matching resulted in better segmentation. At least a similar setup can help generate an acceptable set of automatic contours in systems employing single atlas method. Automatic contours from average matching scenario were acceptable for most structures. Importance should be given to head and neck position during atlas generation for a single atlas based system.

Improve Matching for Rectangular Slot Antenna by Parasitic Slots

  • Anantrasirichai, N.;Satthamsakul, S.;Rakluea, P.;Wakabayashi, T.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1676-1679
    • /
    • 2003
  • A perfect matching is the desire of antenna designers. In this paper, we improve the matching of antenna designing. In general, the efficiency of antennas has many improvements. In this paper, we choose to extend matching by adding the slots in the basic microstrip-fed rectangular slot antenna. We called it as "parasitic slots". The dominant characteristic of this addition is double efficient improvement matching and other characteristics of antenna are similar. It means that the microstrip-fed rectangular slot antenna with parasitic slots has all characteristics as same as the microstrip-fed rectangular slot antenna without parasitic slots. The antenna with parasitic slots has better matching better than the antenna without parasitic slots.

  • PDF

Compact and Wideband Coupled-Line 3-dB Ring Hybrids (Coupled Line으로 구성된 작고 넓은 대역폭을 가지는 3-dB Ring Hybrids)

  • Ahn, Hee-Ran;Kim, Jung-Joon;Kim, Bum-Man
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.19 no.8
    • /
    • pp.862-877
    • /
    • 2008
  • In this paper, two types of wideband 3-dB ring hybrids are compared and discussed to show the ring hybrid with a set of coupled-line sections better. However, the better one still has a realization problem that perfect matching can be achieved only with -3 dB coupling power. To solve the problem, a set of coupled-line sections with two shorts is synthesized using one- and two-port equivalent circuits and design equations are derived to have perfect matching, regardless of the coupling power. Based on the design equations, a modified ${\Pi}-type$ of transmission-line equivalent circuit is newly suggested. It consists of coupled-line sections with two shorts and two open stubs and can be used to reduce a transmission-line section, especially when its electrical length is greater than ${\pi}$. Therefore, the $3\;{\lambda}/4$ transmission-line section of a conventional ring hybrid can be reduced to less than ${\pi}/2$. To verify the modified ${\Pi}-type$ of transmission- line equivalent circuit, two kinds of simulations are carried out; one is fixing the electrical length of the coupled-line sections and the other fixing its coupling coefficient. The simulation results show that the bandwidths of resulting small transmission lines are strongly dependent on the coupling power. Using modified and conventional ${\Pi}-types$ of transmission-line equivalent circuits, a small ring hybrid is built and named a compact wideband coupled-line ring hybrid, due to the fact that a set of coupled-line sections is included. One of compact ring hybrids is compared with a conventional ring hybrid and the compared results demonstrate that the bandwidth of a proposed compact ring hybrid is much wider, in spite of being more than three times smaller in size. To test the compact ring hybrids, a microstrip compact ring hybrid, whose total transmission-line length is $220^{\circ}$, is fabricated and measured. The measured power divisions($S_{21}$, $S_{41}$, $S_{23}$ and $S_{43}$) are -2.78 dB, -3.34 dB, -2.8 dB and -3.2 dB, respectively at a design center frequency of 2 GHz, matching and isolation less than -20 dB in more than 20 % fractional bandwidth.

Slewing maneuver control of flexible space structure using adaptive CGT

  • Shimada, Yuzo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1995.10a
    • /
    • pp.47-50
    • /
    • 1995
  • This paper concerns an adaptive control scheme which is an extension of the simplified adaptive control. Originally, the SAC approach was developed based on the command generator tracker (CGT) theory for perfect model tracking. An attractive point of the SAC is that a control input can be synthesized without any prior knowledge about plant structure. However, a feedforward dynamic compensator of the CGT is removed from the basic structure of the SAC. This deletion of the compensator makes perfect model tracking difficult against even a step input. In this paper, an adaptive control system is redesigned to achieve perfect model tracking for as long as possible by reviving the dynamic compensator of the CGT. The proposed method is applied to slewing control of a flexible space structure and compared to the SAC responses.

  • PDF