• Journal of Radiation Protection and Research
• /
• 제7권1호
• /
• pp.56-60
• /
• 1982

핵분열(核分裂) 즉발중성자(卽發中性子)스펙트럼의 표현식(表現式)인 왓트식(式), 크란버그식(式) 및 멕스웰식(式)을 핵분열(核分裂)의 선원항(線源項)으로 취(取)하여 고디바계(系)와 제제벨계(系)의 유효증배계수(有效增倍係數)를 ANISN 전산(電算)코드로 산출(算出)하고 타(他) 연구자(硏究者)의 실험치(實驗値)와 비교(比較)해 보았다 .그 결과(結果) 실험치(實驗値)에 가장 가까운 값을 주는 것은 멕스웰식(式)으로 보였다. 이것은 곧 멕스웰식(式)이 핵분열(核分裂) 즉발중성자(卽發中性子)스펙트럼의 적절(適切)한 표현식(表現式)임을 의미(意味)한다.

• 한국정보과학회논문지:시스템및이론
• /
• 제30권5_6호
• /
• pp.324-329
• /
• 2003

Diffie-Hellman 키분배 시스템과 타원곡선 암호시스템과 같은 공개키 기반 암호시스템은 GF(2$^{m}$ ) 상에서 정의된 연산, 즉 덧셈, 뺄셈, 곱셈 및 곱셈 역원 연산을 기반으로 구축되며, 이들 암호시스템을 효율적으로 구현하기 위해서는 위 연산들을 고속으로 계산하는 것이 중요하다. 그 중에서 곱셈 역원이 가장 time-consuming하여 많은 연구 대상이 되고 있다. Format 정리에 의해$\beta$$\in$GF(2$^{m}$ )의 곱셈 역원 $\beta$$^{-1}$은 $\beta$$^{-1}$=$\beta$$^{2}$sup m/-2/이므로 GF(2$^{m}$ )의 임의의 원소에 대해 곱셈 역원을 고속으로 계산하기 위해서는, 2$^{m}$ -2을 효율적으로 분해하여 곱셈 횟수를 감소시키는 것이 가장 중요하며, 이와 관련된 알고리즘들이 많이 제안되어 왔다 이 중 Itoh와 Tsujii가 제안한 알고리즘[2]은 정규기저를 사용해서 필요한 곱셈 횟수를 O(log m)까지 감소시켰으며, 또한 이 알고리즘을 향상시킨 몇몇 알고리즘들이 제안되었지만, 분해과정이 복잡하다는 등의 단점이 있다[3,5]. 본 논문에서는 실제 어플리케이션에서 주로 많이 사용되는 m=2$^{n}$ 인 경우에, 인수분해 공식 x$^3$-y$^3$=(x-y)(x$^2$＋xy＋y$^2$)와 정규기저론 이용해서 곱셈 역원을 고속으로 계산하는 알고리즘을 제안한다. 본 논문의 알고리즘은 곱셈 횟수가 Itoh와 Tsujii가 제안한 알고리즘 보다 적으며, 2$^{m}$ -2의 분해가 기존의 알고리즘 보다 간단하다.

• ETRI Journal
• /
• 제32권2호
• /
• pp.222-229
• /
• 2010

A conventional pseudorandom sequence generator creates only 1 bit of data per clock cycle. Therefore, it may cause a delay in data communications. In this paper, we propose an efficient implementation method for a pseudorandom sequence generator with parallel outputs. By virtue of the simple matrix multiplications, we derive a well-organized recursive formula and realize a pseudorandom sequence generator with multiple outputs. Experimental results show that, although the total area of the proposed scheme is 3% to 13% larger than that of the existing scheme, our parallel architecture improves the throughput by 2, 4, and 6 times compared with the existing scheme based on a single output. In addition, we apply our approach to a $2{\times}2$ multiple input/multiple output (MIMO) detector targeting the 3rd Generation Partnership Project Long Term Evolution (3GPP LTE) system. Therefore, the throughput of the MIMO detector is significantly enhanced by parallel processing of data communications.

• 대한수학회지
• /
• 제42권2호
• /
• pp.203-222
• /
• 2005

Thompson series is a Hauptmodul for a genus zero group which lies between $\Gamma$o(N) and its normalizer in PSL2(R) ([1]). We construct explicit ring class fields over an imaginary quadratic field K from the Thompson series $T_g$($\alpha$) (Theorem 4), which would be an extension of [3], Theorem 3.7.5 (2) by using the Shimura theory and the standard results of complex multiplication. Also we construct various class fields over K, over a CM-field K (${\zeta}N + {\zeta}_N^{-1}$), and over a field K (${\zeta}N$). Furthermore, we find an explicit formula for the conjugates of Tg ($\alpha$) to calculate its minimal polynomial where $\alpha$ (${\in}{\eta}$) is the quotient of a basis of an integral ideal in K.

• 대한수학회논문집
• /
• 제35권1호
• /
• pp.125-136
• /
• 2020

