JaLCDOI | 10.18926/19674 |
---|---|

FullText URL | Mem_Fac_Eng_OU_33_2_71.pdf |

Author | Tsuruta, Kenji| Totsuji, Hiroo| Totsuji, Chieko| |

Abstract | A parallel tight-binding molecular dynamics with an order-N [O(N))] algorithm is implemented to perform large-scale simulation of nanostructured materials. The algorithm is based on the Fermi-operator expansion of an electronic energy and force, and we present its basic formalisms. Accuracy necessary for molecular-dynamics simulations can be obtained by a proper truncation in the expansion. Parallel efficiency on a parallel PC cluster shows nearly ideal scaling behavior with respect to the number of processors. Applicability of the method to a silicon-carbide system is examined. |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 1999-04-27 |

Volume | volume33 |

Issue | issue2 |

Start Page | 71 |

End Page | 77 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 120002309027 |

JaLCDOI | 10.18926/19953 |
---|---|

FullText URL | Mem_Fac_Eng_OU_44_1.pdf |

Author | Nagai Shinji| Umeda Ryosuke| Tsuruta, Kenji| |

Abstract | In this paper, we investigate a light-confinement phenomenon in the structure which has triangular latice composed of Double NeGative Metamaterial (DNGM). In geometrical optics consideration, this structure is expected to confine lights completely by sequential refractions in the structure. We demonstrate it by using the two dimensional finite-difference time-domain simulations. We introduce Drude-Lorentz model for dielectric and magnetic dispersion of the material at optical frequencies. We analyze quantitatively the effects of energy loss in the DNGM on the light-confinement efficiency. |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2010-01 |

Volume | volume44 |

Start Page | 1 |

End Page | 6 |

ISSN | 1349-6115 |

language | 英語 |

File Version | publisher |

NAID | 120002309117 |

JaLCDOI | 10.18926/19954 |
---|---|

FullText URL | Mem_Fac_Eng_OU_44_7.pdf |

Author | Maetani Noriaki| Kurose Tomoyuki| Tsuruta, Kenji| |

Abstract | The lens effect of acoustic waves in a two-dimensional (2D) phononic crystal is studied by numerical simulation based on the finite-difference time-domain (FDTD) method. We calculate the phonon band structure of 2D phononic crystals, consisting of metal cylinders placed periodically in water. Lens effect is observed by the negative refraction of acoustic waves, which results in refocusing of the waves at the point outside the crystal. To increase the focal intensity, we introduce a 2D phononic crystal shield with a different composition of material, which returns the incident waves back to the lens via the perfect reflection. Also, the dependence on filling fraction of metal in the crystal is studied. |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2010-01 |

Volume | volume44 |

Start Page | 7 |

End Page | 12 |

ISSN | 1349-6115 |

language | 英語 |

File Version | publisher |

NAID | 120002309019 |

JaLCDOI | 10.18926/46949 |
---|---|

FullText URL | mfe_38_1-2_029_032.pdf |

Author | Totsuji, Hiroo| Totsuji, Chieko| Ogawa, Takafumi| Tsuruta, Kenji| |

Abstract | The structure of dust particles in dusty plasmas under microgravity has been analyzed by molecular dynamics simulation. The charge neutrality condition satisfied by the system composed of dust particles and ambient plasma is properly taken into account. It is shown that dust particles form shell structures at low temperatures and the number of shells are obtained as a phase diagram in the plane of two parameters characterizing the system: the number of particles and the strength of screening. It is also shown that these structures are almost independent of the strength of screening. |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2004-03 |

Volume | volume38 |

Issue | issue1-2 |

Start Page | 29 |

End Page | 32 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 80016863328 |

JaLCDOI | 10.18926/46950 |
---|---|

FullText URL | mfe_38_1-2_033_037.pdf |

Author | Liman, M. Sanusi| Totsuji, Chieko| Tsuruta, Kenji| Totsuji, Hiroo| |

Abstract | The dynamic structure factor and the spectrum of the momentum-density fluctuations of 2D Yukawa liquids are analyzed in the domain of weak and intermediate coupling and screenlng parameters. The dispersion relations of the longitudinal and transverse collective excitations are obtained and compared with the random phase approximation (RPA) and harmonic approximation for triangular lattice. |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2004-03 |

