An m by n sign pattern S is an m by n matrix with entries in {+,−, 0}. Such a sign pattern allows a positive (resp., nonnegative) left inverse, provided that there exist an m by n matrix A with the sign pattern S and an n by m matrix B with only positive (resp., nonnegative) entries satisfying BA = In, where In is the n by n identity matrix. For m > n ≥ 2, a characterization of m by n sign patt...

a emph{signed graph} (or, in short, emph{sigraph}) $s=(s^u,sigma)$ consists of an underlying graph $s^u :=g=(v,e)$ and a function $sigma:e(s^u)longrightarrow {+,-}$, called the signature of $s$. a emph{marking} of $s$ is a function $mu:v(s)longrightarrow {+,-}$. the emph{canonical marking} of a signed graph $s$, denoted $mu_sigma$, is given as $$mu_sigma(v) := prod_{vwin e(s)}sigma(vw).$$the li...

In a previous paper we have calculated the decay τ → πντγ. We used a given relative sign between the internal bremsstrahlung and the structure dependent radiation, which has been used by several other authors before. However, we believe that there are good arguments why the opposite sign is the physical one. We briefly discuss these arguments and then investigate how the predictions for the dec...

1 Distance Fields Given an implicit surface ∂S with S ⊆ R the corresponding distance field (also called signed distance function) D : R → R which maps a point p from the domain of the distance field R to a real-valued distance value is obtained by distance transforming the surface using the formula D(p) = sign(p) ·min{d(p, q) : q ∈ S} (1) The metric d(p, q) used is the standard Euclidean metric...

values in A. This justifies the choice of the backward and forward terminology above. We denote by, respectively, F(C, f) and B(C, f) the set of Fand Bcomplete abstractions of C for f . It is worth noting that in general F(C, f) 6⊆ B(C, f) and F(C, f) 6⊆ B(C, f), namely Band F-completeness are incomparable notions. Example 1. Let Sign be the simple abstraction of 〈℘(Z),⊆〉 for analysing integer ...

A signed graph is a simple graph where each edge receives a sign positive or negative. Such graphs are mainly used in social sciences where individuals represent vertices friendly relation between them as a positive edge and enmity as a negative edge. In signed graphs, we define these relationships (edges) as of friendship ("+" edge) or hostility ("-" edge). A 2-path product signed graph [Formu...

Discussions about Bose-Einstein correlations between decay products of coproduced W-bosons again raise the question about the behaviour of correlations if several strings are produced. This is studied by the multiplicity dependence of like-sign and opposite-sign correlations in p̄p reactions at √ s = 630 GeV. To be published in Proceedings of the 8 Internat. Workshop on Multiparticle Production ...

Early phonological analyses of sign languages proposed that a sign consists of feature values for four parameters: handshape, orientation of the hand in space (e.g. palm up, fingers away from the body), place of articulation (or location), and movement (features such as shape, repeated, and alternating). This paper deals with what has traditionally been called handshape (Stokoe 1978). In referi...