• Title/Summary/Keyword: N-function

Search Result 5,623, Processing Time 0.032 seconds

Influence Function on the Coefficient of Variation (변이계수에 대한 영향함수)

  • Lee, Yun-Hee;Kim, Hong-Gie
    • Communications for Statistical Applications and Methods
    • /
    • v.15 no.4
    • /
    • pp.509-516
    • /
    • 2008
  • We derive the influence function on the coefficient of variation. Empirical influence function and Sample influence function are used to verify the validity of the derived influence function. To show the validity of the influence function, we carry out simulations with random samples from normal distribution $N(20,1^2)$ and $N(20,5^2)$, respectively. The simulation result proves that the derived influence function is very accurate in estimating changes in the coefficient of variation when an observation is deleted.

AN ELIGIBLE PRIMAL-DUAL INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION

  • Cho, Gyeong-Mi;Lee, Yong-Hoon
    • East Asian mathematical journal
    • /
    • v.29 no.3
    • /
    • pp.279-292
    • /
    • 2013
  • It is well known that each kernel function defines a primal-dual interior-point method(IPM). Most of polynomial-time interior-point algorithms for linear optimization(LO) are based on the logarithmic kernel function([2, 11]). In this paper we define a new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has ${\mathcal{O}}((log\;p){\sqrt{n}}\;log\;n\;log\;{\frac{n}{\epsilon}})$ and ${\mathcal{O}}((q\;log\;p)^{\frac{3}{2}}{\sqrt{n}}\;log\;{\frac{n}{\epsilon}})$ iteration bound for large- and small-update methods, respectively. These are currently the best known complexity results.

