Folk culture and political power: practices and representations of moliceiro culture in Portugal, cultural sociology

This article analyses the painted panels of the moliceiro boat, a traditional working boat of the Ria de Aveiro region of Portugal. The article examines how the painted panels have been invented and reinvented over time. The boat and its panels are contextualized both within the changing socio-economic conditions of the Ria de Aveiro region, and the changing socio-political conditions of Portugal throughout the 20th century and until the present day. The article historically analyses the social significance of ‘moliceiro culture’, examining in particular the power relations it expresses and its ambiguous past and present relationships with the political and the economic powers of the Portuguese state. The article unpacks some of the complexity of the relations that have pertained between public and private, local and national, folk culture and ‘art’, and popular and institutional in the Ria de Aveiro region in particular, and Portugal more generally.

Culture, politics and identity: critical readings on gender in southeast Asia

Indian Journal of Gender Studies October 2012 vol. 19 no. 3 437-467

The influence of relationship quality and culture in the relations between exporter and distributor : the case of portuguese exports to Angola

The objective of this research is to investigate the role of the relationship quality, cooperation and culture between Portuguese companies and their export market intermediaries in Angola. In particular, we aim to understand the importance that the quality of the relationship has in cooperation and the role of cultures in export activities. An important aspect of this study is precisely the fact that it includes an African country, where, in terms of the literature, there is a strong lack of studies. In terms of methodology we opted for qualitative analysis; we present the results of two case studies of Portuguese exporting companies and one case study of Angolan intermediate. In general, the results are that the business relationships are characterized by trust, commitment, cooperation, culture, similar values, as in the past, Angola belonged to Portugal there is easy communication because both countries share the same. Such factors will influence the trade relations between Portuguese exporters and their Angolan distributors.

Telling stories of culture through literature

Grounded on Raymond Williams‘s definition of knowable community as a cultural tool to analyse literary texts, the essay reads the texts D.H.Lawrence wrote while travelling in the Mediterranean (Twilight in Italy, Sea and Sardinia and Etruscan Places) as knowable communities, bringing to the discussion the wide importance of literature not only as an object for aesthetic or textual readings, but also as a signifying practice which tells stories of culture. Departing from some considerations regarding the historical development of the relationship between literature and culture, the essay analyses the ways D. H. Lawrence constructed maps of meaning, where the readers, in a dynamic relation with the texts, apprehend experiences, structures and feelings; putting into perspective Williams‘s theory of culture as a whole way of life, it also analyses the ways the author communicates and organizes these experiences, creating a space of communication and operating at different levels of reality: on the one hand, the reality of the whole way of Italian life, and, on the other hand, the reality of the reader who aspires to make sense and to create an interpretative context where all the information is put, and, also, the reality of the writer in the poetic act of writing. To read these travel writings as knowable communities is to understand them as a form that invents a community with no other existence but that of the literary text. The cultural construction we find in these texts is the result of the selection, and interpretation done by D.H.Lawrence, as well as the product of the author‘s enunciative positions, and of his epistemological and ontological filigrees of existence, structured by the conditions of possibility. In the rearticulation of the text, of the writer and of the reader, in a dynamic and shared process of discursive alliances, we understand that Lawrence tells stories of the Mediterranean through his literary art.

Impact of vehicular traffic emissions on particulate-bound PAHs: levels and associated health risks

Considering vehicular transport as one of the most health‐relevant emission sources of urban air, and with aim to further understand its negative impact on human health, the objective of this work was to study its influence on levels of particulate‐bound PAHs and to evaluate associated health risks. The 16 PAHs considered by USEPA as priority pollutants, and dibenzo[a, l]pyrene associated with fine (PM2.5) and coarse (PM2.5–10) particles were determined. The samples were collected at one urban site, as well as at a reference place for comparison. The results showed that the air of the urban site was more seriously polluted than at the reference one, with total concentrations of 17 PAHs being 2240% and 640% higher for PM2.5 and PM2.5–10, respectively; vehicular traffic was the major emission source at the urban site. PAHs were predominantly associated with PM2.5 (83% to 94% of ΣPAHs at urban and reference site, respectively) with 5 rings PAHs being the most abundant groups of compounds at both sites. The risks associated with exposure to particulate PAHs were evaluated using the TEF approach. The estimated value of lifetime lung cancer risks exceeded the health‐based guideline levels, thus demonstrating that exposure to PM2.5‐bound PAHs at levels found at urban site might cause potential health risks. Furthermore, the results showed that evaluation of benzo[a] pyrene (regarded as a marker of the genotoxic and carcinogenic PAHs) alone would probably underestimate the carcinogenic potential of the studied PAH mixtures.

Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

Known algorithms capable of scheduling implicit-deadline sporadic tasks over identical processors at up to 100% utilisation invariably involve numerous preemptions and migrations. To the challenge of devising a scheduling scheme with as few preemptions and migrations as possible, for a given guaranteed utilisation bound, we respond with the algorithm NPS-F. It is configurable with a parameter, trading off guaranteed schedulable utilisation (up to 100%) vs preemptions. For any possible configuration, NPS-F introduces fewer preemptions than any other known algorithm matching its utilisation bound. A clustered variant of the algorithm, for systems made of multicore chips, eliminates (costly) off-chip task migrations, by dividing processors into disjoint clusters, formed by cores on the same chip (with the cluster size being a parameter). Clusters are independently scheduled (each, using non-clustered NPS-F). The utilisation bound is only moderately affected. We also formulate an important extension (applicable to both clustered and non-clustered NPS-F) which optimises the supply of processing time to executing tasks and makes it more granular. This reduces processing capacity requirements for schedulability without increasing preemptions.

