Abstractions, their algorithms, and their compilers

Welcome to the third issue of the ACM Computers in Entertainment magazine! In this exciting issue we present eight articles on a diversity of entertainment technology topics including Internet movie piracy, performing arts, animatronics, robotics, music, games, and interactive television. To get started, the Interviews section features video interviews with our distinguished advisory board members Leonard Kleinrock and Richard Edlund. Leonard talks about nomadic computing, embedded technology, smart spaces, ubiquitous computing, ethics, the roles of the government, and the future of the Internet. Richard speaks of movie visual effects, digital cinema, digital cameras, and technical Oscars. In the Movies and Performing Arts section, Sai Ho Kwok investigates the file-sharing patterns of pirated movies over BitTorrent peer-to-peer networks and offers suggestions on the design of an anti-piracy strategy. W. Scott Meador et al. describe an experimental dance performance featuring live-motion capture, real-time computer graphics, and multi-image projection produced by a cross-departmental team of faculty and students at Purdue University. In the Animatronics and Robotics section, Ray Dominey et al. discuss their integrated technology for raising the level of interactivity and realistic animatronics in amusement park dark rides. John D. Decuir et al. detail their use of Sonys AIBO entertainment robots to improve young childrens reading comprehension in a classroom setting. In the Music and Games section, Magy Seif El-Nasr et al. present a real-time lighting design to automatically adjust lighting in an interactive scene where the camera and character movements are unpredictable. Myriam Desainte-Catherine et al. examine their research on early-learning games using a joystick as a Dolabip instrument for electro-acoustic music education in schools. In the Synopsis - Books and Software section, Eddie Schwalb introduces the technologies, standards, and business issues for interactive television (iTV). Doug Twilleager et al. provide an overview of the server, desktop, and mobile technologies that are available to build a networked game with Java technology. I hope you will enjoy this issue of the online magazine. Before you dive into the exciting content, I would like to share with you the latest headline news about our distinguished editorial board advisors Alan Kay and Quincy Jones: On April 19, 2004, Dr. Alan Kay was named the 2003 winner of the A.M. Turing Award for pioneering many of the ideas at the root of contemporary object-oriented programming languages, leading the team that developed Smalltalk, and for fundamental contributions to personal computing. The A.M. Turing Award is the most prestigious technical award in computer science and is accompanied by a prize of $100,000. Earlier this year, Alan and his colleagues won the engineerings highest award - the Charles Stark Draper Prize from the National Academy of Engineering - for their vision, conception, and development of the worlds first practical networked personal computers. Both the Draper Prize and Turing Award are considered the equivalent of Nobel Prizes for their fields - engineering and computer science, respectively. In June, Alan was named winner of the 2004 Kyoto Prize in advanced technology, his third major scientific award this year. On May 16, 2004, nearly half a million people attended Mr. Quincy Jones all-star humanitarian concert "We Are the Future" at Romes Circus Maximus. In the tradition of "We Are the World,"the successful concert marked the launch of a worldwide initiative aspiring to create a sustainable chain of support for children in war-ravaged cities. The concert was broadcast on MTV, MTG/VIASAT, XM Radio, and Yahoo! webcasts. More information can be found at http://www.wearethefuture.com/concert_press.html I wish to express my admiration and gratitude to the legendary Alan Kay and Quincy Jones for their immense contributions to society. We are most fortunate to be working with the most innovative and philanthropic individuals in the world. A growing list of our distinguished editorial board members can be found at http://www.acm.org/pubs/cie/acmcie_editorial_board.pdf Now its time to dive into the magazine and send me your comments and feedback. Thank you very much for your continuing support. Sincerely, Newton Lee Editor-in-Chief ACM Computers in Entertainment Los Angeles June 2004

Herbert A. Simon, 1916-2001

On June 11, Vint Cerf and Bob Kahn received computing's highest prize, the A.M. Turing Award, from the Association for Computing Machinery. Their Transmission Control Protocol (TCP), created in 1973, became the language of the Internet.In the May 6 issue of Science [1], we used this as the "news hook" for an invited editorial on the current state of computer science research in the United States. "Where will the next generation of groundbreaking innovations in IT arise?" we asked. "Where will the Turing Awardees 30 years hence reside?" Our conclusion: "Given current trends, the answers to both questions will likely be 'not in the United States.'"We take this opportunity to explore in greater depth the issues we raised in that editorial. What are the trends that concern us? What can all of us, as computer scientists, do to reverse them?

Winner of the 1971 A.M. Turing Award, John McCarthy was a founder of artificial intelligence and inventor of the Lisp programming language.

