Protease-inhibiting, molecular modeling and antimicrobial activities of extracts and constituents from Helichrysum foetidum and Helichrysum mechowianum (compositae)

Background Helichrysum species are used extensively for stress-related ailments and as dressings for wounds normally encountered in circumcision rites, bruises, cuts and sores. It has been reported that Helichysum species are used to relief abdominal pain, heart burn, cough, cold, wounds, female sterility, menstrual pain. Results From the extracts of Helichrysum foetidum (L.) Moench, six known compounds were isolated and identified. They were 7, 4′-dihydroxy-5-methoxy-flavanone (1), 6′-methoxy-2′,4, 4′-trihydroxychalcone (2), 6′-methoxy-2′,4-dihydroxychalcone -4′-O-β-D-glucoside (3), apigenin (4), apigenin-7-O-β-D-glucoside (5), kaur-16-en-18-oic acid (6) while two known compounds 3,5,7-trihydroxy-8-methoxyflavone (12), 4,5-dicaffeoyl quinic acid (13) together with a mixture of phytosterol were isolated from the methanol extract of Helichrysum mechowianum Klatt. All the compounds were characterized by spectroscopic and mass spectrometric methods, and by comparison with literature data. Both extracts and all the isolates were screened for the protease inhibition, antibacterial and antifungal activities. In addition, the phytochemical profiles of both species were investigated by ESI-MS experiments. Conclusions These results showed that the protease inhibition assay of H. foetidum could be mainly attributed to the constituents of flavonoids glycosides (3, 5) while the compound (13) from H. mechowianum contributes to the stomach protecting effects. In addition, among the antibacterial and antifungal activities of all the isolates, compound (6) was found to possess a potent inhibitor effect against the tested microorganisms. The heterogeneity of the genus is also reflected in its phytochemical diversity. The differential bioactivities and determined constituents support the traditional use of the species. Molecular modelling was carried out by computing selected descriptors related to drug absorption, distribution, metabolism, excretion and toxicity (ADMET).

Could histoplasma capsulatum be related to healthcare-associated infections?

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Genetic parameter estimates and principal component analysis on performance and carcass traits of a terminal pig sire line

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Two-dimensional nonlinear map characterized by tunable Levy flights

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

The 2',4'-dihydroxychalcone could be explored to develop new inhibitors against the glycerol-3-phosphate dehydrogenase from Leishmania species

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Joint Computing and Network Resource Scheduling in a Lambda Grid Network

Data-intensive Grid applications require huge data transfers between grid computing nodes. These computing nodes, where computing jobs are executed, are usually geographically separated. A grid network that employs optical wavelength division multiplexing (WDM) technology and optical switches to interconnect computing resources with dynamically provisioned multi-gigabit rate bandwidth lightpath is called a Lambda Grid network. A computing task may be executed on any one of several computing nodes which possesses the necessary resources. In order to reflect the reality in job scheduling, allocation of network resources for data transfer should be taken into consideration. However, few scheduling methods consider the communication contention on Lambda Grids. In this paper, we investigate the joint scheduling problem while considering both optical network and computing resources in a Lambda Grid network. The objective of our work is to maximize the total number of jobs that can be scheduled in a Lambda Grid network. An adaptive routing algorithm is proposed and implemented for accomplishing the communication tasks for every job submitted in the network. Four heuristics (FIFO, ESTF, LJF, RS) are implemented for job scheduling of the computational tasks. Simulation results prove the feasibility and efficiency of the proposed solution.

Joint Computing and Network Resource Scheduling in a Lambda Grid Network

Data-intensive Grid applications require huge data transfers between grid computing nodes. These computing nodes, where computing jobs are executed, are usually geographically separated. A grid network that employs optical wavelength division multiplexing (WDM) technology and optical switches to interconnect computing resources with dynamically provisioned multi-gigabit rate bandwidth lightpath is called a Lambda Grid network. A computing task may be executed on any one of several computing nodes which possesses the necessary resources. In order to reflect the reality in job scheduling, allocation of network resources for data transfer should be taken into consideration. However, few scheduling methods consider the communication contention on Lambda Grids. In this paper, we investigate the joint scheduling problem while considering both optical network and computing resources in a Lambda Grid network. The objective of our work is to maximize the total number of jobs that can be scheduled in a Lambda Grid network. An adaptive routing algorithm is proposed and implemented for accomplishing the communication tasks for every job submitted in the network. Four heuristics (FIFO, ESTF, LJF, RS) are implemented for job scheduling of the computational tasks. Simulation results prove the feasibility and efficiency of the proposed solution.

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.

Are we able to correctly identify prostate cancer patients who could be adequately treated by focal therapy?

Introduction and Objective: Because of the improvements on detection of early stage prostate cancer over the last decade, focal therapy for localized prostate cancer (PC) has been proposed for patients with low-risk disease. Such treatment would allow the control of cancer, thereby diminishing side effects, such as urinary incontinence and sexual dysfunction, which have an enormous impact on quality of life. The critical issue is whether it is possible to preoperatively predict clinically significant unifocal or unilateral prostate cancer with sufficient accuracy. Our aim is to determine whether there is any preoperative feature that can help select the ideal patient for focal therapy. Material and methods: A total of 599 patients who underwent transrectal ultrasound, (TRUS)-guided prostate biopsy followed by radical prostatectomy to treat PC were examined in our laboratory between 2001 and 2009. We established very restricted criteria to select patients with very-low-risk disease for whom focal therapy would be suitable (only I biopsy core positive, tumor no larger than 80% of a single core, no perineural invasion, PSA serum level < 10 ng/ml, Gleason score < 7 and clinical stage T1c, T2a-b). We defined 2 groups of patients who would be either adequately treated or not treated by focal therapy. The primary endpoint was the evaluation of preoperative features in order to identify which parameters should be considered when choosing good candidates for focal therapy. Results: Fifty-six out of 599 patients met our criteria. The mean age was 59 years, and the mean number of biopsy cores was 14.4. Forty-seven (83.9%) were staged T1c, and 9 (16.1%) were staged T2a-b. Forty-four (78.6%) patients could be considered to have been adequately treated by focal therapy, and 12 (21.4%) could not. There was no statistical difference between the 2 groups considering age, clinical stage, PSA levels, Gleason score, and tumor volume in the biopsy. All 12 patients who could be considered inadequately treated had a bilateral, significant secondary tumor, 58.3% had Gleason >= 7, and 25% were staged pT3. Conclusion: Although focal therapy might be a good option for patients with localized prostate cancer, we are so far unable to select which of them would benefit from it based on preoperative data, even using very restricted criteria, and a considerable proportion of men would still be left undertreated. (c) 2012 Elsevier Inc. All rights reserved.

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.