An improved preemption delay upper bound for floating non-preemptive region

In embedded systems, the timing behaviour of the control mechanisms are sometimes of critical importance for the operational safety. These high criticality systems require strict compliance with the offline predicted task execution time. The execution of a task when subject to preemption may vary significantly in comparison to its non-preemptive execution. Hence, when preemptive scheduling is required to operate the workload, preemption delay estimation is of paramount importance. In this paper a preemption delay estimation method for floating non-preemptive scheduling policies is presented. This work builds on [1], extending the model and optimising it considerably. The preemption delay function is subject to a major tightness improvement, considering the WCET analysis context. Moreover more information is provided as well in the form of an extrinsic cache misses function, which enables the method to provide a solution in situations where the non-preemptive regions sizes are small. Finally experimental results from the implementation of the proposed solutions in Heptane are provided for real benchmarks which validate the significance of this work.

The utilization bound of non-preemptive rate-monotonic scheduling in controller area networks is 25%

Consider a distributed computer system comprising many computer nodes, each interconnected with a controller area network (CAN) bus. We prove that if priorities to message streams are assigned using rate-monotonic (RM) and if the requested capacity of the CAN bus does not exceed 25% then all deadlines are met.

Finding an upper bound on the increase in execution time due to contention on the memory bus in COTS-based multicore systems

Contention on the memory bus in COTS based multicore systems is becoming a major determining factor of the execution time of a task. Analyzing this extra execution time is non-trivial because (i) bus arbitration protocols in such systems are often undocumented and (ii) the times when the memory bus is requested to be used are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. We present a method for finding an upper bound on the extra execution time of a task due to contention on the memory bus in COTS based multicore systems. This method makes no assumptions on the bus arbitration protocol (other than assuming that it is work-conserving).

Conjecture about global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks: the utilization bound of SM-US(sqrt(2)-1) is sqrt(2)-1

Consider global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks. I conjecture that the utilization bound of SM-US(√2−1) is √2-1.

Calculating an upper bound on the finishing time of a group of threads executing on a GPU: a preliminary case study

Graphics processor units (GPUs) today can be used for computations that go beyond graphics and such use can attain a performance that is orders of magnitude greater than a normal processor. The software executing on a graphics processor is composed of a set of (often thousands of) threads which operate on different parts of the data and thereby jointly compute a result which is delivered to another thread executing on the main processor. Hence the response time of a thread executing on the main processor is dependent on the finishing time of the execution of threads executing on the GPU. Therefore, we present a simple method for calculating an upper bound on the finishing time of threads executing on a GPU, in particular NVIDIA Fermi. Developing such a method is nontrivial because threads executing on a GPU share hardware resources at very fine granularity.

The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50%

Consider the problem of scheduling a set of sporadically arriving implicit-deadline tasks to meet deadlines on a uniprocessor. Static-priority scheduling is considered using the slack-monotonic priority-assignment scheme. We prove that its utilization bound is 50%.

Global static-priority preemptive multiprocessor scheduling with utilization bound 38%

Consider the problem of scheduling real-time tasks on a multiprocessor with the goal of meeting deadlines. Tasks arrive sporadically and have implicit deadlines, that is, the deadline of a task is equal to its minimum inter-arrival time. Consider this problem to be solved with global static-priority scheduling. We present a priority-assignment scheme with the property that if at most 38% of the processing capacity is requested then all deadlines are met.

The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%

This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline although the requested capacity is arbitrary close to 50%.

Levels and risks of particulate-bound PAHs in indoor air influenced by tobacco smoke: a field measurement

Considering tobacco smoke as one of the most health-relevant indoor sources, the aim of this work was to further understand its negative impacts on human health. The specific objectives of this work were to evaluate the levels of particulate-bound PAHs in smoking and non-smoking homes and to assess the risks associated with inhalation exposure to these compounds. The developed work concerned the application of the toxicity equivalency factors approach (including the estimation of the lifetime lung cancer risks, WHO) and the methodology established by USEPA (considering three different age categories) to 18 PAHs detected in inhalable (PM10) and fine (PM2.5) particles at two homes. The total concentrations of 18 PAHs (ΣPAHs) was 17.1 and 16.6 ng m−3 in PM10 and PM2.5 at smoking home and 7.60 and 7.16 ng m−3 in PM10 and PM2.5 at non-smoking one. Compounds with five and six rings composed the majority of the particulate PAHs content (i.e., 73 and 78 % of ΣPAHs at the smoking and non-smoking home, respectively). Target carcinogenic risks exceeded USEPA health-based guideline at smoking home for 2 different age categories. Estimated values of lifetime lung cancer risks largely exceeded (68–200 times) the health-based guideline levels at both homes thus demonstrating that long-term exposure to PAHs at the respective levels would eventually cause risk of developing cancer. The high determined values of cancer risks in the absence of smoking were probably caused by contribution of PAHs from outdoor sources.