• Title/Summary/Keyword: T-N

Search Result 11,813, Processing Time 0.035 seconds

Construction of a Relation Between the Triadic Min(N, T, D) and Max(N, T, D) Operating Policies Based on their Corresponding Expected Busy Periods (Busy Period 기대값을 사용하여 삼변수 Min(N, T, D)와 Max(N, T, D) 운용방침사이의 관계식 설정)

  • Rhee, Hahn-Kyou
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.3
    • /
    • pp.63-70
    • /
    • 2010
  • Based on the known results of the expected busy periods for the triadic Min (N, T, D) and Max (N, T, D) operating policies applied to a controllable M/G/1 queueing model, a relation between them is constructed. Such relation is represented in terms of the expected busy periods for the simple N, T and D, and the dyadic Min (N, T), Min (T, D) and Min (N, D) operating policies. Hence, if any system characteristics for one of the two triadic operating policies are known, unknown corresponding system characteristics for the other triadic operating policy could be obtained easily from the constructed relation.

AN ERDŐS-KO-RADO THEOREM FOR MINIMAL COVERS

  • Ku, Cheng Yeaw;Wong, Kok Bin
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.3
    • /
    • pp.875-894
    • /
    • 2017
  • Let $[n]=\{1,2,{\ldots},n\}$. A set ${\mathbf{A}}=\{A_1,A_2,{\ldots},A_l\}$ is a minimal cover of [n] if ${\cup}_{1{\leq}i{\leq}l}A_i=[n]$ and $$\bigcup_{{1{\leq}i{\leq}l,}\\{i{\neq}j_0}}A_i{\neq}[n]\text{ for all }j_0{\in}[l]$$. Let ${\mathcal{C}}(n)$ denote the collection of all minimal covers of [n], and write $C_n={\mid}{\mathcal{C}}(n){\mid}$. Let ${\mathbf{A}}{\in}{\mathcal{C}}(n)$. An element $u{\in}[n]$ is critical in ${\mathbf{A}}$ if it appears exactly once in ${\mathbf{A}}$. Two minimal covers ${\mathbf{A}},{\mathbf{B}}{\in}{\mathcal{C}}(n)$ are said to be restricted t-intersecting if they share at least t sets each containing an element which is critical in both ${\mathbf{A}}$ and ${\mathbf{B}}$. A family ${\mathcal{A}}{\subseteq}{\mathcal{C}}(n)$ is said to be restricted t-intersecting if every pair of distinct elements in ${\mathcal{A}}$ are restricted t-intersecting. In this paper, we prove that there exists a constant $n_0=n_0(t)$ depending on t, such that for all $n{\geq}n_0$, if ${\mathcal{A}}{\subseteq}{\mathcal{C}}(n)$ is restricted t-intersecting, then ${\mid}{\mathcal{A}}{\mid}{\leq}{\mathcal{C}}_{n-t}$. Moreover, the bound is attained if and only if ${\mathcal{A}}$ is isomorphic to the family ${\mathcal{D}}_0(t)$ consisting of all minimal covers which contain the singleton parts $\{1\},{\ldots},\{t\}$. A similar result also holds for restricted r-cross intersecting families of minimal covers.

