• Journal of the Korean Ceramic Society
• /
• v.33 no.12
• /
• pp.1365-1372
• /
• 1996

In order to obtain a transparent and dimer-free Ormosil embedded with orgainc dye variations of gel struc-ture and optical properties were studied as a functiion of the change of gel composition. The Ormosils which have good optical property were produced in the 90/10 ratio of TEOS/PDMS and the structural variations of the gel were achived by the change of ratio of HCl/TEOS. As the ratio of HCl/TEOS was increased pore size of the Ormosil enlarged and porosity increased. Increasing HCl concentration led to gradually lower trans-mittance values. In the xerogel doped with the organic dye Rhodamine 6G perchlorate a dimer peak near 500nm was observed with the increase of the ratio of HCl/TEOS

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.2
• /
• pp.16-26
• /
• 2001

This paper develops the fast dynamic programming technique to construct the subband structure yielding the maximum coding gain for given filter bases and a given limit of implementation complexity. We first derive the unified coding gain which can be applied to non-orthogonal filter basis as well as orthogonal filter basis and to arbitrary subband decompositions. Then, we verify that the unified coding gains in real systems are monotonically increasing function for the implementation complexities which are proportional to the number of subbands. By using this phenomenon, the implementation complexity and the coding gain are treated in the same way as the rate and distortion function. This makes it possible to use the Lagrangian multiplier method for finding the optimal subband decomposition producing the maximum coding gain [or a given limit of implementation complexity.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.12
• /
• pp.80-86
• /
• 2003

Elliptic curve cryptosystem(ECC) offers the highest security per bit among the known publick key system. The benefit of smaller key size makes ECC particularly attractive for embedded applications since its implementation requires less memory and processing power. In this paper, we propose a new multiplier structure with configurable output sizes and operation cycles. The number of output bits can be freely chosen in the new architecture with the performance-area trade-off depending on the application. Using the architecture, a 193-bit normal basis multiplier and inversion unit are designed in GF(2$^{m}$ ). It is implemented using HDL and 0.35${\mu}{\textrm}{m}$ CMOS technology and the operation is verified by simulation.

• Korean Journal of Head & Neck Oncology
• /
• v.3 no.1
• /
• pp.91-96
• /
• 1987

The basal cell adenoma of the parotid gland is rare benign disease, first described and adequately documented as a distinctive tumor from benigh mixed tumors(pleomorphic adenoma) by Kleinsasser and Klein in 1967. This tumors is an isomorphic epithelial tumor of salivery gland, characteristic of absence of myoepithelial cells which are present in pleomorphic adenoma and other salivery gland tumors. Clinicopathologically the tumors is very difficult to differentiate with pleomorphic adenoma or adenoid cystic carcinoma. The prognosis is excellent by complete extirpation of the tumor. The present report presents two cases of basal cell adenoma of the parotid gland seen in 63 year old man and 71 year old man in one-year period at Department of Surgery, Yonsei University, College of Medicine.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.5 no.2
• /
• pp.107-120
• /
• 1993

This paper presents a new modal solution of linear three-dimensional hydrodynamic equations using similarity transform technique. The governing equations are first separated into external and internal mode equations. The solution of the internal mode equation then proceeds as in previous modal models using the Galerkin method but with expansion of arbitrary basis functions. Application of similarity transform to resulting full matrix equations gives rise to a set of uncoupled partial differential equations of which the unknowns are coefficients of mode vector. Using the transform technique a computationally efficient time integration is possible. In present from the model use Chebyshev polynomials for Galerkin solution of internal mode equations. To examine model performance the model is applied to a homogeneous, rectangular basin of constant depth under steady, uniform wind field.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.48-52
• /
• 2008

In this paper, we propose a new selective subspace projection method in order to recognize the occlusive face image effectively. The conventional subspace projection method is project to basis image using a full image of face. The face recognition rate has reduced because the face characteristic is easy to be distorted by occlusion. To overcome this problem, the proposed method first decide to occlusion. If it hasn't an occlusion, we get the feature vectors with total basis projection using the conventional subspace projection method. If it has an occlusion, we get one with partial basis projection. We get better recognition rate than conventional PCA and NMF using AR face database with occlusive face images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9C
• /
• pp.915-921
• /
• 2009

Lenstra-Lenstra-Lovasz (LLL) algorithm, which is one of the lattice reduction (LR) techniques, has been extensively used to obtain better bases of the channel matrix. In this paper, we jointly apply Seysen's lattice reduction Algorithm (SA), instead of LLL, with the conventional linear precoding algorithms. Since SA obtains more orthogonal lattice bases compared to those obtained by LLL, lattice reduction aided (LRA) precoding based on SA algorithm outperforms the LRA precoding with LLL. Simulation results demonstrate that a gain of 0.5dB at target BER of $10^{-5}$ is achieved when SA is used instead of LLL or the LR stage.

• The KIPS Transactions:PartB
• /
• v.14B no.5
• /
• pp.377-382
• /
• 2007

This paper proposes a training algorithm for global optimization of the parameters of radial basis function networks. Since conventional training algorithms usually perform only local optimization, the performance of the network is limited and the final network significantly depends on the initial network parameters. The proposed hybrid simulated annealing algorithm performs global optimization of the network parameters by combining global search capability of simulated annealing and local optimization capability of gradient-based algorithms. Via experiments for function approximation problems, we demonstrate that the proposed algorithm can find networks showing better training and test performance and reduce effects of the initial network parameters on the final results.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.14 no.3
• /
• pp.381-390
• /
• 2001

In this paper, a new improved crack analysis technique by Element-Free Galerkin(EFG) method is proposed, in which the singularity and the discontinuity of the crack successfully described by adding enrichment terms containing a singular basis function to the standard EFG approximation and a discontinuity function implemented in constructing the shape function across the crack surface. The standard EFG method requires considerable addition of nodes or modification of the model. In addition, the proposed method significantly decreases the size of system of equation compared to the previous enriched EFG method by using localized enrichment region near the crack tip. Numerical example show the improvement and th effectiveness of the previous method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.105-112
• /
• 2009

In this paper, we propose a digital watermarking method using Multi-resolution Characteristic of 2D CAT (2D cellular automata transform). Firstly, we select the gateway values to generate a basis function and the basis function transforms images into cellular automata space. Then, we embed the random bit sequence as watermark in specific parts of cellular automata transform coefficients. The proposed method not only verifies higher fidelity than the existing method but also stronger stability on JPEG lossy compression, filtering, sharpening and noise through tests for robustness. Moreover, the proposed scheme allows only one 2D CAT basis function per gateway value. Since there are $2^{96}$ possible gateway values.