• Title/Summary/Keyword: 최대 차수

Search Result 160, Processing Time 0.025 seconds

Curing and Rheological Behavior of Epoxy Resin Compositions for Underfill (언더필용 에폭시 수지 조성물의 경화 및 유변학적 거동)

  • Kim, Yoon-Jin;Park, Min;Kim, Jun-Kyung;Kim, Jin-Mo;Yoon, Ho-Gyu
    • Elastomers and Composites
    • /
    • v.38 no.3
    • /
    • pp.213-226
    • /
    • 2003
  • The cure and rheological behavior of diglycidyl ether of bisphenol F/nadic methyl anhydride resin system with the kinds of imidazole were studied using a differential scanning calorimeter (DSC) and a rotational rheometer. The isothermal traces were employed to analyze cure reaction. The DGEBF/ anhydride conversion profiles showed autocatalyzed reaction characterized by maximum conversion rate at $20{\sim}40 %$ of the reaction. The rate constants ($k_1,\;k_2$) showed temperature dependance, but reaction order did not. The reaction order (m+n) was calculated to be close to 3. There are two reaction mechanisms with the kinds oi catalyst. The gel time was determined by using G'-G" crossover method, and the activation energy was obtained from this results. From measurement of rheological properties it was found that the logarithmic 1:elation time of fused silica filled DBEBF epoxy compounds linearly increased with the content of filler and decreased with temperature. The highly filled epoxy compounds showed typical pseudoplastic behavior, and the viscosity of those decreased with increasing maximum packing ratio.

