• Title/Summary/Keyword: ${\gamma}$-set

Search Result 291, Processing Time 0.027 seconds

NOTE ON CONVERGENCE OF EULER'S GAMMA FUNCTION

  • Choi, Junesang
    • Honam Mathematical Journal
    • /
    • v.35 no.1
    • /
    • pp.101-107
    • /
    • 2013
  • The Gamma function ${\Gamma}$ which was first introduced b Euler in 1730 has played a very important role in many branches of mathematics, especially, in the theory of special functions, and has been introduced in most of calculus textbooks. In this note, our major aim is to explain the convergence of the Euler's Gamma function expressed as an improper integral by using some elementary properties and a fundamental axiom holding on the set of real numbers $\mathbb{R}$, in a detailed and instructive manner. A brief history and origin of the Gamma function is also considered.

Performance Analysis of Retinex-based Image Enhancement According to Color Domain and Gamma Correction Adaptation (Color Domain 및 Gamma Correction 적용에 따른 Retinex 기반 영상개선 알고리즘의 효과 분석)

  • Kim, Donghyung
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.15 no.1
    • /
    • pp.99-107
    • /
    • 2019
  • Retinex-based image enhancement is a technique that utilizes the property that the human visual characteristics are sensitive to the difference from the surrounding pixel value rather than the pixel value itself. These Retinex-based algorithms show different characteristics of the improved image depending on the applied color space or gamma correction. In this paper, we set eight different experimental conditions according to the application of color space and gamma correction, and analyze the objective and subjective performance of each Retinex based image enhancement algorithm and apply it to the implementation of Retinex based algorithm. In the case of gamma correction, quantitative low entropy images and low contrast images are obtained. The application of Retinex technique in HSI color space rather than RGB color space is found to be high in overall subjective image quality as well as maintaining color.

Pulsar Polar Cap and Slot Gap Models: Confronting Fermi Data

  • Harding, Alice K.
    • Journal of Astronomy and Space Sciences
    • /
    • v.30 no.3
    • /
    • pp.145-152
    • /
    • 2013
  • Rotation-powered pulsars are excellent laboratories for studying particle acceleration as well as fundamental physics of strong gravity, strong magnetic fields and relativity. Particle acceleration and high-energy emission from the polar caps is expected to occur in connection with electron-positron pair cascades. I will review acceleration and gamma-ray emission from the pulsar polar cap and associated slot gap. Predictions of these models can be tested with the data set on pulsars collected by the Large Area Telescope on the Fermi Gamma-Ray Telescope over the last four years, using both detailed light curve fitting, population synthesis and phase-resolved spectroscopy.

HEXAVALENT NORMAL EDGE-TRANSITIVE CAYLEY GRAPHS OF ORDER A PRODUCT OF THREE PRIMES

  • GHORBANI, MODJTABA;SONGHORI, MAHIN
    • Journal of applied mathematics & informatics
    • /
    • v.35 no.1_2
    • /
    • pp.83-93
    • /
    • 2017
  • The Cayley graph ${\Gamma}=Cay(G,S)$ is called normal edge-transitive if $N_A(R(G))$ acts transitively on the set of edges of ${\Gamma}$, where $A=Aut({\Gamma})$ and R(G) is the regular subgroup of A. In this paper, we determine all hexavalent normal edge-transitive Cayley graphs on groups of order pqr, where p > q > r > 2 are prime numbers.

A crofton style formula and its application on the unit sphere $ *$

  • Y. D. Chai;Lee, Young-Soo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.33 no.4
    • /
    • pp.537-544
    • /
    • 1996
  • Crofton's formula on Euclidean plane $E^2$ states: Let $\Gamma$ be a rectifiable curve of length L and let G be a straight line. Then $$ \int_{G \cap \Gamma \neq \phi} n dG = 2L $$ where n is the number of the intersection points of G with the curve $\Gamma$.

  • PDF

