Department of Computer Science: 2008-2009 Annual Report

111111

Purdue University Department of

Computer Science

2008-09 Annual Report

22222222222

Cover image provided by Professor Jennifer Neville shows the Facebook friendship network, where nodes correspond to public members of the Purdue ‘11 network. Black edges represent all friendship ties; red edges represent ties that have been manually tagged as “Top Friends.” Professor Neville’s research focuses on developing machine learning methods to automatically identify the more infl uential “Top Friend” links based on social activity patterns in the network (e.g., photo tagging, wall postings). See page 36 for more details.

11

TABLE of CONTENTS

Year in Review

Departmental Research Areas

Research Funding

Research Highlights

Courtesy and Emeritus Faculty

Education

Engagement

Guest Speakers

Diversity

Visiting Faculty and Research Staff

Staff

Facilities

2

4

24

34

41

42

46

52

54

55

56

57

1

Teachers participate in the CS K-12 Outreach Linking Mathematics and Computer Science Workshop.

Corporate representatives visit the Lawson Commons to share career opportunities with students.

Graduate students meet on the Tolopka Terrace in the Lawson Computer Science Building.

Students enjoy the annual Computer Science Career Fair featuring members of the Corporate Partner Program.

CS honored 2008 outstanding alumni Jim Clamons, Phillip Chung, and Vincent DeGiulio.

22

Greetings from faculty, staff , and students of the Department of Computer Science! Th e 2008-09 year continued to be one of changes and growth. Our faculty approved signifi cant changes to the graduate qualifi er system. Th e new system off ers students increased fl exibility in the choice of courses they wish to take to move forward along the path towards a doctoral degree. We are on track to double the size of our graduate program. At the start of fall 2009, we had an enrollment of 216 graduate students as compared to 186 a year ago. We expect the number to increase to about 250 by fall 2010. Th is increase will change the graduate-student-to-faculty ratio from about 3.4 in 2008 to 6.5 in 2010. Th e increase in enrollment has made it easier for faculty to fi nd students to support their research program. Over the next three to fi ve years we expect a much-needed increase in the number of PhD and MS degrees in Computer Science awarded at Purdue.

Signifi cant changes have begun to take place in the undergraduate curriculum. Last year a group of faculty had welcomed the idea of introducing concurrent programming to freshmen and adding new courses at the junior level in this area. Given the rapid growth of multi-core processors, the department took on the challenge of teaching concurrent programming to every CS major. An experimental off ering of our fi rst programming class introduced concurrent programming to freshmen. A new textbook was written to introduce freshmen to concurrent programming. Student response to the course and the book was positive. Consequently, concurrent programming is now an integral portion of our freshman programming class, which is taught using Java. In addition, an experimental course focusing exclusively on concurrent programming was successfully off ered to juniors. Th is course will soon become an integral part of the undergraduate curriculum.

To improve retention we are now planning to introduce smart phones and robots in introductory programming classes. Th e plan is to use Android phones and Java-programmable robots in the course laboratories to begin with and subsequently bring these devices into the courses in a much more signifi cant way.

Awards, Honors, and PromotionsProfessor Greg Frederickson was inducted into the Purdue University Book of Great Teachers. Th e Book of Great Teachers--a list of Purdue’s fi nest educators--inducts new members only once every fi ve years. Wojtek Szpankowski has been named the Saul Rosen Professor of Computer Science. Szpankowski earns this recognition for his outstanding abilities as a researcher, teacher, and leader at Purdue. Professors Luo Si and Xiangyu Zhang each earned a National Science Foundation CAREER Award. Specifi cally, Si’s “An Integrated and Utility-Centric Framework for Federated Text Search” received this prestigious NSF award. Si plans to signifi cantly advance the state-of-the-art in federated text search. His algorithms have already been included in the Indiana Database for University Research Expertise (INDURE), an innovative system that is widely used by faculty, students, and businesses around the world to identify faculty experts in four universities in the state of Indiana. Professor Xiangyu Zhang’s proposal was titled “Scalable Dynamic Program Reasoning.” PhD student Ryan Riley, Prof. Xuxian Jiang, and Prof. Dongyan Xu received the RAID’08 best paper award for their work entitled “Guest-Transparent Prevention of Kernel Rootkits with VMM-based Memory Shadowing.” Sunil Prabhakar was named a University Faculty Scholar. Upsilon Pi Epsilon, the international honor society for the Computing and Information Disciplines, presented its most prestigious award, the Abacus Award, to Professor Eugene Spaff ord, for achievements in scholarship, leadership, and education. Professor Spaff ord also earned the 2009 Computing Research Association (CRA) Distinguished Service Award. Th is award is presented to an individual who has shown outstanding service to the computing research community.

Year in Review

33

Computer Science alumni, Steve Tolopka (MS, 1976; PhD, 1981) and Janet Tolopka (MS, 1978), performed at the 2009 Presidential Inauguration Parade on January 20, 2009 in Washington, DC as part of the Get a Life (GAL) adult marching band of Portland Oregon. Purdue University awarded CS alumna Dr. Moira Gunn (MS, 1972) an honorary PhD in science on May 15, 2009. Th is honor was presented to Gunn during the spring commencement ceremony in Elliott Hall of Music.

Our students continue to shine. Th e Committee for the Education of Teaching Assistants (CETA) honored graduate student teachers campus wide on Th ursday, April 23. During this celebration, CETA recognized Nwokedi Idika, Tion Th omas, Mohamed El Tabakh, and Mohamed Fouad. Th omas and Idika were Graduate Student Honorees at the event, El Tabakh was recognized as a Graduate Teacher Certifi cate Recipient, and Fouad received his Advanced Graduate Teacher Certifi cate. Purdue took third place among universities competing in the November 1st, 2008, ACM East Central North America (ECNA) Regional Programming Contest. Team “Purdue Cheburashka” fi nished in fourth place overall, behind two teams from CMU and one team from Waterloo. CS undergraduate students Brian Burg and Robert Gevers have been selected for Honorable Mentions in the Computing Research Association’s Outstanding Undergraduate Award.

Th e FutureComputer Science is a fast-changing discipline when compared with most other disciplines in Science and Engineering. New technologies come and replace or sideline existing ones. We are working hard to thoroughly revise our undergraduate off ering. Th e faculty is currently discussing a new structure that will include a core of a few foundational courses. On this core will be built a set of tracks in a variety of areas including information security, soft ware engineering, systems programming, and several others. Th is structure will help students decide what path to follow towards their degree. Given the vast expansion in the variety of sub-areas, it is nearly impossible for a student to complete all requirements for a degree in about four years and be able to successfully complete the many available electives. Th e tracks will serve as a guide to students and assist them in choosing a set of electives best for their career.Faculty members in the department are working hard to expand the research program. A large number of proposals, many in collaboration with faculty in other departments and some in collaboration with other top departments across the country, have been craft ed and submitted. Success in this activity is likely to signifi cantly change the shape of our department.

Daniel Aliaga and his wife, Varinia Barreto, attended the annual TechPoint Mira Awards Gala where Aliaga, Purdue Computer Science K-12 Outreach, and the Purdue Surprising Possibilities Imagined and Realized through Information Technology (SPIRIT) program were recognized as 2009 MIRA Award fi nalists.

Arman Suleimenov, Nathan Claus, and Zhanibek Datbayev traveled to Stockholm, Sweden to compete in the ACM World Finals Programming Contest in April 2009.

44

Faculty in the area of bioinformatics and computational biology apply computation methodologies such as databases, machine learning, and discrete, probabilistic, and numerical algorithms, and methods of statistical inference to problems in molecular biology, systems biology, structural biology, and molecular biophysics.

Bioinformatics and Computational Biology depends on the availability of massive amounts of data. Current work addressing this need includes the design and implementation of biological databases and text/data mining for life sciences, in particular, automatic gene function annotation from the literature.

Advances in molecular biology and systems biology involve the extraction of information and patterns from data. Work in this area includes fi nding context-sensitive modules from multiple cancer networks, identifying protein-DNA binding sites, analyzing fl ow cytometry data to fi nd cancer stem cells, algorithms and statistical approaches for functional annotation of molecules based on their sequences, identifying protein biomarkers for lung and prostate cancer using clinical data and experiments with model organisms, and studies of biomolecular networks.

Data for these projects are obtained by a variety of technologies, which include gene expression microarrays, protein-DNA binding data, fl ow cytometry data, sequence data, mass spectrometry-based proteomics and metabolomics, and ionomic profi ling.

Progress in structural biology and molecular biophysics requires models that incorporate physical properties of biomolecules as well as data. Work in this direction includes prediction and analysis of the relationship among protein sequence, structure and function, determining protein structure via NMR, determining transition paths of conformational change of proteins and free energies of protein-ligand binding, and simulating DNA dynamics and self-assembly.

Faculty involved in bioinformatics and computation biology at Purdue include Ananth Grama (p. 7), Daisuke Kihara, Gopal Pandurangan (p. 23), Alex Pothen (p. 7), Yuan (Alan) Qi, Luo Si (p. 17), Robert Skeel (p. 7), Wojciech Szpankowski (p. 23), and Olga Vitek.

Bioinformatics and Computational Biology

55

Daisuke Kihara Yuan (Alan) Qi

Selected Publications

Troy Hawkins, Stan Luban, and Daisuke Kihara, “Enhanced automated function prediction using distantly related sequences and contextual association by PFP”, Protein Science, Volume 15, 1550-1556, 2006.

Yen Hock Tan, He Huang, and Daisuke Kihara, “Statistical potential-based amino acid similarity matrices for aligning distantly related protein sequences”, Proteins: Structure, Function, Bioinformatics, Volume 64: pp.587-600, 2006.

Jianjun Hu, Yifeng David Yang, and Daisuke Kihara, “EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences”, BMC Bioinformatics, 7:342, 2006.

Y. Qi and T.S. Jaakkola, “Parameter Expanded Variational Bayesian Methods”, Advances in Neural Information Processing Systems, 19, MIT Press, Cambridge, MA, 2007.

Y. Qi, A. Rolfe, K. D. MacIsaac, G. K. Gerber, D. Pokholok, J. Zeitlinger, T. Danford, R. D. Dowell, E. Fraenkel, T. S. Jaakkola, R. A. Young, and D. K. Giff ord, “High-resolution Computational Models of Genome Binding Events”, Nature Biotechnology, vol. 24, 963-970, August, 2006.

Y. Qi, M. Szummer, and T. P. Minka, “Diagram Structure Recognition by Bayesian Conditional Random Fields”, Proceedings of International Conference on Computer Vision and Pattern Recognition, 2005.

S. Letarte, M.Y. Brusniak, D. Campbell, J. Eddes, C. J. Kemp, H. Lau, L. Mueller, A. Schmidt, P. Shannon, K. S. Kelly-Spratt, O. Vitek, H. Zhang, R. Aebersold, and J. D. Watts, “Diff erential Plasma Glycoproteome of p19ARF Skin Cancer Mouse Model Using the Corra Label-Free LC-MS Proteomics Platform”, Proteomics: Clinical Applications, 4, p. 105-116, 2008.

I. R. Baxter, O. Vitek, B. Lahner, B. Muthukumar, M. Borghi, J. Morrissey, M. L. Guerinot, and D. E. Salt, “Th e leaf ionome as a multivariable system to detect a plant’s physiological status”, Proceedings of the National Academy of Sciences, 105, p. 12081–12086, 2008.

L. Hohmann, J. Eng, A. Gemmill, J. Klimek, O. Vitek, G. Reid, and D. Martin, “Quantifi cation of the compositional information provided by immonium ions on a quadrupole-TOF mass spectrometer”, Analytical Chemistry, 80, p. 5596–5606, 2008.

Olga Vitek

66

Computational science and engineering, or scientifi c computing, provided impetus for many of the early Computer Science departments in the 1960s. Purdue is one of the few programs nationwide that have consistently maintained a leadership position in this important discipline. Th e scientifi c computing group is comprised of seven full-time faculty members (one with a joint appointment in Mathematics). Th e group’s research activity primarily focuses on the development of algorithms (combinatorial as well as numerical), parallel and distributed techniques, soft ware infrastructure, and novel computing platforms. Th ese research eff orts are driven by state-of-the-art applications in modeling of materials and bio-chemical processes (ranging from atomistic to systems-level models), novel micro-electromechanical systems, structural mechanics and control, robotics and advanced manufacturing, image processing and visualization (with applications in life-sciences and healthcare), and critical infrastructure protection (e.g., power-grids and other civil infrastructure).

Th e algorithmic research activities concern the development of novel solvers (linear and non-linear system solvers, eigenvalue/singular-value decompositions), techniques for real-time control, numerical methods for modeling many-body systems, combinatorial methods in network analysis, and computational geometry algorithms for reasoning about shapes and mechanisms. Systems development eff orts support these applications through the development of advanced compilers, runtime systems, data management and storage, and data analysis on scalable parallel platforms and distributed infrastructure.

Faculty involved in computational science and engineering at Purdue include Ananth Grama, Christoph Hoff mann (p. 13), Bradley Lucier, Alex Pothen, Elisha Sacks (p. 13), Ahmed Sameh, and Robert Skeel.

Computational Science and Engineering

77

Bradley Lucier Alex Pothen Ahmed SamehAnanth Grama Robert Skeel


Bogdan Carbunar, Ananth Grama, and Jan Vitek, and Octavian Carbunar, “Redundancy and Coverage Detection in Sensor Networks”, ACM Transactions on Sensor Networks, Volume 2, Issue 1, 2006.

Mehmet Koyuturk, Yohan Kim, Shankar Subramaniam, Wojciech Szpankowski, and Ananth Grama, “Detecting conserved interaction patterns in biological networks”, Journal of Computational Biology, 13(7), 1299-1322, 2006.

Ronaldo Ferreira, Suresh Jagannathan, and Ananth Grama, “Locality in Structured Peer-to-Peer Networks”, Journal of Parallel and Distributed Computing, Volume 66, Number 2, pages 257-273, 2006.

Antonin Chambolle, Ronald A. DeVore, Namyong Lee, and Bradley J. Lucier, “Nonlinear Wavelet Image Processing: Variational Problems, Compression, and Noise Removal through Wavelet Shrinkage”, IEEE Transactions on Image Processing: Special Issue on Partial Diff erential Equations and Geometry-Driven Diff usion in Image Processing and Analysis, 7(3):319-335, 1998.

Namyong Lee and Bradley J. Lucier, “Wavelet Methods for Inverting the Radon Transform with Noisy Data”, IEEE Transactions on Image Processing, 10(1):79-94, 2001.

Maria Kallergi, Bradley J. Lucier, Claudia G. Berman, Maria R. Hersh, J. Kim Jihai, Margaret S. Szabunio, and Robert A. Clark, “High-performance wavelet compression for mammography: localization response operating characteristic evaluation”, Radiology, 238(1):62-73, 2006.

Assefaw Gebremedhin, Arijit Tarafdar, Fredrik Manne, and Alex Pothen, “New acyclic and star coloring algorithms for computing Hessians”, SIAM Journal on Scientifi c Computing, Vol. 29 (3), pp. 1042-1072, 2007.

Bruce Hendrickson and Alex Pothen, “Combinatorial scientifi c computing: Th e enabling power of discrete algorithms in computational science”, Proceedings VECPAR 2006, LNCS, Vol. 4395, pp. 260-280, 2007.

Michael Wagner, Dayanand Naik, and Alex Pothen, “Computational protein biomarker prediction: A case study for prostate cancer”, BMC Bioinformatics, Vol. 5, pp. 26, 2004.

M. Manguoglu, A. Sameh, and O. Schenk, “PSPIKE: A Parallel Hybrid Sparse Linear System Solver”, Lecture Notes in Computer Science, Volume 5704, pp.797-808, 2009.

O. Schenk, M. Manguoglu, A. Sameh, M. Christen, and M. Sathe, “Parallel Scalable PDE-Constrained Optimization: Antenna Identifi cation in Hyperthermia Cancer Treatment Planning”, Computer Science Research and Development, Volume 23, Numbers 3-4, pp. 177-183, 2009.

M. Manguoglu, A. Sameh, F. Saied, T. Tezduyar, and S.Sathe, “Preconditioning Techniques for Non-symmetric Linear Systems in the Computation of Incompressible Flows”, Journal of Applied Mechanics, Volume 76(2), DOI: 10.1115/1.3059576 (7 Pages), Published online: 14 January 2009.

G. Zou and R.D. Skeel, “Robust biased Brownian dynamics for rate constant calculation”, Biophysical Journal, 85, pp. 2147-2157, 2003.

W. Wang and R. D. Skeel, “Fast Evaluation of Polarizable Forces”, Journal of Chemical Physics, 123, 164107 (12 pages), 2005.

J.C. Phillips, R. Braun, W. Wang, J. Gumbart, E.Tajkhorshid, E. Villa, C. Chipot, R.D. Skeel, L. Kale, and K. Schulten, “Scalable molecular dynamics with NAMD”, Journal of Computational Chemistry, 26, 1781-1802, 2005.

88

Th e database and data mining group at Purdue is composed of Professors Walid G. Aref, Elisa Bertino (p. 15), Bharat Bhargava, Christopher Clift on, Ahmed Elmagarmid, Susanne Hambrusch (p. 23), Jennifer Neville (p. 17), Sunil Prabhakar, and Luo Si (p. 17); Research Assistant Professors Tanu Malik and Mourad Ouzzani; and over thirty graduate students. Th e group conducts fundamental and cutting-edge research in database systems, database privacy and security, data mining, web search, information retrieval, and natural language processing. Current projects and topics include:

-Context aware database management systems (Aref, Bhargava, Ouzzani) -Cyber infrastructure (Elmagarmid, Malik, Ouzzani)-Data and service integration and schema matching (Elmagarmid, Ouzzani)-Data quality (Elmagarmid, Ouzzani)-Database security and online auctions (Bertino, Bhargava)-Location privacy (Aref, Bertino, Bhargava)-Massively parallel spatiotemporal data management (Aref, Ouzzani)-Privacy enhancing technologies for data, text, and data mining (Clift on)-Private and secure data dissemination (Aref, Bhargava, Clift on)-Scientifi c data management (Aref, Elmagarmid, Malik, Ouzzani)-Search and Intelligent Tutoring (Si)-Self-learning disk scheduling (Bhargava)-Statistical relational models (Neville)-Stream Data Management (Aref, Elmagarmid, Prabhakar)-Uncertainty data management (Hambrusch, Neville, Prabhakar)

