• Title/Summary/Keyword: 그래프 위상 구조

Search Result 25, Processing Time 0.029 seconds

A Study on a New Broadband 180° Phase Shifter using the Network with Great Phase Dispersive Characteristics (강한 위상 산란 특성을 갖는 회로망을 이용한 새로운 광대역 180°위상 천이기에 대한 연구)

  • 엄순영
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.4
    • /
    • pp.401-412
    • /
    • 2003
  • In this paper, a broadband phase shifter structure using a new switched network was proposed. A new reference network is composed of coupled lines and 45$^{\circ}$open and short stubs, which are shunted at the edge points of a main line, respectively, A delay network is composed of only a standard transmission line. It is possible to design a broadband 180$^{\circ}$phase shifter that phase dispersive characteristics by an impedance ratio R of coupled lines and greater phase dispersive characteristics by characteristic impedances Zm, Zs of a main line and stubs are used together. By considering a structure symmetry, the even and odd mode analysis was performed to obtain theoretical S-parameters of the proposed phase shifter. Also, through computer simulation on the basis of derived equations, design graphs were presented to optimally design a 180$^{\circ}$broadband phase shifter. Design graphs provide the values of characteristic impedances Zm, Zs, and I/O match and phase bandwidths. To verify electrical performances of the broadband phase shifter proposed in this paper, low different 180$^{\circ}$phase shifters, operated at the center frequency 3 GHz were designed and fabricated using design graphs, and were experimented. One of them was designed as a standard Schiffman structure to compare with electrical performances. Measured results of each phase shifter to satisfy simultaneously design conditions of I/O match (VSWR=1.15:1) and maximum phase deviation $({\varepsilon}_{{\Delta}{\phi}}={\pm}2^{\circ})$ were well in agreement with corresponding simulation results over impedance match and phase error bandwidths, and showed broadband characteristics.

Reliable Group Communication Platform using Virtual Tapologies in a Dynamic High-Speed Network (동적인 초고속통신망에서 가상위상을 이용한 신뢰성있는 그룹통신 플랫폼 개발에 관한 연구)

  • Shin, Yong-Tae;Cho, Min-Soo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.5
    • /
    • pp.1320-1332
    • /
    • 1998
  • We propose Multiph which is a virtual topology for a reliable group communication platform on dynamic high speed network. We also define group communication primitives for transmission of messages and group management. Multiph consists of a set of nodes which are process groups and a set of edges which are the connection between nodes providing the route of messages. Processes can send and receive messages overlapped in a several multicast groups. Overlapped process organizes non-overlapped logical group, which called meta-group. Multiph guarantees ordering of messages that received at the destination group. It has no extra node that decreases system performance. Although the group has dynamic group change to leave and add process, it does not reconstruct the existing platform structure.

  • PDF

Better Analysis of Lower Bounds of Frequency Assignment Problems in Wireless Networks with Cellular Topology (셀룰러 위상구조 무선망에서의 주파수 할당 문제의 향상된 하한 값 분석)

  • Lee, Sang-Kyu;Lee, Ju-Young
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.11
    • /
    • pp.830-835
    • /
    • 2006
  • Because of its exponential growth of data and voice transmissions through wireless communications, efficient resource management became more important factor when we design wireless networks. One of those limited resources in the wireless communications is frequency bandwidth. As a solution of increasing reusability of resources, the efficient frequency assignment problems on wireless networks have been widely studied. One suitable approach to solve these frequency assignment problems is transforming the problem into traditional graph coloring problems in graph theory. However, most of frequency assignments on arbitrary network topology are NP-Complete problems. In this paper, we consider the Chromatic Bandwidth Problem on the cellular topology wireless networks. It is known that the lower bound of the necessary number of frequencies for this problem is $O(k^2)$. We prove that the lower bound of the necessary number of frequencies for the Chromatic Bandwidth Problem is $O(k^3)$ which is tighter lower bound than the previous known result.

A Graph Model and Analysis Algorithm for cDNA Microarray Image (cDNA 마이크로어레이 이미지를 위한 그래프 모델과 분석 알고리즘)

  • Jung, Ho-Youl;Hwang, Mi-Nyeong;Yu, Young-Jung;Cho, Hwan-Gue
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.7
    • /
    • pp.411-421
    • /
    • 2002
  • In this Paper we propose a new Image analysis algorithm for microarray processing and a method to locate the position of the grid cell using the topology of the grid spots. Microarray is a device which enables a parallel experiment of 10 to 100 thousands of test genes in order to measure the gene expression. Because of the huge data obtained by a experiment automated image analysis is needed. The final output of this microarray experiment is a set of 16-bit gray level image files which consist of grid-structured spots. In this paper we propose one algorithm which located the address of spots (spot indices) using graph structure from image data and a method which determines the precise location and shape of each spot by measuring the inclination of grid structure. Several experiments are given from real data sets.

