• Journal of Magnetics
• /
• v.3 no.4
• /
• pp.120-122
• /
• 1998

The higher order harmonic components of magnetostriction during ac magnetization in 3% SiFe are measured as a function of the magnetizing angle respect to [001] axis using a constructed laser interferometry. The magnetostriction with magnetizing angle from [001] axis agrees ith the calculation based on domain reorientation. The relative amplitudes of odd and even harmonics respectively for magnetic induction and magnetostriction decrease with the order of harmonics, accompanying the contraction of the amplitudes. The contraction of harmonics order of magnetostriction harmonics is shown to be the even number times of that of magnetic induction.

• East Asian mathematical journal
• /
• v.29 no.5
• /
• pp.529-536
• /
• 2013

In this paper, we find the values and the number of occurrences of each value of the cross-correlation function $C_d({\tau})$ when $d=\frac{2^{k-1}}{2^s-1}(2^{k(i+1)}-2^{ki}+2^{s+1}-2^k-1)$, where n = 2k, s is an integer such that 2s divides k, and i is odd.

• Kyungpook Mathematical Journal
• /
• v.56 no.3
• /
• pp.647-655
• /
• 2016

Let H be a graph, and $k{\geq}{\chi}(H)$ an integer. We say that H has a cyclic Gray code of k-colourings if and only if it is possible to list all its k-colourings in such a way that consecutive colourings, including the last and the first, agree on all vertices of H except one. The Gray code number of H is the least integer $k_0(H)$ such that H has a cyclic Gray code of its k-colourings for all $k{\geq}k_0(H)$. For complete bipartite graphs, we prove that $k_0(K_{\ell},r)=3$ when both ${\ell}$ and r are odd, and $k_0(K_{\ell},r)=4$ otherwise.

• Kyungpook Mathematical Journal
• /
• v.58 no.3
• /
• pp.573-581
• /
• 2018

In this paper we consider all orientation-preserving ${\mathbb{Z}}_{p^2}$-actions on 3-dimensional handlebodies $V_g$ of genus g > 0 for p an odd prime. To do so, we examine particular graphs of groups (${\Gamma}(v)$, G(v)) in canonical form for some 5-tuple v = (r, s, t, m, n) with r + s + t + m > 0. These graphs of groups correspond to the handlebody orbifolds V (${\Gamma}(v)$, G(v)) that are homeomorphic to the quotient spaces $V_g/{\mathbb{Z}}_{p^2}$ of genus less than or equal to g. This algebraic characterization is used to enumerate the total number of ${\mathbb{Z}}_{p^2}$-actions on such handlebodies, up to equivalence.

• Honam Mathematical Journal
• /
• v.40 no.3
• /
• pp.549-559
• /
• 2018

In this paper, we consider the congruences involving harmonic numbers and the terms of the sequences {$U_{kn}$} and {$V_{kn}$}. For example, for an odd prime number p, $${\sum\limits_{i=1}^{p-1}}H_i{\frac{U_{k(i+m)}}{V^i_k}}{\equiv}{\frac{(-1)^kU_{k(m+1)}}{_pV^{p-1}_k}}(V^p_k-V_{kp})(mod\;p)$$, where $m{\in}{\mathbb{Z}}$ and $k{\in}{\mathbb{Z}}$ with $p{\nmid}V_k$.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.11b
• /
• pp.810-816
• /
• 2001

In this paper, we theoretically analyzed the NRRO(the non-repeatable run-out) of a ball bearing with geometric imperfection. The quasi-static and dynamic analysis of a ball bearing was performed to calculate the displacement of shaft center caused by the form errors while the shaft is rotating. From consideration of the generating mechanism of NRRO, it is found that the waviness of one ball generates vibrations with nf$\sub$b/${\pm}$f$\sub$c/(where n is odd) components. Also it is confirmed that the outer race waviness of the order n = jZ${\pm}$1 generates vibration with jZf$\sub$c/ components. The form errors of ball bearing elements were precisely measured and NRRO of a ball bearing was calculated using the measured data. It is concluded that the ball bearings must has large ball number and small ball diameter to obtain low NRRO.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.2
• /
• pp.487-494
• /
• 2016

Let p be an odd prime and c be a fixed integer with (c, p) = 1. For each integer a with $1{\leq}a{\leq}p-1$, it is clear that there exists one and only one b with $0{\leq}b{\leq}p-1$ such that $ab{\equiv}c$ mod p. Let N(c, p) denote the number of all solutions of the congruence equation $ab{\equiv}c$ mod p for $1{\leq}a$, $b{{\leq}}p-1$ in which a and $\bar{b}$ are of opposite parity, where $\bar{b}$ is defined by the congruence equation $b{\bar{b}}{\equiv}1$ mod p. The main purpose of this paper is using the mean value theorem of Dirichlet L-functions and the properties of Gauss sums to study the computational problem of one kind mean value function related to $E(c,p)=N(c,p)-{\frac{1}{2}}{\phi}(p)$, and give its an exact computational formula.

• Journal of Information Processing Systems
• /
• v.16 no.4
• /
• pp.809-819
• /
• 2020

Gender prediction accuracy increases as convolutional neural network (CNN) architecture evolves. This paper compares voting and ensemble schemes to utilize the already trained five CNN models to further improve gender prediction accuracy. The majority voting usually requires odd-numbered models while the proposed softmax-based voting can utilize any number of models to improve accuracy. The ensemble of CNN models combined with one more fully-connected layer requires further tuning or training of the models combined. With experiments, it is observed that the voting or ensemble of CNN models leads to further improvement of gender prediction accuracy and that especially softmax-based voters always show better gender prediction accuracy than majority voters. Also, compared with softmax-based voters, ensemble models show a slightly better or similar accuracy with added training of the combined CNN models. Softmax-based voting can be a fast and efficient way to get better accuracy without further training since the selection of the top accuracy models among available CNN pre-trained models usually leads to similar accuracy to that of the corresponding ensemble models.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.6
• /
• pp.1385-1422
• /
• 2019

Let p be an odd prime. The algebraic structure of all negacyclic codes of length $8_{p^s}$ over the finite commutative chain ring ${\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}$ where $u^2=0$ is studied in this paper. Moreover, we classify all negacyclic codes of length $8_{p^s}$ over ${\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}$ into 5 cases, i.e., $p^m{\equiv}1$ (mod 16), $p^m{\equiv}3$, 11 (mod 16), $p^m{\equiv}5$, 13 (mod 16), $p^m{\equiv}7$, 15 (mod 16) and $p^m{\equiv}9$ (mod 16). From that, the structures of dual and some self-dual negacyclic codes and number of codewords of negacyclic codes are obtained.

• Journal of the Chungcheong Mathematical Society
• /
• v.35 no.4
• /
• pp.315-327
• /
• 2022

In this paper, we investigate the transferred superstability for the p-radical sine functional equation $$f\(\sqrt[p]{\frac{x^p+y^p}{2}}\)^2-f\(\sqrt[p]{\frac{x^p-y^p}{2}}\)^2=f(x)f(y)$$ from the p-radical functional equations: $$f({\sqrt[p]{x^p+y^p}})+f({\sqrt[p]{x^p-y^p}})={\lambda}g(x)g(y),\;\\f({\sqrt[p]{x^p+y^p}})+f({\sqrt[p]{x^p-y^p}})={\lambda}g(x)h(y),$$ where p is an odd positive integer, λ is a positive real number, and f is a complex valued function. Furthermore, the results are extended to Banach algebras. Therefore, the obtained result will be forced to the pre-results(p=1) for this type's equations, and will serve as a sample to apply it to the extension of the other known equations.