Computer Science Events and Seminars

Spring 2015 Computer Science and Entrepreneurship Seminars

Cryptanalysis of Symmetric Key Primitives: Trends and Active Efforts
Dr. Aleksandar Kircanski
Wednesday, February 18, 11:30 a.m.-12:30 p.m., Adams 208

Studies on Public Key Infrastructure (PKI)- Based Authentication Protocols
Dr. Kaiqi Xiong
Wednesday, February 25, 11:30 a.m.-12:30 p.m., Adams 208

Robust Framework for Building Trustworthy Systems
Dr. Manuel Rodriguez
Wednesday, March 25, 11:30 a.m.-12:30 p.m., Adams 208

Fall 2014 Computer Science and Entrepreneurship Seminar 

The Power of No

Presented by Dr. Peter F. Patel-Schneider
11:30-12:30 Wednesday, November 12th, 2014, Adams 200

Abstract: We like to think that most information is positive.  (Henry VIII is a king of England.  Joyce Frankenberg is an English actress.)  However, there is more information that is negative.  (Henry VIII did not marry Mary Boleyn.) The inability to produce and utilize negative information results in systems that cannot determine when positive information is incorrect and thus cannot be trusted.  (Henry VIII married Jane Seymour.  Joyce Frankenberg is better known as Jane Seymour.  Joyce Frankenberg married Henry VIII.) Sometimes we can circumscribe information, and thereby produce negative information from lack of positive information.  This is usually the case in database applications.  Often our information is incomplete so we cannot determine negative information from lack of positive information and we need other means to determine negative information.  (People who were not alive at the same time cannot have married.  Henry VIII died in 1547. Joyce Frankenberg was born in 1951.) I will describe several ways of determining negative information, from simple disjointness between classes through to expressive logics and discuss some of their advantages and some of their problems.

Dr. Peter F. Patel-Schneider received his Ph. D. in Computer Science from the University of Toronto in 1987.  From 1983 to 1988 he was in the Fairchild Laboratory for Artificial Intelligence Research and Schlumberger Palo Alto Research.  Peter then joined Bell Laboratories and remained
there until 2012 when he joined the NLU and AI Research Laboratory at Nuance Communications. Peter's research interests center on representing large-scale knowledge and information, particularly taking large amounts of data and turning it into knowledge.  Peter has made long-term contributions to description and ontology logics, particularly the W3C OWL Web Ontology Language.  He developed much of OWL and its predecessor DAML+OIL, as well as SWRL, the Semantic Web Rule Language, and RDF, the W3C language for representing data in the Semantic Web. Peter has recently been working on extracting semantic information from data sources, allowing data to be more easily integrated into the Semantic Web. He has also been investigating how to bridge the gap between natural language and data.


Presented by Dani Horowitz
CEO of DaniWeb LLC and DaniPad LLC
and Hofstra CS Alumni

11:30AM - 12:30PM Wednesday, October 22, 2014

Adams 208

Dani Horowitz began at Hofstra University in 2000, pursuing a B.S. in Computer Science with a minor in Business Computer Information Systems. In February 2002, during her sophomore year, she started the - an IT discussion community as a hobby project. She turned it into a fulltime business in December 2005 upon her college graduation. Today, after twelve years, it has developed into a thriving online community of over one
million IT professionals and ten million pageviews per month, making it not only one of the largest social media websites in its niche, but one of the largest publications on the web to date.

Dani Horowitz will be giving an interactive talk about what encouraged her to create DaniWeb, how she grew the community early on, how she began to earn a revenue stream, and the biggest hurdles and challenges along
the way.

Spring 2013 Student Research Presentation

1:30PM - 3:00PM Friday, May 10th, 2013

Adams 018

Kenneth Salomon, Cynthia Cheng, Stephen Cohen, and Alex Rosenberg presented a wide variety of interesting projects in database construction, web application development, web based text mining, and binary instrumentation for web security. Some presentation slides can be found in the following.

(1) Cynthia Cheng, "Binary Instrumentation of Apache Server to Cluster Malicoius Attacks".

(2) Stephen Cohen, "Web Based Mining and 3D Rendering of Knowledge Structure".

