Securing Birth Certificate Documents with DNA Profiles

The MSEIP Grant Team (#P120A150063) presents

Securing Birth Certificate Documents with DNA Profiles

Securing Birth Certificate Documents with DNA Profiles 1

Keynote speaker: Dr. Ying Liu of St. Johns University

 

The birth certificate is a document used by a person to obtain identification and licensing documents throughout their lifetime. For identity verification, the birth certificate provides limited information to support a person’s claim of identity. Authentication to the birth certificate is strictly a matter of possession. DNA profiling is becoming a commodity analysis that can be done accurately in under two hours with little human intervention. The DNA profile is a superior biometric to add to a birth record because it is stable throughout a person’s life and beyond. Acceptability of universal DNA profiling will depend heavily on privacy and safety concerns. The U.S. FBI CODIS profile is used as a basis to discuss the effectiveness of DNA profiling and to provide a practical basis for a discussion of potential privacy and authenticity controls. It is important to note that adopting DNA profiles to improve document security should be done cautiously.

Dr. Ying Liu received his B.S. degree in Environmental Biology from Nanjing University, China. He received Masters degrees in Bioinformatics and Computer Science, and Ph.D. degree in Computer Science from the Georgia Institute of Technology. He is now a tenure-track Assistant Professor in the Division of Computer Science, Mathematics and Science, College of Professional Studies, St. John’s University. His research interests include data mining, text mining, big data analytics, bioinformatics, computational biology, and database system. He has published more than 50 peer-reviewed research papers in various journals and conferences. He has served as a program cochair/ conference co-chair and a program committee member for several international conferences/workshops. He is a lifetime member of the ACM.

 

All Welcome.

Turning Your Exercises into Games:
A Mid-Semester Workshop with What’s Your Game Plan?

Games and simulations are powerful tools for learning. In this boot camp brainstorm, BMCC’s Prof. Joe Bisz (English) and Prof. Kathleen Offenholley (Mathematics) break up professors and graduate students into design teams whose job is to enhance an exercise with the mechanics of popular board games. This workshop provides a fun introduction to the engagement and deep learning principles behind game-based learning pedagogy.

RSVP

Turning Your Exercises into Games:<br>A Mid-Semester Workshop with What’s Your Game Plan? 2

Mathematics and Physics Colloquium: Symmetric Class-0 Subgraphs and Forbidden Subgraphs

[icon name=”map-marker” class=”” unprefixed_class=””] Place: Namm 720
[icon name=”calendar” class=”” unprefixed_class=””] Date: Thursday October 22, 2015

[icon name=”clock-o” class=”” unprefixed_class=””] Time: 12:45 p.m.

Presented by Prof. Eugene Fiorini
Faculty and students are welcome, light refreshments will be served.

Abstract:
Competition graphs and graph pebbling are two examples of graph theoretical-type games played on a graph under well-defined conditions. In the case of graph pebbling, the pebbling number pi(G) of a graph G is the minimum number of pebbles necessary to guarantee that, regardless of distribution of pebbles and regardless of the target vertex, there exists a sequence of pebbling moves that results in placing a pebble on the target vertex. A class-0 graph is one in which the pebbling number is the order of the graph, pi(G)=|V(G)|. This talk will consider under what conditions the edge set of a graph G can be partitioned into k class-0 subgraphs, k a positive integer. Furthermore, suppose D is a simple digraph with vetex set V(D) and edge set E(D). The competition graph G(V(G),E(G)) of D is defined as a graph with vertex set V(G)=V(D) and edge vw in E(G) if and only if for some vertex u in V, there exist directed edges (u,v) and (u,w) in E(D). This talk will present some recent results on forbidden subgraphs of a family of competition graphs.

[icon name=”file-pdf-o” class=””] Click to view poster.