FSU CS Expo 2015
November 12th, 2015
organized by
Event Features
Industry Speakers
share their experiences and insight.
Research Presentations
by students and alumni.
Poster Contest
Prizes awarded to the winner.
Grad-Made-Good
Talks given by successful alumni.
Social Gathering
of like-minded professionals.
Awards Ceremony
Celebrate faculty and students.
Software Demo Contest
Prizes awarded to the winner.
Raffles and Door Prizes
Answer trivia in between talks to win.
About the CS Expo
who we are and why we do thisThe Expo Mission
The CS Expo is the premier annual event for students, alumni and faculty of the Computer Science department at the Florida State University to showcase science, technology, and cutting-edge projects, and to exchange opportunities and experiences. This one-day event sets up an open forum that features technical talks, research presentations, demos and posters by computer science students, a "Grad-Made-Good" talk by this year's keynote speaker Dr. Prasad Kulkarni from University of Kansas, and an invited talk from the David Lawson of NewSci. Alumni and friends of the Computer Science department participate in the event to share post-graduate experiences and opportunities for our students.
The computer was born to solve problems that did not exist before.
– Bill Gates
We can only see a short distance ahead, but we can see plenty there that needs to be done.
– Alan Turing
The question of whether computers can think is like the question of whether submarines can swim.
– Edsger Dijkstra
An algorithm must be seen to be believed.
– Donald Knuth
A language that doesn't have everything is actually easier to program in than some that do.
– Dennis Ritchie
One accurate measurement is worth a thousand expert opinions.
– Grace Hopper
Speakers
Will share their experiences
Dr. Prasad Kulkarni
Associate Professor of Computer Science, EECS, University of Kansas
Dr. Prasad Kulkarni received his PhD in Computer Science from Florida State University in 2007 and is currently an Associate Professor in the EECS department at the University of Kansas. His research interests are in the areas of compilers, computer architecture, and runtime systems (virtual machines). In particular, he focuses on building system tools to investigate and solve a variety of interesting problems to enable more efficient and secure program execution on modern multi-core machines and embedded systems. As a student Dr. Kulkarni received the IBM Ph.D. fellowship. He was awarded the NSF's CAREER award in 2010, and the KU EECS students awarded him with the Harry Tally Excellence in Teaching Award in 2012. He also heads the Compilers, Architectures, and Runtime Systems (CARS) research group at KU.
David Lawson
Co-Founder & CEO, NewSci
Mr. David Lawson is a prominent figure in the tech startup circles in Tallahassee. He is currently the founder and CEO of NewSci, a company that focuses on devloping Big Data solutions to non profit ogranizations, offering "insight as a service". He's a partner at Domi Ventures, which is a Tallahassee based company focused on the curation of early stage startup companies. Mr. Lawson also serves as an advisory board member for several compnaies including Return on Mission, Agile Equity, Small Act, HG Data, etc. He is the co founder of WorkingPhilanthropy.com that works with other social entrepreneurs seeking to bring products and services to the nonprofit sector. His talk is going to focus on NewSci's activities in the Big Data Analytics arena.
Student Talks
Curent Research at FSU Computer Science Department
Javier Escobar
Automatic Categorization of Software Libraries Using Bytecode
Software developers use repositories to search for reusable software libraries. These repositories commonly offer search by keywords and search by categories. Categories offers some advantages over keywords: they summarize the functionality of a library and enable developers to compare similar ones. However, some large repositories do not support categories for their libraries, and it expensive to categorize those libraries by asking developers. We propose a new technique to automatically categorize Java libraries through the analysis of their bytecode. We evaluated our technique using the libraries and categories of the Apache Software Repository.
Shiva Krishna Imminni
PyQuery: A Search Engine for Python Packages and Modules.
Python Package Index (PyPI) is a repository that hosts thousands of packages from different developers for the Python community. It is the primary source for downloading and installing packages. It also provides a simple web interface to search for these packages. A direct search on PyPI returns hundreds of packages that are not intuitively ordered, thus making it harder to find the right package. Developers consequently resort to mature search engines like Google. The first problem we want to solve is to improve search results for python packages. Secondly, we want to develop a new search engine that allows Python developers to perform a code search targeting python modules. Currently, every time a developer performs a search operation, he or she has to choose Python out of a plethora of languages. We would like to offer a more reliable and dedicated search engine that caters specifically to the Python community and ensures a more efficient way to search for Python packages and modules
Yue Chen
Harvesting Developer Credentials in Android Apps
Developers often integrate third-party services into their apps. To access a service, an app must authenticate itself to the service with a credential. However, credentials in apps are often not properly or adequately protected, and might be easily extracted by attackers. A leaked credential could pose serious privacy and security threats to both the app developer and app users. CredMiner can programmatically identify and recover (obfuscated) developer credentials unsafely embedded in Android apps. Specifically, it leverages data flow analysis to identify the raw form of the embedded credential, and selectively executes the part of the program that builds the credential to recover it.
Martin Brown
Agave: a Benchmark Suite Addressing AndroidSystem Complexity
The computer architecture community relies on standard benchmark suites like MiBench, NAS, PARSEC, SPEC, and SPLASH to study different hardware designs, but such suites are insufficient for evaluating mobile platforms like Android. Even suites that were developed for embedded systems cannot be used to gain an understanding of Android device/system interaction because they do not exercise keycomponents of the software stack. Although based on a conventional Linux kernel, Android includes native libraries, a virtual machine runtime, and an application framework with multiple components for managing resources. All of these different components interact to support Android applications. C programs running on Linux have a relatively simple virtual memory organization, and most memory references come from the application code. In contrast, Android has a much more complex virtual memory organization (due to its multiple APIs and numerous shared libraries), and most memory references come from the Android software stack. The complexity of Android’s execution environment provides opportunities for computer architects to better support the execution characteristics, structures, and resource requirements of the Android software stack and opportunities for software developers to optimize their applications for this rich environment. To help the community to exploit these opportunities, we introduce Agave, an open-source benchmark suite designed to expose the complex interactions between components of the Android software stack.
Peyman Faizian
On the Performance of Random Regular Topologies
Random regular graph (Jellyfish) has recently been proposed as an interconnect topology for future large scale data centers and HPC clusters. In this work, we establish bounds for directed regular graphs on diameter, average k-shortest path length, and a load balancing property with k-shortest path routing, and use these bounds to evaluate random regular graphs. The results indicate that this topology with k-shortest path routing is not ideal in terms of diameter and load balancing. We further consider the Generalized De Bruijn Graph, a deterministic directed regular graph, and prove that for most network configurations, it is near optimal in terms of diameter, average k-shortest path length, and load balancing with a k-shortest path routing scheme. Finally, we compare these topologies in terms of their performance under different traffic patterns.
Schedule
The event schedule is subject to change11/12
10.00am - 10.10am
Introduction
11/12
10.10am - 11.05am
David Lawson
Invited speaker: Co-Founder & CEO at NewSci
11/12
11.05am - 12.00pm
Dr. Prasad Kulkarni
Grad Made Good: Associate Professor, University of Kansas
11/12
12.00pm - 12.30pm
*Lunch
Meal tickets will be handed out in the talk before lunch.
11/12
12.30pm - 1.00pm
Javier Escobar
Automatic Categorization of Software Libraries Using Bytecode
11/12
1.00pm - 1.30pm
Shiva Krishna Imminni
PyQuery: A Search Engine for Python Packages and Modules.
11/12
1.30pm - 2.00pm
Yue Chen
Harvesting Developer Credentials in Android Apps.
11/12
2.00pm - 2.30pm
Martin Brown
Agave: a Benchmark Suite Addressing AndroidSystem Complexity
11/12
2.30pm - 3.00pm
Peyman Faizian
On the Performance of Random Regular Topologies
11/12
3.00pm - 3.15pm
Closing and Awards
* Location to be announced
Research demos will be shown in The Globe, Program Room 2600 from 10 AM to 2 PM.
Posters are on display in The Globe, Program Room 2600 from 10 AM to 2 PM.
Expo Venue
where it is and how to get thereThe Center for Global Engagement (The Globe), 110 S. Woodward Ave., Florida State University, Tallahassee, FL 32306
The talks will be the Auditorium on the first floor.
Routes by Car
Woodward Garage: Take Tennessee Street to Woodward Ave. Entrance is on the right.
Traditions Way Garage: Take Gaines Street to Woodward Ave. and take Woodward north. Entrance is on the left.
Routes by StarMetro
free for students/ $1.25 - $3.00
Use the Forest Route. The closest stop is W Jefferson at Woodward For more information on StarMetro routes please visit StarMetro's Website
Routes by Seminole Express
free
Use the Renegade Route (campus loop). It has a stop right by the Ragans Hall which is just a two minute walk from The Center for Global Engagement.
FAQ
Frequently Asked Questions- How do I sign up?
-
If you're a student or faculty member of the department of Computer Science, you are
already registered and encouraged to come.
If you a visitor or speaker, please contact Kenyetta Neale. - How can I enter my poster in the contest?
- Please contact Caitlin Carnahan at carnahan@cs.fsu.edu
- I would like to make a presentation. Who do I contact?
- Please contact Caitlin Carnahan at carnahan@cs.fsu.edu. Student's that are interested in doing a presentation will have to pass a preliminary round. We will pick the top student presentations to actually present at the Expo.
- Will my class be canceled so I may attend?
-
Canceling or rescheduling a class so that students may attend the event is done at the discretion of the instructor.
The event is scheduled so that most students can attend at least one or more talks. - Is lunch provided?
- Lunch and refreshments will be provided by the department of Computer Science. You must attend the talk before lunch in order to receive a meal ticket. Food will not be served to individuals who do not have a meal ticket.
- I'm visiting. Where do I park? What's the cost?
-
A visitor parking permit is available from FSU Transportation Services. The cost of this
permit is $3.25 per day. This permit allows parking in any non-gated Faculty/Staff spaces and Student spaces (and Loading Zones for 20 minutes). You may purchase the permit
at Transportation Services office; University Center C5406, Monday - Friday, 7:30am - 5:00pm.
For more information visit their website: parking.fsu.edu
The closest parking garages to the Center for Global Engagement (The Globe) are the Woodward Garage and the Traditions Way Garage. To see a map, click here.
Our Sponsors
Contact Us
Contact Info
Caitlin Carnahan
253 Love Building, Florida State University Tallahassee, FL 32306
P. (941) 524-5572
E. carnahan@cs.fsu.edu
W. www.cs.fsu.edu