Abbe Mowshowitz

Last updated

Abbe Mowshowitz (born 13 November 1939, Liberty, New York) [1] is an American academic, a professor of computer science at the City College of New York and a member of the Doctoral Faculty in Computer Science at The City University of New York who works in the areas of the organization, management, and economics of information systems; social and policy implications of information technology; network science; and graph theory. He is known for his work on virtual organization, a concept he introduced in the 1970s on information commodities, on the social implications of computing and on the complexity of graphs and networks.

Before joining the faculty at The City College of New York, Mowshowitz was a faculty member at the University of Toronto (Departments of Computer Science and Industrial Engineering, 1968–1969); the University of British Columbia (Department of Computer Science, 1969–1980); and was research director in the Department of Science and Technology Studies at Rensselaer Polytechnic Institute (1982–1984). In addition, he was a visiting professor at the Graduate School of Management, Delft, The Netherlands (1979–1980); held the Tinbergen Chair in the Graduate School of Management at Erasmus University, Rotterdam, The Netherlands (1990–1991); was a professor in the Department of Social Science Informatics at the University of Amsterdam, The Netherlands (1991–1993, 1994–1997); and was the CeTim professor of Technology Innovation Management at the Rotterdam School of Management, Rotterdam, The Netherlands (2001–2002).

Mowshowitz received a Ph.D. in Computer Science from the University of Michigan in 1967 (under the direction of Professor Anatol Rapoport), and a BS in Mathematics from the University of Chicago in 1961.

His research on the structural complexity of graphs (published in 1968) was based on a paper by Professor Nicolas Rashevsky, who first introduced the idea of measuring the information content of a graph using Shannon's entropy measure. Mowshowitz formalized and extended Rashevsky's idea and characterized the structural complexity of various classes of graphs [ permanent dead link ] and binary operations on graphs. Two measures of structural complexity were defined, both relative to a partition of the vertices of a graph. One of the measures, based on a partition related to independent sets, stimulated Körner's development of graph entropy.

Mowshowitz was an early and persistent advocate of and contributor to studies of the social relations of computing. He introduced an undergraduate course on that topic at the University of British Columbia in 1973; published a comprehensive text in 1976; served as vice-chairman (1983–1985) and chairman (1985–1987) of the ACM's Special Interest Group on Computers and Society; and was a member of IFIP Working Group 9.2 (Computers and Social Accountability) from 1977 to 1997. As the title of his book The Conquest of Will suggests, Mowshowitz aimed to extend the idea of conquest of the material world theme of many inquiries into the implications of technology to the realm of behavior and culture. [2] He called attention to the threats posed by computer technology to personal privacy, political freedom and human identity, and, like Professor Joseph Weizenbaum in Computer Power and Human Reason (published in the same year), he pointed to the danger of excessive reliance on computers in areas traditionally requiring human judgment. [3] As an extension of the last chapter of The Conquest of Will he produced a study-anthology of computers in fiction in an effort to stimulate further discussion of the social consequences of computer technology. In recent years he has (together with colleague Professor Akira Kawaguchi) developed and applied a quantitative measure of the bias of search engines on the World Wide Web.

He also worked on the ethical implications of computing and, as a participant in a workshop held at SRI International in 1977 (organized by Mr. Donn Parker), developed a taxonomy of ethical issues that informed the later discussion leading to the ACM code of ethics adopted in 1992. As well as conducting research on ethical implications, he contributed to policy discussions surrounding computer technology. In 1979 he consulted (together with Professor Rob Kling) for the Rathenau Commission of the Dutch Ministry of Science Policy on the societal implications of microelectronics, and from 1980 until it closed in 1995, he consulted regularly for the U.S. Congressional Office of Technology Assessment, producing a variety of background reports on the social impact of information technology.

His conceived the idea of virtual organization in the late 1970s, drawing on an analogy between the structure and function of global companies, on the one hand, and virtual memory in computer systems, on the other. This analogy led eventually to the formal definition presented in a paper that appeared in 1994 and elaborated in his book on virtual organization published in 2002. During the year 1979-1980, he was stimulated to develop and codify the idea of virtual organization through discussions with Henk van Dongen and his colleagues at the Graduate School of Management in Delft, The Netherlands. In the course of elaborating the concept and its implications for society, he introduced the notion of information commodity to explain a key part of the economic foundation of virtual organization and developed mathematical models for pricing information commodities, both from the supply and the demand perspective.

His work in network science combined an interest in the complexity of graphs and networks with practical experience in designing networks to support administrative functions. While at the University of Amsterdam, the Netherlands in the 1990s, he worked on the design and development of a network to support information sharing on drug related issues among member states of the European Union. This work contributed to the formation of the European Monitoring Centre for Drugs and Drug Addiction which was eventually established in Lisbon, Portugal. More recently years he has resumed his earlier research on the analysis of complex networks.

Selected publications

Related Research Articles

<span class="mw-page-title-main">Richard M. Karp</span> American mathematician

Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.

<span class="mw-page-title-main">Theoretical computer science</span> Subfield of computer science and mathematics

Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, formal language theory, the lambda calculus and type theory.

Computer ethics is a part of practical philosophy concerned with how computing professionals should make decisions regarding professional and social conduct.

<span class="mw-page-title-main">F. Thomson Leighton</span> American computer scientist

Frank Thomson "Tom" Leighton is the CEO of Akamai Technologies, the company he co-founded with the late Daniel Lewin in 1998. As one of the world's preeminent authorities on algorithms for network applications and cybersecurity, Dr. Leighton discovered a solution to free up web congestion using applied mathematics and distributed computing.

