2. Creating a science base to support new directions in computer science Cornell University Ithaca New York John Hopcroft

3. Time of change  The information age is a fundamental revolution that is changing all aspects of our lives.  Those individuals, institutions, and nations who recognize this change and position themselves for the future will benefit enormously. 21 Century computing

4. Computer Science is changing Early years  Programming languages  Compilers  Operating systems  Algorithms  Data bases Emphasis on making computers useful 21 Century computing

5. Computer Science is changing The future years  Tracking the flow of ideas in scientific literature  Tracking evolution of communities in social networks  Extracting information from unstructured data sources  Processing massive data sets and streams  Extracting signals from noise  Dealing with high dimensional data and dimension reduction 21 Century computing

6. Drivers of change  Merging of computing and communications  Data available in digital form  Networked devices and sensors  Computers becoming ubiquitous 21 Century computing

7. Implications for TCS Need to develop theory to support the new directions Update computer science education 21 Century computing

8. Internet search engines are changing When was Einstein born? Einstein was born at Ulm, in Wurttemberg, Germany, on March 14, 1879. List of relevant web pages 21 Century computing

10. Internet queries will be different  Which car should I buy?  What are the key papers in Theoretical Computer Science?  Construct an annotated bibliography on graph theory.  Where should I go to college?  How did the field of computer science develop? 21 Century computing

11. Which car should I buy? Search engine response: Which criteria below are important to you?  Fuel economy  Crash safety  Reliability  Performance  Etc. 21 Century computing

12. MakeCostReliabilityFuel economy Crash safety Links to photos/ articles Toyota Prius23,780Excellent44 mpgFairphoto article Honda Accord28,695Better26 mpgExcellentphoto article Toyota Camry29,839Average24 mpgGoodphoto article Lexus 35038,615Excellent23 mpgGoodphoto article Infiniti M3547,650Excellent19 mpgGoodphoto article

13. 21 Century computing

14. 2010 Toyota Camry - Auto Shows Toyota sneaks the new Camry into the Detroit Auto Show. Usually, redesigns and facelifts of cars as significant as the hot-selling Toyota Camry are accompanied by a commensurate amount of fanfare. So we were surprised when, right about the time that we were walking by the Toyota booth, a chirp of our Blackberries brought us the press release announcing that the facelifted 2010 Toyota Camry and Camry Hybrid mid-sized sedans were appearing at the 2009 NAIAS in Detroit. Toyota CamryCamry Hybrid2009 NAIAS We’d have hardly noticed if they hadn’t told us—the headlamps are slightly larger, the grilles on the gas and hybrid models go their own way, and taillamps become primarily LED. Wheels are also new, but overall, the resemblance to the Corolla is downright uncanny. Let’s hear it for brand consistency! Four-cylinder Camrys get Toyota’s new 2.5-liter four-cylinder with a boost in horsepower to 169 for LE and XLE grades, 179 for the Camry SE, all of which are available with six-speed manual or automatic transmissions. Camry V-6 and Hybrid models are relatively unchanged under the skin. Inside, changes are likewise minimal: the options list has been shaken up a bit, but the only visible change on any Camry model is the Hybrid’s new gauge cluster and softer seat fabrics. Pricing will be announced closer to the time it goes on sale this March. Toyota Camry  › OverviewOverview  › SpecificationsSpecifications  › Price with OptionsPrice with Options  › Get a Free QuoteGet a Free Quote News & Reviews  2010 Toyota Camry - Auto Shows 2010 Toyota Camry - Auto Shows Top Competitors  Chevrolet Malibu Chevrolet Malibu  Ford Fusion Ford Fusion  Honda Accord sedan Honda Accord sedan

15. Which are the key papers in Theoretical Computer Science? Hartmanis and Stearns, “On the computational complexity of algorithms” Blum, “A machine-independent theory of the complexity of recursive functions” Cook, “The complexity of theorem proving procedures” Karp, “Reducibility among combinatorial problems” Garey and Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness” Yao, “Theory and Applications of Trapdoor Functions” Shafi Goldwasser, Silvio Micali, Charles Rackoff, “The Knowledge Complexity of Interactive Proof Systems” Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy, “Proof Verification and the Hardness of Approximation Problems” 21 Century computing

17. Fed Ex package tracking 21 Century computing

