• Title/Summary/Keyword: Topology processing

Search Result 271, Processing Time 0.032 seconds

Scatternet Formation Algorithm Based on Tree Topology Considering Hop Count Between Bluetooth Devices (Bluetooth 장치 간의 홉 횟수를 고려한 트리 기반 scatternet 형성 알고리즘)

  • Kang, Seung-Ho;Kang, Dae-Wook;Lim, Hyeong-Seok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.11b
    • /
    • pp.1233-1236
    • /
    • 2002
  • 다수의 Bluetooth 장치가 사용되는 곳에서의 데이터 통신에는 scatternet의 형태가 데이터 전송 효율성에 크게 영향을 미친다. 본 논문에서는 과도한 지연시간을 초래하지 않으면서도장치 간 평균 홉 횟수를 기존 방법보다 감소시킬 수 있는 scatternet 형성 알고리즘을 제시하고 시뮬레이션을 통해 기존 알고리즘과 비교한다.

  • PDF

3D Reconstruction of Hepatic Vessels (간의 혈관 3D 영상 재구성)

  • Fei, Yang;You, Mu-Sang;Park, Jong Won
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.11a
    • /
    • pp.101-103
    • /
    • 2007
  • 혈관 구조는 사람의 가장 복잡한 구조 중 하나이다. 혈관 분석에는 Morphology and Topology 가 있다. 우리는 목표는 위 분석 기법과는 달리 3D 영상 재구성이다. 본 논문은 Raw CT data 을 세그먼트하고 Skeleton line 을 인용하여 복잡한 트리 형태의 혈관 3D 재구성을 하였다.

A Study on the Transmission Overload Relief by Fast Switching (고속 스위칭에 의한 송전선로 과부하 해소 연구)

  • Cho, Yoon-Sung;Lee, Han-Sang;Jang, Gilsoo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.8
    • /
    • pp.1053-1058
    • /
    • 2013
  • Because of computational burden and complex topology of substation, a transmission overload relief using circuit-breaker switching was very complex and difficult. However, a on-line algorithm for reducing the overloads in transmission lines has made progress due to the advance of IT technology. This paper describes the methodology for alleviating the overloads in transmission lines by circuit-breaker switching. First, the severe contingency lists and substations were selected from the results of contingency analysis. Then the switch combinations are determined using circuit-breakers of the selected substation. The topology changes are limited to equipment outage, bus split, island split, bus merge and island merge. Finally, the fast screening and full analysis methods are used to analyze the overload in transmission lines. To verify the performance of the proposed methodology, we performed a comprehensive test for both test system and large-scale power systems. The results of these tests showed that the proposed methodology can accurately alleviate the overloads in transmission lines from online data and can be applied to on-line applications.

A quantitative measurement of concrete air content using image analyses

  • Hwang, C.L.;Peng, S.S.;Wang, E.;Lin, S.H.;Huang, S.L.
    • Computers and Concrete
    • /
    • v.7 no.3
    • /
    • pp.239-247
    • /
    • 2010
  • A proposed topology method is introduced to measure the air content of fresh cement paste and hardened concrete. The method takes advantage of chromatographic analysis in void areas that are highlighted using different color schemes and later calculated using built-in computer software. The air content measured by the topology method is compared with results obtained from the conventional ASTM methods. It is concluded that the proposed method is reliable, and costs less and is easier to operate compared with the ASTM methods. In addition, 3 dimensional pore models can be created using image post-processing techniques. The proposed method helps researchers in understanding the formation and existence of concrete pores. This paper reports a detailed test program demonstrating the standard operating procedure used for the proposed method and presents a comparison of results between the proposed method and conventional ASTM Specifications. It is also concluded that the air content increases with increasing size of pores and increasing percentage of coarse aggregates.

Topological Analysis of the Feasibility and Initial-value Assignment of Image Segmentation (영상 분할의 가능성 및 초기값 배정에 대한 위상적 분석)

  • Doh, Sang Yoon;Kim, Jungguk
    • Journal of KIISE
    • /
    • v.43 no.7
    • /
    • pp.812-819
    • /
    • 2016
  • This paper introduces and analyzes the theoretical basis and method of the conventional initial-value assignment problem and feasibility of image segmentation. The paper presents topological evidence and a method of appropriate initial-value assignment based on topology theory. Subsequently, the paper shows minimum conditions for feasibility of image segmentation based on separation axiom theory of topology and a validation method of effectiveness for image modeling. As a summary, this paper shows image segmentation with its mathematical validity based on topological analysis rather than statistical analysis. Finally, the paper applies the theory and methods to conventional Gaussian random field model and examines effectiveness of GRF modeling.

Platen Weight Reduction Design of Extruder Using Topology Optimization Design (위상최적설계를 활용한 압출기의 플라텐 경량화 설계)

  • Kim, D.Y.;Kim, J.W.;Lee, J.I.;Jo, A.R.;Lee, S.Y.;Jeong, M.S.;Ko, D.C.;Jang, J.S.
    • Transactions of Materials Processing
    • /
    • v.31 no.5
    • /
    • pp.302-308
    • /
    • 2022
  • In this study, the weight of the platen was reduced using the structural strength analysis and topology optimization design of the extruder by finite element analysis. The main components of the extruder such as the stem and billet, were modeled, and the maximum stress and safety factor were verified through structural strength analysis. Based on the results of the structural strength analysis, the optimal phase that satisfies the limitation given to the design area of the structure and maximizes or minimizes the objective function was obtained through a numerical method. The platen was redesigned with a phase-optimal shape, the weight was reduced by 40% (from the initial weight of 11.1 tons to 6.6 tons), and the maximum stress was 147.49 MPa safety factor of 1.86.

