Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Normal view MARC view ISBD view

HowNet and the computation of meaning [electronic resource] / Zhendong Dong, Qiang Dong.

By: Dong, Zhendong.
Contributor(s): Dong, Qiang.
Material type: TextTextPublisher: Hackensack, NJ : World Scientific, c2006Description: 1 online resource (xiv, 302 p.) : ill.ISBN: 9789812774675 (electronic bk.); 981277467X (electronic bk.); 9789812564917; 9812564918; 1281919624; 9781281919625.Subject(s): HowNet (Computer file) | Semantics -- Data processing | Lexicology -- Data processing | Phraseology -- Data processing | Natural language processing (Computer science) | Machine translating | Chinese language -- Data processing | English language -- Data processing | Electronic books | LANGUAGE ARTS & DISCIPLINES -- Linguistics -- SemanticsGenre/Form: Electronic books.Additional physical formats: Print version:: HowNet and the computation of meaning.DDC classification: 401.430285 Online resources: EBSCOhost Summary: The Euclidean algorithm is one of the oldest in mathematics, while the study of continued fractions as tools of approximation goes back at least to Euler and Legendre. While our understanding of continued fractions and related methods for simultaneous diophantine approximation has burgeoned over the course of the past decade and more, many of the results have not been brought together in book form. Continued fractions have been studied from the perspective of number theory, complex analysis, ergodic theory, dynamic processes, analysis of algorithms, and even theoretical physics, which has further complicated the situation. This book places special emphasis on continued fraction Cantor sets and the Hausdorff dimension, algorithms and analysis of algorithms, and multi-dimensional algorithms for simultaneous diophantine approximation. Extensive, attractive computer-generated graphics are presented, and the underlying algorithms are discussed and made available.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Accompanying CD-ROM contains Mini-HowNet, software to demonstrate concepts described in the text, and associated text files.

Includes bibliographical references (p. 275-283) and index.

English with some Chinese.

Description based on print version record.

The Euclidean algorithm is one of the oldest in mathematics, while the study of continued fractions as tools of approximation goes back at least to Euler and Legendre. While our understanding of continued fractions and related methods for simultaneous diophantine approximation has burgeoned over the course of the past decade and more, many of the results have not been brought together in book form. Continued fractions have been studied from the perspective of number theory, complex analysis, ergodic theory, dynamic processes, analysis of algorithms, and even theoretical physics, which has further complicated the situation. This book places special emphasis on continued fraction Cantor sets and the Hausdorff dimension, algorithms and analysis of algorithms, and multi-dimensional algorithms for simultaneous diophantine approximation. Extensive, attractive computer-generated graphics are presented, and the underlying algorithms are discussed and made available.

There are no comments for this item.

Log in to your account to post a comment.

Other editions of this work

HowNet and the computation of meaning by Dong, Zhendong. ©2006
HowNet and the computation of meaning by Dong, Zhendong. ©2006
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in


Visitor Counter