• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2005년도 전력전자학술대회 논문집
• /
• pp.687-689
• /
• 2005

Francis turbine of commercial small hydro -power plants under 10kw which is investigate a flow characterist and an efficiency in the research which it sees, the problem and an improvement is investigate. In the research which it is simply model with casing, guide-vane, runner, draft tube for simulation numerical analysis of small-sized Francis turbine. model uses the Gambit and it composes with approximately 800,000 nonuniform lattices. Solutions are investigate the hydraulic characteristics against an outward angle of guide vane, the number of guide vane, head(inlet velocity) by using FLUENT which is a commercial business code.

• 한국자기학회:학술대회 개요집
• /
• 한국자기학회 2017년도 임시총회 및 하계학술연구발표회
• /
• pp.227-227
• /
• 2017

• 한국광학회지
• /
• 제12권6호
• /
• pp.479-484
• /
• 2001

광자 크리스탈의 광자 밴드갭이나 비정상적인 광 분산 현상 등의 특성을 분석하려면 광자 크리스탈 구조에 따른 밴드 구 조와 분산 곡선의 계산이 필요하다. 본 논문에서는 시간 영역에서의 계산 방법인 Finite-Difference Time-Domain방법과 주기적 경계 조건을 이용하여 밴드 구조와 분산 곡선을 계산하였으며, 몇 가지 간단한 2차원 크리스탈 구조에 대하여 그 계산 결과를 제시하였다. 또한 밴드갭 내부에 존재하고, 공간적으로 지역화된 디펙트 모드를 계산하였다.

• Kyungpook Mathematical Journal
• /
• 제46권1호
• /
• pp.145-152
• /
• 2006

In this paper, we study a class of strongly nonlinear implicit complementarity problems in the setting of Hilbert spaces H (not necessarily Hilbert lattices). By using the property of the projection and a suitable change of variables, we establish the equivalence between the strongly nonlinear implicit complementarity problem and the fixed point problem in H. Moreover, we use this equivalence and the fixed point theorem of Boyd and Wong to prove the existence and uniqueness of solutions for the strongly nonlinear implicit complementarity problem in H.

• Journal of Communications and Networks
• /
• 제18권1호
• /
• pp.1-7
• /
• 2016

Most of the previous proxy re-encryption schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, they cannot guarantee its security under quantum analysis, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. In the paper, we propose the first proxy re-encryption scheme based on the hard worst-case lattice problems. Our scheme has many useful properties as follows: Unidirectional, collusion-resistant, noninteractive, proxy invisible, key optimal, and nontransitive.We also provided the formal security proof of the proposed scheme in the random oracle model.

• Journal of Communications and Networks
• /
• 제15권1호
• /
• pp.1-7
• /
• 2013

Most of the provably-secure proxy signature schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, those schemes are insecure to quantum analysis algorithms, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. To make secure proxy signature schemes against quantum analysis, some lattice-based proxy signature schemes are suggested. However, none of the suggested lattice-based proxy signature schemes is proxy-protected in the adaptive security model. In the paper, we propose a provably-secure ID-based proxy signature scheme based on the lattice problems. Our scheme is proxy-protected in the adaptive security model.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2000년도 하계학술대회 논문집
• /
• pp.865-868
• /
• 2000

It was examined that the relationship between microstructures, electrical properties and crystal structure of (1-x)CaMnO$_3$-xCaTiO$_3$solid solution system which was made by mixing a semiconducting material CaMnO$_3$of low resistance and a dielectric material CaTiO$_3$of high resistance with variable ratios (x=0, 0.1, 0.3, 0.5, 0.7, 0.9, 1.0). As the CaTiO$_3$increased, the resistance, B constant and lattice constant were increased, but the grain size was decreased. On particular, above 50wt% of CaTiO$_3$, the resistance at 2 5$^{\circ}C$ was rapidly increased due to the correlation in connectivity of the lattices between the conductive Mn$^{+4}$ octahedron and the insulative Ti$^{+4}$ octahedron.ron.

• 한국광학회지
• /
• 제11권3호
• /
• pp.198-201
• /
• 2000

본 논문에서는 Finite-Difference Time-Domain 방법을 이용해서 2차원 광자 밴드캡 구조 중 정삼각형 격자 구조, 정사각형 격자 구조, 그리고 정육각형 격자 구조의 전파의 투과 특성과 디펙트 모드의 특성 변화를 고찰하였다. 디펙트 모드는 디펙트의 위치, 모양 : 유전율 등에 따라 다양하게 변화하는데, 본 논문에서는 특히 유전율 변화를 중심으로 특징을 고찰하였다.

• Kyungpook Mathematical Journal
• /
• 제57권1호
• /
• pp.85-97
• /
• 2017

The notions of regular uni-soft filters, uni-soft MV -filters and Boolean uni-soft filters are introduced, and related properties are investigated. Characterizations of regular uni-soft filters, uni-soft MV -filters and Boolean uni-soft filters are discussed.Relations between regular uni-soft filters and uni-soft MV -filters are considered. It is shown that the notion of a uni-soft MV -filter coincides with the notion of a regular uni-soft filter in BL-algebras.

• Kyungpook Mathematical Journal
• /
• 제60권1호
• /
• pp.1-20
• /
• 2020

A simple but elegant result of Rival states that every sublattice L of a finite distributive lattice 𝒫 can be constructed from 𝒫 by removing a particular family 𝒥_L of its irreducible intervals. Applying this in the case that 𝒫 is a product of a finite set 𝒞 of chains, we get a one-to-one correspondence L ↦ 𝒟_𝒫(L) between the sublattices of 𝒫 and the preorders spanned by a canonical sublattice 𝒞^⋄ of 𝒫. We then show that L is a tight sublattice of the product of chains 𝒫 if and only if 𝒟_𝒫(L) is asymmetric. This yields a one-to-one correspondence between the tight sublattices of 𝒫 and the posets spanned by its poset J(𝒫) of non-zero join-irreducible elements. With this we recover and extend, among other classical results, the correspondence derived from results of Birkhoff and Dilworth, between the tight embeddings of a finite distributive lattice L into products of chains, and the chain decompositions of its poset J(L) of non-zero join-irreducible elements.