Adding metadata to Orc to support reasoning about grid programs

Following earlier work demonstrating the utility of Orc as a means of specifying and reasoning about grid applications we propose the enhancement of such specifications with metadata that provide a means to extend an Orc specification with implementation oriented information. We argue that such specifications provide a useful refinement step in allowing reasoning about implementation related issues ahead of actual implementation or even prototyping. As examples, we demonstrate how such extended specifications can be used for investigating security related issues and for evaluating the cost of handling grid resource faults. The approach emphasises a semi-formal style of reasoning that makes maximum use of programmer domain knowledge and experience.

Cost-Directed Refactoring for Parallel Erlang Programs

This paper presents a new programming methodology for introducing and tuning parallelism in Erlang programs, using source-level code refactoring from sequential source programs to parallel programs written using our skeleton library, Skel. High-level cost models allow us to predict with reasonable accuracy the parallel performance of the refactored program, enabling programmers to make informed decisions about which refactorings to apply. Using our approach, we demonstrate easily obtainable, significant and scalable speedups of up to 21 on a 24-core machine over the sequential code.

Sequence Effects in the Valuation of Multiple Environmental Programs Using the Contingent Valuation Method

In contingent valuation, the willingness to pay for hypothetical programs may be affected by the order in which programs are presented to respondents. With inclusive lists, economic theory suggests that sequence effects should be expected. However, when policy makers allocate public budgets to several environmental programs, they may be interested in assessing the value of the programs without the valuations being affected by the order in which the programs are presented. Using single-bounded dichotomous choice contingent valuation questions, we show that if respondents have the possibility to revise their willingness-to-pay answers, sequence effects are mitigated. (JEL Q51, Q54)

Virgin Olive Oil: Losses of Antioxidant Polar Phenolic Compounds due to Storage, Packaging, and Culinary Uses

Virgin olive oil is a high quality natural product obtained only by physical means. In addition to triacylglycerols it contains nutritionally important polar and non-polar antioxidant phenols and other bioactive ingredients. The polar fraction is a complex mixture of phenolic acids, simple phenols, derivatives of the glycosides oleuropein and ligstroside, lignans, and flavonoids. These compounds contribute significantly to the stability, flavor, and biological value of virgin olive. In the various stages of production, during storage and in the culinary uses, polar phenols and other valuable bioactive ingredients may be damaged. Oxidation, photo-oxidation, enzymic hydrolysis and heating at frying temperatures have a serious adverse effect. Due to the biological importance of the oil and its unique character, analytical methods have been developed to evaluate antioxidant activity or analyse complex phenol mixtures. These are based on radical scavenging assays and chromatographic techniques. Hyphenated methods are also used including liquid chromatography-mass spectrometry and liquid chromatography-nuclear magnetic resonance spectroscopy.

Culinary Belfast: Soundscaping Food

The Culinary Belfast project is an exploration of the city's food culture through sound. Field recordings and interviews from the kitchens of the city's top restaurants, St George's market and numerous food outlets make up a collection of sounds that tell the story of a city through food.
"Culinary Belfast :Soundscaping Food" collates some of these recordings into an 8 minute composition exploring, on one hand, the verbal articulation of food sounds by the city's chefs and food vendors and, on the other, the more abstract, close up and microscopic sound qualities of processes like chopping, frying and boiling.

Culinary Belfast is part of the Belfast Soundwalks project (www.belfastsoundwalks.org).

Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions

Although Answer Set Programming (ASP) is a powerful framework for declarative problem solving, it cannot in an intuitive way handle situations in which some rules are uncertain, or in which it is more important to satisfy some constraints than others. Possibilistic ASP (PASP) is a natural extension of ASP in which certainty weights are associated with each rule. In this paper we contrast two different views on interpreting the weights attached to rules. Under the first view, weights reflect the certainty with which we can conclude the head of a rule when its body is satisfied. Under the second view, weights reflect the certainty that a given rule restricts the considered epistemic states of an agent in a valid way, i.e. it is the certainty that the rule itself is correct. The first view gives rise to a set of weighted answer sets, whereas the second view gives rise to a weighted set of classical answer sets.

Communicating Answer Set Programs

Answer set programming is a form of declarative programming that has proven very successful in succinctly formulating and solving complex problems. Although mechanisms for representing and reasoning with the combined answer set programs of multiple agents have already been proposed, the actual gain in expressivity when adding communication has not been thoroughly studied. We show that allowing simple programs to talk to each other results in the same expressivity as adding negation-as-failure. Furthermore, we show that the ability to focus on one program in a network of simple programs results in the same expressivity as adding disjunction in the head of the rules.

Answer set programs with optional rules: a possibilistic approach

Many problems in artificial intelligence can be encoded as answer set programs (ASP) in which some rules are uncertain. ASP programs with incorrect rules may have erroneous conclusions, but due to the non-monotonic nature of ASP, omitting a correct rule may also lead to errors. To derive the most certain conclusions from an uncertain ASP program, we thus need to consider all situations in which some, none, or all of the least certain rules are omitted. This corresponds to treating some rules as optional and reasoning about which conclusions remain valid regardless of the inclusion of these optional rules. While a version of possibilistic ASP (PASP) based on this view has recently been introduced, no implementation is currently available. In this paper we propose a simulation of the main reasoning tasks in PASP using (disjunctive) ASP programs, allowing us to take advantage of state-of-the-art ASP solvers. Furthermore, we identify how several interesting AI problems can be naturally seen as special cases of the considered reasoning tasks, including cautious abductive reasoning and conformant planning. As such, the proposed simulation enables us to solve instances of the latter problem types that are more general than what current solvers can handle.