• Kyungpook Mathematical Journal
• /
• 제6권1호
• /
• pp.3-5
• /
• 1964

• 전기전자학회논문지
• /
• 제26권4호
• /
• pp.736-741
• /
• 2022

격자 기반 암호화는 최악의 경우를 기반으로 한 강력한 보안, 비교적 효율적인 구현 및 단순성을 누리기 때문에 포스트 양자 암호화 방식 중 가장 실용적인 방식이다. 오류가 있는 링 학습(R-LWE)은 격자 기반 암호화(LBC)의 공개키암호화(Public Key Encryption: PKE) 방식이며, R-LWE의 가장 중요한 연산은 링의 모듈러 다항식 곱셈이다. 본 논문은 R-LWE 암호 시스템의 중간 보안 수준의 매개 변수 집합을 대상으로 하여 근사 컴퓨팅(Approximate Computing: AC) 기술을 기반으로 한 모듈러 곱셈기를 최적화하는 방법을 제안한다. 먼저 복잡한 로직을 간단하게 구현하는 방법으로 LUT을 사용하여 근사 곱셈 연산 중 일부의 연산 과정을 생략하고, 2의 보수 방법을 활용하여 입력 데이터의 값을 이진수로 변환 시 값이 1인 비트의 개수를 최소화하여 필요한 덧셈기의 개수를 절감하는 총 두 가지 방법을 제안한다. 제안된 LUT 기반의 모듈식 곱셈기는 기존 R-LWE 모듈식 곱셈기 대비 속도와 면적 모두 9%까지 줄어들었고, 2의 보수 방법을 적용한 모듈식 곱셈기는 면적을 40%까지 줄이고 속도는 2% 향상되는 것으로 나타났다. 마지막으로 이 두 방법을 모두 적용한 최적화된 모듈식 곱셈기의 면적은 기존대비 43%까지 감소하고 속도는 10%까지 감소하는 것으로 나타났다.

• Nuclear Engineering and Technology
• /
• 제56권3호
• /
• pp.907-915
• /
• 2024

Various core designs with multi-batch fuel management (FM) are proposed and optimized for an innovative small modular reactor (iSMR), focusing on enhancing the inherent safety and neutronic performance. To achieve soluble-boron-free (SBF) operation, cylindrical centrally-shielded burnable absorbers (CSBAs) are utilized, reducing the burnup reactivity swing in both two- and three-batch FMs. All 69 fuel assemblies (FAs) are loaded with 2-cylindrical CSBA. Furthermore, the neutron economy is improved by deploying a truly-optimized PWR (TOP) lattice with a smaller fuel radius, optimized for neutron moderation under the SBF condition. The fuel shuffling and CSBA loading patterns are proposed for both 2- and 3-batch FM with the aim to lower the core leakage and achieve favorable power profiles. Numerical results show that both FM configurations achieve a small reactivity swing of about 1000 pcm and the power distributions are within the design criteria. The average discharge burnup in the two-batch core is comparable to three-batch commercial PWR like APR-1400. The proposed checker-board CR pattern with extended fingers effectively assures cold shutdown in the two-batch FM scenario, while in the three-batch FM, three N-1 scenarios are failed. The whole evaluation process is conducted using Monte Carlo Serpent 2 code in conjunction with ENDF/B-VII.1 nuclear library.

• 대한수학회보
• /
• 제31권2호
• /
• pp.237-242
• /
• 1994

One of the most well-known geometric lattices is a partition lattice. Every upper interval of a partition lattice is a partition lattice. The whitney numbers of a partition lattices are the Stirling numbers, and the characteristic polynomial is a falling factorial. The set of partitions with a single non-trivial block containing a fixed element is a Boolean sublattice of modular elements, so the partition lattice is supersolvable in the sense of Stanley [6]. In this paper, we rephrase four results due to Heller[1] and Murty [4] in terms of matroids and give several characterizations of partition lattices. Our notation and terminology follow those in [8,9]. To clarify our terminology, let G, be a finte geometric lattice. If S is the set of points (or rank-one flats) in G, the lattice structure of G induces the structure of a (combinatorial) geometry, also denoted by G, on S. The size vertical bar G vertical bar of the geometry G is the number of points in G. Let T be subset of S. The deletion of T from G is the geometry on the point set S/T obtained by restricting G to the subset S/T. The contraction G/T of G by T is the geometry induced by the geometric lattice [cl(T), over ^1] on the set S' of all flats in G covering cl(T). (Here, cl(T) is the closure of T, and over ^ 1 is the maximum of the lattice G.) Thus, by definition, the contraction of a geometry is always a geometry. A geometry which can be obtained from G by deletions and contractions is called a minor of G.

• 대한수학회논문집
• /
• 제23권4호
• /
• pp.461-468
• /
• 2008

