Abstract
This paper presents the results of a qualitative study of public transport users and car users in order to obtain a deeper understanding of travellers' attitudes towards transport and to explore perceptions of public transport service quality. The key findings indicate that in order to increase public transport usage, the service should be designed in a way that accommodates the levels of service required by customers and by doing so, attract potential users. Furthermore, the choice of transport is influenced by several factors, such as individual characteristics and lifestyle, the type of journey, the perceived service performance of each transport mode and situational variables. This suggests the need for segmentation taking into account travel attitudes and behaviours. Policies which aim to influence car usage should be targeted at the market segments that are most motivated to change and willing to reduce frequency of car use.

Abstract

Abstract
Coarse-grained reconfigurable computing architectures vary widely in the number and characteristics of the processing elements (cells) and routing topologies used. In order to exploit several different topologies, a place and route framework, able to deal with such vast design exploration space, is of paramount importance. Bearing this in mind, this paper proposes a placement scheme able to target different topologies when considering data-driven reconfigurable architectures. Our approach uses graph models for the target architecture and for the dataflow representation of the application being mapped. Our placement algorithm is guided by a Depth-First Traversal in both the architecture and the application graphs. Two versions of the placement algorithm with respectively O(e) and O(e + n(3)) computational complexities are presented, where e is the number of edges in the dataflow representation of the application and n is the number of cells in the graph model of the architecture. The achieved experimental results show that our approach can be useful to exploit different interconnect topologies as far as coarse-grained reconfigurable computing architectures are concerned.

Abstract
Face detection is a problem in image processing that has been extensively studied in the last decades. This fact is justified due to the innumerous applications this subject has in computer vision. In this paper we present a technique to detect a face in an image where several persons may be. The images were recorded from news broadcasts from different networks. First, a model based on normalized RGB color space was built to define a skin color model: skin regions were selected from several face images and extracted statistical characteristics. Second, each pixel of the image was classified in two categories: skin and not skin. Third, the face region was identified. A MATLAB function was created to detect faces of any size, achieving high detection rates.

Abstract
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomial-time-bounded Kolmogorov complexity and traditional Kolmogorov complexity. We show unconditionally how to probabilistically find satisfying assignments for formulas that have at least one assignment of logarithmic depth. The converse holds under a standard hardness assumption though fails if BPP = FewP = EXP. We also show that assuming good pseudorandom generators one cannot increase the depth of a string efficiently.

Abstract
This paper presents a new and retargetable method to identify patterns of instructions with direct support in coarsegrained processing elements (PEs). The method uses a three-address code SSA (static single assignment) representation of the kernel being mapped and Rewriting Logic for template matching and algebraic optimizations. This approach is able to identify sets of SSA instructions that can be mapped to different PE complexities available in coarsegrained reconfigurable computing architectures. As a proof of concept, results of the approach with a number of benchmark kernels, as far as coverage of template instructions is concerned, are included. © 2007 IEEE.