23. NEXRAD Radar Binghamton, Base Reflectivity 0.50 Degree Elevation Range 124 NMI — Map of All US Radar Sites Map of All US Radar Sites Animate Map Storm TracksTotal PrecipitationShow SevereRegional RadarZoom Map Click:Zoom InZoom OutPan Map ( Full Zoom Out ) Full Zoom Out »AdvancedRadarTypesCLICK»»AdvancedRadarTypesCLICK»

24. 21 Century computing

25. Collective Inference on Markov Models for Modeling Bird Migration 21 Century computing Space Time

26. 21 Century computing Daniel Sheldon, M. A. Saleh Elmohamed, Dexter Kozen

27. Science base to support activities Track flow of ideas in scientific literature Track evolution of communities in social networks Extract information from unstructured data sources. 21 Century computing

28. Tracking the flow of ideas in scientific literature Yookyung Jo

29. 21 Century computing Tracking the flow of ideas in scientific literature Yookyung Jo Page rank Web Link Graph Retrieval Query Search Text Web Page Search Rank Web Chord Usage Index Probabilistic Text File Retrieve Text Index Discourse Word Centering Anaphora

30. 21 Century computing Original papers

31. 21 Century computing Original papers cleaned up

32. 21 Century computing Referenced papers

33. 21 Century computing Referenced papers cleaned up. Three distinct categories of papers

34. 21 Century computing

36. Tracking communities in social networks 21 Century computing Liaoruo Wang

37. “Statistical Properties of Community Structure in Large Social and Information Networks”, Jure Leskovec; Kevin Lang; Anirban Dasgupta; Michael Mahoney Studied over 70 large sparse real-world networks. Best communities are of approximate size 100 to 150. 21 Century computing

38. Our most striking finding is that in nearly every network dataset we examined, we observed tight but almost trivial communities at very small scales, and at larger size scales, the best possible communities gradually "blend in" with the rest of the network and thus become less "community- like". 21 Century computing

39. Conductance Size of community 100

40. 21 Century computing Giant component

41. 21 Century computing Whisker: A component with v vertices connected by edges

42. Our view of a community 21 Century computing TCS Me Colleagues at Cornell Classmates Family and friends More connections outside than inside

43. Early work  Min cut – two equal size communities  Conductance – minimizes cross edges Future work  Consider communities with more cross edges than internal edges  Find small communities  Track communities over time  Develop appropriate definitions for communities  Understand the structure of different types of social networks 21 Century computing

44. “Clustering Social networks” Mishra, Schreiber, Stanton, and Tarjan Each member of community is connected to a beta fraction of community No member outside the community is connected to more than an alpha fraction of the community Some connectivity constraint 21 Century computing

45. In sparse graphs How do you find alpha-beta communities? What if each person in the community is connected to more members outside the community than inside? 21 Century computing

46. Structure of social networks Different networks may have quite different structures. An algorithm for finding alpha-beta communities in sparse graphs. How many communities of a given size are there in a social network? Results on exploring a tweeter network of approximately 100,000 nodes. 21 Century computing Liaoruo Wang, Jing He, Hongyu Liang

47. 200 randomly chosen nodes Apply alpha- beta algorithm Resulting alpha- beta community How many alpha-beta communities? 21 Century computing

48. Massively overlapping communities Are there a small number of massively overlapping communities that share a common core? Are there massively overlapping communities in which one can move from one community to a totally disjoint community? 21 Century computing

49. Massively overlapping communities with a common core

50. 21 Century computing Massively overlapping communities

51. Define the core of a set of overlapping communities to be the intersection of the communities. There are a small number of cores in the tweeter data set. 21 Century computing

52. Size of initial setNumber of cores 25221 5094 10019 1508 2004 2504 3004 3503 4003 4503 21 Century computing

53. 450 1 5 6 400 1 5 6 350 1 5 6 300 1 3 5 6 250 1 3 5 6 200 1 3 5 6 150 1 2 3 4 5 6 7 8 21 Century computing

54. What is the graph structure that causes certain cores to merge and others to simply vanish? What is the structure of cores as they get larger? Do they consist of concentric layers that are less dense at the outside? 21 Century computing

55. Sucheta Soundarajan Transmission paths for viruses, flow of ideas, or influence