Comparsion of Dst forecast models during intense geomagnetic storms (Dst $\leq$ -100 nT)

  • Ji, Eun-Young;Moon, Yong-Jae;Lee, Dong-Hun
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.35 no.2
    • /
    • pp.51.2-51.2
    • /
    • 2010
  • We have investigated 63 intense geomagnetic storms (Dst $\leq$ -100 nT) that occurred from 1998 to 2006. Using these events, we compared Dst forecast models: Burton et al. (1975), Fenrich and Luhmann (1998), O'Brien and McPherron (2000a), Wang et al. (2003), and Temerin and Li (2002, 2006) models. For comparison, we examined a linear correlation coefficient, RMS error, the difference of Dst minimum value (${\Delta}$peak), and the difference of Dst minimum time (${\Delta}$peak_time) between the observed and the predicted during geomagnetic storm period. As a result, we found that Temerin and Li model is mostly much better than other models. The model produces a linear correlation coefficient of 0.94, a RMS (Root Mean Square) error of 14.89 nT, a MAD (Mean Absolute Deviation) of ${\Delta}$peak of 12.54 nT, and a MAD of ${\Delta}$peak_time of 1.44 hour. Also, we classified storm events as five groups according to their interplanetary origin structures: 17 sMC events (IP shock and MC), 18 SH events (sheath field), 10 SH+MC events (Sheath field and MC), 8 CIR events, and 10 nonMC events (non-MC type ICME). We found that Temerin and Li model is also best for all structures. The RMS error and MAD of ${\Delta}$peak of their model depend on their associated interplanetary structures like; 19.1 nT and 16.7 nT for sMC, 12.5 nT and 7.8 nT for SH, 17.6 nT and 15.8 nT for SH+MC, 11.8 nT and 8.6 nT for CIR, and 11.9 nT and 10.5 nT for nonMC. One interesting thing is that MC-associated storms produce larger errors than the other-associated ones. Especially, the values of RMS error and MAD of ${\Delta}$peak of SH structure of Temerin and Li model are very lower than those of other models.

  • PDF

GENERALIZED CAYLEY GRAPH OF UPPER TRIANGULAR MATRIX RINGS

  • Afkhami, Mojgan;Hashemifar, Seyed Hosein;Khashyarmanesh, Kazem
    • Bulletin of the Korean Mathematical Society
    • /
    • v.53 no.4
    • /
    • pp.1017-1031
    • /
    • 2016
  • Let R be a commutative ring with the non-zero identity and n be a natural number. ${\Gamma}^n_R$ is a simple graph with $R^n{\setminus}\{0\}$ as the vertex set and two distinct vertices X and Y in $R^n$ are adjacent if and only if there exists an $n{\times}n$ lower triangular matrix A over R whose entries on the main diagonal are non-zero such that $AX^t=Y^t$ or $AY^t=X^t$, where, for a matrix B, $B^t$ is the matrix transpose of B. ${\Gamma}^n_R$ is a generalization of Cayley graph. Let $T_n(R)$ denote the $n{\times}n$ upper triangular matrix ring over R. In this paper, for an arbitrary ring R, we investigate the properties of the graph ${\Gamma}^n_{T_n(R)}$.

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

  • Song, Yisheng;Chen, Rudong
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.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.

A Renewal Theorem for Random Walks with Time Stationary Random Distribution Function

  • Hong, Dug-Hun
    • Journal of the Korean Statistical Society
    • /
    • v.25 no.1
    • /
    • pp.153-159
    • /
    • 1996
  • Sums of independent random variables $S_n = X_1 + X_ + cdots + X_n$ are considered, where the X$_{n}$ are chosen according to a stationary process of distributions. Given the time t .geq. O, let N (t) be the number of indices n for which O < $S_n$ $\geq$ t. In this set up we prove that N (t)/t converges almost surely and in $L^1$ as t longrightarrow $\infty$, which generalizes classical renewal theorem.m.

  • PDF

Studies on the Primary Structure of the Alkaline Protease in Neungee [Sarcodon aspratus (Berk.) S. Ito] I. Amino Acid Composition, Chemical Modification and Sequence of the N-terminal Amino Acid (능이[Sarcodon aspratus(Berk.) S. Ito]중 알카리성 단백질가수분해효소의 1차구조에 관한 연구 I. 아미노산 조성, 활성부위 아미노산 및 N-말단 부위의 아미노산 배열)

  • 이태규
    • Journal of the Korean Society of Food Science and Nutrition
    • /
    • v.22 no.6
    • /
    • pp.811-814
    • /
    • 1993
  • Properties of a protease purified from Sarcodon asparatus(Berk.) S. Ito have been investigated. The enzyme displays as a glycosylated serine protease. The sequence for the 21 amino acids of the N-terminal side in the enzyme was determined by automated sequence analysis. The sequence was V-T-T-K-Q-T-N-A-P-W-G-L-G-N-I-S-T-T-N-K-L-.

  • PDF

