Ctenosaura similis (Black Spiny-Tailed Iguana), ,i>Gopherus Polyphemus (Gopher Tortoise) Concurrent Burrow Use

Ctenosaura similis is exotic to Florida (Meshaka et al. 2004. The Exotic Amphibians and Reptiles of Florida, Krieger Publ. Co., Malabar, Florida. 155 pp.), whereas Gopherus polyphemus is listed as a species of special concern by the state of Florida (Florida Wildlife Code Chap. 39 F.A.C.), and as a threatened species by the Florida Committee on Rare and Endangered Plants and Animals (FCREPA) (Moler 1992. Rare and Endangered Biota of Florida: Volume III, Reptiles and Amphibians. University Press of Florida, Gainesville, Florida. 291 pp.).

Efficient Placement of Fault Indicators in an Actual Distribution System Using Evolutionary Computing

This paper proposes an evolutionary computing strategy to solve the problem of fault indicator (FI) placement in primary distribution feeders. More specifically, a genetic algorithm (GA) is employed to search for an efficient configuration of FIs, located at the best positions on the main feeder of a real-life distribution system. Thus, the problem is modeled as one of optimization, aimed at improving the distribution reliability indices, while, at the same time, finding the least expensive solution. Based on actual data, the results confirm the efficiency of the GA approach to the FI placement problem.

ORAL MUCOSITIS PREVENTION BY LOW-LEVEL LASER THERAPY IN HEAD-AND-NECK CANCER PATIENTS UNDERGOING CONCURRENT CHEMORADIOTHERAPY: A PHASE III RANDOMIZED STUDY

Purpose: Oral mucositis is a major complication of concurrent chemoradiotherapy (CRT) in head-and-neck cancer patients. Low-level laser (LLL) therapy is a promising preventive therapy. We aimed to evaluate the efficacy of LLL therapy to decrease severe oral mucositis and its effect on RT interruptions. Methods and Materials: In the present randomized, double-blind, Phase III study, patients received either gallium-aluminum-arsenide LLL therapy 2.5 J/cm(2) or placebo laser, before each radiation fraction. Eligible patients had to have been diagnosed with squamous cell carcinoma or undifferentiated carcinoma of the oral cavity, pharynx, larynx, or metastases to the neck with an unknown primary site. They were treated with adjuvant or definitive CRT, consisting of conventional RT 60-70 Gy (range, 1.8-2.0 Gy/d, 5 times/wk) and concurrent cisplatin. The primary endpoints were the oral mucositis severity in Weeks 2, 4, and 6 and the number of RT interruptions because of mucositis. The secondary endpoints included patient-reported pain scores. To detect a decrease in the incidence of Grade 3 or 4 oral mucositis from 80% to 50%, we planned to enroll 74 patients. Results: A total of 75 patients were included, and 37 patients received preventive LLL therapy. The mean delivered radiation dose was greater in the patients treated with LLL (69.4 vs. 67.9 Gy, p = .03). During CRT, the number of patients diagnosed with Grade 3 or 4 oral mucositis treated with LLL vs. placebo was 4 vs. 5 (Week 2, p = 1.0), 4 vs. 12 (Week 4, p = .08), and 8 vs. 9 (Week 6, p = 1.0), respectively. More of the patients treated with placebo had RT interruptions because of mucositis (6 vs. 0, p = .02). No difference was detected between the treatment arms in the incidence of severe pain. Conclusions: LLL therapy was not effective in reducing severe oral mucositis, although a marginal benefit could not be excluded. It reduced RT interruptions in these head-and-neck cancer patients, which might translate into improved CRT efficacy. (C) 2012 Elsevier Inc.

Concurrent crack and powder cocaine users from Sao Paulo: Do they represent a different group?

Abstract Background Cocaine abuse is a serious and socially damaging illegal drug problem. Different routes of administration are associated with a specific progression of use, different degrees of abuse liability, propensity for dependence and treatment response. There have been relatively few studies comparing different cocaine users groups and no studies into the characterization of the group of individuals reporting concurrent use of powder cocaine and crack cocaine. Methods Six hundred and ninety-nine cocaine users were assessed during the period August 1997 to October 1998 in one outpatient and six inpatient clinics located in the São Paulo, Brazil. Patients were interviewed using a structured questionnaire schedule in Portuguese, designed specifically for the Brazilian population. The statistical analyses were performed using either ANOVA or a chi-squared test and focusing on their preferred form of use/route of administration and other variables. Results For 83% of the variables tested in this study, the Dual Users subgroup (using both powder and crack cocaine) demonstrated statistical differences from the single drug user subgroups. Those differences include the initiation of cocaine, the abuse of other illicit drugs, and rates of criminal history. Conclusion These data suggest cocaine-dependent individuals who report use of both powder and crack cocaine are an at least partially, distinct subgroup. However, further studies will be necessary to confirm this and to determine if they also show a different treatment response.

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.

Computing inverse optical flow

[EN] We propose four algorithms for computing the inverse optical flow between two images. We assume that the forward optical flow has already been obtained and we need to estimate the flow in the backward direction. The forward and backward flows can be related through a warping formula, which allows us to propose very efficient algorithms. These are presented in increasing order of complexity. The proposed methods provide high accuracy with low memory requirements and low running times.In general, the processing reduces to one or two image passes. Typically, when objects move in a sequence, some regions may appear or disappear. Finding the inverse flows in these situations is difficult and, in some cases, it is not possible to obtain a correct solution. Our algorithms deal with occlusions very easy and reliably. On the other hand, disocclusions have to be overcome as a post-processing step. We propose three approaches for filling disocclusions. In the experimental results, we use standard synthetic sequences to study the performance of the proposed methods, and show that they yield very accurate solutions. We also analyze the performance of the filling strategies. 

