• Bulletin of the Korean Chemical Society
• /
• v.31 no.7
• /
• pp.1875-1880
• /
• 2010

A dicycle pyrazoline derivative, 1-phenyl-5-(p-fluorophenyl)-3,4-($\alpha$-p-fluoro-tolylenecyclohexano) pyrazoline, was synthesized and characterized by elemental analysis, IR, UV-vis, fluorescence spectra and X-ray single crystal diffraction. Density function theory (DFT) calculations were performed by using B3LYP method with 6-$311G^{**}$ basis set. The optimized geometry can well simulate the molecular structure. Vibrational frequencies were predicted, assigned and compared with the experimental values, which suggest that B3LYP/6-$311G^{**}$ method can well predict the IR spectra. Both the experimental electronic absorption spectra and the predicted ones by B3LYP/6-$311G^{**}$ method reveal three electron-transition bands, with the theoretical ones having some red shifts compared with the experimental data. Natural bond orbital analyses indicate that the absorption bands are mainly derived from the contribution of n $\rightarrow\pi^*$ and $\pi\rightarrow\pi^*$ transitions. Fluorescence spectra determination shows that the title compound can emit blue-light at about 478 nm. On the basis of vibrational analysis, the thermodynamic properties of title compound at different temperature have been calculated, revealing the correlations between $C^0_{p,m}$, $S^0_m$, $H^0_m$ and temperature.

• MALSORI
• /
• no.66
• /
• pp.1-20
• /
• 2008

The purpose of this study was to investigate the characteristics of fundamental frequency(F0) and amplitude distributions in persons with cerebral palsy(CP) in the reading task. Participants were divided into three groups: 6 persons with spastic CP, 6 persons with athetoid CP and 6 normal persons who are around 15-20 years old. On the results of this study, firstly, in F0 distributions, most of the spastic CPs tended to appear narrow distributions on the basis of mode, but most of the athetoid CPs were opposite, and both of the CP groups tended to distribute highly on lower and higher frequencies than mean and mode. On the other hand, normal persons had a tendency to appear narrow distributions on the basis of mode. Finally, in amplitude distributions, the spastic CPs showed a tendency that there are little differences between the distribution of mode and the others, and most of the athetoid CPs showed a tendency that the distributions of mode were higher than the others. In addition to, the normal persons had a tendency that the distributions of mode were remarkably higher than both of the CP groups.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.382-386
• /
• 2009

Online or sequential learning is one of the most basic and powerful method to train neuron network, and it has been widely used in disease detection, weather prediction and other realistic classification problem. At present, there are many algorithms in this area, such as MRAN, GAP-RBFN, OS-ELM, SVM and SMC-RBF. Among them, SMC-RBF has the best performance; it has less number of hidden neurons, and best efficiency. However, all the existing algorithms use signal normal distribution as kernel function, which means the output of the kernel function is same at the different direction. In this paper, we use multi-variable normal distribution as kernel function, and derive EKF learning formulas for multi-variable normal distribution kernel function. From the result of the experience, we can deduct that the proposed method has better efficiency performance, and not sensitive to the data sequence.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1990.10a
• /
• pp.229-233
• /
• 1990

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.2
• /
• pp.48-54
• /
• 2014

For the element ${\alpha}{\in}GF(p^n)$, two kinds of bases are known. One is a conventional polynomial basis of the form $\{1,{\alpha},{\alpha}^2,{\cdots},{\alpha}^{n-1}\}$, and the other is a normal basis of the form $\{{\alpha},{\alpha}^p,{\alpha}^{p^2},{\cdots},{\alpha}^{p^{n-1}}\}$. In this paper we consider the method of generating normal bases which construct the finite field $GF(p^n)$, as an n-dimensional extension of the finite field GF(p). And we analyze the code sequence generating algorithm and derive the implementation functions of code sequence generator based on the normal bases. We find the normal polynomials of degrees, n=5 and n=7, which can generate normal bases respectively, design, and construct the code sequence generators based on these normal bases. Finally, we produce two code sequence groups(n=5, n=7) by using Simulink, and analyze the characteristics of the autocorrelation function, $R_{i,i}(\tau)$, and crosscorrelation function, $R_{i,j}(\tau)$, $i{\neq}j$ between two different code sequences. Based on these results, we confirm that the analysis of generating algorithms and the design and implementation of the code sequence generators based on normal bases are correct.

• The KIPS Transactions:PartC
• /
• v.15C no.2
• /
• pp.133-140
• /
• 2008

In this paper, we propose a high performance elliptic curve cryptographic processor over $GF(2^{163})$. The proposed architecture is based on a modified Lopez-Dahab elliptic curve point multiplication algorithm and uses Gaussian normal basis for $GF(2^{163})$ field arithmetic. To achieve a high throughput rates, we design two new word-level arithmetic units over $GF(2^{163})$ and derive a parallelized elliptic curve point doubling and point addition algorithm with uniform addressing based on the Lopez-Dahab method. We implement our design using Xilinx XC4VLX80 FPGA device which uses 24,263 slices and has a maximum frequency of 143MHz. Our design is roughly 4.8 times faster with 2 times increased hardware complexity compared with the previous hardware implementation proposed by Shu. et. al. Therefore, the proposed elliptic curve cryptographic processor is well suited to elliptic curve cryptosystems requiring high throughput rates such as network processors and web servers.

• Convergence Security Journal
• /
• v.2 no.2
• /
• pp.143-153
• /
• 2002

In this paper, we propose a multiplication scheme based on cellular automata and propose high speed multiplication scheme and exponentiation scheme using a optimal normal basis. And then EIGamal signature scheme is implemented by proposed schemes. A proposed multiplication and exponentiation scheme based on cellular automata can be used in restricted computing environments such that basis is frequently changed and cryptosystem and multimedia applications that are required high speed operations.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2006.05b
• /
• pp.429-432
• /
• 2006

The shrinkage mechanism of high strength concrete is different from that of normal concrete. The shrinkage of normal concrete is subjected to evaporate moisture in concrete, but most shrinkage in high strength concrete is caused by chemical reaction. To analyze shrinkage of concrete exactly, it is necessary to divide drying shrinkage with autogenous shrinkage in terms of degree of hydration, especially in concrete with low W/C ratio. The proposed method can provide a rational basis for prediction of shrinkage in high strength concrete structure.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.983-986
• /
• 2002

Support Vector Machine (SVM) is one of the methods of pattern recognition that separate input data using hyperplane. This method has high capability of pattern recognition by using the technique, which says kernel trick, and the Radial basis function (RBF) kernel is usually used as a kernel function in kernel trick. In this paper we propose using the q-normal distribution to the kernel function, instead of conventional RBF, and compare two types of the kernel function.

• Communications for Statistical Applications and Methods
• /
• v.12 no.2
• /
• pp.473-481
• /
• 2005

The testing problem for sphericity structure of the covariance matrix in a multivariate normal distribution is introduced when there is a sample with 2-step monotone missing data pattern. The maximum likelihood method is described to estimate the parameters on the basis of the sample. Using these estimates, the likelihood ratio criterion for testing sphericity is derived.