Duality transformations for general bi-isotropic (nonreciprocalchiral) media

The transformation is defined to leave a given bi-isotropic medium invariant, whence it is self-dual in this transformation. It is shown that duality transformations always exist in pairs, labeled as left-hand and right-hand transformations. Self-dual fields are seen to be generalizations of the wave fields E± applied in the analysis of reciprocal chiral media. It is demonstrated that plane wave propagation and reflection problems in bi-isotropic media can be solved easily in terms of self-dual field decompositions. Nonreciprocity is seen to give rise to effects like polarization rotation in reflection, which cannot be interpreted in terms of reciprocal chiral media     

Secure Multi-Party Computation without Agreement

It has recently been shown that authenticated Byzantine agreement, in which more than a third of the parties are corrupted, cannot be securely realized under concurrent or parallel (stateless) composition. This result puts into question any usage of authenticated Byzantine agreement in a setting where many executions take place. In particular, this is true for the whole body of work of secure multi-party protocols in the case that a third or more of the parties are corrupted. This is because these protocols strongly rely on the extensive use of a broadcast channel, which is in turn realized using authenticated Byzantine agreement. We remark that it was accepted folklore that the use of a broadcast channel (or authenticated Byzantine agreement) is actually essential for achieving meaningful secure multi-party computation whenever a third or more of the parties are corrupted. In this paper we show that this folklore is false. We present a mild relaxation of the definition of secure computation allowing abort. Our new definition captures all the central security issues of secure computation, including privacy, correctness and independence of inputs. However, the novelty of the definition is in decoupling the issue of agreement from these issues. We then show that this relaxation suffices for achieving secure computation in a point-to-point network. That is, we show that secure multi-party computation for this definition can be achieved for any number of corrupted parties and without a broadcast channel (or trusted pre-processing phase as required for running authenticated Byzantine agreement). Furthermore, this is achieved by just replacing the broadcast channel in known protocols with a very simple and efficient echo-broadcast protocol. An important corollary of our result is the ability to obtain multi-party protocols that remain secure under composition, without assuming a broadcast channel.     

Plane wave propagation in uniaxial bianisotropic medium

The uniaxial bianisotropic medium is a generalisation of the bi-isotropic and chiral media which recently have been subject to intensive research. Such a medium results, for example, when microscopic helices with parallel axes are positioned in a host dielectric in random locations. Plane wave propagation in such a medium is studied and a simple solution for the dispersion equation is found. Numerical examples for the wave number surfaces of the medium are given.<>     

Electrostatic image theory for two anisotropic half-spaces

An image solution for the canonical electrostatic problem of a point charge in an anisotropic half-space bounded by another anisotropic half-space is presented. The image source is obtained in operator form by using Fourier-transformed Maxwell equations and transmission line theory. After applying Heaviside operator calculus the image operator can be interpreted as a combination of a point charge and a sector of planar charge. The new theory is shown to coincide with the previously known image solutions of less general anisotropic media. In addition to being applicable to any physically feasible anisotropic medium of electrostatics, the method can be used for steady-current conductivity problems via a duality transformation.     

Crafting interaction: The epistemology of modern programming

There is a long tradition in design of discussing materials and the craft of making artefacts. “Smart” and interactive materials affected what constitutes a material. Interaction design is a design activity that creates the appearance and behaviour of information technology, challenged by the illusiveness of interactive materials. With the increased design space of ubiquitous devices, designers can no longer rely on a design process based on known interaction idioms, especially for innovative highly interactive designs. This impedes the design process, because non-interactive materials, by which designers create sketches, storyboards, and mock-up prototypes, do not provide the essential talkbacks needed to make reliable assessments of the design characteristics. Without a well-defined design, the engineering process of artefacts has unclear ends, which are not encompassed in the rational epistemology of engineering. To value the experiential qualities of these artefacts, the prototypes need to be interactive and crafted in code. This paper investigates the materiality of information technology, specifically programming language code from which interactive artefacts are made. A study of users of programming languages investigates how they describe programming language code as a material. If you have a material, it is reasonable, because of the tradition in the material and craft fields, to say you have a craft. Thus, considering code a design material allows the metaphor of craft to be used for the activity of programming.     

Strips of hourly power options—Approximate hedging using average-based forward contracts

We study approximate hedging strategies for a contingent claim consisting of a strip of independent hourly power options. The payoff of the contingent claim is a sum of the contributing hourly payoffs. As there is no forward market for specific hours, the fundamental problem is to find a reasonable hedge using exchange-traded forward contracts, e.g. average-based monthly contracts. The main result is a simple dynamic hedging strategy that reduces a significant part of the variance. The idea is to decompose the contingent claim into mathematically tractable components and to use empirical estimations to derive hedging deltas. Two benefits of the method are that the technique easily extends to more complex power derivatives and that only a few parameters need to be estimated. The hedging strategy based on the decomposition technique is compared with dynamic delta hedging strategies based on local minimum variance hedging, using a correlated traded asset.     

Utility Dependence in Correct and Fair Rational Secret?Sharing

The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that has been studied considerably is that of rational secret sharing. In this setting, the aim is to construct a mechanism (protocol) so that parties behaving rationally have incentive to cooperate and provide their shares in the reconstruction phase, even if each party prefers to be the only one to learn the secret.     

Duality transformation for two-dimensional static problems

A form of duality transformation, applicable to two-dimensional static problems, is formulated. It transforms electrostatic problems into magnetostatic problems by applying, instead of the common duality between the E and H vectors, one between the vectors E and B. The transformation can be easily applied to straight TEM transmission-line geometries. Its use in teaching basic electromagnetics to electrical engineering students is suggested