summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/bibtex/bib/beebe/texbook3.bib
diff options
context:
space:
mode:
authorKarl Berry <karl@freefriends.org>2019-12-04 00:54:01 +0000
committerKarl Berry <karl@freefriends.org>2019-12-04 00:54:01 +0000
commit619ccf91ac99f46d187c0925ab0f2a4ee0474b47 (patch)
treeb61ced0531dffd735fc8f25bdafc62ee6fa44258 /Master/texmf-dist/bibtex/bib/beebe/texbook3.bib
parente04dfacf57c99bb8575d701c8096df192475be1a (diff)
tl-update-auto
git-svn-id: svn://tug.org/texlive/trunk@53017 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/bibtex/bib/beebe/texbook3.bib')
-rw-r--r--Master/texmf-dist/bibtex/bib/beebe/texbook3.bib58
1 files changed, 50 insertions, 8 deletions
diff --git a/Master/texmf-dist/bibtex/bib/beebe/texbook3.bib b/Master/texmf-dist/bibtex/bib/beebe/texbook3.bib
index bc3891832f9..bafd1ea59e2 100644
--- a/Master/texmf-dist/bibtex/bib/beebe/texbook3.bib
+++ b/Master/texmf-dist/bibtex/bib/beebe/texbook3.bib
@@ -5,9 +5,9 @@
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
-%%% version = "3.77",
-%%% date = "05 August 2019",
-%%% time = "14:59:54 MDT",
+%%% version = "3.78",
+%%% date = "03 December 2019",
+%%% time = "08:41:48 MDT",
%%% filename = "texbook3.bib",
%%% address = "University of Utah
%%% Department of Mathematics, 110 LCB
@@ -17,7 +17,7 @@
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 581 4148",
%%% URL = "http://www.math.utah.edu/~beebe",
-%%% checksum = "35775 22434 101018 958098",
+%%% checksum = "11221 22476 101283 960510",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
@@ -37,7 +37,7 @@
%%% covered in separate bibliographies
%%% (ep.bib, epodd.bib, and sgml.bib).
%%%
-%%% At version 3.77, the year coverage looks
+%%% At version 3.78, the year coverage looks
%%% like this:
%%%
%%% 1928 ( 1) 1959 ( 0) 1990 ( 54)
@@ -49,7 +49,7 @@
%%% 1934 ( 0) 1965 ( 0) 1996 ( 15)
%%% 1935 ( 0) 1966 ( 0) 1997 ( 24)
%%% 1936 ( 0) 1967 ( 1) 1998 ( 7)
-%%% 1937 ( 0) 1968 ( 1) 1999 ( 10)
+%%% 1937 ( 0) 1968 ( 1) 1999 ( 11)
%%% 1938 ( 0) 1969 ( 1) 2000 ( 6)
%%% 1939 ( 0) 1970 ( 2) 2001 ( 11)
%%% 1940 ( 0) 1971 ( 1) 2002 ( 5)
@@ -79,7 +79,7 @@
%%% InCollection: 13
%%% InProceedings: 125
%%% Manual: 16
-%%% MastersThesis: 3
+%%% MastersThesis: 4
%%% Misc: 16
%%% Periodical: 1
%%% PhdThesis: 12
@@ -87,7 +87,7 @@
%%% TechReport: 60
%%% Unpublished: 2
%%%
-%%% Total entries: 839
+%%% Total entries: 840
%%%
%%% The ISBN and ISSN fields will be printed if
%%% the is-alpha.bst or is-plain.bst style
@@ -15136,6 +15136,48 @@
keywords = "Constraint Scalable Vector Graphics (CSVG)",
}
+@MastersThesis{Matsakis:1999:RHM,
+ author = "Nicholas E. (Nicholas Elias) Matsakis",
+ title = "Recognition of handwritten mathematical expressions",
+ school = "Department of Electrical Engineering and Computer
+ Science, Massachusetts Institute of Technology",
+ address = "Cambridge, MA, USA",
+ pages = "59",
+ year = "1999",
+ LCCN = "????",
+ bibdate = "Tue Dec 3 08:34:30 MST 2019",
+ bibsource = "fsz3950.oclc.org:210/WorldCat;
+ http://www.math.utah.edu/pub/tex/bib/texbook3.bib",
+ URL = "http://hdl.handle.net/1721.1/16727",
+ abstract = "In recent years, the recognition of handwritten
+ mathematical expressions has received an increasing
+ amount of attention in pattern recognition research.
+ The diversity of approaches to the problem and the lack
+ of a commercially viable system, however, indicate that
+ there is still much research to be done in this area.
+ In this thesis, I will describe an on-line approach for
+ converting a handwritten mathematical expression into
+ an equivalent expression in a typesetting command
+ language such as \TeX{} or MathML, as well as a
+ feedback-oriented user interface which can make errors
+ more tolerable to the end user since they can be
+ quickly corrected. The three primary components of this
+ system are a method for classifying isolated
+ handwritten symbols, an algorithm for partitioning an
+ expression into symbols, and an algorithm for
+ converting a two-dimensional arrangements of symbols
+ into a typeset expression. For symbol classification, a
+ Gaussian classifier is used to rank order the
+ interpretations of a set of strokes as a single symbol.
+ To partition an expression, the values generated by the
+ symbol classifier are used to perform a constrained
+ search of possible partitions for the one with the
+ minimum summed cost. Finally, the expression is parsed
+ using a simple geometric grammar.",
+ acknowledgement = ack-nhfb,
+ author-dates = "1976--",
+}
+
@Article{Matthews:2019:CBE,
author = "David Matthews",
title = "Craft beautiful equations in {Word} with {\LaTeX}",