http:^^www.cs.ucsb.edu^~konheim^
来自「This data set contains WWW-pages collect」· EDU^~KONHEIM^ 代码 · 共 117 行
EDU^~KONHEIM^
117 行
Date: Thu, 21 Nov 1996 20:15:47 GMT
Server: Apache/1.0.2
Content-type: text/html
Content-length: 4765
Last-modified: Tue, 05 Dec 1995 21:06:12 GMT
<html><title> Alan Konheim </title><head><a name=top><h3>Alan G. Konheim</h3></head></a><body><!WA0><img src="http://www.cs.ucsb.edu/image/faculty/Konheim.gif" alt="photo"><hr><p><!WA1><a href=http://www.cs.ucsb.edu/">Department of Computer Science</a><br>University of California at Santa Barbara <br><p><strong>Telephone</strong>: (805) 893-3560<br><strong>Internet</strong>: <!WA2><a href="mailto:konheim@cs.ucsb.edu"> konheim@cs.ucsb.edu</a><br><p>Dr. Konheim received the B.E.E. and M.S. (Mathematics) from the Polytechnic Institute of Brooklyn in 1955 and 1957, respectively. He was awarded the Ph.D. (Mathematics) from Cornell University in 1960.<p>While a Research Staff Member in the Mathematical Sciences Department at the IBM Thomas J. Watson Research Center in Yorktown Heights (1960-82), he was a visiting Fellow in Mathematics at the California Institute of Technology (1962) and a Senior Fulbright Scholar at the Institute for Pure and Applied Mathematics at the University of Heidelberg (1966).<p>Dr. Konheim's professional interests span several areas in Computer Science.His early work at IBM was related to the application of neural-like networks (Perceptrons) to pattern-recognition problems. The analysis of computer algorithms evaluated methods for improving the efficiencyof storage schema (hashing, padded lists, sparse tables and disk access).<p>IBM's Liberty Banking Systems included a cryptographic function based on the LUCIFER algorithm developed by his group at the Yorktown Research Center. This work led to the Data Encryption Standard which was evaluated by his Yorktown Probability and Cryptography Group and certified as a National Standard in the 1970's. Dr. Konheim has spent several summers working for the government in the area of cryptanalysis.<p>In 1970, he began to study the performance of computer communication systems while on sabbatical at the IBM Zurich Laboratory. In connection with the design of IBM's digital PBX, mathematical techniques for modeling loop systems and multiplexing by polling were developed. <p>His current research interests include<br><p> <li><em>(i)</em> the effect of interference of virtual circuits in window-based flow control, <p><li><em>(ii)</em> the performance of packet-radio networks,<p><li><em>(iii)</em> input rate control for B-ISDN,<p> <li><em>(iv)</em> estimation of rates with heterogeneous ATM traffic at the uni and <p><li><em>(v)</em> enhancing the thruput in fast packet switches.<p>Dr. Konheim has held adjunct positions at the Balfour School of Science (Yeshiva University), CCNY Graduate Center, Courant Institute (New York University), and The Technion (Israel).<p>He is a member of the MAA, ACM, SIAM and a Senior Member of the IEEE. He is on the editorial board of <em> The Mathematical Scientist</em> and the <em>Telecommunications Research Journal</em>.<p>He is the inventor on four U.S. Patents.<p><hr><p><strong>Recent Publications:</strong><ol><li>with Gísli Hjálmtýsson, "The Sticky Buffer: Flow Control for the ATM," to appear in <em>Performance Evaluation</em>.<p><li>with Gísli Hjálmtýsson, "A Two-Stage Entry Monitor - A Sticky Buffer in Tandem with a Spacer," ICCN, San Francisco, 1994; submitted to <em> Journal of Telecommunications Research</em>.<p><li>with Shyi-Shan Bor, "A Uniqueness Theorem for Buffer Allocation," invited paper (Special Issue on "Teletraffic Theory and Engineering" in honor of Felix Pollaczek), <em>Achiv für Elecktronic and Übertragungstechnik,</em><strong> 47</strong>, No. 4/5, pp. 390-396, 1993.<p><li>with S. Chan, A. Guillaume and R. Warfield, "Estimating the Rates ofMixed ATM Traffic," Proceedings of the 14<sup>th</sup> International TeletrafficConference.<p><li>with H. Levy, "Efficient Analysis of Poling Systems," <em>IEEE INFOCOM'91</em>, Florence (Italy), Vol. 3, pp. 2325-30.<p><li>with H. Levy and M. Srinivasan, "Descendant Set: An Efficient Approachfor the Analysis of Polling Systems," <em>IEEE Transactions on Communications</em>, <strong>COM-42</strong>, February-April 1994, pp. 1245-1253. <p><li>with H.R. Gail, S.L. Hantler and B.A. Taylor, "An Analysis of a Class ofTelecommunication Models," <em>Performance Evaluation</em>, <strong> 21</strong>, pp. 151-161, 1994.<p><li>Denis A. Khotimsky and Alan G. Konheim, "Estimating the Rates of Heterogeneous ATM Traffic," IEEE Workshop, Duck Key (Florida), submittedto <em>ACM/IEEE Transactions of Networking</em>.</ol><p><ul><center><!WA3><a href="#top">Return to top of page</a>, or</center><br><p><center><!WA4><a href="http://www.cs.ucsb.edu/">Return to Computer Science Department</a></center>.</body></html>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?