Diffractive production of high pt photons at HERA

We study the diffractive production of high pt photons at HERA. We have implemented the process as a new hard sub-process in the HERWIG event generator in order to prepare the ground for a future measurement.Comment: 4 pages, 4 figures. Contribution to the 1999 UK Phenomenology Workshop on Collider Physics, Durham, U

Cell surface localization of tissue transglutaminase is dependent on a fibronectin-binding site in its N-terminal beta-sandwich domain

Increasing evidence indicates that tissue transglutaminase (tTG) plays a role in the assembly and remodeling of extracellular matrices and promotes cell adhesion. Using an inducible system we have previously shown that tTG associates with the extracellular matrix deposited by stably transfected 3T3 fibroblasts overexpressing the enzyme. We now show by confocal microscopy that tTG colocalizes with pericellular fibronectin in these cells, and by immunogold electron microscopy that the two proteins are found in clusters at the cell surface. Expression vectors encoding the full-length tTG or a N-terminal truncated tTG lacking the proposed fibronectin-binding site (fused to the bacterial reporter enzyme β-galactosidase) were generated to characterize the role of fibronectin in sequestration of tTG in the pericellular matrix. Enzyme-linked immunosorbent assay style procedures using extracts of transiently transfected COS-7 cells and immobilized fibronectin showed that the truncation abolished fibronectin binding. Similarly, the association of tTG with the pericellular matrix of cells in suspension or with the extracellular matrix deposited by cell monolayers was prevented by the truncation. These results demonstrate that tTG binds to the pericellular fibronectin coat of cells via its N-terminal β-sandwich domain and that this interaction is crucial for cell surface association of tTG

Hyperopic Cops and Robbers

We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the corresponding analogue of the cop number, and we investigate bounds and other properties of this parameter. We characterize the cop-win graphs for this variant, along with graphs with the largest possible hyperopic cop number. We analyze the cases of graphs with diameter 2 or at least 3, focusing on when the hyperopic cop number is at most one greater than the cop number. We show that for planar graphs, as with the usual cop number, the hyperopic cop number is at most 3. The hyperopic cop number is considered for countable graphs, and it is shown that for connected chains of graphs, the hyperopic cop density can be any real number in $[0,1/2].

Cohomology of toric line bundles via simplicial Alexander duality

We give a rigorous mathematical proof for the validity of the toric sheaf cohomology algorithm conjectured in the recent paper by R. Blumenhagen, B. Jurke, T. Rahn, and H. Roschy (arXiv:1003.5217). We actually prove not only the original algorithm but also a speed-up version of it. Our proof is independent from (in fact appeared earlier on the arXiv than) the proof by H. Roschy and T. Rahn (arXiv:1006.2392), and has several advantages such as being shorter and cleaner and can also settle the additional conjecture on "Serre duality for Betti numbers" which was raised but unresolved in arXiv:1006.2392.Comment: 9 pages. Theorem 1.1 and Corollary 1.2 improved; Abstract and Introduction modified; References updated. To appear in Journal of Mathematical Physic

Data-Discriminants of Likelihood Equations

Maximum likelihood estimation (MLE) is a fundamental computational problem in statistics. The problem is to maximize the likelihood function with respect to given data on a statistical model. An algebraic approach to this problem is to solve a very structured parameterized polynomial system called likelihood equations. For general choices of data, the number of complex solutions to the likelihood equations is finite and called the ML-degree of the model. The only solutions to the likelihood equations that are statistically meaningful are the real/positive solutions. However, the number of real/positive solutions is not characterized by the ML-degree. We use discriminants to classify data according to the number of real/positive solutions of the likelihood equations. We call these discriminants data-discriminants (DD). We develop a probabilistic algorithm for computing DDs. Experimental results show that, for the benchmarks we have tried, the probabilistic algorithm is more efficient than the standard elimination algorithm. Based on the computational results, we discuss the real root classification problem for the 3 by 3 symmetric matrix~model.Comment: 2 table

A Bayesian Analogue of Gleason's Theorem

We introduce a novel notion of probability within quantum history theories and give a Gleasonesque proof for these assignments. This involves introducing a tentative novel axiom of probability. We also discuss how we are to interpret these generalised probabilities as partially ordered notions of preference and we introduce a tentative generalised notion of Shannon entropy. A Bayesian approach to probability theory is adopted throughout, thus the axioms we use will be minimal criteria of rationality rather than ad hoc mathematical axioms.Comment: 14 pages, v2: minor stylistic changes, v3: changes made in-line with to-be-published versio

On the Adjoint Operator in Photoacoustic Tomography

Photoacoustic Tomography (PAT) is an emerging biomedical "imaging from coupled physics" technique, in which the image contrast is due to optical absorption, but the information is carried to the surface of the tissue as ultrasound pulses. Many algorithms and formulae for PAT image reconstruction have been proposed for the case when a complete data set is available. In many practical imaging scenarios, however, it is not possible to obtain the full data, or the data may be sub-sampled for faster data acquisition. In such cases, image reconstruction algorithms that can incorporate prior knowledge to ameliorate the loss of data are required. Hence, recently there has been an increased interest in using variational image reconstruction. A crucial ingredient for the application of these techniques is the adjoint of the PAT forward operator, which is described in this article from physical, theoretical and numerical perspectives. First, a simple mathematical derivation of the adjoint of the PAT forward operator in the continuous framework is presented. Then, an efficient numerical implementation of the adjoint using a k-space time domain wave propagation model is described and illustrated in the context of variational PAT image reconstruction, on both 2D and 3D examples including inhomogeneous sound speed. The principal advantage of this analytical adjoint over an algebraic adjoint (obtained by taking the direct adjoint of the particular numerical forward scheme used) is that it can be implemented using currently available fast wave propagation solvers.Comment: submitted to "Inverse Problems

Anomalous aging phenomena caused by drift velocities

We demonstrate via several examples that a uniform drift velocity gives rise to anomalous aging, characterized by a specific form for the two-time correlation functions, in a variety of statistical-mechanical systems far from equilibrium. Our first example concerns the oscillatory phase observed recently in a model of competitive learning. Further examples, where the proposed theory is exact, include the voter model and the Ohta-Jasnow-Kawasaki theory for domain growth in any dimension, and a theory for the smoothing of sandpile surfaces.Comment: 7 pages, 3 figures. To appear in Europhysics Letter