Convenient synthesis of ketal derivatives from cubebin using amberlite as heterogeneous catalyst

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

Saccharomyces cerevisiae: a novel and efficient biological control agent for Colletotrichum acutatum during pre-harvest

In this study, we evaluated the efficiency of six isolates of Saccharomyces cerevisiae in controlling Colletotrichum acutatum, the causal agent of postbloom fruit drop that occur in pre-harvest citrus. We analyzed the mechanisms of action involved in biological control such as: production of antifungal compounds, nutrient competition, detection of killer activity, and production of hydrolytic enzymes of the isolates of S. cerevisiae on C. acutatum and their efficiency in controlling postbloom fruit drop on detached citrus flowers. Our results showed that all six S. cerevisiae isolates produced antifungal compounds, competed for nutrients, inhibited pathogen germination, and produced killer activity and hydrolytic enzymes when in contact with the fungus wall. The isolates were able to control the disease when detached flowers were artificially inoculated, both preventively and curatively. In this work we identified a novel potential biological control agent for C acutatum during pre-harvest. This is the first report of yeast efficiency for the biocontrol of postbloom fruit drop, which represents an important contribution to the field of biocontrol of diseases affecting citrus populations worldwide. (C) 2015 Elsevier GmbH. All rights reserved.

Single precursor route to efficient cobalt sulphide counter electrodes for dye sensitized solar cells

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

Is the internal connection more efficient than external connection in mechanical, biological, and esthetical point of views? A systematic review

This systematic review aimed to evaluate if the internal connection is more efficient than the external connection and its associated influencing factors. A specific question was formulated according to the Population, Intervention, Control, and Outcome (PICO): Is internal connection more efficient than external connection in mechanical, biological, and esthetical point of views? An electronic search of the MEDLINE and the Web of Knowledge databases was performed for relevant studies published in English up to November 2013 by two independent reviewers. The keywords used in the search included a combination of dental implant and internal connection or Morse connection or external connection. Selected studies were randomized clinical trials, prospective or retrospective studies, and in vitro studies with a clear aim of investigating the internal and/or external implant connection use. From an initial screening yield of 674 articles, 64 potentially relevant articles were selected after an evaluation of their titles and abstracts. Full texts of these articles were obtained with 29 articles fulfilling the inclusion criteria. Morse taper connection has the best sealing ability. Concerning crestal bone loss, internal connections presented better results than external connections. The limitation of the present study was the absence of randomized clinical trials that investigated if the internal connection was more efficient than the external connection. The external and internal connections have different mechanical, biological, and esthetical characteristics. Besides all systems that show proper success rates and effectiveness, crestal bone level maintenance is more important around internal connections than external connections. The Morse taper connection seems to be more efficient concerning biological aspects, allowing lower bacterial leakage and bone loss in single implants, including aesthetic regions. Additionally, this connection type can be successfully indicated for fixed partial prostheses and overdenture planning, since it exhibits high mechanical stability.

Structural study of copper oxide supported on a ceria-modified titania catalyst system

A structural study of CuO supported on a CeO2-TiO2 system was undertaken using X-ray diffraction (XRD) and X-ray absorption spectroscopy (XAS) techniques. The results of XRD revealed the presence of only two phases, TiO2 anatase and CeO2 cerianite. A trend towards smaller TiO2 crystallites was observed when cerium content increased. When the amount of cerium increased, Ti K-edge XANES analysis showed an increasing distortion of Ti sites. The results of Ce LIII-edge EXAFS showed that Ce atoms are coordinated by eight oxygen atoms at 2.32 Å. For the sample containing a small amount of cerium, the EXAFS analysis indicated that the local structure around Ce atoms was highly distorted. The catalysts presented quite different Cu K-edge XANES spectra compared to the spectra of the CuO and Cu2O reference compounds. The Cu-O mean bond length was close to that of the CuO and the Cu atoms in the catalysts are surrounded by approximately four oxygen atoms in their first shell. Copper supported on the ceria-modified titania support catalysts displayed a better performance in the methanol dehydrogenation when compared to copper supported only on titania or on ceria. © 2002 Plenum Publishing Corporation.

