Jorge Stolfi

Jorge Stolfi (born São Paulo, 1950) is a full professor of computer science at the State University of Campinas, working in computer vision, image processing, splines and other function approximation methods, graph theory, computational geometry and several other fields.[1][2] According to the ISI Web Of Science, as of 2010 he was the most highly cited computer scientist in Brazil.[3]

Jorge Stolfi was born in Vila Carrão, a suburb of São Paulo. His parents had immigrated to Brazil from the Veneto region of Italy only two years earlier, and so he spoke Venetian as his first language. He obtained an engineering degree in electronics (1973) and M.Sc. in applied mathematics (1979) from the University of São Paulo. From 1979 to 1988 he was a student of Leo Guibas at Stanford University, where he got a Ph.D in computer science. He had a CNPq grant from 1979 to 1983, then a research internship at Xerox PARC until 1985, and also at the DEC Systems Research Center (SRC) until 1988. After obtaining his Ph.D. he became a research engineer at SRC.

In 1992 he returned to Brazil to take a position at the Computer Science Department of the University of Campinas (UNICAMP), which later became the university's Institute of Computing. He was the institute's chairman from 2004 to 2008. Despite that, Stolfi has been criticised by students for not correcting undergraduate tests in 2016 and awarding random grades.[4]

Research

While at Stanford, Leo Guibas and Jorge worked on the then-new field of computational geometry. Among other results they developed the quad-edge data structure for two-dimensional maps,[5] the kinetic framework for computational geometry.[6] Jorge's Ph.D. dissertation on oriented projective geometry was later published as a book.[7] He also drew dozens of cartoons for the DEC SRC technical reports.[8]

In 1992 Jorge collected and widely disseminated (through the historic DEC gatekeeper ftp archives and Prime Time Freeware) a set of wordlists that later formed the basis of the ispell resources (later myspell, currently part of OpenOffice.org and Mozilla as hunspell).

After moving to UNICAMP, Jorge developed affine arithmetic, a model for self-validated computation (which he had conceived in 1991), in collaboration with Marcus Andrade, João Comba, and Luiz Figueiredo.[9][10]

At UNICAMP Jorge also worked with C. Lucchesi and T.Kowaltowski on finite state transducer technology for spell checking and other natural language processing tasks.[11] With his student H. Leitão he developed an efficient algorithm for pottery fragment reassembly by multiscale outline matching, and analyzed the density of useful information contained in those outlines.[12] He has also contributed to the study of the Voynich manuscript.

Since 2001 Jorge has been involved in efforts to raise public and government awareness about the insecurity of Brazilian electronic voting machines, which are of the direct recording electronic (DRE) type and therefore vulnerable to massive and undetectable software-based vote-stealing.[13]

Bitcoin activities

In late 2013 Jorge took an active interest in the economics of cryptocurrencies. He became skeptical about its underlying soundness and chances of success and has been advising the Brazilian public against investment in bitcoin.[14] In 2016 he submitted a letter to the SEC outlining what he perceives as similarities between Bitcoin and penny stocks or ponzi schemes. [15]

References

  1. ↑ "Jorge Stolfi". the Lattes database of Brazilian Researchers. Brazilian Council for Scientific and Technological Development. 2010.
  2. ↑ "Jorge Stolfi". DBLP. University of Trier.
  3. ↑ "ISI Highly Cited Researchers in Brazil". Thomson Institute of Scientific Information. Retrieved 2010-12-28.
  4. ↑ "Centro Acadêmico da Computação". www.caco.ic.unicamp.br. Retrieved 2016-07-21.
  5. ↑ Guibas, Leonidas J.; Stolfi, Jorge (1985). "Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams" (PDF). ACM Transactions on Graphics. 4 (2): 75–123. doi:10.1145/282918.282923.
  6. ↑ Guibas, Leo; Ramshaw, Lyle; Stolfi, Jorge (1983). "A Kinetic Framework for Computational Geometry". Proceedings of the 24th Annual Symposium on Foundations of Computer Science. pp. 100–111. doi:10.1109/SFCS.1983.1.
  7. ↑ Stolfi, Jorge (1991). Oriented Projective Geometry. Academic Press. ISBN 978-0-12-672025-9.
    From original Stanford Ph.D. dissertation, Primitives for Computational Geometry, available as DEC SRC Research Report 36, published by HP Labs. Accessed 2010-12-28.
  8. ↑ Mason, James (1993). "The First 99 Reports". DEC SRC Report 100. HP Labs. Retrieved 2010-12-28.
  9. ↑ Comba, J. L. D.; Stolfi, J. (1993). Affine arithmetic and its applications to computer graphics (PDF). Proc. SIBGRAPI'93 - VI Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens (Recife, BR). pp. 9–18. CiteSeerX 10.1.1.37.6453Freely accessible.
  10. ↑ de Figueiredo, L. H.; Stolfi, J. (2004). "Affine arithmetic: concepts and applications". Numerical Algorithms. 37 (1–4): 147–158. Bibcode:2004NuAlg..37..147D. CiteSeerX 10.1.1.12.4302Freely accessible. doi:10.1023/B:NUMA.0000049462.70970.b6.
  11. ↑ Lucchesi, C. L.; Kowaltowski, T.; Stolfi, J. (April 1995). "Applications of finite automata in debugging natural language vocabularies". Journal of the Brazilian Computer Society. 1 (3): 36–42. CiteSeerX 10.1.1.36.9713Freely accessible.
  12. ↑ da Gama Leitão, Helena Cristina; Stolfi, Jorge (2002). "A Multiscale Method for the Reassembly of Two-Dimensional Fragmented Objects". IEEE Transactions on Pattern Analysis and Machine Intelligence. 24 (9): 1239–1251. doi:10.1109/tpami.2002.1033215.
  13. ↑ Vicentin, Carolina (2010-07-05). "Voto digital contra a fraude". Correio Braziliense (in Portuguese). Retrieved 2010-12-28.
  14. ↑ (2013) Cuidado com Bitcoin!. Blogpost (in Portuguese) at AdVivo.com, Accessed on 2014-04-12.
  15. ↑ (2016) Letter to the SEC dated 2016-07-13

External links

This article is issued from Wikipedia - version of the 11/10/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.