56. Sparse vectors 21 Century computing There are a number of situations where sparse vectors are important Tracking the flow of ideas in scientific literature Biological applications Signal processing

57. Sparse vectors in biology 21 Century computing plants Genotype Internal code Phenotype Observables Outward manifestation

58. Theory to support new directions 21 Century computing  Large graphs  Spectral analysis  High dimensions and dimension reduction  Clustering  Collaborative filtering  Extracting signal from noise

59. Theory of Large Graphs  Large graphs with billions of vertices  Exact edges present not critical  Invariant to small changes in definition  Must be able to prove basic theorems 21 Century computing

60. Erdös-Renyi  n vertices  each of n 2 potential edges is present with independent probability 21 Century computing NnNn p n (1-p) N-n vertex degree binomial degree distribution number of vertices

61. 21 Century computing

62. Generative models for graphs  Vertices and edges added at each unit of time  Rule to determine where to place edges  Uniform probability  Preferential attachment- gives rise to power law degree distributions 21 Century computing

63. Vertex degree Number of vertices Preferential attachment gives rise to the power law degree distribution common in many graphs

64. 21 Century computing Protein interactions 2730 proteins in data base 3602 interactions between proteins Science 1999 July 30; 285:751-753 Only 899 proteins in components. Where are the 1851 missing proteins?

65. 21 Century computing Protein interactions 2730 proteins in data base 3602 interactions between proteins Science 1999 July 30; 285:751-753

66. Science base What do we mean by science base?  Example: High dimensions 21 Century computing

67. High dimension is fundamentally different from 2 or 3 dimensional space 21 Century computing

68. High dimensional data is inherently unstable Given n random points in d dimensional space, essentially all n 2 distances are equal. 21 Century computing

69. High Dimensions Intuition from two and three dimensions not valid for high dimension Volume of cube is one in all dimensions Volume of sphere goes to zero

70. 21 Century computing 1 Unit sphere Unit square 2 Dimensions

71. 21 Century computing 4 Dimensions

72. 21 Century computing d Dimensions 1

73. Almost all area of the unit cube is outside the unit sphere 21 Century computing

74. Gaussian distribution 21 Century computing Probability mass concentrated between dotted lines

75. Gaussian in high dimensions 21 Century computing

76. Two Gaussians 21 Century computing

78. Distance between two random points from same Gaussian  Points on thin annulus of radius  Approximate by a sphere of radius  Average distance between two points is (Place one point at N. Pole, the other point at random. Almost surely, the second point is near the equator.) 21 Century computing

81. Expected distance between points from two Gaussians separated by δ

82. Can separate points from two Gaussians if 21 Century computing

83. Dimension reduction Given n points in d dimensions, a random projection to log n dimensions will preserve all pair wise distances 21 Century computing

84. Dimension reduction for the Gaussians Project points onto subspace containing centers of Gaussians Reduce dimension from d to k, the number of Gaussians 21 Century computing

85. Centers retain separation Average distance between points reduced by

86. Can separate Gaussians provided 21 Century computing > some constant involving k and γ independent of the dimension

87. Finding centers of Gaussians 21 Century computing First singular vector v 1 minimizes the perpendicular distance to points

88. The first singular vector goes through center of Gaussian and minimizes distance to points Gaussian 21 Century computing

89. Best k-dimensional space for Gaussian is any space containing the line through the center of the Gaussian. 21 Century computing

90. Given k Gaussians, the top k singular vectors define a k dimensional space that contains the k lines through the centers of the k Gaussian and hence contain the centers of the Gaussians. 21 Century computing

91. We have just seen what a science base for high dimensional data might look like. What other areas do we need to develop a science base for?

92. 21 Century computing  Ranking is important  Restaurants, movies, books, web pages  Multi-billion dollar industry  Collaborative filtering  When a customer buys a product, what else is he likely to buy?  Dimension reduction  Extracting information from large data sources  Social networks

93. Time of change  The information age is a fundamental revolution that is changing all aspects of our lives.  Those individuals and nations who recognize this change and position themselves for the future will benefit enormously. 21 Century computing

94. Conclusions  We are in an exciting time of change.  Information technology is a big driver of that change.  Computer science theory needs to be developed to support this information age. 21 Century computing

95. THANK YOU