Members of the database and data mining group engage in high-impact multidisciplinary projects and collaborations that involve multiple disciplines including Agronomy, Biology, Chemistry, Chemical Engineering, Physics, and Social Sciences.

Since 2003, the database and data mining group has graduated over 18 PhD students who have started their careers in various universities (e.g., Calgary, Minnesota, Rutgers, SUNY Albany, Texas at Dallas, Missouri University of Science and Technology, and Waterloo) and industry (e.g., Amazon, Google, IBM, and Microsoft ).

Details about the above research conducted and the multidisciplinary projects can be found at www.cs.purdue.edu/icds.


M.Y. Eltabakh, M. Ouzzani, and W.G. Aref, “bdbms -- A Database Management System for Biological Data”, 3rd Biennial Conference on Innovative Data Systems Research (CIDR), January 7-10, 2007, Asilomar, California, USA.

Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid, Hicham G. Elmongui, Rahul Shah, and Jeff rey Scott Vitter, “Adaptive Rank-aware Query Optimization in Relational Databases”, ACM Transactions on Database Systems (TODS), Volume 31, Issue 4, pp 1257-1304, December 2006.

X. Xiong and W. G. Aref, “R-trees with Update Memos”, IEEE International Conference on Data Engineering, Atlanta, GA, April 2006.

M. Hefeeda, B. Bhargava, and D. Yau, “A hybrid architecture for cost-eff ective on-demand media streaming”, Computer Networks Journal, Volume 44, pp. 353-382, 2004.

Databases and Data Mining

99

Bharat Bhargava

Christopher Clifton

Ahmed Elmagarmid

Walid Aref Sunil Prabhakar

B. Bhargava, X. Wu, Y. Lu, and W. Wang, “Integrating Heterogeneous Wireless Technologies: A Cellular-assisted mobile ad hoc network”, Mobile Networks and Applications: Special Issue on Integration of Heterogeneous Wireless Technologies, No. 9, pp. 393-408, 2004.

A. Habib, M. Khan, and B. Bhargava, “Edge-to-Edge Measurement-based Distributed Network Monitoring”, Computer Networks, Volume 44, Issue 2, pp. 211-233, Feb 2004.

Mehmet Ercan Nergiz, Chris Clift on, and Ahmet Erhan Nergiz, “MultiRelational k-Anonymity”, Transactions on Knowledge and Data Engineering 21(8):1104-1117, IEEE Computer Society, August 2009, Los Alamitos, CA.

Jaideep Vaidya, Chris Clift on, and Michael Zhu, “Privacy Preserving Data Mining”, Volume 19 in Advances in Information Security, Springer, New York, 2006 (url).

Jaideep Vaidya, Chris Clift on, Murat Kantarcioglu, and A. Scott Patterson, “Privacy-Preserving Decision Trees over Vertically Partitioned Data”, ACM Transactions on Knowledge Discovery in Data, 2(3), October 2008 (url).

Hazem Elmeleegy, Ahmed Elmagarmid, Emmanuel Cecchet, Walid Aref, and Willy Zwaenepoel, “Online Piece-wise Linear Approximation of Numerical Streams with Precision Guarantees”, Proceedings of the 35th International Conference on Very Large Databases, PVLDB 2009, August 2009, Lyon, France.

Mohamed Yakout, Mikhail J. Atallah, and Ahmed Elmagarmid, “Effi cient Private Record Linkage”, In the Proceedings of the 25th International Conference on Data Engineering ICDE 2009, Shanghai, China.

Ahmed K. Elmagarmid, Arjmand Samuel, and Mourad Ouzzani, “Community-Cyberinfrastructure-Enabled Discovery in Science and Engineering”, Computing in Science and Engineering, vol. 10, no. 5, pp. 46-53, September/October, 2008.

Yicheng Tu, Song Liu, Sunil Prabhakar, and Bin Yao, “Load Shedding in Stream Databases: A Control-Based Approach”, Proceedings of the International Conference on Very Large Databases (VLDB), September 2006, Seoul, Korea.

R. Sion, M. J. Atallah, and Sunil Prabhakar, “Rights Protection for Discrete Numeric Streams”, IEEE Transactions on Knowledge and Data Engineering, Vol. 18, No. 5, May 2006.

Reynold Cheng, Ben Kao, Sunil Prabhakar, Alan Kwan, and Yicheng Tu, “Adaptive Stream Filters for Entity-based Queries with Non-Value Tolerance”, Proceedings of the International Conference on Very Large Databases (VLDB), September 2005, Trondheim, Norway, pp. 37-48.

1010

Th e distributed systems group focuses on designing distributed systems that are scalable, dependable, and secure, behaving according to their specifi cation in spite of errors, misconfi gurations, or being subjected to attacks. Areas of focus include:

Virtualization technologies. One thrust is developing advanced virtualization technologies for computer malware defense and virtual distributed computing. Researchers at the FRIENDS lab (Lab For Research In Emerging Network & Distributed Systems) have developed a virtualization-based experimental platform for malware containment, observation, and analysis.

Ongoing research eff orts in the computer malware defense area include: operating system level information fl ow tracking for user-level malware investigation; virtual machine (VM) introspection for stealthy malware monitoring and detection; and VM memory shadowing for kernel-rootkit prevention and profi ling. In the virtual distributed computing area, the lab has proposed and instantiated the concept of “virtual networked environment” for creating virtual infrastructures on top of a shared physical hosting infrastructure. Th e concept and its enabling techniques have been applied to support a number of emerging applications such as scientifi c job execution, virtual organizations, and tele-immersion.

Intrusion tolerant systems. Researchers at the Dependable and Secure Distributed Systems Laboratory (DS2) are designing distributed systems, networks and applications that can tolerate insiders, while maintaining acceptable levels of performance. Recent research lies in designing intrusion-tolerant systems in the context of (1) replication services, (2) routing for wireless ad hoc networks, and (3) unstructured overlays for peer-to-peer streaming.

Model checking and simulation testing. Another thrust is studying the utility of distributed-system model checking and simulation testing by coupling it with dynamic program slicing and machine learning. Each of these techniques have the ability to summarize and focus the massive amounts of available information so the programmer-designer can focus on the signifi cant parts of the execution while ignoring the rest. Th e goal is to develop enabling technologies and prototype frameworks for collaborative high-performance distributed computing and simulation that may be adapted and enhanced to deploy scalable and portable systems.

Experimental analysis. Researchers at the RAID laboratory are conducting scientifi c research in a variety of subjects related to experimental analysis such as: communication experiments for distributed applications, network communication measurement experiments, experimental analysis of communication infrastructure, adaptability experiments for distributed systems, replication and recovery experiments for distributed database systems, concurrent check-pointing and rollback-recovery algorithms, concurrency control for distributed database systems, effi cient implementation techniques for distributed systems, digital library, and mobile communication.

Faculty involved in distributed systems at Purdue include Bharat Bhargava (p. 9), Patrick Eugster (p. 21), Ananth Grama (p.7), Antony Hosking (p. 21), Suresh Jagannathan (p. 21), Charles Killian, Cristina Nita-Rotaru (p. 15), Gopal Pandurangan (p. 23), Kihong Park (p. 19), Vernon Rego, Dongyan Xu, and David Yau (p. 19).

Distributed Systems

1111

Charles Killian Vernon Rego Dongyan Xu


Charles Killian, James W. Anderson, Ranjit Jhala, and Amin Vahdat, “Life, Death, and the Critical Transition: Finding Liveness Bugs in Systems Code”, in Proceedings of Networked Systems Design and Implementation, 2007, awarded best paper.

Charles Killian, James W. Anderson, Ryan Braud, Ranjit Jhala, and Amin Vahdat, “Mace: Language Support for Building Distributed Systems”, Proceedings of Programming Languages Design and Implementation, 2007.

Darren Dao, Jeannie Albrecht, Charles Killian, and Amin Vahdat, “Live Debugging of Distributed Systems”, Proceedings of International Conference on Compiler Construction (CC 2009), March, 2009.

Jorge Ramos and Vernon Rego, “Effi cient Implementation of Multiprocessor Scheduling Algorithms on a Simulation Testbed”, Soft ware: Practice & Experience, Vol. 35, No. 1, pp. 27-50, 2005.

J.C. Gomez, V. Rego, and V. Sunderam, “Scheduling Communication in Multithreaded Programs: Experimental Results”, Concurrency and Computation: Practice & Experience, Vol. 18, No. 1, pp. 1-28, 2006.

Jorge Ramos, Vernon Rego, and Janche Sang, “An Effi cient Burst-Arrival and Batch-Departure Algorithm for Round-Robin Service”, Simulation: Practice & Th eory, Vol. 14, No. 1, pp. 1-24, 2006.

X. Jiang and D. Xu, “Collapsar: A VM-Based Architecture for Network Attack Detention Center”, Proceedings of the 13th USENIX Security Symposium (Security 2004), San Diego, CA, August 2004.

P. Ruth, X. Jiang, D. Xu, and S. Goasguen, “Towards Virtual Distributed Environments in a Shared Infrastructure”, IEEE Computer, Special Issue on Virtualization Technologies, May 2005.

M. Hefeeda, A. Habib, D. Xu, B. Bhargava, and B. Botev, “CollectCast: A Peer-to-Peer Service for Media Streaming”, ACM/Springer Multimedia Systems Journal, October 2005.

1212

Th e graphics group performs research in graphics, visualization, computational geometry, and related applications. Th is report describes fi ve projects on which the group focused.

Model acquisition. Th e graphics and visualization group developed self-calibrating methods for acquiring high-quality geometric models (accuracy as high as 0.05mm) of objects and of room-size scenes. Th ey combined photometric measurements with geometric measurements and used algebra to eliminate many calibration parameters. Th is approach led to better algorithms for capturing dynamic scenes, for acquiring models of highly specular and interrefl ective scenes, and for changing the appearance of objects.

Simulation. In collaboration with civil engineers, the graphics and visualization team produced a high-fi delity simulation of the 9/11 attack on the World Trade Center. Th e interest in such a simulation transcends civil engineering and includes emergency response, defense, and society in general. Th e simulation follows the laws of physics as closely as possible. Th e results are presented through a visualization that is eloquent to users outside of civil engineering. Th e visualization has been downloaded over fi ve million times.

Visualization. Computer simulations and modern measuring devices produce an overwhelming volume of data. To turn this information into insight, the Purdue graphics and visualization researchers are developing visualization techniques that allow domain experts to focus on salient properties. Th e team combines powerful mathematical models and expressive visual representations to off er a precise structural picture of complex phenomena. Th ey are applying these techniques to fl uid dynamics and aeronautics, fusion research, bioengineering, and medical imaging.

Urban modeling. Faculty in the area of graphics and visualization are working on the acquisition and simulation of large urban environments. Th e goal is to obtain digital models of large-scale urban structures in order to simulate physical phenomena and human activities. Th e models should be easily modifi able in order to simulate response policies in unforeseen scenarios and to guide urban development. Th e researchers have developed algorithms that use ground-level imagery, aerial imagery, procedural modeling, and street and parcel data to create and modify 3D geometry and 2D layouts.

Robust computational geometry. Computational geometry algorithms are formulated in a model where arithmetic operations have infi nite accuracy and unit cost. Th e robustness problem is how to implement the algorithms in computer arithmetic, which has unit cost, but is approximate. Th e main diffi culty is that even tiny numerical errors can cause arbitrarily large output errors. Our strategy is to develop algorithms that enforce consistency constraints and whose error and cost are polynomial in the number of input inconsistencies. We developed robust versions of fi ve core algorithms and validated them on examples that far exceed the capabilities of prior work.

Faculty involved in graphics and visualization at Purdue include Daniel Aliaga, Christoph Hoff mann, Voicu Popescu, Elisha Sacks, and Xavier Tricoche.


C. Vanegas, D. Aliaga, B. Benes, and P. Waddell, “Interactive Design of Urban Spaces using Geometrical and Behavioral Modeling”, ACM Transactions on Graphics, 28(5), 10 pages, 2009.

D. Aliaga, A. Law, and Y. H. Yeung, “A Virtual Restoration Stage for Real-World Objects”, ACM Transactions on Graphics, 27(5), 10 pages, 2008.

Graphics and Visualization

1313

Christoph Hoff mann

Voicu Popescu Elisha SacksDaniel Aliaga Xavier Tricoche

D. Aliaga and Y. Xu, “Photogeometric Structured Light: A Self-Calibrating and Multi-Viewpoint Framework for Accurate 3D Modeling”, Proceedings of IEEE Computer Vision and Pattern Recognition, 8 pages, 2008.

Y. J. Ahn and C. Hoff mann, “Constraint-Based LN Curves”, Proceedings of ACM SAC’10, Serre, Switzerland, March 2010.

S. Kim, C. Hoff mann, and J. M. Lee, “An Experiment in Rule-based Crowd Behavior for Intelligent Games”, Proceedings of ICCIT09, Seoul, Korea, November 2009.

S. Hambrusch, C. Hoff mann, T. Korb, M. Haugan, and A. Hosking, “Teaching Computational Th inking to Science Majors”, Proceedings of SIGCSE 2009, Mar. 2009, Chattanooga, TN.

V. Popescu, P. Rosen, and N. Adamo-Villani. “Th e Graph Camera”. ACM SIGGRAPH Asia, ACM Transactions on Graphics, 28(5), 2009.

P. Rosen, V. Popescu, C. Hoff mann, and A. Irfanoglu. “A High-Quality Physically-Accurate Visualization of the September 11 Attack on the World Trade Center”, IEEE Transactions on Visualization and Computer Graphics, Volume 14, Issue 4, pp. 937-947, 2008.

M. Mudure and V. Popescu, “1001 Acquisition Viewpoints-Effi cient and Versatile View-Dependent Modeling of Real-World Scenes”, Th e Visual Computer, Volume 24, Numbers 7-9, pp. 669-678, 2008.

Min-Ho Kyung and Elisha Sacks, “Robust Parameter Synthesis for Planar Higher Pair Mechanical Systems”, Computer-Aided Design, 38(5), 2006.

Victor Milenkovic and Elisha Sacks, “A monotonic convolution for Minkowski sums”, International Journal of Computational Geometry and Applications, 17(4), 383-396, 2007.

Victor Milenkovic and Elisha Sacks, “Two approximate Minkowski sum algorithms”, International Journal of Computational Geometry and Applications, 2008.

X. Tricoche and C. Garth, “Topological Methods for Visualizing Vortical Flows”, Mathematical Foundations of Visualization, Computer Graphics, and Massive Data Exploration, Springer, 89-108, 2009.

X. Tricoche, G. Kindlmann, and C.F. Westin, “Invariant Crease Lines for Topological and Structural Analysis of Tensor Fields”, IEEE Transactions on Visualization and Computer Graphics, 14(6), 2008, 1627-1634.

G.S. Li, X. Tricoche, D. Weiskopf, and C.D. Hansen, “Flow Charts: Visualization of Vector Fields on Arbitrary Surfaces”, IEEE Transactions on Visualization and Computer Graphics, 14(5), 2008, 1067-1080.

1414

Research in information security and assurance is carried out by faculty, most of whom are affi liated with the university-wide Center for Education and Research in Information Assurance and Security (CERIAS). CERIAS is generally considered to be the top-ranked such group in the world, with faculty from over a dozen departments at Purdue. Th eir research covers all aspects of computer and network security, privacy, and cyber crime investigation. Areas of special focus by CS faculty include:

Identifi cation, authentication, and privacy. Th ere is a tension between increased confi dence and granularity of authorization provided by better identifi cation of on-line entities, and with the need to protect the privacy rights of individuals and organizations. Th is area includes research in role-based access control, privacy-protecting transformations of data, privacy-protecting data mining methods, privacy regulation (e.g., HIPAA), oblivious multiparty computation, and digital identity management systems.

Incident detection, response, and investigation. Systems are attacked, and sometimes attacks succeed. Th is area of our expertise includes intrusion and misuse detection, integrity management issues, audit and logging analysis, sensor and alarm design, strike-back mechanisms, dynamic reconfi guration, honeypots and ‘jails’, cyberforensics.

Cryptology and rights management. Controlling information from being read or altered by others, preserving marks of ownership and origin, and breaking the code of adversaries are all of interest in information security. Research interests include encryption, number theoretic foundations, cryptanalysis, and watermarking.

Data security. Data is oft en the most important asset that organizations have and it is the target of almost all attacks. Relevant research includes: secure architectures for databases, security of streaming data, high-assurance integrity systems for databases, anomaly detection and response system mechanisms for databases.

System security. Advanced virtualization-based techniques are developed for the detection, prevention and profi ling of both user-level and kernel-level computer malware. Research includes the use of these techniques for protection from botnets.

Trusted social and human interactions. How does IT change our interactions, and how can more trustworthy IT change them further? Th is includes studies of on-line trust, ecommerce (business-to-business and business-to-consumer), digital government services, e-conferencing, on-line personae and anonymity, online news, on-line research and the ephemeral nature of information, on-line propaganda, and spam.

Faculty involved in information security and assurance at Purdue include Mikhail Atallah, Elisa Bertino, Bharat Bhargava (p. 9), Christopher Clift on (p. 9), Sonia Fahmy (p. 19), Ninghui Li, Cristina Nita-Rotaru, Kihong Park (p. 19), Sunil Prabhakar (p. 9), Vernon Rego (p. 11), Eugene H. Spaff ord, Jan Vitek (p. 21), Samuel Wagstaff , Dongyan Xu (p. 11), and David Yau (p. 19).


Daniel Aliaga and Mikhail J. Atallah, “Genuinity Signatures: Designing Signatures for Verifying 3D Object Genuinity”, Proceedings 30th Annual Conference of the European Association for Computer Graphics (Eurographics 09), Munich, Germany, 2009.

Hao Yuan and Mikhail J. Atallah, “Effi cient Data Structures for Range-Aggregate Queries on Trees”, Proceedings of 12th International Conference on Database Th eory (ICDT 09), Saint-Petersburg, Russia, 2009.

Mikhail J. Atallah, YounSun Cho, and Ashish Kundu, “Effi cient Data Authentication in an Environment of Untrusted Th ird-Party Distributors”, Proceedings 24th International Conference on Data Engineering (ICDE 08), Cancun, Mexico, 2008.

Information Security and Assurance

1515

Elisa Bertino Ninghui Li CristinaNita-Rotaru

Mikhail Atallah Eugene H. Spaff ord

Samuel Wagstaff

