• 제목/요약/키워드: A to N

검색결과 58,950건 처리시간 0.087초

Effect of electron-beam irradiation on leakage current of AlGaN/GaN HEMTs on sapphire

  • Oh, Seung Kyu;Song, Chi Gyun;Jang, Taehoon;Kwak, Joon Seop
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제13권6호
    • /
    • pp.617-621
    • /
    • 2013
  • This study examined the effect of electron-beam (E-beam) irradiation on the electrical properties of n-GaN, AlGaN and AlGN/GaN structures on sapphire substrates. E-beam irradiation resulted in a significant decrease in the gate leakage current of the n-GaN, AlGaN and HEMT structure from $4.0{\times}10^{-4}A$, $6.5{\times}10^{-5}A$, $2.7{\times}10^{-8}A$ to $7.7{\times}10^{-5}A$, $7.7{\times}10^{-6}A$, $4.7{\times}10^{-9}A$, respectively, at a drain voltage of -10V. Furthermore, we also investigated the effect of E-beam irradiation on the AlGaN surface in AlGaN/GaN heterostructure high electron mobility transistors(HEMTs). The results showed that the maximum drain current density of the AlGaN/GaN HEMTs with E-beam irradiation was greatly improved, when compared to that of the AlGaN/GaN HEMTs without E-beam irradiation. These results strongly suggest that E-beam irradiation is a promising method to reduce leakage current of AlGaN/GaN HEMTs on sapphire through the neutralization the trap.

RIGIDITY OF PROPER HOLOMORPHIC MAPS FROM Bn+1 TO B3n-1

  • Wang, Sung-Ho
    • 대한수학회지
    • /
    • 제46권5호
    • /
    • pp.895-905
    • /
    • 2009
  • Let $B^{n+1}$ be the unit ball in the complex vector space $\mathbb{C}^{n+1}$ with the standard Hermitian metric. Let ${\Sigma}^n={\partial}B^{n+1}=S^{2n+1}$ be the boundary sphere with the induced CR structure. Let f : ${\Sigma}^n{\hookrightarrow}{\Sigma}^N$ be a local CR immersion. If N < 3n - 1, the asymptotic vectors of the CR second fundamental form of f at each point form a subspace of the CR(horizontal) tangent space of ${\Sigma}^n$ of codimension at most 1. We study the higher order derivatives of this relation, and we show that a linearly full local CR immersion f : ${\Sigma}^n{\hookrightarrow}{\Sigma}^N$, N $\leq$ 3n-2, can only occur when N = n, 2n, or 2n + 1. As a consequence, it gives an extension of the classification of the rational proper holomorphic maps from $B^{n+1}$ to $B^{2n+2}$ by Hamada to the classification of the rational proper holomorphic maps from $B^{n+1}$ to $B^{3n+1}$.

WEAK AND STRONG CONVERGENCE OF MANN'S-TYPE ITERATIONS FOR A COUNTABLE FAMILY OF NONEXPANSIVE MAPPINGS

  • Song, Yisheng;Chen, Rudong
    • 대한수학회지
    • /
    • 제45권5호
    • /
    • pp.1393-1404
    • /
    • 2008
  • Let K be a nonempty closed convex subset of a Banach space E. Suppose $\{T_{n}\}$ (n = 1,2,...) is a uniformly asymptotically regular sequence of nonexpansive mappings from K to K such that ${\cap}_{n=1}^{\infty}$ F$\(T_n){\neq}{\phi}$. For $x_0{\in}K$, define $x_{n+1}={\lambda}_{n+1}x_{n}+(1-{\lambda}_{n+1})T_{n+1}x_{n},n{\geq}0$. If ${\lambda}_n{\subset}[0,1]$ satisfies $lim_{n{\rightarrow}{\infty}}{\lambda}_n=0$, we proved that $\{x_n\}$ weakly converges to some $z{\in}F\;as\;n{\rightarrow}{\infty}$ in the framework of reflexive Banach space E which satisfies the Opial's condition or has $Fr{\acute{e}}chet$ differentiable norm or its dual $E^*$ has the Kadec-Klee property. We also obtain that $\{x_n\}$ strongly converges to some $z{\in}F$ in Banach space E if K is a compact subset of E or there exists one map $T{\in}\{T_{n};n=1,2,...\}$ satisfy some compact conditions such as T is semi compact or satisfy Condition A or $lim_{n{\rightarrow}{\infty}}d(x_{n},F(T))=0$ and so on.

