Sensitive and Scalable Online Evaluation with Theoretical Guarantees

Multileaved comparison methods generalize interleaved comparison methods to provide a scalable approach for comparing ranking systems based on regular user interactions. Such methods enable the increasingly rapid research and development of search engines. However, existing multileaved comparison methods that provide reliable outcomes do so by degrading the user experience during evaluation. Conversely, current multileaved comparison methods that maintain the user experience cannot guarantee correctness. Our contribution is two-fold. First, we propose a theoretical framework for systematically comparing multileaved comparison methods using the notions of considerateness, which concerns maintaining the user experience, and fidelity, which concerns reliable correct outcomes. Second, we introduce a novel multileaved comparison method, Pairwise Preference Multileaving (PPM), that performs comparisons based on document-pair preferences, and prove that it is considerate and has fidelity. We show empirically that, compared to previous multileaved comparison methods, PPM is more sensitive to user preferences and scalable with the number of rankers being compared.Comment: CIKM 2017, Proceedings of the 2017 ACM on Conference on Information and Knowledge Managemen

Potential Demand for Programs on Nuisance Wildlife Among Wildlife-Related Program Offerings to Urban/Suburban Organizations

Program planners of 114 organizations in the Roanoke Valley area of Virginia responded to the likelihood of their scheduling programs on wildlife-related topics. Among the topics offered was “Controlling Wildlife Pests and/or Their Damage.” Responses were organized by type of organization (civic club, neighborhood organization, educational/PTA organization, environmental/hobby organization, garden/plant club) and whether they were “highly likely” (HL), “somewhat likely” (SL), “not likely” (NL), or “not sure” (NS) they would schedule such a program. Results on likelihood of scheduling were as follows: 31 civic clubs (1 HL, 4 SL, 33NL, 4 NS); 26 neighborhood organizations (5 HL, 7 SL, 5 NL, 9 NS); 26 educational/PTA organizations (3HL, 7 SL, 14 NL, 2 NS); 10 environmental organizations (1 HL, 2 SL, 7 NL, 0 NS); and 21 garden clubs (2 HL, 6 SL, 11 NL, 2 NS). Overall, 114 respondents provided 12 HL, 26 SL, 59 NL, and 17 NS responses. Among the 114 respondents, only 8 rated the topic among their “top 3” most desired topics. In the overall survey, wildlife-related topics were not more acceptable than environmental program topics and, within the wildlife program topics, a program on “Controlling Wildlife Pests and/or Their Damage” was not likely to be scheduled by more than half the programs chairs. As only one-third of respondents indicated any likelihood of scheduling a program on “Controlling Wildlife Pests and/or Their Damage,” a challenge in developing proactive programs on wildlife pest management for urban/suburban club audiences seems very clear

New results on pushdown module checking with imperfect information

