Instanton effects and chiral symmetry breaking in QCD2

We discuss the spontaneous breakdown of chiral symmetry in Quantum Chromodynamics by considering gluonic instanton configurations in the partition function. It is shown that in order to obtain nontrivial fermionic correlators in a two dimensional gauge theory for the strong interactions among quarks, a regular instanton background has to be taken into account. We work over massless quarks in the -fundamental- representation of SU(N_c). For large N_c, massive quarks are also considered.Comment: 4 pages, uses espcrc2.sty (attached), updated reference

CHR as grammar formalism. A first report

Grammars written as Constraint Handling Rules (CHR) can be executed as efficient and robust bottom-up parsers that provide a straightforward, non-backtracking treatment of ambiguity. Abduction with integrity constraints as well as other dynamic hypothesis generation techniques fit naturally into such grammars and are exemplified for anaphora resolution, coordination and text interpretation.Comment: 12 pages. Presented at ERCIM Workshop on Constraints, Prague, Czech Republic, June 18-20, 200

Particle Identification Studies with an ALICE Test TPC

Using a test TPC, consisting of the ALICE TPC field cage prototype in combination with the final ALICE TPC readout and electronics, the energy loss distribution and resolution were measured for identified protons. The measurements were compared to theoretical calculations and good quantitative agreement was found when detector effects were taken into account. The implications for particle identification are discussed.Comment: 6 pages, 4 figures, Quark Matter 06 poster proceedin

CHR Grammars

A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming. To appear in Theory and Practice of Logic Programming (TPLP), 2005Comment: 36 pp. To appear in TPLP, 200