IWRM challenges in developing countries: lessons from India and elsewhere

Water resource management / Institutional development / Tube wells / Economic aspects / Policy / India

Formalizing Interspousal Transfers of Real and Personal Property in California

In 1984, California had the simplest laws regarding interspousal transmutations of real and personal property of all community property states. Claiming that one\u27s spouse had always referred to his or her separate property as ours could be enough for a court to find that a transmutation from separate to community property had occurred. In 1985, California enacted section 5110.730 of the Civil Code to help rid courts of litigation spawned by easy transmutation laws. By 1990, California\u27s transmutation statute was considered the toughest of all community property states that allow interspousal transmutations. This Comment examines pre-1985 transmutation case law and the legislative history of section 5110.730 of the California Civil Code. It then focuses on the bright-line test announced by the California Supreme Court in Estate of MacDonald v. MacDonald and questions the wisdom of creating a special statute of frauds law for interspousal agreements

Classical Cryptographic Protocols in a Quantum World

Cryptographic protocols, such as protocols for secure function evaluation (SFE), have played a crucial role in the development of modern cryptography. The extensive theory of these protocols, however, deals almost exclusively with classical attackers. If we accept that quantum information processing is the most realistic model of physically feasible computation, then we must ask: what classical protocols remain secure against quantum attackers? Our main contribution is showing the existence of classical two-party protocols for the secure evaluation of any polynomial-time function under reasonable computational assumptions (for example, it suffices that the learning with errors problem be hard for quantum polynomial time). Our result shows that the basic two-party feasibility picture from classical cryptography remains unchanged in a quantum world.Comment: Full version of an old paper in Crypto'11. Invited to IJQI. This is authors' copy with different formattin

A Conceptual Framework for Adapation

This paper presents a white-box conceptual framework for adaptation that promotes a neat separation of the adaptation logic from the application logic through a clear identification of control data and their role in the adaptation logic. The framework provides an original perspective from which we survey archetypal approaches to (self-)adaptation ranging from programming languages and paradigms, to computational models, to engineering solutions

A Conceptual Framework for Adapation

We present a white-box conceptual framework for adaptation. We called it CODA, for COntrol Data Adaptation, since it is based on the notion of control data. CODA promotes a neat separation between application and adaptation logic through a clear identification of the set of data that is relevant for the latter. The framework provides an original perspective from which we survey a representative set of approaches to adaptation ranging from programming languages and paradigms, to computational models and architectural solutions