Searcharxiv⌕ Search

arXiv subjects

Thomas Meyer

Publications and source records attributed to Thomas Meyer.

42 records · Page 3Linked to original sources

Fast Bunch Integrators at Fermilab During Run II

The Fast Bunch Integrator is a bunch intensity monitor designed around the measurements made from Resistive Wall Current Monitors. During the Run II period these were used in both Tevatron and Main Injector for single and multiple bunch intensity measurements. This paper presents an overview of the design and use of these systems during this period.

physics.acc-ph↗

Instrument Front-Ends at Fermilab During Run II

The optimization of an accelerator relies on the ability to monitor the behavior of the beam in an intelligent and timely fashion. The use of processor-driven front-ends allowed for the deployment of smart systems in the field for improved data collection and analysis during Run II. This paper describes the implementation of the two main systems used: National Instruments LabVIEW running on PCs, and WindRiver's VxWorks real-time operating system running in a VME crate processor.

physics.acc-ph↗

Operational use of ionization profile monitors in the Fermilab Main Injector

Ionization profile monitors (IPMs) are used in the Fermilab Main Injector (MI) to monitor injection lattice matching by measuring turn-by-turn sigmas at injection and to measure transverse emittance of the beam during the acceleration cycle. The IPMs provide a periodic, non-destructive means of performing turn-by-turn emittance measurements where other techniques are not applicable. As Fermilab is refocusing its attention on the intensity frontier, non-intercepting diagnostics such as IPMs are expected to become even more important. This paper gives an overview of the operational use of IPMs for emittance measurements and injection lattice matching measurements at Fermilab, and summarizes the future plans.

physics.acc-ph↗

Some logics of belief and disbelief

The introduction of explicit notions of rejection, or disbelief, into logics for knowledge representation can be justified in a number of ways. Motivations range from the need for versions of negation weaker than classical negation, to the explicit recording of classic belief contraction operations in the area of belief change, and the additional levels of expressivity obtained from an extended version of belief change which includes disbelief contraction. In this paper we present four logics of disbelief which address some or all of these intuitions. Soundness and completeness results are supplied and the logics are compared with respect to applicability and utility.

cs.AI↗

Iterated revision and the axiom of recovery: a unified treatment via epistemic states

The axiom of recovery, while capturing a central intuition regarding belief change, has been the source of much controversy. We argue briefly against putative counterexamples to the axiom--while agreeing that some of their insight deserves to be preserved--and present additional recovery-like axioms in a framework that uses epistemic states, which encode preferences, as the object of revisions. This provides a framework in which iterated revision becomes possible and makes explicit the connection between iterated belief change and the axiom of recovery. We provide a representation theorem that connects the semantic conditions that we impose on iterated revision and the additional syntactical properties mentioned. We also show some interesting similarities between our framework and that of Darwiche-Pearl. In particular, we show that the intuitions underlying the controversial (C2) postulate are captured by the recovery axiom and our recovery-like postulates (the latter can be seen as weakenings of (C2).

cs.AI↗

On the semantics of merging

Intelligent agents are often faced with the problem of trying to merge possibly conflicting pieces of information obtained from different sources into a consistent view of the world. We propose a framework for the modelling of such merging operations with roots in the work of Spohn (1988, 1991). Unlike most approaches we focus on the merging of epistemic states, not knowledge bases. We construct a number of plausible merging operations and measure them against various properties that merging operations ought to satisfy. Finally, we discuss the connection between merging and the use of infobases Meyer (1999) and Meyer et al. (2000).

cs.AI↗