Seedling Growth and Yield of Rice as Applying Slow Release Nitrogen Fertilizers Mixed with Seed Bed Soil in Seedling Box

  • Lee, Suk-Soon;Lee, Dong-Wook
    • 한국작물학회지
    • /
    • 제46권4호
    • /
    • pp.289-295
    • /
    • 2001
  • Experiments were conducted to find out the optimum level of slow release N fertilizers when total amounts of nitrogen required throughout the growing season in paddy were applied in the soil of seedling box. To evaluate the emergence rate and growth of rice seedlings, five levels of Meister (MS) 10, MS S10, and latex coated urea (LCU) which are equivalent to 0, 40, 60, 80, and 100kg N h $a^{-l}$ were mixed in soil of the seedling box. Emergence rate differed depending on the fertilizers and N levels; in MS 10 plots the emergence rate was 40.8% at 40kg N h $a^{-l}$ and no seedlings were emerged at the higher levels, in MS S10 plots higher than 80% at all the N levels, and decreased with the N levels from 70.0% at 40 kg N h $a^{-l}$ to 59.5% at 100kg N h $a^{-l}$ of LCU. Seedling started to wilt at 40 kg N h $a^{-l}$ of MS 10 and 80 and 100 kg N h $a^{-l}$ N of LCU on the 8th day after sowing, while seedling growth was normal at all the levels of MS S10. Field performance of rice was evaluated at the 0, 30, 60, 90, 120kg N h $a^{-l}$ of MS S10 applied in the soil of seedling box and N was not applied in paddy. Grain yield at 90 and 120kg N h $a^{-l}$ of MS S10 was similar to conventional urea split application (120 kg N h $a^{-l}$), but significantly higher compared to 30 and 60kg N h $a^{-l}$ of MS S10. Fertilizer N recovery decreased with N levels and the N recovery at 90 kg N h $a^{-l}$ of MS S10 and conventional urea split application were 62.2 % and 44.2%, respectively, with similar grain yield. The optimum level of MS S10 to be applied in seedling box seems to be about 90 kg N h $a^{-l}$ considering grain yield, price of fertilizer, labor applying fertilizer, and fertilizer N recovery.d fertilizer N recovery.

  • PDF

