• 제목/요약/키워드: quasi-exact sequence

검색결과 7건 처리시간 0.021초

ON QUASI-EXACT SEQUENCES

  • ANVARIYEH, S.M.;DAVVAZ, B.
    • 대한수학회보
    • /
    • 제42권1호
    • /
    • pp.149-155
    • /
    • 2005
  • The notion of U-exact sequence (or quasi-exact sequence) of modules was introduced by Davvaz and Parnian-Garamaleky as a generalization of exact sequences. In this paper, we prove further results about quasi-exact sequences. In particular, we give a generalization of Schanuel's Lemma. Also we obtain some relation-ship between quasi-exact sequences and superfluous (or essential) submodules.

A Note on the Fuzzy Linear Maps

  • Kim, Chang-Bum
    • 한국지능시스템학회논문지
    • /
    • 제21권4호
    • /
    • pp.506-511
    • /
    • 2011
  • In this paper we investigate some situations in connection with two exact sequences of fuzzy linear maps. Also we obtain a generalization of the work [Theorem4] of Pan [5], and we study the analogies of The Four Lemma and The Five Lemma of homological algebra. Finally we obtain a special exact sequence.

일반화한 쿼터너리 준직교 시퀀스 공간변조 기법 (Generalized Quaternary Quasi-Orthogonal Sequences Spatial Modulation)

  • 샹위롱;김호준;정태진
    • 한국통신학회논문지
    • /
    • 제41권4호
    • /
    • pp.404-414
    • /
    • 2016
  • So called quaternary quasi-orthogonal sequence spatial modulation (Q-QOS-SM) has been presented with an advantage of improved throughputs compared to the conventional SM and generalized spatial modulation (GSM) by virtue of a larger set size of QOSs and its minimized correlation value between these QOSs. However the Q-QOS-SM has been originally invented for limited transmit antennas of only powers of two. In this paper, by extending the Q-QOS-SM to any number of transmit antennas, we propose a generalized Q-QOS-SM, referred as G-QO-SM. Unlike the conventional Q-QOS-SM using the Q-QOSs of length of any power of two, the proposed G-QO-SM is constructed based on the Q-QOSs of only the lengths of 2 and 4. The proposed scheme guarantees the transmission of the total $N_t$ spatial bits with $N_t$ transmit antennas, and thus achieves greatly higher throughputs than the other existing schemes including the SM, GSM, Q-QOS-SM, Quadrature-SM, and Enhanced-SM. The performance improvements of the proposed G-QO-SM is justified by comparing the analytically derived BER upper bounds and also the exact Monte Carlo simulation results.

MONOIDAL FUNCTORS AND EXACT SEQUENCES OF GROUPS FOR HOPF QUASIGROUPS

  • Alvarez, Jose N. Alonso;Vilaboa, Jose M. Fernandez;Rodriguez, Ramon Gonzalez
    • 대한수학회지
    • /
    • 제58권2호
    • /
    • pp.351-381
    • /
    • 2021
  • In this paper we introduce the notion of strong Galois H-progenerator object for a finite cocommutative Hopf quasigroup H in a symmetric monoidal category C. We prove that the set of isomorphism classes of strong Galois H-progenerator objects is a subgroup of the group of strong Galois H-objects introduced in [3]. Moreover, we show that strong Galois H-progenerator objects are preserved by strong symmetric monoidal functors and, as a consequence, we obtain an exact sequence involving the associated Galois groups. Finally, to the previous functors, if H is finite, we find exact sequences of Picard groups related with invertible left H-(quasi)modules and an isomorphism Pic(HMod) ≅ Pic(C)⊕G(H∗) where Pic(HMod) is the Picard group of the category of left H-modules, Pic(C) the Picard group of C, and G(H∗) the group of group-like morphisms of the dual of H.

2차모멘트 난류모형을 이용한 정사각 단면 곡덕트 내 발달하는 난류유동 변화에 대한 고찰 (Investigation on the Developing Turbulent Flow In a Curved Duct of Square Cross-Section Using a Low Reynolds Number Second Moment Turbulence Closure)

  • 전건호;최영돈;신종근
    • 대한기계학회논문집B
    • /
    • 제23권8호
    • /
    • pp.1063-1071
    • /
    • 1999
  • Fine grid calculations are reported for the developing turbulent flow in a curved duct of square cross-section with a radius of curvature to hydraulic diameter ratio ${\delta}=Rc/D_H=3.357 $ and a bend angle of 720 deg. A sequence of modeling refinements is introduced; the replacement of wall function by a fine mesh across the sublayer and a low Reynolds number algebraic second moment closure up to the near wall sublayer in which the non-linear return to isotropy model and the cubic-quasi-isotropy model for the pressure strain are adopted; and the introduction of a multiple source model for the exact dissipation rate equation. Each refinement is shown to lead to an appreciable improvement in the agreement between measurement and computation.

정사각 직관과 $180^{\circ}$ 곡관내 난류유동의 레이놀즈응력모형 적용 (Turbulent Flow through a Square Straight and Curved Duct with Reynolds Stress Models)

  • 전건호;최영돈
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2000년도 춘계학술대회논문집B
    • /
    • pp.771-776
    • /
    • 2000
  • Fine grid calculations are reported for the developing turbulent flow in a straight duct and a curved duct of square cross-section with a radius of curvature to hydraulic diameter ratio ${\delta}=R_c/H_H=3.357$ and a bend angle of 180 deg. A sequence of modeling refinements is introduced; the replacement of wall function by a fine mesh across the sublayer and a low Reynolds number second moment closure up to the near wall sublayer in which the non-linear return to isotropy model and the cubic-quasi-isotropy model for the pressure strain are adopted; and the introduction of a multiple source model for the exact dissipation rate equation. Each refinement is shown to lead to an appreciable improvement in the agreement between measurement and computation.

  • PDF

레이더의 반 대응 능력을 위한 M-시퀀스 코드 기반의 펄스반복간격 지터 코더 구현 (Jittered Pulse Repetition Interval Coder Based on M-sequence Codes for Counter-Countermeasure of a Radar)

  • 표순오;서동선;조준용;이재철
    • 전기전자학회논문지
    • /
    • 제15권2호
    • /
    • pp.171-178
    • /
    • 2011
  • 본 논문에서는 레이더의 반대응 능력을 개선하기 위한 의사 랜덤 M 시퀀스 코드 기반의 새로운 펄스반복간격 (PRI) 지터 코더를 제안한다. 제안된 256개의 지터 PRI 코드 각각은 256 코드 칩의 유일한 조합으로 이루어져 있어서, 임의의 코드에서 선택된 어떠한 3개의 연속된 코드 칩(4개의 펄스)의 조합이라도 코드들의 모든 코드 칩 시퀀스들 중에서 오직 한 번만 존재한다. 이는 4개의 펄스만 수신하면 전송된 코드 식별은 물론이고 반대응을 위해 요구되는 수신 펄스열(또는 코드 시퀀스)의 정확한 타이밍을 결정할 수 있다는 것을 의미한다. 제안된 아이디어를 실험적으로 입증하기 위해, 상기 지터 PRI 코더를 구현하고 시연한다.