Paleoenvironmental reconstruction of a Late Quaternary lagoon system in southern Brazil (Jaguaruna region, Santa Catarina state) based on multi-proxy analysis

This paper provides a paleoenvironmental reconstruction of a Late Quaternary lagoon system in the Jaguaruna region of Santa Catarina state, southern Brazil. Integrated results of bulk sedimentary organic matter characterization (delta C-13, delta N-15 and C/N), microfossil (pollen and diatom) and grain-size analysis from three shallow cores (similar to 2.5m depth) allowed us to propose an evolving paleogeographic scenario in this coastal region for the last ca. 5500 cal a BP. The lagoonal system in this area was more extensive during the mid-Holocene than today, with a gradual and continuous lagoon-sea disconnection until the present. We add to the debate regarding relative sea-level (RSL) variations for the Brazilian coast during the Holocene and discuss the importance of sedimentary dynamics for interpreting changes in coastal ecosystems. The multi-proxy analysis suggests that changes in coastal ecosystems could be directly related to local sedimentary processes, which are not necessarily linked to RSL fluctuations and/or to climatic variations. Copyright (c) 2011 John Wiley & Sons, Ltd.

Emergy analysis of oil production from microalgae

The use of microalgae and cyanobacteria for the production of biofuels and other raw materials is considered a very promising sustainable technology due to the high areal productivity, potential for CO2 fixation and use of non-arable land. The production of oil by microalgae in a large scale plant was studied using emergy analysis. The joint transformity calculated for the base scenario was 1.32E + 5 sej/J, the oil transformity was 3.51E + 5 sej/J, the emergy yield ratio (EYR) was 1.09 and environmental loading ratio was 11.10 and the emergy sustainability index (ESI) was 0.10, highlighting some of the key challenges for the technology such as high energy consumption during harvesting, raw material consumption and high capital and operation costs. Alternatives scenarios and the sensitivity to process improvements were also assessed, helping prioritize further research based on sustainability impact. (C) 2012 Elsevier Ltd. All rights reserved.

Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis

A deep theoretical analysis of the graph cut image segmentation framework presented in this paper simultaneously translates into important contributions in several directions. The most important practical contribution of this work is a full theoretical description, and implementation, of a novel powerful segmentation algorithm, GC(max). The output of GC(max) coincides with a version of a segmentation algorithm known as Iterative Relative Fuzzy Connectedness, IRFC. However, GC(max) is considerably faster than the classic IRFC algorithm, which we prove theoretically and show experimentally. Specifically, we prove that, in the worst case scenario, the GC(max) algorithm runs in linear time with respect to the variable M=|C|+|Z|, where |C| is the image scene size and |Z| is the size of the allowable range, Z, of the associated weight/affinity function. For most implementations, Z is identical to the set of allowable image intensity values, and its size can be treated as small with respect to |C|, meaning that O(M)=O(|C|). In such a situation, GC(max) runs in linear time with respect to the image size |C|. We show that the output of GC(max) constitutes a solution of a graph cut energy minimization problem, in which the energy is defined as the a"" (a) norm ayenF (P) ayen(a) of the map F (P) that associates, with every element e from the boundary of an object P, its weight w(e). This formulation brings IRFC algorithms to the realm of the graph cut energy minimizers, with energy functions ayenF (P) ayen (q) for qa[1,a]. Of these, the best known minimization problem is for the energy ayenF (P) ayen(1), which is solved by the classic min-cut/max-flow algorithm, referred to often as the Graph Cut algorithm. We notice that a minimization problem for ayenF (P) ayen (q) , qa[1,a), is identical to that for ayenF (P) ayen(1), when the original weight function w is replaced by w (q) . Thus, any algorithm GC(sum) solving the ayenF (P) ayen(1) minimization problem, solves also one for ayenF (P) ayen (q) with qa[1,a), so just two algorithms, GC(sum) and GC(max), are enough to solve all ayenF (P) ayen (q) -minimization problems. We also show that, for any fixed weight assignment, the solutions of the ayenF (P) ayen (q) -minimization problems converge to a solution of the ayenF (P) ayen(a)-minimization problem (ayenF (P) ayen(a)=lim (q -> a)ayenF (P) ayen (q) is not enough to deduce that). An experimental comparison of the performance of GC(max) and GC(sum) algorithms is included. This concentrates on comparing the actual (as opposed to provable worst scenario) algorithms' running time, as well as the influence of the choice of the seeds on the output.

Nursing diagnoses in trauma victims with fatal outcomes in the emergency scenario

The objective of this study was to identify and analyze the nursing diagnoses that constitute risk factors for death in trauma victims in the first 6 hours post-event. This is a cross-sectional, descriptive and exploratory study using quantitative analysis. A total of 406 patients were evaluated over six months of data collection in a tertiary hospital in the municipality of Sao Paulo, according to an instrument created for this purpose. Of the total, 44 (10.7%) suffered death. Multivariate analysis indicated the nursing diagnoses ineffective respiratory pattern, impaired spontaneous ventilation, risk of bleeding and risk of ineffective gastrointestinal tissue perfusion as risk factors for death and ineffective airway clearance, impaired comfort, and acute pain as protective factors, data that can direct health teams for different interventionist actions faced with the complexity of the trauma.

A quantitative analysis of current security concerns and solutions for cloud computing

The development of cloud computing services is speeding up the rate in which the organizations outsource their computational services or sell their idle computational resources. Even though migrating to the cloud remains a tempting trend from a financial perspective, there are several other aspects that must be taken into account by companies before they decide to do so. One of the most important aspect refers to security: while some cloud computing security issues are inherited from the solutions adopted to create such services, many new security questions that are particular to these solutions also arise, including those related to how the services are organized and which kind of service/data can be placed in the cloud. Aiming to give a better understanding of this complex scenario, in this article we identify and classify the main security concerns and solutions in cloud computing, and propose a taxonomy of security in cloud computing, giving an overview of the current status of security in this emerging technology.