Computer Science: Spring 2013 Student Research Presentation

Spring 2013 Computing Entrepreneurship Evening

5:00PM - 8:00PM Thursday, May 9th, 2013

Organized by the Computer Science Department

Funded by NSF CPATH grant -TI grant 0829641/0829656 and Dean of HCLAS

The Computing Entrepreneurship Evening is a forum for CS/CE students to present their entrepreneurial ideas and to interact with local entrepreneurs. Students can enter the business plan competition and present their ideas. A jury formed by local entrepreneurs will announce three award prizes.


Computer Science: Spring 2013 Computing Entrepreneurship Evening

Fall 2012 Student Research Presentation

11:30AM - 12:45M Wednesday, December 5th, 2012

12:30PM -  1:45M Friday, December 14th, 2012

Adams 018

(3) Diego Da Silva, Matheus Finatti, , Vinicio Merio, Bruno Melo: ALOAS: Adaptive Outcome Assessment System

(4) Diego Da Silva, Matheus Finatti, , Vinicio Merio, Bruno Melo: POINTER: an Intrusion Detection System

Fall 2012 Entrepreneurship Seminar

11:30AM - 12:30PM Wednesday, October 24th, 2012

Adams 200

Mike Seiman, CEO and co-founder CPX Interactive, Hofstra CS Alumnus

Short-bio: Mike Seiman is the CEO & Chairman of CPX Interactive, a global digital advertising company that he co-founded while still a college student at Hofstra University in the early 2000's. The company has grown quickly and is now a major player within the crowded online advertising landscape, serving over 90 billion ad impressions in more than 65 countries every month. CPX Interactive continues the rapid growth that led to its inclusion on Inc. Magazine’s list of fastest growing privately held advertising/marketing companies in 2008 and 2009. Mike was selected as a semi-finalist in Ernst & Young's Entrepreneur of the Year initiative in both 2009 and 2010.

Fall 2012 Research Seminar

11:30AM-12:30PM Wednesday, October 10th, 2012

Adams 200

Titla: Recursion, Algebra, Fractals: What Does All This Have To Do With Computer Science?

Dr Murray Elder, University of Newcastle 

Abstract: In this talk I will give a short, and hopefully  accessible, introduction to self-similar groups.  I will emphasize connections with  (theoretical) computer science, including binary trees, automata,  decision problems and polynomial time algorithms. Self-similar groups are a fascinating area of current mathematical research.

Bio: Murray Elder is an ARC Future Fellow at The University of  Newcastle, Australia. He did a PhD at The University of Melbourne  working with Walter Neumann on automatic groups and geometric group  theory, and since then has held several post-doc and lecturing  positions in the US, Scotland, and Australia. His research interests  include formal languages and automata, geometric group theory,  computation and experimental mathematics, complexity and computability, and enumerative combinatorics.

Spring 2012 Computer Science Department UG Honors Thesis Defense

10:30AM – 1:00PM  Friday, May 18th, 2012
Adams 018

Three undergraduate seniors have won departmental honors. Congratulations!

Mike Bantegui, Efficient solution of the n-body problem

Lorrae Famiglietti, JuxtaPrism and Color Management

Final product:

Computing Entrepreneurship Evening & Business Plan Competition

5:00 – 8:00 pm Thursday, May 10th, 2012
Room SC 143
(Student Center)

Organized by the Computer Science Department

Funded by NSF CPATH grant -TI grant 0829641/0829656 and Dean of HCLAS

The Computing Entrepreneurship Evening is a forum for CS/CE students to present their entrepreneurial ideas and to interact with local entrepreneurs. Students can enter the business plan competition and present their ideas. A jury formed by local entrepreneurs will three award prizes (1st prize $250, 2nd prize $150 and 3rd prize $100).


To enter the business plan competition please email your Executive Summary (max. 2 pages) to by May 8th

Computing Entrepreneurship Evening & Business Plan Competition - May 10th, 2012

Spring'12 Computer Science Department Student Research Presentation Day

Wednesday, May 9
11:30-12:45PM. Adams 200.

Listen to your peers about their experiences in internship, independent study, and research!

