• 대한수학회지
• /
• 제43권4호
• /
• pp.859-869
• /
• 2006

Let {$X,\;X_n;n\;{\geq}\;1$} be a sequence of ${\imath}.{\imath}.d.$ random variables which belong to the attraction of the normal law, and $X^{(1)}_n,...,X^{(n)}_n$ be an arrangement of $X_1,...,X_n$ in decreasing order of magnitude, i.e., $\|X^{(1)}_n\|{\geq}{\cdots}{\geq}\|X^{(n)}_n\|$. Suppose that {${\gamma}_n$} is a sequence of constants satisfying some mild conditions and d'($t_{nk}$) is an appropriate truncation level, where $n_k=[{\beta}^k]\;and\;{\beta}$ is any constant larger than one. Then we show that the conditionally trimmed sums obeys the self-normalized law of the iterated logarithm (LIL). Moreover, the self-normalized LIL for conditionally censored sums is also discussed.

• Nuclear Engineering and Technology
• /
• 제52권3호
• /
• pp.477-484
• /
• 2020

The control rod drive mechanism needs to be debugged after reactor fresh fuel loading. It is of great importance to monitor the subcriticality of this process accurately. A modified method was applied to the subcriticality monitoring process, in which only a single control rod cluster was fully withdrawn from the core. In order to correct the error in the results obtained by Neutron Source Multiplication Method, which is based on one point reactor model, Monte Carlo neutron transport code was employed to calculate the fission neutron distribution, the iterated fission probability and the neutron flux in the neutron detector. This article analyzed the effect of a coarse mesh and a fine mesh to tally fission neutron distributions, the iterated fission probability distributions and to calculate correction factors. The subcriticality before and after modification is compared with the subcriticality calculated by MCNP code. The modified results turn out to be closer to calculation. It's feasible to implement the modified NSM method in large local reactivity addition process using Monte Carlo code based on 3D model.

• 대한수학회보
• /
• 제58권4호
• /
• pp.865-876
• /
• 2021

Let 𝔽 be a commutative ring. A restricted skew polynomial extension over 𝔽 is a class of iterated skew polynomial 𝔽-algebras which include well-known quantized algebras such as the quantum algebra U_q(𝔰𝔩₂), Weyl algebra, etc. Here we obtain a necessary and sufficient condition in order to be restricted skew polynomial extensions over 𝔽. We also introduce a restricted Poisson polynomial extension which is a class of iterated Poisson polynomial algebras and observe that a restricted Poisson polynomial extension appears as semiclassical limits of restricted skew polynomial extensions. Moreover, we obtain usual as well as unusual quantized algebras of the same Poisson algebra as applications.

• Journal of Applied and Pure Mathematics
• /
• 제4권3_4호
• /
• pp.185-209
• /
• 2022

Here we exhibit multivariate quantitative approximations of Banach space valued continuous multivariate functions on a box or ℝ^N, N ∈ ℕ, by the multivariate normalized, quasi-interpolation, Kantorovich type and quadrature type neural network operators. We treat also the case of approximation by iterated operators of the last four types. These approximations are achieved by establishing multidimensional Jackson type inequalities involving the multivariate modulus of continuity of the engaged function or its high order Fréchet derivatives. Our multivariate operators are defined by using a multidimensional density function induced by the generalized symmetrical sigmoid function. The approximations are point-wise and uniform. The related feed-forward neural network is with one hidden layer.

• Journal of Applied and Pure Mathematics
• /
• 제5권1_2호
• /
• pp.69-93
• /
• 2023

Here we give multivariate quantitative approximations of Banach space valued continuous multivariate functions on a box or ℝ^N, N ∈ ℕ, by the multivariate normalized, quasi-interpolation, Kantorovich type and quadrature type neural network operators. We treat also the case of approximation by iterated operators of the last four types. These approximations are derived by establishing multidimensional Jackson type inequalities involving the multivariate modulus of continuity of the engaged function or its high order Fréchet derivatives. Our multivariate operators are defined by using a multidimensional density function induced by a parametrized Gudermannian sigmoid function. The approximations are pointwise and uniform. The related feed-forward neural network is with one hidden layer.

• 대한수학회보
• /
• 제49권5호
• /
• pp.911-921
• /
• 2012

In this paper, the radial oscillation of the solutions of higher order homogeneous linear differential equation $$f^{(k)}+A_{n-2}(z)f^{(k-2)}+{\cdots}+A_1(z)f^{\prime}+A_0(z)f=0$$ with transcendental entire function coefficients is studied. Results are obtained to extend some results in [Z. Wu and D. Sun, Angular distribution of solutions of higher order linear differential equations, J. Korean Math. Soc. 44 (2007), no. 6, 1329-1338].

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권1호
• /
• pp.302-320
• /
• 2017

In this paper, an innovative robust feature detection and matching strategy for visual odometry based on stereo image sequence is proposed. First, a sparse multiscale 2D local invariant feature detection and description algorithm AKAZE is adopted to extract the interest points. A robust feature matching strategy is introduced to match AKAZE descriptors. In order to remove the outliers which are mismatched features or on dynamic objects, an improved random sample consensus outlier rejection scheme is presented. Thus the proposed method can be applied to dynamic environment. Then, geometric constraints are incorporated into the motion estimation without time-consuming 3-dimensional scene reconstruction. Last, an iterated sigma point Kalman Filter is adopted to refine the motion results. The presented ego-motion scheme is applied to benchmark datasets and compared with state-of-the-art approaches with data captured on campus in a considerably cluttered environment, where the superiorities are proved.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제16권3호
• /
• pp.283-296
• /
• 2009

Let f(x) = $x^n\;+\;a$ be a binomial polynomial in Z[x] and $f_m(x)$ be the m-th iterate of f(x). In this work we study a necessary condition to be the Galois group of $f_m(x)$ is isomorphic to a wreath product group $[C_n]^m$ where $C_n$ is a cyclic group of order n.

• 대한수학회지
• /
• 제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].

• 전자공학회논문지S
• /
• 제34S권2호
• /
• pp.52-62
• /
• 1997

To reconstruct the complete 3-D shape of an object, seveal range images form different viewpoints should be merged into a single model. The process of extraction of the transformation parameters between multiple range views is calle dregistration. In this paper, we propose a new algorithm to find the transformation parameters between multiple range views. Th eproposed algorithm consists of two step: initial estimation and iteratively update the transformation. To guess the initial transformation, we modify the principal axes by considering the projection effect, due to the difference fo viewpoints. Then, the following process is iterated: in order to extract the exact transformation parameters between the range views: For every point of the common region, find the nearest point among the neighborhood of the current corresponding point whose correspondency is defined by the reverse calibration of the range finder. Then, update the transformation to satisfy the new correspondencies. In order to evaluate the performance the proposed registration algorithm, some experiments are performed on real range data, acquired by space encoding range finder. The experimental results show that the proposed initial estimation accelerate the following iterative registration step.