• Title/Summary/Keyword: Optimal Decomposition

Search Result 337, Processing Time 0.03 seconds

Phase Transitions of $LiMn_2O_4$ on $CO_2$ Decomposition (($CO_2$ 분해시 $LiMn_2O_4$의 상변화)

  • Kwoen, Tae-Hwan;Yang, Chun-Mo;Park, Young-Goo;Cho, Young-Koo;Rim, Byung-O
    • Journal of the Korean Applied Science and Technology
    • /
    • v.20 no.1
    • /
    • pp.33-43
    • /
    • 2003
  • $LiMn_2O_4$ catalyst for $CO_2$ decomposition was synthesized by oxidation method for 30 min at 600$^{\circ}C$ in an electric furnace under air condition using manganese(II) nitrate $(Mn(NO_3)_2{\cdot}6H_2O)$, Lithium nitrate ($LiNO_3$) and Urea $(CO(NH_2)_2)$. The synthesized catalyst was reduced by $H_2$ at various temperatures for 3 hr. The reduction degree of the reduced catalysts were measured using the TGA. And then $CO_2$ decomposition rate was measured using the reduced catalysts. Phase-transitions of the catalysts were observed after $CO_2$ decomposition reaction at an optimal decomposition temperature. As the result of X-ray powder diffraction analysis, the synthesized catalyst was confirmed that the catalyst has the spinel structure, and also confirmed that when it was reduced by $H_2$, the phase of $LiMn_2O_4$ catalyst was transformed into $Li_2MnO_3$ and $Li_{1-2{\delta}}Mn_{2-{\delta}}O_{4-3{\delta}-{\delta}'}$ of tetragonal spinel phase. After $CO_2$ decomposition reaction, it was confirmed that the peak of $LiMn_2O_4$ of spinel phase. The optimal reduction temperature of the catalyst with $H_2$ was confirmed to be 450$^{\circ}C$(maximum weight-increasing ratio 9.47%) in the case of $LiMn_2O_4$ through the TGA analysis. Decomposition rate(%) using the $LiMn_2O_4$ catalyst showed the 67%. The crystal structure of the synthesized $LiMn_2O_4$ observed with a scanning electron microscope(SEM) shows cubic form. After reduction, $LiMn_2O_4$ catalyst became condensed each other to form interface. It was confirmed that after $CO_2$ decomposition, crystal structure of $LiMn_2O_4$ catalyst showed that its particle grew up more than that of reduction. Phase-transition by reduction and $CO_2$ decomposition ; $Li_2MnO_3$ and $Li_{1-2{\delta}}Mn_{2-{\delta}}O_{4-3{\delta}-{\delta}'}$ of tetragonal spinel phase at the first time of $CO_2$ decomposition appear like the same as the above contents. Phase-transition at $2{\sim}5$ time ; $Li_2MnO_3$ and $Li_{1-2{\delta}}Mn_{2-{\delta}}O_{4-3{\delta}-{\delta}'}$ of tetragonal spinel phase by reduction and $LiMn_2O_4$ of spinel phase after $CO_2$ decomposition appear like the same as the first time case. The result of the TGA analysis by catalyst reduction ; The first time, weight of reduced catalyst increased by 9.47%, for 2${\sim}$5 times, weight of reduced catalyst increased by average 2.3% But, in any time, there is little difference in the decomposition ratio of $CO_2$. That is to say, at the first time, it showed 67% in $CO_2$ decomposition rate and after 5 times reaction of $CO_2$ decomposition, it showed 67% nearly the same as the first time.

Faster Ate Pairing Computation over Pairing-Friendly Ellipitic Curves Using GLV Decomposition

  • Eom, Soo Kyung;Lee, Eunjeong;Lee, Hyang-Sook
    • ETRI Journal
    • /
    • v.35 no.5
    • /
    • pp.880-888
    • /
    • 2013
  • The preexisting pairings ate, $ate_i$, R-ate, and optimal-ate use q-expansion, where q is the size of the defining field for the elliptic curves. Elliptic curves with small embedding degrees only allow a few of these pairings. In such cases, efficiently computable endomorphisms can be used, as in [11] and [12]. They used the endomorphisms that have characteristic polynomials with very small coefficients, which led to some restrictions in finding various pairing-friendly curves. To construct more pairing-friendly curves, we consider ${\mu}$-expansion using the Gallant-Lambert-Vanstone (GLV) decomposition method, where ${\mu}$ is an arbitrary integer. We illustrate some pairing-friendly curves that provide more efficient pairing from the ${\mu}$-expansion than from the ate pairing. The proposed method can achieve timing results at least 20% faster than the ate pairing.

Decomposition of EMG Signal Using MAMDF Filtering and Digital Signal Processor

  • Lee, Jin;Kim, Jong-Weon;Kim, Sung-Hwan
    • Journal of Biomedical Engineering Research
    • /
    • v.15 no.3
    • /
    • pp.281-288
    • /
    • 1994
  • In this paper, a new decomposition method of the interference EMG signal using MAMDF filtering and digital signal processor. The efficient software and hardware signal processing techniques are employed. The MAMDF filter is employed in order to estimate the presence and likely location of the respective templates which may include in the observed mixture, and high-resolution waveform alignment is employed in order to provide the optimal combination set and time delays of the selected templates. The TMS320C25 digital signal processor chip is employed in order to execute the intensive calculation part of the software. The method is verified through a simulation with real templates which are obtain ed from needle EMG. As a result, the proposed method provides an overall speed improvement of 32-40 times.

  • PDF

A Study on the Power Spectral Analysis of Background EEG with Pisarenko Harmonic Decomposition (Pisarenko Harmonic Decomposition에 의한 배경 뇌파 파워 스펙트럼 분석에 관한 연구)

  • Jung, Myung-Jin;Hwang, Soo-Young;Choi, Kap-Seok
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1271-1275
    • /
    • 1987
  • With the stochastic process which consists of the harmonic sinusoid and the white nosie, the power spectrum of background EEG is estimated by the Pisarenko Harmonic Decomposition. The estimating results are examined and compared with the results from the maximum entropy spectral estimation, and the optimal order of this model can be determined from the eigen value's fluctuation of autocorrelation of background EEG. From the comparing results, this paper ensures that this method is possible to analyze the power spectrum of background EEG.

  • PDF

A Study on Calculation and Decomposition of Bus Incremental Cost on Power System Operation (계통운전상태에서의 모선증분비용 산정 및 분해에 관한 연구)

  • Kim, Y.H.;Lee, Buhm;Choi, S.K.;Moon, H.K;Lee, J.G.;Yeon, J.H.
    • Proceedings of the KIEE Conference
    • /
    • 2002.11b
    • /
    • pp.105-107
    • /
    • 2002
  • This paper provides calculation and decomposition of Bus Incremental Cost on Power System Operation. In this method we show deriving Shadow Price from state variables in Optimal condition. And the decomposition can give a detailed description of each Bus Incremental Cost. The proposed method is applied to IEEE-30 and results shows the effectiveness of the method.

  • PDF

A study of decomposition of harmful gases using Composite catalyst by Photocatalytic plasma reactions (복합촉매를 이용한 플라즈마 반응에 의한 유해가스의 제거에 관한 연구)

  • Kim, Gwan-Jung;U, In-Seong;Park, Hwa-Yong;Lee, Hong-Ju
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2012.04a
    • /
    • pp.421-433
    • /
    • 2012
  • The objective of this study is to obtain the optimal process condition and the maximum decomposition efficiency by measuring the decomposition efficiency, electricity consumption, and voltage in accordance with the change of the process variables such as the frequency, maintaining time period, concentration, electrode material, thickness of the electrode, the number of windings of the electrode, and added materials etc. of the harmful atmospheric contamination gases such as NO, $NO_2$, and $SO_2$etc. with the plasma which is generated by the discharging of the specially designed and manufactured $TiO_2$ catalysis reactor and SPCP reactor.

  • PDF

Constrained Multi-Area Dispatch Scheduling Algorithm with Regionally Distributed Optimal Power Flow Using Alternating Direction Method (ADM 기반 분산처리 최적조류계산을 이용한 다지역 제약급전계획 알고리즘)

  • Chung, Koo-Hyung;Kim, Bal-Ho;Lee, Jong-Joo;Kim, Hak-Man
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.59 no.3
    • /
    • pp.245-252
    • /
    • 2010
  • This paper proposes a constrained multi-area dispatch scheduling algorithm applicable to interconnected power system operations. The dispatch scheduling formulated as an MIP problem can be efficiently computed by GBD algorithm. GBD guarantees adequate computation speed and solution convergence by reducing the dimension of the dispatch scheduling problem. In addition, the regional decomposition technique based on ADM is introduced to obtain efficient inter-temporal OPF solution. It can find the most economic dispatch schedule incorporating power transactions without each regional utility's private information open.

A study on the proper orthogonal decomposition of the structural dynamic system (구조진동시스템의 적합직교분해에 관한 연구)

  • Baek, Sung-Min;Cho, Maeng-Hyo
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2010.04a
    • /
    • pp.171-174
    • /
    • 2010
  • 적절한 근사화 과정을 통하여 구축된 축소 시스템은 전체 시스템의 거동을 적은 수의 정보를 통하여 효과적으로 표현할 수 있다. 효과적인 시스템 축소를 위하여 본 연구에서는 주파수 영역 Karhunen-Loeve (Frequency-domain Karhunen-Loeve, FDKL) 기법과 시스템 등가 확장 축소 과정(System equivalent expansion reduction process, SEREP)을 연동한 축소 기법을 제안한다. 적합직교분해(Proper orthogonal decomposition)의 한 방법인 FDKL기법을 통하여 최적모드(Optimal mode)를 구하고 이에 SEREP을 적용하여 자유도 변환 행렬을 구한다. 이때 주자유도 선정은 2단계 축소기법을 적용한다. 최종적으로 제안된 기법은 수치예제를 통하여 검증한다.

  • PDF

A Text Similarity Measurement Method Based on Singular Value Decomposition and Semantic Relevance

  • Li, Xu;Yao, Chunlong;Fan, Fenglong;Yu, Xiaoqiang
    • Journal of Information Processing Systems
    • /
    • v.13 no.4
    • /
    • pp.863-875
    • /
    • 2017
  • The traditional text similarity measurement methods based on word frequency vector ignore the semantic relationships between words, which has become the obstacle to text similarity calculation, together with the high-dimensionality and sparsity of document vector. To address the problems, the improved singular value decomposition is used to reduce dimensionality and remove noises of the text representation model. The optimal number of singular values is analyzed and the semantic relevance between words can be calculated in constructed semantic space. An inverted index construction algorithm and the similarity definitions between vectors are proposed to calculate the similarity between two documents on the semantic level. The experimental results on benchmark corpus demonstrate that the proposed method promotes the evaluation metrics of F-measure.

Optimal Variable Step Size for Simplified SAP Algorithm with Critical Polyphase Decomposition (임계 다위상 분해기법이 적용된 SAP 알고리즘을 위한 최적 가변 스텝사이즈)

  • Heo, Gyeongyong;Choi, Hun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.11
    • /
    • pp.1545-1550
    • /
    • 2021
  • We propose an optimal variable step size adjustment method for the simplified subband affine projection algorithm (Simplified SAP; SSAP) in a subband structure based on a polyphase decomposition technique. The proposed method provides an optimal step size derived to minimize the mean square deviation(MSD) at the time of updating the coefficients of the subband adaptive filter. Application of the proposed optimal step size in the SSAP algorithm using colored input signals ensures fast convergence speed and small steady-state error. The results of computer simulations performed using AR(2) signals and real voices as input signals prove the validity of the proposed optimal step size for the SSAP algorithm. Also, the simulation results show that the proposed algorithm has a faster convergence rate and good steady-state error compared to the existing other adaptive algorithms.