Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"Universidade Estadual de Campinas" +contributor:("Guardia, Giuliano Gadioli La"). Showing records 1 – 2 of 2 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Universidade Estadual de Campinas

1. Fidalgo, Felipe Delfini Caetano, 1987-. Dividindo e conquistando com simetrias em geometria de distâncias: Divinding and conquering with symmetries in distance geometry.

Degree: 2015, Universidade Estadual de Campinas

Abstract: Motived by studies in 3D structures of proteins, essential biomolecules for Life, arised a problem called Discretizable Molecular Distance Geometry Problem (DMDGP) which proved to be NP-Hard. Aiming to solve it, there is an algorithm in the literature, Branch & Prune (BP), which uses a combinatorial strategy of exploring a binary tree of solutions that is associated to the problem. Moreover, some symmetry relations have been discovered which allows the obtainance of one solution from the other one by means of reflections in the so-called symmetry vertices. Some researchers started to do this work using parallel computing (ParallelBP), dividing one instance into sub-instances, solving the problem locally with the BP (what can be done in two directions) and joining the sub-solutions with rigid movements, with the objective of determining the solutions in a smaller time. Our purpose, thus, is to provide a Divide-and-Conquer strategy to solve the DMDGP in order to improve the parallel version. It has three stages. Initially, the instance is divided into sub-instances two-by-two overlapping by means of the symmetry vertices. After, the so-called gaps are used to decide the direction that the BP ought to provide the local solution. Finally, we propose to use Quaternion Rotations to combine sub-solutions into feasible solutions Advisors/Committee Members: UNIVERSIDADE ESTADUAL DE CAMPINAS (CRUESP), Lavor, Carlile Campos, 1968- (advisor), Universidade Estadual de Campinas. Instituto de Matemática, Estatística e Computação Científica (institution), Programa de Pós-Graduação em Matemática Aplicada (nameofprogram), Costa, Sueli Irene Rodrigues (committee member), Miqueles, Eduardo Xavier Silva (committee member), Guardia, Giuliano Gadioli La (committee member), Bonates, Tibérius de Oliveira e (committee member).

Subjects/Keywords: Geometria de distâncias; Simetria (Matemática); Estrutura molecular; Algoritmos branch-and-prune; Distance geometry; Symmetry (Mathematics); Molecular structure; Branch-and-prune algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fidalgo, Felipe Delfini Caetano, 1. (2015). Dividindo e conquistando com simetrias em geometria de distâncias: Divinding and conquering with symmetries in distance geometry. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/306799

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Fidalgo, Felipe Delfini Caetano, 1987-. “Dividindo e conquistando com simetrias em geometria de distâncias: Divinding and conquering with symmetries in distance geometry.” 2015. Thesis, Universidade Estadual de Campinas. Accessed March 06, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306799.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Fidalgo, Felipe Delfini Caetano, 1987-. “Dividindo e conquistando com simetrias em geometria de distâncias: Divinding and conquering with symmetries in distance geometry.” 2015. Web. 06 Mar 2021.

Vancouver:

Fidalgo, Felipe Delfini Caetano 1. Dividindo e conquistando com simetrias em geometria de distâncias: Divinding and conquering with symmetries in distance geometry. [Internet] [Thesis]. Universidade Estadual de Campinas; 2015. [cited 2021 Mar 06]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/306799.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fidalgo, Felipe Delfini Caetano 1. Dividindo e conquistando com simetrias em geometria de distâncias: Divinding and conquering with symmetries in distance geometry. [Thesis]. Universidade Estadual de Campinas; 2015. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/306799

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

2. Bastos, Gustavo Terra, 1986-. Códigos de subespaço geometricamente uniformes e uma proposta de construção de redes quânticas: Geometrically uniform subspace codes and a proposal to construct quantum networks.

Degree: 2017, Universidade Estadual de Campinas

Abstract: Subspace codes have been very useful to solve the error propagation in a multicast linear network. In particular, the orbit codes family presents a well-defined algebraic structure, which it will probably provide constructions of good decoding algorithms and a systematic way to compute the parameters of the code. In this work, we present a study of orbit codes seen as geometrically uniform codes. The characterization of both classes is direct from the definition of orbit codes and, given a uniform geometrically partition of these orbit codes from their normal subgroups of the generator group, we propose a reduction of the computation necessary for obtaining the minimum distances of an abelian orbit code and an L-level code, in addition to a decoding algorithm based on Voronoi regions. In the last chapter, we propose a hypothetical quantum network coding for the transmission of quantum information. This network consists of maximum entangled pure quantum states such that each ket of these states is associated with a vector subspace Advisors/Committee Members: UNIVERSIDADE ESTADUAL DE CAMPINAS (CRUESP), Palazzo Júnior, Reginaldo, 1951- (advisor), Universidade Estadual de Campinas. Faculdade de Engenharia Elétrica e de Computação (institution), Programa de Pós-Graduação em Engenharia Elétrica (nameofprogram), Ferrari, Agnaldo José (committee member), Torres Orihuela, Fernando Eduardo (committee member), Guardia, Giuliano Gadioli La (committee member), Guerreiro, Marines (committee member).

Subjects/Keywords: Códigos corretores de erros (Teoria da informação); Comunicação quântica; Error correcting codes (Information theory); Quantum communication

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bastos, Gustavo Terra, 1. (2017). Códigos de subespaço geometricamente uniformes e uma proposta de construção de redes quânticas: Geometrically uniform subspace codes and a proposal to construct quantum networks. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/325322

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bastos, Gustavo Terra, 1986-. “Códigos de subespaço geometricamente uniformes e uma proposta de construção de redes quânticas: Geometrically uniform subspace codes and a proposal to construct quantum networks.” 2017. Thesis, Universidade Estadual de Campinas. Accessed March 06, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/325322.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bastos, Gustavo Terra, 1986-. “Códigos de subespaço geometricamente uniformes e uma proposta de construção de redes quânticas: Geometrically uniform subspace codes and a proposal to construct quantum networks.” 2017. Web. 06 Mar 2021.

Vancouver:

Bastos, Gustavo Terra 1. Códigos de subespaço geometricamente uniformes e uma proposta de construção de redes quânticas: Geometrically uniform subspace codes and a proposal to construct quantum networks. [Internet] [Thesis]. Universidade Estadual de Campinas; 2017. [cited 2021 Mar 06]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/325322.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bastos, Gustavo Terra 1. Códigos de subespaço geometricamente uniformes e uma proposta de construção de redes quânticas: Geometrically uniform subspace codes and a proposal to construct quantum networks. [Thesis]. Universidade Estadual de Campinas; 2017. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/325322

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.