Food and refreshments will be served.

Spring'12 Computer Science Department Student Research Presentation Day

Computational Psycholinguistics: A brief history and a 'triggering' case study

William Gregory Sakas
City University of New York
April 18, 11:30-12:30

In the early 1990's, success in speech recognition by IBM's research group spurred the so-called "statistical revolution" in computational linguistics, which put to the wayside most all linguistic theory and advocated instead for a purely machine learning approach to language. The many engineering successes of the statistical revolution amplified debate over core aspects of linguistic and psycholinguistic theory: Perhaps language is fundamentally a statistical phenomenon contra to generative linguistic theory which posits a distinctly human, innately endowed Universal Grammar .

In this talk I will briefly review the relationship between computational and theoretical  linguistics from an historical perspective, and then present a project from our research group which addresses the feasibility of 'triggering' as a mechanism of language acquisition. Triggering involves an encounter by the learner of a single language phenomenon (e.g., a preposition separated from its object) which provides reliable evidence for some underlying structural aspect of the language being acquired (e.g., preposition stranding). For triggering to be a viable explanation of human language acquisition, triggers must exist for all structural aspects of all human languages.  We approach this question by studying an artificial domain of 3,072 languages computationally generated in the Principles and Parameters framework. Through careful analysis, both linguistic and computational, we found that there are indeed sufficient triggers in the domain so that all 3,072 languages are learnable through a triggering process.

Triggering is the antithesis of statistical machine learning. This research turns the tables on recent computational approaches by employing computation not to question current linguistic theory but rather to support it.

  Bio: William Gregory Sakas earned his doctoral degree from CUNY and is currently an associate professor of computer science at Hunter College. His research focuses on developing computational methods applied to language which both borrow from, and inform linguistic and psycholinguistic research. He also holds appointments on both the Computer Science and Linguistics doctoral faculties at the CUNY Graduate Center where he is the founder and current director of the Computational Linguistics Masters and Doctoral Certificate Program.



Challenges in Computational Phylogenetics

Katherine St. John
City University of New York
March 21, 11:30-12:30

Phylogenies, or evolutionary histories, play a central role in modern biology, illustrating the interrelationships between species, and also aiding the prediction of structural, physiological, and biochemical properties. The reconstruction of the underlying evolutionary history from a set of morphological characters or biomolecular sequences is difficult since the optimality criteria favored by biologists are NP-hard, and the space of possible answers is huge. The number of possible phylogenetic trees for n taxa is (2n − 5)!!. Due to the hardness and the large number of possible answers, clever searching techniques and heuristics are used to estimate the underlying tree. We explore the underlying space of trees, under different metrics, in particular the nearest-neighbor-interchange (NNI), subtree-prune-and-regraft (SPR), tree-bisection-and-reconnection (TBR), and Robinson-Foulds (RF) distances.

  Bio: Katherine St. John earned her doctoral degree from UCLA and did postdoctoral work at U. Pennsylvania and U. Texas.  Her research focuses on trees and computation. She is a professor of mathematics and computer science at Lehman College of the City University of New York.  She also holds appointments to the graduate faculty of computer science and anthropology at the Graduate Center of the City University of New York, as well as a visiting scholar at the American Museum of Natural History.

EMR’s 101: An introduction to the medical and programming aspects of electronic medical records.

Aaron J. Gindea 
Clinical Associate Professor of Medicine 
Hofstra North Shore LIJ School of Medicine  
February 15, 11:30-12:30 

This talk will cover the following topics: Understanding the work flow of a doctor's office;  Types of data generated in a medical interaction; Resistance by physicians to accepting EMR; Criteria for certifying EMR's; Client/server vs. cloud;  HIPAA Health Insurance Portability and Accountability Act of 1996 (HIPAA);  HITECH (government mandates for electronic medical records)-Health Information Technology for Economic and Clinical Health  .

  Bio: Dr. Gindea, is a graduate of the University of Pennsylvania where he majored in biology but spent a good deal of his spare time as the tech guy in the computer room at the engineering school.  He went on to NYU School of Medicine where he earned his medical degree in 1982.  After completing a medical residency and cardiology fellowship at NYU, he established a private practice. During that time, he was involved with the academic program at NYU,  authored or coauthored over 20 clinical papers.   Early in his clinical practice, he realized the importance of electronic medical records in providing efficient and comprehensive medical care.  Using a variety of dBase and Microsoft Visual Foxpro, he began writing (and is continuing to develop) an electronic medical records program for his practice which has grown as the needs and size of his practice have grown.  He is the President of  Sagacious MedWare, Inc., a company he created for the purpose of marketing his EMR and other electronic medically-related products.   


