Properties and Applications of Shape Recipes

In low-level vision, the representation of scene properties such as shape, albedo, etc., are very high dimensional as they have to describe complicated structures. The approach proposed here is to let the image itself bear as much of the representational burden as possible. In many situations, scene and image are closely related and it is possible to find a functional relationship between them. The scene information can be represented in reference to the image where the functional specifies how to translate the image into the associated scene. We illustrate the use of this representation for encoding shape information. We show how this representation has appealing properties such as locality and slow variation across space and scale. These properties provide a way of improving shape estimates coming from other sources of information like stereo

The Skyrme energy functional and low lying 2+ states in Sn, Cd and Te isotopes

We study the predictive power of Skyrme forces with respect to low lying quadrupole spectra along the chains of Sn, Cd, and Te isotopes. Excitation energies and B(E2) values for the lowest quadrupole states are computed from a collective Schroedinger equation which as deduced through collective path generated by constraint Skyrme-Hartree-Fock (SHF) plus self-consistent cranking for the dynamical response. We compare the results from four different Skyrme forces, all treated with two different pairing forces (volume versus density-dependent pairing). The region around the neutron shell closure N=82 is very sensitive to changes in the Skyrme while the mid-shell isotopes in the region N<82 depend mainly on the adjustment of pairing. The neutron rich isotopes are most sensitive and depend on both aspects

Modelling extrudate expansion in a twin-screw food extrusion cooking process through dimensional analysis methodology

A new phenomenological modelling framework is proposed to correlate the extrudate expansion and extrusion process parameters through dimensional analysis methodology. As dimensional analysis is independent of system or equipment structure, the proposed equation may provide a general expression for the extrudate expansion behaviours and process operation conditions. This work includes extrusion cooking trials, model development and data analysis

Polyols in confectionery: the route to sugar-free, reduced sugar and reduced calorie confectionery

Polyol-containing confectionery offers considerable advantages over traditional sucrose-based confectionery in terms of reduced energy content and reduced cariogenicity. However, over-consumption of polyol confectionery may lead to gastrointestinal symptoms in some individuals. Rather than consider this as a distinct disadvantage to the consumer, this article discusses how careful consideration of the physico-chemical properties of polyols and advances in product development and formulation can provide suitable polyol-based products for the consumer. Furthermore. food legislation and ingredient pricing issues are just some of the factors that must be taken into account when designing new polyol-containing products if their functional benefits and good product quality are to be delivered to the consumer

Context as foundation for a semantic desktop

Adoption of semantic web technologies and principles presents an opportunity to change the conceptual model of desktop computing. Moving from a traditional position where the desktop is largely tied to a specific computational device, a semantic desktop could exist as a broad, networked space defined relative to the user. In this position paper we argue that personal, computing, and knowledge contexts are the appropriate means by which to define and shape the desktop space, and that collectively they provide the foundation for novel functionality in a semantic desktop

Recipes for spin-based quantum computing

Technological growth in the electronics industry has historically been measured by the number of transistors that can be crammed onto a single microchip. Unfortunately, all good things must come to an end; spectacular growth in the number of transistors on a chip requires spectacular reduction of the transistor size. For electrons in semiconductors, the laws of quantum mechanics take over at the nanometre scale, and the conventional wisdom for progress (transistor cramming) must be abandoned. This realization has stimulated extensive research on ways to exploit the spin (in addition to the orbital) degree of freedom of the electron, giving birth to the field of spintronics. Perhaps the most ambitious goal of spintronics is to realize complete control over the quantum mechanical nature of the relevant spins. This prospect has motivated a race to design and build a spintronic device capable of complete control over its quantum mechanical state, and ultimately, performing computations: a quantum computer. In this tutorial we summarize past and very recent developments which point the way to spin-based quantum computing in the solid-state. After introducing a set of basic requirements for any quantum computer proposal, we offer a brief summary of some of the many theoretical proposals for solid-state quantum computers. We then focus on the Loss-DiVincenzo proposal for quantum computing with the spins of electrons confined to quantum dots. There are many obstacles to building such a quantum device. We address these, and survey recent theoretical, and then experimental progress in the field. To conclude the tutorial, we list some as-yet unrealized experiments, which would be crucial for the development of a quantum-dot quantum computer.Comment: 45 pages, 12 figures (low-res in preprint, high-res in journal) tutorial review for Nanotechnology; v2: references added and updated, final version to appear in journa

A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs

A number of novel programming languages and libraries have been proposed that offer simpler-to-use models of concurrency than threads. It is challenging, however, to devise execution models that successfully realise their abstractions without forfeiting performance or introducing unintended behaviours. This is exemplified by SCOOP---a concurrent object-oriented message-passing language---which has seen multiple semantics proposed and implemented over its evolution. We propose a "semantics workbench" with fully and semi-automatic tools for SCOOP, that can be used to analyse and compare programs with respect to different execution models. We demonstrate its use in checking the consistency of semantics by applying it to a set of representative programs, and highlighting a deadlock-related discrepancy between the principal execution models of the language. Our workbench is based on a modular and parameterisable graph transformation semantics implemented in the GROOVE tool. We discuss how graph transformations are leveraged to atomically model intricate language abstractions, and how the visual yet algebraic nature of the model can be used to ascertain soundness.Comment: Accepted for publication in the proceedings of FASE 2016 (to appear