Qun Ni, Elisa Bertino, and Jorge Lobo, “D-algebra for Composing Access Control Policy Decisions”, Proceedings of the 2009 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2009, March 10-12, 2009 Sydney, Australia, ACM 2009.

Wonjun Lee, Anna Cinzia Squicciarini, and Elisa Bertino, “Th e Design and Evaluation of Accountable Grid Computing Systems”, Proceedings of 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), June 22-26 2009, Montreal, Québec, Canada. IEEE Computer Society 2009.

Tianjie Cao, Elisa Bertino, and Hong Lei, “Security Analysis of the SASI Protocol”, IEEE Transactions on Dependable and Secure Computing, v. 6, no. 1, pp. 73-77, 2009.

Tiancheng Li and Ninghui Li, “On the Tradeoff Between Privacy and Utility in Data Publishing”, In Proceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD-09), pages 517-526, June 2009.

Ninghui Li, Qihua Wang, and Mahesh V. Tripunitara, “Resiliency Policies in Access Control”, ACM Transactions on Information and Systems Security (TISSEC), 12(4), April 2009.

Ninghui Li and Qihua Wang, “Beyond Separation of Duty: An Algebra for Specifying High-level Security Policies”, Journal of the ACM, 55(3), 46 pages, July 2008.

R. Curtmola and C. Nita-Rotaru, “BSMR: Byzantine-Resilient Secure Multicast Routing in Multi-hop Wireless Networks.”, IEEE Transactions on Mobile Computing (TMC), vol. 8, no. 4, April 2009.

A. Walters, D. Zage and C. Nita-Rotaru, “A Framework for Mitigating Attacks Against Measurement-Based Adaptation Mechanisms in Unstructured Multicast Overlay Networks”, IEEE/ACM Transactions on Networking, vol. 16, no. 6, Dec. 2008.

D. Zage and C. Nita-Rotaru, “On the Accuracy of Decentralized Network Coordinate Systems in Adversarial Networks”, 14th ACM CCS, Alexandria, VA, USA, October 29 - November 2, 2007.

Travis D. Breaux, Annie I. Antón, and Eugene H. Spaff ord, “A Distributed RequirementsManagement Framework For Legal Compliance and Accountability”, Computers and Security, Elsevier, 28(1), pp. 8-17, Jan. 2009.

Yu-Sung Wu, Bingrui Foo, Gaspar Modelo-Howard, Saurabh Bagchi, and Eugene H. Spaff ord, “Th e Search for Effi ciency in Automated Intrusion Response for Distributed Applications”, Proceedings of the 27th IEEE Symposium on Reliable and Distributed Systems (SRDS 2008), October 2008, pp. 53-62, Napoli, Italy.

Xuxian Jiang, Florian Buchholz, Aaron Walters, Dongyan Xu, Yi-Min Wang, and Eugene H. Spaff ord, “Tracing Worm Break-in and Contaminations via Process Coloring: A Provenance-Preserving Approach”, IEEE Transactions on Parallel and Distributed Systems, 19(7), pp. 890-902, Jul. 2008.

J. Gower and S. S. Wagstaff Jr., “Square Form Factorization”, Mathematics of Computation, v. 77 (2008), pages 551-588.

S. S. Wagstaff Jr., “Congruences for rs(n) modulo 2s”, Journal of Number Th eory, v. 127 (2007), pages 326-329.

Elisa Bertino, Ning Shang and Samuel S. Wagstaff , Jr., “An Effi cient Time-Bound Hierarchical Key Management Scheme for Secure Broadcasting”, IEEE Transactions on Dependable and Secure Computing, Vol. 5, no. 2 (2008), pp. 65-70.

1616

With massive data available from various engineering, scientifi c, and social disciplines, machine learning and information retrieval have played an imperative role in discovering hidden patterns or relationships between intertwined components (e.g., people, web pages, or genes, in a complex system), understanding properties of various systems, and making meaningful predictions for a variety of applications.

In the past few years, Purdue has grown a strong machine learning and information retrieval group with strengths in multiple areas of this fi eld. In particular, Professor Jennifer Neville works on multiple problems in relational modeling, such as fusion and analysis of multi-source relational data, and modeling relational communication on distributed team eff ectiveness. Her team also integrates machine learning methods with agent-based models to form a compositional model, which will combine components that are learned from data with components that are hand-engineered using traditional methods. Th is combination will produce powerful tools for understanding the emergent behavior of complex social and organizational systems. Professor Luo Si develops federated text search, which is the search beyond traditional engines such as Google, Yahoo! or MSN by fi nding information that is “hidden’’ behind many search engines. His team also uses cutting-edge computer science techniques to construct an exploratory but fully functioning diff erentiated instructional system of mathematical word problem solving. Professor Christopher Clift on (p. 9) addresses problems in privacy-preserving data mining by developing technology that share some information to calculate correct results, where the shared information can be shown not to disclose private data. Professor S.V.N. Vishwanathan works on kernel methods and interactions between machine learning and optimization. Professor Yuan (Alan) Qi’s (p. 5) research interests span several areas in machine learning and computational biology. His team develops new methods to detect context sensitive modules for complex biological and social networks, combines statistical learning with ab-inito methods for computational materials design, and design Bayesian matrix factorization methods for collaborative fi ltering (with applications to online recommendation systems) and text clustering.

Faculty in this area have obtained signifi cant funding support for their research activities. Th ey have also received external recognition such as the IEEE “AI’s 10 to watch” for Prof. Neville, an NSF career award for Prof. Si, and Microsoft Breakthrough research award (one out of ten nationally) for Prof. Qi.

Machine Learning and Information Retrieval

1717

Jennifer Neville Luo Si S.V.N. Vishwanathan


U. Sharan and J. Neville, “Temporal-Relational Classifi ers for Prediction in Evolving Domains”, In Proceedings of the 8th IEEE International Conference on Data Mining, 2008.

J. Neville and D. Jensen, “A Bias/Variance Decomposition for Models Using Collective Inference”, Machine Learning Journal, 2008.

R. Xiang and J. Neville, “Pseudolikelihood EM for Within-Network Relational Learning”, In Proceedings of the 8th IEEE International Conference on Data Mining, 2008.

Luo Si and Jamie Callan, “Modeling Search Engine Eff ectiveness for Federated Search”, In Proceedings of the Twenty Seventh Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2005, ACM.

Rong Jin, Luo Si, and ChengXiang Zhai, “A Study of Mixture Models for Collaborative Filtering”, Journal of Information Retrieval, 2006.

Luo Si and Jamie Callan, “A Semi-Supervised Learning Method to Merge Search Engine Results”, In ACM Transactions on Information Systems, 24(4), 2003, ACM.

Alexander J. Smola, S. V. N. Vishwanathan, and Quoc V. Le, “Bundle Methods for Machine Learning”, Advances in Neural Information Processing Systems, 20, 2007.

S. V. N. Vishwanathan, Nicol N. Schraudolph, and Alexander J. Smola, “Step Size Adaptation in Reproducing Kernel Hilbert Space”, Journal of Machine Learning Research, June 2006.

S. V. N. Vishwanathan and Alexander J. Smola, “Fast Kernels for String and Tree Matching”, Kernel Methods in Computational Biology, 2004.

1818

Faculty in the area of networking and operating systems are tackling fundamental problems at diff erent layers of the network protocol stack, ranging from the medium access control layer all the way up to the application layer. Th e group uses theoretical models, simulation, emulation, and extensive testbed experimentation to develop and evaluate their proposed solutions. Th e group has leveraged techniques from game theory, information theory, complexity theory, optimization and cryptography in their solutions. Th e group has implemented their methods on a variety of platforms, ranging from large clusters, to network processors, and resource-constrained wireless sensor motes.

Projects that the faculty have undertaken include fault localization in enterprise networks; packet classifi cation, queueing, and scheduling in Internet routers; secure and scalable media streaming over the Internet; secure network coding in wireless mesh networks; design of defenses against Internet worms and malware; scalable network simulation; and coverage, localization and data fusion in energy-constrained wireless sensor networks.

A recent project led by Professor Douglas Comer investigates hybrid packet schedulers that achieve low delay and a high degree of fairness. Comer and researchers in his group are investigating the implementation of their algorithms on network processors to achieve performance suffi cient for a 10 Gbps link.

Another recent project, led by Professor Sonia Fahmy, considers scalable network security experiments. A primary reason for lack of deployment of network security mechanisms is that most mechanisms have not been validated under realistic conditions, or at suffi ciently large scales.

Th e project includes two complementary eff orts to address both the fi delity and scale challenges in security experiments by designing: (1) high-fi delity yet scalable models for routers and other devices based on simple device measurements under a few well-craft ed scenarios, and (2) techniques to simplify experimental scenarios before studying them using simulation, emulation, or testbed experiments.

Professor Ramana Kompella conducts research on scalable measurement solutions for next generation networks. In particular, his recent work involved designing streaming algorithms for high-fi delity latency measurements within routers. Another ongoing project designs new fl ow measurement architectures that off er network operators with fl exibility required to satisfy a wide-variety of network management tasks.

Faculty involved in networking and operating systems at Purdue include Douglas Comer, Sonia Fahmy, Charles Killian (p. 11), Ramana Kompella, Cristina Nita-Rotaru (p. 15), Kihong Park, Dongyan Xu (p. 11), and David Yau.


D. Comer, Internetworking with TCP/IP Volume 1: Principles, Protocols, and Architecture, Prentice-Hall, Upper Saddle River, NJ, Fift h edition, 2005.

D. Comer and M. Martynov, “Design And Analysis Of Hybrid Packet Schedulers”, IEEE INFOCOM, April, 2008.

D. Comer, Computer Networks And Internets, Prentice-Hall, Upper Saddle River, NJ, Fift h edition, 2009.

R. Chertov, S. Fahmy, and N. B. Shroff , “Fidelity of network simulation and emulation: A case study of TCP-targeted denial of service attacks”, ACM Transactions on Modeling and Computer Simulation, 19(1):4:1-29, December 2008.

Networking and Operating Systems

1919

Sonia Fahmy Ramana Kompella

Kihong ParkDouglas Comer David Yau

S. Fahmy and M. Kwon, “Characterizing overlay multicast networks and their costs”, IEEE/ACM Transactions on Networking, 15(2):373-386, April 2007.

O. Younis and S. Fahmy, “HEED: A hybrid, energy-effi cient, distributed clustering approach for ad-hoc sensor networks”, IEEE Transactions on Mobile Computing, 3(4):366-379, Oct-Dec 2004.

Ramana Rao Kompella, Alex C. Snoeren, Jennifer Yates, and Albert Greenberg, “Fault Localization via Risk Modeling”, IEEE Transactions on Dependable and Secure Computing, 99(1), 2009.

Ramana Rao Kompella, Kirill Levchenko, Alex C. Snoeren, and George Varghese, “Every Microsecond Counts: Tracking Fine-grain Latencies with Lossy Diff erence Aggregator”, ACM SIGCOMM, Barcelona, Spain, August, 2009.

Vyas Sekar, Michael Reiter, Walter Willinger, Hui Zhang, Ramana Rao Kompella, and David G. Andersen, “cSamp: A System for network-wide fl ow monitoring”, in the Proceedings of Fift h USENIX Symposium on Networked Systems Design and Implementation, San Francisco, CA, April 2008.

S. Choi, K. Park and C. Kim, “On the Performance Characteristics of WLANs: Revisited”, Proceedings of the ACM SIGMETRICS 2005, pp. 97-108, 2005.

A. Lomonosov, M. Sitharam and K. Park, “Network QoS Games: Stability vs Optimality Tradeoff ”, Journal of Computer and System Sciences, Volume 69, pp. 281-302, 2004.

K. Park and W. Willinger (eds.), “Th e Internet as a Large-Scale Complex System”, SFI Studies in the Sciences of Complexity, Oxford University Press, 2005.

David K. Y. Yau, John C. S. Lui, Feng Liang, and Yeung Yam, “Defending Against Distributed Denial-of-Service Attacks with Max-min Fair Server-centric Router Th rottles”, IEEE/ACM Transactions on Networking, 13(1), February 2005.

Richard T. B. Ma, Sam C. M. Lee, John C. S. Lui, and David K. Y. Yau, “A Game Th eoretic Approach to Provide Incentive and Service Diff erentiation in P2P Networks”, In Proceedings ACM SIGMETRICS, New York, NY, June 2004.

Simon S. Lam, Simon Chow, and David K. Y. Yau, “A Lossless Smoothing Algorithm for Compressed Video”, IEEE/ACM Transactions on Networking, 4(5), October 1996.

2020

Th e programming languages and compilers group at Purdue is engaged in research spanning all aspects of soft ware systems design, analysis, and implementation. Our faculty have active research projects in functional and object-oriented programming languages, both static and dynamic compilation techniques for scalable multicore systems, scripting languages, distributed programming abstractions and implementations, realtime and embedded systems, mobile and untrusted computing environments, and runtime systems with special focus on memory management and parallel computing environments.

Th e soft ware engineering group conducts research on applying advanced program analyses towards problems related to fault isolation, various kinds of bug detection including those related to race conditions in concurrent programs, and specifi cation inference for large-scale soft ware systems. Aspect-oriented abstractions and new program slicing and mining techniques are some of the mechanisms that are being explored to address these issues.

Faculty involved in programming languages, compilers, and soft ware engineering at Purdue include H. E. Dunsmore, Patrick Eugster, Antony Hosking, Suresh Jagannathan, Zhiyuan Li, Aditya Mathur, Vernon Rego (p. 11), Eugene H. Spaff ord (p. 15), Jan Vitek, and Ziangyu Zhang.


K. Hoff man and P. Eugster, “Towards Reusable Components with Aspects: An Empirical Study on Modularity and Obliviousness”, 30th ACM/IEE International Conference on Soft ware Engineering (ICSE 2008), May 2008.

K. Hoff man and P. Eugster, “Cooperative Aspect-oriented Programming”, Science of Computer Programming, 2009.

H. Yuan and P. Eugster, “An Effi cient Algorithm for Solving the Dyck-CFL-Reachability Problem on Trees”, 18th European Symposium on Programming (ESOP), March 2009.

Ni Y., Menon V., Adl-Tabatabai A. R., Hosking A. L., Hudson R. L., Moss J. E. B., Saha B., and Shpeisman T., “Open nesting in soft ware transactional memory”, ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), March 2007.

Pizlo F., Hosking A. L., and Vitek J., “Hierarchical real-time garbage collection”, Proceedings of the ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES), June 2007.

Blackburn S.M., McKinley K.S., Garner R., Hoff mann C., Khan A.M., Bentzur R., Diwan A., Feinberg D., Frampton D., Guyer S. Z., Hirzel M., Hosking A., Jump M., Lee H., Moss J. E. B., Phansalkar A., Stefanovic D., VanDrunen T., Dincklage D., and Wiedermann B., “Wake Up and Smell the Coff ee: Evaluation Methodology for the 21st Century”, Communications of the ACM, August 2008.

Ramanathan M., Grama A., and Jagannathan S., “Static Specifi cation Inference Using Predicate Mining”, ACM Conference on Programming Language Design and Implementation (PLDI), June 2007.

Lukasz Ziarek, Philip Schatz, and Suresh Jagannathan, “Stabilizers: A Modular Checkpointing Abstraction for Concurrent Functional Programs”, ACM International Conference on Functional Programming, 2006.

Adam Welc, Antony Hosking, and Suresh Jagannathan, “Transparently Reconciling Locks with Transactions for Java Synchronization”, European Conference on Object-Oriented Programming, 2006.

Lixia Liu and Zhiyuan Li, “Improving Parallelism and Locality with Asynchronous Algorithms”, Proceedings of 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), January 9-14, 2010, Bangalore, India.

Lixia Liu, Zhiyuan Li, and Ahmed H. Sameh, “Analyzing memory access intensity in parallel programs on multicore”, Proceedings of 22nd ACM International Conference on Supercomputing (ICS), Pages 359-367, Island of Kos, Aegean Sea, Greece, June 7-12, 2008.

Programming Languages, Compilers,and Software Engineering

2121

Antony Hosking

Suresh Jagannathan

Zhiyuan Li Jan Vitek Xiangyu Zhang

Douglas Herbert, Vinaitheerthan Sundaram, Yung-Hsiang Lu, Saurabh Bagchi, and Zhiyuan Li, “Adaptive correctness monitoring for wireless sensor networks using hierarchical distributed run-time invariant checking”, ACM Transactions on Autonomous and Adaptive Systems (TAAS), 2(2), pp. 8:1-8:23, 2007.

Ammar Masood, Arif Ghafoor, and Aditya Mathur, “Conformance Testing of Temporal Role-Based Access Control Systems”, IEEE Transactions on Dependable and Secure Computing, 21 Jul. 2008, IEEE computer Society Digital Library, IEEE Computer Society, (http://doi.ieeecomputersociety.org/10.1109/TDSC.2008.41).

Scott Miller, Raymond DeCarlo, and Aditya P. Mathur, “Quantitative Modeling for incremental soft ware process control”, Proceedings of the 32nd Annual IEEE International Computer Soft ware and Applications Conference, pp. 937-942, Turku, Finland, July 28-August 1, 2008.

Masood A., Bhatti R., Ghafoor A., and Mathur A. P., “Scalable and Eff ective Test Generation for Role-Based Access Control Systems”, IEEE Transaction on Soft ware Engineering, Volume 35, Issue 5, Sept.-Oct. 2009, Page(s):654 - 668.

T. Zhao, J. Palsberg, and J. Vitek, “Type-based Confi nement”, Journal of Functional Programming, 2006.

A. Armbuster, J. Baker, A. Cunei, C. Flack, D. Holmes, F. Pizlo, E. Pla, M. Prochazka, and J. Vitek, “A Real-Time Java Virtual Machine with Applications in Avionics”, ACM Transactions on Embedded Systems, 2006.

C. Andrea, Y. Coady, C. Gibbs, J. Noble, J. Vitek, and T. Zhao, “Scoped Types and Aspects for Real-Time Systems”, Proceedings of the European Confrence on Object Oriented Programming (ECOOP), 2006.

X. Zhang, N. Gupta, and R. Gupta, “Pruning Dynamic Slices With Confi dence”, ACM SIGPLAN Conference on Programming Language Design and Implementation, 2006.

X. Zhang and R. Gupta, “Whole Execution Traces and their Applications”, ACM Transactions on Architecture and Code Optimization, 2005.

X. Zhang and R. Gupta, “Matching Execution Histories of Program Versions”, Conference and 13th ACM SIGSOFT Symposium on the Foundations of Soft ware Engineering, 2005.

Patrick Eugster

Aditya Mathur

H. E. (Buster) Dunsmore

2222

Research interests of the members of the theory of computing and algorithms group range over many areas of algorithms. Th ese areas include analysis of algorithms, parallel computation, computational geometry, digital watermarking, data structures, graph algorithms, network algorithms, distributed computation, computational biology, information theory, analytic combinatorics, random structures, external memory algorithms, approximation algorithms, data mining, bioinformatics, and text indexing. Much of the research refl ects interaction with other areas of the fi eld, such as information security, databases, and geographic information systems.

Th e ongoing research at Purdue includes theoretical advances, theoretical improvements on applied problems, and algorithms with immediate potential for application. Th e group has made notable contributions on topics such as updating minimum spanning trees, shortest paths in planar graphs, computing approximate minimum spanning trees distributively, low-diameter P2P networks, parallel computational geometry, cascading divide and conquer, query indexing and velocity constrained indexing, external memory graph algorithms, compressed suffi x arrays, and the analysis of Lempel-Ziv codes.

Faculty involved in theory of computing and algorithms at Purdue include Mikhail Atallah (p. 15), Saugata Basu, Greg Frederickson, Susanne Hambrusch, Gopal Pandurangan, and Wojciech Szpankowski.


Saugata Basu and Th ierry Zell, “Polynomial Hierarchy, Betti Numbers and a Real Analogue of Toda’s Th eorem”, Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), 2009.

