Matroid and Knapsack Center Problems

In the classic $k$-center problem, we are given a metric graph, and the objective is to open $k$ nodes as centers such that the maximum distance from any vertex to its closest center is minimized. In this paper, we consider two important generalizations of $k$-center, the matroid center problem and the knapsack center problem. Both problems are motivated by recent content distribution network applications. Our contributions can be summarized as follows: 1. We consider the matroid center problem in which the centers are required to form an independent set of a given matroid. We show this problem is NP-hard even on a line. We present a 3-approximation algorithm for the problem on general metrics. We also consider the outlier version of the problem where a given number of vertices can be excluded as the outliers from the solution. We present a 7-approximation for the outlier version. 2. We consider the (multi-)knapsack center problem in which the centers are required to satisfy one (or more) knapsack constraint(s). It is known that the knapsack center problem with a single knapsack constraint admits a 3-approximation. However, when there are at least two knapsack constraints, we show this problem is not approximable at all. To complement the hardness result, we present a polynomial time algorithm that gives a 3-approximate solution such that one knapsack constraint is satisfied and the others may be violated by at most a factor of $1+\epsilon$. We also obtain a 3-approximation for the outlier version that may violate the knapsack constraint by $1+\epsilon$.Comment: A preliminary version of this paper is accepted to IPCO 201

Mode-coupling theory for multiple-time correlation functions of tagged particle densities and dynamical filters designed for glassy systems

The theoretical framework for higher-order correlation functions involving multiple times and multiple points in a classical, many-body system developed by Van Zon and Schofield [Phys. Rev. E 65, 011106 (2002)] is extended here to include tagged particle densities. Such densities have found an intriguing application as proposed measures of dynamical heterogeneities in structural glasses. The theoretical formalism is based upon projection operator techniques which are used to isolate the slow time evolution of dynamical variables by expanding the slowly-evolving component of arbitrary variables in an infinite basis composed of the products of slow variables of the system. The resulting formally exact mode-coupling expressions for multiple-point and multiple-time correlation functions are made tractable by applying the so-called N-ordering method. This theory is used to derive for moderate densities the leading mode coupling expressions for indicators of relaxation type and domain relaxation, which use dynamical filters that lead to multiple-time correlations of a tagged particle density. The mode coupling expressions for higher order correlation functions are also succesfully tested against simulations of a hard sphere fluid at relatively low density.Comment: 15 pages, 2 figure

THE NAS PARALLEL BENCHMARKS

The Numerical Aerodynamic Simulation (NAS) Program, which is based at NASA Ames Research Center, is a large-scale effort to advance the state of computational aerodynamics. Specifically, the NAS organization aims &dquo;to provide the Nation’s aerospace research and development community by the year 2000 a highperformance, operational computing system capable of simulating an entire aerospace vehicle system within a computing time of one to several hours&dquo; (NAS Systems Division, 1988, p. 3). The successful solution of this &dquo;grand challenge&dquo; problem will require the development of computer systems that can perform the required complex scientific computations at a sustained rate nearly 1,000 times greater than current generation supercomputers can achieve. The architecture of computer systems able to achieve this level of performance will likely be dissimilar to the shared memory multiprocessing supercomputers of today. While no consensus yet exists on what the design will be, it is likely that the system will consist of at least 1,000 processors computing in parallel. Highly parallel systems with computing power roughly equivalent to that of traditional shared memory multiprocessors exist today. Unfortunately, for various reasons, the performance evaluation of these systems on comparable types of scientific computations is very difficult. Relevant data for the performance of algorithms of interest to the computational aerophysics community on many currently available parallel systems are limited. Benchmarking and performance evaluation of such systems have not kept pace with advances in hardware, software, and algorithms. In particular, there is as yet no generally accepted benchmark program or even a benchmark strategy for these systems

Bitterness suppression with zinc sulfate and na-cyclamate: a model of combined peripheral and central neural approaches to flavor modification

Purpose Zinc sulfate is known to inhibit the bitterness of the antimalarial agent quinine [R. S. J. Keast. The effect of zinc on human taste perception. J. Food Sci. 68:1871&ndash;1877 (2003)]. In the present work, we investigated whether zinc sulfate would inhibit other bitter-tasting compounds and pharmaceuticals. The utility of zinc as a general bitterness inhibitor is compromised, however, by the fact that it is also a good sweetness inhibitor [R. S. J. Keast, T. Canty, and P. A. S. Breslin. Oral zinc sulfate solutions inhibit sweet taste perception. Chem. Senses 29:513&ndash;521 (2004)] and would interfere with the taste of complex formulations. Yet, zinc sulfate does not inhibit the sweetener Na-cyclamate. Thus, we determined whether a mixture of zinc sulfate and Na-cyclamate would be a particularly effective combination for bitterness inhibition (Zn) and masking (cyclamate). Method We used human taste psychophysical procedures with chemical solutions to assess bitterness blocking. Results Zinc sulfate significantly inhibited the bitterness of quinine&ndash;HCl, Tetralone, and denatonium benzoate (DB) (p &lt; 0.05), but had no significant effect on the bitterness of sucrose octa-acetate, pseudoephedrine (PSE), and dextromethorphan. A second experiment examined the influence of zinc sulfate on bittersweet mixtures. The bitter compounds were DB and PSE, and the sweeteners were sucrose (inhibited by 25 mM zinc sulfate) and Na-cyclamate (not inhibited by zinc sulfate). The combination of zinc sulfate and Na-cyclamate most effectively inhibited DB bitterness (86%) (p &lt; 0.0016), whereas the mixture\u27s inhibition of PSE bitterness was not different from that of Na-cyclamate alone. Conclusion A combination of Na-cyclamate and zinc sulfate was most effective at inhibiting bitterness. Thus, the combined use of peripheral oral and central cognitive bitterness reduction strategies should be particularly effective for improving the flavor profile of bitter-tasting foods and pharmaceutical formulations. <br /