Model checking of open pushdown systems (OPD) w.r.t. standard branching temporal logics (pushdown module checking or PMC) has been recently investigated in the literature, both in the context of environments with perfect and imperfect information about the system (in the last case, the environment has only a partial view of the system's control states and stack content). For standard CTL, PMC with imperfect information is known to be undecidable. If the stack content is assumed to be visible, then the problem is decidable and 2EXPTIME-complete (matching the complexity of PMC with perfect information against CTL). The decidability status of PMC with imperfect information against CTL restricted to the case where the depth of the stack content is visible is open. In this paper, we show that with this restriction, PMC with imperfect information against CTL remains undecidable. On the other hand, we individuate an interesting subclass of OPDS with visible stack content depth such that PMC with imperfect information against the existential fragment of CTL is decidable and in 2EXPTIME. Moreover, we show that the program complexity of PMC with imperfect information and visible stack content against CTL is 2EXPTIME-complete (hence, exponentially harder than the program complexity of PMC with perfect information, which is known to be EXPTIME-complete).Comment: In Proceedings GandALF 2011, arXiv:1106.081

Magnetic impurities coupled to quantum antiferromagnets in one dimension

Magnetic impurities coupled antiferromagnetically to a one-dimensional Heisenberg model are studied by numerical diagonalization of chains of finite clusters. By calculating the binding energy and the correlation function, it is shown that a local singlet develops around each impurity. This holds true for systems with a single impurity, with two impurities, and for impurities forming a lattice. The local character of the singlet is found to be little affected by the presence of other impurity spins. A small effective interaction is found between a pair of impurity spins, which oscillates depending on impurity distances. For impurity lattices, the energy spectrum shows a gap which is found to be much smaller than the binding energy per impurity if the coupling constants are small. For larger coupling constants, it increases to the same order of magnitude as the binding energy, indicating that a local singlet is broken to create excited states. Impurity lattices with ferromagnetic couplings are also studied and their connection to the Haldane problem is discussed.Comment: 25 pages, plain TeX, 17 figures available on request, to be publised in Phys. Rev.

Partially Ordered Two-way B\"uchi Automata

We introduce partially ordered two-way B\"uchi automata and characterize their expressive power in terms of fragments of first-order logic FO[<]. Partially ordered two-way B\"uchi automata are B\"uchi automata which can change the direction in which the input is processed with the constraint that whenever a state is left, it is never re-entered again. Nondeterministic partially ordered two-way B\"uchi automata coincide with the first-order fragment Sigma2. Our main contribution is that deterministic partially ordered two-way B\"uchi automata are expressively complete for the first-order fragment Delta2. As an intermediate step, we show that deterministic partially ordered two-way B\"uchi automata are effectively closed under Boolean operations. A small model property yields coNP-completeness of the emptiness problem and the inclusion problem for deterministic partially ordered two-way B\"uchi automata.Comment: The results of this paper were presented at CIAA 2010; University of Stuttgart, Computer Scienc

Chandra Observation of the Cluster Environment of a WAT Radio Source in Abell 1446

Wide-angle tail (WAT) radio sources are often found in the centers of galaxy clusters where intracluster medium (ICM) ram pressure may bend the lobes into their characteristic C-shape. We examine the low redshift (z=0.1035) cluster Abell 1446, host to the WAT radio source 1159+583. The cluster exhibits possible evidence for a small-scale cluster-subcluster merger as a cause of the WAT radio source morphology. This evidence includes the presence of temperature and pressure substructure along the line that bisects the WAT as well as a possible wake of stripped interstellar material or a disrupted cool core to the southeast of the host galaxy. A filament to the north may represent cool, infalling gas that's contributing to the WAT bending while spectroscopically determined redshifts of member galaxies may indicate some component of a merger occurring along the line-of-sight. The WAT model of high flow velocity and low lobe density is examined as another scenario for the bending of 1159+583. It has been argued that such a model would allow the ram pressure due to the galaxy's slow motion through the ICM to shape the WAT source. A temperature profile shows that the cluster is isothermal (kT= 4.0 keV) in a series of annuli reaching a radius of 400 kpc. There is no evidence of an ongoing cooling flow. Temperature, abundance, pressure, density, and mass profiles, as well as two-dimensional maps of temperature and pressure are presented.Comment: 40 AASTeX pages including 15 postscript figures; accepted for publication in Ap

The proximal drivers of large fires: A Pyrogeographic study

Variations in global patterns of burning and fire regimes are relatively well measured, however, the degree of influence of the complex suite of biophysical and human drivers of fire remains controversial and incompletely understood. Such an understanding is required in order to support current fire management and to predict the future trajectory of global fire patterns in response to changes in these determinants. In this study we explore and compare the effects of four fundamental controls on fire, namely the production of biomass, its drying, the influence of weather on the spread of fire and sources of ignition. Our study area is southern Australia, where fire is currently limited by either fuel production or fuel dryness. As in most fire-prone environments, the majority of annual burned area is due to a relatively small number of large fires. We train and test an Artificial Neural Network’s ability to predict spatial patterns in the probability of large fires (>1,250 ha) in forests and grasslands as a function of proxies of the four major controls on fire activity. Fuel load is represented by predicted forested biomass and remotely sensed grass biomass, drying is represented by fraction of the time monthly potential evapotranspiration exceeds precipitation, weather is represented by the frequency of severe fire weather conditions and ignitions are represented by the average annual density of reported ignitions. The response of fire to these drivers is often non-linear. Our results suggest that fuel management will have limited capacity to alter future fire occurrence unless it yields landscape-scale changes in fuel amount, and that shifts between, rather than within, vegetation community types may be more important. We also find that increased frequency of severe fire weather could increase the likelihood of large fires in forests but decrease it in grasslands. These results have the potential to support long-term strategic planning and risk assessment by fire management agencies

Remarks on evolution of space-times in 3+1 and 4+1 dimensions

A large class of vacuum space-times is constructed in dimension 4+1 from hyperboloidal initial data sets which are not small perturbations of empty space data. These space-times are future geodesically complete, smooth up to their future null infinity, and extend as vacuum space-times through their Cauchy horizon. Dimensional reduction gives non-vacuum space-times with the same properties in 3+1 dimensions.Comment: 10pp, exposition improved; final versio

On the Hybrid Extension of CTL and CTL+

The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branching-time logics CTL and CTL+ by variables. Previous complexity results show that only fragments with one variable do have elementary complexity. It is shown that H1CTL+ and H1CTL, the hybrid extensions with one variable of CTL+ and CTL, respectively, are expressively equivalent but H1CTL+ is exponentially more succinct than H1CTL. On the other hand, HCTL+, the hybrid extension of CTL with arbitrarily many variables does not capture CTL*, as it even cannot express the simple CTL* property EGFp. The satisfiability problem for H1CTL+ is complete for triply exponential time, this remains true for quite weak fragments and quite strong extensions of the logic