A PDE model for computing the optical flow

[EN] In this paper we present a new model for optical flow calculation using a variational formulation which preserves discontinuities of the flow much better than classical methods. We study the Euler-Lagrange equations asociated to the variational problem. In the case of quadratic energy, we show the existence and uniqueness of the corresponding evolution problem. Since our method avoid linearization in the optical flow constraint, it can recover large displacement in the scene. We avoid convergence to irrelevant local minima by embedding our method into a linear scale-space framework and using a focusing strategy from coarse to fine scales.

Teaching and learning stance in specialized English for computing. A corpus linguistics approach

[EN]The use of large corpora in the study of languages is a well established tradition. In the same vein, scholarship is also well represented in the case of the study of corpora for making grammars of languages. This is the case of the COBUILD grammar and dictionary and the case of the Longman Grammar of Spoken and Written English. This means that corpora have been analyzed in order to identify patterns in languages that can be later practised by learners following those patterns described and exemplified with real instances.

Green Cloud Computing: una rassegna comparativa

La rapida crescita di Internet e del numero di host connessi sta portando sempre di più alla nascita di nuove forme di tecnlogie ed applicazioni serverside, facendo del client un thin-client. Il Cloud Computing offre una valida piattaforma a queste nuove tecnologie, ma esso si deve confrontare con diverse problematiche, fra cui la richiesta energetica sempre più crescente, che si ripercuote su un'inevitabile aumento dei gas serra prodotti indirettamente. In questa tesi analizzeremo i problemi energetici legati al Cloud Computing e le possibili soluzioni, andando infine a creare una tassonomia fra i diversi Cloud Computing più importanti sul mercato attuale.

Expressiveness of Concurrent Languages

The aim of this thesis is to go through different approaches for proving expressiveness properties in several concurrent languages. We analyse four different calculi exploiting for each one a different technique. We begin with the analysis of a synchronous language, we explore the expressiveness of a fragment of CCS! (a variant of Milner's CCS where replication is considered instead of recursion) w.r.t. the existence of faithful encodings (i.e. encodings that respect the behaviour of the encoded model without introducing unnecessary computations) of models of computability strictly less expressive than Turing Machines. Namely, grammars of types 1,2 and 3 in the Chomsky Hierarchy. We then move to asynchronous languages and we study full abstraction for two Linda-like languages. Linda can be considered as the asynchronous version of CCS plus a shared memory (a multiset of elements) that is used for storing messages. After having defined a denotational semantics based on traces, we obtain fully abstract semantics for both languages by using suitable abstractions in order to identify different traces which do not correspond to different behaviours. Since the ability of one of the two variants considered of recognising multiple occurrences of messages in the store (which accounts for an increase of expressiveness) reflects in a less complex abstraction, we then study other languages where multiplicity plays a fundamental role. We consider the language CHR (Constraint Handling Rules) a language which uses multi-headed (guarded) rules. We prove that multiple heads augment the expressive power of the language. Indeed we show that if we restrict to rules where the head contains at most n atoms we could generate a hierarchy of languages with increasing expressiveness (i.e. the CHR language allowing at most n atoms in the heads is more expressive than the language allowing at most m atoms, with m

A core calculus for the analysis and implementation of biologically inspired languages

The application of Concurrency Theory to Systems Biology is in its earliest stage of progress. The metaphor of cells as computing systems by Regev and Shapiro opened the employment of concurrent languages for the modelling of biological systems. Their peculiar characteristics led to the design of many bio-inspired formalisms which achieve higher faithfulness and specificity. In this thesis we present pi@, an extremely simple and conservative extension of the pi-calculus representing a keystone in this respect, thanks to its expressiveness capabilities. The pi@ calculus is obtained by the addition of polyadic synchronisation and priority to the pi-calculus, in order to achieve compartment semantics and atomicity of complex operations respectively. In its direct application to biological modelling, the stochastic variant of the calculus, Spi@, is shown able to model consistently several phenomena such as formation of molecular complexes, hierarchical subdivision of the system into compartments, inter-compartment reactions, dynamic reorganisation of compartment structure consistent with volume variation. The pivotal role of pi@ is evidenced by its capability of encoding in a compositional way several bio-inspired formalisms, so that it represents the optimal core of a framework for the analysis and implementation of bio-inspired languages. In this respect, the encodings of BioAmbients, Brane Calculi and a variant of P Systems in pi@ are formalised. The conciseness of their translation in pi@ allows their indirect comparison by means of their encodings. Furthermore it provides a ready-to-run implementation of minimal effort whose correctness is granted by the correctness of the respective encoding functions. Further important results of general validity are stated on the expressive power of priority. Several impossibility results are described, which clearly state the superior expressiveness of prioritised languages and the problems arising in the attempt of providing their parallel implementation. To this aim, a new setting in distributed computing (the last man standing problem) is singled out and exploited to prove the impossibility of providing a purely parallel implementation of priority by means of point-to-point or broadcast communication.