Saugata Basu, “Combinatorial Complexity in O-minimal Geometry”, Proceedings of the London Mathematical Society, An extended abstract appeared in the Proceedings of ACM Symposium on Th eory of Computing (STOC), 2007.

Saugata Basu, “Computing the Top Betti Numbers of Semi-algebraic Sets Defi ned by Quadratic Inequalities in Polynomial Time”, Foundations of Computational Mathematics,Vol 8, 45-80, 2008, Proceedings of ACM Preliminary version appeared in the Proceedings of Symposium on Th eory of Computing (STOC), 2005.

Greg N. Frederickson, “Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees”, SIAM Journal on Computing, Volume 26, pp. 484-538, 1997.

Greg N. Frederickson and Roberto Solis-Oba, “Effi cient algorithms for robustness in resource allocation and scheduling problems”, Th eoretical Computer Science, Volume 352, pp. 250-265, 2006.

Greg N. Frederickson and Barry Wittman, “Approximation algorithms for the traveling repairman and speeding deliveryman problems”, Proceedings, APPROX and RANDOM 2007, LNCS 4627, pp. 119-133, 2007.

Theory of Computing and Algorithms

2323

Greg Frederickson

Susanne Hambrusch

Gopal Pandurangan

Saugata Basu Wojciech Szpankowski

Mohamed Mokbel, Xiaopeng Xiong, Walid Aref, Susanne Hambrusch, Sunil Prabhakar, and Moustafa Hammad, “PLACE: A Query Processor for Handling Real-time Spatio-temporal Data Streams”, Proceedings of the 13th International Conference on Very Large Data Bases (VLDB), pp. 1377-1380, 2004.

S.E. Hambrusch, C.M. Liu, and S. Prabhakar, “Broadcasting and Querying Multi-dimensional Index Trees in a Multi-channel Environment”, Information Systems, Vol. 31, pp 870-886, 2006.

Sarvjeet Singh, Chris Mayfi eld, Sunil Prabhakar, Rahul Shah, and Susanne E. Hambrusch, “Indexing Uncertain Categorical Data”, 23rd IEEE International Conference on Data Engineering (ICDE 2007), 2007.

M. Khan, F. Kuhn, D. Malkhi, G. Pandurangan, and K. Talwar, “Effi cient Distributed Approximation Algorithms via Probabilistic Tree Embeddings”, Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), 2008.

M. Khan and G. Pandurangan, “A Fast Distributed Approximation Algorithm for Minimum Spanning Trees”, Distributed Computing, vol. 20, 2008, 391-402, (Invited paper), 20th International Symposium on Distributed Computing (DISC), 2006.

G. Pandurangan and G. Park, “Analysis of Randomized Protocols for Confl ict-Free Distributed Access”, Algorithmica, Volume 49, No. 2, pp. 109-126, 2007.

M. Drmota and W. Szpankowski, “Precise Minimax Redundancy and Regrets”, IEEE Trans. Information Th eory, 50, 2686-2707, 2004.

P. Flajolet, W. Szpankowski, and B. Vallee, “Hidden Word Statistics”, Journal of the ACM, 53, 1-37, 2006.

M. Koyuturk, Y. Kim, S. Subramaniam, W. Szpankowski, and A. Grama, “Detecting conserved interaction patterns in biological networks”, Journal Computational Biology, 13, 1299-1322, 2006.

2424

Aliaga, DanielDaniel Aliaga. Digital Inspection and Virtual Restoration of 3D Objects. Indiana University School of Medicine. 2008-2009.Daniel Aliaga. Adobe. Adobe. 2008.Xiaohui Carol Song, Jacob R Carlson, Rao Govindaraju, Christoph M. Hoff mann, Devdutta Niyogi, Indrajeet Chaubey, and

Daniel Aliaga. INTEROP: A Community-based Drought Information Network for Multidisciplinary Applications. National Science Foundation. 2008-2011.

Aref, WalidWalid Aref. Microsoft Voluntary Support. Microsoft Corporation. 2008.Mourad Ouzzani, and Walid Aref. III-COR-Small: Collaborative Research: Preference-And Context-Aware Query Processing for

Location-Based Database Servers. National Science Foundation. 2008-2011.Barry Wanner, Walid Aref, Daisuke Kihara, Michael Gribskov, and Xiang Zhang. Development of the www.ecoli-community.org

Information Resource. National Institutes of Health. 2006-2009.

Atallah, Mikhail J.Mikhail J. Atallah. Techniques for Secure and Reliable Computational Outsourcing. Air Force Offi ce of Scientifi c Research. 2009-

2012.Mikhail J. Atallah, and Juline Mills. CT-ISG: Improving the Privacy and Security of Online Survey Data Collection, Storage, and

Processing. National Science Foundation. 2006-2009.

Bertino, ElisaElisa Bertino, Saurabh Bagchi, Khalid Moidu, and Lorenzo Martino. IPS: Security Services for Healthcare Applications. National

Science Foundation. 2007-2010.Elisa Bertino, Christopher Clift on, Ninghui Li, and Eugene Spaff ord. A Framework for Managing the Assured Information

Sharing Lifecycle. University of Maryland Baltimore County. 2008-2013.Elisa Bertino, and Lorenzo Martino. Secure Semantic Information Grid for NCES and Border Security Applications. University

of Texas at Dallas. 2008-2012.Elisa Bertino. REU Supplement: IPS: Security Services for Healthcare Application. National Science Foundation. 2008-2010.Ninghui Li, Elisa Bertino, and Jian Zhang. Utility and Privacy in Data Anonymization. Google Inc.. 2008.Eugene Spaff ord, Elisa Bertino, Ninghui Li, and Dongyan Xu. A Systematic Defensive Framework for Combating Botnets. Offi ce

of Naval Research. 2009-2010.Elisa Bertino. Secure Sensor Semantic Web and Information Fusion Applications. University of Texas at Dallas. 2009-2013.Sonia Fahmy, and Elisa Bertino. CRI Collaborative Research: A Testbed for Research and Development of Secure IP Multimedia

Communication Services. National Science Foundation. 2006-2009.Elisa Bertino. Systematic Control and Management of Data Integrity, Quality and Provenance for Command and Control

Applications. Air Force Offi ce of Scientifi c Research. 2006-2009.Elisa Bertino, and Christopher Clift on. I3P: Assessable Identity and Privacy Protection. Dartmouth College. 2007-2009.

Bhargava, BharatBharat Bhargava. ITR: Scalable Edge Router for Diff erentiated Services Networks. National Science Foundation. 2002-2008.Bharat Bhargava, and Leszek Lilien. Vulnerability Analysis and Th reat Assessment Avoidance. National Science Foundation.

2003-2009.Bharat Bhargava. Collaborative Attacks in Wireless Networks. Homeland Security. 2007-2009.Bharat Bhargava. REU: Vulnerability Analysis and Th reat Assessment/Avoidance. National Science Foundation. 2008-2009.

Research Funding

2525

Clift on, ChristopherElisa Bertino, Christopher Clift on, Ninghui Li, and Eugene Spaff ord. A Framework for Managing the Assured Information

Sharing Lifecycle. University of Maryland Baltimore County. 2008-2013.David Ebert, Christopher Clift on, Mireille Boutin, William Cleveland, Timothy Collins, Edward Delp, Ahmed K. Elmagarmid,

and Mourad Ouzzani. VACCINE: Visual Analytics for Command, Control, Interoperability, National Security and Emergencies. Homeland Security. 2008-2014.

David Ebert, Christopher Clift on, William Cleveland, Timothy Collins, Edward Delp, Ahmed K. Elmagarmid, and Mourad Ouzzani. Purdue University Regional Visualization and Analytics Center. Battelle Memorial Institute. 2006-2009.

Elisa Bertino, and Christopher Clift on. I3P: Assessable Identity and Privacy Protection. Dartmouth College. 2007-2009.David Ebert, Christopher Clift on, William Cleveland, Timothy Collins, Edward Delp, Ahmed K. Elmagarmid, and Mourad

Ouzzani. Purdue University Regional Visualization and Analytics Center. Battelle Memorial Institute. 2008-2008.

Dunsmore, H.E. (Buster)Alka Harriger, Buster Dunsmore, and Kyle Lutes. Surprising Possibilities Imagined & Realized Th rough Information Technology

(SPIRIT) Comprehesive Project for Students and Teachers. National Science Foundation. 2008-2010.

Elmagarmid, Ahmed K.David Ebert, Christopher Clift on, Mireille Boutin, William Cleveland, Timothy Collins, Edward Delp, Ahmed K. Elmagarmid,

and Mourad Ouzzani. VACCINE: Visual Analytics for Command, Control, Interoperability, National Security and Emergencies. Homeland Security. 2008-2014.

Mourad Ouzzani, and Ahmed K. Elmagarmid. III: Small: Commugrate-A Community-based Data Integration System. National Science Foundation. 2009-2012.

Ahmed K. Elmagarmid. Lilly Endowment: A Proposal for the Creation of a New Center in Discovery Park Purdue Cyberinfrastructure Institute PCI. Eli Lilly and Company. 2004-2008.



Eugster, PatrickPatrick Eugster. CAREER: Pervasive Programming with Event Correlation. National Science Foundation. 2007-2011.Patrick Eugster. CSR-PSCE, SM: Memory Management Innovations for Next-Generation SMP. National Science Foundation.

2008-2011.Patrick Eugster, and Xiangyu Zhang. CSR-DMSS, SM: A Holistic Approach to Reliable Persasive Systems. National Science

Foundation. 2008-2011.

Fahmy, SoniaSonia Fahmy. CT-ISG: Collaborative Research: Router Models & Downscaling Tools for Scalable Security Experiments. National

Science Foundation. 2008-2011.Sonia Fahmy. CAREER: Exploiting Tomography in Network-Aware Protocols: Th eory and Practice. National Science

Foundation. 2003-2009.Sonia Fahmy, and Ness Shroff . CT-T Collaborative Research: Protecting TCP Congestion Control: Tools for Design, Analysis, &

Emulation. National Science Foundation. 2005-2009.Sonia Fahmy, and Elisa Bertino. CRI Collaborative Research: A Testbed for Research and Development of Secure IP Multimedia

Communication Services. National Science Foundation. 2006-2009.

2626

Research Funding

Frederickson, GregJan Vitek, Suresh Jagannathan, Ananth Y. Grama, and Greg N. Frederickson. Fellowship Initiative in the Development of the

Next-Generation Embedded Computing Infrastructure (GAANN). Department of Energy. 2009-2012.

Grama, Ananth Y.Ananth Y. Grama. Collaborative Research: EMT/BSSE: Petascale Simulations of DNA Dynamics and Self-Assembly. National

Science Foundation. 2008-2011.Ananth Y. Grama. ITR/ASE/SIM Collaborative Research: DeNovo Hierarchical Simulations of Stress Corrosion Cracking in

Materials. National Science Foundation. 2004-2010.Ahmed Sameh, and Ananth Y. Grama. Collaborative Research: Developing a Robust Parallel Hybrid System Solver. National

Science Foundation. 2006-2010.Ananth Y. Grama. Hierarchical Petascale Simulation Framework for Stress Corosion Cracking- Collaborative with USC.

Department of Energy. 2006-2010.Ananth Y. Grama. Biochemical Pathways Workbench. University of Califormia- San Diego. 2007-2009.Jayathi Murthy, Muhammad A Alam, Anil Kumar Bajaj, Weinong W Chen, Ananth Y. Grama, Dimitrios Peroulis, and Alejandro

H Strachan. PRISM: Center for Prediction of Reliability, Integrity and Survivability of Microsystems. Department of Energy. 2008-2013.

Tony Hosking, Jan Vitek, Suresh Jagannathan, and Ananth Y. Grama. Microsoft : Language and Runtime Support for Safe and Scalable Programs. Microsoft Corporation. 2008.

Wojciech Szpankowski, Ananth Y. Grama, and Daisuke Kihara. Information Transfer in Biological Systems. National Science Foundation. 2008-2012.

Zhiyuan Li, and Ananth Y. Grama. CPA-CPL: Compiler and Soft ware Solutions for the Memory Bottleneck on Multicore. National Science Foundation. 2008-2011.

Ananth Y. Grama. Collaborative Research: EMT/BSSE: Petascale Simulations of DNA Dynamics and Self-Assembly. National Science Foundation. 2008-2011.

Ananth Y. Grama. Collaborative Research: CDI- Type II: Hierarchical Modularity in Evolution and Function. National Science Foundation. 2008-2012.

Suresh Jagannathan, and Ananth Y. Grama. Eager Maps and Lazy Folds for Graph-Structured Applications. National Science Foundation. 2009-2010.

Wojciech Szpankowski, and Ananth Y. Grama. Algebraic, Combinatorial and Probabilistic Methods for Biological Sequences. National Institutes of Health. 2003-2008.

Zhiyuan Li, Ananth Y. Grama, and Ahmed Sameh. AAD: Soft ware Tools for Asynchronous-Algorithm Development. National Science Foundation. 2005-2009.

Jan Vitek, Suresh Jagannathan, Ananth Y. Grama, and Greg N. Frederickson. Fellowship Initiative in the Development of the Next-Generation Embedded Computing Infrastructure (GAANN). Department of Energy. 2009-2012.

Hambrusch, Susanne E.Susanne E. Hambrusch, Mark P Haugan, Christoph M. Hoff mann, Tony Hosking, and Sabre Kais. CPATH CB: Computing

Education in Science Context. National Science Foundation. 2007-2009.Susanne E. Hambrusch. REU Supplement- CPATH CB: Computing Education in Science Context. National Science Foundation.

2008-2009.Susanne E. Hambrusch, and Mark P Haugan. RET: CPATH CB: Computing Education in Science. National Science Foundation.

2009-2010.Susanne E. Hambrusch, Christoph M. Hoff mann, James Lehman, Aman Yadav, John T. Korb, and A. G. Rud. Computer Science

2727

Pathways for Educators. National Science Foundation. 2009-2012.Sunil K. Prabhakar, and Susanne E. Hambrusch. Scalable, Reliable Management of Sensor Information. Air Force Offi ce of

Scientifi c Research. 2006-2008.

Hoff mann, Christoph M.Christoph M. Hoff mann. Northwest Indiana Computational Grid: A joint project at the University of Notre Dame, Purdue

University-West Lafayette and Purdue University-Calumet. Department of Energy. 2006-2009.Susanne E. Hambrusch, Mark P Haugan, Christoph M. Hoff mann, Tony Hosking, and Sabre Kais. CPATH CB: Computing

Education in Science Context. National Science Foundation. 2007-2009.Xiaohui Carol Song, Jacob R Carlson, Rao Govindaraju, Christoph M. Hoff mann, Devdutta Niyogi, Indrajeet Chaubey(sr),

and Daniel Aliaga(sr). INTEROP: A Community-based Drought Information Network for Multidisciplinary Applications. National Science Foundation. 2008-2011.

Christoph M. Hoff mann, and Xavier Tricoche. Intel Gift . Intel Corporation. 2008.William McCartney, John Campbell, Christoph M. Hoff mann, Zhaohui Hong, Ralph Robers, and Douglas Sharp. Northwest

Indiana Computational Grid: A joint project at the University of Notre Dame, Purdue University-West Lafayette and Purdue University-Calumet. Department of Energy. 2008-2011.

Susanne E. Hambrusch, Christoph M. Hoff mann, James Lehman, Aman Yadav, John T. Korb, and A. G. Rud. Computer Science Pathways for Educators. National Science Foundation. 2009-2012.

Karthik Ramani, Sunil K. Prabhakar, and Christoph M. Hoff mann. Exploratory Research in Database Systems Support for Product Lifecycle Management. Eli Lilly and Company. 2006-2008.

Hosking, AntonyTony Hosking. ST-CRTS: Collaborative: Delivering on Atomic Actions: Unlocking Concurrency for Ordinary Programmers.

National Science Foundation. 2006-2010.Tony Hosking. Collaborative Research: REU: ST-CRTS: Delivering on Atomic Actions: Unlocking Concurrency for Ordinary

Programmers. National Science Foundation. 2007-2010.Susanne E. Hambrusch, Mark P Haugan, Christoph M. Hoff mann, Tony Hosking, and Sabre Kais. CPATH CB: Computing

Education in Science Context. National Science Foundation. 2007-2009.Tony Hosking. Scalable Concurrent Compacting Garbage Collection for Commodity Multi-Core Processors. National Science

Foundation. 2007-2010.Tony Hosking. REU Supplement: ST-CRTS: Collaborative: Delivering on Atomic Actions: Unlocking Concurrency for Ordinary

Programmer. National Science Foundation. 2008-2010.Tony Hosking, Jan Vitek, Suresh Jagannathan, and Ananth Y. Grama. Microsoft : Language and Runtime Support for Safe and

Scalable Programs. Microsoft Corporation. 2008.Jan Vitek, and Tony Hosking. CPA-CPL Certifi ed Garbage Collection for Highly Responsive Systems. National Science

Foundation. 2008-2011.Tony Hosking. IBM Eclipse Innovation. IBM. 2003.