Index insurance and climate risk management: addressing social equity

Motivation Fair distribution of benefits from index insurance matters. Lack of attention to social equity can reinforce inequalities and undermine the potential index insurance holds as a tool for climate risk management that is also pro-poor. Purpose The aims are to: (i) examine social equity concerns raised by index insurance in the context of climate risk management; (ii) consider how greater attention can be given to social equity in index insurance initiatives; and (iii) reflect on the policy challenges raised by seeking to take social equity into account as a mechanism for climate risk reduction. Approach and methods The article draws on learning from the CGIAR’s Research Program on Climate Change, Agriculture and Food Security (CCAFS) and presents the cases of the Index Based Livelihoods Insurance (IBLI) and Agriculture and Climate Risk Enterprise Ltd. (ACRE) in East Africa. It proposes a framework for unpacking social equity related to equitable access, procedures, representation and distribution within index insurance schemes Findings Systematically addressing social equity raises hard policy choices for index insurance initiatives without straightforward solutions. Attention to how benefits and burdens of index insurance are distributed raises the unpalateable truth for development policy that the poorest members of rural society can be excluded. Nevertheless, a focus on social equity may open up opportunities to ensure index insurance is linked to more socially just climate risk management. At the very least, it may prevent index insurance from generating greater inequality. Taking social equity into account thus, shifts the focus from agricultural systems in transition per se to systems with potential to incorporate societal transformation through distributive justice. Policy implications A framework is presented for unpacking different dimensions of social equity in index insurance schemes. It is intended to facilitate identification of opportunities for building outcomes that are more equitable, with greater potential for inclusion and fairer distribution

Renegotiation and Relative Performance Evaluation: Why an Informative Signal may be Useless

Although Holmström's informativeness criterion provides a theoretical foundation for the controllability principle and inter firm relative performance evaluation, empirical and field studies provide only weak evidence on such practices. This paper refines the traditional informativeness criterion by abandoning the conventional full-commitment assumption. With the possibility of renegotiation, a signal's usefulness in incentive contracting depends on its information quality, not simply on whether the signal is informative. This paper derives conditions for determining when a signal is useless and when it is useful. In particular, these conditions will be met when the signal's information quality is either sufficiently poor or sufficiently rich

Approximation algorithms for general cluster routing problem

Graph routing problems have been investigated extensively in operations research, computer science and engineering due to their ubiquity and vast applications. In this paper, we study constant approximation algorithms for some variations of the general cluster routing problem. In this problem, we are given an edge-weighted complete undirected graph $G=(V,E,c),$ whose vertex set is partitioned into clusters $C_{1},\dots ,C_{k}.$ We are also given a subset $V'$ of $V$ and a subset $E'$ of $E.$ The weight function $c$ satisfies the triangle inequality. The goal is to find a minimum cost walk $T$ that visits each vertex in $V'$ only once, traverses every edge in $E'$ at least once and for every $i\in [k]$ all vertices of $C_i$ are traversed consecutively.Comment: In COCOON 202

Spatial Dynamics Of Vertical And Horizontal Intergovernmental Collaboration

Although researchers have made progress in understanding motivations behind local government collaboration, there is little research that explores the spatial dynamics of such interactions. Does the idea of collaboration travel horizontally, passed from neighbor to neighbor, or is vertical leadership from state, county, or regional actors more important in influencing local governments’ decisions to share resources and functions? What factors influence local governments’ choices to collaborate with their neighbors versus a regional entity, county, or state government? In this article, we investigate the importance of vertical and horizontal influences when local governments decide to collaborate around land use planning. Using data from a survey of Michigan local government officials, we take a spatial statistical approach to answering this question. We find widespread evidence of collaboration at multiple scales, and observe patterns of both horizontal and vertical influence. We also find that contextual factors help to explain these patterns of collaboration.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/112248/1/juaf12139.pd

Varieties of developmental dyslexia in Greek children

The current study aimed to investigate in a group of nine Greek children with dyslexia (mean age 9.9 years) whether the surface and phonological dyslexia subtypes could be identified. A simple regression was conducted using printed word naming latencies and nonword reading accuracy for 33 typically developing readers. Ninety per cent confidence intervals were established and dyslexic children with datapoints lying outside the confidence intervals were identified. Using this regression-based method three children with the characteristic of phonological dyslexia (poor nonword reading), two with surface dyslexia (slow word naming latencies) and four with a mixed profile (poor nonword reading accuracy and slow word naming latencies) were identified. The children were also assessed in spelling to dictation, phonological ability, rapid naming, visual memory and multi-character processing (letter report). Results revealed that the phonological dyslexia subtype children had difficulties in tasks of phonological ability, and the surface subtype children had difficulties in tasks of multi-character simultaneous processing ability. Dyslexic children with a mixed profile showed deficits in both phonological abilities and multi-character processing. In addition, one child with a mixed profile showed a rapid naming deficit and another showed a difficulty in visual memory for abstract designs. Overall the results confirm that the surface and phonological subtypes of developmental dyslexia can be found in Greek-speaking children. They also indicate that different subtypes are associated with different underlying disorders