• Communications for Statistical Applications and Methods
• /
• v.31 no.1
• /
• pp.55-64
• /
• 2024

In this study, we consider the sample size determination problem for clustered count data with many zeros. In general, zero-inflated Poisson and binomial models are commonly used for zero-inflated data; however, in real data the assumptions that should be satisfied when using each model might be violated. We calculate the required sample size based on a discrete Weibull regression model that can handle both underdispersed and overdispersed data types. We use the Monte Carlo simulation to compute the required sample size. With our proposed method, a unified model with a low failure risk can be used to cope with the dispersed data type and handle data with many zeros, which appear in groups or clusters sharing a common variation source. A simulation study shows that our proposed method provides accurate results, revealing that the sample size is affected by the distribution skewness, covariance structure of covariates, and amount of zeros. We apply our method to the pancreas disorder length of the stay data collected from Western Australia.

• Journal of the Korean Mathematical Society
• /
• v.54 no.6
• /
• pp.1905-1926
• /
• 2017

In this paper we introduce a new iterative method by the combination of the prox-Tikhonov regularization and the alternating resolvents for finding a common zero of two accretive operators in Banach spaces. And we will give some applications and numerical examples. The results of this paper improve and extend the corresponding results announced by many others.

• Bulletin of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.273-285
• /
• 1997

The aim of this paper is to present theorems on the exitence of zeros for mappings defined on convex subsets of topological vector spaces with values in a vector space. In addition to natural assumptions of continuity, convexity, and compactness, the mappings are subject to some geometric conditions. In the first theorem, the mapping satisfies a "Darboux-type" property expressed in terms of an auxiliary numerical function. Typically, this functions is, in this case, related to an order structure on the target space. We derive an existence theorem for "obtuse" quasiconvex mappings with values in an ordered vector space. In the second theorem, we prove the existence of a "common zero" for an arbitrary (not necessarily countable) family of mappings satisfying a general "inwardness" condition againg expressed in terms of numerical functions (these numerical functions could be duality pairings (more generally, bilinear forms)). Our inwardness condition encompasses classical inwardness conditions of Leray-Schauder, Altman, or Bergman-Halpern types.

• Kyungpook Mathematical Journal
• /
• v.53 no.4
• /
• pp.541-552
• /
• 2013

This research is a continuation of a recent paper due to the first author in [9]. Different from previous results, we investigate the value distribution of difference polynomials of moromorphic functions in this paper. In particular, we are interested in the existence of zeros of $f(z)^n({\lambda}f(z+c)^m+{\mu}f(z)^m)-a$, where f is a moromorphic function, n, m are two non-negative integers, and ${\lambda}$, ${\mu}$ are non-zero complex numbers. However, the proof here is obviously different to the one in [9]. We also study difference polynomials of entire functions sharing a common value, which improves the result in [10, 13].

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.3
• /
• pp.451-474
• /
• 2021

In this paper, we investigate a hybrid algorithm for finding zeros of the sum of maximal monotone operators and Lipschitz continuous monotone operators which is also a common fixed point problem for finite family of relatively quasi-nonexpansive mappings and split feasibility problem in uniformly convex real Banach spaces which are also uniformly smooth. The iterative algorithm employed in this paper is design in such a way that it does not require prior knowledge of operator norm. We prove a strong convergence result for approximating the solutions of the aforementioned problems and give applications of our main result to minimization problem and convexly constrained linear inverse problem.

• East Asian mathematical journal
• /
• v.27 no.1
• /
• pp.1-9
• /
• 2011

In this paper, we consider an iterative scheme for finding a common element of the set of fixed points of a asymptotically quasi nonexpansive mapping and the set of solutions of the variational inequality for an inverse strongly monotone mapping in a Hilbert space. Then we show that the sequence converges strongly to a common element of two sets. Using this result, we consider the problem of finding a common fixed point of a asymptotically quasi-nonexpansive mapping and strictly pseudocontractive mapping and the problem of finding a common element of the set of fixed points of a asymptotically quasi-nonexpansive mapping and the set of zeros of an inverse-strongly monotone mapping.

• East Asian mathematical journal
• /
• v.26 no.5
• /
• pp.627-639
• /
• 2010

In this paper, we introduce a new iterative sequence finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality for an inverse-strongly-monotone mapping in a Banach space. Then we show that the sequence converges strongly to a common element of two sets. Using this result, we consider the problem of finding a common element of the set of fixed points of a nonexpansive mapping and the set of zeros of an inverse-strongly-monotone mapping, the fixed point problem and the classical variational inequality problem. Our results improve and extend the corresponding results announced by many others.

• Journal of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.525-552
• /
• 2021

In this paper, we introduce two general iterative algorithms (one implicit algorithm and one explicit algorithm) for finding a common element of the solution set of the variational inequality problems for a continuous monotone mapping, the zero point set of a set-valued maximal monotone operator, and the fixed point set of a continuous pseudocontractive mapping in a Hilbert space. Then we establish strong convergence of the proposed iterative algorithms to a common point of three sets, which is a solution of a certain variational inequality. Further, we find the minimum-norm element in common set of three sets.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1875-1877
• /
• 2002

There exist several forms of transfer function descriptions for multivariable LTI systems. We treat transfer function matrix with characteristic polynomial as its common denominator named Characteristic Transfer-function Matrices (CTM). First, we clarify necessary and sufficient conditions of CTM, then, we show some related lemmas. These interpretations not only offer deeper explanations but they also provide ways for calculations of all possible transfer matrices, system zeros, and inverse polynomial matrices.

• Communications for Statistical Applications and Methods
• /
• v.25 no.2
• /
• pp.173-184
• /
• 2018

In medical or public health research, it is common to encounter clustered or longitudinal count data that exhibit excess zeros. For example, health care utilization data often have a multi-modal distribution with excess zeroes as well as a multilevel structure where patients are nested within physicians and hospitals. To analyze this type of data, zero-inflated count models with mixed effects have been developed where a count response variable is assumed to be distributed as a mixture of a Poisson or negative binomial and a distribution with a point mass of zeros that include random effects. However, no study has considered a situation where data are also censored due to the finite nature of the observation period or follow-up. In this paper, we present a weighted version of zero-inflated Poisson model with random effects accounting for variable individual follow-up times. We suggested two different types of weight function. The performance of the proposed model is evaluated and compared to a standard zero-inflated mixed model through simulation studies. This approach is then applied to Medicaid data analysis.