Volume | volume38 |

Issue | issue1-2 |

Start Page | 33 |

End Page | 37 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 80016863329 |

JaLCDOI | 10.18926/46968 |
---|---|

FullText URL | mfe_37_1_011_014.pdf |

Author | Totsuji, Chieko| Limant, Muhammad S.| Tsuruta, Kenji| Totsuji, Hiroo| |

Abstract | A theoretical approach which has been successful in reproducing results of molecular-dynamics simulations on dusty plasmas is applied to estimate the screening length and the electric charge of two-dimensional dust crystals of melamine particles in the discharge chamber experiment. It has been found that the screening length is of the same order of magnitude as the inter-particle distance and the electric charge decreases on increasing number density of dust particles. |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2002-11 |

Volume | volume37 |

Issue | issue1 |

Start Page | 11 |

End Page | 14 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 80015784816 |

JaLCDOI | 10.18926/46999 |
---|---|

FullText URL | mfe_36_1_041_049.pdf |

Author | Totsuji, Hiroo| Kishimoto, Tokunari| Totsuji, Chieko| Tsuruta, Kenji| |

Abstract | The ground state of spherical clusters of charged particles of one species confined by the three-dimensional parabolic potential is investigated by molecular dynamics simulations with the system size from N = 5000 to N = 1.2 × 10(5) . The cohesive energy per particle is compared between the shell-structured clusters and spherical finite bcc lattices with relaxed surfaces, the former and the latter being the ground states for small systems and for the large enough systems, respectively. It is shown that, when N > N(c)(N(c) > N), finite bcc lattices with relaxed surfaces (the shell structures) have stronger cohesion than the shell structures (finite bcc lattices with relaxed surfaces) and the critical value of the transition N(c) is estimated to be 10(4) < N(c) < 1.4 × 10(4) . The nucleation of the bcc lattice in the shell-structured cluster of 2 × 10(4) ions is observed. |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2001-12 |

Volume | volume36 |

Issue | issue1 |

Start Page | 41 |

End Page | 49 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 80015112663 |

JaLCDOI | 10.18926/14084 |
---|---|

FullText URL | Mem_Fac_Eng_OU_41_1_52.pdf |

Author | Inaba, Hideo| Syahrul Husain| Horibe, Akihiko| Haruki, Naoto| |

Abstract | The effects of heat and mass transfer parameters on the efficiency of fluidized bed drying have been studied to optimize the input and output conditions. The analysis was carried out using two different materials, wheat and corn. Energy and exergy models based on the first and second law of thermodynamic are developed. Furthermore, some unified non-dimensional experimental correlations for predicting the efficiency of fluidized bed drying process have been proposed. The effects of hydrodynamics and thermodynamics conditions such as the inlet air temperature, the initial moisture content and well known Fourier and Reynolds numbers on energy efficiency and exergy efficiency were analyzed using the developed model. A good agreement was achieved between the model predictions, non-dimensional correlations and the available experimental results. |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2007-01 |

Volume | volume41 |

Issue | issue1 |

Start Page | 52 |

End Page | 62 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 120002308668 |

JaLCDOI | 10.18926/46972 |
---|---|

FullText URL | mfe_37_1_051_060.pdf |

Author | Namba, Akihiro| Toyota, Yoshitaka| Wada, Osami| Koga, Ryuji| |

Abstract | This paper presents pulse timing control method to reduce electromagnetic emission from multiple signal interconnections. Pulse timing control gives intentional skew between signals. Higher order harmonics are canceled because of the difference of the phase between the signals. Using this property, pulse timing control can reduce the EMI in wide frequency range. In this paper, we show that radiated electromagnetic field from multiple signal lines reduces its intensity to the same level of the field from one line by using pulse timing control. The result of measurement shows that EMI from four differential transmission lines can be reduced more than 9 dB in the 200 MHz to 800 MHz frequency range. |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2002-11 |

Volume | volume37 |

Issue | issue1 |