Topological measures for algorithm complexity of Markov decision processes (마르코프 결정 프로세스의 위상적 계산 복잡도 척도)

  • Yi, Seung-Joon;Zhang, Byoung-Tak
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06c
    • /
    • pp.319-323
    • /
    • 2007
  • 실세계의 여러 문제들은 마르코프 결정 문제(Markov decision problem, MDP)로 표현될 수 있고, 이 MDP는 모델이 알려진 경우에는 평가치 반복(value iteration) 이나 모델이 알려지지 않은 경우에도 강화 학습(reinforcement learning) 알고리즘 등을 사용하여 풀 수 있다. 하지만 이들 알고리즘들은 시간 복잡도가 높아 크기가 큰 실세계 문제에 적용하기 쉽지 않아, MDP를 계층적으로 분할하거나, 여러 단계를 묶어서 수행하는 등의 시간적 추상화(temporal abstraction) 방법이 제안되어 왔다. 이러한 시간적 추상화 방법들의 문제점으로는 시간적 추상화의 디자인에 따라 MDP의 풀이 성능이 크게 달라질 수 있으며, 많은 경우 사용자가 이 디자인을 직접 제공해야 한다는 것들이 있다. 최근 사용자의 간섭이 필요 없이 자동적으로 시간적 추상화를 만드는 방법들이 제안된 바 있으나, 이들 방법들 역시 결과물에 대한 이론적인 성능 보장(performance guarantee)은 제공하지 못하고 있다. 본 연구에서는 이러한 문제점을 해결하기 위해 MDP의 구조와 그 풀이 성능을 연관짓는 복잡도 척도에 대해 살펴본다. 이를 위해 MDP로부터 얻은 상태 경로 그래프(state trajectory graph)의 위상적 성질들을 여러 네트워크 척도(network measurements) 들을 이용하여 측정하고, 이와 MDP의 풀이 성능과의 관계를 다양한 상황에 대해 실험적, 이론적으로 분석해 보았다.

  • PDF

Building change detection in high spatial resolution images using deep learning and graph model (딥러닝과 그래프 모델을 활용한 고해상도 영상의 건물 변화탐지)

  • Park, Seula;Song, Ahram
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.40 no.3
    • /
    • pp.227-237
    • /
    • 2022
  • The most critical factors for detecting changes in very high-resolution satellite images are building positional inconsistencies and relief displacements caused by satellite side-view. To resolve the above problems, additional processing using a digital elevation model and deep learning approach have been proposed. Unfortunately, these approaches are not sufficiently effective in solving these problems. This study proposed a change detection method that considers both positional and topology information of buildings. Mask R-CNN (Region-based Convolutional Neural Network) was trained on a SpaceNet building detection v2 dataset, and the central points of each building were extracted as building nodes. Then, triangulated irregular network graphs were created on building nodes from temporal images. To extract the area, where there is a structural difference between two graphs, a change index reflecting the similarity of the graphs and differences in the location of building nodes was proposed. Finally, newly changed or deleted buildings were detected by comparing the two graphs. Three pairs of test sites were selected to evaluate the proposed method's effectiveness, and the results showed that changed buildings were detected in the case of side-view satellite images with building positional inconsistencies.

A study on the design optimization of the head stucture of 5-axis machining center using finite element analysis (유한요소해석을 이용한 5축 복합가공기 헤드 구조물의 최적 설계에 관한 연구)

  • Kim, Jae-Seon;Lee, Meong-Ho;Youn, Jae-Woong
    • Journal of the Korea Convergence Society
    • /
    • v.12 no.9
    • /
    • pp.161-168
    • /
    • 2021
  • As the demand for high speed and high precision increases in the field of machine tool, interest in stiffness and vibration of machine tool is increasing. However, it takes a lot of time to develop a detailed design of machine tool based on experience, and it is difficult to design appropriately. Recently, structural optimization using FEM are increasingly used in machine tool design. But, it is difficult to optimize in consideration of the vibration state of the structure since optimization through stress distribution of a structure is mainly used, In this paper, Static structural analysis, mode analysis, and harmonic analysis using FEM were conducted to optimize the head structure that has the most influence on machining in a 5-axis machine tool. It is proposed a topology optimization analysis method that considers both static stiffness and dynamic stiffness using objective function design.