Jagannathan, SureshSuresh Jagannathan. Kala: An Effi cient and Scalable Time Travel Infrastructure for Concurrent Systems. National Suresh

Jagannathan. Kala: An Effi cient and Scalable Time Travel Infrastructure for Concurrent Systems. National Science Foundation. 2007-2010.

Tony Hosking, Jan Vitek, Suresh Jagannathan, and Ananth Y. Grama. Microsoft : Language and Runtime Support for Safe and Scalable Programs. Microsoft Corporation. 2008.

Jan Vitek, and Suresh Jagannathan. CPA-SEL-T: Collaborative Research: Unifi ed Open Source Transactional Infrastructure. National Science Foundation. 2008-2011.

Suresh Jagannathan, and Ananth Y. Grama. Eager Maps and Lazy Folds for Graph-Structured Applications. National Science

2828

Research Funding

Foundation. 2009-2010.Jan Vitek, Suresh Jagannathan, Ananth Y. Grama, and Greg N. Frederickson. Fellowship Initiative in the Development of the


Kihara, DaisukeDaisuke Kihara, and Karthik Ramani. Surface Shape Based Screening of Large Protein Databases PHS-NIH NAT INST of

General Medical Science. National Institutes of Health. 2005-2010.Daisuke Kihara. Template-Based Protein Structure Prediction Beyond Sequence Homology. National Science Foundation. 2008-

2012.Wojciech Szpankowski, Ananth Y. Grama, and Daisuke Kihara. Information Transfer in Biological Systems. National Science

Foundation. 2008-2012.Daisuke Kihara. Protein 3D Structure-based rational drug discovery. Purdue Research Foundation. 2009-2010.Barry Wanner, Walid Aref, Daisuke Kihara, Michael Gribskov, and Xiang Zhang. Development of the www.ecoli-community.org

Information Resource. National Institutes of Health. 2006-2009.Daisuke Kihara. Bayesian Models and Monte Carol Strategies in Identifying Protein or DNA Sequence Motifs. National Science

Foundation. 2006-2009.Daisuke Kihara. Computational Proteomics Approaches for Rational Drug Design. Purdue University. 2008-2009.

Kompella, RamanaRamana Kompella. NECO: Architectural Support for Fault Management. National Science Foundation. 2008-2011.Ramana Kompella. REU: NECO: Architectural Support for Fault Management. National Science Foundation. 2009-2010.

Li, NinghuiNinghui Li. CAREER: Access Control Policy Verifi cation Th rough Security Analysis and Insider Th reat Assessment. National

Science Foundation. 2005-2010.Elisa Bertino, Christopher Clift on, Ninghui Li, and Eugene Spaff ord. A Framework for Managing the Assured Information

Sharing Lifecycle. University of Maryland Baltimore County. 2008-2013.Ninghui Li, Elisa Bertino, and Jian Zhang. Utility and Privacy in Data Anonymization. Google Inc. 2008.Eugene Spaff ord, Elisa Bertino, Ninghui Li, and Dongyan Xu. A Systematic Defensive Framework for Combating Botnets. Offi ce

of Naval Research. 2009-2010.

Li, ZhiyuanZhiyuan Li, Saurabh Bagchi, and Yung-Hsiang Lu. CSR/EHS: Resource-Effi cient Monitoring, Diagnosis, and Programming

Support for Reliable Networked Embedded Systems. National Science Foundation. 2005-2010.Zhiyuan Li, Saurabh Bagchi, and Yung-Hsiang Lu. CT-ISG: Compiler-Enabled Adaptive Security Monitoring on Networked

Embedded Systems. National Science Foundation. 2007-2010.Zhiyuan Li. Parametric Compiler Optimization for Multi-Core Architectures. National Science Foundation. 2007-2010.Zhiyuan Li, Lila C Albin, Saurabh Bagchi, and Yung-Hsiang Lu. CRI Planning- A Testbed for Compiler-Supported Scalable Error

Monitoring and Diagnosis for Reliable and Secure Sensor Networks. National Science Foundation. 2008-2011.Zhiyuan Li, and Ananth Y. Grama. CPA-CPL: Compiler and Soft ware Solutions for the Memory Bottleneck on Multicore.

National Science Foundation. 2008-2011.Zhiyuan Li, Ananth Y. Grama, and Ahmed Sameh. AAD: Soft ware Tools for Asynchronous-Algorithm Development. National

Science Foundation. 2005-2009.

2929

Mathur, Aditya P.Aditya P. Mathur. Computational Models to Study Auditory Processing & Learning Disorders in Children. National Science

Foundation. 2008-2009.Aditya P. Mathur, and Luo Si. Development, Deployment & Maintenance of the Indiana Database for University Research

Expertise. Indiana Economic Development Corporation. 2008-2009.

Neville, JenniferJennifer Neville. Fusion and Analysis of Multi-Source Relational Data. Defense Advanced Research Projects Agency. 2008-2010.William Cleveland, Jennifer Neville, and Bowei Xi. Stochastic Control of Multi-Scale Networks: Modeling, Analysis, and

Algorithms. Army Research Offi ce. 2008-2013.Jennifer Neville, Stacey Connaughton, and James Tyler. Machine Learning Techniques to Model the Impact of Relational

Communication on Distributed Team Eff ectiveness. National Science Foundation. 2008-2011.Jennifer Neville. Learning Compositional Simulation Models. Dept of the Air Force - Air Force Research Laboratory. 2007-2011.

Nita-Rotaru, CristinaCristina Nita-Rotaru. CAREER: Scalable, Robust and Secure Group-Oriented Services for Wireless Mesh Networks. National

Science Foundation. 2006-2011.Cristina Nita-Rotaru. REU supplement- Career. National Science Foundation. 2006-2009.Cristina Nita-Rotaru, and Sanjay G Rao. CT-ISG: Towards Trustworthy Peer-to-Peer Overlay Networks. National Science

Foundation. 2007-2010.Cristina Nita-Rotaru. NeTS: Medium: Collaborative Research: Secure Networking Using Network Coding. National Science

Foundation. 2009-2013.Cristina Nita-Rotaru. TC: Small: Collaborative Research: Mathematics of Infection Diff usion in Wirelenss Networks. National

Science Foundation. 2009-2012.Cristina Nita-Rotaru. Double Take Network Security. Ball State University. 2009-2009.

Pandurangan, GopalGopal Pandurangan. Effi cient Distributed Approximation Algorithms. National Science Foundation. 2008-2011.

Park, KihongKihong Park. NeTS: Small: Toward High-performance WLANs: Bridging the Physical Layer Divide. National Science

Foundation. 2009-2012.Kihong Park. Predictable, Scalable Qos Routing for Ad Hoc Wireless Networks Based on Heavy-Tailed Statistics-YEAR 2.

Department of Defense. 2007-2008.

Pothen, AlexAlex Pothen, and Assefaw Gebremedhin. Combinatorial Scientifi c Computing and Petascale Simulations Institute. Department

of Energy. 2008-2012.Alex Pothen, and Assefaw Gebremedhin. Empowering Computational Science and Engineering via Automatic Diff erentiation.

National Science Foundation. 2008-2011.Alex Pothen. Graduate Assistance in Areas of National Need. US Department of Education. 2009-2012.

3030

Research Funding

Prabhakar, Sunil K.Sunil K. Prabhakar. Design and Development of a Data Management System for Uncertain Data. National Science Foundation.

2006-2011.Sunil K. Prabhakar. REU Supplement - Design and Development of a Data Management System for Uncertain Data. National

Science Foundation. 2009-2010.Sunil K. Prabhakar, and Susanne E. Hambrusch. Scalable, Reliable Management of Sensor Information. Air Force Offi ce of

Scientifi c Research. 2006-2008.Bernie Eugel, Rao Govindaraju, Chad Jafvert, Lan Zhao, Sunil K. Prabhakar, Matthew Huber, Gilbert Rochon, Xiaohui Carol

Song, David Ebert, and Devdutta Niyogi. Cyberinfrastructure for End-to-End Environmental Exploration. National Science Foundation. 2006-2009.

Karthik Ramani, Sunil K. Prabhakar, and Christoph M. Hoff mann. Exploratory Research in Database Systems Support for Product Lifecycle Management. Eli Lilly and Company. 2006-2008.

David Ebert, Ed Coyle, Edward Delp, James Goldman, James Krogmeier, Sunil K. Prabhakar, and Anthony Smith. C4ISR Testbed Support for Muscatatuck Urban Warefare. ARINC Engineering Services, LLC. 2007-2008.

Qi, Yuan (Alan)Yuan Qi. Genome-wide Examination of Binding Sites for Transcription Factors Responsible for Prostate Cancer Prevention. Th e

Showalter Trust. 2008-2010.Yuan Qi. Integrating Imaging Phenotypes and Genotypes for Early Detection of AD. Indiana University School of Medicine.

2009-2010.Yuan Qi. Integration of relational learning with abinitio methods for prediction of material propoerties. Purdue Research

Foundation. 2009-2010.

Rego, VernonVernon Rego. CT-ISG: Dynamic Covert Channels: Generation and Detection of Hidden Messages. National Science Foundation.

2007-2010.

Sacks, ElishaElisha P. Sacks. Robust computational geometry for design, manufacturing, and robotics. Purdue University. 2008-2009.

Sameh, AhmedAhmed Sameh, and Ananth Y. Grama. Collaborative Research: Developing a Robust Parallel Hybrid System Solver. National

Science Foundation. 2006-2010.Jayathi Murthy, Muhammad A Alam, Anil Kumar Bajaj, Weinong W Chen, Ananth Y. Grama, Dimitrios Peroulis, and Alejandro

H Strachan. PRISM: Center for Prediction of Reliability, Integrity and Survivability of Microsystems. Department of Energy. 2008-2013.

Ahmed Sameh, and Murat Manguoglu. Towards an Adaptive Library for Solving Large Sparse Linear Systems. Intel Corporation. 2009-2010.

Zhiyuan Li, Ananth Y. Grama, and Ahmed Sameh. AAD: Soft ware Tools for Asynchronous-Algorithm Development. National Science Foundation. 2005-2009.

Si, LuoLuo Si. REU: CAREER: An Integrated and Utility-Centric Framework for Federated Text Search. National Science Foundation.

2008-2009.Luo Si. CAREER: An Integrated and Utility Centric Framework for Federated Text Search. National Science Foundation. 2008-

2013.Yan Ping Xin, and Luo Si. R & D: Nurturing Multiplicative Reasoning in Students with Learning Disabilities in a Computerized

Conceptual-Modeling Environment (NMRSD-CCME). National Science Foundation. 2008-2013.

3131

Luo Si, and Yan Ping Xin. SGER III-CXT: Integrating Computer Science Techniques into Diff erentiated Instruction of Mathematical Word Problem Solving. National Science Foundation. 2007-2009.

Aditya P. Mathur, and Luo Si. Development, Deployment & Maintenance of the Indiana Database for University Research Expertise. Indiana Economic Development Corporation. 2008-2009.

Luo Si. Intelligent Information Extraction from Financial Documents. Barclays Global Investors. 2009-2009.

Skeel, RobertRobert Skeel, and Carol Post. Transition Pathways for Biomolecular Systems: Th eory and Computation. National Institutes of

Health. 2007-2011.Robert Skeel. Collaborative Research: Laplacian-Centered Poisson Solvers and Multilevel Summation Algorithms. National

Science Foundation. 2008-2011.Robert Skeel. IMA Th ematic Year on Mathematics and Chemistry: Computational Methods. University of Minnesota. 2009-

2009.Robert Skeel. Collaborative Research: Scalable Algorithms for Generalized Poisson Equations with Point Charge Source Terms.

National Science Foundation. 2007-2010.

Spaff ord, Eugene H.Eugene Spaff ord. SEED: Developing Instructional Laboratories for Computer Security Information. National Science

Foundation. 2006-2010.Eugene Spaff ord. Collaborative Research: Transparency and Legal Compliance in Soft ware Systems. National Science

Foundation. 2007-2009.Elisa Bertino, Christopher Clift on, Ninghui Li, and Eugene Spaff ord. A Framework for Managing the Assured Information

Sharing Lifecycle. University of Maryland Baltimore County. 2008-2013.Eugene Spaff ord, Pascal Meunier, and Keith Watson. A High-Assurance, High Capacity Platform for Information Operations.

Lockheed Martin. 2008-2010.Eugene Spaff ord, Elisa Bertino, Ninghui Li, and Dongyan Xu. A Systematic Defensive Framework for Combating Botnets. Offi ce

of Naval Research. 2009-2010.Eugene Spaff ord. Completion of SFS Plan of Study. National Science Foundation. 2009-2010.Eugene Spaff ord. A Dual-Track Masters Degree Program for Infosec Specialists. National Science Foundation. 2001-2009.Eugene Spaff ord. CT-ISG: Designing Next-Generation Reliable Internet Servers. National Science Foundation. 2005-2009.Eugene Spaff ord, Timothy Collins, and Fariborz Farahmand. Assessing Risk of Insider Th reats to Information Systems.

Dartmouth College. 2007-2009.Eugene Spaff ord. Cyber Security Collaboration and Information Sharing. Th e Institute for Information Infrastructure Protection

(I3P) Research Fellowship. 2007-2009.Dongyan Xu, and Eugene Spaff ord. Process Coloring: An Information Flow-Preserving Approach to Malware Investigation.

IARPA/Air Force Research Laboratory. 2007-2009.Dongyan Xu, and Eugene Spaff ord. Process Coloring Collaboration for System Security. Southwest Research Institute. 2009-

2010.Eugene Spaff ord. Emerging Research in Responding to Cyber Attacks. Lockheed Martin. 2009-2009.

Szpankowski, WojciechWojciech Szpankowski. Asymptotic Solutions To Some Functional Equations Arising in Computer Science. National Security

Agency. 2008-2010.Wojciech Szpankowski, Ananth Y. Grama, and Daisuke Kihara. Information Transfer in Biological Systems. National Science

Foundation. 2008-2012.Wojciech Szpankowski. Collaborative Proposal: Information Th eory of Data Structures. National Science Foundation. 2008-

2011.

3232

Research Funding

Wojciech Szpankowski, and Ananth Y. Grama. Algebraic, Combinatorial and Probabilistic Methods for Biological Sequences. National Institutes of Health. 2003-2008.

Wojciech Szpankowski. Crossroads of Information Th eory and Computer Science: Analytic Algorithmics, Combinatorics, and Information Th eory. National Science Foundation. 2005-2009.

Wojciech Szpankowski. Collaborative Research: Nonlinear Equations Arising in Information Th eory & Computer Sciences. National Science Foundation. 2005-2009.

Tricoche, XavierChristoph M. Hoff mann, and Xavier Tricoche. Intel Gift . Intel Corporation. 2008.

Vitek, JanJan Vitek, and Pascal Meunier. Develpoment of a Safe, Virtual Imaging Instrument for Logically Destructive Experiments.

National Science Foundation. 2004-2010.Jan Vitek. EHS: High-throughput Real-time Stream Processing in Java. National Science Foundation. 2007-2010.Tony Hosking, Jan Vitek, Suresh Jagannathan, and Ananth Y. Grama. Microsoft : Language and Runtime Support for Safe and

Scalable Programs. Microsoft Corporation. 2008.Jan Vitek, and Tony Hosking. CPA-CPL Certifi ed Garbage Collection for Highly Responsive Systems. National Science

Foundation. 2008-2011.Jan Vitek, and Suresh Jagannathan. CPA-SEL-T: Collaborative Research: Unifi ed Open Source Transactional Infrastructure.

National Science Foundation. 2008-2011.Jan Vitek. SHF: Small: Collaborative Research: Verifying and Validating Safety Critical Java. National Science Foundation. 2009-

2012.Jan Vitek. 2008 Trends in Currency Summer School. Microsoft Corporation. 2007.Jan Vitek. Purdue International Summer School Award. Intel Corporation. 2007.Jan Vitek. Trends in Concurrency Summer School. IBM. 2008.Jan Vitek. A Computational Model for High-Assurance Dynamic Information Systems. Offi ce of Naval Research. 2009-2009.Jan Vitek, Suresh Jagannathan, Ananth Y. Grama, and Greg N. Frederickson. Fellowship Initiative in the Development of the


Vitek, OlgaOlga Vitek. Taking quantitative LC-MS profi ling of blood samples in cardiovascular disease to a clinically relevant scale a

computational & statistical approach. Purdue University - Indiana Univeristy. 2007-2009.Olga Vitek. A Hypthesis Testhing Approach to Identifi cation and Assessment of Statistical Signifi cance of Peptides and Proteins

in Shotgun Proteomics. Purdue University - Indiana Univeristy. 2007-2009.Olga Vitek. CPATH CB: Computing Education in Science Context. National Science Foundation. 2007-2009.Olga Vitek. Interfacing Biological Knowledge and Statistical Analysis for Rapid Interpretation of Clinical Proteomics

Experiements. Indiana University School of Medicine. 2008-2009.Olga Vitek. Statistical Analysis of Serum Proteomics Profi les for Subjects with Osteosarcoma. Indiana University School of

Medicine. 2008-2009.

3333

Xu, DongyanDongyan Xu. MICROSOFT: Cybersecurity: Malware Research. Microsoft Corporation. 2005.Dongyan Xu. Cybersecurity: On Client-Side honeyfarm. Microsoft Corporation. 2005.Dongyan Xu. CAREER: Towards Virtual Distributed Environments in a shared Distributed Infrastructure. National Science

Foundation. 2006-2011.Dongyan Xu. MICROSOFT: Virtualization-enabled Malware Defense. Microsoft Corporation. 2007.Dongyan Xu. CSR-EHS: Collaborative Research: H-Media: Th e Holistic-Multistream Environment for Distributed Immersive

Applications. National Science Foundation. 2007-2011.Dongyan Xu. CT: ISG: Collaborative Proposal: Enabling Detection of Elusive Malware by Going Out of the Box with

Semanticaly Reconstructed View (OBSERV). National Science Foundation. 2007-2010.Michael McLennan, Gerhard Klimeck, and Dongyan Xu. SDCI NMI Improvement: nanoHUB Middleware. National Science

Foundation. 2007-2010.Gerhard Klimeck, Th omas Hacker, and Dongyan Xu. Accelerating Nano-Scale Transistor Innovation Th ough Petascale

Simulation. National Science Foundation. 2007-2011.Eugene Spaff ord, Elisa Bertino, Ninghui Li, and Dongyan Xu. A Systematic Defensive Framework for Combating Botnets. Offi ce

