759 resultados para algorithm fusion
Resumo:
A family of nonempty closed convex sets is built by using the data of the Generalized Nash equilibrium problem (GNEP). The sets are selected iteratively such that the intersection of the selected sets contains solutions of the GNEP. The algorithm introduced by Iusem-Sosa (2003) is adapted to obtain solutions of the GNEP. Finally some numerical experiments are given to illustrate the numerical behavior of the algorithm.
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt"
Resumo:
Canine distemper virus (CDV) produces a glycosylated type I fusion protein (F) with an internal hydrophobic signal sequence beginning around 115 residues downstream of the first AUG used for translation initiation. Cleavage of the signal sequence yields the F0 molecule, which is cleaved into the F1 and F2 subunits. Surprisingly, when all in-frame AUGs located in the first third of the F gene were mutated a protein of the same molecular size as the F0 molecule was still expressed from both the Onderstepoort (OP) and A75/17-CDV F genes. We designated this protein, which is initiated from a non-AUG codon protein Fx. Site-directed mutagenesis allowed to identify codon 85, a GCC codon coding for alanine, as the most likely position from which translation initiation of Fx occurs in OP-CDV. Deletion analysis demonstrated that at least 60 nucleotides upstream of the GCC codon are required for efficient Fx translation. This sequence is GC-rich, suggesting extensive folding. Secondary structure may therefore be important for translation initiation at codon 85.
Resumo:
The multiscale finite volume (MsFV) method has been developed to efficiently solve large heterogeneous problems (elliptic or parabolic); it is usually employed for pressure equations and delivers conservative flux fields to be used in transport problems. The method essentially relies on the hypothesis that the (fine-scale) problem can be reasonably described by a set of local solutions coupled by a conservative global (coarse-scale) problem. In most cases, the boundary conditions assigned for the local problems are satisfactory and the approximate conservative fluxes provided by the method are accurate. In numerically challenging cases, however, a more accurate localization is required to obtain a good approximation of the fine-scale solution. In this paper we develop a procedure to iteratively improve the boundary conditions of the local problems. The algorithm relies on the data structure of the MsFV method and employs a Krylov-subspace projection method to obtain an unconditionally stable scheme and accelerate convergence. Two variants are considered: in the first, only the MsFV operator is used; in the second, the MsFV operator is combined in a two-step method with an operator derived from the problem solved to construct the conservative flux field. The resulting iterative MsFV algorithms allow arbitrary reduction of the solution error without compromising the construction of a conservative flux field, which is guaranteed at any iteration. Since it converges to the exact solution, the method can be regarded as a linear solver. In this context, the schemes proposed here can be viewed as preconditioned versions of the Generalized Minimal Residual method (GMRES), with a very peculiar characteristic that the residual on the coarse grid is zero at any iteration (thus conservative fluxes can be obtained).
Resumo:
This paper proposes a parallel architecture for estimation of the motion of an underwater robot. It is well known that image processing requires a huge amount of computation, mainly at low-level processing where the algorithms are dealing with a great number of data. In a motion estimation algorithm, correspondences between two images have to be solved at the low level. In the underwater imaging, normalised correlation can be a solution in the presence of non-uniform illumination. Due to its regular processing scheme, parallel implementation of the correspondence problem can be an adequate approach to reduce the computation time. Taking into consideration the complexity of the normalised correlation criteria, a new approach using parallel organisation of every processor from the architecture is proposed
Resumo:
The registration of full 3-D models is an important task in computer vision. Range finders only reconstruct a partial view of the object. Many authors have proposed several techniques to register 3D surfaces from multiple views in which there are basically two aspects to consider. First, poor registration in which some sort of correspondences are established. Second, accurate registration in order to obtain a better solution. A survey of the most common techniques is presented and includes experimental results of some of them
Resumo:
This work provides a general description of the multi sensor data fusion concept, along with a new classification of currently used sensor fusion techniques for unmanned underwater vehicles (UUV). Unlike previous proposals that focus the classification on the sensors involved in the fusion, we propose a synthetic approach that is focused on the techniques involved in the fusion and their applications in UUV navigation. We believe that our approach is better oriented towards the development of sensor fusion systems, since a sensor fusion architecture should be first of all focused on its goals and then on the fused sensors
Resumo:
In computer graphics, global illumination algorithms take into account not only the light that comes directly from the sources, but also the light interreflections. This kind of algorithms produce very realistic images, but at a high computational cost, especially when dealing with complex environments. Parallel computation has been successfully applied to such algorithms in order to make it possible to compute highly-realistic images in a reasonable time. We introduce here a speculation-based parallel solution for a global illumination algorithm in the context of radiosity, in which we have taken advantage of the hierarchical nature of such an algorithm
Resumo:
Diffusion tensor magnetic resonance imaging, which measures directional information of water diffusion in the brain, has emerged as a powerful tool for human brain studies. In this paper, we introduce a new Monte Carlo-based fiber tracking approach to estimate brain connectivity. One of the main characteristics of this approach is that all parameters of the algorithm are automatically determined at each point using the entropy of the eigenvalues of the diffusion tensor. Experimental results show the good performance of the proposed approach
Resumo:
Arbuscular mycorrhizal fungi (AMF) form symbioses with the majority of plants and form extensive underground hyphal networks simultaneously connecting the roots of different plant species. No empirical evidence exists for either anastomosis between genetically different AMF or genetic exchange.Five isolates of one population of Glomus intraradices were used to study anastomosis between hyphae of germinating spores. We show that genetically distinct AMF, from the same field, anastomose, resulting in viable cytoplasmic connections through which genetic exchange could potentially occur.Pairs of genetically different isolates were then co-cultured in an in vitro system.Freshly produced spores were individually germinated to establish new cultures.Using several molecular tools, we show that genetic exchange occurred between genetically different AMF. Specific genetic markers from each parent were transmitted to the progeny. The progeny were viable, forming symbioses with plant roots. The phenotypes of some of the progeny were significantly different from either parent.Our results indicate that considerable promiscuity could occur in these fungi because nine out of 10 combinations of different isolates anastomosed. The ability to perform genetic crosses between AMF experimentally lays a foundation for understanding the genetics and evolutionary biology of these important plants symbionts.
Resumo:
Recently, we described the improved immunogenicity of new malaria vaccine candidates based on the expression of fusion proteins containing immunodominant epitopes of merozoites and Salmonella enterica serovar Typhimurium flagellin (FliC) protein as an innate immune agonist. Here, we tested whether a similar strategy, based on an immunodominant B-cell epitope from malaria sporozoites, could also generate immunogenic fusion polypeptides. A recombinant His6-tagged FliC protein containing the C-terminal repeat regions of the VK210 variant of Plasmodium vivax circumsporozoite (CS) protein was constructed. This recombinant protein was successfully expressed in Escherichia coli as soluble protein and was purified by affinity to Ni-agarose beads followed by ion exchange chromatography. A monoclonal antibody specific for the CS protein of P. vivax sporozoites (VK210) was able to recognise the purified protein. C57BL/6 mice subcutaneously immunised with the recombinant fusion protein in the absence of any conventional adjuvant developed protein-specific systemic antibody responses. However, in mice genetically deficient in expression of TLR5, this immune response was extremely low. These results extend our previous observations concerning the immunogenicity of these recombinant fusion proteins and provide evidence that the main mechanism responsible for this immune activation involves interactions with TLR5, which has not previously been demonstrated for any recombinant FliC fusion protein.