6,596 research outputs found

    Chain: A Dynamic Double Auction Framework for Matching Patient Agents

    Get PDF
    In this paper we present and evaluate a general framework for the design of truthful auctions for matching agents in a dynamic, two-sided market. A single commodity, such as a resource or a task, is bought and sold by multiple buyers and sellers that arrive and depart over time. Our algorithm, Chain, provides the first framework that allows a truthful dynamic double auction (DA) to be constructed from a truthful, single-period (i.e. static) double-auction rule. The pricing and matching method of the Chain construction is unique amongst dynamic-auction rules that adopt the same building block. We examine experimentally the allocative efficiency of Chain when instantiated on various single-period rules, including the canonical McAfee double-auction rule. For a baseline we also consider non-truthful double auctions populated with zero-intelligence plus"-style learning agents. Chain-based auctions perform well in comparison with other schemes, especially as arrival intensity falls and agent valuations become more volatile

    Generalizing Boolean Satisfiability I: Background and Survey of Existing Work

    Full text link
    This is the first of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance. This paper is a survey of the work underlying ZAP, and discusses previous attempts to improve the performance of the Davis-Putnam-Logemann-Loveland algorithm by exploiting the structure of the problem being solved. We examine existing ideas including extensions of the Boolean language to allow cardinality constraints, pseudo-Boolean representations, symmetry, and a limited form of quantification. While this paper is intended as a survey, our research results are contained in the two subsequent articles, with the theoretical structure of ZAP described in the second paper in this series, and ZAP's implementation described in the third

    Recent developments in advanced thermal analysis: sample controlled thermal analysis

    Get PDF
    The determination of the key physical and chemical properties of a new material is essential.The melting point, glass transition temperature, the number and identification of the different phases it may have, and the temperatures at which they are formed are all of great value, not only in assessing its practical pharmaceutical potential but also as they can form the basis of many routine QC procedures

    Oscillator strength of the resonance transitions of ground-state N and O

    Get PDF
    Oscillator strength of resonance transitions of ground state nitrogen and oxyge

    Generalizing Boolean Satisfiability II: Theory

    Full text link
    This is the second of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance. This paper presents the theoretical basis for the ideas underlying ZAP, arguing that existing ideas in this area exploit a single, recurring structure in that multiple database axioms can be obtained by operating on a single axiom using a subgroup of the group of permutations on the literals in the problem. We argue that the group structure precisely captures the general structure at which earlier approaches hinted, and give numerous examples of its use. We go on to extend the Davis-Putnam-Logemann-Loveland inference procedure to this broader setting, and show that earlier computational improvements are either subsumed or left intact by the new method. The third paper in this series discusses ZAPs implementation and presents experimental performance results

    Real-time monitoring of proton exchange membrane fuel cell stack failure

    Get PDF
    Uneven pressure drops in a 75-cell 9.5-kWe proton exchange membrane fuel cell stack with a U-shaped flow configuration have been shown to cause localised flooding. Condensed water then leads to localised cell heating, resulting in reduced membrane durability. Upon purging of the anode manifold, the resulting mechanical strain on the membrane can lead to the formation of a pin-hole/membrane crack and a rapid decrease in open circuit voltage due to gas crossover. This failure has the potential to cascade to neighbouring cells due to the bipolar plate coupling and the current density heterogeneities arising from the pin-hole/membrane crack. Reintroduction of hydrogen after failure results in cell voltage loss propagating from the pin-hole/membrane crack location due to reactant crossover from the anode to the cathode, given that the anode pressure is higher than the cathode pressure. Through these observations, it is recommended that purging is avoided when the onset of flooding is observed to prevent irreparable damage to the stack

    Generalizing Boolean Satisfiability III: Implementation

    Full text link
    This is the third of three papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal has been to define a representation in which this structure is apparent and can be exploited to improve computational performance. The first paper surveyed existing work that (knowingly or not) exploited problem structure to improve the performance of satisfiability engines, and the second paper showed that this structure could be understood in terms of groups of permutations acting on individual clauses in any particular Boolean theory. We conclude the series by discussing the techniques needed to implement our ideas, and by reporting on their performance on a variety of problem instances

    Threshold photoelectron photoion coincidence spectroscopy and selected ion flow tube reactions of CHF3: comparison of product branching ratios

    Get PDF
    The threshold photoelectron and threshold photoelectron photoion coincidence spectra of CHF3_3 in the range 13.5 – 24.5 eV have been recorded. Ion yields and branching ratios have been determined for the three fragments CF3+_3^+, CHF2+^+ and CF+^+. The mean kinetic energy releases into fragment ions involving either C-H or C-F bond cleavage have been measured, and compared with statistical and impulsive models. CHF3+_3^+ behaves in a non-statistical manner characteristic of the small-molecule limit, with the ground electronic state and low-lying excited states of CHF3+_3^+ being largely repulsive along the C-H and C-F coordinates, respectively. The rate coefficients and product ion branching ratios have been measured at 298 K in a selected ion flow tube for the reactions of CHF3_3 with a large number of gas-phase cations whose recombination energies span the range 6.3 through 21.6 eV. A comparison between the branching ratios from the two experiments, together with an analysis of the threshold photoelectron spectrum of CHF3_3, shows that long-range charge transfer probably occurs for the Ar+^+ and F+^+ atomic ions whose recombination energies lie above ca. 15 eV. Below this energy, the mechanism involves a combination of short-range charge transfer and chemical reactions involving a transition state intermediate

    Characterisation of the VELO High Voltage System

    Get PDF
    The high voltage system supplies the bias voltage to the 88 silicon sensors which comprise the LHCb Vertex Locator (VELO). This note describes the results of the tests which have been performed on the hardware of the high voltage system of the VELO. Each individual test detailed in this note corresponds to a specific requirement of the system. These requirements arise primarily from ensuring the safety of the silicon sensors and the quality of the data taken from the VELO modules. The tests performed are in four categories: normal operation of the high voltage system; verification of its stability under operation; discussion of its behaviour in failure modes; and details of operation at low voltage. Noteworthy issues, identified through the tests, include the behaviour of the high voltage modules at voltages below 9V, the current limit that can be applied during ramping of the voltage, and the speed with which the voltage is cut during failures of the system. The results of these tests provide high confidence that the high voltage system can be safely used and demonstrate that low noise is produced by the power supplies
    • …
    corecore