It is shown that it is undecidable in general whether a terminating graph rewriting system is confluent or not—in contrast to the situation for term and string rewriting systems. Critical pairs are introduced to hypergraph rewriting, a generalisation of graph rewriting, where it turns out that the mere existence of common reducts for all critical pairs of a graph rewriting system does not imply...

We compute by numerical integration of the Dirac equation the number of quark-antiquark pairs produced in the classical color fields of colliding ultrarelativistic nuclei. Results for the dependence of the number of quarks on the strength of the background field, the quark mass and time are presented. We also perform several tests of our numerical method. While the number of qq̄ pairs is paramet...

We propose a general theoretical framework to analyze the security of Physical Uncloneable Functions (PUFs). We apply the framework to Optical PUFs. In particular we present a derivation, based on the physics governing multiple scattering processes, of the number of independent challengeresponse pairs supported by a PUF. We find that the number of independent challenge-response pairs is proport...

Recent technological advances as well as progress in theoretical understanding of neural systems have created a need for synthetic spike trains with controlled mean rate and pairwise cross-correlation. This report introduces and analyzes a novel algorithm for the generation of discretized spike trains with arbitrary mean rates and controlled cross correlation. Pairs of spike trains with any pai...

This paper studies a queuing model where two customer classes compete for a given resource and each customer is dynamically quoted a menu of price and leadtime pairs upon arrival. Customers select their preferred pairs from the menu and the server is obligated to meet the quoted leadtime. Customers have convex– concave delay costs. The firm does not have information on a given customer’s type, ...

In this paper, we use weakly commuting and weakly compatible conditions of self-mapping pairs, prove some new common fixed point theorems for three pairs of self-maps in the framework of generalized metric spaces. The results presented in this paper generalize the well known comparable results in the literature due to Abbas et al. [M. Abbas, T. Nazir, R. Saadati, Adv. Difference Equ., 2011 (201...

Patients needing kidney transplants may have donors who cannot donate to them because of blood or tissue incompatibility. Incompatible patient-donor pairs can exchange donor kidneys with other pairs only when there is a "double coincidence of wants." Developing infrastructure to perform three-way as well as two-way exchanges will have a substantial effect on the number of transplants that can b...

We describe two corpora of question and answer pairs collected for complex, open-domain Question Answering (QA) to enable answer classification and re-ranking experiments. We deliver manually annotated answers to non-factoid questions from a QA system on both Web and TREC data. Moreover, we provide the same question/answer pairs in a rich data representation that includes syntactic parse trees ...

Growing incidence of end-stage renal disease, shortage of kidneys from deceased donors and a better outcome for recipients of kidneys from living donor have led many centres worldwide to favour living donor kidney transplantation programmes. Although criteria for living donation have greatly evolved in recent years with acceptance of related and unrelated donors, an immunological incompatibilit...

The way compatible pairs of nitrate non-utilizing mutants (nit) are selected is usually not explained and remains unclear whether these pairs are representative for an isolate or strain. In addition, tester strains of Verticillium dahliae vegetative compatibility groups (VCGs) cross-react with at least one pair of tester strains of another VCG, and although it is a common knowledge of scientist...