• Journal of the Chungcheong Mathematical Society
• /
• v.16 no.1
• /
• pp.73-79
• /
• 2003

A subgroup S(X, ${\gamma}$) of the group of automorphisms of a universal minimal transformation group is introduced and a necessary and sufficient condition for two subgroups to be identical is obtained.

• Communications of the Korean Mathematical Society
• /
• v.29 no.2
• /
• pp.239-255
• /
• 2014

We develop a set of identities for Euler type sums. In particular we investigate products of shifted harmonic numbers of order two and reciprocal binomial coefficients.

• East Asian mathematical journal
• /
• v.26 no.3
• /
• pp.423-427
• /
• 2010

In this paper, we give an upper bound for dominations of Steinhaus graphs, and the domination numbers of the bipartite Steinhaus graphs. Also, we give an upper bound for Nordhaus-Gaddum type result for the bipartite Steinhaus graphs.

• Communications of the Korean Mathematical Society
• /
• v.15 no.3
• /
• pp.549-553
• /
• 2000

For a continuous map of the circle to itself, we give necessary and sufficient conditions for the $\omega$-limit set of each nonwandering point to be minimal.

• Journal of the Korean Chemical Society
• /
• v.40 no.5
• /
• pp.317-326
• /
• 1996

The frequency dependent longitudinal polarizabilities ${\alpha}zz(\omega)$ and the second hyper-polarizabilities ${\gamma}zzzz(\omega)$ of the linear polyenes, $C_4H_6\;to\;C_{30}H_{32}$, have been evaluated using the ab initio time-dependent coupled perturbed Hartree-Fock (TDCPHF) theory with the 6-31G basis set. The ratios of the dynamic properties to the static values have been examined to illustrate the relative dispersion effect and extrapolated to the infinite polymer limit. Also the effect of interchain interaction for linear and nonlinear optical properties has been investigated for $C_4H_6$ and the theoretical discussion has been described to overcome the limitation of ab initio TDHF method in the resonance region.

• IMMUNE NETWORK
• /
• v.11 no.6
• /
• pp.406-411
• /
• 2011

Background: Invariant Natural killer T (iNKT) cells, a distinct subset of CD1d-restricted T cells with invariant $V{\alpha}{\beta}$ TCR, functionally bridge innate and adaptive immunity. While iNKT cells share features with conventional T cells in some functional aspects, they simultaneously produce large amount of Th1 and Th2 cytokines upon T-cell receptor (TCR) ligation. However, gene expression pattern in two types of cells has not been well characterized. Methods: we performed comparative microarray analyses of gene expression in murine iNKT cells and conventional $CD4^+CD25^-$ ${\gamma}{\delta}TCR^-$ T cells by using Gene Set Enrichment Analysis (GSEA) method. Results: Here, we describe profound differences in gene expression pattern between iNKT cells and conventional $CD4^+CD25^-$ ${\gamma}{\delta}TCR^-$ T cells. Conclusion: Our results provide new insights into the functional competence of iNKT cells and a better understanding of their various roles during immune responses.

• Honam Mathematical Journal
• /
• v.41 no.3
• /
• pp.569-579
• /
• 2019

Cusp (parabolic) points in the extended modular group ${\bar{\Gamma}}$ are basically the images of infinity under the group elements. This implies that the cusp points of ${\bar{\Gamma}}$ are just rational numbers and the set of cusp points is $Q_{\infty}=Q{\cup}\{{\infty}\}$.The Farey graph F is the graph whose set of vertices is $Q_{\infty}$ and whose edges join each pair of Farey neighbours. Each rational number x has an integer continued fraction expansion (ICF) $x=[b_1,{\cdots},b_n]$. We get a path from ${\infty}$ to x in F as $<{\infty},C_1,{\cdots},C_n>$ for each ICF. In this study, we investigate relationships between Fibonacci numbers, Farey graph, extended modular group and ICF. Also, we give a computer program that computes the geodesics, block forms and matrix represantations.

