\documentclass[11pt]{article}
\usepackage[letterpaper, left=1in, top=1in, bottom=1in, right=1in]{geometry}
\usepackage{verbatim}
\setlength{\parindent}{0in}
\pagestyle{empty}
\begin{document}
\vspace{\fill}
\begin{center}\LARGE
\textsc{Computer Science}
\par
\textsc{Seminar}
\end{center}
\vspace{\fill}
\begin{center}\LARGE
\textit{Integer and Rational Two-Person Games}
\end{center}
\vspace{\fill}
\begin{center}\Large
K. Subramani\par
West Virginia University
\end{center}
\vspace{\fill}
\textbf{Abstract:} In this talk, I shall introduce two mathematical programming models,
viz., Quantified Linear Programming and Quantified Integer Programming.
Quantified Linear Programming is a generalization of traditional  linear programming
from the logical perspective. In traditional linear programming, we are
given a system of linear inequalities, say $A x \le b$ and asked  whether the
polyhedron defined by these inequalities is empty. In Quantified Linear
Programming, you are given a polytope $A[x, y] \le b$ and a quantifier
specification $Q(x,y)$. The question then is whether the specification
has a model. Quantified Integer Programming extends Integer Programming
similarly.
     Both these models have a number of applications, especially in
capturing requirements in embedded systems. We shall present some
of our results on these two topics.\vspace{\fill}
\begin{center}\Large
Friday, November 16, 2007, 4:00 pm\par
Mathematics and Science Center: W201
\end{center}
\vspace{\fill}
\begin{center}\Large

\end{center}
\vspace{\fill}
\begin{center}\LARGE
\textsc{Mathematics and Computer Science}\par
\textsc{Emory University}
\end{center}
\end{document}