Computing economies of vertical integration,economies of scope and economies of scale using partial frontier nonparametric methods

So far, in the nonparametric literature only full frontier nonparametric methods have been applied to search for economies of scope and scale, particularly the data envelopment analysis method (DEA). However, these methods present some drawbacks that might lead to biased results. This paper proposes a methodology based on more robust partial frontier nonparametric methods to look for scope and scale economies. Through this methodology it is possible to assess the robustness of these economies, and in particular to assess the influence that extreme data or outliers might have on them. The influence of the imposition of convexity on the production set of firms was also investigated. This methodology was applied to the water utilities that operated in Portugal between 2002 and 2008. There is evidence of economies of vertical integration and economies of scale in drinking water supply utilities and in water and wastewater utilities operating mainly in the retail segment. Economies of scale were found in water and wastewater utilities operating exclusively in the wholesale, and in some of these utilities diseconomies of scope were also found. The proposed methodology also allowed us to conclude that the existence of some smaller utilities makes the minimum optimal scales go down.     

Birth of limit cycles bifurcating from a nonsmooth center

This paper is concerned with a codimension analysis of a two-fold singularity of piecewise smooth planar vector fields, when it behaves itself like a center of smooth vector fields (also called nondegenerate Σ-center). We prove that any nondegenerate Σ-center is Σ  -equivalent to a particular normal form _Z0$Z_0$. Given a positive integer number k   we explicitly construct families of piecewise smooth vector fields emerging from _Z0$Z_0$ that have k hyperbolic limit cycles bifurcating from the nondegenerate Σ  -center of _Z0$Z_0$ (the same holds for k=∞$k=\infty$). Moreover, we also exhibit families of piecewise smooth vector fields of codimension k   emerging from _Z0$Z_0$. As a consequence we prove that _Z0$Z_0$ has infinite codimension.     

Discretization orders for protein side chains

Proteins are important molecules that are widely studied in biology. Since their three-dimensional conformations can give clues about their function, an optimal methodology for the identification of such conformations has been researched for many years. Experiments of Nuclear Magnetic Resonance (NMR) are able to estimate distances between some pairs of atoms forming the protein, and the problem of identifying the possible conformations satisfying the available distance constraints is known in the scientific literature as the Molecular Distance Geometry Problem (MDGP). When some particular assumptions are satisfied, MDGP instances can be discretized, and solved by employing an ad-hoc algorithm, named the interval Branch & Prune. When dealing with molecules such as proteins, whose chemical structure is known, a priori information can be exploited for generating atomic orderings that allow for the discretization. In previous publications, we presented a handcrafted order for the protein backbones. In this work, we propose 20 new orders for the 20 side chains that can be present in proteins. Computational experiments on artificial and real instances from NMR show the usefulness of the proposed orders.     

Congruence properties of pseudocomplemented De Morgan algebras

In this paper we first describe the Priestley duality for pseudocomplemented De Morgan algebras by combining the known dualities of distributive p‐algebras due to Priestley and for De Morgan algebras due to Cornish and Fowler. We then use it to characterize congruence‐permutability, principal join property, and the property of having only principal congruences for pseudocomplemented De Morgan algebras. The congruence‐uniform pseudocomplemented De Morgan algebras are also described.     

Unsupervised learning of pharmacokinetic responses

Pharmacokinetics (PK) is a branch of pharmacology dedicated to the study of the time course of drug concentrations, from absorption to excretion from the body. PK dynamic models are often based on homogeneous, multi-compartment assumptions, which allow to identify the PK parameters and further predict the time evolution of drug concentration for a given subject. One key characteristic of these time series is their high variability among patients, which may hamper their correct stratification. In the present work, we address this variability by estimating the PK parameters and simultaneously clustering the corresponding subjects using the time series. We propose an expectation maximization algorithm that clusters subjects based on their PK drug responses, in an unsupervised way, collapsing clusters that are closer than a given threshold. Experimental results show that the proposed algorithm converges fast and leads to meaningful results in synthetic and real scenarios.     

A survey of dual-feasible and superadditive functions

Dual-feasible functions are valuable tools that can be used to compute both lower bounds for different combinatorial problems and valid inequalities for integer programs. Several families of functions have been used in the literature. Some of them were defined explicitly, and others not. One of the main objectives of this paper is to survey these functions, and to state results concerning their quality. We clearly identify dominant subsets of functions, i.e. those which may lead to better bounds or stronger cuts. We also describe different frameworks that can be used to create dual-feasible functions. With these frameworks, one can get a dominant function based on other ones. Two new families of dual-feasible functions obtained by applying these methods are proposed in this paper.     

Pruning theory and Thurston’s classification of surface homeomorphisms

Two dynamical deformation theories are presented – one for surface homeomorphisms, called pruning, and another for graph endomorphisms, called kneading– both giving conditions under which all of the dynamics in an open set can be destroyed, while leaving the dynamics unchanged elsewhere. The theories are related to each other and to Thurston’s classification of surface homeomorphisms up to isotopy. Received February 20, 2000 / final version received February 26, 2001?Published online May 29, 2001