Oxidation of amino acids by chlorpromazine cation radical and co-catalysis by chlorpromazine

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

Síntese e caracterização de monômeros azo-carbonatos para a preparação de poli(azo-carbonato)s e poli)azo-uretana)s

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

Produção de biodiesel etílico utilizando óxidos mistos derivados de hidróxidos duplos lamelares como catalisadores

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

A Novel Cost-Efficient On-Line Intermediate Waveband-Switching Scheme in WDM Mesh Networks

Waveband switching (WBS) is an important technique to save switching and transmission cost in wavelength -division multiplexed (WDM) optical networks. A cost-efficient WBS scheme would enable network carriers to increase the network throughput (revenue) while achieving significant cost savings. We identify the critical factors that determine the WBS network throughput and switching cost and propose a novel intermediate waveband switching (IT-WBS) algorithm, called the minimizing-weighted-cost (MWC) algorithm. The MWC algorithm defines a cost for each candidate route of a call. By selecting the route with the smallest weighted cost, MWC balances between minimizing the call blocking probability and minimizing the network switching cost. Our simulations show that MWC outperforms other wavelength/waveband switching algorithms and can enhance the network throughput at a reduced cost.

KeyRev: An Efficient Key Revocation Scheme for Wireless Sensor Networks

Key management is a core mechanism to ensure the security of applications and network services in wireless sensor networks. It includes two aspects: key distribution and key revocation. Key distribution has been extensively studied in the context of sensor networks. However, key revocation has received relatively little attention. Existing key revocation schemes can be divided into two categories: centralized key revocation scheme and distributed key revocation scheme. In this paper, we first summarize the current key revocation schemes for sensor networks. Then, we propose an efficient centralized key revocation scheme, KeyRev, for wireless sensor networks. Unlike most proposed key revocation schemes focusing on removing the compromised keys, we propose to use key updating techniques to obsolesce the keys owned by the compromised sensor nodes and thus remove the nodes from the network. Our analyses show that the KeyRev scheme is secure inspite of not removing the pre-distributed key materials at compromised sensor nodes. Simulation results also indicate that the KeyRev scheme is scalable and performs very well in wireless sensor networks.

An Efficient Scheduling Scheme For On-Demand Lightpath Reservations In Reconfigurable WDM Optical Networks

We propose an efficient scheduling scheme that optimizes advance-reserved lightpath services in reconfigurable WDM networks. A re-optimization approach is devised to reallocate network resources for dynamic service demands while keeping determined schedule unchanged.

Efficient Kernel Computation for Volterra Filter Structure Evaluation

Despite their generality, conventional Volterra filters are inadequate for some applications, due to the huge number of parameters that may be needed for accurate modelling. When a state-space model of the target system is known, this can be assessed by computing its kernels, which also provides valuable information for choosing an adequate alternate Volterra filter structure, if necessary, and is useful for validating parameter estimation procedures. In this letter, we derive expressions for the kernels by using the Carleman bilinearization method, for which an efficient algorithm is given. Simulation results are presented, which confirm the usefulness of the proposed approach.

Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design

The design of a network is a solution to several engineering and science problems. Several network design problems are known to be NP-hard, and population-based metaheuristics like evolutionary algorithms (EAs) have been largely investigated for such problems. Such optimization methods simultaneously generate a large number of potential solutions to investigate the search space in breadth and, consequently, to avoid local optima. Obtaining a potential solution usually involves the construction and maintenance of several spanning trees, or more generally, spanning forests. To efficiently explore the search space, special data structures have been developed to provide operations that manipulate a set of spanning trees (population). For a tree with n nodes, the most efficient data structures available in the literature require time O(n) to generate a new spanning tree that modifies an existing one and to store the new solution. We propose a new data structure, called node-depth-degree representation (NDDR), and we demonstrate that using this encoding, generating a new spanning forest requires average time O(root n). Experiments with an EA based on NDDR applied to large-scale instances of the degree-constrained minimum spanning tree problem have shown that the implementation adds small constants and lower order terms to the theoretical bound.