Underwater Multi-media Communication Network based on Star Topology and a Fragmentation Technique (성형망 기반의 수중 다중매체 통신 네트워크와 단편화 기법)

  • Lim, DongHyun;Kim, Seung-Geun;Kim, Changhwa
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.11
    • /
    • pp.1526-1537
    • /
    • 2021
  • Due to the difference between the underwater communication environment and the terrestrial communication environment, the radio communication mainly used on the ground cannot be used in underwater. For this reason, in the underwater communication environment, various communication media such as acoustic waves, infrared rays, light and so on has been studied, but there exist several difficulties in operating them individually due to their physical limitations. The concept for overcoming these difficulties is the very underwater multi-media communication, a method to select a communication medium best suitable for the current underwater environment among underwater communication multimedia whenever there occurs underwater communication failure. In this paper, we present an underwater multi-media communication network based on star topology and a fragmentation and reassembly technique to solve the problems caused by the different MTU (Maximum Transmission Unit) sizes among different underwater communication media. We also present the estimations and analysis on processing times in each of fragmentation and reassembly and the total data amount for transmitting fragments in our proposed underwater multi-media communication network.

Distributed Algorithm for Updating Minimum-Weight Spanning Tree Problem (MST 재구성 분산 알고리즘)

  • Park, Jeong-Ho;Min, Jun-Yeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.2
    • /
    • pp.184-193
    • /
    • 1994
  • This paper considers the Updating Minimum-weight Spanning Tree Problem(UMP), that is, the problem to update the Minimum-weight Spanning Tree(MST) in response to topology change of the network. This paper proposes the algorithm which reconstructs the MST after several links deleted and added. Its message complexity and its ideal-time complexity are Ο(m+n log(t+f)) and Ο(n+n log(t+f)) respectively, where n is the number of processors in the network, t(resp.f) is the number of added links (resp. the number of deleted links of the old MST), And m=t+n if f=Ο, m=e (i.e. the number of links in the network after the topology change) otherwise. Moreover the last part of this paper touches in the algorithm which deals with deletion and addition of processors as well as links.

  • PDF

A Scalable Explicit Multicast Protocol for MANETs

  • Gossain Hrishikesh;Anand Kumar;Cordeiro Carlos;Agrawal Dharma P.
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.294-306
    • /
    • 2005
  • Group oriented multicast applications are becoming increasingly popular in mobile ad hoc networks (MANETs). Due to dynamic topology of MANETs, stateless multicast protocols are finding increased acceptance since they do not require maintenance of state information at intermediate nodes. Recently, several multicast schemes have been proposed which scale better' with the number of multicast sessions than traditional multicast strategies. These schemes are also known as explicit multicast (Xcast; explicit list of destinations in the packet header) or small group multicast (SGM). In this paper, we propose a new scheme for small group' multicast in MANETs named extended explicit multicast (E2M), which is implemented on top of Xcast and introduces mechanisms to make it scalable with number of group members for a given multicast session. Unlike other schemes, E2M does not make any assumptions related to network topology or node location. It is based on the novel concept of dynamic selection of Xcast forwarders (XFs) between a source and its potential destinations. The XF selection is based on group membership and the processing overhead involved in supporting the Xcast protocol at a given node. If the number of members in a given session is small, E2M behaves just like the basic Xcast scheme with no intermediate XFs. As group membership increases, nodes may dynamically decide to become an XF. This scheme, which can work with few E2M aware nodes in the network, provides transparency of stateless multicast, reduces header processing overhead, minimizes Xcast control traffic, and makes Xcast scalable with the number of group members.

Bidirectional Power Conversion of Isolated Switched-Capacitor Topology for Photovoltaic Differential Power Processors

  • Kim, Hyun-Woo;Park, Joung-Hu;Jeon, Hee-Jong
    • Journal of Power Electronics
    • /
    • v.16 no.5
    • /
    • pp.1629-1638
    • /
    • 2016
  • Differential power processing (DPP) systems are among the most effective architectures for photovoltaic (PV) power systems because they are highly efficient as a result of their distributed local maximum power point tracking ability, which allows the fractional processing of the total generated power. However, DPP systems require a high-efficiency, high step-up/down bidirectional converter with broad operating ranges and galvanic isolation. This study proposes a single, magnetic, high-efficiency, high step-up/down bidirectional DC-DC converter. The proposed converter is composed of a bidirectional flyback and a bidirectional isolated switched-capacitor cell, which are competitively cheap. The output terminals of the flyback converter and switched-capacitor cell are connected in series to obtain the voltage step-up. In the reverse power flow, the converter reciprocally operates with high efficiency across a broad operating range because it uses hard switching instead of soft switching. The proposed topology achieves a genuine on-off interleaved energy transfer at the transformer core and windings, thus providing an excellent utilization ratio. The dynamic characteristics of the converter are analyzed for the controller design. Finally, a 240 W hardware prototype is constructed to demonstrate the operation of the bidirectional converter under a current feedback control loop. To improve the efficiency of a PV system, the maximum power point tracking method is applied to the proposed converter.