Linas Vepstas
Research Subjects
Research Interests
Linas Vepstas has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Andrew D. Jackson
The Niels Bohr International Academy Blegdamsvej 17 DK-2100 Copenhagen Denmark
6 shared publications E. Wüst
Department of Physics, State University of New York, Stony Brook, New York 11794, USA
3 shared publicationsMichael Ross
Fujian Key Lab of the Brain-Like Intelligent Systems, Xiamen University, Xiamen, China
2 shared publicationsMurilo Queiroz
Novamente LLC, 1405 Bernerd Place, Rockville MD 20851
2 shared publicationsA.S. Goldhaber
1 shared publicationAndre Senna
1 shared publication
Latest Publications
- Open Access
On the Beta Transformation
The beta transformation is the iterated map $\beta x\,\mod1$; it generates the base-$\beta$ expansion of a real number x. Every iterated piece-wise monotonic map is topologically conjugate to the beta transformation. For all but a countable subset of $\beta$, the orbits of $x$ are ergodic; yet it is the finite orbits that determine overall behavior. This is a large text; it splits into four parts. The first part provides a review of general concepts and properties associated with the beta shift. The second part examines the spectrum of the Ruelle-Frobenius-Perron operator, and gives explicit expressions for a set of bounded eigenfunctions. These form a discrete spectrum, accumulating on a circle of radius $1/\beta$ in the complex plane. The third part examines the finite and the periodic orbits. These are in one-to-one correspondence with monic integer polynomials. They are "quasi-cyclotomic" and can be counted with Moreau's necklace-counting function; curiously, they do not have any obvious relation to other systems countable by the necklace function. The positive real roots are dense in the reals; they include the Golden and silver ratios, the Pisot numbers, the n-bonacci (tribonacci, tetranacci, etc.) numbers. The beta-polynomials yoke all of these together into a regular structure. An explicit bijection to the rationals is presented. The fourth part of this text examines small perturbations. These introduce Arnold tongues, which inflate the finite orbits, a set of measure zero, to finite size. This text assumes very little mathematical sophistication on the part of the reader, and should be approachable for any enthusiast with minimal or no prior experience in ergodic theory. Most of the development is casual. As a side effect, the introductory sections are perhaps a fair bit longer than strictly needed to present the new results.Open AccessOn the Beta Transformation
The beta transformation is the iterated map $\beta x\,\mod1$; it generates the base-$\beta$ expansion of a real number x. Every iterated piece-wise monotonic map is topologically conjugate to the beta transformation. For all but a countable subset of $\beta$, the orbits of $x$ are ergodic; yet it is the finite orbits that determine overall behavior. This is a large text; it splits into four parts. The first part provides a review of general concepts and properties associated with the beta shift. The second part examines the spectrum of the Ruelle-Frobenius-Perron operator, and gives explicit expressions for a set of bounded eigenfunctions. These form a discrete spectrum, accumulating on a circle of radius $1/\beta$ in the complex plane. The third part examines the finite and the periodic orbits. These are in one-to-one correspondence with monic integer polynomials. They are "quasi-cyclotomic" and can be counted with Moreau's necklace-counting function; curiously, they do not have any obvious relation to other systems countable by the necklace function. The positive real roots are dense in the reals; they include the Golden and silver ratios, the Pisot numbers, the n-bonacci (tribonacci, tetranacci, etc.) numbers. The beta-polynomials yoke all of these together into a regular structure. An explicit bijection to the rationals is presented. The fourth part of this text examines small perturbations. These introduce Arnold tongues, which inflate the finite orbits, a set of measure zero, to finite size. This text assumes very little mathematical sophistication on the part of the reader, and should be approachable for any enthusiast with minimal or no prior experience in ergodic theory. Most of the development is casual. As a side effect, the introductory sections are perhaps a fair bit longer than strictly needed to present the new results. - 14 January 2023
- Published by Springer Nature
- p. 413-423
Grammar Induction - Experimental Results
- 14 January 2023
- Published by Springer Nature
- p. 134-144
Purely Symbolic Induction of Structure
- Open Access
Sheaves: A Topological Approach to Big Data
This document develops general concepts useful for extracting knowledge embedded in large graphs or datasets that have pair-wise relationships, such as cause-effect-type relations. Almost no underlying assumptions are made, other than that the data can be presented in terms of pair-wise relationships between objects/events. This assumption is used to mine for patterns in the dataset, defining a reduced graph or dataset that boils-down or concentrates information into a more compact form. The resulting extracted structure or set of patterns are manifestly symbolic in nature, as they capture and encode the graph structure of the dataset in terms of a (generative) grammar. This structure is identified as having the formal mathematical structure of a sheaf. In essence, this paper introduces the basic concepts of sheaf theory into the domain of graphical datasets.
Open AccessSheaves: A Topological Approach to Big Data
This document develops general concepts useful for extracting knowledge embedded in large graphs or datasets that have pair-wise relationships, such as cause-effect-type relations. Almost no underlying assumptions are made, other than that the data can be presented in terms of pair-wise relationships between objects/events. This assumption is used to mine for patterns in the dataset, defining a reduced graph or dataset that boils-down or concentrates information into a more compact form. The resulting extracted structure or set of patterns are manifestly symbolic in nature, as they capture and encode the graph structure of the dataset in terms of a (generative) grammar. This structure is identified as having the formal mathematical structure of a sheaf. In essence, this paper introduces the basic concepts of sheaf theory into the domain of graphical datasets.
- Open Access
- 28 January 2014
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 9 (1) , e85733
Predicting the Risk of Suicide by Analyzing the Text of Clinical Notes
We developed linguistics-driven prediction models to estimate the risk of suicide. These models were generated from unstructured clinical notes taken from a national sample of U.S. Veterans Administration (VA) medical records. We created three matched cohorts: veterans who committed suicide, veterans who used mental health services and did not commit suicide, and veterans who did not use mental health services and did not commit suicide during the observation period (n = 70 in each group). From the clinical notes, we generated datasets of single keywords and multi-word phrases, and constructed prediction models using a machine-learning algorithm based on a genetic programming framework. The resulting inference accuracy was consistently 65% or more. Our data therefore suggests that computerized text analytics can be applied to unstructured medical records to estimate the risk of suicide. The resulting system could allow clinicians to potentially screen seemingly healthy patients at the primary care level, and to continuously evaluate the suicide risk among psychiatric patients.
- 28 January 2014
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 9 (1) , e85733
Open AccessPredicting the Risk of Suicide by Analyzing the Text of Clinical Notes
We developed linguistics-driven prediction models to estimate the risk of suicide. These models were generated from unstructured clinical notes taken from a national sample of U.S. Veterans Administration (VA) medical records. We created three matched cohorts: veterans who committed suicide, veterans who used mental health services and did not commit suicide, and veterans who did not use mental health services and did not commit suicide during the observation period (n = 70 in each group). From the clinical notes, we generated datasets of single keywords and multi-word phrases, and constructed prediction models using a machine-learning algorithm based on a genetic programming framework. The resulting inference accuracy was consistently 65% or more. Our data therefore suggests that computerized text analytics can be applied to unstructured medical records to estimate the risk of suicide. The resulting system could allow clinicians to potentially screen seemingly healthy patients at the primary care level, and to continuously evaluate the suicide risk among psychiatric patients.
- Open Access
- 11 January 2012
- Published by Springer Nature in The Ramanujan Journal
- Vol. 27 (3) , 387-408
On Plouffe’s Ramanujan identities
- 11 January 2012
- Published by Springer Nature in The Ramanujan Journal
- Vol. 27 (3) , 387-408
Open AccessOn Plouffe’s Ramanujan identities
- Open Access
Yet Another Riemann Hypothesis
This short note presents a peculiar generalization of the Riemann hypothesis, as the action of the permutation group on the elements of continued fractions. The problem is difficult to attack through traditional analytic techniques, and thus this note focuses on providing a numerical survey. These results indicate a broad class of previously unexamined functions may obey the Riemann hypothesis in general, and even share the non-trivial zeros in particular.
Open AccessYet Another Riemann Hypothesis
This short note presents a peculiar generalization of the Riemann hypothesis, as the action of the permutation group on the elements of continued fractions. The problem is difficult to attack through traditional analytic techniques, and thus this note focuses on providing a numerical survey. These results indicate a broad class of previously unexamined functions may obey the Riemann hypothesis in general, and even share the non-trivial zeros in particular.
- 1 December 2010
- Published by Elsevier in Neurocomputing
- Vol. 74 (1-3) , 95-103
Sentence generation for artificial brains: A glocal similarity-matching approach
- 1 December 2010
- Published by Elsevier in Neurocomputing
- Vol. 74 (1-3) , 95-103
Sentence generation for artificial brains: A glocal similarity-matching approach
- 30 July 2010
- Published by John Benjamins Publishing Company in Corpus Studies of Language Through Time
- Vol. 15 (3) , 363-369
Structure in Linguistics
- 30 July 2010
- Published by John Benjamins Publishing Company in Corpus Studies of Language Through Time
- Vol. 15 (3) , 363-369
Structure in Linguistics
- Open Access
- 1 January 2010
- Published by Atlantis Press SARL
A General Intelligence Oriented Architecture for Embodied Natural Language Processing
- 1 January 2010
- Published by Atlantis Press SARL
Open AccessA General Intelligence Oriented Architecture for Embodied Natural Language Processing