This paper investigates the effect of conflict on firms' output value and input misallocation in the context of Palestine during the Second Intifada. Using a unique establishment-level dataset, we compare firms' outcomes and input usage over time across districts experiencing differential changes in conflict intensity. We show how conflict diminishes the total and per-worker value of firms' out...

Phase correlation techniques have been used in image registration to estimate image displacements. These techniques have been also used to estimate optical ow by applying it locally. In this work a di erent phase correlation-based method is proposed to deal with a deformation/translation motion model, instead of the pure translations that the basic phase correlation technique can estimate. Some...

This paper provides an abstract definition of some kinds of logics, called diagrammatic logics, together with a definition of morphisms and of 2-morphisms between diagrammatic logics. The definition of the 2-category of diagrammatic logics rely on category theory, mainly on adjunction, categories of fractions and limit sketches. This framework is applied to the formalization of a parameterizati...

We consider the fully constrained version of the next-to-minimal supersymmetric extension of the standard model (cNMSSM) in which a singlet Higgs superfield is added to the two doublets that are present in the minimal extension (MSSM). Assuming universal boundary conditions at a high scale for the soft supersymmetrybreaking gaugino, sfermion and Higgs mass parameters as well as for the trilinea...

We consider the problem of constructing Concurrent Zero Knowledge Proofs [6], in which the fascinating and useful “zero knowledge” property is guaranteed even in situations where multiple concurrent proof sessions are executed with many colluding dishonest verifiers. Canetti et al. [3] show that blackbox concurrent zero knowledge proofs for non-trivial languages require Ω̃(log k) rounds where k ...

The NIST codebook-based deterministic random bit generators are analyzed in the context of being indistinguishable from random. Upper and lower bounds based on the probability of distinguishing the output are proven. These bounds imply that the security of the designs are bounded by the codebook width, or more precisely on the property that the codebooks act like a random permutation, as oppose...

Calibration is a common practice in image steganalysis for extracting prominent features. Based on the idea of reembedding, a new set of calibrated features for audio steganalysis applications are proposed. These features are extracted from a model that has maximum deviation from human auditory system and had been specifically designed for audio steganalysis. Ability of the proposed system is t...

Let K and L be compact convex sets in Rn. The following two statements are shown to be equivalent: (i) For every polytope Q ⊆ K having at most n+ 1 vertices, L contains a translate of Q. (ii) L contains a translate of K. Let 1 ≤ d ≤ n − 1. It is also shown that the following two statements are equivalent: (i) For every polytope Q ⊆ K having at most d+ 1 vertices, L contains a translate of Q. (i...