• 제목/요약/키워드: OMS Algorithm

검색결과 8건 처리시간 0.026초

양수발전소 발전-전동기 운전중 감시 시스템의 개발 (Development of On-Line Monitoring System for Pumped Storage Generator/Motor)

  • 김희동;주영호
    • 대한전기학회논문지:전기물성ㆍ응용부문C
    • /
    • 제53권3호
    • /
    • pp.168-174
    • /
    • 2004
  • On-line monitoring system(OMS) has been developed for the pumped storage generator/motor The OMS is applied to diagnosis of the PD(partial discharge) activity of stator insulation, the shorted-turn of rotor winding and the variation of the air-gap between stator and rotor. The OMS consists of DAS(data acquisition system), main server system, gateway and display PC. The DAS measures the PD, the shorted-turn and air-gap from three sensors installed on the generator/motor. The gateway controls the data which sent by DAS. The main server system saves the data, analyzes the data and conducts the diagnostic algorithm. The display PC shows the diagnostic results of partial discharge, shorted-turn and air-gap. Field tests were conducted using PDA(partial discharge analyzer). The results of the OMS and PDA measurements can be directly correlated with normalized quantity number(NQN), PD magnitude(Qm) and PD pattern.

WDM 링망의 효율적인 광 파장 할당 알고리즘 (Efficient Optical Wavelength Allocation Algorithms for WDM Ring Networks)

  • 이동춘;신승수;조용환
    • 한국통신학회논문지
    • /
    • 제27권6B호
    • /
    • pp.645-651
    • /
    • 2002
  • 본 논문은 OMS(Optical Multiplex Section) 또는 OCh (Optical Channel) SPRING (Shared Protection Ring)에 적용되는 두 가지 광파장 할당 알고리즘을 제안하고 시뮬레이션을 통해 특성을 비교하였다. 제안한 알고리즘들은 WDM SPRING 네트워크에 적용할 수 있는 최적화 알고리즘과 넌블러킹 알고리즘이며 대부분의 비교에서 최적화 알고리즘이 넌블러킹 알고리즘에 비해 우수함을 보였다. 하지만, 넌블러킹 알고리즘도 몇몇 기존 연결을 재구성하기 위한 광파장 연결이나 할당을 필요로 하지 않는 중요한 잇점이 있다.

광 디스크 드라이브 Seek 소음의 음질 평가 (Sound Quality Evaluation of Optical Disc Drive Seek Noise)

  • 이상윤;최명렬;성평용
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2003년도 추계학술대회논문집
    • /
    • pp.401-405
    • /
    • 2003
  • Sound quality is becoming a major concern in optical disc drives (ODD). In order to improve the sound quality of slim type ODDs, we changed lead screw pitch and firmware algorithm in the seek mode. To evaluate the sound quality, the PCM (Paired Comparison Method) was adopted and the result was compared with the time-averaged loudness spectrum. Sound signals were also recorded and modified by increasing or decreasing selected frequency bands to verify their sensitivities to the sound quality. As a result of jury test, preferred frequency bands are associated with the time-averaged loudness spectrum.

  • PDF

Texture Comparison with an Orientation Matching Scheme

  • Nguyen, Cao Truong Hai;Kim, Do-Yeon;Park, Hyuk-Ro
    • Journal of Information Processing Systems
    • /
    • 제8권3호
    • /
    • pp.389-398
    • /
    • 2012
  • Texture is an important visual feature for image analysis. Many approaches have been proposed to model and analyze texture features. Although these approaches significantly contribute to various image-based applications, most of these methods are sensitive to the changes in the scale and orientation of the texture pattern. Because textures vary in scale and orientations frequently, this easily leads to pattern mismatching if the features are compared to each other without considering the scale and/or orientation of textures. This paper suggests an Orientation Matching Scheme (OMS) to ease the problem of mismatching rotated patterns. In OMS, a pair of texture features will be compared to each other at various orientations to identify the best matched direction for comparison. A database including rotated texture images was generated for experiments. A synthetic retrieving experiment was conducted on the generated database to examine the performance of the proposed scheme. We also applied OMS to the similarity computation in a K-means clustering algorithm. The purpose of using K-means is to examine the scheme exhaustively in unpromising conditions, where initialized seeds are randomly selected and algorithms work heuristically. Results from both types of experiments show that the proposed OMS can help improve the performance when dealing with rotated patterns.

High-revenue Online Provisioning for Virtual Clusters in Multi-tenant Cloud Data Center Network

  • Lu, Shuaibing;Fang, Zhiyi;Wu, Jie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권3호
    • /
    • pp.1164-1183
    • /
    • 2019
  • The rapid development of cloud computing and high requirements of operators requires strong support from the underlying Data Center Networks. Therefore, the effectiveness of using resources in the data center networks becomes a point of concern for operators and material for research. In this paper, we discuss the online virtual-cluster provision problem for multiple tenants with an aim to decide when and where the virtual cluster should be placed in a data center network. Our objective is maximizing the total revenue for the data center networks under the constraints. In order to solve this problem, this paper divides it into two parts: online multi-tenancy scheduling and virtual cluster placement. The first part aims to determine the scheduling orders for the multiple tenants, and the second part aims to determine the locations of virtual machines. We first approach the problem by using the variational inequality model and discuss the existence of the optimal solution. After that, we prove that provisioning virtual clusters for a multi-tenant data center network that maximizes revenue is NP-hard. Due to the complexity of this problem, an efficient heuristic algorithm OMS (Online Multi-tenancy Scheduling) is proposed to solve the online multi-tenancy scheduling problem. We further explore the virtual cluster placement problem based on the OMS and propose a novel algorithm during the virtual machine placement. We evaluate our algorithms through a series of simulations, and the simulations results demonstrate that OMS can significantly increase the efficiency and total revenue for the data centers.