Human Decision and Assessment biases to justify a formal group decision process

Dr. Justus Riek
November 16, 2011
11:30 AM – 12:30 PM
Adams 200

Abstract: Research over the past 50 years has demonstrated that humans are often afflicted by information assessment and decision making biases. We will review some of the practical results of this fascinating research and then use the results  to argue for a formal group decision process in support of important organizational decisions. A number of interesting and useful bias-related repercussions will be discussed along with the high-level description of a group decision process that could be easily implemented at Hofstra University.

Bio: Dr. Justus Riek is an Adjunct Associate Professor in Computer Science at Hofstra. He received  PhD in Computer Science from Syracuse University and has spent the last 35 years working primarily for large aerospace companies in the areas of R&D and advanced technology. While working at a division of General Dynamics, he introduced the use of tool-supported group decision techniques into the corporation. The process was used to evaluate alternative engineering designs and to support the corporate IT Department in making funding decisions for over 500 internal projects.

Thomas Sanzone, CSC Alumnus Talk

Member of the Board of Trustees of Hofstra University
October 19, 2011
11:30 AM – 12:30 PM
Adams 200

Abstract: Mr. Sanzone will share his career and leadership experience, and will discuss the professional and global challenges graduates in computing face.

Bio: Mr. Thomas J. Sanzone is member of The Hofstra University Board of Trustees and the Advisory Board for future school of Engineering and Computer Science. He holds a Bachelors Degree in Computer Science from Hofstra University, 1982.  Tom Sanzone has extensive leadership and technology experience. He is executive vice president and chief administrative officer for Merrill Lynch & Co., Inc.

Positions he held include: Chief information officer of Credit Suisse, Chief information officer for Citigroup’s Corporate and Investment Bank, the Private Client Group, and the Global Transaction Services business.  Mr. Sanzone joined Salomon Brothers in 1984 as a programmer analyst in the mortgage trading systems area.  In 1991, he was appointed senior operating officer for fixed income and equity sales trading, and in 1996 was named managing director and head of global application development.  At Travelers/Salomon Smith Barney, he was responsible for capital markets development and was instrumental in merger-related systems consolidations for Nikko, Salomon Barney, Citicorp and others, from 1997 to 1998.

Computational Psychiatry: A New Discipline

Dr. Peter Erdi
Wednesday, November 2nd, 2011
Adams 200

Abstract: This emerging new discipline grew up from computational neuroscience. The lecture discusses the following topics:
- Computational Psychiatry: Do We (You) Need It?
- Neurological and Psychiatric Disorders as Dynamical Diseases
- The Schizophrenic Brain: Multiple Levels
- Schizophrenia as a Disconnection Syndrome
- Pathological Brain Rhythms and DynamicaL Neuropharmacology
- Take home message

Dr. Peter Erdi serves at the Henry R. Luce Professor of Complex Systems Studies, at Kalamazoo College, Kalamazoo, MI and the head of the Dept. Biophysics, KFKI Research Institute for Particle and Nuclear Physics of the Hungarian Academy of Science, Budapest. He is also the co-director of the Budapest Semester in Cognitive Science study abroad program.

Major books:
1. Péter Érdi and János Tóth: Mathematical Models of Chemical Reactions: Theory and Applications of Deterministic and Stochastic Models. Princeton University Press, 1989.
2. Michael A Arbib, Péter Érdi and János Szentágothai: Neural Organization: Structure, Function, and Dynamics. The MIT Press, 1997.
3. Péter Érdi: Complexity Explained. Springer, 2007

Benefits of Becoming a IEEE Computer Science Society Member

Metodi Filipov - October 26, 2011