• Title/Summary/Keyword: H$_2$ algorithm

Search Result 878, Processing Time 0.027 seconds

SOCLE ELEMENTS OF NON-LEVEL ARTINIAN ALGEBRAS

  • SHIN YONG SU
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.605-614
    • /
    • 2005
  • We show that an Artinian O-sequence $h_0,h_1,{\cdots},h_{d-1},h_d\;=\;h_{d-1},h_{d+l}\;>\;h_d$ of codimension 3 is not level when $h_{d-1}\;=\;h_d\;=\;d + i\;and\;h{d+1}\;=\;d+(i+1)\;for\;i\;=\;1,\;2,\;and\;3$, which is a partial answer to the question in [9]. We also introduce an algorithm for finding noncancelable Betti numbers of minimal free resolutions of all possible Artinian O-sequences based on the theorem of Froberg and Laksov in [2].

A Marriage Problem Algorithm Based on Duplicated Sum of Inter-Preference Moving Method (중복된 최소 상호-호감도 합 이동방법을 적용한 결혼문제 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.5
    • /
    • pp.107-112
    • /
    • 2015
  • This paper proposes a simplified algorithm devised to obtain optimal solution to the marriage problem. In solving this problem, the most widely resorted to is the Gale-Shapley algorithm with the time complexity of $O({\mid}V{\mid}^2{\mid}E{\mid})$. The proposed algorithm on the other hand firstly constructs a $p_{ij}$ matrix of inter-preference sum both sexes' preference over the opposite sex. Secondly, it selects $_{min}p_i$ from each row to establish ${\mid}p_{.j}{\mid}{\geq}2,j{\in}S$, ${\mid}p_{.j}{\mid}=1$, $j{\in}H$, ${\mid}p_{.j}{\mid}=0$, $j{\in}T$. Finally, it shifts $_{min}\{_{min}p_{ST},p_{SH}+p_{HT\}$ for $_{min}P_{ST}$ of $S{\rightarrow}T$ and $p_{SH}+p_{HT}$, $p_{HT}<_{min}p_{ST}$ of $S{\rightarrow}H$, $H{\rightarrow}T$. The proposed algorithm has not only improved the Gale-Shapley's algorithm's complexity of $O({\mid}V{\mid}^2{\mid}E{\mid})$ to $O({\mid}V{\mid}^2)$ but also proved its extendable use on unbalanced marriage problems.

Proposal of a new method for learning of diesel generator sounds and detecting abnormal sounds using an unsupervised deep learning algorithm

  • Hweon-Ki Jo;Song-Hyun Kim;Chang-Lak Kim
    • Nuclear Engineering and Technology
    • /
    • v.55 no.2
    • /
    • pp.506-515
    • /
    • 2023
  • This study is to find a method to learn engine sound after the start-up of a diesel generator installed in nuclear power plant with an unsupervised deep learning algorithm (CNN autoencoder) and a new method to predict the failure of a diesel generator using it. In order to learn the sound of a diesel generator with a deep learning algorithm, sound data recorded before and after the start-up of two diesel generators was used. The sound data of 20 min and 2 h were cut into 7 s, and the split sound was converted into a spectrogram image. 1200 and 7200 spectrogram images were created from sound data of 20 min and 2 h, respectively. Using two different deep learning algorithms (CNN autoencoder and binary classification), it was investigated whether the diesel generator post-start sounds were learned as normal. It was possible to accurately determine the post-start sounds as normal and the pre-start sounds as abnormal. It was also confirmed that the deep learning algorithm could detect the virtual abnormal sounds created by mixing the unusual sounds with the post-start sounds. This study showed that the unsupervised anomaly detection algorithm has a good accuracy increased about 3% with comparing to the binary classification algorithm.

Motion vector compression in H.264 with leaf mode (단말 모드 방식을 도입한 H.264의 움직임 벡터 압축)

  • Lee, Dong-Shik;Kim, Young-Mo
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.10
    • /
    • pp.1487-1493
    • /
    • 2010
  • H.264 processes more detailed and more motion information for the compression efficiency. However, motion vector of H.264 takes more portion than previous standards such as MPEG-1/2/4 do, so that it is needed to consider motion vectors. This paper proposes the new algorithm with leaf mode in order to compress the motion vector efficiently. The proposed algorithm concentrates modes' distribution with leaf mode and carries out the compression of motion vector with less modes. The proposed algorithm adopted in current $4{\times}4$ motion vector matrix also can be extend to $8{\times}8$. The experiments shows that the proposed algorithm reduces up to 12.68% at header and 9.7% at resultant bitstream.

A Visual Weighting-Based Bit Allocation Algorithm for H.264 Scalable Extension(SE) (H.264 스케일러블 확장을 위한 시각적 가중치 기반 비트 할당 알고리즘)

  • Quan, Shan Guo;Ha, Ho-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.5
    • /
    • pp.650-657
    • /
    • 2011
  • This paper proposes a novel bit allocation algorithm for H.264 scalable extension(SE) based on a human visual system (HVS) to improve the coding efficiency. The proposed algorithm is consist of two stages: visual weighting model and visual weighting-based bit allocation algorithm. In the first stage, the visual weighting for each macroblock (MB) is analyzed according to the region of interests. Then the adaptation of the visual weighting into the bit allocation routine for each quality layer is performed for improving the visual quality. In the simulation results, it is observed that the proposed scheme can improve the subjective and objective video quality in the same bit rate, compared to the previous scalable video coding in H.264.

Three Dimensional Geometric Feature Detection Using Computer Vision System and Laser Structured Light (컴퓨터 시각과 레이저 구조광을 이용한 물체의 3차원 정보 추출)

  • Hwang, H.;Chang, Y.C.;Im, D.H.
    • Journal of Biosystems Engineering
    • /
    • v.23 no.4
    • /
    • pp.381-390
    • /
    • 1998
  • An algorithm to extract the 3-D geometric information of a static object was developed using a set of 2-D computer vision system and a laser structured lighting device. As a structured light pattern, multi-parallel lines were used in the study. The proposed algorithm was composed of three stages. The camera calibration, which determined a coordinate transformation between the image plane and the real 3-D world, was performed using known 6 pairs of points at the first stage. Then, utilizing the shifting phenomena of the projected laser beam on an object, the height of the object was computed at the second stage. Finally, using the height information of the 2-D image point, the corresponding 3-D information was computed using results of the camera calibration. For arbitrary geometric objects, the maximum error of the extracted 3-D feature using the proposed algorithm was less than 1~2mm. The results showed that the proposed algorithm was accurate for 3-D geometric feature detection of an object.

  • PDF

Analysis of Induced Magnetic Field Bias in LEO Satellites Using Orbital Geometry-based Bias Estimation Algorithm (궤도 기하학 기반 바이어스 추정기법을 이용한 저궤도 위성의 유도자기장 바이어스 분석)

  • Lee, S.H.;Yong, K.L.;Choi, H.T.;Oh, S.H.;Yim, J.R.;Kim, Y.B.;Seo, H.H.;Lee, H.J.
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.36 no.11
    • /
    • pp.1126-1131
    • /
    • 2008
  • This paper applies the Orbital Geometry-based Bias Estimation Algorithm to the magnetometer measurement data of KOMPSAT-1 and 2 and analyzes the induced magnetic field bias caused by the solar panels and electronics boxes in spacecraft bus. This paper reveals that the estimation and correction of the induced magnetic field bias copes with the aging process of magnetometer and makes it possible to carry on the satellite mission by extending its lifetime.

Zigzag Tool-Path Linking Algorithm for Shaping Process Using Heat Source (열원을 이용한 공정에서 지그재그 공구 경로 연결 알고리즘)

  • Kim H. C.;Lee S. H.;Yang D. Y.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.9 no.4
    • /
    • pp.286-293
    • /
    • 2004
  • Recently, hot processing using the heat source like laser machining and RFS was developed and spreaded gradually. In order to generate tool-path for the proper hot tool, a new tool-path linking algorithm is needed because tool-path linking algorithm for machining can't be applied. In this paper, zigzag tool-path liking algorithm was proposed to generate tool-path automatically for RFS. The algorithm is composed of three steps: 1) Generating valid tool-path element, 2) Storing tool-path elements and creating sub-groups, 3) linking sub-groups. Using the proposed algorithm, CAD/CAM software for the tool-path generation of hot tool was developed. The proposed algorithm was applied and verified for Venus's face and die of cellular phone case.

Development of a Sequential Algorithm for a GNSS-Based Multi-Sensor Vehicle Navigation System

  • Jeon, Chang-Wan;Jee, Gyu-In;Gerard Lachapelle
    • International Journal of Control, Automation, and Systems
    • /
    • v.2 no.2
    • /
    • pp.165-170
    • /
    • 2004
  • RAIM techniques based on TLS have rarely been addressed because TLS requires a great number of computations. In this paper, the particular form of the observation matrix H, is exploited so as to develop a new TLS-based sequential algorithm to identify an errant satellite. The algorithm allows us to enjoy the advantages of TLS with less computational burden. The proposed algorithm is verified through a numerical simulation.

An MPEG2-to-H.264 Transcoding Method (MPEG2에서 H.264로의 트랜스코딩 기법)

  • Kim, Dong-Hyung;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7C
    • /
    • pp.706-715
    • /
    • 2005
  • In this paper, we present a transcoding algorithm for converting an MPEG-2 video bitstream to an H.264 bitstream. The proposed transcoder consists of two parts. One is MPEG2 decoding part and the other is H.264 encoding part Because our algorithm is for transcoding in the spatial domain, MPEG2 decoding part carries out full decoding of MPEG2 bitstream. While, because macroblock type and coded block pattern in MPEG2 are significantly related to macroblock mode in H.264, macroblock mode is selected adaptively according to macroblock type and coded block pattern in H.264 decoding part. Furthermore, motion vector is also used as side-information for 16$\ctimes$16 macroblock mode. Simulation results show that the proposed transcoder yields high reduction of total transcoding time at comparable PSNR.