Computer Science and Electrical Engineering
Quantum Computing Seminar

Shor’s Algorithm Part 2

Samuel Lomonaco, CSEE, UMBC

2:30-3:00 Tuesday, 3 December 2013, ITE 325b

As requested in the last seminar, we will devote this seminar to stepping through the complete Shor algorithm (from beginning to end) to factor the “enormous” integer 21. This talk will based on the example found at the beginning of the following paper.

Quantum hidden subgroup algorithms: A mathematical perspective, AMS CONM, vol. 305, (2002), 139 – 202.

Samuel J. Lomonaco is a professor at the Department of Computer Science and Electrical Engineering of the University of Maryland Baltimore County. He is internationally known for his many contributions in mathematics and in computer science. His research interests span a wide range of subjects from knot theory, algebraic and differential topology to algebraic coding theory, quantum computation, and symbolic computation. In quantum cryptography, he has shown how quantum information theory can be used to gain a better understanding of eavesdropping with quantum entanglement. In quantum computation, he has shown how Lie groups can be used to solve problems arising in the study of quantum entanglement. In 2000 Professor Lomonoco organized the first American Mathematical Society short course on quantum computation.

Organizer: Prof. Samuel Lomonaco, Sorry, you need javascript to view this email address.

Center for Information Security and Assurance
University of Maryland, Baltimore County

Finding privacy leaks and stolen data with
bulk data analysis and optimistic decoding

Dr. Simson Garfinkel
Naval Postgraduate School

12:00-1:00 Friday, 6 December 2013, ITE 229

Modern digital forensics tools are largely based on the recovery and analysis of files. This talk explores how identity information such as email addresses, credit card numbers, and other of information can be more efficiently found using bulk data analysis, and how results are significantly improved through the use of optimistic decompression. Together, these techniques can find important information on computer media that are ignored by the majority of today’s digital forensics tools.

This talk presents the results of a study of roughly 5000 hard drives purchased on the secondary market and shows how different kinds of data formats can be traced to different kinds of privacy leaks and coding errors. It shows how the results were generated using bulk_extractor, an easy-to-use open source digital forensics tool. Finally, it shows how bulk_extractor was extended to detect data obscured with a simple steganographic technique (XOR 255), and how a subsequence re-analysis of the research corpus found significant use of the technique in commercial software, malware, and by at least one computer criminal.

Dr. Simson L. Garfinkel is an Associate Professor at the Naval Postgraduate School. Based in Arlington VA, Garfinkel’s research interests include digital forensics, usable security, data fusion, information policy and terrorism. He holds six US patents for his computer-related research and has published dozens of research articles on security and digital forensics.

Garfinkel is the author or co-author of fourteen books on computing. He is perhaps best known for his book Database Nation: The Death of Privacy in the 21st Century. Garfinkel’s most successful book, Practical UNIX and Internet Security (co-authored with Gene Spafford), has sold more than 250,000 copies and been translated into more than a dozen languages since the first edition was published in 1991.

Garfinkel received three Bachelor of Science degrees from MIT in 1987, a Master’s of Science in Journalism from Columbia University in 1988, and a Ph.D. in Computer Science from MIT in 2005.

Host: Dr. Alan T. Sherman, Sorry, you need javascript to view this email address.

CRA-Women is accepting applications for the 2014 Graduate Cohort for Women. Cohort activities will kick off with a workshop 11-12 April 2014 in Santa Clara, CA. This workshop is the cornerstone of CRA-W’s efforts to increase the ranks of senior women in computing by building and mentoring nationwide communities of women during their graduate studies.

Women students in their first, second, and third year of graduate school in computer science and engineering or a closely related field, who are studying at a U.S. or Canadian institution. Travel expenses, meals and lodging will be provided for students chosen to participate in this program.

At the Grad Cohort Workshop, women graduate students in their first year of graduate school will be welcomed into the community of computing researchers and professionals by providing them with a broad range of strategies and role models. Strategies and mentoring for students in their second and third years of graduate school will also be provided.

All of the students will meet for two days with ~20 senior computing researchers and professionals who will share pertinent information on graduate school survival skills, as well as more personal information and insights into their experiences. The rewards of a research career will be emphasized. This workshop will include a mix of formal presentations and informal discussions and social events. Through the workshop, students will be able to build mentoring relationships and develop peer networks that will form the basis for ongoing activities during their graduate careers. Also, participants will be able to network with our generous sponsors to learn about career and internship opportunities they have available.

See http://bit.ly/crawgcw for more information about the Grad Cohort program. Apply by December 4, 2013.

CRA-Women is accepting applications for the 2014 Graduate Cohort for Women. Cohort activities will kick off with a workshop 11-12 April 2014 in Santa Clara, CA. This workshop is the cornerstone of CRA-W’s efforts to increase the ranks of senior women in computing by building and mentoring nationwide communities of women during their graduate studies.

Women students in their first, second, and third year of graduate school in computer science and engineering or a closely related field, who are studying at a U.S. or Canadian institution. Travel expenses, meals and lodging will be provided for students chosen to participate in this program.