<span class="mw-page-title-main">Shlomi Dolev</span>

Shlomi Dolev is a Rita Altura Trust Chair Professor in Computer Science at Ben-Gurion University of the Negev (BGU) and the head of the BGU Negev Hi-Tech Faculty Startup Accelerator.

<span class="mw-page-title-main">Vijay Vazirani</span> Indian American professor of computer science

Vijay Virkumar Vazirani is an Indian American distinguished professor of computer science in the Donald Bren School of Information and Computer Sciences at the University of California, Irvine.

<span class="mw-page-title-main">László Babai</span> Hungarian mathematician and computer scientist

László "Laci" Babai is a Hungarian professor of computer science and mathematics at the University of Chicago. His research focuses on computational complexity theory, algorithms, combinatorics, and finite groups, with an emphasis on the interactions between these fields.

<span class="mw-page-title-main">Michael Sipser</span> American theoretical computer scientist (born 1954)

Michael Fredric Sipser is an American theoretical computer scientist who has made early contributions to computational complexity theory. He is a professor of applied mathematics and was the Dean of Science at the Massachusetts Institute of Technology.

<span class="mw-page-title-main">Noga Alon</span> Israeli mathematician

Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.

<span class="mw-page-title-main">Avi Wigderson</span> Israeli mathematician and computer scientist

Avi Wigderson is an Israeli mathematician and computer scientist. He is the Herbert H. Maass Professor in the school of mathematics at the Institute for Advanced Study in Princeton, New Jersey, United States of America. His research interests include complexity theory, parallel algorithms, graph theory, cryptography, distributed computing, and neural networks. Wigderson received the Abel Prize in 2021 for his work in theoretical computer science.

<span class="mw-page-title-main">Mihalis Yannakakis</span> Greek-American computer scientist

Mihalis Yannakakis is professor of computer science at Columbia University. He is noted for his work in computational complexity, databases, and other related fields. He won the Donald E. Knuth Prize in 2005.

<span class="mw-page-title-main">Gil Kalai</span> Israeli mathematician and computer scientist

Gil Kalai is an Israeli mathematician and computer scientist. He is the Henry and Manya Noskwith Professor Emeritus of Mathematics at the Hebrew University of Jerusalem, Israel, Professor of Computer Science at the Interdisciplinary Center, Herzliya, and adjunct Professor of mathematics and of computer science at Yale University, United States.

<span class="mw-page-title-main">Paul Vitányi</span> Dutch theoretical computer scientist

Paul Michael Béla Vitányi is a Dutch computer scientist, Professor of Computer Science at the University of Amsterdam and researcher at the Dutch Centrum Wiskunde & Informatica.

<span class="mw-page-title-main">Salil Vadhan</span> American computer scientist.

Salil Vadhan is an American computer scientist. He is Vicky Joseph Professor of Computer Science and Applied Mathematics at Harvard University. After completing his undergraduate degree in Mathematics and Computer Science at Harvard in 1995, he obtained his PhD in Applied Mathematics from Massachusetts Institute of Technology in 1999, where his advisor was Shafi Goldwasser. His research centers around the interface between computational complexity theory and cryptography. He focuses on the topics of pseudorandomness and zero-knowledge proofs. His work on the zig-zag product, with Omer Reingold and Avi Wigderson, was awarded the 2009 Gödel Prize.

<span class="mw-page-title-main">Vincent Blondel</span>

Vincent Daniel Blondel is a Belgian professor of applied mathematics and current rector of the University of Louvain (UCLouvain) and a visiting professor at the Massachusetts Institute of Technology (MIT). Blondel's research lies in the area of mathematical control theory and theoretical computer science. He is mostly known for his contributions in computational complexity in control, multi-agent coordination and complex networks.

<span class="mw-page-title-main">Anatol Slissenko</span> Soviet, Russian and French mathematician

Anatol Slissenko is a Soviet, Russian and French mathematician and computer scientist. Among his research interests one finds automatic theorem proving, recursive analysis, computational complexity, algorithmics, graph grammars, verification, computer algebra, entropy and probabilistic models related to computer science.

P. J. Narayanan is a professor at the International Institute of Information Technology, Hyderabad, and the institute's current director since April 2013. He is known for his work in computer vision, computer graphics, and parallel computing on the GPU.

In information theory, the graph entropy is a measure of the information rate achievable by communicating symbols over a channel in which certain pairs of values may be confused. This measure, first introduced by Körner in the 1970s, has since also proven itself useful in other settings, including combinatorics.

Benjamin E. Rossman is an American mathematician and theoretical computer scientist, specializing in computational complexity theory. He is currently an associate professor of computer science and mathematics at Duke University.

<span class="mw-page-title-main">Matthias Grossglauser</span> Swiss communication engineer

Matthias Grossglauser is a Swiss communication engineer. He is a professor of computer science at EPFL and co-director of the Information and Network Dynamics Laboratory (INDY) at EPFL's School of Computer and Communication Sciences School of Basic Sciences.

References

  1. Prof. dr. A. Mowshowitz, 1939 - at the University of Amsterdam Album Academicum website.
  2. Green, Martin (December 1976). "The Conquest of Will: Information Processing in Human Affairs by Abbe Mowshowitz (Addison-Wesley: 366 pp.; $8.95)". Worldview. 19 (12): 48–50. doi:10.1017/S0084255900026796. ISSN   0084-2559 via Cambridge University Press site.
  3. Bulletin, S. (1976). "Inside information: Computers in fiction". Proceedings of the IEEE. 66 (1): 106. doi:10.1109/PROC.1978.10854. S2CID   2416130.