Silver colloidal nanoparticle stability: influence on Candida biofilms formed on denture acrylic

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

Measurement of the ratio of inclusive jet cross sections using the anti-k(T) algorithm with radius parameters R=0.5 and 0.7 in pp collisions at root s=7 TeV

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Effect of a Silver Nanoparticles Solution on Staphylococcus aureus and Candida spp.

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

An Efficient Parallel Algorithm for Multiple Sequence Similarities Calculation Using a Low Complexity Method

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

Wavelet-based algorithm to the evaluation of contrasted hepatocellular carcinoma in CT-images after transarterial chemoembolization

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

Silver Molybdate and Silver Tungstate Nanocomposites with Enhanced Photoluminescence

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

A Modified Branch and Bound Algorithm to Solve the Transmission Expansion Planning Problem

In this paper a novel Branch and Bound (B&B) algorithm to solve the transmission expansion planning which is a non-convex mixed integer nonlinear programming problem (MINLP) is presented. Based on defining the options of the separating variables and makes a search in breadth, we call this algorithm a B&BML algorithm. The proposed algorithm is implemented in AMPL and an open source Ipopt solver is used to solve the nonlinear programming (NLP) problems of all candidates in the B&B tree. Strategies have been developed to address the problem of non-linearity and non-convexity of the search region. The proposed algorithm is applied to the problem of long-term transmission expansion planning modeled as an MINLP problem. The proposed algorithm has carried out on five commonly used test systems such as Garver 6-Bus, IEEE 24-Bus, 46-Bus South Brazilian test systems, Bolivian 57-Bus, and Colombian 93-Bus. Results show that the proposed methodology not only can find the best known solution but it also yields a large reduction between 24% to 77.6% in the number of NLP problems regarding to the size of the systems.

Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity Industry

The transmission expansion planning problem in modern power systems is a large-scale, mixed-integer, nonlinear and non-convex problem. this paper presents a new mathematical model and a constructive heuristic algorithm (CHA) for solving transmission expansion planning problem under new environment of electricity restructuring. CHA finds an acceptable solution in an iterative process, where in each step a circuit is chosen using a sensitivity index and added to the system. The proposed model consider multiple generation scenarios therefore the methodology finds high quality solution in which it allows the power system operate adequacy in an environment with multiple generators scenarios. Case studies and simulation results using test systems show possibility of using Constructive heuristic algorithm in an open access system.

Desenvolvimento e validação de uma técnica quantitativa de análise de imagem para avaliação do teste do cometa corado pela prata

The comet assay is a method of DNA damage analysis widely used to quantify oxidative damage, crosslinks of DNA, apoptosis and genotoxicity of chemicals substances as chemical, pharmaceuticals, agrochemicals products, among others. This technique is suitable to detect DNA strand breaks, alkali-labile sites and incomplete excision repair sites and is based on the migration of DNA fragments by microeletroforesis, DNA migrates for the anode forming a “tail”, and the formed image has the appearance of a comet. The slides can be stained with fluorescence or silver, having differences in the microscopy type used for the analysis and the possibility of storage of the slides, moreover, the first one is a stained-method with more difficulties of accomplishment. The image analysis can be performed by a visual way, however, there is a disadvantage as the subjectivity on the results, that can be minimized by an automated method of digital analysis. This process was studied in this report with the aim to perceive the validation of the digital analysis turning it a quantitative method with larger reproductibility, minimizing the variability and imprecision due to the subjective analysis. For this validation we selected 50 comets photographed in a standardized way and printed, afterwards, pictures were submitted to three experienced appraisers, who quantified them manually. Later, the images were processed by free software ImageJ 1.38x, printed and quantified manually by the same appraisers. The intraclass correlation was higher to comet measures after image processing. Following, an algorithm of automated digital analysis from the measures of the comet was developed; the values obtained were compared with those 12 estimated manually after the processing resulting high correlation among the measures. The use of image analysis systems increases ...(Complete abstract click electronic access below)

