{"id":{"repo_id":"brazil-uerj","oai_identifier":"oai:pantheon.ufrj.br:11422/3780"},"canonical_url":"https://search.dev.ndltd.org/etd/brazil-uerj/oai:pantheon.ufrj.br:11422/3780","repository":{"repo_id":"brazil-uerj","name":"Brazil UERJ","base_url":"https://pantheon.ufrj.br/oai/request"},"display":{"title":"Sistema adaptativo para compressão de dados","abstract":"An interesting property is proven for Huffman's tree. Any two elements with weights ai and bi sons of a same father have the following property: if bi ≥ ai then Wm ≤ ai or Wm ≥ bi where Wm is the weight of any node of the tree. Based on this property, an algorithm is developed to dynamically update Huffman's tree as weights of terminal nodes change. Using this algorithm, a model of an adaptive system for data compression is developed. Simulation using many types of data led to interesting results.","abstract_html":"An interesting property is proven for Huffman's tree. Any two elements with weights ai and bi sons of a same father have the following property: if bi ≥ ai then Wm ≤ ai or Wm ≥ bi where Wm is the weight of any node of the tree. Based on this property, an algorithm is developed to dynamically update Huffman's tree as weights of terminal nodes change. Using this algorithm, a model of an adaptive system for data compression is developed. Simulation using many types of data led to interesting results.","abstract_has_math":false,"creators":["Faller, Newton"],"institution":"Universidade Federal do Rio de Janeiro","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Silva Filho, Ysmar Vianna e"],"committee_chairs":[],"committee_members":[],"year":1973,"date_issued":"1973-12","date_published":"1973-12","updated_at":"2026-07-24T01:16:10Z","subjects":["Algoritmos","Reconhecimento de padrões","Compressão (computabilidade e complexidade)"],"languages":["por"],"rights":["Acesso Aberto"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11422/3780","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Silva Filho, Ysmar Vianna e"]},{"key":"dc:creator","label":"Author","values":["Faller, Newton"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-03-26T15:35:35Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2026-05-16T03:05:25Z"]},{"key":"dc:date.issued","label":"Date","values":["1973-12"]},{"key":"dc:publisher","label":"Institution","values":["Universidade Federal do Rio de Janeiro"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia"]},{"key":"dc:type","label":"Dc Type","values":["Dissertação"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Algoritmos","Reconhecimento de padrões","Compressão (computabilidade e complexidade)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["por"]},{"key":"dc:rights","label":"Dc Rights","values":["Acesso Aberto"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11422/3780"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["An interesting property is proven for Huffman's tree. Any two elements with weights ai and bi sons of a same father have the following property: if bi ≥ ai then Wm ≤ ai or Wm ≥ bi where Wm is the weight of any node of the tree. Based on this property, an algorithm is developed to dynamically update Huffman's tree as weights of terminal nodes change. Using this algorithm, a model of an adaptive system for data compression is developed. Simulation using many types of data led to interesting results."]},{"key":"dc:title","label":"Title","values":["Sistema adaptativo para compressão de dados"]}]}],"canonical_facts":{"dc:contributor.advisor":["Silva Filho, Ysmar Vianna e"],"dc:creator":["Faller, Newton"],"dc:date.accessioned":["2018-03-26T15:35:35Z"],"dc:date.available":["2026-05-16T03:05:25Z"],"dc:date.issued":["1973-12"],"dc:description.abstract":["An interesting property is proven for Huffman's tree. Any two elements with weights ai and bi sons of a same father have the following property: if bi ≥ ai then Wm ≤ ai or Wm ≥ bi where Wm is the weight of any node of the tree. Based on this property, an algorithm is developed to dynamically update Huffman's tree as weights of terminal nodes change. Using this algorithm, a model of an adaptive system for data compression is developed. Simulation using many types of data led to interesting results."],"dc:identifier.uri":["http://hdl.handle.net/11422/3780"],"dc:language":["por"],"dc:publisher":["Universidade Federal do Rio de Janeiro"],"dc:publisher.department":["Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia"],"dc:rights":["Acesso Aberto"],"dc:subject":["Algoritmos","Reconhecimento de padrões","Compressão (computabilidade e complexidade)"],"dc:title":["Sistema adaptativo para compressão de dados"],"dc:type":["Dissertação"]},"updated_at":"2026-07-24T01:16:10Z"}