• Korea-Australia Rheology Journal
• /
• v.16 no.1
• /
• pp.1-15
• /
• 2004

The computation of viscoelastic flow using neural networks and stochastic simulation (CVFNNSS) is developed from the point of view of Eulerian CONNFFESSIT (calculation of non-Newtonian flows: finite elements and stochastic simulation techniques). The present method is based on the combination of radial basis function networks (RBFNs) and Brownian configuration fields (BCFs) where the stress is computed from an ensemble of continuous configuration fields instead of convecting discrete particles, and the velocity field is determined by solving the conservation equations for mass and momentum with a finite point method based on RBFNs. The method does not require any kind of element-type discretisation of the analysis domain. The method is verified and its capability is demonstrated with the start-up planar Couette flow, the Poiseuille flow and the lid driven cavity flow of Hookean and FENE model materials.

• Journal of IKEEE
• /
• v.3 no.2 s.5
• /
• pp.295-304
• /
• 1999

This paper presents a method of constructing the Multiple-Valued Logic Systems(MVLS) over Finite Fields(FF) using by Decision Diagram(DD) that is based on Graph Theory. The proposed method is as following. First, we derivate the Ordered Multiple-Valued Logic Decision Diagram(OMVLDD) based on the multiple-valued Shannon's expansion theorem and we execute function decomposition using by sub-graph. Next, we propose the variable selecting algorithm and simplification algorithm after apply the each isomorphism and reodering vertex. Also we propose MVLS design method.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.17-26
• /
• 2014

In this paper, we present an algorithm for computing the number of points on the Jacobian varieties of genus 3 hyperelliptic curves of type $y^2=x^7+ax$ over finite prime fields. The problem of determining the group order of the Jacobian varieties of algebraic curves defined over finite fields is important not only arithmetic geometry but also curve-based cryptosystems in order to find a secure curve. Based on this, we provide the explicit formula of the characteristic polynomial of the Frobenius endomorphism of the Jacobian variety of hyperelliptic curve $y^2=x^7+ax$ over a finite field $\mathbb{F}_p$ with $p{\equiv}1$ modulo 12. Moreover, we also introduce some implementation results by using our algorithm.

• Journal of KSNVE
• /
• v.8 no.1
• /
• pp.122-131
• /
• 1998

Internal and external acoustic fields of the engine inlet are calculated by using a finite element method. The far fields non reflecting boundary condition is enforced by using a wave envelope element, which is a kind of infinite element. The geometry is assumed an axisymetric duct. Sources of the fan are modeled by the Tyler and Sofrin's theory. Effects of uniformly moving medium are considered. A pulsating sphere and an oscillating piston problem are calculated to verify the external problems, and compared with exact solutions. When the wave envelope element is applied at the far boundary, the calculated finite element solutions show good agreements with the exact solutions. The engine inlet is solved with the combined internal and external grid. The cut-off phenomena on engine inlet duct are observed.

• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.2
• /
• pp.251-259
• /
• 2015

Let $\mathbb{F}^d_q$ be a d-dimensional vector space over a finite field $\mathbb{F}^d_q$ with q elements. We endow the space $\mathbb{F}^d_q$ with a normalized counting measure dx. Let ${\sigma}$ be a normalized surface measure on an algebraic variety V contained in the space ($\mathbb{F}^d_q$, dx). We define the restricted averaging operator AV by $A_Vf(X)=f*{\sigma}(x)$ for $x{\in}V$, where $f:(\mathbb{F}^d_q,dx){\rightarrow}\mathbb{C}$: In this paper, we initially investigate $L^p{\rightarrow}L^r$ estimates of the restricted averaging operator AV. As a main result, we obtain the optimal results on this problem in the case when the varieties V are any nondegenerate algebraic curves in two dimensional vector spaces over finite fields. The Fourier restriction estimates for curves on $\mathbb{F}^2_q$ play a crucial role in proving our results.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.4
• /
• pp.227-233
• /
• 2016

Efficient finite field arithmetic is essential for fast implementation of error correcting codes and cryptographic applications. Among the arithmetic operations over finite fields, the multiplication is one of the basic arithmetic operations. Therefore an efficient design of a finite field multiplier is required. In this paper, two new bit-parallel systolic multipliers for $GF(2^m)$ fields defined by AOP(all-one polynomial) have proposed. The proposed multipliers have a little bit greater space complexity but save at least 22% area complexity and 13% area-time (AT) complexity as compared to the existing multipliers using AOP. As compared to related works, we have shown that our multipliers have lower area-time complexity, cell delay, and latency. So, we expect that our multipliers are well suited to VLSI implementation.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1523-1537
• /
• 2022

We present a new square root algorithm in finite fields which is a variant of the Pocklington-Peralta algorithm. We give the complexity of the proposed algorithm in terms of the number of operations (multiplications) in finite fields, and compare the result with other square root algorithms, the Tonelli-Shanks algorithm, the Cipolla-Lehmer algorithm, and the original Pocklington-Peralta square root algorithm. Both the theoretical estimation and the implementation result imply that our proposed algorithm performs favorably over other existing algorithms. In particular, for the NIST suggested field P-224, we show that our proposed algorithm is significantly faster than other proposed algorithms.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.23 no.7 s.166
• /
• pp.1120-1128
• /
• 1999

An elastic-viscoplastic finite element analysis is performed to investigate detailed growth behavior of creep cracks and the numerical results are compared with experimental results. In Cr-Mo steel stress fields obtained from the crack growth method by mesh translation were compared with both cases that the secondary creep rate is only used as creep material property and the primary creep rate is included. Analytical stress fields, Riedel-Rice(RR) field, Hart-Hui-Riedel(HR) field and Prime(named in here) field, and the results obtained by numerical method were evaluated in details. Time vs. stress at crack tip was showed and crack tip stress fields were plotted. These results were compared with analytical stress fields. There is no difference of stress distribution at remote region between the case of 1st creep rate+2nd creep rate and the case of 2nd creep rate only. In case of slow velocity of crack growth, the effect of 1st creep rate is larger than the one of fast crack growth rate. Stress fields at crack tip region we, in order, Prime field, HR field and RR field from crack tip.

• Korean Journal of Mathematics
• /
• v.28 no.3
• /
• pp.639-647
• /
• 2020

A simple type of Cohen's transformation consists of a polynomial and a linear fractional transformation. We study the effectiveness of Cohen transformation to find N-polynomials over finite fields.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.8
• /
• pp.1207-1212
• /
• 2013

Arithmetic operations over finite fields are widely used in coding theory and cryptography. In both of these applications, there is a need to design low complexity finite field arithmetic units. The complexity of such a unit largely depends on how the field elements are represented. Among them, representation of elements using a optimal normal basis is quite attractive. Using an algorithm minimizing the number of 1's of multiplication matrix, in this paper, we propose a multiplier which is time and area efficient over finite fields with optimal normal basis.