Nuclear wastewater decontamination by 3D-Printed hierarchical zeolite monoliths

3D-printed monoliths of zeolites chabazite and 4A were made, characterized, and shown effective for removing strontium and caesium from water

Electromagnetic wave refraction at an interface of a double wire medium

Plane-wave reflection and refraction at an interface with a double wire medium is considered. The problem of additional boundary conditions (ABC) in application to wire media is discussed and an ABC-free approach, known in the solid state physics, is used. Expressions for the fields and Poynting vectors of the refracted waves are derived. Directions and values of the power density flow of the refracted waves are found and the conservation of the power flow through the interface is checked. The difference between the results, given by the conventional model of wire media and the model, properly taking into account spatial dispersion, is discussed.Comment: 17 pages, 11 figure

Fixed Price Approximability of the Optimal Gain From Trade

Bilateral trade is a fundamental economic scenario comprising a strategically acting buyer and seller, each holding valuations for the item, drawn from publicly known distributions. A mechanism is supposed to facilitate trade between these agents, if such trade is beneficial. It was recently shown that the only mechanisms that are simultaneously DSIC, SBB, and ex-post IR, are fixed price mechanisms, i.e., mechanisms that are parametrised by a price p, and trade occurs if and only if the valuation of the buyer is at least p and the valuation of the seller is at most p. The gain from trade is the increase in welfare that results from applying a mechanism; here we study the gain from trade achievable by fixed price mechanisms. We explore this question for both the bilateral trade setting, and a double auction setting where there are multiple buyers and sellers. We first identify a fixed price mechanism that achieves a gain from trade of at least 2/r times the optimum, where r is the probability that the seller's valuation does not exceed the buyer's valuation. This extends a previous result by McAfee. Subsequently, we improve this approximation factor in an asymptotic sense, by showing that a more sophisticated rule for setting the fixed price results in an expected gain from trade within a factor O(log(1/r)) of the optimal gain from trade. This is asymptotically the best approximation factor possible. Lastly, we extend our study of fixed price mechanisms to the double auction setting defined by a set of multiple i.i.d. unit demand buyers, and i.i.d. unit supply sellers. We present a fixed price mechanism that achieves a gain from trade that achieves for all epsilon > 0 a gain from trade of at least (1-epsilon) times the expected optimal gain from trade with probability 1 - 2/e^{#T epsilon^2 /2}, where #T is the expected number of trades resulting from the double auction

MV3: A new word based stream cipher using rapid mixing and revolving buffers

MV3 is a new word based stream cipher for encrypting long streams of data. A direct adaptation of a byte based cipher such as RC4 into a 32- or 64-bit word version will obviously need vast amounts of memory. This scaling issue necessitates a look for new components and principles, as well as mathematical analysis to justify their use. Our approach, like RC4's, is based on rapidly mixing random walks on directed graphs (that is, walks which reach a random state quickly, from any starting point). We begin with some well understood walks, and then introduce nonlinearity in their steps in order to improve security and show long term statistical correlations are negligible. To minimize the short term correlations, as well as to deter attacks using equations involving successive outputs, we provide a method for sequencing the outputs derived from the walk using three revolving buffers. The cipher is fast -- it runs at a speed of less than 5 cycles per byte on a Pentium IV processor. A word based cipher needs to output more bits per step, which exposes more correlations for attacks. Moreover we seek simplicity of construction and transparent analysis. To meet these requirements, we use a larger state and claim security corresponding to only a fraction of it. Our design is for an adequately secure word-based cipher; our very preliminary estimate puts the security close to exhaustive search for keys of size < 256 bits.Comment: 27 pages, shortened version will appear in "Topics in Cryptology - CT-RSA 2007

Reexamination of Quantum Bit Commitment: the Possible and the Impossible

Bit commitment protocols whose security is based on the laws of quantum mechanics alone are generally held to be impossible. In this paper we give a strengthened and explicit proof of this result. We extend its scope to a much larger variety of protocols, which may have an arbitrary number of rounds, in which both classical and quantum information is exchanged, and which may include aborts and resets. Moreover, we do not consider the receiver to be bound to a fixed "honest" strategy, so that "anonymous state protocols", which were recently suggested as a possible way to beat the known no-go results are also covered. We show that any concealing protocol allows the sender to find a cheating strategy, which is universal in the sense that it works against any strategy of the receiver. Moreover, if the concealing property holds only approximately, the cheat goes undetected with a high probability, which we explicitly estimate. The proof uses an explicit formalization of general two party protocols, which is applicable to more general situations, and a new estimate about the continuity of the Stinespring dilation of a general quantum channel. The result also provides a natural characterization of protocols that fall outside the standard setting of unlimited available technology, and thus may allow secure bit commitment. We present a new such protocol whose security, perhaps surprisingly, relies on decoherence in the receiver's lab.Comment: v1: 26 pages, 4 eps figures. v2: 31 pages, 5 eps figures; replaced with published version; title changed to comply with puzzling Phys. Rev. regulations; impossibility proof extended to protocols with infinitely many rounds or a continuous communication tree; security proof of decoherence monster protocol expanded; presentation clarifie

A Discrete and Bounded Envy-free Cake Cutting Protocol for Four Agents

We consider the well-studied cake cutting problem in which the goal is to identify a fair allocation based on a minimal number of queries from the agents. The problem has attracted considerable attention within various branches of computer science, mathematics, and economics. Although, the elegant Selfridge-Conway envy-free protocol for three agents has been known since 1960, it has been a major open problem for the last fifty years to obtain a bounded envy-free protocol for more than three agents. We propose a discrete and bounded envy-free protocol for four agents

Strong and weak coupling limits in optics of quantum well excitons

A transition between the strong (coherent) and weak (incoherent) coupling limits of resonant interaction between quantum well (QW) excitons and bulk photons is analyzed and quantified as a function of the incoherent damping rate caused by exciton-phonon and exciton-exciton scattering. For confined QW polaritons, a second, anomalous, damping-induced dispersion branch arises and develops with increasing damping. In this case, the strong-weak coupling transition is attributed to a critical damping rate, when the intersection of the normal and damping-induced dispersion branches occurs. For the radiative states of QW excitons, i.e., for radiative QW polaritons, the transition is described as a qualitative change of the photoluminescence spectrum at grazing angles along the QW structure. Furthermore, we show that the radiative corrections to the QW exciton states with in-plane wavevector approaching the photon cone are universally scaled by an energy parameter rather than diverge. The strong-weak coupling transition rates are also proportional to the same energy parameter. The numerical evaluations are given for a GaAs single quantum well with realistic parameters.Comment: Published in Physical Review B. 29 pages, 12 figure

Simple Encrypted Arithmetic Library - SEAL v2.1

Achieving fully homomorphic encryption was a longstanding open problem in cryptography until it was resolved by Gentry in 2009. Soon after, several homomorphic encryption schemes were proposed. The early homomorphic encryption schemes were extremely impractical, but recently new implementations, new data encoding techniques, and a better understanding of the applications have started to change the situation. In this paper we introduce the most recent version (v2.1) of Simple Encrypted Arithmetic Library - SEAL, a homomorphic encryption library developed by Microsoft Research, and describe some of its core functionality

Public welfare or sectarianism: A new challenge for planning

Introduction Theoretical background Methodology The Haredi in Jerusalem Kiryat-Ha'Yovel “Terrain of interests” between Haredi and secular in Kiryat-Ha'Yovel Organisation in housing Potential for influencing planning decisions Conclusions: failure of liberalism or all-you-can-grab planning? Full Article Figures & data References Citations Metrics Reprints & Permissions PDF Abstract This article examines the weaknesses of liberal planning institutions when dealing with organised group action. The case under review, the Kiryat-Ha'Yovel neighbourhood in Jerusalem, was considered as secular for many years. In 2000 the neighbourhood became attractive to the nearby Haredi (ultra-orthodox Jews) group of the “Kol-Torah’ community. Differences in lifestyle led to a collision between the group of “Kol-Torah”, who began “Haredification” processes to change the character of the area to be suitable to Haredim, and the veteran population, who tried to prevent it. Identifying the main engines of organised neighbourhood change and evaluating the difficulties of liberalism dealing with non-autonomous individuals in the housing market sheds light on similar processes occurring in other city centres with diverse population groups