A discrete distribution including the Poisson

Abstract

This article presents a new generalization of the Poisson distribution, with the parameters α > 0 and θ > 0, using the Marshall and Olkin (1997 Marshall, A.W., Olkin, I. (1997). A new method for adding a parameter to a family of distributions with application to the exponential and Weibull families. Biometrika 84(3):641–652.[Crossref], [Web of Science ®] , [Google Scholar]) scheme and adding a parameter to the classical Poisson distribution. The particular case of α = 1 gives the Poisson distribution. The new distribution is unimodal and has a failure rate that monotonically increases or decreases depending on the value of the parameter α. After reviewing some of the properties of this distribution, we investigated the question of parameter estimation. Expected frequencies were calculated for two data sets, one with an index of dispersion larger than one and the other with an index of dispersion smaller than one. In both cases the distribution provided a very satisfactory fit.     

On limiting behavior for arrays of rowwise negatively orthant dependent random variables

In this paper, the authors study limiting behavior for arrays of rowwise negatively orthant dependent random variables and obtain some new results which extend and improve the corresponding theorems by Hu, Móricz, and Taylor (1989), Taylor, Patterson, and Bozorgnia (2002) and Wu and Zhu (2010).     

Optimal sampling for spatial prediction of functional data

This paper combines optimal spatial sampling designs with geostatistical analysis of functional data. We propose a methodology and design criteria to find the set of spatial locations that minimizes the variance of the spatial functional prediction at unsampled sites for three functional predictors: ordinary kriging, simple kriging and simple cokriging. The last one is a modification of an existing predictor that uses ordinary cokriging based on the basis coefficients. Instead, we propose to use a simple cokriging predictor with the scores resulting from a representation of the functional data with the empirical functional principal components, allowing to remove restrictions and complexity of the covariance models and constraints on the estimation procedure. The methodology is applied to a network of air quality in Bogotá city, Colombia.     

Robust Model Selection for Stochastic Processes

We address the problem of robust model selection for finite memory stochastic processes. Consider m independent samples, with most of them being realizations of the same stochastic process with law Q, which is the one we want to retrieve. We define the asymptotic breakdown point γ for a model selection procedure and also we devise a model selection procedure. We compute the value of γ which is 0.5, when all the processes are Markovian. This result is valid for any family of finite order Markov models but for simplicity we will focus on the family of variable length Markov chains.     

Tight bounds for NF-based bounded-space online bin packing algorithms

In Zheng et al. (J Comb Optim 30(2):360–369, 2015) modelled a surgery problem by the one-dimensional bin packing, and developed a semi-online algorithm to give an efficient feasible solution. In their algorithm they used a buffer to temporarily store items, having a possibility to lookahead in the list. Because of the considered practical problem they investigated the 2-parametric case, when the size of the items is at most 1 / 2. Using an NF-based online algorithm the authors proved an ACR of \(13/9 = 1.44\ldots \) for any given buffer size not less than 1. They also gave a lower bound of \(4/3=1.33\ldots \) for the bounded-space algorithms that use NF-based rules. Later, in Zhang et al. (J Comb Optim 33(2):530–542, 2017) an algorithm was given with an ACR of 1.4243,  and the authors improved the lower bound to 1.4230. In this paper we present a tight lower bound of \(h_\infty (r)\) for the r-parametric problem when the buffer capacity is 3. Since \(h_\infty (2) = 1.42312\ldots \), our result—as a special case—gives a tight bound for the algorithm-class given in 2017. To prove that the lower bound is tight, we present an NF-based online algorithm that considers the r-parametric problem, and uses a buffer with capacity of 3. We prove that this algorithm has an ACR that is equal to the lower bounds for arbitrary r.     

New MNE subsidiaries in old clusters: when,why, and how

Despite the rise of globalization, industrial clusters remain vibrant spaces for the generation of knowledge and innovation. Aware of this reality, multinational enterprises (MNEs) seek to reconcile the advantages of international operations with the specific endowments of individual territories. By studying the case of the Inditex subsidiary in the Vinalopó footwear cluster, this research shows how the creation and activity of a specialized subsidiary and the evolution of the industrial system interweave. The study shows that, rather than agglomeration per se, access to specific resources guides location as the cluster matures. Furthermore, local embeddedness shapes post-entry dynamics at the micro and meso levels. Autonomous decisions boost the subsidiary’s access to local networks and the exploitation of cluster advantages, aiding the resilience of the cluster by contributing extra-cluster knowledge.     

10 ways to reduce medical malpractice exposure

Communicating with patients, keeping accurate records and actually taking time to examine patients are three of the top 10 ways to avoid a lawsuit. Find out more in this article by a doctor who's reviewed over 200 malpractice cases.     

Flexible Servers in Understaffed Tandem Lines

We study the dynamic assignment of cross‐trained servers to stations in understaffed lines with finite buffers. Our objective is to maximize the production rate. We identify optimal server assignment policies for systems with three stations, two servers, different flexibility structures, and either deterministic service times and arbitrary buffers or exponential service times and small buffers. We use these policies to develop server assignment heuristics for Markovian systems with larger buffer sizes that appear to yield near‐optimal throughput. In the deterministic setting, we prove that the best possible production rate with full server flexibility and infinite buffers can be attained with partial flexibility and zero buffers, and we identify the critical skills required to achieve this goal. We then present numerical results showing that these critical skills, employed with an effective server assignment policy, also yield near‐optimal throughput in the Markovian setting, even for small buffer sizes. Thus, our results suggest that partial flexibility is sufficient for near‐optimal performance, and that flexibility structures that are effective for deterministic and infinite‐buffered systems are also likely to perform well for finite‐buffered stochastic systems.