Improvements in the score matrix calculation method using parallel score estimating algorithm

The increasing amount of sequences stored in genomic databases has become unfeasible to the sequential analysis. Then, the parallel computing brought its power to the Bioinformatics through parallel algorithms to align and analyze the sequences, providing improvements mainly in the running time of these algorithms. In many situations, the parallel strategy contributes to reducing the computational complexity of the big problems. This work shows some results obtained by an implementation of a parallel score estimating technique for the score matrix calculation stage, which is the first stage of a progressive multiple sequence alignment. The performance and quality of the parallel score estimating are compared with the results of a dynamic programming approach also implemented in parallel. This comparison shows a significant reduction of running time. Moreover, the quality of the final alignment, using the new strategy, is analyzed and compared with the quality of the approach with dynamic programming.

Optimizing urban traffic flow using genetic algorithm with petri net analysis as fitness function

This paper describes a new methodology adopted for urban traffic stream optimization. By using Petri net analysis as fitness function of a Genetic Algorithm, an entire urban road network is controlled in real time. With the advent of new technologies that have been published, particularly focusing on communications among vehicles and roads infrastructures, we consider that vehicles can provide their positions and their destinations to a central server so that it is able to calculate the best route for one of them. Our tests concentrate on comparisons between the proposed approach and other algorithms that are currently used for the same purpose, being possible to conclude that our algorithm optimizes traffic in a relevant manner.

MR-Radix: a multi-relational data mining algorithm

Background: Once multi-relational approach has emerged as an alternative for analyzing structured data such as relational databases, since they allow applying data mining in multiple tables directly, thus avoiding expensive joining operations and semantic losses, this work proposes an algorithm with multi-relational approach. Methods: Aiming to compare traditional approach performance and multi-relational for mining association rules, this paper discusses an empirical study between PatriciaMine - an traditional algorithm - and its corresponding multi-relational proposed, MR-Radix. Results: This work showed advantages of the multi-relational approach in performance over several tables, which avoids the high cost for joining operations from multiple tables and semantic losses. The performance provided by the algorithm MR-Radix shows faster than PatriciaMine, despite handling complex multi-relational patterns. The utilized memory indicates a more conservative growth curve for MR-Radix than PatriciaMine, which shows the increase in demand of frequent items in MR-Radix does not result in a significant growth of utilized memory like in PatriciaMine. Conclusion: The comparative study between PatriciaMine and MR-Radix confirmed efficacy of the multi-relational approach in data mining process both in terms of execution time and in relation to memory usage. Besides that, the multi-relational proposed algorithm, unlike other algorithms of this approach, is efficient for use in large relational databases.

Moderating effect of ammonia on particle growth and stability of quasi-monodisperse silver nanoparticles synthesized by the Turkevich method

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

Photocatalytic decomposition of rhodamine-B using scandium and silver-modified TiO2 Powders

Semiconductor-mediated photocatalytic oxidation is an interesting method for water decontamination and a specially modified TiO2 is said to be a promising material. This study verified that the synthesis of 1wt%Ag modified-Sc0.01Ti0.99O1.995 powder samples prepared by Polymeric Precursor Method is capable of forming a mixture of anatase-rutile phase with high photocatalytic performance. This kind of material is found to have a lower bandgap compared to the TiO2-anatase commercial powders, which can be associated to an innovative hybrid modification. The simultaneous insertion of scandium in order to generate a p-type semiconductor and a metallic silver nanophase acting as an electron trapper demonstrated being capable of enhancing the degradation of rhodamine B compared to the commercial TiO2. In spite of the different thermal treatments or phase amounts, the hybrid modified powder samples showed higher photocatalytic activity than the commercial ones.

Susceptibility of Candida albicans and Candida glabrata biofilms to silver nanoparticles in intermediate and mature development phases

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