of Naval Research. 2009-2010.Dongyan Xu, Sebastien Goasguen, and Gerhard Klimeck. NMI Deployment (ENG): nanoHub. National Science Foundation.

2004-2008.Dongyan Xu, and Eugene Spaff ord. Process Coloring: An Information Flow-Preserving Approach to Malware Investigation.

IARPA/Air Force Research Laboratory. 2007-2009.Dongyan Xu, and Eugene Spaff ord. Process Coloring Collaboration for System Security. Southwest Research Institute. 2009-

2010.

Yau, DavidDavid Yau. Robust Multiple Radiation Source Localization. Oak Ridge National Laboratory. 2009-2010.David Yau. Collaborative Research: A Component-based Soft ware Environment for Simulation, Emulation, and Synthesis of

Network Protocols in Next Generation Networks. National Science Foundation. 2004-2009.David Yau. System Support for Detection, Identifi cation, and Tracking Tasks in Sensor-Cyber Networks. Oak Ridge National

Laboratory. 2006-2009.

Zhang, XiangyuXiangyu Zhang. Collaborative Research: CRI: IAD An Advanced Infrastructure for Generation, Storage, and Analysis of

Program Execution Traces. National Science Foundation. 2007-2009.Patrick Eugster, and Xiangyu Zhang. CSR-DMSS, SM: A Holistic Approach to Reliable Persasive Systems. National Science

Foundation. 2008-2011.Xiangyu Zhang. CAREER: Scalable Dynamic Program Reasoning. National Science Foundation. 2009-2014.Xiangyu Zhang. CSR-AES-RCS: Collaborative: Scalable and Effi cient Dynamic Information Flow Tracking in Multithreaded

Programs. National Science Foundation. 2007-2009.

3434

Research Highlights

First Open-source Safety-Critical Java ImplementationSignaling systems on trains, avionics control systems, medical instrumen-tation, and space applications are all safety-critical systems. System failuresor malfunctions can result in death or serious injury to people, or loss or severe damage to equipment. For those reasons, safety-critical applicationsrequire an exceedingly rigorous development, validation, and certifi cation process.

Th e Purdue Open SCJ team under the direction of Professor Jan Vitek provides the fi rst open-source Java implementation suitable for the domain of safety-critical soft ware systems.

Soft ware reliability is a major issue for real-time systems, many of which are safety critical. Java brings a plethora of modern language features that make soft ware engineering more cost-eff ective and safe, and it is thus an appealing platform for safety-critical applications.

Th e JSR-302 expert group was formed to defi ne a new standard -- the Safety-Critical Java (SCJ) Specifi cation. Purdue’s Open SCJ team is heavily involved in the standardization process. An open source implementation of the standard is being developed at Purdue. Th e goals of the Open SCJ project are: develop a SCJ virtual machine, develop a technology compatibility kit for compliance testing of implementations, create benchmarks for evaluating performance, and develop a static checker.

Safety-Critical JavaTh e driving design principles in SCJ Specifi cation are reduction of system complexity and cost of certifi cation.

An SCJ compliant application will consist of one or more missions, where a mission consists of a bounded set of periodic event handlers. Th e thread model is largely restricted to periodic and asynchronous event handlers to simplify the schedulability analysis. Th e concept of missions and sub-missions leveraged to higher levels reintroduces dynamic features of the real-time Java in a safer form. For each mission, a dedicated block of memory is identifi ed as the mission memory. A set of scoped memories with restricted hierarchy can be used for each schedulable object. Heap memory is not allowed. Th e simple motivation for this restricted memory model is to allow static analysis of the memory usage.

Th e complexity of safety-critical soft ware varies greatly, therefore, SCJ defi nes three compliance levels to which both implementations and applications may conform. Level 0 provides a simple cyclic executive model which is single threaded and restricts the use of scoped memory. Level 1 extends this model with support for multi-threading with asynchronous event handlers and a fi xed-priority preemptive scheduler. Level 2 lift s all restrictions on threads and supports nested missions. All levels limit the use of refl ection to safe patterns and prohibit dynamic loading and heap allocation. Th e compliance levels enable construction of variously complex and multi-model safety-critical systems, reducing thus the cost of their implementation and certifi cation.

3535

Safety-Critical Virtual Machine Development of an SCJ compliant infrastructure is a non-trivial task that comprises several challenges. Safety-critical soft ware runs on top of a compact SCJ library supporting Level 0-2 compliant applications. Th e library itself is communicating closely with a dedicated Virtual Machine constructed to eff ectively support application execution. Finally, the VM itself runs on top of a real-time operating system - Fig. 1.

Th e most challenging part of the oSCJ project represents development of a Virtual Machine compatible with the specifi cation. Th e team currently develops a new VM based on Purdue’s successful OVM. Furthermore, SCJ extensions for industrial FijiVM are being developed in collaboration with Fiji Systems LLC. Both VMs allow safety-critical experts to confi gure the infrastructure to the operational requirements of a particular mission, while emphasizing the performance of the resulting system. To optimize the performance, SCJ code is compiled to C.

Th e target hardware platform for oSCJ project is Xilinx FPGA board running RTEMS/LEON3. Th e board is used both by NASA and ESA to execute satellite’s on-board soft ware (Venus Express Mission 2005, Dawn Mission 2007) and provides a unique platform for extensive benchmarking and evaluation of the oSCJ project.

Current Status As soon as the certifying authorities accept JVMs that implement SCJ, the use of Java will lead to higher productivity in the development of safety-critical applications. Th e Purdue oSCJ project is on the way to be thus the fi rst open-source implementation in the fi eld. Currently, the oSCJ project already provides the technology compatibility kit and the static checker. Recent eff orts are focused on the development of a VM supporting Level 0 compliant applications. Th e Level 0 compliance brings a simplifi ed computation model that enables high optimization of the whole infrastructure, achieving a minimal footprint and a performance that is comparable even to C programs. Th e fi rst release of oSCJ VM is planned for 2010. For more information visit http://sss.cs.purdue.edu/projects/oscj/.

Publications[1] Java for Safety-Critical Applications, Hunt, Locke, Nilsen, Schoeberl,Vitek, SAFECERT 2009.[2] A Technology Compatibility Kit for Safety Critical Java. Zhao,Tang,Vitek. JTRES 2009.[3] Challenge Benchmarks for Verifi cation of Real-Time Programs, Vitek,Kalibera,Parizek,Leavens, Haddad. PLPV 2010.

Fig. 1: Safety-Critical Java Infrastructure.

3636

Research Highlights

Mining Social Network DataTh ere has been an explosive growth in the use of the Web and online communities in the past decade. Th is has lead to increased interest in mining the resulting social network data---both to advance understanding of human behavior and to exploit the underlying social processes for decision-making (e.g., marketing).

In these network domains, the relationships are a critical source of information that identifi es potential statistical dependencies among individuals. Th e dependencies present an opportunity to improve predictions about the properties of individuals, as birds of a feather do indeed fl ock together. For example, when deciding how to market a product to people in MySpace or Facebook, it may be helpful to consider whether a person’s friends are likely to purchase the product. Th e recent research of Professor Jennifer Neville’s research group has focused on three open problems in social network mining: inferring the network structure, distinguishing between social eff ects, and adjusting statistical techniques to account for network dependencies.

Network InferenceSmall-scale, manually-collected social networks are generally sparse, but the links refl ect strong relationships (due to the targeted survey process). On the other hand, large-scale, electronically-collected social networks are generally more dense and contain substantially more noise. Th is is due to the construction of the networks from transactional data (e.g., email, phone calls) and the low-cost of friendship identifi cation (e.g., in online social networks). In both cases, the constructed networks contain both strong and weak ties with little or no information to diff erentiate between the two.

To identify infl uential relationships and prune away spurious links, Neville and her team have developed automated methods to infer relationship strength (e.g., strong vs. weak) from social activity patterns. First the group developed a method to diff erentiate strong and weak ties by formulating a binary learning task and using friendships that were tagged “Top Friends” as examples of strong friendships for training [1]. Next the group developed a richer model to represent the full spectrum of relationship strength, from weak to strong [4]. Th e approach uses a latent variable model that attempts to represent the intrinsic causality of social interactions by considering the relationship strength to be the hidden eff ect of user profi le similarities, as well as the hidden cause of the observed interactions between users. Experiments show that a weighted graph based on estimated relationship strengths produces higher levels of network correlation, and consequently results in better classifi cation performance, than graphs formed from various aspects of the raw data, including the binary “Top Friend” network.

Distinguishing Causal Eff ects A key question for understanding and exploiting behavior in network domains is to determine the root cause of observed relational correlation. If social infl uence eff ects are present in the data, individuals are likely to change their attributes (e.g., behavior, traits) to conform to their neighbors’ values. If homophily eff ects are present in the data, individuals are likely to link to other individuals with similar attribute values. Both these eff ects will result in network-correlated attribute values. However, when analyzing static relational networks it is impossible to determine how much of the observed correlation is due to each of these factors.

Figure 1: Heatmap of estimated link strengths for the Purdue ‘11 Facebook network based on wall communication transactions.

3737

Th e work performed by Neville’s group takes into consideration temporal networks where the attributes and links change over time---two time steps are used to measure the temporal gain in correlation and then attempt to assess whether a signifi cant portion of this gain is due to infl uence and/or homophily. To do this, Neville and her team formulated a new randomization method that perturbs the data in a constrained fashion---by randomizing the sets of choices (e.g., adding a link, changing an attribute value) made at a given time step [2]. Th e method destroys any association of the actions at time t with the similarity of target individual (for link changes) or friends’ attribute values (for attribute changes), while keeping the remainder of the relational structure intact. Preliminary analysis of the Purdue Facebook data using this method indicates that network-correlation in group memberships is due to varying eff ects of infl uence and homophily, with some groups exhibiting signifi cantly more homophily (e.g., Boiler Gold Rush) and some groups exhibiting signifi cantly more infl uence (e.g., Habitat for Humanity).

Accurate Methodology A central methodological question in machine learning research is how to accurately compare two learning algorithms and assess whether the observed performance diff erence is signifi cant. Neville and her collaborators have investigated this issue in the context of collective classifi cation in networks, where there are dependencies among both the labeled (training) and unlabeled (test) instances. Th ese dependencies can complicate the direct application of conventional statistical tests, which assume independent samples.

Neville’s group empirically explored several potential sources of bias due to network dependencies and showed surprisingly that a commonly-used form of evaluation can result in unacceptably high levels of Type I error - i.e., in as many as 50% of the cases, observed algorithm diff erence is incorrectly determined to be signifi cant when it is not [3]. Based on a theoretical analysis of how the dependencies in network data can lead to increased Type I error, which shows that the bias is due to a systematic underestimation of variance, they have proposed an analytical correction to the estimated variance which can be used to reduce the Type I error rates to more acceptable levels. Th ey have evaluated the correction on both synthetic and real world data, with simulated and real classifi ers, showing that the test successfully adjusts for the bias, without compromising statistical power.

References[1] I. Kahanda and J. Neville, “Using transactional information to predict link strength in online social networks”, In Proceedings of the AAAI International Conference on Weblogs and Social Media, 2009.[2] T. LaFond and J. Neville, “Randomization tests for distinguishing social inuence and homophily eff ects”, In Proceedings of the International World Wide Web Conference (WWW), 2010.[3] J. Neville, B. Gallagher, and T. Eliassi-Rad, “Evaluating statistical tests for within-network classiffi ers of relational data”, In Proceedings of the 9th IEEE International Conference on Data Mining, 2009.[4] R. Xiang, J. Neville, and M. Rogati, “Modeling relationship strength in online social networks”, In Proceedings of the International World Wide Web Conference (WWW), 2010.

Figure 2: Collective classifi cation task illustrated on the Purdue ‘11 Facebook network, where edges represent friends with more than 10 wall transactions. Node colors represent political views: pink=conservative, yellow=liberal, cyan=unknown (to be predicted).

3838

Research Highlights

Urban Modeling and VisualizationProfessor Daniel Aliaga and his students created a method to infer cities from image and socioeconomic data. In fi gure a-c), the parameters and terminals for a building grammar are deduced from ground-level photographs. In fi gure d), Aliaga developed a method to simultaneously perform structure-based and image-based synthesis to generate a new urban layout from example urban fragments. In fi gures e-f) Aliaga and his team craft ed a pioneering method that is able to produce a plausible approximation of an actual city based solely on coarse behavioral and geometrical metadata. Zoomed areas show how the synthetically created areas (right) are similar to the aerial photographs of the actual city (left ).

Th e objective of this multi-disciplinary project is to design digital models of urban structures in order to enable simulating physical phenomena and human activities in city-size environments as well as to support visualizing and rendering urban environments. Th e created models can be used to understand the behavior of the underlying environment in several scenarios such as earthquakes, crashes, and explosions, to guide urban development plans supporting effi cient population growth and emergency response, and to create content for entertainment and simulations. While 3D models of cities have been made using custom-written grammars and urban environments have been simulated, the eff orts require either signifi cant manual intervention to control the geometric modeling process or produce only very coarse geometry (e.g., colored grid cells, potentially overlaid on maps). Aliaga originated the creation of several systems ranging from single-building applications to multi-city applications which have culminated with using behavioral and geometrical simulations in a single framework (see fi gure).

3939

Genuinity SignaturesProfessors Daniel Aliaga and Mikhail Atallah address the problem of marking physical object against counterfeiting and tampering. Using an algorithm the team developed, the user designs a unique “genuinity signature” and encodes it into a subset of a 3D synthetic model (fi gures a, d). Th e physical object is built using automated digital manufacturing (fi gures b, e). An automated system determines if the object is genuine or is an imitation (even if manufactured using higher accuracy than the genuine) (fi gures c, f).

Th e goal of the project is to create a science for embedding information in physical objects whose manufacturing process is inherently imprecise. Th e researchers investigate a specifi c problem of signifi cant economic importance: thwarting counterfeiting, and the related problem of physical tamper-detection. Counterfeiting is a growing economic problem that has been called the “crime of the century” by a recent manufacturing industry report, and its cost is rapidly escalating (its yearly cost to the automotive industry alone is in the tens of billions of dollars and the loss of about 250,000 U.S. jobs for the legitimate manufacturers). In terms of scientifi c impact, the project will launch a signifi cant new fi eld: While the marking of digital objects is a well-explored area, the creation of algorithms for placing marks in physical objects is mostly unexplored territory. In terms of industrial impact, the project also has excellent potential for profoundly improving the current “state of the practice”, which is all too easily defeated by sophisticated counterfeiters. Th is is because the framework of the project assumes an adversary with powerful capabilities, such as greater manufacturing prowess than the legitimate manufacturer, and full knowledge of the algorithms used to embed marks and to read marks (i.e., no “security through obscurity”). Th e only assumption within the work is the adversary does not know a secret key used to embed the mark. Th e research focuses on the development of the computational algorithms necessary to resolve several diffi cult issues and tradeoff s about what information to embed in the object, and where/how to embed it. A solution must not increase manufacturing cost and must be usable with the current manufacturing pipeline. Th e approach is inherently multidisciplinary, combining information hiding, computer vision/graphics, and robust algorithms. Hence, students in the project will also acquire a unique combination of skills.

In preliminary work, Aliaga and Atallah have demonstrated a prototype of the method. Th ey designed several objects, encoded a genuinity signature, either digitally manufactured the object using 3D printing facilities or using simulation, and then captured and verifi ed genuinity (see fi gure). Th e signature is composed of a set of random yet smoothly varying surface displacements that, under user control, is applied to the signature’s footprint on the object (i.e., a subset of or the entirety of the object’s surface). Even if the adversary has technology superior to the legitimate manufacturer, a counterfeit copy of the physical copy can be reliably distinguished from the original.

4040

Research Highlights

Find what you are looking for on the WebPurdue experts in information retrieval and machine learning are developing advances in Federated Search and Expertise Search tech-nology in order to make Web searching more useful.

Federated SearchProfessor Luo Si is enhancing Federated Search technology with his research supported by the National Science Foundation. Federated search provides an integrated access to information on the Web or in an Intranet that is hidden from conventional search engines. Previous study estimated the size of hidden Web to be several times larger than the conventional visible Web (e.g., html, doc, pdf, etc). Th e hidden information is valuable because it contains important intellectual properties and is generally maintained by domain experts. Business 2.0 (October, 2005) listed hidden/deep Web search among seven technologies that change everything.

Research at Purdue addresses the three main research problems within federated search: resource representation, resource selection and results merging. Purdue Computer Science advances the state-of-art in resource selection by learning from merged results of selected resources for past queries. To provide better trade-off between eff ectiveness and effi ciency, Si and his students propose a regression-based results merging algorithm for merging documents from multilingual resources.

Information resources in federated search environments may not be willing to disclose the contents of documents or the source identities. For example, privacy-preserved federated similarity search solutions need to be developed for detecting plagiarized documents between two conferences, where submissions are confi dential. Th e collaboration work between Prof. Chris Clift on and Prof. Luo Si designs new privacy-preserved protocols to achieve the goal.

Expertise SearchTraditional search engines such as Google or Bing return documents (Web pages) for a user query. However, users are oft en interested in specifi c types of entities (e.g., experts) rather than whole documents. For example, conference organizers need to locate the program committee members based on their research expertise to assign submissions, or researchers need to identify collaborators in specifi c research areas.

Professors Luo Si and Aditya Mathur have developed the Indiana Database of University Research Expertise (INDURE) to search over 17,000 faculty members in four major universities in Indiana to provide the expertise information needed in the research community. Th is work, supported by the State of Indiana and Purdue University, focuses on applying diff erent formal learning techniques in expertise search to integrate the supporting evidence of experts form heterogeneous types of sources such as homepages, supervised dissertations, research grants, publications, etc.

Si, Mathur and students propose a novel mixture model framework based on discriminative learning to adapt the combination strategy for diff erent types of queries and experts, which outperforms existing algorithms. Th ey also developed a new unifi ed probabilistic model to automatically identify faculty homepages by analyzing the information within candidate homepages of individual faculty members as well as dependencies (e.g., links) among the candidate pages.

4141

Courtesy andEmeritus Faculty

Courtesy Faculty

Shreeram Abhyankar, Mathematics David Anderson, Engineering Saurabh Bagchi, Electrical and Computer Engineering Alok Chaturvedi, Management William Cleveland, Statistics Melissa Dark, Technology David Ebert, Electrical and Computer Engineering Michael Gribskov, Biology Y. Charlie Hu, Electrical and Computer Engineering Sabre Kais, Chemistry Guy Lebanan, Statistics Yung-Hsiang Lu, Electrical and Computer Engineering Victor Raskin, English and LinguisticsJeff Siskind, Electrical and Computer Engineering T. N. Vijaykumar, Electrical and Computer Engineering