Start Page | 51 |

End Page | 60 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 80015683518 |

JaLCDOI | 10.18926/47028 |
---|---|

FullText URL | mfe_36_2_073_082.pdf |

Author | Hidayat, Iip Syarif| Toyota, Yoshitaka| Torigoe, Osamu| Wada, Osami| Koga, Ryuji| |

Abstract | A multi-path ring-resonator (MPRR) was proposed to extend FSR of ring resonator. However, it is complicated to analyze the MPRR by using well-known analysis techniques such as scattering matrix or other numerical methods. This paper describes procedure for deriving transfer matrix by means of signal flow-chart to analyze the MPRR. We do not need complicated calculation for steady state analysis because transfer matrix elements are formulated clearly. As a result, The calcultaion time in this method can be reduced 1/3 to 1/20 times compared with using scattering matirx method. Furthermore, a transmittance characteristics of the MPRR at FSR extension-factor of 10 will also be shown. This suggests that analysis of other types of the MPRR by using this method can be performed simply and take a shorter time. |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2002-03 |

Volume | volume36 |

Issue | issue2 |

Start Page | 73 |

End Page | 82 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 120003497050 |

JaLCDOI | 10.18926/47029 |
---|---|

FullText URL | mfe_36_2_083_089.pdf |

Author | Watanabe, Tetsushi| Wada, Osami| Koga, Ryuji| Toyota, Yoshitaka| Miyashita, Takuya| |

Abstract | Suppression of common-mode current is important to achieve electromagnetic compatibility of high-speed and high-density electronic circuits. The authors have focused on the common mode current flowing on a printed circuit board (PCB) to explain the excitation mechanism. A narrow ground pattern in microstrip structure excites common-mode current. In the previous paper, the authors explained the mechanism of common mode generation by means of "current division factor" for simple PCBs. The estimated radiation from a simple PCB agreed well with measured one. In this paper, the authors extend the theory to be applied to generalize ground structure. The validity of the theory is confirmed by comparing the measured radiation and the estimated value using the common-mode model for a test PCB. The estimated radiation agrees well with the measured one within 3 dB up to 900 MHz. |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2002-03 |

Volume | volume36 |

Issue | issue2 |

Start Page | 83 |

End Page | 89 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 120003497051 |

JaLCDOI | 10.18926/14057 |
---|---|

FullText URL | Mem_Fac_Eng_OU_42_36.pdf |

Author | Kato, Hidehiro| Nekado, Kenta| Nogami, Yasuyuki| Morikawa, Yoshitaka| |

Abstract | This paper proposes an exponentiation method with Frobenius mappings. Our method is closely related to so-called interleaving exponentiation. Different from the interleaving exponentiation methods, our method can carry out several exponentiations using same base at the same time. The efficiency to use Frobenius mappings for an exponentiation in extension field is well introduced by Avanzi and Mihailescu. This exponentiation method is based on so-called simultaneous exponentiation and uses many Frobenius mappings. Their method more decreased the number of multiplications; however, the number of Frobenius mappings inversely increased. Compared to their method , the number of multiplications needed for the proposed method becomes about 20% larger; however, that of Frobenius mappings becomes small enough. |

Keywords | exponentiation Frobenius mapping extension field |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2008-01 |

Volume | volume42 |

Issue | issue1 |

Start Page | 36 |

End Page | 43 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 120002308105 |

JaLCDOI | 10.18926/14071 |
---|---|

FullText URL | Mem_Fac_Eng_OU_42_110.pdf |

Author | Nogami, Yasuyuki| Morikawa, Yoshitaka| |