LDPC 코드의 빠른 복원을 위한 1단으로 구성된 적응적인 오프셋 MS 알고리즘 (Single-Step Adaptive Offset Min-Sum Algorithm for Decoding LDPC Codes)

  • 임소국;강수린;이해기;김성수
    • 전기학회논문지P
    • /
    • 제59권1호
    • /
    • pp.53-57
    • /
    • 2010
  • Low-density parity-check (LDPC) codes with belief-propagation (BP) algorithm achieve a remarkable performance close to the Shannon limit at reasonable decoding complexity. Conventionally, each iteration in decoding process contains two steps, the horizontal step and the vertical step. In this paper, an efficient implementation of the adaptive offset min-sum (AOMS) algorithm for decoding LDPC codes using the single-step method is proposed. Furthermore, the performances of the AOMS algorithm compared with belief-propagation (BP) algorithm are investigated. The algorithms using the single-step method reduce the implementation complexity, speed up the decoding process and have better efficiency in terms of memory requirements.

A Low-Computation Indirect Model Predictive Control for Modular Multilevel Converters

  • Ma, Wenzhong;Sun, Peng;Zhou, Guanyu;Sailijiang, Gulipali;Zhang, Ziang;Liu, Yong
    • Journal of Power Electronics
    • /
    • 제19권2호
    • /
    • pp.529-539
    • /
    • 2019
  • The modular multilevel converter (MMC) has become a promising topology for high-voltage direct current (HVDC) transmission systems. To control a MMC system properly, the ac-side current, circulating current and submodule (SM) capacitor voltage are taken into consideration. This paper proposes a low-computation indirect model predictive control (IMPC) strategy that takes advantages of the conventional MPC and has no weighting factors. The cost function and duty cycle are introduced to minimize the tracking error of the ac-side current and to eliminate the circulating current. An optimized merge sort (OMS) algorithm is applied to keep the SM capacitor voltages balanced. The proposed IMPC strategy effectively reduces the controller complexity and computational burden. In this paper, a discrete-time mathematical model of a MMC system is developed and the duty ratio of switching state is designed. In addition, a simulation of an eleven-level MMC system based on MATLAB/Simulink and a five-level experimental setup are built to evaluate the feasibility and performance of the proposed low-computation IMPC strategy.

뇌 운동피질의 기능적 영상: 고식적 Gradient Echo기법과 EPI기법간의 비교 (Functional MR Imaging of Cerbral Motor Cortex: Comparison between Conventional Gradient Echo and EPI Techniques)

  • 송인찬
    • Investigative Magnetic Resonance Imaging
    • /
    • 제1권1호
    • /
    • pp.109-113
    • /
    • 1997
  • 목적: 고식적인 spoiled gradient echo(SPGR) 기법과 EPI기법간의 뇌의 운동피질에 대한 기능적 영상의 차이를 평가하고자 하였다. 대상 및 방법: 5명의 정상 성인을 대상으로 1.5T 자기공명영상기기에서 SPGR기법(TR/TE/flep angle=50ms / 40ms / $30^{\circ}$, FOV=300mm, matrix $size=256{\times}256$, 단면두께=5mm)과 기법(TR / TE / flip angle=3000ms / 40ms / $90^{\circ}$, FOV=300mm, matrix $size=128{\times}128$, 단면두께=5mm)을 사용하여 MR 에이터를 얻었다. EPI기법의 경우, 총 6개의 단면에 대해 총 960개의 영상을 얻었고 SPGR 기법 겨우, 위 6개의 단면 중 운동중추영역이 포함된 한 단면에 대해 총 160개의 영상을 얻었다. 사용된 paradigm은 각각 8번의 휴지 기간과 활성 기간으로 구성되었고 활성기간동안에 시행된 작업은 오른손 손가락의 쥠과 펼침 운동이었다. 뇌의 활성영역을 국소화 하기 위해 사용된 통게적인 처리방법은 cross-correlation 방법이었다. 두 기법의 활성화 영상에 대해 활성 영역에서의 휴지 기간과 활성 기간간의 신호 크기의 변화와 연속적인 MR 데이터의 신호 대 잡음비의 측정, 그리고 활성 영역의 위치와 그 범위를 비교 분석하였다. 결과: 두 기법 모두에서 운동중추영역인 전운동피질이 잘 관찰되었다. 휴지 기간과 활성 기간간의 신호 크기의 변화는 두 기법간의 유의한 차이가 없었다. 그러나, 연속적인 MR 데이터의 신호 대 잡음비에 있어서는 EPI 기법이 SPGR 기법보다 약 2배 높았다. 또한, 활성 영역에 있어서 EPI 기법이 SPGR기법보다 낮은 쪽으로의 p값의 분포를 보여 주었다. 결론: 본 연구는 운동중추영역에 대한 뇌의 기능적 영상을 얻는 데에 있어서 두 기법 모두 유용함을 보여주었다. 그러나, EPI 기법에서 얻을 수 있는 높은 신호 감도 특성에 의해 EPI 기법이 SPGR 기법보다 뇌의 기능적 영역에 대한 더 정확한 정보를 제공하는 장점을 지닌다.

  • PDF