994 resultados para multi-doped glass


Relevância:

20.00% 20.00%

Publicador:

Resumo:

To study a flavour model with a non-minimal Higgs sector one must first define the symmetries of the fields; then identify what types of vacua exist and how they may break the symmetries; and finally determine whether the remnant symmetries are compatible with the experimental data. Here we address all these issues in the context of flavour models with any number of Higgs doublets. We stress the importance of analysing the Higgs vacuum expectation values that are pseudo-invariant under the generators of all subgroups. It is shown that the only way of obtaining a physical CKM mixing matrix and, simultaneously, non-degenerate and non-zero quark masses is requiring the vacuum expectation values of the Higgs fields to break completely the full flavour group, except possibly for some symmetry belonging to baryon number. The application of this technique to some illustrative examples, such as the flavour groups Delta (27), A(4) and S-3, is also presented.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A swift chemical route to synthesize Co-doped SnO2 nanopowders is described. Pure and highly stable Sn1-xCoxO2-delta (0 <= x <= 0.15) crystalline nanoparticles were synthesized, with mean grain sizes <5 nm and the dopant element homogeneously distributed in the SnO2 matrix. The UV-visible diffuse reflectance spectra of the Sn1-xCoxO2-delta samples reveal red shifts, the optical bandgap energies decreasing with increasing Co concentration. The samples' Urbach energies were calculated and correlated with their bandgap energies. The photocatalytic activity of the Sn1-xCoxO2-delta samples was investigated for the 4-hydroxylbenzoic acid (4-HBA) degradation process. A complete photodegradation of a 10 ppm 4-HBA solution was achieved using 0.02% (w/w) of Sn0.95Co0.05O2-delta nanoparticles in 60 min of irradiation. (C) 2014 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Abrasion by glass fibers during injection molding of fiber reinforced plastics raises new challenges to the wear performance of the molds. In the last few decades, a large number of PVD and CVD coatings have been developed with the aim of minimizing abrasion problems. In this work, two different coatings were tested in order to increase the wear resistance of the surface of a mold used for glass fiber reinforced plastics: TiAlSiN and CrN/CrCN/DLC. TiAlSiN was deposited as a graded monolayer coating while CrN/CrCN/DLC was a nanostructured coating consisting of three distinct layers. Both coatings were produced by PVD unbalanced magnetron sputtering and were characterized using scanning electron microscopy (SEM) provided with energy dispersive spectroscopy (EDS), atomic force microscopy (AFM), micro hardness (MH) and scratch test analysis. Coating morphology, thickness, roughness, chemical composition and structure, hardness and adhesion to the substrate were investigated. Wear resistance was characterized through industrial tests with coated samples and an uncoated reference sample inserted in a feed channel of a plastic injection mold working with 30 wt.% glass fiber reinforced polypropylene. Results after 45,000 injection cycles indicate that the wear resistance of the mold was increased by a factor of 25 and 58, by the TiAlSiN and CrN/CrCN/DLC coatings, respectively, over the uncoated mold steel.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a genetic algorithm for the multimode resource-constrained project scheduling problem (MRCPSP), in which multiple execution modes are available for each of the activities of the project. The objective function is the minimization of the construction project completion time. To solve the problem, is applied a two-level genetic algorithm, which makes use of two separate levels and extend the parameterized schedule generation scheme by introducing an improvement procedure. It is evaluated the quality of the schedule and present detailed comparative computational results for the MRCPSP, which reveal that this approach is a competitive algorithm.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper proposes a novel agent-based approach to Meta-Heuristics self-configuration. Meta-heuristics are algorithms with parameters which need to be set up as efficient as possible in order to unsure its performance. A learning module for self-parameterization of Meta-heuristics (MH) in a Multi-Agent System (MAS) for resolution of scheduling problems is proposed in this work. The learning module is based on Case-based Reasoning (CBR) and two different integration approaches are proposed. A computational study is made for comparing the two CBR integration perspectives. Finally, some conclusions are reached and future work outlined.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação apresentada como requisito parcial para obtenção do grau de Mestre em Ciência e Sistemas de Informação Geográfica

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertation submitted in partial fulfilment of the requirements for the Degree of Master of Science in Geospatial Technologies

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Este artigo apresenta uma nova abordagem (MM-GAV-FBI), aplicável ao problema da programação de projectos com restrições de recursos e vários modos de execução por actividade, problema conhecido na literatura anglo-saxónica por MRCPSP. Cada projecto tem um conjunto de actividades com precedências tecnológicas definidas e um conjunto de recursos limitados, sendo que cada actividade pode ter mais do que um modo de realização. A programação dos projectos é realizada com recurso a um esquema de geração de planos (do inglês Schedule Generation Scheme - SGS) integrado com uma metaheurística. A metaheurística é baseada no paradigma dos algoritmos genéticos. As prioridades das actividades são obtidas a partir de um algoritmo genético. A representação cromossómica utilizada baseia-se em chaves aleatórias. O SGS gera planos não-atrasados. Após a obtenção de uma solução é aplicada uma melhoria local. O objectivo da abordagem é encontrar o melhor plano (planning), ou seja, o plano que tenha a menor duração temporal possível, satisfazendo as precedências das actividades e as restrições de recursos. A abordagem proposta é testada num conjunto de problemas retirados da literatura da especialidade e os resultados computacionais são comparados com outras abordagens. Os resultados computacionais validam o bom desempenho da abordagem, não apenas em termos de qualidade da solução, mas também em termos de tempo útil.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mestrado em Engenharia Electrotécnica e de Computadores - Área de Especialização de Telecomunicações

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Ethnologia - Antropologia dos processos identitários, Lisboa

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação apresentada como requisito parcial para obtenção do grau de Mestre em Ciência e Sistemas de Informação Geográfica

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação apresentada como requisito parcial para obtenção do grau de Mestre em Ciência e Sistemas de Informação Geográfica

Relevância:

20.00% 20.00%

Publicador:

Resumo:

IEEE International Symposium on Circuits and Systems, pp. 724 – 727, Seattle, EUA