Net Portal Fluxes of Nitrogen Metabolites in Holstein Steers Fed Diets Containing Different Dietary Ratios of Whole-crop Corn Silage and Alfalfa Hay

  • EL-Sabagh, M.;Imoto, S.;Yukizane, K.;Yokotani, A.;Sugino, T.;Obitsu, T.;Taniguchi, K.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • 제22권3호
    • /
    • pp.371-377
    • /
    • 2009
  • The objectives of the present study were to investigate the effects of different dietary ratios of whole-crop corn silage and alfalfa hay on nitrogen (N) digestion, duodenal flow and metabolism across the portal-drained viscera (PDV) of growing beef steers, and to elucidate their relationships. Four steers (236${\pm}$7 kg BW) fitted with duodenal cannulae and chronic indwelling catheters into the portal and mesenteric veins and abdominal aorta were used in a 4${\times}$4 Latin square design. Animals were fed (at 12-h intervals) the 4 diets consisting of whole-crop corn silage (C) and alfalfa hay (A) in 80:20 (C8A2), 60:40 (C6A4), 40:60 (C4A6) and 20:80 (C2A8) ratios of which dietary crude protein (CP) was 10.5, 12.0, 13.5 and 15.0% of dry matter (DM), respectively. Feeding level was restricted to 95% of ad libitum intake to measure N digestion, blood flow and net flux of N across the PDV. Digestibility of DM and neutral detergent fiber and digestible energy intake linearly increased as the ratio of alfalfa hay increased. The N intake, duodenal flow and intestinal disappearance increased linearly with increasing alfalfa hay. Arterial and portal concentrations of ${\alpha}$-amino N showed a quadratic response to increasing levels of alfalfa hay and were the highest in steers fed the C6A4 diet. The net PDV release of ${\alpha}$-amino N and ammonia N increased linearly with increasing alfalfa hay, but urea N uptake by PDV did not differ among diets. As a percentage of apparently digested N in the total gut, net PDV release of ${\alpha}$-amino N linearly decreased from 66 to 48% with increasing alfalfa hay. Conversely, net PDV recovery of ${\alpha}$-amino N to intestinal N disappearance varied with increasing alfalfa hay accounting for 49, 50, 58 and 61% on C8A2, C6A4, C4A6 and C2A8 diets, respectively. Net PDV uptake of urea N, relative to apparently digested N, linearly decreased from 81 to 25% as alfalfa hay increased from 20 to 80% of DM intake. Considering PDV uptake of urea N, microbial efficiency and conversion of total tract digested N to PDV ${\alpha}$-amino N net supply, a diet consisting of 80% whole-crop corn silage and 20% alfalfa hay (10.5% CP) was the best, while considering the quantities of intestinal N disappearance and ${\alpha}$-amino N absorption, a diet of 20% whole-crop corn silage and 80% alfalfa hay (15% CP) would be preferred. The proportion of ${\alpha}$-amino N recovered by PDV relative to the intestinal N disappearance may vary with energy intake level of mixed forage diets.

(N, n)-선점 재샘플링-반복 우선순위 대기행렬 ((N, n)-Preemptive Repeat-Different Priority Queues)

  • 김길환
    • 산업경영시스템학회지
    • /
    • 제40권3호
    • /
    • pp.66-75
    • /
    • 2017
  • Priority disciplines are an important scheme for service systems to differentiate their services for different classes of customers. (N, n)-preemptive priority disciplines enable system engineers to fine-tune the performances of different classes of customers arriving to the system. Due to this virtue of controllability, (N, n)-preemptive priority queueing models can be applied to various types of systems in which the service performances of different classes of customers need to be adjusted for a complex objective. In this paper, we extend the existing (N, n)-preemptive resume and (N, n)-preemptive repeat-identical priority queueing models to the (N, n)-preemptive repeat-different priority queueing model. We derive the queue-length distributions in the M/G/1 queueing model with two classes of customers, under the (N, n)-preemptive repeat-different priority discipline. In order to derive the queue-length distributions, we employ an analysis of the effective service time of a low-priority customer, a delay cycle analysis, and a joint transformation method. We then derive the first and second moments of the queue lengths of high- and low-priority customers. We also present a numerical example for the first and second moments of the queue length of high- and low-priority customers. Through doing this, we show that, under the (N, n)-preemptive repeat-different priority discipline, the first and second moments of customers with high priority are bounded by some upper bounds, regardless of the service characteristics of customers with low priority. This property may help system engineers design such service systems that guarantee the mean and variance of delay for primary users under a certain bounds, when preempted services have to be restarted with another service time resampled from the same service time distribution.