APPROXIMATION OF COMMON FIXED POINTS OF NON-SELF ASYMPTOTICALLY NONEXPANSIVE MAPPINGS

  • Kim, Jong-Kyu;Dashputre, Samir;Diwan, S.D.
    • East Asian mathematical journal
    • /
    • v.25 no.2
    • /
    • pp.179-196
    • /
    • 2009
  • Let E be a uniformly convex Banach space and K a nonempty closed convex subset which is also a nonexpansive retract of E. For i = 1, 2, 3, let $T_i:K{\rightarrow}E$ be an asymptotically nonexpansive mappings with sequence ${\{k_n^{(i)}\}\subset[1,{\infty})$ such that $\sum_{n-1}^{\infty}(k_n^{(i)}-1)$ < ${\infty},\;k_{n}^{(i)}{\rightarrow}1$, as $n{\rightarrow}\infty$ and F(T)=$\bigcap_{i=3}^3F(T_i){\neq}{\phi}$ (the set of all common xed points of $T_i$, i = 1, 2, 3). Let {$a_n$},{$b_n$} and {$c_n$} are three real sequences in [0, 1] such that $\in{\leq}\;a_n,\;b_n,\;c_n\;{\leq}\;1-\in$ for $n{\in}N$ and some ${\in}{\geq}0$. Starting with arbitrary $x_1{\in}K$, define sequence {$x_n$} by setting {$$x_{n+1}=P((1-a_n)x_n+a_nT_1(PT_1)^{n-1}y_n)$$ $$y_n=P((1-b_n)x_n+a_nT_2(PT_2)^{n-1}z_n)$$ $$z_n=P((1-c_n)x_n+c_nT_3(PT_3)^{n-1}x_n)$$. Assume that one of the following conditions holds: (1) E satises the Opial property, (2) E has Frechet dierentiable norm, (3) $E^*$ has Kedec -Klee property, where $E^*$ is dual of E. Then sequence {$x_n$} converges weakly to some p${\in}$F(T).

MINIMUM RANK OF THE LINE GRAPH OF CORONA CnoKt

  • Im, Bokhee;Lee, Hwa-Young
    • Communications of the Korean Mathematical Society
    • /
    • v.30 no.2
    • /
    • pp.65-72
    • /
    • 2015
  • The minimum rank mr(G) of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose (i, j)-th entry (for $i{\neq}j$) is nonzero whenever {i, j} is an edge in G and is zero otherwise. The corona $C_n{\circ}K_t$ is obtained by joining all the vertices of the complete graph $K_t$ to each n vertex of the cycle $C_n$. For any t, we obtain an upper bound of zero forcing number of $L(C_n{\circ}K_t)$, the line graph of $C_n{\circ}K_t$, and get some bounds of $mr(L(C_n{\circ}K_t))$. Specially for t = 1, 2, we have calculated $mr(L(C_n{\circ}K_t))$ by the cut-vertex reduction method.

GENERALIZED EULER POWER SERIES

  • KIM, MIN-SOO
    • Journal of applied mathematics & informatics
    • /
    • v.38 no.5_6
    • /
    • pp.591-600
    • /
    • 2020
  • This work is a continuation of our investigations for p-adic analogue of the alternating form Dirichlet L-functions $$L_E(s,{\chi})={\sum\limits_{n=1}^{\infty}}{\frac{(-1)^n{\chi}(n)}{n^s}},\;Re(s)>0$$. Let Lp,E(s, t; χ) be the p-adic Euler L-function of two variables. In this paper, for any α ∈ ℂp, |α|p ≤ 1, we give a power series expansion of Lp,E(s, t; χ) in terms of the variable t. From this, we derive a power series expansion of the generalized Euler polynomials with negative index, that is, we prove that $$E_{-n,{\chi}}(t)={\sum\limits_{m=0}^{\infty}}\(\array{-n\\m}\)E_{-(m+n),{\chi}^{t^m}},\;n{\in}{\mathbb{N}}$$, where t ∈ ℂp with |t|p < 1. Some further properties for Lp,E(s, t; χ) has also been shown.