• Title/Summary/Keyword: $\delta$-neighborhood

Search Result 13, Processing Time 0.026 seconds

T-NEIGHBORHOODS IN VARIOUS CLASSES OF ANALYTIC FUNCTIONS

  • Shams, Saeid;Ebadian, Ali;Sayadiazar, Mahta;Sokol, Janusz
    • Bulletin of the Korean Mathematical Society
    • /
    • v.51 no.3
    • /
    • pp.659-666
    • /
    • 2014
  • Let $\mathcal{A}$ be the class of analytic functions f in the open unit disk $\mathbb{U}$={z : ${\mid}z{\mid}$ < 1} with the normalization conditions $f(0)=f^{\prime}(0)-1=0$. If $f(z)=z+\sum_{n=2}^{\infty}a_nz^n$ and ${\delta}$ > 0 are given, then the $T_{\delta}$-neighborhood of the function f is defined as $$TN_{\delta}(f)\{g(z)=z+\sum_{n=2}^{\infty}b_nz^n{\in}\mathcal{A}:\sum_{n=2}^{\infty}T_n{\mid}a_n-b_n{\mid}{\leq}{\delta}\}$$, where $T=\{T_n\}_{n=2}^{\infty}$ is a sequence of positive numbers. In the present paper we investigate some problems concerning $T_{\delta}$-neighborhoods of function in various classes of analytic functions with $T=\{2^{-n}/n^2\}_{n=2}^{\infty}$. We also find bounds for $^{\delta}^*_T(A,B)$ defined by $$^{\delta}^*_T(A,B)=jnf\{{\delta}&gt;0:B{\subset}TN_{\delta}(f)\;for\;all\;f{\in}A\}$$ where A, B are given subsets of $\mathcal{A}$.

INCLUSION AND NEIGHBORHOOD PROPERTIES OF CERTAIN SUBCLASSES OF p-VALENT ANALYTIC FUNCTIONS OF COMPLEX ORDER INVOLVING A LINEAR OPERATOR

  • Sahoo, Ashok Kumar;Patel, Jagannath
    • Bulletin of the Korean Mathematical Society
    • /
    • v.51 no.6
    • /
    • pp.1625-1647
    • /
    • 2014
  • By making use of the familiar concept of neighborhoods of analytic functions, we prove several inclusion relationships associated with the (n, ${\delta}$)-neighborhoods of certain subclasses of p-valent analytic functions of complex order with missing coefficients, which are introduced here by means of the Saitoh operator. Special cases of some of the results obtained here are shown to yield known results.

Neighborhood Properties for Certain Subclasses of Analytic Functions of Complex Order with Negative Coefficients

  • Bulut, Serap
    • Kyungpook Mathematical Journal
    • /
    • v.54 no.2
    • /
    • pp.211-220
    • /
    • 2014
  • In the present investigation, by making use of the familiar concept of neighborhoods of analytic and multivalent functions, we prove several inclusion relations associated with the (n, ${\delta}$)-neighborhoods of certain subclasses of analytic functions of complex order, which are introduced here by means of the Al-Oboudi derivative. Several special cases of the main results are mentioned.

NEIGHBORHOODS OF CERTAIN SUBCLASSES OF ANALYTIC FUNCTIONS WITH NEGATIVE COEFFICIENTS

  • Darwish, Hanan E.;Aouf, Mohamed K.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.4
    • /
    • pp.689-695
    • /
    • 2011
  • The main object of this paper is to prove several inclusion relations associated with (j, ${\delta}$)-neighborhoods of various subclasses defined by Salagean operator by making use of the familiar concept of neighborhoods of analytic functions. Special cases of some of these inclusion relations are shown to yield known results.

A Fast CU Size Decision Optimal Algorithm Based on Neighborhood Prediction for HEVC

  • Wang, Jianhua;Wang, Haozhan;Xu, Fujian;Liu, Jun;Cheng, Lianglun
    • Journal of Information Processing Systems
    • /
    • v.16 no.4
    • /
    • pp.959-974
    • /
    • 2020
  • High efficiency video coding (HEVC) employs quadtree coding tree unit (CTU) structure to improve its coding efficiency, but at the same time, it also requires a very high computational complexity due to its exhaustive search processes for an optimal coding unit (CU) partition. With the aim of solving the problem, a fast CU size decision optimal algorithm based on neighborhood prediction is presented for HEVC in this paper. The contribution of this paper lies in the fact that we successfully use the partition information of neighborhood CUs in different depth to quickly determine the optimal partition mode for the current CU by neighborhood prediction technology, which can save much computational complexity for HEVC with negligible RD-rate (rate-distortion rate) performance loss. Specifically, in our scheme, we use the partition information of left, up, and left-up CUs to quickly predict the optimal partition mode for the current CU by neighborhood prediction technology, as a result, our proposed algorithm can effectively solve the problem above by reducing many unnecessary prediction and partition operations for HEVC. The simulation results show that our proposed fast CU size decision algorithm based on neighborhood prediction in this paper can reduce about 19.0% coding time, and only increase 0.102% BD-rate (Bjontegaard delta rate) compared with the standard reference software of HM16.1, thus improving the coding performance of HEVC.