Cryptography is concerned with the construction of schemes that withstand any abuse. A cryptographic scheme is constructed so as to maintain a desired functionality, even under malicious attempts aimed at making it deviate from its prescribed behavior. The design of cryptographic systems must be based on firm foundations, whereas ad hoc approaches and heuristics are a very dangerous way to go. These foundations were developed mostly in the 1980s, in works that are all co-authored by Shafi Goldwasser and/or Silvio Micali. These works have transformed cryptography from an engineering discipline, lacking sound theoretical foundations, into a scientific field possessing a well-founded theory, which influences practice as well as contributes to other areas of theoretical computer science. This book celebrates these works, which were the basis for bestowing the 2012 A.M. Turing Award upon Shafi Goldwasser and Silvio Micali. A significant portion of this book reproduces some of these works, and another portion consists of scientific perspectives by some of their former students. The highlight of the book is provided by a few chapters that allow the readers to meet Shafi and Silvio in person. These include interviews with them, their biographies and their Turing Award lectures.

The A. M. Turing Award is given each year to an individual for his technical contributions to computer science and engineering. Upon acceptance of the award, the winner delivers the annual Turing Lecture. Dr. McCarthy's presentation, “The Present Status ...

The size and availability of network information has exploded over the last decade. Social scientists now share the stage of network analysis with computer scientists, physicists, and statisticians. While a number of introductions to network analysis are now available, most focus on theory, methods, or application alone. This book integrates all three. Network Analysis is an introduction to both the why and how of Social Network Analysis (SNA). It presents a broad theoretical overview rooted in social scientific approaches and guides users in how network analysis can answer core theoretical questions. It provides a comprehensive overview of descriptive and analytical approaches, including practical tutorials in R with sample data sets. Using an integrated approach, this book aims to quickly bring novice network researchers up to speed while avoiding common programming and analysis mistakes so that they might gain insight into the fundamental theories, key concepts, and methodological application of SNA.

This paper proposes a teaching method that utilizes video games in computer science education. The primary characteristic of this approach is that it utilizes video games as observational materials. The underlying idea is that by observing the computational behavior of a wide variety of video games, learners will easily grasp the fundamental architecture, theory, and technology of computers.The results of a case study conducted indicate that the method enhances the motivation of students for deeper learning of computer science concepts.

This volume contains the proceedings of the Sixth Workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems (ICOOOLPS). Computer programming languages, especially Object-Oriented languages, are pervasive and play a significant role in computer science and engineering life and sometime appear as ubiquitous and completely mature. However, despite a large number of works, there still is a clear need for solutions for efficient implementation and compilation of OO languages in various application domains ranging from embedded and real-time systems to desktop systems. The ICOOOLPS workshop thus aims to address this crucial issue of optimization, mainly but not only in OO languages, programs and systems. It intends to do so by bringing together researchers and practitioners working in the field of implementation and optimization of programming languages. Its main goals are identifying fundamental bases and key current issues pertaining to the efficient implementation, compilation and optimization of OO languages, and outlining future challenges and research directions.