Algorithm for Maximum Degree Vertex Partition of Cutwidth Minimization Problem (절단 폭 최소화 문제의 최대차수 정점 분할 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.1
    • /
    • pp.37-42
    • /
    • 2024
  • This paper suggests polynomial time algorithm for cutwidth minimization problem that classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. To find the minimum cutwidth CWf(G)=max𝜈VCWf(𝜈)for given graph G=(V,E),m=|V|, n=|E|, the proposed algorithm divides neighborhood NG[𝜈i] of the maximum degree vertex 𝜈i in graph G into left and right and decides the vertical cut plane with minimum number of edges pass through the vertex 𝜈i firstly. Then, we split the left and right NG[𝜈i] into horizontal sections with minimum pass through edges. Secondly, the inner-section vertices are connected into line graph and the inter-section lines are connected by one line layout. Finally, we perform the optimization process in order to obtain the minimum cutwidth using vertex moving method. Though the proposed algorithm requires O(n2) time complexity, that can be obtains the optimal solutions for all of various experimental data

The implementation of Korean adult's optimal formant setting by Praat scripting (성인 포먼트 측정에서의 최적 세팅 구현: Praat software와 관련하여)

  • Park, Jiyeon;Seong, Cheoljae
    • Phonetics and Speech Sciences
    • /
    • v.11 no.4
    • /
    • pp.97-108
    • /
    • 2019
  • An automated Praat script was implemented to measure optimal formant frequencies for adults. Optimal formant analysis could be interpreted to show that the deviation of formant frequency that resulted from the two variously combined setting parameters (maximum formant and number of formants) was minimal. To increase the reliability of formant analysis, LPC order should be set differently, based on the gender or vowel type. Praat recommends 5,000 Hz and 5,500 Hz as maximum formant settings and, at the same time, recommends 5 as the number of formants for males and females. However, verification is needed to determine whether these recommended settings are valid for Korean vowels. Statistical analysis showed that formant frequencies significantly varied across the adapted scripts, especially with respect to the data on females. Formant plots and statistical results showed that linear_script and qtone_script are much more reliable in formant measurements. Among four kinds of scripts, the linear and qtone_scripts proved to be more stable and reliable. While the linear_script was designed to have a linearly increased formant step in for-loop, the increment of formant step in the qtone_script was arranged by quarter tone scale (base frequency×common ratio ($\sqrt[24]{2}$)). When looking at the tendency of the formant setting drawn by the two referred algorithms in the context of front vowel [i, e], the maximum formant was set higher; and the number of formants set at a lower value than recommended by Praat. The back vowel [o, u], on the contrary, has a lower maximum formant and a higher number of formants than the standard setting.

PRML detection using the patterns of run-length limited codes (런-길이 제한 코드의 패턴을 이용한 PRML 검출 방법)

  • Lee Joo hyun;Lee Jae jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3C
    • /
    • pp.77-82
    • /
    • 2005
  • Partial response maximum likelihood (PRML) detection using the Viterbi algorithm involves the calculation of likelihood metrics that determine the most likely sequence of decoded data. In general, it is assumed that branches at each node in the trellis diagram have same probabilities. If modulation code with minimum and maximum run-length constraints is used, the occurrence ratio (Ro) of each particular pattern is different, and therefore the assumption is not true. We present a calculation scheme of the likelihood metrics for the PRML detection using the occurrence ratio. In simulation, we have tested the two (1,7) run-length-limited codes and calculated the occurrence ratios as the orders of PR targets are changed. We can identify that the PRML detections using the occurrence ratio provide more than about 0.5dB gain compared to conventional PRML detections at 10/sup -5/ BER in high-density magnetic recording and optical recording channels.

A study of Landcover Classification Methods Using Airborne Digital Ortho Imagery in Stream Corridor (고해상도 수치항공정사영상기반 하천토지피복지도 제작을 위한 분류기법 연구)

  • Kim, Young-Jin;Cha, Su-Young;Cho, Yong-Hyeon
    • Korean Journal of Remote Sensing
    • /
    • v.30 no.2
    • /
    • pp.207-218
    • /
    • 2014
  • The information on the land cover along stream corridor is important for stream restoration and maintenance activities. This study aims to review the different classification methods for mapping the status of stream corridors in Seom River using airborne RGB and CIR digital ortho imagery with a ground pixel resolution of 0.2m. The maximum likelihood classification, minimum distance classification, parallelepiped classification, mahalanobis distance classification algorithms were performed with regard to the improvement methods, the skewed data for training classifiers and filtering technique. From these results follows that, in aerial image classification, Maximum likelihood classification gave results the highest classification accuracy and the CIR image showed comparatively high precision.

A Research into a Device for Measuring the Electric Power Quality and the Harmonic Frequency (전력 품질 및 전력 고조파 측정 장치에 관한 연구)

  • Oh, Kyutae;Yoo, Youngkil
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.10
    • /
    • pp.233-239
    • /
    • 2012
  • The harmonic frequency occurred in a power system causes errors and failures of equipments such as motors, and an unnecessary power consumption. The fundamental countermeasure for the harmonic frequency is to eliminate the cause of the harmonic frequency. This paper describes about making the device to figure out the cause in real time, verifying the operation of the device, and utilizing it to various power quality measurements. The power usually has the line frequency between 45Hz and 66Hz. In this research, the number of the harmonic frequencies which can be analysed inside the 2.8kHz bandwidth, the filter bandwidth of ADE7880, is 2800/f, and the maximum is 2800/45 = 63. The maximum order of the harmonic frequency in Korea, which has the line frequency of 60Hz, was measured as 2800/60 = 46th. Also, the accuracy of the voltage, current, and power measurement had the error within 0.1%, confirming that it is very precise.

Fundamental Study on Geotechnical Properties of Sand-Bentonite Mixtures (모래-벤토나이트 혼합물의 지반 공학적특성에 관한 기초 연구)

  • 권무남;유택항
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.39 no.6
    • /
    • pp.99-110
    • /
    • 1997
  • The study was conducted in order to investigate the basic geotechnical properties of sand-bentonite mixtures with the various bentonite contents. The results obtained are as follows : 1. Optimum moisture content of sand-bentonite mixtures was approximately 17.10~18.52% corresponding to the maximum dry density of 1.58~1 .64gf/$cm^3$. As the bentonite contents and curing peroid increased, both the maximum dry density and optimum moisture content of sand-bentonite mixtures increased. 2. The unconfined compressive strength of sand-bentonite mixtures increased as the increase of bentonite content, but it did not change along the curing period. 3. The sand-bentonite mixtures ruptured at 8~15% of the axial strain and the maxi-mum shearing stress was about O.7Okgf/$cm^2$. 4. According to the increase of bentonite content, the cohesion intercept and internal friction of the sand-bentonite mixtures increased slightly in the shear test, while the cohesion intercept increased largely, and the internal friction angle decreased largely in the triaxial test. 5. Both the initial void ratio and swelling of the sand-bentonite mixtures were very low with respect to the consolidation pressure increase. 6. The swelling and shrinkage of sand-bentonite mixtures increased slightly according to the increment of bentonite content.

  • PDF

An Efficient Architecture for Modified Karatsuba-Ofman Algorithm (불필요한 연산이 없는 카라슈바 알고리즘과 하드웨어 구조)

  • Chang Nam-Su;Kim Chang-Han
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.3 s.345
    • /
    • pp.33-39
    • /
    • 2006
  • In this paper we propose the Modified Karatsuba-Ofman algorithm for polynomial multiplication to polynomials of arbitrary degree. Leone proposed optimal stop condition for iteration of Karatsuba-Ofman algorithm(KO). In this paper, we propose a Non-Redundant Karatsuba-Ofman algorithm (NRKOA) with removing redundancy operations, and design a parallel hardware architecture based on the proposed algorithm. Comparing with existing related Karatsuba architectures with the same time complexity, the proposed architecture reduces the area complexity. Furthermore, the space complexity of the proposed multiplier is reduced by 43% in the best case.

Non-isothermal TGA Study on Thermal Degradation Kinetics of ACM Rubber Composites (비등온 TGA를 이용한 ACM 고무복합재료의 열분해 거동 연구)

  • Ahn, WonSool;Lee, Hyung Seok
    • Elastomers and Composites
    • /
    • v.48 no.2
    • /
    • pp.161-166
    • /
    • 2013
  • Thermal degradation behavior of chlorine cure-site ACM and carboxylic cure-site ACM rubbers was studied by non-isothermal TGA thermal analysis. Carboxylic cure-site ACM rubber exhibited comparatively more thermally stable than chlorine cure-site ACM, showing higher peak temperature, at which maximum reaction rate occurred. Activation energies from Kissinger method were calculated as 118.6 kJ/mol for the chlorine cure-site ACM and 105.5 kJ/mol for the carboxylic cure-site ACM, showing similar values from Flynn-Wall-Ozawa analysis over the conversion range of 0.1~0.2. From the analysis of the reaction order change, both samples seemed thermally decomposed through the multiple reaction mechanism as is the common rubber materials.

Response Surface Modeling by Genetic Programming II: Search for Optimal Polynomials (유전적 프로그래밍을 이용한 응답면의 모델링 II: 최적의 다항식 생성)

  • Rhee, Wook;Kim, Nam-Joon
    • Journal of Information Technology Application
    • /
    • v.3 no.3
    • /
    • pp.25-40
    • /
    • 2001
  • This paper deals with the problem of generating optimal polynomials using Genetic Programming(GP). The polynomial should approximate nonlinear response surfaces. Also, there should be a consideration regarding the size of the polynomial, It is not desirable if the polynomial is too large. To build small or medium size of polynomials that enable to model nonlinear response surfaces, we use the low order Tailor series in the function set of GP, and put the constrain on generating GP tree during the evolving process in order to prevent GP trees from becoming too large size of polynomials. Also, GAGPT(Group of Additive Genetic Programming Trees) is adopted to help achieving such purpose. Two examples are given to demonstrate our method.

  • PDF