Merging Knowledge Bases in Possibilistic Logic by Lexicographic Aggregation

Belief merging is an important but difficult problem in Artificial Intelligence, especially when sources of information are pervaded with uncertainty. Many merging operators have been proposed to deal with this problem in possibilistic logic, a weighted logic which is powerful for handling inconsistency and deal-ing with uncertainty. They often result in a possibilistic knowledge base which is a set of weighted formulas. Although possibilistic logic is inconsistency tolerant, it suffers from the well-known "drowning effect". Therefore, we may still want to obtain a consistent possibilistic knowledge base as the result of merging. In such a case, we argue that it is not always necessary to keep weighted information after merging. In this paper, we define a merging operator that maps a set of possibilistic knowledge bases and a formula representing the integrity constraints to a classical knowledge base by using lexicographic ordering. We show that it satisfies nine postulates that generalize basic postulates for propositional merging given in [11]. These postulates capture the principle of minimal change in some sense. We then provide an algorithm for generating the resulting knowledge base of our merging operator. Finally, we discuss the compatibility of our merging operator with propositional merging and establish the advantage of our merging operator over existing semantic merging operators in the propositional case.

Living is Information Processing: From Molecules to Global Systems

We extend the concept that life is an informational phenomenon, at every level of organisation, from molecules to the global ecological system. According to this thesis: (a) living is information processing, in which memory is maintained by both molecular states and ecological states as well as the more obvious nucleic acid coding; (b) this information processing has one overall function-to perpetuate itself; and (c) the processing method is filtration (cognition) of, and synthesis of, information at lower levels to appear at higher levels in complex systems (emergence). We show how information patterns, are united by the creation of mutual context, generating persistent consequences, to result in 'functional information'. This constructive process forms arbitrarily large complexes of information, the combined effects of which include the functions of life. Molecules and simple organisms have already been measured in terms of functional information content; we show how quantification may be extended to each level of organisation up to the ecological. In terms of a computer analogy, life is both the data and the program and its biochemical structure is the way the information is embodied. This idea supports the seamless integration of life at all scales with the physical universe. The innovation reported here is essentially to integrate these ideas, basing information on the 'general definition' of information, rather than simply the statistics of information, thereby explaining how functional information operates throughout life. © 2013 Springer Science+Business Media Dordrecht.

Process of debonding in RC beams shear-strengthened with FRP U-strips or side strips

Reinforced concrete (RC) beams may be strengthened for shear using externally bonded fiber reinforced polymer (FRP) composites in the form of side bonding, U-jacketing or complete wrapping. The shear failure of almost all RC beams shear-strengthened with side bonded FRP and the majority of those strengthened with FRP U-jackets, is due to debonding of the FRP. The bond behavior between the externally-bonded FRP reinforcement (referred to as FRP strips for simplicity) and the concrete substrate therefore plays a crucial role in the failure process of these beams. Despite extensive research in the past decade, there is still a lack of understanding of how debonding of FRP strips in such a beam propagates and how the debonding process affects its shear behavior. This paper presents an analytical study on the progressive debonding of FRP strips in such strengthened beams. The complete debonding process is modeled and the contribution of the FRP strips to the shear capacity of the beam is quantified. The validity of the analytical solution is verified by comparing its predictions with numerical results from a finite element analysis. This analytical treatment represents a significant step forward in understanding how interaction between FRP strips, steel stirrups and concrete affects the shear resistance of RC beams shear-strengthened with FRP strips.

A generalized functional response for predators that switch between multiple prey species

We develop a theory for the food intake of a predator that can switch between multiple prey species. The theory addresses empirical observations of prey switching and is based on the behavioural assumption that a predator tends to continue feeding on prey that are similar to the prey it has consumed last, in terms of, e.g., their morphology, defences, location, habitat choice, or behaviour. From a predator's dietary history and the assumed similarity relationship among prey species, we derive a general closed-form multi-species functional response for describing predators switching between multiple prey species. Our theory includes the Holling type II functional response as a special case and makes consistent predictions when populations of equivalent prey are aggregated or split. An analysis of the derived functional response enables us to highlight the following five main findings. (1) Prey switching leads to an approximate power-law relationship between ratios of prey abundance and prey intake, consistent with experimental data. (2) In agreement with empirical observations, the theory predicts an upper limit of 2 for the exponent of such power laws. (3) Our theory predicts deviations from power-law switching at very low and very high prey-abundance ratios. (4) The theory can predict the diet composition of a predator feeding on multiple prey species from diet observations for predators feeding only on pairs of prey species. (5) Predators foraging on more prey species will show less pronounced prey switching than predators foraging on fewer prey species, thus providing a natural explanation for the known difficulties of observing prey switching in the field. (C) 2013 Elsevier Ltd. All rights reserved.

Autonomic scheduling of tasks from data parallel patterns to CPU/GPU core mixes

We propose a methodology for optimizing the execution of data parallel (sub-)tasks on CPU and GPU cores of the same heterogeneous architecture. The methodology is based on two main components: i) an analytical performance model for scheduling tasks among CPU and GPU cores, such that the global execution time of the overall data parallel pattern is optimized; and ii) an autonomic module which uses the analytical performance model to implement the data parallel computations in a completely autonomic way, requiring no programmer intervention to optimize the computation across CPU and GPU cores. The analytical performance model uses a small set of simple parameters to devise a partitioning-between CPU and GPU cores-of the tasks derived from structured data parallel patterns/algorithmic skeletons. The model takes into account both hardware related and application dependent parameters. It computes the percentage of tasks to be executed on CPU and GPU cores such that both kinds of cores are exploited and performance figures are optimized. The autonomic module, implemented in FastFlow, executes a generic map (reduce) data parallel pattern scheduling part of the tasks to the GPU and part to CPU cores so as to achieve optimal execution time. Experimental results on state-of-the-art CPU/GPU architectures are shown that assess both performance model properties and autonomic module effectiveness. © 2013 IEEE.

Histogram of oriented gradients front end processing: An FPGA based processor approach

The Field Programmable Gate Array (FPGA) implementation of the commonly used Histogram of Oriented Gradients (HOG) algorithm is explored. The HOG algorithm is employed to extract features for object detection. A key focus has been to explore the use of a new FPGA-based processor which has been targeted at image processing. The paper gives details of the mapping and scheduling factors that influence the performance and the stages that were undertaken to allow the algorithm to be deployed on FPGA hardware, whilst taking into account the specific IPPro architecture features. We show that multi-core IPPro performance can exceed that of against state-of-the-art FPGA designs by up to 3.2 times with reduced design and implementation effort and increased flexibility all on a low cost, Zynq programmable system.