1\expandafter\def\csname ver@pdfx.sty\endcsname{2019/02/27}\expandafter\def\csname opt@pdfx.sty\endcsname{a-1b}\AddToHook{package/accsupp/before}{\RequirePackage[hidelinks]{hyperref}}
2\expandafter\def\csname ver@simpleicons.sty\endcsname{}
3\documentclass[10pt,letterpaper]{altacv}
4\geometry{left=1.25cm,right=1.25cm,top=1.5cm,bottom=1.5cm,columnsep=1.2cm}
5\usepackage{paracol}
6\setmainfont{Lato-Reg}[Path=fonts/lato/, Extension=.ttf, BoldFont=Lato-Bol, ItalicFont=Lato-RegIta, BoldItalicFont=Lato-BolIta]
7\setsansfont{Lato-Reg}[Path=fonts/lato/, Extension=.ttf, BoldFont=Lato-Bol, ItalicFont=Lato-RegIta, BoldItalicFont=Lato-BolIta]
8\renewcommand{\familydefault}{\sfdefault}
9\definecolor{SlateGrey}{HTML}{2E2E2E}
10\definecolor{LightGrey}{HTML}{666666}
11\definecolor{DarkPastelRed}{HTML}{450808}
12\definecolor{PastelRed}{HTML}{8F0D0D}
13\definecolor{GoldenEarth}{HTML}{E7D192}
14\colorlet{name}{black}
15\colorlet{tagline}{PastelRed}
16\colorlet{heading}{DarkPastelRed}
17\colorlet{headingrule}{GoldenEarth}
18\colorlet{subheading}{PastelRed}
19\colorlet{accent}{PastelRed}
20\colorlet{emphasis}{SlateGrey}
21\colorlet{body}{LightGrey}
22\renewcommand{\namefont}{\Huge\bfseries}
23\renewcommand{\personalinfofont}{\footnotesize}
24\renewcommand{\cvsectionfont}{\LARGE\bfseries}
25\renewcommand{\cvsubsectionfont}{\large\bfseries}
26\renewcommand{\cvItemMarker}{{\small\textbullet}}
27\renewcommand{\cvRatingMarker}{\faCircle}
28\begin{document}
29\name{Claude Elwood Shannon}
30\tagline{Mathematician, electrical engineer, cryptographer}
31\personalinfo{%
32 \location{Born April 30, 1916, Petoskey, Michigan; died February 24, 2001}
33}
34\makecvheader
35\columnratio{0.6}
36\begin{paracol}{2}
37\cvsection{Experience}
38\cvevent{Fire-control systems and cryptography}{Bell Labs}{Summer 1937; World War II and after}{}
39\begin{itemize}
40\item {}Signal-flow graphs, 1942.
41\item {}1945: fire-control data smoothing treated by analogy with separating a signal from noise, with Blackman and Bode.
42\item {}\textit{A Mathematical Theory of Cryptography}, 1945, published in 1949: the one-time pad is unbreakable, and any unbreakable system needs a key as long as the message, truly random, never reused and kept secret. Symmetric-key cryptography, including DES and AES, was built on this work.
43\item {}\textit{A Mathematical Theory of Communication}, 1948: information entropy as the measure of the information in a message; the term ``bit''. The theory was later used in the compact disc, the Internet and mobile telephony.
44\item {}The sampling theorem, under which telecommunications moved from analog to digital transmission from the 1960s; pulse-code modulation, with Bernard M. Oliver and John R. Pierce.
45\end{itemize}
46\divider
47\cvevent{Faculty, Research Laboratory of Electronics}{MIT}{1956 -- 1978}{}
48\divider
49\cvevent{National Research Fellow}{Institute for Advanced Study}{1940}{Princeton, New Jersey}
50\cvsection{Projects}
51\cvevent{Theseus}{with Betty Shannon}{1950}{}
52\begin{itemize}
53\item {}A mechanical mouse that found its way through a maze by trial and error and then went directly to the target from any place it had been before.
54\end{itemize}
55\cvevent{Dartmouth workshop}{with McCarthy, Minsky and Rochester}{1956}{}
56\begin{itemize}
57\item {}Co-organised; it is considered the founding event of artificial intelligence.
58\end{itemize}
59\switchcolumn
60\cvsection{Education}
61\cvevent{PhD, Mathematics}{MIT}{1940}{}
62\begin{itemize}
63\item {}\textit{An Algebra for Theoretical Genetics}; unpublished.
64\end{itemize}
65\cvevent{Master's degree, Electrical Engineering}{MIT}{1937}{}
66\begin{itemize}
67\item {}\textit{A Symbolic Analysis of Relay and Switching Circuits}: switching circuits that implement Boolean algebra. Digital circuit design moved from ad hoc methods to this theory.
68\end{itemize}
69\cvevent{Bachelor of Science, Electrical Engineering and Mathematics}{University of Michigan}{1932 -- 1936}{}
70\cvsection{Fields}
71\cvtag{Information theory}
72\cvtag{Cryptography}\\
73\cvtag{Boolean algebra}
74\cvtag{Switching circuits}\\
75\cvtag{Artificial intelligence}
76\end{paracol}
77\end{document}
78
CLAUDE ELWOOD SHANNON
Mathematician, electrical engineer, cryptographer
Born April 30, 1916, Petoskey, Michigan; died February 24, 2001
EXPERIENCE
EDUCATION
Fire-control systems and cryptography
PhD, Mathematics
Bell Labs
MIT
Summer 1937; World War II and after
1940
• Signal-flow graphs, 1942.
• An Algebra for Theoretical Genetics;
unpublished.
• 1945: fire-control data smoothing treated by analogy with
separating a signal from noise, with Blackman and Bode.
Master’s degree, Electrical Engineering
• A Mathematical Theory of Cryptography, 1945, published in 1949: the
MIT
one-time pad is unbreakable, and any unbreakable system needs a
1937
key as long as the message, truly random, never reused and kept
• A Symbolic Analysis of Relay and Switching
secret. Symmetric-key cryptography, including DES and AES, was
Circuits: switching circuits that implement
built on this work.
Boolean algebra. Digital circuit design
• A Mathematical Theory of Communication, 1948: information entropy
moved from ad hoc methods to this theory.
as the measure of the information in a message; the term “bit”. The
theory was later used in the compact disc, the Internet and mobile
Bachelor of Science, Electrical
telephony.
Engineering and Mathematics
• The sampling theorem, under which telecommunications moved
University of Michigan
from analog to digital transmission from the 1960s; pulse-code
1932 – 1936
modulation, with Bernard M. Oliver and John R. Pierce.
FIELDS
Faculty, Research Laboratory of Electronics
MIT
1956 – 1978
National Research Fellow
Institute for Advanced Study
1940 Princeton, New Jersey
PROJECTS
Theseus
with Betty Shannon
1950
• A mechanical mouse that found its way through a maze by trial and
error and then went directly to the target from any place it had been
before.
Dartmouth workshop
with McCarthy, Minsky and Rochester
1956
• Co-organised; it is considered the founding event of artificial
intelligence.