• YAKHAK HOEJI
• /
• v.41 no.5
• /
• pp.582-587
• /
• 1997

The 6.7-dichloroquinoline-5,8-dione (I) was reacted with ethyl acetoacetate in the presence of sodium ethoxide to yield 6-(${\alpha}$-acetyl-${\alpha}$-ethoxycarbonyl methyl)-7-chloro-qui noline-5,8-dione(II). When this compound II was reacted with some arylamine (phenyl, p-toluyl, p-fluorophenyl, p-chlorophenyl. p-bromophenyl, p-iodophenyl, p-trifluoromethylphenyl, p-dimethylaminophenyl,indanyl), 1N-aryl-2-methyl-3-ethoxycarbonyl pyridino[2,3-f]-indole-4.9-dione(IIIa-I) were obtained via intramolecular cyclization.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.16 no.4
• /
• pp.180-186
• /
• 2023

Positive bias temperature instability (PBTI) degradation of n⁺ and p⁺ poly-Si gate high-voltage(HV) SiO2 dielectric nMOSFETs was investigated. Unlike the expectation that degradation of n⁺/nMOSFET will be greater than p⁺/nMOSFET owing to the oxide electric field caused by the gate material difference, the magnitude of the PBTI degradation was greater for the p⁺/nMOSFET than for the n⁺/nMOSFET. To analyze the cause, the interface state and oxide charge were extracted for each case, respectively. Also, the carrier injection and trapping mechanism were analyzed using the carrier separation method. As a result, it has been verified that hole injection and trapping by the p⁺ poly-Si gate accelerates the degradation of p⁺/nMOSFET. The carrier injection and trapping processes of the n⁺ and p⁺ poly-Si gate high-voltage nMOSFETs in PBTI are detailed in this paper.

• Honam Mathematical Journal
• /
• v.42 no.1
• /
• pp.139-150
• /
• 2020

Let p be a prime number with p > 3, p ≡ 3 (mod 4) and let n be a positive integer. In this paper, we prove that the Diophantine equation (5pn² - 1)^x + (p(p - 5)n² + 1)^y = (pn)^z has only the positive integer solution (x, y, z) = (1, 1, 2) where pn ≡ ±1 (mod 5). As an another result, we show that the Diophantine equation (35n² - 1)^x + (14n² + 1)^y = (7n)^z has only the positive integer solution (x, y, z) = (1, 1, 2) where n ≡ ±3 (mod 5) or 5 | n. On the proofs, we use the properties of Jacobi symbol and Baker's method.

• Asian-Australasian Journal of Animal Sciences
• /
• v.13 no.5
• /
• pp.659-665
• /
• 2000

A nitrogen (N) balance trial was conducted to examine the effect of N deprivation on subsequent N retention, blood urea nitrogen (BUN) and IGF-I levels and the ratio of IGF binding protein (IGFBP)-3 to IGFBP-l and -2. Pigs in treatment (T) 1 were given diet A (2.39% N) and those in T2 and T3 were given diet B (1.31% N) and excreta were collected (period 1 (P1)). Pigs in T1 continued to receive diet A while diets for T2 and T3 were changed to diets A and C (2.74% N), respectively. The excreta were collected for two more periods (P2 and P3). During P1, pigs in T2 and T3 retained 50% less N (p<0.001) than those in T1. However, pigs provided T2 (p<0.01) and T3 (p<0.05) retained more N than those assigned to T1 during P2. Pigs in T3 tended to retain more (p=0.10) N than those receiving T2 for the same period. The BUN values were lower (p<0.05) for pigs assigned to T2 and T3 than T1 during P1 and P2. Both IGF-I and IGFBP ratios of pigs assigned to T1 were higher (p<0.05) than those given T2 and T3 during P1 but no differences were found during P2 and P3.

• Journal of applied mathematics & informatics
• /
• v.40 no.5_6
• /
• pp.1181-1198
• /
• 2022