In this article, we discuss classes of generalized functions for certain modified integral operator of Bessel-type involving Fox's H-function kernel. We employ a known differentiation formula of Fox's H-function to obtain the definition and properties of the distributional modified Bessel-type integral. Further, we derive a smoothness theorem for its kernel in a complete countably multi-normed space. On the other hand, using an appropriate class of convolution products, we derive axioms and establish spaces of modified Boehmians which are generalized distributions. On the defined spaces, we introduce addition, convolution, differentiation and scalar multiplication and further properties of the extended integral.

• 대한수학회지
• /
• 제51권5호
• /
• pp.1045-1073
• /
• 2014

The study of the identities of symmetry for the Bernoulli polynomials arises from the study of Gauss's multiplication formula for the gamma function. There are many works in this direction. In the sense of p-adic analysis, the q-Bernoulli polynomials are natural extensions of the Bernoulli and Apostol-Bernoulli polynomials (see the introduction of this paper). By using the N-fold iterated Volkenborn integral, we derive serval identities of symmetry related to the q-extension power sums and the higher order q-Bernoulli polynomials. Many previous results are special cases of the results presented in this paper, including Tuenter's classical results on the symmetry relation between the power sum polynomials and the Bernoulli numbers in [A symmetry of power sum polynomials and Bernoulli numbers, Amer. Math. Monthly 108 (2001), no. 3, 258-261] and D. S. Kim's eight basic identities of symmetry in three variables related to the q-analogue power sums and the q-Bernoulli polynomials in [Identities of symmetry for q-Bernoulli polynomials, Comput. Math. Appl. 60 (2010), no. 8, 2350-2359].

• 한국정밀공학회지
• /
• 제28권5호
• /
• pp.632-637
• /
• 2011

A new tooth profile which is adjusted on the amount of addendum modification factor is proposed for reducing vibration and noise of gears. The transmission error of the new profile can be designed more uniformly than that of the standard involute profile. The basic concepts of tooth profile modification are to reduce the load in contact area and to find the appropriate profile modification factor for operation condition. In this study, gears were estimated to constructive safety of bending strength and contact strength durability by using ROMAX program, and were compared with results by design formula of AGMA standard.

• Journal of Information Processing Systems
• /
• 제8권1호
• /
• pp.145-158
• /
• 2012

Hyperelliptic Curve Cryptosystem (HECC) is well suited for all kinds of embedded processor architectures, where resources such as storage, time, or power are constrained due to short operand sizes. We can construct genus 3 HECC on 54-bit finite fields in order to achieve the same security level as 160-bit ECC or 1024-bit RSA due to the algebraic structure of Hyperelliptic Curve. This paper explores various possible attacks to the discrete logarithm in the Jacobian of a Hyperelliptic Curve (HEC) and addition and doubling of the divisor using explicit formula to speed up the scalar multiplication. Our aim is to develop a cryptosystem that can sign and authenticate documents and encrypt / decrypt messages efficiently for constrained devices in wireless networks. The performance of our proposed cryptosystem is comparable with that of ECC and the security analysis shows that it can resist the major attacks in wireless networks.

• Nuclear Engineering and Technology
• /
• 제50권1호
• /
• pp.18-24
• /
• 2018

This study proposes a new method of analyzing the burnup credit in boiling water reactor spent fuel assemblies against various operating parameters. The operating parameters under investigation include fuel temperature, axial burnup profile, axial moderator density profile, and control blade usage. In particular, the effects of variations in one and two operating parameters on the curve of effective multiplication factor ($k_{eff}$) versus burnup (B) are, respectively, the so-called single and compound effects. All the calculations were performed using SCALE 6.1 together with the Evaluated Nuclear Data Files, part B (ENDF/B)-VII238-neutron energy group data library. Furthermore, two geometrical models were established based on the General Electric (GE)14 $10{\times}10$ boiling water reactor fuel assembly and the Generic Burnup-Credit (GBC)-68 storage cask. The results revealed that the curves of $k_{eff}$ versus B, due to single and compound effects, can be approximated using a first degree polynomial of B. However, the reactivity deviation (or changes of $k_{eff}$, ${\Delta}k$) in some compound effects was not a summation of the all ${\Delta}k$ resulting from the two associated single effects. This phenomenon is undesirable because it may to some extent affect the precise assessment of burnup credit. In this study, a general formula was thus proposed to express the curves of $k_{eff}$ versus B for both single and compound effects.

• ETRI Journal
• /
• 제41권3호
• /
• pp.308-315
• /
• 2019

Due to its high spectrum efficiency, 64-amplitude phase-shift keying (64-APSK) is one of the primary technologies used in deep space communications and digital video broadcasting through satellite-second generation. However, 64-APSK suffers from considerable computational complexity because of the de-mapping method that it employs. In this study, a low-complexity de-mapping method for (4 + 12 + 20 + 28) 64-APSK is proposed in which we take full advantage of the symmetric characteristics of each symbol mapping. Moreover, we map the detected symbol to the first quadrant and then divide the region in this first quadrant into several partitions to simplify the formula. Theoretical analysis shows that the proposed method requires no operation of exponents and logarithms and involves only multiplication, addition, subtraction, and judgment. Simulation results validate that the time consumption is dramatically decreased with limited degradation of bit error rate performance.