Emeritus Faculty

Walter GautschiElias Houstis Robert Lynch John Rice John Steele

4242

Education

PhD Graduates

December 2008

HyoJeong KimMemory Balancing for Large-scale Network Simulation in Power-law NetworksAdvisor: Kihong ParkEmployer: Cisco Systems; San Jose, California

Mehmet Ercan NergizAnonymization-based Privacy ProtectionAdvisor: Christopher W. Clift onEmployer: Sabanci University; Istanbul, Turkey

Barry WittmanApproximation Algorithms for Time-Constrained Vehicle Routing ProblemsAdvisor: Greg N. FredericksonEmployer: Purdue University; West Lafayette, Indiana

Yu YangProbabilistic Path Planning with Extended Local PlannersAdvisor: Elisha P. SacksEmployer: not reported

May 2009

Murat ManguogluParallel Hybrid Sparse System SolversAdvisors: Ahmed H. Sameh and Ananth Y. GramaEmployer: Purdue University; West Lafayette, Indiana

Sarvjeet SinghDatabase Support for Uncertain DataAdvisor: Sunil K. PrabhakarEmployer: Google

Qihua WangAccess Control Policy ManagementAdvisor: Ninghui LiEmployer: IBM; San Jose, California

August 2009

Rimma NehmeEffi cient Query Processing for Rich and Diverse Real-Time DataAdvisors: Elisa Bertino and Elke A. RundensteinerEmployer: Microsoft Jim Gray Systems Lab; Madison, Wisconsin

Ryan RileyArchitectural Approaches for Code Injection Defense at the User and Kernal LevelsAdvisors: Dongyan Xu and Xuxian JiangEmployer: Qatar University; Qatar

4343

Graduate LecturerCarl Christian Kjelgaard Mikkelsen

Graduate Teaching AssistantsShehzad AfzalNathan Robert AndryscoPelin AnginMehdi AzarmiSamer Samir BarakatAhmet BugdayciYi-Liu ChaoHong ChenJren-Chit ChinMeghana Vasant ChitaleYoun Sun ChoYong Wook ChoiWilliam John CulhaneChenyun DaiVasil Stefanov DenchevJing DongDerek Mark DrakeMohamed Ahmed Yassin El TabakhHazem Diaa Eldin ElmeleegyHicham Galal ElmonguiMohamed Raouf FouadAshish GandheCamille GaspardHwan Jo HeoNwokedi Chimezie IdikaFredrick Prashanth John BerchmansJayaram Kallapalayam RadhaKarthik Shashank KambatlaJin Ryong KimHongbin KuangBin LiLixia LiuYu Tak MaZiqing MaoFadi Raafat Rizk Edward MeawadHarrison Daniel Ford MetzgerMohamed Yoosuf Mohamed NabeelArmand NavabiQun NiSrinivas PasupuletiSalman PervezRyan Michael PhelpsFilip Jerzy Pizlo

Zachary Alan PlovanicYinian QiRaghavendrapras RaghunathprasadFang-Yu RaoGregor RichardsPhilip Carson RitcheyJeff rey Cecil SeibertJacqueline Lois SoennekerWilliam Nicholas SumnerDaniel TangJacques Daniel Th omasTion A. Th omasSerkan UzunbazVivek VijaykumarCheng WangDasarath WeeratungeBarry Joseph WittmanTyler Robert Riehle Wykoff Suli XiRongjing XiangDi XieBin XinYu Hong YeungHao YuanYu ZhangYunhui ZhengYao ZhuZhen Zhu

Graduate Research AssistantsAhmed Hamdy Ibrahim Abdel-GawadBara Mohammad AbusalahAthul Karinja AcharyaNesreen Kamel AhmedHasan Metin AktulgaSalman Rehmat Al-AnsariPelin AnginMehdi AzarmiSahan Sajeewa Bamunavita GamageTao BaoSamer Samir BarakatAhmet BugdayciSuleyman CetintasYi-Liu ChaoHong ChenJren-Chit ChinMeghana Vasant Chitale

4444

Education

Johan Lars Henrik OstlundJayesh PandeySalman PervezRyan Michael PhelpsFilip Jerzy PizloZachary Alan PlovanicPawan PrakashVijendra Singh PurohitWahbeh Hanna QardajiYinian QiCal Francis RabangRaghavendrapras RaghunathprasadVarun RamachandranJunghwan RheeGregor RichardsRyan Denver RileyPhilip Carson RitcheyPaul Andrew RosenBrent Gregory RothJeff rey Cecil SeibertNing ShangHuanyu ShaoAmr Yehia Mohamed ShehabJuanfang ShenYasin Nilton SilvaYingchong SituVarun SoundararajanDannie Michael StanleySvetlana Olegovna StepchenkovaKevin J. Steuer, Jr.William Nicholas SumnerVinaitheerthan SundaramDaniel TangJacques Daniel Th omasJohn A. ValkoCarlos Andres VanegasMan WangQihua WangDasarath WeeratungeJungha WooYu-Sung WuSuli XiBin XinChao XuYi XuMohamed Ahmed Mohamed Ahmed

YakoutWei-Min YaoYu Hong Yeung

Yong Wook ChoiJohannes Jacobus CilliersChenyun DaiJing DongMohamed Ahmed Yassin El TabakhHoda Mohamed EldardiryHicham Galal ElmonguiYi FangBrandon Gregory HillKevin John Hoff manMin HuangRohit JainChamikara Madhusanka JayalathIndika Madawa KahandaJayaram Kallapalayam RadhaKarthik Shashank KambatlaAshish KamraArdalan Kangarlou-HaghighiAnkur KhetrapalRavish KhoslaMichael Scott KirkpatrickSivaramakrishnan Krishnamoorthy

ChandrasekaranAshish KunduTimothy M. La FondAlvin Jon-Hang LawMyungjin LeeSeul Ki LeeBin LiTiancheng LiZhiqiang LinLixia LiuMurat ManguogluZiqing MaoChristopher Scott Mayfi eldMichael McFailPhilip McGacheyCarl Christian Kjelgaard MikkelsenSagar MittalGaspar Octavio Modelo-HowardIan Michael MolloyMummoorthy MurugesanKarthik Swaminathan NagarajArmand NavabiRimma Vladimirovna NehmeAhmet Erhan NergizQun NiDeepak Rajshekhar Nuli

4545

Lian YuDavid John ZageDan ZhangYu ZhangLei ZhaoPengxuan ZhengYunhui ZhengLukasz Ziarek

FellowsAnna ArsenievaNguyen Duc CaoMichael Tyrone CarterNan DingJuan Manuel Esquivel RodriguezYouhan FangSriharsha GangamChristopher Stanley GatesAditi GuptaAdnan HassanPhillip L. Hayes, Jr.Dung Trung HongDunxu HuWassim Ghassan ItaniSolyda KimAlicia Marie KlinvexSebastian Ignacio Moreno ArayaJulie Elizabeth MorrisMaxim NaumovRimma Vladimirovna NehmeLong Van Nguyen DinhWilliam D. Pfeifer, Jr.Khang An PhamSarvjeet SinghQihua WangGregory Aaron WilkinYi XuLukasz Ziarek

46

Engagement

2008 Computer Science Outstanding AlumniTh e College of Science honored 2008 Computer Science Outstanding Alumni Award recipients, “Phillip” Ke-Hsiung Chung, James Clamons, and Vincent DeGiulio, on Friday, September 5, 2008. Recipients of this award have shown exceptional professional achievements and great success in advancing world technology during their career. In celebration of this honor Chung, Clamons, and DeGiulio visited Purdue for the awards presentation. CS Department Head, Aditya Mathur introduced the CS Outstanding Alumni to faculty, students, and staff then presented them with engraved awards.

“Phillip” Ke-Hsiung Chung (PhD: CS, 1993) of Taipei, Taiwan, is a retired Army Major General for Taiwan and vice president for MiTAC International Corp., an electronics and computer company based in Taiwan. James Clamons (BS: Math, 1975)(MS: CS, 1977) is vice president of engineering for the government communication systems division of the Harris Corporation in Melbourne, Florida. Vincent DeGiulio (BS: CS, 1987) of Chicago, is a senior executive at Accenture, one of the world’s largest technology services fi rms. He is part of Accenture’s systems integration practice specializing in delivering large-scale, custom technology solutions to clients.

2009 Computer Science Distinguished AlumnusTh e College of Science recognized Dr. Stuart Zweben as the 2009 Computer Science Distinguished Alumni recipient on April 17, 2009. Dr. Stuart Zweben received his MS in Statistics in 1971 and his PhD in Computer Science in 1974, both from Purdue University. He is currently a Professor of Computer Science and Engineering at the Ohio State University. He chaired the department he is in from 1994-2005, and served as Associate Dean for Academic Aff airs and Administration in the College of Engineering at Ohio State. Zweben is a fellow and former president of ACM (Th e Association for Computing Machinery), a fellow and former president of Th e Computing Sciences Accreditation Board (CSAB), and a fellow of ABET. He currently serves as Vice Chair of the Computing Accreditation Commission of ABET and on the editorial board of the Empirical Soft ware Engineering Journal. He also chairs the Surveys Committee for the Computing Research Association (CRA) which conducts the annual Taulbee Survey of PhD-granting computer science and computer engineering departments in North America.

Grace Hopper Celebration of Women in ComputingTh e Purdue Department of Computer Science was well represented at the 2008 Grace Hopper Celebration of Women in Computing held in Keystone, Colorado, October 1-4, 2008. Eight students accompanied by Professor Sonia Fahmy were able to attend the conference. Five students received scholarships from the conference and were asked to present posters that they submitted to the conference earlier in the year.

Titapha Tiet, an undergraduate senior in computer science, said about Grace Hopper: “It was inspiring going to a conference where there were so many women dedicated to and passionate about computer science. My favorite session was one hosted by ShotSpotter a company who used technology to make the world a better place. It was great to learn about the methods used by the company and the diff erence their technology made in cutting down violence in cities.”

Th e trip for Computer Science participants was made possible by members of the Purdue Computer Science Corporate Partners Program, Lockheed Martin, FactSet, Northrop Grumman, Yahoo!, State Farm, and alumni Steve and Janet Tolopka.

47

K-12 OutreachTh e main purpose of the Department of Computer Science K-12 Outreach Program is to promote scientifi c literacy and stimulate interest in computer science among students in the K-12 school systems. Visits to K-12 schools include presentations, workshops, and teacher consultations. Additionally, bringing students and teachers to campus provide opportunities to create awareness of the discipline of computer science.

A secondary goal of our program is to inspire educators by equipping them with the confi dence they need so they may incorporate the use of technology and computer science concepts into their classrooms on a daily basis. Th is goal is achieved mainly through professional development seminars as well as statewide and national conference presentations.

Th is year, 25 families were able to participate in the “Are You Smarter than Your 5th Grader?” workshops. Th e pilot program was well received and will continue in the coming year. Unique outreach highlights for this year include the following: Techpoint MIRA Award Finalist in Education Contribution to Technology; Partnering with Riley Children’s Hospital School to bring CS outreach to students during their hospital stay; and working with the Indiana Girls Collaborative Project to network with others throughout the state with similar outreach goals.

A mainstay of the Computer Science Outreach Program is the annual Summer Camps for Middle School students. Th ere are Beginner and Advanced Level Camps. Additionally, former campers are invited to participate in a Junior Counselor program. Another expansion of the K-12 Outreach Program is a summer workshop for Mathematics teachers. Th e goal of the workshop, called “Linking Mathematics and Computer Science” is to show these teachers how topics in the mathematics curriculum relate naturally to many concepts in computer science.

Tearchers at the summer workshop engage in an algorithmic thinking exercise called “Programming with Peanut Butter.”

Middle school campers participate in a team building scavenger hunt during the annual CS Summer Camp.

48

Engagement

Premier Corporate PartnersCiscoEli Lilly and CompanyGoogle, Inc.Harris Corporation

IBMIntel Corporation Lockheed Martin

Microsoft CorporationMotorolaNorthrop Grumman

PartnersThe Boeing CompanyBooz Allen Hamilton, Inc.

Indiana Economic Development CorporationRaytheon Technical Services Company

State Farm InsurancesTechPoint

FriendsAllston TradingAmazon.comAprimo, Inc.Arxan Technologies, Inc.Beckman CoulterCaterpillarCerner Corporation

Citadel Investment GroupCrowe Horwath, LLPEDSExxonMobilFactSet Research Systems, Inc.Garmin InternationalICF International

MorningstarOntario Systems, LLCPrincipal Financial GroupQualcomm, Inc.Siemens Target

Corporate PartnersTh e Corporate Partners Program (CPP) was launched to foster close communication between the Department of Computer Science and private industry in the context of a mutually benefi cial relationship. Th e department enjoys the benefi t of fi nancial contributions, nurturing experiences for our students, and faculty research collaboration with industry leaders. Members in our CPP reap the benefi t of increased visibility, priority access to top students who may become future employees, and priority access to faculty who are experts in relevant technical fi elds.

Companies participate through strategic, unrestricted donations at tier levels and are involved in many core activities of the department. Company representatives take advantage of opportunities to speak in classes, sponsor student projects, and make signifi cant contact with CS students and faculty. Members of the CPP include giants of the information technology industry; as well as companies, large and small, in a wide variety of sectors. Partner members represent Indiana-based companies and other outstanding fi rms nationwide. Th is diverse and dynamic membership provides CS students with exposure to a myriad of career opportunities across the United States.

Th e Corporate Partners meet twice each year to provide input and feedback to departmental and college leadership. Recent contributions of the council include assistance in revising the undergraduate and graduate curricula, suggestions regarding recruiting, retention and enrollment issues, collaborative eff orts with faculty and student research, as well as alerting the department to industry areas of concern.

49

Donor Honor Roll - Individuals$10,000 - $99,999 Mr. Bimal N. SaraiyaMr. Chad E. WillwerthMrs. Dixie Willwerth

$5,000 - $9,999 Dr. Alan R. Hevner and Mrs. Cynthia Y. HevnerMr. Michael E. Petersen and Mrs. Jerralie M. PetersenDr. David C. SpellmeyerDr. Stephen J. Tolopka and Mrs. Janet L. Tolopka

$1,000 - $4,999 Mrs. Ruth AxsomMs. Kathleen Sue Campbell and Mr. Milton D.

CampbellDr. John A. Fitch IIIMrs. Marilyn A. ForsytheMs. Eileen M. Gorrell and Mr. Bill L. WeaverMr. Aaron R. Kunze and Mrs. Morgan E. KunzeMrs. Mary-Ann NeelMr. William M. Nigh and Mrs. Deborah S. NighMr. Brian A. ReddingMrs. Nanene Schwetman and Mr. Herbert DeWitt

SchwetmanMr. Arthur Sinensky and Ms. Debra OremlandMr. James I. Th omson and Mrs. Kimberly A. Th omsonMr. Gary W. Winiger and Ms. Catherine Jean

VonnegutMr. Stephen J. Zimmerly and Mrs. Virginia A.

Zimmerly

$100 - $999 Mrs. Amy Copeland Akin and Mr. Luke AkinMrs. Mary E. Allendoerfer and Mr. William B.

AllendoerferMr. Mark C. Baker and Mrs. Michal D. BakerMr. Stephen E. Belter and Ms. Deborah S. BelterMr. Frank C. BelzMr. David J. Biesack and Mrs. Deborah J. BiesackMs. Sandra L. BishMr. C. Douglas Brown and Mrs. Susan T. BrownMs. Valerie Anne Bubb FenwickMr. David J. Carlson

Mr. John G. CervenakMs. Wei Chen and Dr. Rongtian ZhangMr. Hao-Yung ChenMrs. Patricia D. Choi and Mr. Jae ChoiMr. W. Enoch ChuangMr. William E. ClarkMr. John W. ClarkDr. Christopher W. Clift on and Mrs. Patricia Clift onMr. Glen D. Cook and Mrs. Gail A. CookMr. James P. CzaplaMr. John V. Darlington and Mrs. Stefanie DarlingtonMr. Jeff rey P. Dotterer and Mrs. Lynn R. DottererMr. Hubert E. DunsmoreMrs. Elizabeth A. DyerMr. J. Parker FathMr. William Ezra Feller and Mrs. Stacey FellerMr. James Dewey Feltis and Mrs. Colleen Feltis Mr. Phillip G. Findley Mr. Timothy A. Fortier Dr. Frank L. Friedman Dr. Ajay K. Gupta and Mrs. Geeta Gupta Mr. Rodney G. Hannes and Mrs. Jean M. Hannes Mr. Robert J. Hemmig Mr. Brent E. Hinkle and Mrs. R. Elaine Hinkle Mr. Peter W. Hogue and Mrs. Linda Hogue Dr. William H. Hosken and Dr. Beverly J. McElmurry Mr. James W. Janik and Mrs. Linda L. Janik Ms. Dottie L. Janson Mr. John C. Kane Mr. Mark A. Kepke and Mrs. Ann Hof Kepke Mr. Joseph E. Knebel Mr. Kevin E. Kolis Mr. Ronald R. Krol and Mrs. Sheree S. Krol Dr. Benjamin A. Kuperman Ms. Nancy L. Laing Mr. Th omas M. Lang and Mrs. Gloria Lang Ms. Y. Cheng Leong and Dr. Melvin M. Moriwaki Mr. Stephen S. Leung and Ms. Olivia Tam Ms. Yue-Jinning Lian and Dr. Tunghsing Ku Mr. Marc D. Lipnick and Mrs. Deborah Lipnick Mr. Richard A. Marynowski Dr. Andrew J. Mayer and Mrs. Lisa A. Mayer Mr. Ken Mazawa Mr. Ryan M. McGann

Development of Private SupportWith support from its alumni and friends, Purdue Computer Science competes for the best faculty, recruits top students, provides scholarships, supports research, and funds new program initiatives. Th e department is deeply grateful to these donors who made contributions and pledges in the 2008-09 academic year.

50

Engagement

Dr. Robert L. Mead Jr. and Mrs. Sharon P. Mead Dr. Peng-Siu Mei and Mrs. Elaine Mei Dr. William F. MitchellDr. Rodney R. Oldehoeft Mr. Dennis Michael O’Neill and Mrs. Mary C. O’Neill Dr. Shawn D. Ostermann and Mrs. Leisa R.