In this paper we are concerned with the number of fuzzy subgroups of a finite abelian p-group ℤ_p^m × ℤ_pⁿ × ℤ_p^ℓ of rank three with order p^m+n+ℓ. We obtain a recurrence relation for the number of fuzzy subgroups of a finite abelian p-group ℤ_p^m × ℤ_pⁿ × ℤ_p^ℓ. In order to show that using this recurrence relation, one can find explicit formulas for the number of fuzzy subgroups of ℤ_p^m × ℤ_pⁿ × ℤ_p^ℓ consecutively, we give explicit formulas for the number of fuzzy subgroups of ℤ_p^m × ℤ_pⁿ × ℤ_p^ℓ where (n, ℓ) = (1, 1), (2, 1), (3, 1), (4, 1), (5, 1), (2, 2), (3, 2), (4, 2), (5, 2).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4A
• /
• pp.364-370
• /
• 2002

In this paper, we propose a VLSI array architecture for high speed processing of FBMA. First of all, the sequential FBMA is transformed into a single assignment code by using the index space expansion, and then the dependance graph is obtained from it. The two dimensional VLSI array is derived by projecting the dependance graph along the optimal direction. Since the candidate blocks in the search range are overlapped with columns as well as rows, the processing elements of the VLSI array are designed to reuse the overlapped data. As the results, the number of data inputs is reduced so that the processing performance is improved. The proposed VLSI array has (N$^2$+1)${\times}$(2p+1) processing elements and (N+2p) input ports where N is the block size and p is the maximum search range. The computation time of the rat reference block is (N$^2$+2(p+1)N+6p), and the block pipeline period is (3N+4p-1).

• Journal of the Korean Mathematical Society
• /
• v.48 no.2
• /
• pp.431-447
• /
• 2011

We investigate the asymptotic behavior of positive solutions to the elliptic equation (0.1) ${\Delta}u+|x|^{l_1}u^p+|x|^{l_2}u^q=0$ in $\mathbb{R}^n$. We obtain a conclusion that, for n $\geq$ 3, -2 < $l_2$ < $l_1$ $\leq$ 0 and q > p > 1, any positive radial solution to (0.1) has the following properties: $lim_{r{\rightarrow}{\infty}}r^{\frac{2+l_1}{p-1}}\;u$ and $lim_{r{\rightarrow}0}r^{\frac{2+l_2}{q-1}}\;u$ always exist if $\frac{n+1_1}{n-2}$ < p < q, $p\;{\neq}\;\frac{n+2+2l_1}{n-2}$, $q\;{\neq}\;\frac{n+2+2l_2}{n-2}$. In addition, we prove that the singular positive solution of (0.1) is unique under some conditions.

• Kyungpook Mathematical Journal
• /
• v.61 no.4
• /
• pp.679-710
• /
• 2021