AN ELIGIBLE KERNEL BASED PRIMAL-DUAL INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION

  • Cho, Gyeong-Mi
    • Honam Mathematical Journal
    • /
    • v.35 no.2
    • /
    • pp.235-249
    • /
    • 2013
  • It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $\mathcal{O}(({\log}\;p)^{\frac{5}{2}}\sqrt{n}{\log}\;n\;{\log}\frac{n}{\epsilon})$ and $\mathcal{O}(q^{\frac{3}{2}}({\log}\;p)^3\sqrt{n}{\log}\;\frac{n}{\epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.

A Study of The Voltage Transfer Function Dependent On Input Conditions For An N-Input NAND Gate (N-Input NAND Gate에서 입력조건에 따른 Voltage Transfer Function에 관한 연구)

  • Kim In-Mo;Song Sang-Hun;Kim Soo-Won
    • The Transactions of the Korean Institute of Electrical Engineers C
    • /
    • v.53 no.10
    • /
    • pp.510-514
    • /
    • 2004
  • In this paper, we analytically examine the voltage transfer function dependent on input conditions for an N-Input NAND Gate. The logic threshold voltage, defined as a voltage at which the input and the output voltage become equal, changes as the input condition changes for a static NAND Gate. The logic threshold voltage has the highest value when all the N-inputs undergo transitions and it has the lowest value when only the last input connected to the last NMOS to ground, makes a transition. This logic threshold voltage difference increases as the number of inputs increases. Therefore, in order to provide a near symmetric voltage transfer function, a multistage N-Input Gate consisting of 2-Input Logic Gates is desirable over a conventional N-Input Gate.

A LARGE-UPDATE INTERIOR POINT ALGORITHM FOR $P_*(\kappa)$ LCP BASED ON A NEW KERNEL FUNCTION

  • Cho, You-Young;Cho, Gyeong-Mi
    • East Asian mathematical journal
    • /
    • v.26 no.1
    • /
    • pp.9-23
    • /
    • 2010
  • In this paper we generalize large-update primal-dual interior point methods for linear optimization problems in [2] to the $P_*(\kappa)$ linear complementarity problems based on a new kernel function which includes the kernel function in [2] as a special case. The kernel function is neither self-regular nor eligible. Furthermore, we improve the complexity result in [2] from $O(\sqrt[]{n}(\log\;n)^2\;\log\;\frac{n{\mu}o}{\epsilon})$ to $O\sqrt[]{n}(\log\;n)\log(\log\;n)\log\;\frac{m{\mu}o}{\epsilon}$.

SOME RADIUS RESULTS OF ANALYTIC FUNCTIONS ASSOCIATED WITH THE SRIVASTAVA-ATTIYA OPERATOR

  • Kim, Yong Chan;Choi, Jae Ho
    • Nonlinear Functional Analysis and Applications
    • /
    • v.26 no.2
    • /
    • pp.323-329
    • /
    • 2021
  • The main object of the present paper is to investigate some radius results of the functions f(z) = z + Σn=2 anzn(|z| < 1) with |an| ≤ n for all n ∈ ℕ. Some applications for certain operator defined through convolution are also considered.

UNIQUENESS THEOREMS OF MEROMORPHIC FUNCTIONS OF A CERTAIN FORM

  • Xu, Junfeng;Han, Qi;Zhang, Jilong
    • Bulletin of the Korean Mathematical Society
    • /
    • v.46 no.6
    • /
    • pp.1079-1089
    • /
    • 2009
  • In this paper, we shall show that for any entire function f, the function of the form $f^m(f^n$ - 1)f' has no non-zero finite Picard value for all positive integers m, n ${\in}\;{\mathbb{N}}$ possibly except for the special case m = n = 1. Furthermore, we shall also show that for any two nonconstant meromorphic functions f and g, if $f^m(f^n$-1)f' and $g^m(g^n$-1)g' share the value 1 weakly, then f $\equiv$ g provided that m and n satisfy some conditions. In particular, if f and g are entire, then the restrictions on m and n could be greatly reduced.

CHARACTERIZATIONS OF THE POWER FUNCTION DISTRIBUTION BY THE INDEPENDENCE OF RECORD VALUES

  • Chang, Se-Kyung
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.20 no.2
    • /
    • pp.139-146
    • /
    • 2007
  • In this paper, we present characterizations of the power function distribution by the independence of record values. We establish that $X{\in}$ POW(1, ${\nu}$) for ${\nu}$ > 0, if and only if $\frac{X_{L(n)}}{X_{L(n)}-X_{L(n+1)}}$ and $X_{L(n)}$ are independent for $n{\geq}1$. And we prove that $X{\in}$ POW(1, ${\nu}$) for ${\nu}$ > 0; if and only if $\frac{X_{L(n+1)}}{X_{L(n)}-X_{L(n+1)}}$ and $X_{L(n)}$ are independent for $n{\geq}1$. Also we characterize that $X{\in}$ POW(1, ${\nu}$) for ${\nu}$ > 0, if and only if $\frac{X_{L(n)}+X_{L(n+1)}}{X_{L(n)}-X_{L(n+1)}}$ and $X_{L(n)}$ are independent for $n{\geq}1$.

  • PDF

Texture Mapping using Multiperiodic Function on the Smooth Genus N Object (Multiperiodic 함수를 이용한 Smooth Genus N 객체의 텍스쳐매핑)

  • Hwa Jin Park
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.1
    • /
    • pp.94-104
    • /
    • 2002
  • This paper presents a new way of texture mapping on the Genus N object constructed over a single domain. The problem of 2D texture mapping is the discontinuity of texture domain at the virtual boundary on the object. Such phenomenon decreases smoothness of the object as well as looks unnatural. Especially it is necessary for the Genus N object of infinite coninuity to apply the seamless texture mapping. For seamless texture mapping, a multiperiodic function, which transforms a discontinuous function into a continuous function, is suggested. In some applications, however, the visual seams on the textured object provide more realistic appearance. Therefore, this research supports the interactive control from the discontinuity and the continuity across the boundary using the coefficient of the weight function.

  • PDF

Realization of n-th Order Voltage Transfer Function Using a Single Operational Transresistance Amplifier

  • Kilinc, Selcuk;Cam, Ugur
    • ETRI Journal
    • /
    • v.27 no.5
    • /
    • pp.647-650
    • /
    • 2005
  • A new configuration to realize the most general n-th order voltage transfer function is proposed. It employs only one operational transresistance amplifier (OTRA) as the active element. In the synthesis of the transfer function, the RC:-RC decomposition technique is used. To the best of author's knowledge, this is the first topology to be used in the realization of n-th order transfer function employing single OTRA.

  • PDF