At the Grad Cohort Workshop, women graduate students in their first year of graduate school will be welcomed into the community of computing researchers and professionals by providing them with a broad range of strategies and role models. Strategies and mentoring for students in their second and third years of graduate school will also be provided.

All of the students will meet for two days with ~20 senior computing researchers and professionals who will share pertinent information on graduate school survival skills, as well as more personal information and insights into their experiences. The rewards of a research career will be emphasized. This workshop will include a mix of formal presentations and informal discussions and social events. Through the workshop, students will be able to build mentoring relationships and develop peer networks that will form the basis for ongoing activities during their graduate careers. Also, participants will be able to network with our generous sponsors to learn about career and internship opportunities they have available.

See http://bit.ly/crawgcw for more information about the Grad Cohort program. Apply by December 4, 2013.

CRA-Women is accepting applications for the 2014 Graduate Cohort for Women. Cohort activities will kick off with a workshop 11-12 April 2014 in Santa Clara, CA. This workshop is the cornerstone of CRA-W’s efforts to increase the ranks of senior women in computing by building and mentoring nationwide communities of women during their graduate studies.

Women students in their first, second, and third year of graduate school in computer science and engineering or a closely related field, who are studying at a U.S. or Canadian institution. Travel expenses, meals and lodging will be provided for students chosen to participate in this program.

At the Grad Cohort Workshop, women graduate students in their first year of graduate school will be welcomed into the community of computing researchers and professionals by providing them with a broad range of strategies and role models. Strategies and mentoring for students in their second and third years of graduate school will also be provided.

All of the students will meet for two days with ~20 senior computing researchers and professionals who will share pertinent information on graduate school survival skills, as well as more personal information and insights into their experiences. The rewards of a research career will be emphasized. This workshop will include a mix of formal presentations and informal discussions and social events. Through the workshop, students will be able to build mentoring relationships and develop peer networks that will form the basis for ongoing activities during their graduate careers. Also, participants will be able to network with our generous sponsors to learn about career and internship opportunities they have available.

See http://bit.ly/crawgcw for more information about the Grad Cohort program. Apply by December 4, 2013.

CSEE Professor and director of the chess program Alan Sherman with the team that will represent UMBC at the 2013 Pan American Intercollegiate Team Chess Championship next month in Lubbock, Texas.  The top four qualifying schools from the PanAms go on to compete in the Final Four of college chess, held in the spring. The winner is considered national champion and takes home the President’s Cup.

M.S. Thesis Defense
Computer Science and Electrical Engineering
University of Maryland, Baltimore County

Fabrication and Characterization of a

Pd Nanowire-based Glucose Biofuel Cell

Kweku Amoah

10:30-12:30 Monday, 25 November 2013, ITE 346

The use of glucose as a biofuel has received a lot of attention in part due to the potential applications of such systems. In addition to the being a clean energy alternative, it provides a pathway for implantable microelectronic devices such as pacemakers to be powered by interstitial fluid and eliminate the need for batteries. Furthermore, using interstitial fluid as power sources will drastically reduce necessary invasive surgeries to replace batteries. Additionally, cost to such patients will be reduced while quality of life enhanced. The research presents a unique platform for harvesting energy from glucose. Using semiconductor cleanroom techniques, electrically conductive palladium nanowires are grown on anodized aluminum oxide (AAO) templates using silicon and glass as supporting substrates. Photolithography is used to create two non-continuous gold windows and contact pads on the substrates. AAO templates are attached to the two gold windows and palladium nanowires are electrochemically grown on the AAO templates. Glucose oxidase and catalase are immobilized on the anode and laccase on the cathode. In the presence of glucose, electrons are released that generate voltage and current. The current-voltage behavior of the fuel cell, as well as electrochemical properties, is characterized using standard performance metrics. In 0.5 moles per liter of glucose solution with a neutral pH of 7.3, the open circuit voltage obtained was 335 mV and the short circuit current of 6 µA to yield a maximum power output of 2.01µW.

Committee: Drs. Gymama Slaughter (Chair), Fow-Sen Choa and Joel Morris

The Problem with Print: publishing born digital scholarship

Professor Helen J. Burgess
Department of English, UMBC

4:00pm Monday, 25 November 2013

Gallery, A. O. Kuhn Library

Dr. Burgess will discuss some of the difficulties for academics seeking to work and publish outside traditional “print-bound” models of humanities scholarship – including issues of professional evaluation and distribution – and show some examples of “born digital” works that would benefit from a new model of publishing. A reception, sponsored by the Libby Kuhn Endowment Fund, will follow the program.

Helen J. Burgess is an Assistant Professor of English in the Communication and Technology track. Dr Burgess received her BA(Hons) and MA(Dist.) in English Language and Literature from Victoria University of Wellington, in New Zealand, and her PhD in English from West Virginia University. She is active in the new media research community as editor of the online journal Hyperrhiz: new Media Cultures, and technical editor of Rhizomes: Cultural Studies in Emerging Knowledge. Dr Burgess is coauthor of Red Planet: Scientific and Cultural Enounters with Mars and Biofutures: Owning Body Parts and Information, both titles published in the Mariner10 interactive DVD-Rom series at the University of Pennsylvania Press. She has interests in multimedia and web development, open source and open content production, electronic literature, and science fiction.

