• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.881-888
• /
• 2001

Recently, Hooda and Ram [7] have proposed and characterized a new generalized measure of R-norm entropy. In the present communication we have studied its application in coding theory. Various mean codeword lengths and their bounds have been defined and a coding theorem on lower and upper bounds of a generalized mean codeword length in term of the generalized R-norm entropy has been proved.

• Journal of applied mathematics & informatics
• /
• v.41 no.1
• /
• pp.1-9
• /
• 2023

In the present paper, two theorems on absolute matrix summability of infinite series are generalized for the 𝜑 - |A, p_n|_k summability method using quasi 𝛽-power increasing sequences instead of almost increasing sequences.

• Kyungpook Mathematical Journal
• /
• v.64 no.1
• /
• pp.31-46
• /
• 2024

The aim of this paper is to present an approach to improve reverse Minkowski and Hölder-type inequalities using k-weighted fractional integral operators _a⁺𝔍^𝜇_w with respect to a strictly increasing continuous function 𝜇, by introducing two parameters of integrability, p and q. For various choices of 𝜇 we get interesting special cases.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.2
• /
• pp.3-8
• /
• 2007

In this paper a generalized parametric mean length $L(P^{\nu},\;R)$ has been defined and bounds for $L(P^{\nu},\;R)$ are obtained in terms of generalized R-norm information measure.

• The Pure and Applied Mathematics
• /
• v.30 no.1
• /
• pp.35-42
• /
• 2023

In this paper, we find a bound for all the zeros of a polynomial in terms of its coefficients similar to the bound given by Montel (1932) and Kuneyida (1916) as an improvement of Cauchy's classical theorem. In fact, we use a generalized version of Hölder's inequality for obtaining various interesting bounds for all the zeros of a polynomial as function of their coefficients.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.477-483
• /
• 2008

In this paper, by introducing parameter r>1, new weighted Ostrowski-Gruss-Cebysev type inequalities for 1/p+11/q=1-1/r are established.

• Journal of Information Science Theory and Practice
• /
• v.4 no.4
• /
• pp.64-74
• /
• 2016

In this paper we define a two parametric new generalized useful average code-word length $L_{\alpha}^{\beta}$(P;U) and its relationship with two parametric new generalized useful information measure $H_{\alpha}^{\beta}$(P;U) has been discussed. The lower and upper bound of $L_{\alpha}^{\beta}$(P;U), in terms of $H_{\alpha}^{\beta}$(P;U) are derived for a discrete noiseless channel. The measures defined in this communication are not only new but some well known measures are the particular cases of our proposed measures that already exist in the literature of useful information theory. The noiseless coding theorems for discrete channel proved in this paper are verified by considering Huffman and Shannon-Fano coding schemes on taking empirical data. Also we study the monotonic behavior of $H_{\alpha}^{\beta}$(P;U) with respect to parameters ${\alpha}$ and ${\beta}$. The important properties of $H_{{\alpha}}^{{\beta}}$(P;U) have also been studied.

• The Mathematical Education
• /
• v.21 no.3
• /
• pp.7-11
• /
• 1983

A measurable function f defined on a measurable subset A of the real line R is called pth power summable on A if │f│$^{p}$ is integrable on A and the set of all pth power summable functions on A is denoted by L$^{p}$ (A). For each member f in L$^{p}$ (A), we define ∥f∥$_{p}$ =(equation omitted) For real numbers p and q where (equation omitted) and (equation omitted), we discuss the Holder's inequality ∥fg∥$_1$<∥f∥$_{p}$ ∥g∥$_{q}$ , f$\in$L$^{p}$ (A), g$\in$L$^{q}$ (A) and the Minkowski inequality ∥＋g∥$_{p}$ <∥f∥$_{p}$ ＋∥g∥$_{p}$ , f,g$\in$L$^{p}$ (A). In this paper also discuss that L$_{p}$ (A) becomes a metric space with the metric $\rho$ : L$^{p}$ (A) $\times$L$^{p}$ (A) longrightarrow R where $\rho$(f,g)=∥f-g∥$_{p}$ , f,g$\in$L$^{p}$ (A). Then, in this paper prove the Riesz-Fischer theorem, i.e., the space L$^{p}$ (A) is complete and that the space L$^{p}$ (A) is separable.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1992.03a
• /
• pp.159-176
• /
• 1992

Limit analysis has been rendered versatile in many problems such as structural problems and metal forming problems. In metal forming analysis, a slip-line method and an upper bound method approach to limit solutions is considered as the most challenging areas. In the present work, a general algorithm for limit solutions of plastic flow is developed with the use of finite element limit analysis. The algorithm deals with a generalized Holder inequality, a duality theorem, and a combined smoothing and successive approximation in addition to a general procedure for finite element analysis. The algorithm is robust such that from any initial trial solution, the first iteration falls into a convex set which contains the exact solution(s) of the problem. The idea of the algorithm for limit solution is extended from rigid/perfectly-plastic materials to work-hardening materials by the nature of the limit formulation, which is also robust with numerically stable convergence and highly efficient computing time.