On the Numbers of Palindromes

  • Bang, Sejeong;Feng, Yan-Quan;Lee, Jaeun
    • Kyungpook Mathematical Journal
    • /
    • 제56권2호
    • /
    • pp.349-355
    • /
    • 2016
  • For any integer $n{\geq}2$, each palindrome of n induces a circulant graph of order n. It is known that for each integer $n{\geq}2$, there is a one-to-one correspondence between the set of (resp. aperiodic) palindromes of n and the set of (resp. connected) circulant graphs of order n (cf. [2]). This bijection gives a one-to-one correspondence of the palindromes ${\sigma}$ with $gcd({\sigma})=1$ to the connected circulant graphs. It was also shown that the number of palindromes ${\sigma}$ of n with $gcd({\sigma})=1$ is the same number of aperiodic palindromes of n. Let $a_n$ (resp. $b_n$) be the number of aperiodic palindromes ${\sigma}$ of n with $gcd({\sigma})=1$ (resp. $gcd({\sigma}){\neq}1$). Let $c_n$ (resp. $d_n$) be the number of periodic palindromes ${\sigma}$ of n with $gcd({\sigma})=1$ (resp. $gcd({\sigma}){\neq}1$). In this paper, we calculate the numbers $a_n$, $b_n$, $c_n$, $d_n$ in two ways. In Theorem 2.3, we $n_d$ recurrence relations for $a_n$, $b_n$, $c_n$, $d_n$ in terms of $a_d$ for $d{\mid}n$ and $d{\neq}n$. Afterwards, we nd formulae for $a_n$, $b_n$, $c_n$, $d_n$ explicitly in Theorem 2.5.

THE SPECTRAL DETERMINATIONS OF THE JOIN OF TWO FRIENDSHIP GRAPHS

  • Abdian, Ali Zeydi;Moez, Amirhossein Morovati
    • 호남수학학술지
    • /
    • 제41권1호
    • /
    • pp.67-87
    • /
    • 2019
  • The main aim of this study is to characterize new classes of multicone graphs which are determined by their adjacency spectra, their Laplacian spectra, their complement with respect to signless Laplacian spectra and their complement with respect to their adjacency spectra. A multicone graph is defined to be the join of a clique and a regular graph. If n is a positive integer, a friendship graph $F_n$ consists of n edge-disjoint triangles that all of them meet in one vertex. It is proved that any connected graph cospectral to a multicone graph $F_n{\nabla}F_n=K_2{\nabla}nK_2{\nabla}nK_2$ is determined by its adjacency spectra as well as its Laplacian spectra. In addition, we show that if $n{\neq}2$, the complement of these graphs are determined by their adjacency spectra. At the end of the paper, it is proved that multicone graphs $F_n{\nabla}F_n=K_2{\nabla}nK_2{\nabla}nK_2$ are determined by their signless Laplacian spectra and also we prove that any graph cospectral to one of multicone graphs $F_n{\nabla}F_n$ is perfect.

A highly integrable p-GaN MSM photodetector with GaN n-channel MISFET for UV image sensor system

  • Lee, Heon-Bok;Hahm, Sung-Ho
    • 센서학회지
    • /
    • 제17권5호
    • /
    • pp.346-349
    • /
    • 2008
  • A metal-semiconductor-metal (MSM) ultraviolet (UV) photodetector (PD) is proposed as an effective UV sensing device for integration with a GaN n-channel MISFET on auto-doped p-type GaN grown on a silicon substrate. Due to the high hole barrier of the metal-p-GaN contact, the dark current density of the fabricated MSM PD was less than $3\;nA/cm^2$ at a bias of up to 5 V. Meanwhile, the UV/visible rejection ratio was 400 and the cutoff wavelength of the spectral responsivity was 365 nm. However, the UV/visible ratio was limited by the sub-bandgap response, which was attributed to defectrelated deep traps in the p-GaN layer of the MSM PD. In conclusion, an MSM PD has a high process compatibility with the n-channel GaN Schottky barrier MISFET fabrication process and epitaxy on a silicon substrate.

A Nearly Optimal One-to-Many Routing Algorithm on k-ary n-cube Networks

  • Choi, Dongmin;Chung, Ilyong
    • 스마트미디어저널
    • /
    • 제7권2호
    • /
    • pp.9-14
    • /
    • 2018
  • The k-ary n-cube $Q^k_n$ is widely used in the design and implementation of parallel and distributed processing architectures. It consists of $k^n$ identical nodes, each node having degree 2n is connected through bidirectional, point-to-point communication channels to different neighbors. On $Q^k_n$ we would like to transmit packets from a source node to 2n destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $0{\leq}i{\leq}2n-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(n^3)$ routing algorithm on $Q^k_n$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.