Research publications by Tristan Miller
![[LaTeX version]](http://www.nothingisreal.com/icons/nuvola-1.0/48x48/tex.png "LaTeX version")
LATEX![[DVI version]](http://www.nothingisreal.com/icons/nuvola-1.0/48x48/dvi.png "DVI version")
DVI![[HTML version]](http://www.nothingisreal.com/icons/nuvola-1.0/48x48/html.png "HTML version")
HTML![[PostScript version]](http://www.nothingisreal.com/icons/nuvola-1.0/48x48/ps.png "PostScript version")
PostScript![[PDF version]](http://www.nothingisreal.com/icons/nuvola-1.0/48x48/pdf.png "PDF version")
PDF
2006
-
Creare splendide slade con LATEX: Un'introduzione al pacchetto HA-prosper [Producing beautiful slides with LATEX: An introduction to the HA-prosper package]. Pluto Journal, (47), May 2006. Translated by Gabriele Zucchetta.
In questo articolo verrà presentato HA-prosper, un pacchetto LaTeX per la creazione di sofisticate slide. Ne descriveremo le caratteristiche mostrandone alcuni esempi d'uso. Inoltre, discuteremo quali vantaggi si possono trarre dal tipo di approccio, proprio della filosofia LaTeX, in rapporto agli altri tipi di programmi per presentazioni che generalmente sono presenti nelle attuali suite di applicazioni per ufficio.@article{miller2006producing,
author = {Tristan Miller},title = {Creare splendide slade con {\LaTeX}: Un'introduzione al pacchetto {HA-prosper} [{P}roducing Beautiful Slides with {\LaTeX}: An Introduction to the {HA-prosper} Package]},journal = {Pluto Journal},number = {47},month = may,year = {2006},note = {Translated by Gabriele Zucchetta.},} -
Word completion with latent semantic analysis. In Proceedings of the 18th International Conference on Pattern Recognition (ICPR 2006), pages 1252–1255. IEEE Press, August 2006. ISBN 0-7695-2521-0.
Current word completion tools rely mostly on statistical or syntactic knowledge. Can using semantic knowledge improve the completion task? We propose a languageindependent word completion algorithm which uses latent semantic analysis (LSA) to model the semantic context of the word being typed. We find that a system using this algorithm alone achieves keystroke savings of 56\% and a hit rate of 42\%. This represents improvements of 6.9\% and 17\%, respectively, over existing approaches.@inproceedings{miller2006word,
author = {Tristan Miller and Elisabeth Wolf},title = {Word Completion with Latent Semantic Analysis},booktitle = {Proceedings of the 18th International Conference on Pattern Recognition (ICPR 2006)},pages = {1252-1255},month = aug,year = {2006},publisher = {IEEE Press},isbn = {0-7695-2521-0},} -
On the use of topic models for word completion. In Proceedings of the 5th International Conference on Natural Language Processing (FinTAL 2006), volume 4139 of Lecture Notes in Artificial Intelligence, pages 500–511. Springer, August 2006. ISBN 978-3-540-37334-6.
We investigate the use of topic models, such as probabilistic latent semantic analysis (PLSA) and latent Dirichlet allocation (LDA), for word completion tasks. The advantage of using these models for such an application is twofold. On the one hand, they allow us to exploit semantic or contextual information when predicting candidate words for completion. On the other hand, these probabilistic models have been found to outperform classical latent semantic analysis (LSA) for modeling text documents. We describe a word completion algorithm that takes into account the semantic context of the word being typed. We also present evaluation metrics to compare different models being used in our study. Our experiments validate our hypothesis of using probabilistic models for semantic analysis of text documents and their application in word completion tasks.@inproceedings{wolf2006use,
author = {Elisabeth Wolf and Shankar Vembu and Tristan Miller},title = {On the use of topic models for word completion},booktitle = {Proceedings of the 5th International Conference on Natural Language Processing (FinTAL 2006)},volume = {4139},pages = {500-511},series = {Lecture Notes in Artificial Intelligence},month = aug,year = {2006},publisher = {Springer},isbn = {978-3-540-37334-6},}
2005
-
Security issues for pervasive personalized communication systems. In Dieter Hutter and Markus Ullmann, editors, Security in Pervasive Computing: Second International Conference, SPC 2005, Boppard, Germany, April 6–8, 2005, Proceedings, volume 3450 of Lecture Notes on Computer Science, pages 56–62, Heidelberg, April 2005. Springer Verlag. ISBN 3-540-25521-4.
Technological progress allows us to equip any mobile phone with new functionalities, such as storing personalized information about its owner and using the corresponding personal profile for enabling communication to persons whose mobile phones represent similar profiles. However, this raises very specific security issues, in particular relating to the use of Bluetooth technology. Herein we consider such scenarios and related problems in privacy and security matters. We analyze in which respect certain design approaches may fail or succeed at solving these problems. We concentrate on methods for designing the user-related part of the communication service appropriately in order to enhance confidentiality.@inproceedings{klein2005security,
author = {Bertin Klein and Tristan Miller and Sandra Zilles},editor = {Dieter Hutter and Markus Ullmann},title = {Security Issues for Pervasive Personalized Communication Systems},booktitle = {Security in Pervasive Computing: Second International Conference, SPC~2005, Boppard, Germany, April 6--8, 2005, Proceedings},volume = {3450},pages = {56-62},series = {Lecture Notes on Computer Science},month = apr,year = {2005},publisher = {Springer Verlag},address = {Heidelberg},isbn = {3-540-25521-4},} -
Biblet: A portable BibTEX bibliography style for generating highly customizable XHTML. TUGboat, 26(1):85–96, 2005. ISSN 0896-3207. Includes Practical TEX 2005 Conference Proceedings.
We present Biblet, a set of BibTeX bibliography styles (bst) which generate XHTML from BibTeX databases. Unlike other BibTeX to XML/HTML converters, Biblet is written entirely in the native BibTeX style language and therefore works ``out of the box'' on any system that runs BibTeX. Features include automatic conversion of LaTeX symbols to HTML or Unicode entities; customizable graphical hyperlinks to PostScript, PDF, DVI, LaTeX, and HTML resources; support for nonstandard but common fields such as day, isbn, and abstract; hideable text blocks; and output of the original BibTeX entry for sharing citations. Biblet's highly structured XHTML output means that bibliography appearance to can be drastically altered simply by specifying a Cascading Style Sheet (CSS), or easily postprocessed with third-party XML, HTML, or text processing tools. We compare and contrast Biblet to other common converters, describe basic usage of Biblet, give examples of how to produce custom-formatted bibliographies, and provide a basic overview of Biblet internals for those wishing to modify the style file itself.@article{miller2005biblet,
author = {Tristan Miller},title = {Biblet: A portable {\BibTeX}\ bibliography style for generating highly customizable {XHTML}},journal = {TUGboat},volume = {26},number = {1},pages = {85-96},year = {2005},issn = {0896-3207},note = {Includes Practical \TeX\ 2005 Conference Proceedings},} -
Producing beautiful slides with LATEX: An introduction to the HA-prosper package. The PracTEX Journal, 2(1), April 2005. ISSN 1556-6994.
In this paper, we present HA-prosper, a LaTeX package for creating overhead slides. We describe the features of the package and give examples of their use. We also discuss what advantages there are to producing slides with LaTeX versus the presentation software typically bundled with today's office suites.@article{miller2005producing,
author = {Tristan Miller},title = {Producing Beautiful Slides with {\LaTeX}: An Introduction to the {HA-prosper} Package},journal = {The Prac{\TeX}{} Journal},volume = {2},number = {1},month = apr,year = {2005},issn = {1556-6994},} -
Using the RPM Package Manager for (La)TEX packages. TUGboat, 26(1):17–28, 2005. ISSN 0896-3207. Includes Practical TEX 2005 Conference Proceedings.
RPM is a package management system which provides a uniform, automated way for users to install, upgrade, and uninstall programs. Because RPM is the default software distribution format for many operating systems (particularly GNU/Linux), users may find it useful to manage their library of TeX-related packages using RPM. This article explains how to produce RPM files for TeX software, either for personal use or for public distribution. We also explain how a (La)TeX user can find, install, and remove TeX-related RPM packages.@article{miller2005using,
author = {Tristan Miller},title = {Using the {RPM} {P}ackage {M}anager for ({L}a){\TeX}{} packages},journal = {TUGboat},volume = {26},number = {1},pages = {17-28},year = {2005},issn = {0896-3207},note = {Includes Practical \TeX\ 2005 Conference Proceedings},} -
Attention-based information retrieval using eye tracker data. In Proceedings of the Third International Conference on Knowledge Capture (K-CAP05), pages 209–210, September 2005.
We describe eFISK, an automated keyword extraction system which unobtrusively measures the user's attention in order to isolate and identify those areas of a written document the reader finds of greatest interest. Attention is measured by use of eye-tracking hardware consisting of a desk-mounted infrared camera which records various data about the user's eye. The keywords thus identified are subsequently used in the back end of an information retrieval system to help the user find other documents which contain information of interest to him. Unlike traditional IR techniques which compare documents simply on the basis of common terms withal, our system also accounts for the weights users implicitly attach to certain words or sections of the source document. We describe a task-based user study which compares the utility of standard relevance feedback techniques to the keywords and keyphrases discovered by our system in finding other relevant documents from a corpus.@inproceedings{miller2005identifying,
author = {Tristan Miller and Stefan Agne},title = {Attention-based information retrieval using eye tracker data},booktitle = {Proceedings of the Third International Conference on Knowledge Capture ({K-CAP05})},pages = {209-210},month = sep,year = {2005},} -
eFISK – eine aufmerksamkeitsbasierte Schlüsselwort-Extraktions- und Information Retrieval-Maschine. Abschlussbericht 15202-386261/659, Stiftung Rheinland-Pfalz für Innovation, June 2005.
@techreport{miller2005efisk,
author = {Tristan Miller and Stefan Agne and Andreas Dengel},title = {{eFISK}~-- eine aufmerksamkeitsbasierte {S}chl{\"{u}}sselwort-{E}xtraktions- und {I}nformation {R}etrieval-{M}aschine},number = {15202-386261/659},type = {Abschlussbericht},month = jun,year = {2005},institution = {Stiftung Rheinland-Pfalz f{\"{u}}r Innovation},}
2004
-
Latent semantic analysis and the construction of coherent extracts. In Nicolas Nicolov, Kalina Botcheva, Galia Angelova, and Ruslan Mitkov, editors, Recent Advances in Natural Language Processing III, volume 260 of Current Issues in Linguistic Theory (CILT), pages 277–286. John Benjamins, Amsterdam/Philadelphia, 2004. ISBN 1588116182.
We describe a language-neutral automatic summarization system which aims to produce coherent extracts. It builds an initial extract composed solely of topic sentences, and then recursively fills in the topical lacunae by providing linking material between semantically dissimilar sentences. While experiments with human judges did not prove a statistically significant increase in textual coherence with the use of a latent semantic analysis module, we found a strong positive correlation between coherence and overall summary quality.@incollection{miller2004latent,
author = {Tristan Miller},editor = {Nicolas Nicolov and Kalina Botcheva and Galia Angelova and Ruslan Mitkov},title = {Latent Semantic Analysis and the Construction of Coherent Extracts},booktitle = {Recent Advances in Natural Language Processing {III}},volume = {260},pages = {277-286},series = {Current Issues in Linguistic Theory (CILT)},year = {2004},publisher = {John Benjamins},address = {Amsterdam/Philadelphia},isbn = {1588116182},}
2003
-
Essay assessment with latent semantic analysis. Journal of Educational Computing Research, 29(4):495–512, 2003. ISSN 0735-6331.
Latent semantic analysis (LSA) is an automated, statistical technique for comparing the semantic similarity of words or documents. In this paper, I examine the application of LSA to automated essay scoring. I compare LSA methods to earlier statistical methods for assessing essay quality, and critically review contemporary essay-scoring systems built on LSA, including the Intelligent Essay Assessor, Summary Street, State the Essence, Apex, and Select-a-Kibitzer. Finally, I discuss current avenues of research, including LSA's application to computer-measured readability assessment and to automatic summarization of student essays.@article{miller2003essay,
author = {Tristan Miller},title = {Essay Assessment with Latent Semantic Analysis},journal = {Journal of Educational Computing Research},volume = {29},number = {4},pages = {495-512},year = {2003},issn = {0735-6331},} -
Generating coherent extracts of single documents using latent semantic analysis. Master's thesis, Department of Computer Science, University of Toronto, March 2003.
A major problem with automatically-produced summaries in general, and extracts in particular, is that the output text often lacks textual coherence. Our goal is to improve the textual coherence of automatically produced extracts. We developed and implemented an algorithm which builds an initial extract composed solely of topic sentences, and then recursively fills in the lacunae by providing linking material from the original text between semantically dissimilar sentences. Our summarizer differs in architecture from most others in that it measures semantic similarity with latent semantic analysis (LSA), a factor analysis technique based on the vector-space model of information retrieval. We believed that the deep semantic relations discovered by LSA would assist in the identification and correction of abrupt topic shifts in the summaries. However, our experiments did not show a statistically significant difference in the coherence of summaries produced by our system as compared with a non-LSA version.@mastersthesis{miller2003generating,
author = {Tristan Miller},title = {Generating Coherent Extracts of Single Documents Using Latent Semantic Analysis},month = mar,year = {2003},school = {Department of Computer Science, University of Toronto},} -
Latent semantic analysis and the construction of coherent extracts. In Galia Angelova, Kalina Bontcheva, Ruslan Mitkov, Nicolas Nicolov, and Nikolai Nikolov, editors, International Conference Recent Advances in Natural Language Processing 2003 Proceedings, pages 270–277, September 2003. ISBN 954-90906-6-3.
We describe a language-neutral automatic summarization system which aims to produce coherent extracts. It builds an initial extract composed solely of topic sentences, and then recursively fills in the topical lacunae by providing linking material between semantically dissimilar sentences. While experiments with human judges did not prove a statistically significant increase in textual coherence with the use of a latent semantic analysis module, we found a strong positive correlation between coherence and overall summary quality.@inproceedings{miller2003latent,
author = {Tristan Miller},editor = {Galia Angelova and Kalina Bontcheva and Ruslan Mitkov and Nicolas Nicolov and Nikolai Nikolov},title = {Latent Semantic Analysis and the Construction of Coherent Extracts},booktitle = {International Conference Recent Advances in Natural Language Processing 2003 Proceedings},pages = {270-277},month = sep,year = {2003},isbn = {954-90906-6-3},}
2001
-
Efficient defeasible reasoning systems. International Journal on Artificial Intelligence Tools, 10(4):483–501, 2001. ISSN 0218-2130.
For many years, the non-monotonic reasoning community has focussed on highly expressive logics. Such logics have turned out to be computationally expensive, and have given little support to the practical use of non-monotonicreasoning. In this work we discuss defeasible logic, a less-expressive but more efficient non-monotonic logic. We report on two new implemented systems for defeasible logic: a query answering system employing a backward-chaining approach, and a forward-chaining implementation that computes all conclusions. Our experimental evaluation demonstrates that the systems can deal with large theories (up to hundreds of thousands of rules). We show that defeasible logic has linear complexity, which contrasts markedly with most other non-monotonic logics and helps to explain the impressive experimental results. We believe that defeasible logic, with its efficiency and simplicity, is a good candidate to be used as a modelling language for practical applications, including modelling of regulations and business rules.@article{maher2001efficient,
author = {Michael J. Maher and Allan Rock and Grigoris Antoniou and David Billington and Tristan Miller},title = {Efficient Defeasible Reasoning Systems},journal = {International Journal on Artificial Intelligence Tools},volume = {10},number = {4},pages = {483-501},year = {2001},issn = {0218-2130},} -
Essay assessment with latent semantic analysis. Technical Report CSRG-440, Department of Computer Science, University of Toronto, May 2001.
@techreport{miller2001essay,
author = {Tristan Miller},title = {Essay Assessment with Latent Semantic Analysis},number = {{CSRG-440}},type = {Technical Report},month = may,year = {2001},institution = {Department of Computer Science, University of Toronto},}
2000
-
Efficient defeasible reasoning systems. In Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), pages 384–392. IEEE Press, December 2000. ISBN 0-7695-0909-6.
For many years, the non-monotonic reasoning community has focussed on highly expressive logics. Such logics have turned out to be computationally expensive, and have given little support to the practical use of non-monotonicreasoning. In this work we discuss defeasible logic, a less-expressive but more efficient non-monotonic logic. We report on two new implemented systems for defeasible logic: a query answering system employing a backward-chaining approach, and a forward-chaining implementation that computes all conclusions. Our experimental evaluation demonstrates that the systems can deal with large theories (up to hundreds of thousands of rules). We show that defeasible logic has linear complexity, which contrasts markedly with most other non-monotonic logics and helps to explain the impressive experimental results. We believe that defeasible logic, with its efficiency and simplicity, is a good candidate to be used as a modelling language for practical applications, including modelling of regulations and business rules.@inproceedings{maher2000efficient,
author = {Michael J. Maher and Allan Rock and Grigoris Antoniou and David Billington and Tristan Miller},title = {Efficient Defeasible Reasoning Systems},booktitle = {Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI~2000)},pages = {384-392},month = dec,year = {2000},publisher = {IEEE Press},isbn = {0-7695-0909-6},} -
DELORES User's Manual. School of Computing and Information Technology, Griffith University, 2000.
@manual{miller2000delores,
author = {Tristan Miller},title = {{DELORES} User's Manual},year = {2000},organization = {School of Computing and Information Technology, Griffith University},}
1999
-
A well-behaved algorithm for simulating dependence structures of Bayesian networks. International Journal of Applied Mathematics, 1(8):923–932, 1999. ISSN 1311-1728.
Automatic generation of Bayesian network (BN) structures (directed acyclic graphs) is an important step in experimental study of algorithms for inference in BNs and algorithms for learning BNs from data. Previously known simulation algorithms do not guarantee connectedness of generated structures or even successful genearation according to a user specification. We propose a simple, efficient and well-behaved algorithm for automatic generation of BN structures. The performance of the algorithm is demonstrated experimentally.@article{xiang1999wellbehaved,
author = {Yang Xiang and Tristan Miller},title = {A Well-behaved Algorithm for Simulating Dependence Structures of {B}ayesian Networks},journal = {International Journal of Applied Mathematics},volume = {1},number = {8},pages = {923-932},year = {1999},issn = {1311-1728},}