Ph.D. Dissertation Defense
Computer Science and Electrical Engineering
University of Maryland, Baltimore County

Applying Data Visualization Techniques to Support the
Analysis of Digital Forensic Data

Timothy Leschke

10:00am-Noon Friday 22 November 2013, ITE 456

The Modern Age of digital forensics is characterized by a proliferation of artifacts, increased data complexity, larger and cheaper data storage, and the emergence of the need for tools that support timeline analysis, anomaly detection, and triage. Traditional text-based digital forensic tools can no longer keep pace with the demands of the modern digital forensic examiner. A new approach for developing digital forensic tools is required if digital forensics is going to avoid becoming stagnant.

We apply the power of data visualization to support the needs of the modern digital forensic examiner. We design and develop a tool called Change-Link; a coordinated and multiple view tool which uses semantic zooming in the form of an overview, treeview, directory content view, and a metadata view to provide an understanding of digital forensic data that changes over time. By using this tool to examine a mock evidence hard drive containing shadow volume data provided by the Microsoft Volume Shadow Copy Service, we demonstrate a way to reduce data complexity and provide better forensic data analysis while supporting timeline analysis, anomaly detection, and a triage of the dataset.

We demonstrate a proof for our broader hypothesis which is data visualization techniques can be developed to support better analysis of digital forensic data.

Committee: Drs. Charles Nicholas (chair), Konstantinos Kalpakis, Dhananjay Phatak, Jian Chen, Clay Shields (Georgetown Univ.), Daniel Quist

Ph.D. Dissertation Defense
Computer Science and Electrical Engineering
University of Maryland, Baltimore County

Finding Story Chains and Creating Story Maps in Newswire Articles

Xianshu Zhu

10:00-12:00pm Monday 25 November 2013, ITE 325B

There are huge amounts of news articles about events published on the Internet everyday. The flood of information on the Internet can easily swamp people, which seems to produce more pain than gain. While there are some excellent search engines, such as Google, Yahoo and Bing, to help us retrieve information by simply providing keywords, the problem of information overload makes it hard to understand the evolution of a news story. Conventional search engines display unstructured search results, which are ranked by relevance using keyword-based ranking methods and other more complicated ranking algorithms. However, when it comes to searching for a story (a sequence of events), none of the ranking algorithms above can organize the search results by evolution of the story. Limitations of unstructured search results include: (1) Lack of the big picture on complex stories. In general, news articles tend to describe the news story from different perspectives. For complex news stories, users can spend significant time looking through unstructured search results without being able to see the big picture of the story. For instance, Hurricane Katrina struck New Orleans on August 23, 2005. By typing “Hurricane Katrina” in Google, people can get much information about the event and its impact on the economy, health, and government policies, etc. However, people may feel desperate to sort the information to form a story chain that tells how, for example, Hurricane Katrina has impacted government policies. (2) Hard to find hidden relationships between two events: The connections between news events are sometimes extremely complicated and implicit. It is hard for users to discover the connections without thorough investigation of the search results.

In this dissertation, we seek to extend the capability of existing search engines to output coherent story chains and story maps (a map that demonstrates various perspectives on news events), rather than loosely connected pieces of information. By this means, people can obtain a better understanding of the news story, capture the big picture of the news story quickly, and discover hidden relationships between news events. First of all, algorithms for finding story chains have the following two advantages: (1) they can find out how two events are correlated by finding a chain of events that coherently connect them together. Such story chains will help people discover hidden relationship between two events. (2) they allow users to search by complex queries such as “how is event A related to event B”, which does not work well on conventional keyword-based search engines. Secondly, creating story maps by finding different perspectives on a news story and grouping news articles by the perspectives can help users better capture the big picture of the story and give them suggestions on what directions they can further pursue. From a functionality point of view, the story map is similar to the table of content of a book which gives users a high-level overview of the story and guides them during news reading process.

The specific contributions of this dissertation are: (1) Develop various algorithms to find story chains, including: (a) random walk based story chain algorithm; (b) co-clustering based story chain algorithm which further improves the story chains by grouping semantically close words together and propagating the relevance of word nodes to document nodes; (c) finding story chains by extracting multi-dimensional event profiles from unstructured news articles, which aims to better capture relationships among news events. This algorithm significantly improves the quality of the story chains. (2) Develop an algorithm to create story maps which uses Wikipedia as the knowledge base. News articles are represented in the form of bag-of-aspects instead of bag-of-words. Bag-of-aspects representation allows users to search news articles through different aspects of a news event but not through simple keywords matching.

Committee: Drs. Tim Oates (chair), Tim Finin, Charles Nicholas, Sergei Nirenburg and Doug Oard