Calibrations of Ultraviolet Excess as Metallicity Indicator of F,G,K Stars

  • Ann, Hong-Bae
    • Publications of The Korean Astronomical Society
    • /
    • v.1 no.1
    • /
    • pp.39-54
    • /
    • 1984
  • For F,G,K stars, their photometric data and metallicity, [Fe/H] are collected and their correlations between $\delta$(U-B) and [Fe/H] for each spectral group are examined, using a reference sequence which is defined by the stars in Woolley's catalogue and other reference sequences. Detailed examination shows that the reference sequence by Woolley's catalogue appears to be properly defined for the calculation of $\delta$(U-B) of population I stars in the solar neighborhood. It is suggested that accuracies of metallicities derived from $\delta$(U-B) can be improved if we derive the correlations between [Fe/H] and $\delta$(U-B) from the stars in each spectral group.

  • PDF

On Efficient Estimation of the Extreme Value Index with Good Finite-Sample Performance

  • Yun, Seokhoon
    • Journal of the Korean Statistical Society
    • /
    • v.28 no.1
    • /
    • pp.57-72
    • /
    • 1999
  • Falk(1994) showed that the asymptotic efficiency of the Pickands estimator of the extreme value index $\beta$ can considerably be improved by a simple convex combination. In this paper we propose an alternative estimator of $\beta$ which is as asymptotically efficient as the optimal convex combination of the Pickands estimators but has a better finite-sample performance. We prove consistency and asymptotic normality of the proposed estimator. Monte Carlo simulations are conducted to compare the finite-sample performances of the proposed estimator and the optimal convex combination estimator.

  • PDF

THE EVOLUTION OF THE SOLAR NEIGHBORHOOD I: CORRELATIONS OF AGE WITH METALLICITY AND KINEMATIC PARAMETERS

  • Lee, See-Woo
    • Journal of The Korean Astronomical Society
    • /
    • v.15 no.1
    • /
    • pp.19-36
    • /
    • 1982
  • For ${\sim}240$ nearby stars their age and mass were determined and kinematic parameters determined for 362 stars, applying Woolley's three-dimensional potential. Metallicity and kinematic parameters of these stars were correlated with their age, suggesting the slow collapse ($t{\gtrsim}a$ few billion years) of the Galaxy and the initial rapid enrichment in metal abundance (${\Delta}Z{\approx}1/3Z_1$(present) for ${\sim}4{\times}10^8$ yrs). The late slow enrichment rate is given by $d(Z/Z_{\odot})/dt=5.9{\sim}7.0{\pm}3.4$ per Gyr.

  • PDF

A Motion Adaptive Multi-Frame Interpolation Algorithm (움직임 적응형 멀티프레임 보간 알고리즘)

  • 김희철;채종석;최철호;권병헌;최명렬
    • Proceedings of the IEEK Conference
    • /
    • 2000.06d
    • /
    • pp.54-57
    • /
    • 2000
  • In this paper, we propose a new interpolation method by using the motion between two moving image frames. In the proposed method, the movement is detected by using neighborhood pixels of target pixel in the past frame and the present frame. Then, H-shaped pseudomedian filter (below HPMED) is used for the still part of the image and Delta-shaped interpolation filter (below $\Delta$-shaped) for used in the moving part of the image. We detect the movement by comparing the differences between pixels in 4${\times}$5 window of the past frame and the present frame; the difference has a critical value. We simultaneously accomplish checking PSNR(peak signal noise ratio) and subjective assessment that is placed the focus on edge characteristic for assessment of result in computer simulation. The results show that the proposed adaptive method is better than the conventional methods.

  • PDF

NEIGHBORHOOD CONDITION AND FRACTIONAL f-FACTORS IN GRAPHS

  • Liu, Hongxia;Liu, Guizhen
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.5_6
    • /
    • pp.1157-1163
    • /
    • 2009
  • Let G be a graph with vertex set V(G) and let f be a nonnegative integer-valued function defined on V(G). A spanning subgraph F of G is called a fractional f-factor if $d^h_G$(x)=f(x) for all x $\in$ for all x $\in$ V (G), where $d^h_G$ (x) = ${\Sigma}_{e{\in}E_x}$ h(e) is the fractional degree of x $\in$ V(F) with $E_x$ = {e : e = xy $\in$ E|G|}. In this paper it is proved that if ${\delta}(G){\geq}{\frac{b^2(k-1)}{a}},\;n>\frac{(a+b)(k(a+b)-2)}{a}$ and $|N_G(x_1){\cup}N_G(x_2){\cup}{\cdots}{\cup}N_G(x_k)|{\geq}\frac{bn}{a+b}$ for any independent subset ${x_1,x_2,...,x_k}$ of V(G), then G has a fractional f-factor. Where k $\geq$ 2 be a positive integer not larger than the independence number of G, a and b are integers such that 1 $\leq$ a $\leq$ f(x) $\leq$ b for every x $\in$ V(G). Furthermore, we show that the result is best possible in some sense.

  • PDF