We study the tensor product algebra P_k(x₁) ⊗ P_k(x₂) ⊗ ⋯ ⊗ P_k(x_m), where P_k(x) is the partition algebra defined by Jones and Martin. We discuss the centralizer of this algebra and corresponding Schur-Weyl dualities and also index the inequivalent irreducible representations of the algebra P_k(x₁) ⊗ P_k(x₂) ⊗ ⋯ ⊗ P_k(x_m) and compute their dimensions in the semisimple case. In addition, we describe the Bratteli diagrams and branching rules. Along with that, we have also constructed the RS correspondence for the tensor product of m-partition algebras which gives the bijection between the set of tensor product of m-partition diagram of P_k(n₁) ⊗ P_k(n₂) ⊗ ⋯ ⊗ P_k(n_m) and the pairs of m-vacillating tableaux of shape [λ] ∈ Γ_k^m, Γ_k^m = {[λ] = (λ₁, λ₂, …, λ_m)|λ_i ∈ Γ_k, i ∈ {1, 2, …, m}} where Γ_k = {λ_i ⊢ t|0 ≤ t ≤ k}. Also, we provide proof of the identity $(n_1n_2{\cdots}n_m)^k={\sum}_{[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}$ f^[λ]m_k^[λ] where m_k^[λ] is the multiplicity of the irreducible representation of $S{_{n_1}}{\times}S{_{n_2}}{\times}....{\times}S{_{n_m}}$ module indexed by ${[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}$, where f^[λ] is the degree of the corresponding representation indexed by ${[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}$ and ${[{\lambda}]{\in}{\Lambda}^k_{{n_1},{n_2},{\ldots},{n_m}}}=\{[{\lambda}]=({\lambda}_1,{\lambda}_2,{\ldots},{\lambda}_m){\mid}{\lambda}_i{\in}{\Lambda}^k_{n_i},i{\in}\{1,2,{\ldots},m\}\}$ where ${\Lambda}^k_{n_i}=\{{\mu}=({\mu}_1,{\mu}_2,{\ldots},{\mu}_t){\vdash}n_i{\mid}n_i-{\mu}_1{\leq}k\}$.

• Journal of Environmental Health Sciences
• /
• v.34 no.5
• /
• pp.374-381
• /
• 2008

In this study, the factors affecting biological N and P removal using SND (simultaneous nitrification and denitrification) process were investigated and evaluated to examine the possibility of treating N and P through SND with NADH by surveying N and P traces in an aeration tank. Variations of $NH_4^+$-N+$NO_3^-$-N concentration were used to estimate the degree of SND in each point (P2, P3, P4, P5) of the aeration tank and these variations showed that denitrification efficiency in P2 (front zone), nitrification and denitrification efficiencies in P4 (middle zone) were 67%, 86% and 39%, respectively. When $PO_4^{-3}$-P concentration was analyzed in each point of the aeration tank, it was shown that $PO_4^{-3}$-P concentration coming into P2 was 1.25 mg/L, which increased to 2.22 mg/L by P release in P2 zone and then decreased to 0.74 mg/L by P uptake in P4. Consequently, we were able to estimate which high P removal efficiency observed in this study was caused by biological phosphorus removal. To determine the operating factors affecting effluent T-N, we analyzed the correlation among FN/M ratio, C/N ratio, Temp., SRT etc and these results showed that the correlation among FN/M ratio, C/N ratio and Temp was not high. However, the relationship of SRT and other parameters (effluent $NH_4^+$-N and effluent BOD) and the short SRT could have an affect on effluent $NH_4^+$-N and so effluent BOD could be increased. Thus, SRT operation should be controlled over 10 days. The results for analyzing the correlation between SRT and influent $NO_3^-$-N in order to investigate the operating factors affecting effluent T-P showed that T-P or $PO_4^{-3}$-P was not highly correlation with SRT, whereas $PO_4^{-3}$-P concentration increased along with increasing $NO_3^-$-N concentration into P2. Based on these results, we concluded, using regression analysis (R2=0.97), that effluent $PO_4^{-3}$-P concentration depends on $NO_3^-$-N concentration into P2.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.71-76
• /
• 2014

There is to be virtually impossible to solve the very large digits of prime number p and q from composite number n=pq using integer factorization in typical public-key cryptosystems, RSA. When the public key e and the composite number n are known but the private key d remains unknown in an asymmetric-key RSA, message decryption is carried out by first obtaining ${\phi}(n)=(p-1)(q-1)=n+1-(p+q)$ and then using a reverse function of $d=e^{-1}(mod{\phi}(n))$. Integer factorization from n to p,q is most widely used to produce ${\phi}(n)$, which has been regarded as mathematically hard. Among various integer factorization methods, the most popularly used is the congruence of squares of $a^2{\equiv}b^2(mod\;n)$, a=(p+q)/2,b=(q-p)/2 which is more commonly used then n/p=q trial division. Despite the availability of a number of congruence of scares methods, however, many of the RSA numbers remain unfactorable. This paper thus proposes an algorithm that directly and immediately obtains ${\phi}(n)$. The proposed algorithm computes $2^k{\beta}_j{\equiv}2^i(mod\;n)$, $0{\leq}i{\leq}{\gamma}-1$, $k=1,2,{\ldots}$ or $2^k{\beta}_j=2{\beta}_j$ for $2^j{\equiv}{\beta}_j(mod\;n)$, $2^{{\gamma}-1}$ < n < $2^{\gamma}$, $j={\gamma}-1,{\gamma},{\gamma}+1$ to obtain the solution. It has been found to be capable of finding an arbitrarily located ${\phi}(n)$ in a range of $n-10{\lfloor}{\sqrt{n}}{\rfloor}$ < ${\phi}(n){\leq}n-2{\lfloor}{\sqrt{n}}{\rfloor}$ much more efficiently than conventional algorithms.