Events and Sightings David Walden (bio) and Dag Spicer (bio) Fifty-Year Anniversaries in Norwegian Computing History Two fifty-year anniversaries in computing history were celebrated in Oslo in September 2017: the fifty-year anniversary of the creation of the Simula programming language, and the fifty-year anniversary of the founding of the Norsk Data computer company. Simula The Simula 67 programming language, first formally defined in 1967, was a step in a series of developments by Ole-Johan Dahl and Kristen Nygaard that began in the early 1960s.1 Dahl and Nygaard were given the 2001 IEEE John von Neumann Medal and the ACM 2001 A.M. Turing Award for their creation of Simula. A fifty-year anniversary celebration for Simula took place (in the “Simula Auditorium” in the “Ole-Johan Dahl Building”) at the University of Oslo on 27 September 2017. The celebration began with unveiling of a plaque from the IEEE History Committee’s Milestone program. The plaque reads: IEEE Milestone Object-oriented Programming, 1961–1967 Ole-Johan Dahl and Kristen Nygaard created the Simula programming languages in the 1960s at the Norwegian Computer Center, and in so doing introduced a new way of modeling and simulating complex tasks. Object-oriented programming is now dominant in systems development. It is an integral part of computer science curricula, as are languages built on object-oriented programming concepts, such as Smalltalk, C++, Java, and Python. September 2017 The nomination of this Milestone was from the IEEE Norway Section. The photo shows Section Vice-Chairman Kaveh Niayesh unveiling the plaque. The rest of the day consisted of presentations by several programming language researchers and developers: Oscar Nierstrasz (“Great Moments in the History of OOP”), Dave Thomas (“The Legacy of Simula 67”), and James Gosling (“Simula: A Personal Journey”), as well as a panel discussion chaired by Eric Jul (“Whither Programming Languages? Can We Still Celebrate Simula 50 Years from Now?”) with participation of the prior three speakers and Ole Lehrmann Madsen and Olaf Owe.2 Videos from the event are available.3 The previous afternoon, the Association of Simula Users (ASU) held a several-hour meeting at which there were six presentations and a wrap-up session. According to Boris Magnusson (ASU chairman 1982–83), the ASU has been in continuous existence since the early days of Simula 67, holding annual conferences and publishing a quarterly newsletter. However, in recent years the ASU activities “have slowly faded away, and the meeting in Oslo was intended as a last meeting and also a way to formally close down the Association.” Click for larger view View full resolution Photo 1. Photo credit: Harald Brombach/digi.no. Norsk Data On 16–17 September 2017, the fiftieth anniversary of the founding of Norsk Data was marked. In 1967 Lars Monrad-Krohn, Per Bjørge, and Rolf Skår left the Norwegian Defence Research Establishment (NDRE), where they had worked on the computer developments in “Siffergruppen” (the Digital Group), initiated and [End Page 93] led by Yngvar Lundh. They founded Norsk Data Elektronikk, where their first computer development was the Nord-1, building on work they had done in the Digital Group. Click for larger view View full resolution Photo 2. Veslemøy Østrem of Aftenposten interviewing Norsk Data founders Rolf Skår and Lars Monrad-Krohn. Photo credit: Ragnar Sturzel. The Nord-1was a minicomputer and competed well in Europe with minicomputers from the United States. With additional computers being developed over the years (arguably better hardware and software than some US competitors) and many high-profile or operation-critical installations, Norsk Data eventually became a high-flying company listed on the London as well as the NASDAQ stock exchanges, in addition to on the Norwegian exchange. With the personal computer revolution, Norsk Data went the way of almost all minicomputer manufacturers, eventually going out of business. For many of the eventual 4,500 employees of Norsk Data, their time with a company was one of the most exciting times of their professional careers, and the one-time employees of Norsk Data went on to populate a significant part of the developing Norwegian computing industry. The day of 18 September involved a five-hour...

Based on course-tested material, this rigorous yet accessible graduate textbook covers both fundamental and advanced optimization theory and algorithms. It covers a wide range of numerical methods and topics, including both gradient-based and gradient-free algorithms, multidisciplinary design optimization, and uncertainty, with instruction on how to determine which algorithm should be used for a given application. It also provides an overview of models and how to prepare them for use with numerical optimization, including derivative computation. Over 400 high-quality visualizations and numerous examples facilitate understanding of the theory, and practical tips address common issues encountered in practical engineering design optimization and how to address them. Numerous end-of-chapter homework problems, progressing in difficulty, help put knowledge into practice. Accompanied online by a solutions manual for instructors and source code for problems, this is ideal for a one- or two-semester graduate course on optimization in aerospace, civil, mechanical, electrical, and chemical engineering departments.

Based on course-tested material, this rigorous yet accessible graduate textbook covers both fundamental and advanced optimization theory and algorithms. It covers a wide range of numerical methods and topics, including both gradient-based and gradient-free algorithms, multidisciplinary design optimization, and uncertainty, with instruction on how to determine which algorithm should be used for a given application. It also provides an overview of models and how to prepare them for use with numerical optimization, including derivative computation. Over 400 high-quality visualizations and numerous examples facilitate understanding of the theory, and practical tips address common issues encountered in practical engineering design optimization and how to address them. Numerous end-of-chapter homework problems, progressing in difficulty, help put knowledge into practice. Accompanied online by a solutions manual for instructors and source code for problems, this is ideal for a one- or two-semester graduate course on optimization in aerospace, civil, mechanical, electrical, and chemical engineering departments.

Based on course-tested material, this rigorous yet accessible graduate textbook covers both fundamental and advanced optimization theory and algorithms. It covers a wide range of numerical methods and topics, including both gradient-based and gradient-free algorithms, multidisciplinary design optimization, and uncertainty, with instruction on how to determine which algorithm should be used for a given application. It also provides an overview of models and how to prepare them for use with numerical optimization, including derivative computation. Over 400 high-quality visualizations and numerous examples facilitate understanding of the theory, and practical tips address common issues encountered in practical engineering design optimization and how to address them. Numerous end-of-chapter homework problems, progressing in difficulty, help put knowledge into practice. Accompanied online by a solutions manual for instructors and source code for problems, this is ideal for a one- or two-semester graduate course on optimization in aerospace, civil, mechanical, electrical, and chemical engineering departments.

