A profile-based tool for finding pipeline parallelism in sequential programs

Traditional static analysis fails to auto-parallelize programs with a complex control and data flow. Furthermore, thread-level parallelism in such programs is often restricted to pipeline parallelism, which can be hard to discover by a programmer. In this paper we propose a tool that, based on profiling information, helps the programmer to discover parallelism. The programmer hand-picks the code transformations from among the proposed candidates which are then applied by automatic code transformation techniques.

This paper contributes to the literature by presenting a profiling tool for discovering thread-level parallelism. We track dependencies at the whole-data structure level rather than at the element level or byte level in order to limit the profiling overhead. We perform a thorough analysis of the needs and costs of this technique. Furthermore, we present and validate the belief that programs with complex control and data flow contain significant amounts of exploitable coarse-grain pipeline parallelism in the program’s outer loops. This observation validates our approach to whole-data structure dependencies. As state-of-the-art compilers focus on loops iterating over data structure members, this observation also explains why our approach finds coarse-grain pipeline parallelism in cases that have remained out of reach for state-of-the-art compilers. In cases where traditional compilation techniques do find parallelism, our approach allows to discover higher degrees of parallelism, allowing a 40% speedup over traditional compilation techniques. Moreover, we demonstrate real speedups on multiple hardware platforms.

Living in Exospace: ISS and Discovery 1

The concept of exospace, as an alternative liveable structure, is discussed in this article to improve our comprehension of architectural space. Exospace is a man-made space designed for living beyond Earth’s atmosphere. Humankind has developed outerspace technologies to build the International Space Station as a significant experiment in exospace design. The ISS is a new building type for scientific experiments and for testing human existence in outerspace.

A fictional example of exospace, on the other hand, is Discovery 1 spaceship in Stanley Kubrick’s legendary science fiction film 2001: A Space Odyssey (1968). It is a ship travelling to Jupiter with a crew of five astronauts and HAL9000, the artificial intelligence controlling the ship. I will first discuss the ISS, and the space stations built before, from a spatial point of view. A spatial study of Discovery 1 will follow. Finally, through an understanding of exospace, I will return to architectural space with a critical appraisal. The comparison of architectural space with exospace will add to the discussion of space theories from a technological approach.

Exospace creates an alternative reality to architectural space. Architects cannot consider exospaces without comparing them with the spaces they design on Earth. The different context of outerspace shows that a work of terrestrial architecture is very much dependent on its context. A building is not an ‘object’ that can be located anywhere; it is designed for its site. Architectural space is a real, material, continuous, static and extroverted habitable space designed for and used in the specific physical context of Earth. The existence of exospace in science opens a new discussion in architectural theory, both terrestrial and extraterrestrial.

Behaviours in video

With a significant increment of the number of digital cameras used for various purposes, there is a demanding call for advanced video analysis techniques that can be used to systematically interpret and understand the semantics of video contents, which have been recorded in security surveillance, intelligent transportation, health care, video retrieving and summarization. Understanding and interpreting human behaviours based on video analysis have observed competitive challenges due to non-rigid human motion, self and mutual occlusions, and changes of lighting conditions. To solve these problems, advanced image and signal processing technologies such as neural network, fuzzy logic, probabilistic estimation theory and statistical learning have been overwhelmingly investigated.

The Computational Complexity of Dominance and Consistency in CP-Nets

We investigate the computational complexity of testing dominance and consistency in CP-nets. Previously, the complexity of dominance has been determined for restricted classes in which the dependency graph of the CP-net is acyclic. However, there are preferences of interest that define cyclic dependency graphs; these are modeled with general CP-nets. In our main results, we show here that both dominance and consistency for general CP-nets are PSPACE-complete. We then consider the concept of strong dominance, dominance equivalence and dominance incomparability, and several notions of optimality, and identify the complexity of the corresponding decision problems. The reductions used in the proofs are from STRIPS planning, and thus reinforce the earlier established connections between both areas.

Relevance and truthfulness in information correction and fusion

A general approach to information correction and fusion for belief functions is proposed, where not only may the information items be irrelevant, but sources may lie as well. We introduce a new correction scheme, which takes into account uncertain metaknowledge on the source’s relevance and truthfulness and that generalizes Shafer’s discounting operation. We then show how to reinterpret all connectives of Boolean logic in terms of source behavior assumptions with respect to relevance and truthfulness. We are led to generalize the unnormalized Dempster’s rule to all Boolean connectives, while taking into account the uncertainties pertaining to assumptions concerning the behavior of sources. Eventually, we further extend this approach to an even more general setting, where source behavior assumptions do not have to be restricted to relevance and truthfulness.We also establish the commutativity property between correction and fusion processes, when the behaviors of the sources are independent.

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.

Altered long-range alpha-band synchronization during visual short-term memory retention in children born very preterm

Children born very preterm, even when intelligence is broadly normal, often experience selective difficulties in executive function and visual-spatial processing. Development of structural cortical connectivity is known to be altered in this group, and functional magnetic resonance imaging (fMRI) evidence indicates that very preterm children recruit different patterns of functional connectivity between cortical regions during cognition. Synchronization of neural oscillations across brain areas has been proposed as a mechanism for dynamically assigning functional coupling to support perceptual and cognitive processing, but little is known about what role oscillatory synchronization may play in the altered neurocognitive development of very preterm children. To investigate this, we recorded magnetoencephalographic (MEG) activity while 7-8 year old children born very preterm and age-matched full-term controls performed a visual short-term memory task. Very preterm children exhibited reduced long-range synchronization in the alpha-band during visual short-term memory retention, indicating that cortical alpha rhythms may play a critical role in altered patterns functional connectivity expressed by this population during cognitive and perceptual processing. Long-range alpha-band synchronization was also correlated with task performance and visual-perceptual ability within the very preterm group, indicating that altered alpha oscillatory mechanisms mediating transient functional integration between cortical regions may be relevant to selective problems in neurocognitive development in this vulnerable population at school age.

Predicting IQ of biologically "at risk" children from age 3 to school entry:sensitivity and specificity of the Stanford-Binet Intelligence Scale IV

Predictive validity of the Stanford-Binet Intelligence Scale Fourth Edition (S-B IV) from age 3 years to ages 4-5 years was evaluated with biologically "at risk" children without major sensory or motor impairments (n = 236). Using the standard scoring, children with full scale IQ <or = 84 on the Wechsler Preschool and Primary Scale of Intelligence at age 4-5 years were poorly identified (sensitivity 54%) from the composite S-B IV score at age 3. However, sensitivity improved greatly to 78% by including as a predictor the number of subtests the child was actually able to perform at age 3 years. Measures from the Home Screening Questionnaire and ratings of mother-child interaction further improved sensitivity to 83%. The standard method for calculating the composite score on the S-B IV excludes subtests with a raw score of 0, which overestimates cognitive functioning in young biologically high risk children. Accuracy of early identification was improved significantly by considering the number of subtests the child did not perform at age 3 years.

Targeting distributed systems in FastFlow

FastFlow is a structured parallel programming framework targeting shared memory multi-core architectures. In this paper we introduce a FastFlow extension aimed at supporting also a network of multi-core workstations. The extension supports the execution of FastFlow programs by coordinating-in a structured way-the fine grain parallel activities running on a single workstation. We discuss the design and the implementation of this extension presenting preliminary experimental results validating it on state-of-the-art networked multi-core nodes. © 2013 Springer-Verlag.