Topological Properties of Recursive Circulants : Disjoint Paths (재귀원형군의 위상 특성 : 서로소인 경로)

  • Park, Jeong-Heum;Jwa, Gyeong-Ryong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.8
    • /
    • pp.1009-1023
    • /
    • 1999
  • 이 논문은 재귀원형군 G(2^m , 2^k ) 그래프 이론적 관점에서 고찰하고 정점이 서로소인 경로에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )의 서로 다른 두 노드 v와 w를 잇는 연결도 kappa(G)개의 서로소인 경로의 길이가 두 노드 사이의 거리d(v,w)나 혹은 G(2^m , 2^k )의 지름 \dia(G)에 비해서 얼마나 늘어나는지를 고려한다. 서로소인 경로를 재귀적으로 설계하는데, 그 길이는 k ge2일 때 d(v,w)+2^k-1과 \dia(G)+2^k-1의 최솟값 이하이고, k=1일 때 d(v,w)+3과 \dia(G)\+2의 최솟값 이하이다. 이 연구는 (2^m , 2^k )의 고장 감내 라우팅, 고장 지름이나 persistence의 분석에 이용할 수 있다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties concerned with node-disjoint paths. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . We consider the length increments of {{{{kappa(G)disjoint paths joining arbitrary two nodes v and win G(2^m , 2^k )compared with distance d(v,w)between the two nodes and diameter {{{{\dia(G)of G(2^m , 2^k ), where kappa(G)is the connectivity of G(2^m , 2^k ). We recursively construct disjoint paths of length less than or equal to the minimum of {{{{d(v,w)+2^k-1and \dia(G)+2^k-1for kge2 and the minimum of d(v,w)+3 and \dia(G)+2for k=1. This work can be applied to fault-tolerant routing and analysis of fault diameter and persistence of G(2^m , 2^k )

A wavelength readout of a fiber-optic tunable laser using a double-pass Mach-Zehnder Interferometer (더블패스 마하젠더 간섭계를 이용한 광섬유 레이저의 파장검출)

  • Park, Hyong-Jun;Kim, Hyun-Jin;Song, Min-Ho
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.46 no.1
    • /
    • pp.43-48
    • /
    • 2009
  • We constructed a simple wavelength readout system for a tunable fiber laser which was used for a fiber Bragg grating sensor array system. A quadrature sampling method was used to demodulate wavelength variations of the tunable laser which consisted of a SOA(semi-conductor optical amplifier) and a fiber-optic Fabry-Perot filter. Internal triggers, which have a 90 degree phase period, have been generated by using a double-pass Mach-Zehnder interferometer. From Lissajous plots with quadrature sampled data, a mean phase error of ${\sim}2.51$ mrad was obtained. From the wavelength readout experiments, an accurate and fast linear wavelength demodulation has been confirmed.

A Evaluation of the Maximum Power of the 94 GHz Gunn Diode Based on the Measured Oscillation Power (발진출력 측정을 통한 94 GHz Gunn Diode의 최대 전력 조사)

  • Lee, Dong-Hyun;Yeom, Kyung-Whan;Jung, Myung-Suk;Chun, Young-Hoon;Kang, Yeon-Duk;Han, Ki-Woong
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.26 no.5
    • /
    • pp.471-482
    • /
    • 2015
  • In this paper, design and implementation of the 94 GHz Gunn oscillator and the evaluation of the maximum power of the Gunn diode used in the oscillator are presented. The 94 GHz Gunn oscillator is used InP Gunn diode and designed employing a WR-10 waveguide. The designed oscillator is fabricated through machining and its performance is measured. The fabricated oscillator shows an oscillation frequency of 95 GHz, output power of 12.64 dBm, and phase noise of -92.7 dBc/Hz at 1 MHz offset frequency. To evaluation the maximum power of the InP Gunn diode used in oscillator, the oscillator structure is modified to a structure having a diaphram. The height of thick diaphram which is used in the oscillator is varied. As a result, an oscillator has several different load impedances, which makes it possible to plot $G_L-V^2$ plot at the post plane. Using the $G_L-V^2$ plot, the maximum power of used Gunn diode including post is computed to be 16.8 dBm. Furthermore using the shorted and zero bias Gunn diode, the post loss used for DC biasing can be computed. Using the two losses, The maximum power of a InP Gunn diode is computed to be 18.55 dBm at 95 GHz. This result is close to a datasheet.