ON t-ALMOST DEDEKIND GRADED DOMAINS

  • Chang, Gyu Whan;Oh, Dong Yeol
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.6
    • /
    • pp.1969-1980
    • /
    • 2017
  • Let ${\Gamma}$ be a nonzero torsionless commutative cancellative monoid with quotient group ${\langle}{\Gamma}{\rangle}$, $R={\bigoplus}_{{\alpha}{\in}{\Gamma}}R_{\alpha}$ be a graded integral domain graded by ${\Gamma}$ such that $R_{{\alpha}}{\neq}\{0\}$ for all ${\alpha}{\in}{\Gamma},H$ be the set of nonzero homogeneous elements of R, C(f) be the ideal of R generated by the homogeneous components of $f{\in}R$, and $N(H)=\{f{\in}R{\mid}C(f)_v=R\}$. In this paper, we introduce the notion of graded t-almost Dedekind domains. We then show that R is a t-almost Dedekind domain if and only if R is a graded t-almost Dedekind domain and RH is a t-almost Dedekind domains. We also show that if $R=D[{\Gamma}]$ is the monoid domain of ${\Gamma}$ over an integral domain D, then R is a graded t-almost Dedekind domain if and only if D and ${\Gamma}$ are t-almost Dedekind, if and only if $R_{N(H)}$ is an almost Dedekind domain. In particular, if ${\langle}{\Gamma}{\rangle}$ isatisfies the ascending chain condition on its cyclic subgroups, then $R=D[{\Gamma}]$ is a t-almost Dedekind domain if and only if R is a graded t-almost Dedekind domain.

THE BONDAGE NUMBER OF C3×Cn

  • Sohn, Moo-Young;Xudong, Yuan;Jeong, Hyeon-Seok
    • Journal of the Korean Mathematical Society
    • /
    • v.44 no.6
    • /
    • pp.1213-1231
    • /
    • 2007
  • The domination number ${\gamma}(G)$ of a graph G=(V,E) is the minimum cardinality of a subset of V such that every vertex is either in the set or is adjacent to some vertex in the set. The bondage number of b(G) of a graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than ${\gamma}(G)$. In this paper, we calculate the bondage number of the Cartesian product of cycles $C_3\;and\;C_n$ for all n.

Some Cycle and Star Related Nordhaus-Gaddum Type Relations on Strong Efficient Dominating Sets

  • Murugan, Karthikeyan
    • Kyungpook Mathematical Journal
    • /
    • v.59 no.3
    • /
    • pp.363-375
    • /
    • 2019
  • Let G = (V, E) be a simple graph with p vertices and q edges. A subset S of V (G) is called a strong (weak) efficient dominating set of G if for every $v{\in}V(G)$ we have ${\mid}N_s[v]{\cap}S{\mid}=1$ (resp. ${\mid}N_w[v]{\cap}S{\mid}=1$), where $N_s(v)=\{u{\in}V(G):uv{\in}E(G),\;deg(u){\geq}deg(v)\}$. The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient domination number of G and is denoted by ${\gamma}_{se}(G)$ (${\gamma}_{we}(G)$). A graph G is strong efficient if there exists a strong efficient dominating set of G. In this paper, some cycle and star related Nordhaus-Gaddum type relations on strong efficient dominating sets and the number of strong efficient dominating sets are studied.

NHPP Software Reliability Model based on Generalized Gamma Distribution (일반화 감마 분포를 이용한 NHPP 소프트웨어 신뢰도 모형에 관한 연구)

  • Kim, Hee-Cheul
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.6 s.38
    • /
    • pp.27-36
    • /
    • 2005
  • Finite failure NHPP models presented in the literature exhibit either constant, monotonic increasing or monotonic decreasing failure occurrence rates Per fault. This Paper Proposes reliability model using the generalized gamma distribution, which can capture the monotonic increasing(or monotonic decreasing) nature of the failure occurrence rate per fault. Equations to estimate the parameters of the generalized gamma finite failure NHPP model based on failure data collected in the form of interfailure times are developed. For the sake of proposing shape parameter of the generalized gamma distribution, used to the special pattern. Data set, where the underlying failure process could not be adequately described by the knowing models, which motivated the development of the gamma or Weibull model. Analysis of failure data set for the generalized gamma modell, using arithmetic and Laplace trend tests . goodness-of-fit test, bias tests is presented.

  • PDF

A REFINEMENT OF THE UNIT AND UNITARY CAYLEY GRAPHS OF A FINITE RING

  • Naghipour, Ali Reza;Rezagholibeigi, Meysam
    • Bulletin of the Korean Mathematical Society
    • /
    • v.53 no.4
    • /
    • pp.1197-1211
    • /
    • 2016
  • Let R be a finite commutative ring with nonzero identity. We define ${\Gamma}(R)$ to be the graph with vertex set R in which two distinct vertices x and y are adjacent if and only if there exists a unit element u of R such that x + uy is a unit of R. This graph provides a refinement of the unit and unitary Cayley graphs. In this paper, basic properties of ${\Gamma}(R)$ are obtained and the vertex connectivity and the edge connectivity of ${\Gamma}(R)$ are given. Finally, by a constructive way, we determine when the graph ${\Gamma}(R)$ is Hamiltonian. As a consequence, we show that ${\Gamma}(R)$ has a perfect matching if and only if ${\mid}R{\mid}$ is an even number.