Pub Date : 2024-04-19DOI: 10.1109/mahc.2024.3391616
Verónica Uribe del Águila
{"title":"Making Innovation in the Mexican Silicon Valley: The Early Years of El Centro de Tecnología de Semiconductores (1981-2001)","authors":"Verónica Uribe del Águila","doi":"10.1109/mahc.2024.3391616","DOIUrl":"https://doi.org/10.1109/mahc.2024.3391616","url":null,"abstract":"","PeriodicalId":55033,"journal":{"name":"IEEE Annals of the History of Computing","volume":"15 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140628882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"哲学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-09DOI: 10.1109/mahc.2024.3384915
Andrew Lison
{"title":"Hardware Standardization and State-Socialist Piracy: The Global Reach of the Zilog Z80","authors":"Andrew Lison","doi":"10.1109/mahc.2024.3384915","DOIUrl":"https://doi.org/10.1109/mahc.2024.3384915","url":null,"abstract":"","PeriodicalId":55033,"journal":{"name":"IEEE Annals of the History of Computing","volume":"93 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140575101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"哲学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1109/mahc.2024.3365854
Alan Patterson
Dr. Morris Chang is a Taiwanese-American businessman and electrical engineer. He built his career first in the United States at Texas Instruments and then subsequently in Taiwan. He is the Founder as well as Former Chairman and CEO of Taiwan Semiconductor Manufacturing Company (TSMC), the first and largest semiconductor foundry in the world, whose unique model for outsourcing IC fabrication revolutionized the ability of firms everywhere to build their own chips and make innovative products.
{"title":"Interview of Morris Chang","authors":"Alan Patterson","doi":"10.1109/mahc.2024.3365854","DOIUrl":"https://doi.org/10.1109/mahc.2024.3365854","url":null,"abstract":"Dr. Morris Chang is a Taiwanese-American businessman and electrical engineer. He built his career first in the United States at Texas Instruments and then subsequently in Taiwan. He is the Founder as well as Former Chairman and CEO of Taiwan Semiconductor Manufacturing Company (TSMC), the first and largest semiconductor foundry in the world, whose unique model for outsourcing IC fabrication revolutionized the ability of firms everywhere to build their own chips and make innovative products.","PeriodicalId":55033,"journal":{"name":"IEEE Annals of the History of Computing","volume":"72 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140575645","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"哲学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1109/mahc.2024.3364901
Stanley Mazor
Prior to the availability of electronic calculators, people used voluminous published data tables to quickly provide transcendental functions, square roots, and logarithms. One would look up a value; if the exact entry was not there, then interpolation between two neighboring values gave an estimate. Such tables are also useful for getting a first-guess value when using iteration to get a better result, as with Newton's method for obtaining a square root. In 1909, Percy Ludgate invented a programmable mechanical computer [1], [2] and suggested doing division, a/b, with multiplication hardware for a × b −1 , but taking the reciprocal of b without a division. To get a reciprocal he proposed a lookup table for the first estimate and then a novel iterative method explained here. Each successive estimate for b −1 uses a multiply and then a subtract. Nearly 90 years later, Intel's Pentium CPUs and other microprocessors also began using an on-chip table for their divide operations. 1 To get the reciprocal N −1 (1/N) when division is not available or practical, the reciprocal can be calculated using an iterative scheme. Note that the product of N −1 × N should equal a value very close to 1, after which the estimated N −1 can be improved proportionally in successive steps.
在有电子计算器之前，人们使用大量出版的数据表来快速提供超越函数、平方根和对数。人们可以查找一个值；如果没有精确的条目，则可以通过两个相邻值之间的内插法得出一个估计值。当使用迭代法获得更好的结果时，这种表格也有助于获得一个初步估计值，就像牛顿求平方根的方法一样。1909 年，Percy Ludgate 发明了可编程机械计算机[1]、[2]，并建议用 a × b-1 的乘法硬件进行 a/b 除法运算，但取 b 的倒数时不进行除法运算。为了得到倒数，他建议使用查找表进行第一次估算，然后使用一种新颖的迭代方法，在此进行说明。对 b-1 的每次连续估计都使用乘法，然后再减法。将近 90 年后，英特尔的奔腾 CPU 和其他微处理器也开始使用片上查找表进行除法运算。1 当除法运算无法使用或不实用时，可以使用迭代方案计算倒数 N-1 (1/N)。需要注意的是，N-1 × N 的乘积应等于一个非常接近 1 的值，之后，N-1 的估计值可按比例逐级改进。
{"title":"Easy Reciprocals","authors":"Stanley Mazor","doi":"10.1109/mahc.2024.3364901","DOIUrl":"https://doi.org/10.1109/mahc.2024.3364901","url":null,"abstract":"Prior to the availability of electronic calculators, people used voluminous published data tables to quickly provide transcendental functions, square roots, and logarithms. One would look up a value; if the exact entry was not there, then interpolation between two neighboring values gave an estimate. Such tables are also useful for getting a first-guess value when using iteration to get a better result, as with Newton's method for obtaining a square root. In 1909, Percy Ludgate invented a programmable mechanical computer [1], [2] and suggested doing division, a/b, with multiplication hardware for a × b\u0000<sup xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">−1</sup>\u0000, but taking the reciprocal of b without a division. To get a reciprocal he proposed a lookup table for the first estimate and then a novel iterative method explained here. Each successive estimate for b\u0000<italic xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><sup>−</sup></i>\u0000<sup xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sup> uses a multiply and then a subtract. Nearly 90 years later, Intel's Pentium CPUs and other microprocessors also began using an on-chip table for their divide operations.\u0000<sup xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sup> To get the reciprocal N\u0000<sup xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">−1</sup> (1/N) when division is not available or practical, the reciprocal can be calculated using an iterative scheme. Note that the product of N\u0000<sup xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">−1</sup> × N should equal a value very close to 1, after which the estimated N\u0000<sup xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">−1</sup> can be improved proportionally in successive steps.","PeriodicalId":55033,"journal":{"name":"IEEE Annals of the History of Computing","volume":"31 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140590229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"哲学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1109/mahc.2024.3374490
{"title":"Call for Papers: Get Published in the New IEEE Transactions on Privacy","authors":"","doi":"10.1109/mahc.2024.3374490","DOIUrl":"https://doi.org/10.1109/mahc.2024.3374490","url":null,"abstract":"","PeriodicalId":55033,"journal":{"name":"IEEE Annals of the History of Computing","volume":"20 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140575639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"哲学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1109/mahc.2024.3366628
Dag Spicer
Presents reviews for the following list of books, (Niklaus Wirth Obituary).
提供以下书单的评论（尼克劳斯-维斯讣告）。
{"title":"Niklaus Wirth Obituary","authors":"Dag Spicer","doi":"10.1109/mahc.2024.3366628","DOIUrl":"https://doi.org/10.1109/mahc.2024.3366628","url":null,"abstract":"Presents reviews for the following list of books, (Niklaus Wirth Obituary).","PeriodicalId":55033,"journal":{"name":"IEEE Annals of the History of Computing","volume":"34 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140603253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"哲学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1109/mahc.2024.3364900
Marc LaViolette
Most writings discussing Charles Babbage’s attempts at creating mechanical calculating machines use the heroic theory of invention and scientific development as a hypothesis for describing his accomplishments. Many of the mechanisms he imagined, do appear to be the first implementations of ideas used by modern computing machines such as pipelining, parallel computing, anticipating carry, mill (cpu), and store (RAM) (see Bromley [1] and Swade [2]).
{"title":"Was There a French Engine Before Babbage’s Difference Engine?","authors":"Marc LaViolette","doi":"10.1109/mahc.2024.3364900","DOIUrl":"https://doi.org/10.1109/mahc.2024.3364900","url":null,"abstract":"Most writings discussing Charles Babbage’s attempts at creating mechanical calculating machines use the heroic theory of invention and scientific development as a hypothesis for describing his accomplishments. Many of the mechanisms he imagined, do appear to be the first implementations of ideas used by modern computing machines such as pipelining, parallel computing, anticipating carry, mill (cpu), and store (RAM) (see Bromley [1] and Swade [2]).","PeriodicalId":55033,"journal":{"name":"IEEE Annals of the History of Computing","volume":"12 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140575106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"哲学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1109/mahc.2024.3377853
{"title":"Call for Papers: IEEE Computer Architecture","authors":"","doi":"10.1109/mahc.2024.3377853","DOIUrl":"https://doi.org/10.1109/mahc.2024.3377853","url":null,"abstract":"","PeriodicalId":55033,"journal":{"name":"IEEE Annals of the History of Computing","volume":"35 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140590215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"哲学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1109/mahc.2024.3374476
{"title":"IEEE Computer Society Information","authors":"","doi":"10.1109/mahc.2024.3374476","DOIUrl":"https://doi.org/10.1109/mahc.2024.3374476","url":null,"abstract":"","PeriodicalId":55033,"journal":{"name":"IEEE Annals of the History of Computing","volume":"69 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140575105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"哲学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1109/mahc.2024.3374484
{"title":"ComputingEdge","authors":"","doi":"10.1109/mahc.2024.3374484","DOIUrl":"https://doi.org/10.1109/mahc.2024.3374484","url":null,"abstract":"","PeriodicalId":55033,"journal":{"name":"IEEE Annals of the History of Computing","volume":"251 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140575097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"哲学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：