Backward particle production in neutrino neon interactions

Backward proton and pion production is studied in ν and \(\bar v\) charged current interactions in neon. The results are compared with other experiments and theory. The complete backward proton data is compatible with protons produced by reinteractions in the nucleus. However in events with only one proton, muon variables appear correlated to those for the backward proton, as expected by the two-nucleon correlation model.     

Coherent single pion production by antineutrino charged current interactions and test of PCAC

The cross section for coherent production of a single π^? meson in charged current antineutrino interactions on neon nuclei has been measured in BEBC to be (175±25) 10^?40 cm²/neon nucleus, averaged over the energy spectrum of the antineutrino wide band beam at the CERN SPS; this corresponds to (0.9±0.1) % of the total charged current \(\bar v_\mu \) cross section. The distributions of kinematical variables are in agreement with theoretical predictions based on the PCAC hypothesis and the meson dominance model; in particular, theQ ² dependence is well described by a propagator containing a massm=(1.35±0.18) GeV. The absolute value of the cross section is also in agreement with the model. This analysis thus provides a test of the PCAC hypothesis in the antineutrino energy range 5–150 GeV.     

Stochastic Programming with Recourse: A Modification from an Applications Viewpoint

The paper describes a modified "wait-and-see" approach to solving two-stage stochastic programming problems. The approach, which involves a detailed sensitivity analysis in the classical sense, is described within the frameworks of decision theory and probabilistic programming. Although optimality in the mathematical sense cannot be guaranteed by using the approach, it is suggested that the managerial benefits weigh heavily in its favour. The approach allows management to consider a wide variety of objectives in making the choice between alternatives and facilities detection of the cause of any infeasibility due to management policy constraints. In addition, it allows much simpler programming calculations and provides an upper bound on the benefits that can be obtained by solving the full "here-and-now" problem and thus a judgement of the worth of the added computational burden can easily be made.     

Phase-field modeling of void evolution and swelling in materials under irradiation

Void swelling is an important phenomenon observed in both nuclear fuels and cladding materials in operating nuclear reactors. In this work we develop a phase-field model to simulate void evolution and void volume change in irradiated materials. Important material processes, including the generation of defects such as vacancies and self-interstitials, their diffusion and annihilation, and void nucleation and evolution, have been taken into account in this model. The thermodynamic and kinetic properties, such...     

Cycle-maximal triangle-free graphs

We conjecture that the balanced complete bipartite graph _{K⌊n/2⌋,⌈n/2⌉}$K_{\lfloor n/2\rfloor ,\lceil n/2\rceil }$ contains more cycles than any other n$n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds on the numbers of cycles in graphs depending on numbers of vertices and edges, girth, and homomorphisms to small fixed graphs; and use the bounds to show that among regular graphs, the conjecture holds. We also consider graphs that are close to being regular, with the minimum and maximum degrees differing by at most a positive integer k$k$. For k=1$k=1$, we show that any such counterexamples have n≤91$n\le 91$ and are not homomorphic to _C5$C_5$; and for any fixed k$k$ there exists a finite upper bound on the number of vertices in a counterexample. Finally, we describe an algorithm for efficiently computing the matrix permanent (a #P$\#P$-complete problem in general) in a special case used by our bounds.     

A Ramsey‐type problem and the Turán numbers*

For each n and k, we examine bounds on the largest number m so that for any k‐coloring of the edges of K_n there exists a copy of K_m whose edges receive at most k?1 colors. We show that for , the largest value of m is asymptotically equal to the Turá number , while for any constant then the largest m is asymptotically larger than that Turá number. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 120–129, 2002     

A search for the exotic Ξ<Superscript>−−</Superscript> (1860) in the hyperon beam experiment WA89(1860) in the hyperon beam experiment WA89

We report on a high statistics search for the Ξ^??(1860) resonance in Σ^?-nucleus collisions at 340 GeV/c. No evidence for this resonance is found in our data sample which contains 676000 Ξ^? candidates above bakground. For the decay channel Ξ^??(1860)→Ξ^? π ^? and the kinematic range 0.15<xF<0.9 we find a 3σ upper limit for the production cross section of 3.1 and 3.5 μb per nucleon, for reactions with carbon and copper, respectively.