The workshop Permutation groups organised by Robert Guralnick (Southern California), Cheryl Praeger (Western Australia), Jan Saxl (Cambridge) and Katrin Tent (Bielefeld) was held August 5th–11th, 2007. The focus was recent developments in permutation group theory and their influence on, and from, group representation theory, algebraic graph theory and other areas of geometry and combinatorics, algebraic geometry, model theory and infinite symmetrical structures. It was well attended with 50 participants. Especially valuable was the program to support young researchers which gave the opportunity for a considerable number of young mathematicians to participate in the workshop. They benefited from the ‘Oberwolfach experience’ and also enlivened and contributed enormously to the success of the meeting. The workshop had a friendly and vibrant atmosphere, aided by the excellent facilities of the Institute. All participants appreciated the beautiful lecture by John G. Thompson entitled ‘The divisor matrix and {\rm SL}(2,\Z) ’. (In fact, this meeting was the first Oberwolfach workshop in over twenty years that Thompson had attended.) There were 26 other talks, and the program featured in each of the first five sessions at least one talk by a student or young researcher at the beginning of their career. This facilitated interaction between younger and more established researchers. The number of talks was restricted to give plenty of time for discussion and cooperation among the participants. Other communications were presented as posters. Highlights of the workshop addressed both fundamental permutation group theory, and also significant outcomes from applying permutation group theory and methods in combinatorics, model theory and other areas. Some topics arose in more than one context, forming new connections. A common feature of many contributions was application of the finite simple group classification, or new results on the structure of simple groups. As examples, we mention two highlights reported by early career participants. The question of base size of permutation actions is of importance in computational group theory as well as in the study of the graph isomorphism problem. Recent research has thrown much light on the base sizes of actions of almost simple groups in particular. Burness reported on the very recent proof of a conjecture of Cameron and Kantor dating from 1993 concerning non-standard permutation actions of almost simple groups: these are all primitive actions apart from actions of alternating and symmetric groups on subsets or partitions, and of classical groups on subspaces or pairs of complementary subspaces. In all the latter families the minimum base size is unbounded as the group order increases. The somewhat surprising conjecture, now proved, is that the minimum base size of non-standard permutation groups is at most 7, with the unique example where this bound is attained being the Mathieu group M_{24} in its natural action on 24 points. Expander graphs play an important role in computer science and combinatorics, and, for example, are significant in modelling and analysing communication networks. In particular, their diameters grow only logarithmically with the numbers of vertices. This property on diameters was proved in 1989 by Babai, Kantor and Lubotzky to hold for suitable Cayley graphs of simple groups: specifically for each finite nonabelian simple group G , they constructed a valency 7 Cayley graph for G with diameter at most a constant times \log(|G|) . Although their graphs were not expanders, they conjectured that there exists an absolute constant k such that all infinite families of simple groups give rise to families of valency k Cayley graphs that are expanders. Kassabov lectured on amazing progress towards proving this conjecture – it is now proved for all simple groups apart from the Suzuki groups. It was a very happy and successful workshop. Indeed, several of the most distinguished participants commented that this was one of the best Oberwolfach meetings they had attended, with plenty of time for collaboration, and outstanding talks. Extended abstracts of the talks mentioned, as well as all the others, are given below (in the order in which they were presented).

Geographic Information System (GIS) skills are increasingly marketable across a wide range of industries, subject areas and specialized fields. As a result, GIS courses draw students from a plethora of disciplines beyond geography, including business, social sciences, agriculture, geology, natural resources and computer science. At advanced teaching levels, this disciplinary diversity generates questions about how complex GIS skills are being taught to students who do not necessarily have a background in geography or the spatial sciences. This study compares undergraduate and graduate course curricula to determine what topics, techniques and theory are being addressed and prioritized in GIS courses across pedagogical levels. We surveyed 1,698 courses being taught at 126 research universities in the United States. Our findings point towards a shift in pedagogy that favours technique- or application-centred lessons at advanced levels that require less background knowledge in geography than more theory-centred teaching methods. Our findings also suggest that a large number of graduate courses, even introductory courses ones, fail to address many fundamental GIS concepts and theories. Together, the results suggest a need for standards to ensure that students enrolled in GIS classes are properly trained to enter the workforce with appropriate skills.