Blaise Pascal's adding machine: new findings and conclusions
Pages 69 - 76
Abstract
Ever since its invention and initial description in 1652, Blaise Pascal's adding machine has been the subject of numerous studies and publications (D. Diderot and J.L. d'Alembert, 1751). However, when compiling and systematically analyzing the literature, a rather diffuse image emerges. For one thing, the method of subtraction is not accurately described. The article attempts to find out how one could have used Pascal's Adding Machine (PAM), had it ever functioned properly. In addition, this is an attempt to provide a comprehensive functional description of the machine
Recommendations
Twin support vector machine: theory, algorithm and applications
Twin support vector machine (TWSVM) has gained increasing interest from various research fields recently. In this paper, we aim to report the current state of the theoretical research and practical advances on TWSVM. We first give the basic thought and ...
[The Institute Blaise Pascal Machine] French computing machine projects
The early British computer conferencesSelf-Universum support vector machine
In this paper, for an improved twin support vector machine (TWSVM), we give it a theoretical explanation based on the concept of Universum and then name it Self-Universum support vector machine (SUSVM). For the binary classification problem, SUSVM takes ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1998.
Publisher
IEEE Educational Activities Department
United States
Publication History
Published: 01 January 1998
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Dec 2024