We define an $\epsilon$-fuzzy congruence, which is a weakened fuzzy congruence, find the $\epsilon$-fuzzy congruence generated by the union of two $\epsilon$-fuzzy congruences on a semigroup, and characterize the $\epsilon$-fuzzy congruences generated by fuzzy relations on semigroups. We also show that the collection of all $\epsilon$-fuzzy congruences on a semigroup is a complete lattice and that the collection of $\epsilon$-fuzzy congruences under some conditions is a modular lattice.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2005년도 추계학술대회 학술발표 논문집 제15권 제2호
• /
• pp.496-499
• /
• 2005

In this paper, We discuss various types of sublattice of the lattice of intuitionistic fuzzy subgroups of a given group. We Prove that a special class of intuitionistic fuf normal subgroups constitutes a modular sublattice of the lattice of intuitionistic fuzzy subgroups. Moreover, we exhibit the relationship of the sublattices of the lattice of intuitionistic fuzzy subgroups.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제7권1호
• /
• pp.7-16
• /
• 2007

First, we investigate fuzzy equivalence relations on a set X in the sense of Youssef and Dib. Second, we discuss fuzzy congruences generated by a given fuzzy relation on a fuzzy groupoid. In particular, we obtain the characterizations of ${\rho}\;o\;{\sigma}{\in}$ FC(S) for any two fuzzy congruences ${\rho}\;and\;{\sigma}$ on a fuzzy groupoid ($S,{\odot}$). Finally, we study the lattice of fuzzy equivalence relations (congruences) on a fuzzy semigroup and give certain lattice theoretic properties.

• 조명전기설비학회논문지
• /
• 제25권8호
• /
• pp.122-131
• /
• 2011

In this paper, the design and analysis of a reconfigurable modular structure, which reforms itself according to the change of the environment and realize appropriate forms and motions, are dealt with. This modular is a free structure from the restrictions with constraints about fixed environment and has various forms and motions by combining units. The form of this unit has a shape of a square with 7 centimeters side each, and has a structure which can be combined in a chain-shape or a lattice-shape. Additionally, The structure has a mobility by being equipped with wheels so that it can be combined for itself. In this paper, all the wireless controllers, sensor system, and communicating method between modules according to module structures were suggested and transformation method to be transformed to shape of snakes, caterpillars were presented. Moreover, simulations for each method were performed to show the validity of the motions including motor torque analysis. All the motions suggested were realized and experimented, whereby the availability of the designed mechanism and algorithm was verified with the result of experiments.

• 전기전자학회논문지
• /
• 제25권1호
• /
• pp.88-94
• /
• 2021

현재 사용되고 있는 RSA, ECC와 같은 공개키 암호화 기법은 소인수분해와 같은 현재의 컴퓨터로 계산이 오래 걸리는 수학적 문제를 암호화에 사용했다. 그러나 양자컴퓨터가 상용화된다면 Shor Algorithm에 의해 기존의 암호화 시스템은 쉽게 깨질 수 있다. 그로 인해 Quantum-resistant 한 암호화 알고리즘의 도입이 필요해졌고, 그중 하나로 Lattice-based Cryptography가 제안되고 있다. 이 암호화 알고리즘은 Polynomial Ring에서 연산이 행해지고, 그중 Polynomial Multiplication이 가장 큰 연산 시간을 차지한다. 그러므로 다항식 곱셈 계산을 빠르게 하는 하드웨어 모듈이 필요하고, 그중 Finite Field에서 연산 되는 FFT인 Number Theoretic Transform을 이용해서 다항식 곱셈을 계산하는 8-point NTT-based Polynomial Multiplier 모듈을 설계하고 시뮬레이션했다. HDL을 사용하여 로직검증을 수행하였고, Hspice를 사용하여 트랜지스터 수준에서 제안된 설계가 지연시간과 전력소모에서 얼마나 개선되는지를 비교 분석하였다. 제안된 설계에서 평균 지연속도 30%의 개선과 8% 이상의 전력소모 감소 효과를 볼 수 있었다.

• 제어로봇시스템학회논문지
• /
• 제9권5호
• /
• pp.398-406
• /
• 2003

In modular fixturing systems, a given part or a subassembly is fixed by placing fixture elements such as locators and clamps adequately on a plate with a lattice of holes. It is known that the minimal number of point contacts to restrict translational and rotational motions on a plane is four and the type of three locators and a clamp(3L/1C) is the minimal future. Brost and Goldberg developed the complete algorithm to automatically synthesize 3L/1C types of fixtures which satisfy the condition of form closure. Due to the nature of the fixture, the clearance between the fixture and the part is extremely small. It is hard to load the part repeatedly and accurately for human as well as for robot. However the condition of loadability has not been taken into account in the B&G algorithm. In this paper, a new method to decide a given fixture to be loadable by using configuration space is proposed. A method to plan for a part to be loaded by using compliance safely even in the presence of control and sensing uncertainty is proposed is well.