• Title/Summary/Keyword: OMS Algorithm

Search Result 8, Processing Time 0.019 seconds

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

  • 김희동;주영호
    • The Transactions of the Korean Institute of Electrical Engineers C
    • /
    • v.53 no.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.

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

  • 이동춘;신승수;조용환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6B
    • /
    • pp.645-651
    • /
    • 2002
  • This thesis describes two wavelength allocation algorithms applied to OMS (Optical Multiplex Section) or OCh (Optical Channel) SPRING (Shared Protection Ring) and compares their characteristics by simulations. Two wavelength allocation algorithms are optimal algorithm and nonblocking algorithm applicable on SPRING WDM networks. In particular, when a node is added in previous ring network, how to work for each algorithm is considered. The optimal algorithm is better than nonblocking for most of comparisons. Nonblocking algorithm has an important advantage, though. Nonblocking algorithm has no wavelength connection or allocation to reconfigure some previous connections.

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

  • 이상윤;최명렬;성평용
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2003.11a
    • /
    • 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
    • /
    • v.8 no.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)
    • /
    • v.13 no.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.

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

  • Lin, Xiaoju;Baasantseren, Gansuren;Lee, Hae-Kee;Kim, Sung-Soo
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.59 no.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
    • /
    • v.19 no.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.

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

  • 송인찬
    • Investigative Magnetic Resonance Imaging
    • /
    • v.1 no.1
    • /
    • pp.109-113
    • /
    • 1997
  • Purpose: To evaluate the differences of functional imaging patterns between conventional spoiled gradient echo (SPGR) and echo planar imaging (EPI) methods in cerebral motor cortex activation. Materials and Methods: Functional MR imaging of cerebral motor cortex activation was examined on a 1.5T MR unit with SPGR (TRfrE/flip angle=50ms/4Oms/$30^{\circ}$, FOV=300mm, matrix $size=256{\times}256$, slice thickness=5mm) and an interleaved single shot gradient echo EPI (TRfrE/flip angle = 3000ms/40ms/$90^{\circ}$, FOV=300mm, matrix $size=128{\times}128$, slice thickness=5mm) techniques in five male healthy volunteers. A total of 160 images in one slice and 960 images in 6 slices were obtained with SPGR and EPI, respectively. A right finger movement was accomplished with a paradigm of an 8 activation/ 8 rest periods. The cross-correlation was used for a statistical mapping algorithm. We evaluated any differences of the time series and the signal intensity changes between the rest and activation periods obtained with two techniques. Also, the locations and areas of the activation sites were compared between two techniques. Results: The activation sites in the motor cortex were accurately localized with both methods. In the signal intensity changes between the rest and activation periods at the activation regions, no significant differences were found between EPI and SPGR. Signal to noise ratio (SNR) of the time series data was higher in EPI than in SPGR by two folds. Also, larger pixels were distributed over small p-values at the activation sites in EPI. Conclusions: Good quality functional MR imaging of the cerebral motor cortex activation could be obtained with both SPGR and EPI. However, EPI is preferable because it provides more precise information on hemodynamics related to neural activities than SPGR due to high sensitivity.

  • PDF