Colour-Singlet Exchange in ep Interactions

Results presented at the DIS97 workshop by the H1, ZEUS and E665 collaborations on processes yielding large rapidity gaps and energetic leading baryons are reviewed. A consistent picture begins to emerge in which diffractive processes dominate when the fractional longitudinal momentum loss at the baryon vertex \xpom is small, with substantial contributions from other processes as \xpom increases. The diffractive mechanism in the deep-inelastic regime is found, both from inclusive measurements and final state studies, to involve the exchange of a gluon carrying a large fraction of the exchange momentum. Vector meson results show the transition from soft to hard production mechanisms with increasing precision.Comment: 18 pages, 8 figures, LATEX, aipproc.sty. Summary talk from the diffractive sessions of the DIS97 workshop, Chicag

The Large Footprints of H-Space on Asymptotically Flat Space-Times

We show that certain structures defined on the complex four dimensional space known as H-Space have considerable relevance for its closely associated asymptotically flat real physical space-time. More specifically for every complex analytic curve on the H-space there is an asymptotically shear-free null geodesic congruence in the physical space-time. There are specific geometric structures that allow this world-line to be chosen in a unique canonical fashion giving it physical meaning and significance.Comment: 7 page

Solar activity prediction of sunspot numbers (verification). Predicted solar radio flux; predicted geomagnetic indices Ap and Kp

Efforts to further verify a previously reported technique for predicting monthly sunspot numbers over a period of years (1979 to 1989) involved the application of the technique over the period for the maximum epoch of solar cycle 19. Results obtained are presented. Methods and results for predicting solar flux (F10.7 cm) based on flux/sunspot number models, ascent and descent, and geomagnetic activity indices as a function of sunspot number and solar cycle phase classes are included

Twisting Null Geodesic Congruences, Scri, H-Space and Spin-Angular Momentum

The purpose of this work is to return, with a new observation and rather unconventional point of view, to the study of asymptotically flat solutions of Einstein equations. The essential observation is that from a given asymptotically flat space-time with a given Bondi shear, one can find (by integrating a partial differential equation) a class of asymptotically shear-free (but, in general, twistiing) null geodesic congruences. The class is uniquely given up to the arbitrary choice of a complex analytic world-line in a four-parameter complex space. Surprisingly this parameter space turns out to be the H-space that is associated with the real physical space-time under consideration. The main development in this work is the demonstration of how this complex world-line can be made both unique and also given a physical meaning. More specifically by forcing or requiring a certain term in the asymptotic Weyl tensor to vanish, the world-line is uniquely determined and becomes (by several arguments) identified as the `complex center-of-mass'. Roughly, its imaginary part becomes identified with the intrinsic spin-angular momentum while the real part yields the orbital angular momentum.Comment: 26 pages, authors were relisted alphabeticall

Shorter tours and longer detours: Uniform covers and a bit beyond

Motivated by the well known four-thirds conjecture for the traveling salesman problem (TSP), we study the problem of {\em uniform covers}. A graph $G=(V,E)$ has an $\alpha$-uniform cover for TSP (2EC, respectively) if the everywhere $\alpha$ vector (i.e. $\{\alpha\}^{E}$) dominates a convex combination of incidence vectors of tours (2-edge-connected spanning multigraphs, respectively). The polyhedral analysis of Christofides' algorithm directly implies that a 3-edge-connected, cubic graph has a 1-uniform cover for TSP. Seb\H{o} asked if such graphs have $(1-\epsilon)$-uniform covers for TSP for some $\epsilon > 0$. Indeed, the four-thirds conjecture implies that such graphs have 8/9-uniform covers. We show that these graphs have 18/19-uniform covers for TSP. We also study uniform covers for 2EC and show that the everywhere 15/17 vector can be efficiently written as a convex combination of 2-edge-connected spanning multigraphs. For a weighted, 3-edge-connected, cubic graph, our results show that if the everywhere 2/3 vector is an optimal solution for the subtour linear programming relaxation, then a tour with weight at most 27/19 times that of an optimal tour can be found efficiently. Node-weighted, 3-edge-connected, cubic graphs fall into this category. In this special case, we can apply our tools to obtain an even better approximation guarantee. To extend our approach to input graphs that are 2-edge-connected, we present a procedure to decompose an optimal solution for the subtour relaxation for TSP into spanning, connected multigraphs that cover each 2-edge cut an even number of times. Using this decomposition, we obtain a 17/12-approximation algorithm for minimum weight 2-edge-connected spanning subgraphs on subcubic, node-weighted graphs

Synchronization of Reed-Solomon codes

The synchronization capabilities of Reed-Solomon codes when an appropriate coset of the code is used instead of the code itself are examined. In this case an E-error correcting Reed-Solomon code is transformed into a code capable of determining that there are m symbols out of sync, if e symbol errors occurred, whenever m + e E. In the event that m = 0, i.e., the word is in sync, then decoder will correct any pattern of E - 1 on fewer symbol errors

Information Flow in Social Groups

We present a study of information flow that takes into account the observation that an item relevant to one person is more likely to be of interest to individuals in the same social circle than those outside of it. This is due to the fact that the similarity of node attributes in social networks decreases as a function of the graph distance. An epidemic model on a scale-free network with this property has a finite threshold, implying that the spread of information is limited. We tested our predictions by measuring the spread of messages in an organization and also by numerical experiments that take into consideration the organizational distance among individuals