Ostermann Mrs. Mary K. Podlecki and Mr. Alexander C. Podlecki Mr. Michael Robert Rosenberg and Mrs. Lisa Schofi eld

Rosenberg Mr. Adam D. Rouns Mr. David Lawrence Russell Mrs. C. Jill Sample and Mr. Patrick J. Sample Mr. R. Michael Schafer and Mrs. Catherine Schafer Mr. James S. Schier Dr. David K. Schrader Mr. Rahim K. Sewani Mr. Matthew K. Shahnavaz and Mrs. Laurie L.

Shahnavaz Dr. Michelle K. Shapiro Ms. Paula A. Shikany Mr. Warren R. Smith and Mrs. Geralyn S. Smith Mr. Sean T. Soper Mr. Larry Gene Southerland and Mrs. Evelyn L.

Wright Mr. John P. Spurgeon and Ms. Zhiyue Sun Mr. Paul J. Swanke and Ms. Joyce M. Harrison Mrs. Kuei-Hsiang A. Tang and Dr. Kwei Tang Mr. Edward W. Trischmann and Ms. Sandra R.

Pakaski Mrs. Barbara S. Turnbull and Mr. Donald H. Turnbull Mr. Robert D. Ulrich Jr. and Mrs. Gail Mitchell Ulrich Mr. John W. VanLaere and Mrs. Julie L. VanLaere Mr. Jerry C. VanWert Mrs. Janell Voss and Mr. William W. Voss Miss Chi-Ming Wang Dr. Ko-Yang Wang and Dr. G. Yuh-Jiun Lin Dr. William A. Ward Jr. and Mrs. Helen Ward Mr. Mark A. Warren Mr. Luke R. Wellman and Mrs. Jill M. Wellman Mr. Bradley K. Wells Mrs. Kaylynn Crossk Wrobel and Mr. Christopher D.

Wrobel Mrs. Yu-Chang G. Wu Mrs. Janice Marie Zdankus Dr. Stuart H. Zweben and Mrs. Rochelle Zweben

$1 - $99 Mr. Randal J. Baker Mr. Daniel J. Block and Mrs. Susan Block Mr. Daniel Lee Conklin and Mrs. Suzanne Holstine

Conklin Dr. Ferdinand A. Doll Jr. Dr. Tzvetan T. Drashansky Mr. Michael Francis Fiedler and Mrs. Barbara

Wuthrich Fiedler Mr. Benjamin T. Foster Dr. James Nelson Griffi oen and Mrs. Bonnie Lynn

Griffi oen Mr. Ryan E. Hudson Mr. Larry A. Huebel Ms. Betty A. Huff stetler Dr. J. A. Iverson Jr. and Mrs. Joan T. Iverson Mr. Robert D. Jackson and Mrs. Lori Lynn Jackson Dr. Anupam Joshi Mr. Paul F. Jurgens Mr. Kyle Th omas Kral Mr. Charles B. Lambert Mr. Charles Milutinovic Col. (Ret.) Michael John Ondrasek and Mrs. Karen

Ondrasek Mr. Jason C. Pardieck Ms. Judith M. Pritchard Mrs. Martha Rhodes and Mr. Jeff Rhodes Ms. Kristine Simons Mr. Philip H. Snyder Jr. and Mrs. Gaye Snyder Mr. Donny Soedharma Mr. Mark A. Stroup and Mrs. Naomi L. Stroup Mr. Galymzhan Berikovi Uteulin Ms. Karen L. Weedman and Mr. Mike Culbertson Mr. Matthew J. Wicks Ms. Ginger D. Wong

51

Donor Honor Roll - Corporate$100,000 and up Cisco System, Inc. Intel Corporation Microsoft Corporation

$10,000 - $99,999Adobe Systems Incorporated Boeing Company Booz-Allen-Hamilton Inc. Caterpillar Foundation Eli Lilly & Co. Foundation, Inc. Google Inc. Harris Foundation IBM International Foundation Lockheed Martin Lockheed Martin Foundation Motorola Foundation Nat’l Ctr for Women & Info Tech Northrop Grumman Raytheon Southwest Research Institute State Farm Mutual Automobile Ins. Co.

$5,000 - $9,999Allston Trading, LLC Cisco Systems Incorporated Electronic Data Systems Corporation FactSet Research Systems Lockheed Martin Corporation Qualcomm, Inc. Target Yahoo! Inc.

$1,000 - $ 4,999 3M Foundation Inc. Accenture Amazon.com Arxan Technologies, Inc. Beckman Coulter, Inc. Cerner Corporation Citadel Crowe Horwath LLP ExxonMobil Chemical Company Google Foundation Harris Corporation ICF International Intel Foundation

International Business Machines Corporation Northrop Grumman Foundation Ontario Systems LLC P & G Fund Principal Financial Group Inc. Siemens Corporation Sun Microsystems Inc.

$100 - $999Boeing *Cisco Foundation Eli Lilly & Company Foundation Inc. *Ernst & Young Foundation H. B. Fuller Company Foundation Lockheed Martin * Qualcomm *SC Johnson Fund *Shell Oil Company Foundation State Farm Companies Foundation

$1 - $99Altria Group Inc. Chrysler Foundation Dana Corporation Foundation General Electric Foundation Juniper Networks University Bookstore Inc. Wells Fargo Foundation *

*MGP Matching Gift Program

52

Guest Speakers

DATE SPEAKER/AFFILIATION TALK TITLE09/09/2008 Mukesh Mohania, PhD; IBM India Research Lab Analyzing Data and Content Together for BI09/09/2008 Vinod Yegneswaran, PhD; SRI International Multiperspective Malware Analysis 09/10/2008 Atish Das Sarma; Georgia Tech Estimating PageRank on Graph Streams09/15/2008 Balachander Krishnamurthy, PhD; AT&T Labs - Research Internet Privacy: Diffusion and Protection09/18/2008 Brian Cooper, PhD; Yahoo! Research PNUTS: Yahoo!’s Hosted Data Serving Platform09/22/2008 Satya Lokam, PhD; Microsoft Research, India Improved Bounds on Security Reductions for Discrete Log Based

Signatures09/22/2008 Prof. Tzi-cker Chiueh; Stony Brook University and Modern Malware Detection --- A Symantec Perspective

Symantec Corp.09/26/2008 Prof. Aleksandar Kuzmanovic; Northwestern University Googling the Internet (and Beyond) 09/26/2008 Prof. John Lui; Chinese University of Hong Kong An ISP-friendly File Distribution Protocol: Analysis, Design, and

Implementation10/06/2008 Prof. Danny Sorensen; Rice University New Directions in the Application of Model Order Reduction10/07/2008 Roise Jones, PhD; Yahoo! “I know what you did last summer”-- Query logs and user privacy10/17/2008 Prof. Marianne Winslett; University of Illinois, Managing Compliance Data: Addressing the Insider Threat

Urbana-Champaign Exemplifi ed by Enron10/20/2008 Prof. Thomas Cover; Stanford University The natural mathematics that arises in information theory and

investment10/22/2008 Prof. Tim Davis; University of Florida Direct Methods for Sparse Linear Systems: the MATLAB sparse

backslash10/27/2008 Prof. Leslie Pack Kaelbling; Massachusetts Institute of Learning to Think About the World

Technology10/28/2008 Prof. Gerik Scheuermann; University of Leipzig Topology- and Feature-Based Flow Visualization11/03/2008 Prabhakar Raghavan, PhD; Yahoo! Research New Sciences for a New Web11/04/2008 Cecilia Aragon, PhD; Lawrence Berkeley National Visual Analytics for Collaborative Astrophysics Experiments

Laboratory11/10/2008 Prof. EJ Jung; University of Iowa BayeShield: An Integrated Approach to Anti-Phishing11/12/2008 Laura Haas, PhD; IBM Almaden Research Center Beauty and the Beast: The Theory and Practice of Information

Integration11/14/2008 Ramasamy Uthurusamy, PhD; General Motors Corporation Emerging Trends in Technologies and Research

53

DATE SPEAKER/AFFILIATION TALK TITLE11/17/2008 Prof. Romit Roy Choudhury; Duke University Designing a Virtual Information Telescope Using Mobile Phones and

Social Participation11/17/2008 Philippe Jacquet, PhD; INRIA, France Networks: How Information Theory Met the Space and the Time11/18/2008 Prof. Sam Wagstaff; Purdue University The New Largest Known Prime is 2p-1 with p=43112609. Who

cares?11/19/2008 Prof. Rong Jin; Michigan State University An Extended Level Method for Effi cient Multiple Kernel Learning12/10/2008 Harald Stieber, PhD; Georg Simon Ohm University Software Reliability Engineering Mathematics, Applications and new

of Applied Sciences Nuremberg Perspectives 01/26/2009 Prof. Karem A. Sakallah; The University of Michigan Faster Symmetry Discovery using Sparsity of Symmetries 01/27/2009 Prof. Vasco T. Vasconcelos; University of Lisbon Modular Session Types for Distributed Object-Oriented Programming02/02/2009 Prof. P. R. Kumar; University of Illinois, Temporal Guarantees over Wireless Networks

Urbana-Champaign02/09/2009 Prof. Walter Gautschi; Purdue University The Spiral of Theodorus, Numerical Analysis, and Special Functions03/26/2009 Prof. David Jensen; University of Massachusetts, Amherst Automatic Identifi cation of Quasi-Experimental Designs for

Discovering Causal Knowledge03/26/2009 Prof. David Jensen; University of Massachusetts, Amherst Myths of Research in Computer Science03/26/2009 Prof. Danfeng Yao; Rutgers, State University of Keystroke Dynamic Authentication eith Trusted User Inputs for

New Jersey Human-Behavior Driven Bot Detection03/27/2009 Prasad Joshi; InfosysTechnologies Ltd. Infosys Perspectives on Flat World and Software Engineering03/30/2009 Prof. Jeffrey Siskind; Purdue University Automatic Differentiation of Functional Programs and its use for

Probabilistic Programming04/10/2009 Ranveer Chandra, PhD; Microsoft Research Next Generation of Wi-Fi: Designing Networks over White Spaces04/10/2009 Prof. Jessica Hodgins; Carnegie Mellon University Generating Natural Human Motion04/16/2009 Ajit Singh; Carnegie Mellon University Relational Learning via Collective Matrix Factorization04/17/2009 Prof. Stuart Zweben; The Ohio State University In Search of Impact: Service Counts, Too!04/24/2009 Prof. Tao Wang; Purdue University New Algorithms and Representations for Sequential Decision Making

under Uncertainty04/27/2009 Prof. Ibrahim Matta; Boston University “Networking is IPC”: A Guiding Principle to a Better Internet04/28/2009 Prof. Doug Thain; Notre Dame University Using Abstractions to Scale Up Applications to Campus Grids05/18/2009 Steven Ericsson-Zenith, PhD; The Institute for Advanced Reasoning about behavior associated with social networks

Science & Engineering

54

Diversity

The Purdue CS Summer Camp aims to expose underrespresented students in grades six through nine to computer science and careers available to a CS graduate.

Purdue CS graduate and undergraduate students attend the Grace Hopper Celebration of Women in Computing each year.

Th e Department of Computer Science is committed to diversity in our students, faculty, and staff , supporting both the participation and success of underrepresented minorities as well as addressing the underrepresentation of women in computer science.

We have redesigned computer science recruiting materials to emphasize the variety of career options available to CS graduates--career options that appeal to a diverse group of students. Th e department supports a number of events, programs, and other initiatives aimed at increasing the pipeline of women and underrepresented minorities. Th ese initiatives reinforce the fact that successful companies depend on a variety of contributions from a diverse group of employees. Examples of current activities include middle school summer camps to expose underrepresented students to the excitement of computer science, training workshops for high school math teachers to help them link classroom activities to computer science topics, and a student-led high school visitation program called “ROCS: Reaching Out for Computer Science”.

We work closely with the Midwest Crossroads AGEP program offi ce at Purdue, off er summer-bridge programs to incoming students, and participate in conferences aimed at recruiting underrepresented minorities. We also host GEM consortium fellows and Science Bound summer interns.

We have an active presence at conferences including the Grace Hopper Celebration of Women in Computing and the CIC Summer Research Opportunities Program (SROP). We visit minority serving institutions and high schools with high enrollment of underrepresented minorities and encourage students to join our program.

Th e departmental Computer Science Women’s Network (CSWN) is an organization of students, faculty, and staff dedicated to helping all members succeed in computer science. Over the past several years we have been successful in hiring outstanding female faculty. We held our annual Women in Computer Science Career Day, targeting high school juniors. Th e career day event presented young women with fun lab activities that allowed them to explore computer science as a career and Purdue Computer Science as a way to get there.

55

Post Doc Research AssociateRuy De OliveiraGabriel GhinitaChristian HammerTomas KaliberaNicholas Kidd Sylvain LebresneHyo Sang LimMurat Manguoglu Federica Paci Ning ShangQihua WangWeiqiang WangTao WangSamuel WrigstadRuijun Zhao

Visiting Assistant ProfessorMin-Ho Kyung Pascal MeunierBarry Wittman

Visiting ScholarsYoung Joon AhmJongwook BaekChing-Shoei ChiangJung-Ju ChoiAchim GuttmannWeili HanJungho HuhKoo Hong KangMin-Ho KyungJohannes Langguth Hyo Sang LimHongbin Luo Yang Sae MoonShanliang PanRoland PulchMin Surp RheeVeysel Harun Sahin Carmen VicenteSuk Dea YuZhengtao YuShijie ZhouYongBin ZhouLiehuang Zhu

Visiting Facultyand Research Staff

56

Staff

Purdue Computer Science faculty, staff, and students gathered on the front steps of the Lawson Computer Science Building before the CS Employee Recognition Celebration where they recognized their colleagues for their accomplishments throughout the year.

DepartmentAditya Mathur, Department HeadMikhail Atallah, Associate HeadJohn T. (Tim) Korb, Assistant HeadKarla Cotter, Administrative Assistant

Business Offi ceMary Bell, Business ManagerLinda Byfi eld, Account ClerkRobynne McCormick, Account ClerkTammy Muthig, Account ClerkPatty Rigdon, Account Clerk Tracie Wagner, Account Clerk

Offi ce of DevelopmentJavier Magallanes, Director of DevelopmentJean Jackson, Manager of Corporate RelationsPat Morgan, Secretary

FacilitiesBrian Board, HardwareRon Castongia, Facilities ManagerMelanie Church, Windows Soft wareCharles Fultz, UNIX Soft wareKip Granson, Windows Soft ware

Nick Hirschberg, Webmaster and DBAMike Motuliak, HardwareSteve Plite, UNIX Soft wareDan Trinkle, Tech. System AdministratorCandace Walters, Assistant Director, Facilities

Graduate Offi ceWilliam J. Gorman, Assistant to the HeadAmy Ingram, Graduate SecretaryRenate Mallus, Graduate Offi ce Coordinator

Support Staff William Crum, InstructorMindy Hart, Outreach CoordinatorLorenzo Martino, InstructorGary McFall, InstructorPatti Minniear, Copy Center OperatorPaula Perkins, Department SecretaryNicole Piegza, Communications Assistant Gustavo Rodriguez-Rivera, Instructor

Undergraduate Offi ceCarol Paczolt, AdvisorJanice Th omaz, AdvisorKaren Wiens, Advisor

57

Facilities

Th e department is dedicated to providing high-quality computing facilities for use by computer science faculty, students, and administrative personnel. Th e facilities are operated by a technical staff who are not only responsible for the installation and maintenance of the systems, but who also assist faculty and students in the development of soft ware systems for research projects. Th e staff includes a director, facilities manager, administrative assistant, network engineer, hardware engineer, six system administrators, and several student assistants.

General FacilitiesGeneral computing facilities are available for both administrative activities (such as the preparation of research reports and technical publications) and research needs that are not supported by other dedicated equipment. Th e main server systems are multiprocessors with large main memories and large disk arrays for storage. Personal workstations and laptops from a variety of vendors are used by faculty, staff , and students throughout the department.

Education FacilitiesTh e Computer Science department operates nine instructional laboratories in two buildings. Th ese labs are used for both undergraduate and graduate computer science courses and include over 200 Intel- and Sun SPARC-based workstations. Supported operating systems include Windows XP with plans to upgrade to Win7 in summer 2010, Linux, Solaris x86, and Solaris SPARC. Two labs are collaboration team project labs dedicated to group learning with the assistance of interactive SMARTboard technology. A later section lists equipment owned and maintained by ITaP but used by computer science students.

I/O EquipmentTh e department operates both special-purpose output devices as well as general output equipment, including more than 75 laser printers, color printers, scanners, copiers, video projectors, digital video recording and editing capabilities as well as a variation of video and phone conferencing equipment. Th e CS department provides video conferencing in dedicated locations as well as mobile video conferencing stations. Recently the CS department has added a new state of the art Cisco Telepresence video conference room.

Networking ServicesTh e department is strongly committed to state-of-the-art networking technology to provide access to and communication among its systems, as well as to those elsewhere on campus and throughout the world. Our departmental infrastructure supports gigabit per second data rates to the desktop throughout our two buildings using over 65 Ethernet VLAN-capable enterprise switches from Force10 and Cisco Systems. Wiring in the new Lawson Computer Science Building is based on Panduit augmented CAT6 data cable and patch panels, capable of 10 gigabit per second speeds. Th is network infrastructure is biconnected to the campus backbone by two 1 gigabit per second redundant fi ber links. Th e campus is connected to multiple high speed Internet backbones, including Abilene/Internet2 and I-Light. DSL, cable, and cellular data services are widely used for remote access.

Information Technology at Purdue (ITaP)In addition to the facilities described above, students and faculty have access to computing systems owned and operated by ITaP. General instructional facilities operated by ITaP include large Sun SPARCservers and several Sun and Intel workstation laboratories. In addition, ITaP provides systems for use in courses taught by the CS Department. Th ese systems include UNIX-based Sun SPARC stations for undergraduate computer science courses and Microsoft Windows-based Intel personal computers for use in an introductory course for non-majors (CS 110). Departmental research projects make use of other facilities provided by ITaP. Th ese include a large IBM SP cluster and the Envision Center for Data Perceptualization.

5858

Purdue is an equal access/equal opportunity universityProduced by Purdue Department of Computer ScienceAnnual Report Design by Nicole Piegza

Department of Computer Science

305 N. University Street

West Lafayette, IN 47907-2107

(800) 320-6132

www.cs.purdue.edu