Hacker School is a free, full-time, immersive school in New York for becoming a better programmer. Participants come from around the world to spend 12 weeks writing code and growing as programmers. Three sessions are run each year, with one in the summer.

Hacker School is largely unstructured, self-directed, and project-based with optional activities and structure: reading groups, mini workshops and seminars, weekly dinners and talks, group presentations, and more.

The program is tuition-free, but participants are responsible for their own living expenses. Some aid is available, including more than $150,000 from Google for need-based grants for female programmers to come to Hacker School. For more information and to apply, see the Hacker School site.

Hacker School is a free, full-time, immersive school in New York for becoming a better programmer. Participants come from around the world to spend 12 weeks writing code and growing as programmers. Three sessions are run each year, with one in the summer.

Hacker School is largely unstructured, self-directed, and project-based with optional activities and structure: reading groups, mini workshops and seminars, weekly dinners and talks, group presentations, and more.

The program is tuition-free, but participants are responsible for their own living expenses. Some aid is available, including more than $150,000 from Google for need-based grants for female programmers to come to Hacker School. For more information and to apply, see the Hacker School site.

Hacker School is a free, full-time, immersive school in New York for becoming a better programmer. Participants come from around the world to spend 12 weeks writing code and growing as programmers. Three sessions are run each year, with one in the summer.

Hacker School is largely unstructured, self-directed, and project-based with optional activities and structure: reading groups, mini workshops and seminars, weekly dinners and talks, group presentations, and more.

The program is tuition-free, but participants are responsible for their own living expenses. Some aid is available, including more than $150,000 from Google for need-based grants for female programmers to come to Hacker School. For more information and to apply, see the Hacker School site.

The inaugural hackUMBC hackathon was a smashing success!

Held in the UMBC Skylight Room from 7:00pm Friday to 7:00pm Saturday this past weekend, UMBC’s first-ever hackathon was open to all UMBC students of any skill level, from innovators and explorers to designers and hardcore coders. Its purpose was to allow students to mingle and collaborate for 24 continuous hours of community exploration to grow technology projects from scratch while expanding their connections to other students, industry leaders, and faculty. Admission was free and attracted students from across the UMBC campus community, including CS, CE, EE, IS, Biology, Biotechnology, Math, Physics, and Media Studies.

The term ‘hackathon’ hearkens back to the original meaning of “hacker” and “hacking” in early Internet history — namely, to “hack together (create) something quickly” instead of their current interpretations typically referring to illegal cybersecurity activities.

The theme for hackUMBC 2013 was “Hacking to Improve Campus Life” with the goal of ‘hacking together’ any sort of hardware or software project that helps students, teachers, or schools. Accordingly, projects developed during the event included a textbook resale service, realtime intelligent parking space sensors, Peoplesoft interface refinements, and mobile apps to help UMBC students network, socialize, and monitor class schedules, among many others.

Throughout the event, volunteer mentors from UMBC and local industry circulated amongst the teams to offer advice and guidance on their efforts, including how to successfully ‘pitch’ their products to the judges.

UMBC President Freeman Hrabowski joined the festivities early Friday evening to offer words of encouragement and motivation for the nearly 100 UMBC students competing in this innovative and highly charged event.

hackUMBC was conceived by CSEE students Perry Ogwuche and Randi Williams following their summer experience as fellows at CODE2040. Assisting in the effort was Prajit Kumar Das, CS PhD student and president of UMBC’s ACM chapter, and Alexander Morrow, a senior CS student and president of UMBC’s Cryptocurrency Club. CSEE’s Dr. Rick Forno served as faculty advisor to the event.

Projects were evaluated by several faculty and staff judges based on creativity, technical difficulty, polish, relevance, and usefulness. More than $2500 in prizes were awarded!

Second Place: Erill Labs (Robert Forder, Talmo Pereira, Patrick O’Neill, Sefa Kilic)

Third Place: Clever Source Solutions (Edward Mukasey, Ian Shefferman, Chinonso Ugwu)

hackUMBC Judges: Tim Oates, Rick Forno, Wesley Griffin, Dan Hood, Shawn Lupoli, Valerie Thomas, Geoffrey Weiss, and Ashwinkumar Ganesan.

hackUMBC was sponsored by Northrop Grumman, the UMBC Department of Computer Science and Electrical Engineering, ClearEdge IT Solutions, Independent Security Evaluators, Next Century Corporation, TriTech Systems, Github, CODE2040, the UMBC BWTech Cync Program, and the UMBC Alex Brown Center.

More information can be found at the hackUMBC page.

UMBC’s ACM student chapter has a new website that will be used to announce its activities and events as well as news about computing related opportunities and resources. The chapter is open to both undergraduate and graduate students interested in computing from all majors. Joining is free and is a great way to meet other students interested in computing and to participate in activities that will help you grow as a professional.

ACM, the Association for Computing Machinery, is the the world’s largest educational and scientific computing society. It provides members with resources that advance computing both as a science and a profession. UMBC’s chapter meetings are open to all undergraduate and graduate students of any major. While you do not need to join ACM to be a part of the local chapter, the annual membership dues for students is only $19, heavily discounted from the non-student rate. See the ACM site for more information on student membership and its benefits.

For more information contact us at acmofficers AT lists.umbc.edu.

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.

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.

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.