• Nuclear Engineering and Technology
• /
• v.54 no.6
• /
• pp.2221-2229
• /
• 2022

In this research, for improving the measurement performance of Prompt Gamma-ray Neutron Activation Analysis (PGNAA) set-up, a new optimization method for set-up design was proposed and investigated. At first, the calculation method for Signal-to-Noise Ratio (SNR) was proposed. Since the SNR could be calculated and quantified accurately, the SNR was chosen as the evaluation parameter in the new optimization method. For discussing the feasibility of the SNR optimization method, two kinds of PGNAA set-ups were designed in the MCNP code, based on the SNR optimization method and the previous signal optimization method, respectively. Meanwhile, the single element spectra analysis method was proposed, and the analysis effect of single element spectra as well as element sensitivity were used for comparing the measurement performance. Since the simulation results showed the better measurement performance of set-up designed by SNR optimization method, the experimental set-ups were built for the further testing, finally demonstrating the feasibility of the SNR optimization method for PGNAA setup design.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.13-30
• /
• 2010

Let C be a nonempty closed convex subset of a real Hilbert space H. Consider the following iterative algorithm given by $x_0\;{\in}\;C$ arbitrarily chosen, $x_{n+1}\;=\;{\alpha}_n{\gamma}f(W_nx_n)+{\beta}_nx_n+((1-{\beta}_n)I-{\alpha}_nA)W_nP_C(I-s_nB)x_n$, ${\forall}_n\;{\geq}\;0$, where $\gamma$ > 0, B : C $\rightarrow$ H is a $\beta$-inverse-strongly monotone mapping, f is a contraction of H into itself with a coefficient $\alpha$ (0 < $\alpha$ < 1), $P_C$ is a projection of H onto C, A is a strongly positive linear bounded operator on H and $W_n$ is the W-mapping generated by a finite family of nonexpansive mappings $T_1$, $T_2$, ${\ldots}$, $T_N$ and {$\lambda_{n,1}$}, {$\lambda_{n,2}$}, ${\ldots}$, {$\lambda_{n,N}$}. Nonexpansivity of each $T_i$ ensures the nonexpansivity of $W_n$. We prove that the sequence {$x_n$} generated by the above iterative algorithm converges strongly to a common fixed point $q\;{\in}\;F$ := $\bigcap^N_{i=1}F(T_i)\;\bigcap\;VI(C,\;B)$ which solves the variational inequality $\langle({\gamma}f\;-\;A)q,\;p\;-\;q{\rangle}\;{\leq}\;0$ for all $p\;{\in}\;F$. Using this result, we consider the problem of finding a common fixed point of a finite family of nonexpansive mappings and a strictly pseudocontractive mapping and the problem of finding a common element of the set of common fixed points of a finite family of nonexpansive mappings and the set of zeros of an inverse-strongly monotone mapping. The results obtained in this paper extend and improve the several recent results in this area.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2005.11a
• /
• pp.353-356
• /
• 2005

In this paper, the proposed $gamma({\gamma})$ line system is developed for reducing the error between non-linear gamma curve produced by a formula and result produced by hardware implementation. The proposed algorithm and system is based on the specific gamma value 2.2, namely the formula is represented by {0,1}$^{2.2}$ and the bit width of input and out data is 10bit. In order to reduce the error, the system is using least squares polynomial of the numerical method which is calculating the best fitting polynomial through a set of points. The proposed gamma line is consisting of nine kinds of quadratic equations, each with their own overlap sections to get more precise. Based on the algorithm verified by $MATLAB^{TM}$ 7.0, the proposed system is implemented by using Verilog-HDL. The proposed system has 2 clock latency; 1 result per clock. The error range (LSB) is -4 and +3. Its standard deviation is 1.287956238. The total gate count of system is 2,083 gates and the maximum timing is 15.56[ns].