Abstract | This paper shows a method for checking the parity of (#Jc − 1)/2 without calculating the order #Jc, where #Jc is the order of genus 2 or 3 hyperelliptic curve. |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2008-01 |

Volume | volume42 |

Issue | issue1 |

Start Page | 110 |

End Page | 114 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 120002308489 |

JaLCDOI | 10.18926/14079 |
---|---|

FullText URL | Mem_Fac_Eng_OU_41_1_1.pdf |

Author | Nogami, Yasuyuki| Morikawa, Yoshitaka| |

Abstract | In this paper, we first show the number of x's such that x(2) +u, u ∈ F(*)(p) , becomes a quadratic residue in F(p), and then this number is proven to be equal to (p+1)/2 if −u is a quadratic residue in Fp, which is a necessary fact for the following. With respect to the irreducible cubic polynomials over Fp in the form of x(3)+ax+b, we give a classification based on the trace of an element in F(p3) and based on whether or not the coefficient of x, i.e. the parameter a, is a quadratic residue in Fp. According to this classification, we can know the minimal set of the irreducible cubic polynomials, from which all the irreducible cubic polynomials can be generated by using the following two variable transformations: x=x + i, x=j−1x, i, j ∈ Fp, j ≠ 0. Based on the classification and that necessary fact, we show the number of the irreducible cubic polynomials in the form of x(3)+ax+b, b ∈ F(p), where a is a certain fixed element in F(p). |

Keywords | Irreducible cubic polynomial trace quadratic residue |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2007-01 |

Volume | volume41 |

Issue | issue1 |

Start Page | 1 |

End Page | 10 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 120002308562 |

JaLCDOI | 10.18926/14080 |
---|---|

FullText URL | Mem_Fac_Eng_OU_41_1_11.pdf |

Author | Nogami, Yasuyuki| Morikawa, Yoshitaka| |

Abstract | This paper proposes an algorithm for generating irreducible cubic trinomials in the form x(3) + ax + b, b ∈ F(p), where a is a certain fixed non-zero element in the prime field F(p). The proposed algorithm needs a certain irreducible cubic trinomial over F(p) to be previously given as a generator; however, the proposed algorithm can generate irreducible cubic polynomials one after another by changing a certain parameter in F(p). In this paper, we compare the calculation cost and the average computation time for generating an irreducible cubic polynomial, especially trinomial, among Hiramoto et al. irreducibility testing algorithm, Berlekamp-Massey minimal polynomial determining algorithm, and the proposed algorithm. From the experimental results, it is shown that the proposed algorithm is the fastest among the three algorithms for generating irreducible cubic trinomials. |

Keywords | irreducible cubic polynomial minimal polynomial |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2007-01 |

Volume | volume41 |

Issue | issue1 |

Start Page | 11 |

End Page | 19 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 120002308381 |

JaLCDOI | 10.18926/14126 |
---|---|

FullText URL | Mem_Fac_Eng_OU_40_1_84.pdf |

Author | Nogami, Yasuyuki| Morikawa, Yoshitaka| |

Abstract | This paper particularly deals with elliptic curves in the form of E(x, y) = y(2) − x(3) −b = 0, b ∈ F(* q) , where 3 divides q−1. In this paper, we refer to the well-known twist technique as x-twist and propose y-twist. By combining x-twist and y-twist, we can consider six elliptic curves and this paper proposes a method to obtain the orders of these six curves by counting only one order among the six curves. |

Keywords | elliptic curve twist third power residue/non-residue |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2006-01 |

Volume | volume40 |

Issue | issue1 |

Start Page | 83 |

End Page | 94 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 120002308548 |

JaLCDOI | 10.18926/14156 |
---|---|

FullText URL | Mem_Fac_Eng_39_1_71.pdf |

Author | Nogami, Yasuyuki| Morikawa, Yoshitaka| |

Abstract | This paper proposes an algorithm for generating prime order elliptic curves over extension field whose extension degree is a power of 2. The proposed algorithm is based on the fact that the order of the twisted elliptic curve is able to be a prime number when the extension degree for the twist operation is a power of 2. When the definition field is F(2(40)−87)(4) , the proposed algorithm can generate a prime order elliptic curve within 5 seconds on PentiumIII (800MHz) with C language. |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2005-01 |

Volume | volume39 |

Issue | issue1 |

Start Page | 71 |

End Page | 81 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 120002308036 |

JaLCDOI | 10.18926/14157 |
---|---|

FullText URL | Mem_Fac_Eng_39_1_82.pdf |

Author | Wang, Feng| Nogami, Yasuyuki| Morikawa, Yoshitaka| |

Abstract | In this paper, we focus on developing a high-speed square root (SQRT) algorithm required for an elliptic curve cryptosystem. Examining Smart algorithm, the previously well-known SQRT algorithm, we can see that there is a lot of computation overlap in Smart algorithm and the quadratic residue (QR) test, which must be implemented prior to a SQRT computation. It makes Smart algorithm inefficient. The essence of our proposition is thus to present a new QR test and an efficient SQRT algorithm to avoid all the overlapping computations. The authors devised a SQRT algorithm for which most of the data required have been computed in the proposed QR test. Not only there is no computation overlap in the proposed algorithm and the proposed QR test, but also in the proposed algorithm over GF(p(2)) (4 | p − 1) some computations can be executed in GF(p); whereas in Smart algorithm over GF(p(2)) all the computations must be executed in GF(p(2)). These yield many reductions in the computational time and complexity. We implemented the two QR tests and the two SQRT algorithms over GF(pm) (m=1, 2) in C++ language with NTL (Number Theory Library) on Pentium4 (2.6GHz), where the size of p is around 160 bits. The computer simulations showed that the proposed QR test and the proposed algorithm over GF(p(m)) were about 2 times faster than the conventional QR test and Smart algorithm over GF(p(m)). |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2005-01 |

Volume | volume39 |

Issue | issue1 |

Start Page | 82 |

End Page | 92 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 120002308422 |

JaLCDOI | 10.18926/15380 |
---|---|

FullText URL | Mem_Fac_Eng_OU_35_197.pdf |

Author | Nogami, Yasuyuki| Morikawa, Yoshitaka| |

Abstract | Modern communication engineerings, such as elliptic curve cryptographies, often requires algebra on finite extension field defined by modulus arithmetic with an irreducible polynomial. This paper provides a new method to detemine the minimal (irreducible) polynomial of a given proper element in finite extension field. In the conventional determination method, as we have to solve the simultaneous equations, the computation is very involved. In this paper, the well known "trace" is extended to higher degree traces. Using the new traces, we yield the coefficient formula of the desired minimal polynomial. The new method becomes very simple without solving the simultaneous equations, and about twice faster than the conventional method in computation speed. |

Keywords | finite field minimal polynomial irreducible polynomial higher degree trace trace cryptography |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2001-03-27 |

Volume | volume35 |

Issue | issue1-2 |

Start Page | 197 |

End Page | 205 |

ISSN | 0475-0071 |

language | 英語 |

File Version | publisher |

NAID | 120002307992 |

JaLCDOI | 10.18926/17849 |
---|---|

FullText URL | Mem_Fac_Eng_OU_43_99.pdf |

Author | Kato, Hidehiro| Nogami, Yasuyuki| Morikawa, Yoshitaka| |

Abstract | A square root (SQRT) algorithm in extension field F(p(m))(m = r(0)r(1)･･･r(n−1)･2(d), r(i) : odd prime, d : positive integer) is proposed in this paper. First, a conventional SQRT algorithm, the Tonelli-Shanks algorithm, is modified to compute the inverse SQRT in F(p(2d)), where most of the computations are performed in the corresponding subfields F(p(2i)) for 0 ≤ i ≤ d-1. Then the Frobenius mappings with addition chain are adopted for the proposed SQRT algorithm, in which a lot of computations in a given extension field F(p(m)) are also reduced to those in a proper subfield by the norm computations. Those reductions of the field degree increase efficiency in the SQRT implementation. The Tonelli-Shanks algorithm and the proposed algorithm in F(p(6)) and F(p(10)) were implemented on a Core2 (2.66 GHz) using the C++ programming language. The computer simulations showed that, on average, the proposed algorithm accelerated the SQRT computation by 6 times in F(p(6)), and by 10 times in F(p(10)), compared to the Tonelli-Shanks algorithm. |

Publication Title | Memoirs of the Faculty of Engineering, Okayama University |

Published Date | 2009-01 |

Volume | volume43 |

Start Page | 99 |

End Page | 107 |

ISSN | 1349-6115 |

language | 英語 |

File Version | publisher |

NAID | 120002308980 |