text:
\chapter{Standard Libraries}
\label{stdlibraries}

%% Note, this is used to generate stdmod.tex.  The bindings could be
%% extracted automatically from the document, but this lets us choose
%% the ordering and optionally format manually where needed.

This section lists the exports provided by the standard libraries.  The
libraries are factored so as to separate features which might not be
supported by all implementations, or which might be expensive to load.

The {\cf scheme} library prefix is used for all standard libraries, and
is reserved for use by future standards.

\textbf{Base Library}

The \texttt{(scheme base)} library exports many of the procedures and
syntax bindings that are traditionally associated with Scheme.
The division between the base library and the other standard libraries is
based on use, not on construction. In particular, some facilities that are
typically implemented as primitives by a compiler or the run-time system
rather than in terms of other standard procedures or syntax are
not part of the base library, but are defined in separate libraries.
By the same token, some exports of the base library are implementable
in terms of other exports.  They are redundant in the strict sense of
the word, but they capture common patterns of usage, and are therefore
provided as convenient abbreviations.

\begin{scheme}
{\cf *}                       {\cf +}
{\cf -}                       {\cf ...}
{\cf /}                       {\cf <}
{\cf <=}                      {\cf =}
{\cf =>}                      {\cf >}
{\cf >=}                      {\cf \_}
{\cf abs}                     {\cf and}
{\cf append}                  {\cf apply}
{\cf assoc}                   {\cf assq}
{\cf assv}                    {\cf begin}
{\cf binary-port?\ }           {\cf boolean=?}
{\cf boolean?\ }               {\cf bytevector}
{\cf bytevector-append}       {\cf bytevector-copy}
{\cf bytevector-copy!}        {\cf bytevector-length}
{\cf bytevector-u8-ref}       {\cf bytevector-u8-set!}
{\cf bytevector?\ }            {\cf caar}
{\cf cadr}
{\cf call-with-current-continuation}
{\cf call-with-port}          {\cf call-with-values}
{\cf call/cc}                 {\cf car}
{\cf case}                    {\cf cdar}
{\cf cddr}                    {\cf cdr}
{\cf ceiling}                 {\cf char->integer}
{\cf char-ready?\ }            {\cf char<=?}
{\cf char<?\ }                 {\cf char=?}
{\cf char>=?\ }                {\cf char>?}
{\cf char?\ }                  {\cf close-input-port}
{\cf close-output-port}       {\cf close-port}
{\cf complex?\ }               {\cf cond}
{\cf cond-expand}             {\cf cons}
{\cf current-error-port}      {\cf current-input-port}
{\cf current-output-port}     {\cf define}
{\cf define-record-type}      {\cf define-syntax}
{\cf define-values}           {\cf denominator}
{\cf do}                      {\cf dynamic-wind}
{\cf else}                    {\cf eof-object}
{\cf eof-object?\ }            {\cf eq?}
{\cf equal?\ }                 {\cf eqv?}
{\cf error}                   {\cf error-object-irritants}
{\cf error-object-message}    {\cf error-object?}
{\cf even?\ }                  {\cf exact}
{\cf exact-integer-sqrt}      {\cf exact-integer?}
{\cf exact?\ }                 {\cf expt}
{\cf features}                {\cf file-error?}
{\cf floor}                   {\cf floor-quotient}
{\cf floor-remainder}         {\cf floor/}
{\cf flush-output-port}       {\cf for-each}
{\cf gcd}                     {\cf get-output-bytevector}
{\cf get-output-string}       {\cf guard}
{\cf if}                      {\cf include}
{\cf include-ci}              {\cf inexact}
{\cf inexact?\ }               {\cf input-port-open?}
{\cf input-port?\ }            {\cf integer->char}
{\cf integer?\ }               {\cf lambda}
{\cf lcm}                     {\cf length}
{\cf let}                     {\cf let*}
{\cf let*-values}             {\cf let-syntax}
{\cf let-values}              {\cf letrec}
{\cf letrec*}                 {\cf letrec-syntax}
{\cf list}                    {\cf list->string}
{\cf list->vector}            {\cf list-copy}
{\cf list-ref}                {\cf list-set!}
{\cf list-tail}               {\cf list?}
{\cf make-bytevector}         {\cf make-list}
{\cf make-parameter}          {\cf make-string}
{\cf make-vector}             {\cf map}
{\cf max}                     {\cf member}
{\cf memq}                    {\cf memv}
{\cf min}                     {\cf modulo}
{\cf negative?\ }              {\cf newline}
{\cf not}                     {\cf null?}
{\cf number->string}          {\cf number?}
{\cf numerator}               {\cf odd?}
{\cf open-input-bytevector}   {\cf open-input-string}
{\cf open-output-bytevector}  {\cf open-output-string}
{\cf or}                      {\cf output-port-open?}
{\cf output-port?\ }           {\cf pair?}
{\cf parameterize}            {\cf peek-char}
{\cf peek-u8}                 {\cf port?}
{\cf positive?\ }              {\cf procedure?}
{\cf quasiquote}              {\cf quote}
{\cf quotient}                {\cf raise}
{\cf raise-continuable}       {\cf rational?}
{\cf rationalize}             {\cf read-bytevector}
{\cf read-bytevector!}        {\cf read-char}
{\cf read-error?\ }            {\cf read-line}
{\cf read-string}             {\cf read-u8}
{\cf real?\ }                  {\cf remainder}
{\cf reverse}                 {\cf round}
{\cf set!}                    {\cf set-car!}
{\cf set-cdr!}                {\cf square}
{\cf string}                  {\cf string->list}
{\cf string->number}          {\cf string->symbol}
{\cf string->utf8}            {\cf string->vector}
{\cf string-append}           {\cf string-copy}
{\cf string-copy!}            {\cf string-fill!}
{\cf string-for-each}         {\cf string-length}
{\cf string-map}              {\cf string-ref}
{\cf string-set!}             {\cf string<=?}
{\cf string<?\ }               {\cf string=?}
{\cf string>=?\ }              {\cf string>?}
{\cf string?\ }                {\cf substring}
{\cf symbol->string}          {\cf symbol=?}
{\cf symbol?\ }                {\cf syntax-error}
{\cf syntax-rules}            {\cf textual-port?}
{\cf truncate}                {\cf truncate-quotient}
{\cf truncate-remainder}      {\cf truncate/}
{\cf u8-ready?\ }              {\cf unless}
{\cf unquote}                 {\cf unquote-splicing}
{\cf utf8->string}            {\cf values}
{\cf vector}                  {\cf vector->list}
{\cf vector->string}          {\cf vector-append}
{\cf vector-copy}             {\cf vector-copy!}
{\cf vector-fill!}            {\cf vector-for-each}
{\cf vector-length}           {\cf vector-map}
{\cf vector-ref}              {\cf vector-set!}
{\cf vector?\ }                {\cf when}
{\cf with-exception-handler}  {\cf write-bytevector}
{\cf write-char}              {\cf write-string}
{\cf write-u8}                {\cf zero?}
\end{scheme}

\textbf{Case-Lambda Library}

The \texttt{(scheme case-lambda)} library exports the {\cf case-lambda}
syntax.

\begin{scheme}
{\cf case-lambda}
\end{scheme}

\textbf{Char Library}

The \texttt{(scheme char)} library provides the procedures for dealing with
characters that involve potentially large tables when supporting all of Unicode.

\begin{scheme}
{\cf char-alphabetic?\ }       {\cf char-ci<=?}
{\cf char-ci<?\ }              {\cf char-ci=?}
{\cf char-ci>=?\ }             {\cf char-ci>?}
{\cf char-downcase}           {\cf char-foldcase}
{\cf char-lower-case?\ }       {\cf char-numeric?}
{\cf char-upcase}             {\cf char-upper-case?}
{\cf char-whitespace?\ }       {\cf digit-value}
{\cf string-ci<=?\ }           {\cf string-ci<?}
{\cf string-ci=?\ }            {\cf string-ci>=?}
{\cf string-ci>?\ }            {\cf string-downcase}
{\cf string-foldcase}         {\cf string-upcase}
\end{scheme}

\textbf{Complex Library}

The \texttt{(scheme complex)} library exports procedures which are
typically only useful with non-real numbers.

\begin{scheme}
{\cf angle}                   {\cf imag-part}
{\cf magnitude}               {\cf make-polar}
{\cf make-rectangular}        {\cf real-part}
\end{scheme}

\textbf{CxR Library}

The \texttt{(scheme cxr)} library exports twenty-four procedures which
are the compositions of from three to four {\cf car} and {\cf cdr}
operations.  For example {\cf caddar} could be defined by

\begin{scheme}
(define caddar
  (lambda (x) (car (cdr (cdr (car x)))))){\rm.}%
\end{scheme}

The procedures {\cf car} and {\cf cdr} themselves and the four
two-level compositions are included in the base library.  See
section~\ref{listsection}.

\begin{scheme}
{\cf caaaar}                  {\cf caaadr}
{\cf caaar}                   {\cf caadar}
{\cf caaddr}                  {\cf caadr}
{\cf cadaar}                  {\cf cadadr}
{\cf cadar}                   {\cf caddar}
{\cf cadddr}                  {\cf caddr}
{\cf cdaaar}                  {\cf cdaadr}
{\cf cdaar}                   {\cf cdadar}
{\cf cdaddr}                  {\cf cdadr}
{\cf cddaar}                  {\cf cddadr}
{\cf cddar}                   {\cf cdddar}
{\cf cddddr}                  {\cf cdddr}
\end{scheme}

\textbf{Eval Library}

The \texttt{(scheme eval)} library exports procedures for evaluating Scheme
data as programs.

\begin{scheme}
{\cf environment}             {\cf eval}
\end{scheme}

\textbf{File Library}

The \texttt{(scheme file)} library provides procedures for accessing
files.

\begin{scheme}
{\cf call-with-input-file}    {\cf call-with-output-file}
{\cf delete-file}             {\cf file-exists?}
{\cf open-binary-input-file}  {\cf open-binary-output-file}
{\cf open-input-file}         {\cf open-output-file}
{\cf with-input-from-file}    {\cf with-output-to-file}
\end{scheme}

\textbf{Inexact Library}

The \texttt{(scheme inexact)} library exports procedures which are
typically only useful with inexact values.

\begin{scheme}
{\cf acos}                    {\cf asin}
{\cf atan}                    {\cf cos}
{\cf exp}                     {\cf finite?}
{\cf infinite?\ }              {\cf log}
{\cf nan?\ }                   {\cf sin}
{\cf sqrt}                    {\cf tan}
\end{scheme}

\textbf{Lazy Library}

The \texttt{(scheme lazy)} library exports procedures and syntax keywords for lazy evaluation.

\begin{scheme}
{\cf delay}                   {\cf delay-force}
{\cf force}                   {\cf make-promise}
{\cf promise?}
\end{scheme}

\textbf{Load Library}

The \texttt{(scheme load)} library exports procedures for loading
Scheme expressions from files.

\begin{scheme}
{\cf load}
\end{scheme}

\textbf{Process-Context Library}

The \texttt{(scheme process-context)} library exports procedures for
accessing with the program's calling context.

\begin{scheme}
{\cf command-line}            {\cf emergency-exit}
{\cf exit}
{\cf get-environment-variable}
{\cf get-environment-variables}
\end{scheme}

\textbf{Read Library}

The \texttt{(scheme read)} library provides procedures for reading
Scheme objects.

\begin{scheme}
{\cf read}
\end{scheme}

\textbf{Repl Library}

The \texttt{(scheme repl)} library exports the {\cf
  interaction-environment} procedure.

\begin{scheme}
{\cf interaction-environment}
\end{scheme}

\textbf{Time Library}

The \texttt{(scheme time)} library provides access to time-related values.

\begin{scheme}
{\cf current-jiffy}           {\cf current-second}
{\cf jiffies-per-second}
\end{scheme}

\textbf{Write Library}

The \texttt{(scheme write)} library provides procedures for writing
Scheme objects.

\begin{scheme}
{\cf display}                 {\cf write}
{\cf write-shared}            {\cf write-simple}
\end{scheme}

\textbf{R5RS Library}

The \texttt{(scheme r5rs)} library provides the identifiers defined by
\rfivers, except that
{\cf transcript-on} and {\cf transcript-off} are not present.
Note that
the {\cf exact} and {\cf inexact} procedures appear under their \rfivers\ names
{\cf inexact->exact} and {\cf exact->inexact} respectively.
However, if an implementation does not provide a particular library such as the
complex library, the corresponding identifiers will not appear in this
library either.

\begin{scheme}
{\cf *}                       {\cf +}
{\cf -}                       {\cf /}
{\cf <}                       {\cf <=}
{\cf =}                       {\cf >}
{\cf >=}                      {\cf abs}
{\cf acos}                    {\cf and}
{\cf angle}                   {\cf append}
{\cf apply}                   {\cf asin}
{\cf assoc}                   {\cf assq}
{\cf assv}                    {\cf atan}
{\cf begin}                   {\cf boolean?}
{\cf caaaar}                  {\cf caaadr}
{\cf caaar}                   {\cf caadar}
{\cf caaddr}                  {\cf caadr}
{\cf caar}                    {\cf cadaar}
{\cf cadadr}                  {\cf cadar}
{\cf caddar}                  {\cf cadddr}
{\cf caddr}                   {\cf cadr}
{\cf call-with-current-continuation}
{\cf call-with-input-file}    {\cf call-with-output-file}
{\cf call-with-values}        {\cf car}
{\cf case}                    {\cf cdaaar}
{\cf cdaadr}                  {\cf cdaar}
{\cf cdadar}                  {\cf cdaddr}
{\cf cdadr}                   {\cf cdar}
{\cf cddaar}                  {\cf cddadr}
{\cf cddar}                   {\cf cdddar}
{\cf cddddr}                  {\cf cdddr}
{\cf cddr}                    {\cf cdr}
{\cf ceiling}                 {\cf char->integer}
{\cf char-alphabetic?\ }       {\cf char-ci<=?}
{\cf char-ci<?\ }              {\cf char-ci=?}
{\cf char-ci>=?\ }             {\cf char-ci>?}
{\cf char-downcase}           {\cf char-lower-case?}
{\cf char-numeric?\ }          {\cf char-ready?}
{\cf char-upcase}             {\cf char-upper-case?}
{\cf char-whitespace?\ }       {\cf char<=?}
{\cf char<?\ }                 {\cf char=?}
{\cf char>=?\ }                {\cf char>?}
{\cf char?\ }                  {\cf close-input-port}
{\cf close-output-port}       {\cf complex?}
{\cf cond}                    {\cf cons}
{\cf cos}                     {\cf current-input-port}
{\cf current-output-port}     {\cf define}
{\cf define-syntax}           {\cf delay}
{\cf denominator}             {\cf display}
{\cf do}                      {\cf dynamic-wind}
{\cf eof-object?\ }            {\cf eq?}
{\cf equal?\ }                 {\cf eqv?}
{\cf eval}                    {\cf even?}
{\cf exact->inexact}          {\cf exact?}
{\cf exp}                     {\cf expt}
{\cf floor}                   {\cf for-each}
{\cf force}                   {\cf gcd}
{\cf if}                      {\cf imag-part}
{\cf inexact->exact}          {\cf inexact?}
{\cf input-port?\ }            {\cf integer->char}
{\cf integer?\ }               {\cf interaction-environment}
{\cf lambda}                  {\cf lcm}
{\cf length}                  {\cf let}
{\cf let*}                    {\cf let-syntax}
{\cf letrec}                  {\cf letrec-syntax}
{\cf list}                    {\cf list->string}
{\cf list->vector}            {\cf list-ref}
{\cf list-tail}               {\cf list?}
{\cf load}                    {\cf log}
{\cf magnitude}               {\cf make-polar}
{\cf make-rectangular}        {\cf make-string}
{\cf make-vector}             {\cf map}
{\cf max}                     {\cf member}
{\cf memq}                    {\cf memv}
{\cf min}                     {\cf modulo}
{\cf negative?\ }              {\cf newline}
{\cf not}                     {\cf null-environment}
{\cf null?\ }                  {\cf number->string}
{\cf number?\ }                {\cf numerator}
{\cf odd?\ }                   {\cf open-input-file}
{\cf open-output-file}        {\cf or}
{\cf output-port?\ }           {\cf pair?}
{\cf peek-char}               {\cf positive?}
{\cf procedure?\ }             {\cf quasiquote}
{\cf quote}                   {\cf quotient}
{\cf rational?\ }              {\cf rationalize}
{\cf read}                    {\cf read-char}
{\cf real-part}               {\cf real?}
{\cf remainder}               {\cf reverse}
{\cf round}
{\cf scheme-report-environment}
{\cf set!}                    {\cf set-car!}
{\cf set-cdr!}                {\cf sin}
{\cf sqrt}                    {\cf string}
{\cf string->list}            {\cf string->number}
{\cf string->symbol}          {\cf string-append}
{\cf string-ci<=?\ }           {\cf string-ci<?}
{\cf string-ci=?\ }            {\cf string-ci>=?}
{\cf string-ci>?\ }            {\cf string-copy}
{\cf string-fill!}            {\cf string-length}
{\cf string-ref}              {\cf string-set!}
{\cf string<=?\ }              {\cf string<?}
{\cf string=?\ }               {\cf string>=?}
{\cf string>?\ }               {\cf string?}
{\cf substring}               {\cf symbol->string}
{\cf symbol?\ }                {\cf tan}
{\cf truncate}                {\cf values}
{\cf vector}                  {\cf vector->list}
{\cf vector-fill!}            {\cf vector-length}
{\cf vector-ref}              {\cf vector-set!}
{\cf vector?\ }                {\cf with-input-from-file}
{\cf with-output-to-file}     {\cf write}
{\cf write-char}              {\cf zero?}
\end{scheme}

max_stars_repo_name: schemedoc/scheme-rnrs-metadata

max_issues_repo_name: schemedoc/scheme-rnrs-metadata

max_forks_repo_name: schemedoc/scheme-rnrs-metadata


text:
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Deedy - One Page Two Column Resume
% LaTeX Template
% Version 1.2 (16/9/2014)
%
% Original author:
% Debarghya Das (http://debarghyadas.com)
%
% Original repository:
% https://github.com/deedydas/Deedy-Resume
%
% IMPORTANT: THIS TEMPLATE NEEDS TO BE COMPILED WITH XeLaTeX
%
% This template uses several fonts not included with Windows/Linux by
% default. If you get compilation errors saying a font is missing, find the line
% on which the font is used and either change it to a font included with your
% operating system or comment the line out to use the default font.
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% TODO:
% 1. Integrate biber/bibtex for article citation under publications.
% 2. Figure out a smoother way for the document to flow onto the next page.
% 3. Add styling information for a "Projects/Hacks" section.
% 4. Add location/address information
% 5. Merge OpenFont and MacFonts as a single sty with options.
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% CHANGELOG:
% v1.1:
% 1. Fixed several compilation bugs with \renewcommand
% 2. Got Open-source fonts (Windows/Linux support)
% 3. Added Last Updated
% 4. Move Title styling into .sty
% 5. Commented .sty file.
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Known Issues:
% 1. Overflows onto second page if any column's contents are more than the
% vertical limit
% 2. Hacky space on the first bullet point on the second column.
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\documentclass[]{deedy-resume-openfont}
\usepackage{fancyhdr}

\renewcommand{\baselinestretch}{1.4}
\pagestyle{fancy}
\fancyhf{}

\begin{document}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%     LAST UPDATED DATE
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\lastupdated

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%     TITLE NAME
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\namesection{Yan}{Xin}{ \urlstyle{same}\href{mailto:blindingend@foxmail.com}{blindingend@foxmail.com} | 131 6709 8676
}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%     COLUMN ONE
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\begin{minipage}[t]{0.3\textwidth}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%     EDUCATION
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\section{Education}
\sectionsep

\subsection{Shanghai Jiao Tong University}
\descript{BE in Software Engineering}
\location{2016.09-2020.09}
\descript{Chemistry and Chemical Engineering}
\location{2015.09-2016.09}
\sectionsep

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%     LINKS
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\section{Links}
\sectionsep
Github:// \href{https://github.com/Blindingend}{\bf Blindingend} \\
\sectionsep

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%     COURSEWORK
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\section{Courses}
\sectionsep
\subsection{UnderGraduate}
\textbf{Introduction to Computer System} \\
\textbf{Computer System Enginering} \\
Computer Graphics \\
Computer Vision \\
Web Developing \\
Principles of DB System  \\
\sectionsep

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%     SKILLS
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\section{Skills}
\sectionsep
\subsection{\textbf{Programming}}
\location{Over 3000 lines}
C/C++ \textbullet{} Javascript\\
\location{1000 - 3000 lines}
Java \textbullet{} Python \ \\
\location{Less than 1000 lines}
Shell  \\
\sectionsep

\subsection{\textbf{Frontend}}
\location{Knowledge}
React \textbullet{} Wepy \textbullet{} Vue \\

\subsection{Dev Tools}
\location{Familiar}
git \textbullet svn \textbullet ssh \\
\sectionsep

\subsection{Language}
CET 6   \\
\sectionsep

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%     COLUMN TWO
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\end{minipage}
\hfill
\begin{minipage}[t]{0.68\textwidth}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%     EXPERIENCE
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\section{Experience}
\sectionsep

\runsubsection{None}

\sectionsep

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%     RESEARCH
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\section{Projects}
\sectionsep

\runsubsection{\bf Simple File System based on YFS}
\descript{Developer}
\location{2018.9 - 2018.12}
\vspace{\topsep}
\begin{tightemize}
    \item Implement basic file system APIs such as GET, PUT, REMOVE, CREATE, etc.
    \item Adding a simple lock server to ensure the correctness of multi-client reading and writing
    \item Using the API of HDFS to increase fault tolerance
\end{tightemize}
\sectionsep

\runsubsection{\href{https://github.com/veiasai/Xmap}{\bf Xmap}}
\descript{Main Developer}
\location{2018.7 - 2018.8}
\begin{tightemize}
    \item Main developer, responsible for MiniProgram(Wepy) and Webpage(React) development
    \item User interface and interaction design
    \item Point-to-point(represented by neo4j) navigation Mini Program(WeChat applet)
\end{tightemize}
\sectionsep

\runsubsection{\bf iBook online bookstore}
\descript{Developer}
\location{2018.3 - 2018.6}
\begin{tightemize}
    \item Online bookstore web application
    \item frontend based on React
    \item using Spring Boot + Struts + Hibernate to build backend
    \item Manage data with Mysql and MongoDB Docker containers
\end{tightemize}
\sectionsep

\runsubsection{\bf Simple database based on Hash Table}
\descript{Developer}
\location{2017.7}
\begin{tightemize}
    \item Key-value database
    \item useing Hashtable to store the index file of the database
\end{tightemize}
\sectionsep

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%     OPEN SOURCE
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%     AWARDS
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\section{Awards}
\begin{tabular}{rll}
2018         & East China 3th Prize  & WeChat Mini Program Developing Competition \\
2017         & Honorable Mention  & MCM/ICM \\
\end{tabular}
\sectionsep

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%     PUBLICATIONS
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% \section{Publications}
% \renewcommand\refname{\vskip -1.5cm} % Couldn't get this working from the .cls file
% \bibliographystyle{abbrv}
% \bibliography{publications}
% \nocite{*}

\end{minipage}
\end{document}  \documentclass[]{article}

ext: tex

max_stars_repo_name: Blindingend/Deedy-Resume-for-Chinese

max_issues_repo_name: Blindingend/Deedy-Resume-for-Chinese

max_forks_repo_name: Blindingend/Deedy-Resume-for-Chinese


text:
\documentclass{article}

\usepackage{libertine}

\begin{document}

\section{The Frog King, or Iron Henry}

In olden times when wishing still helped one, there lived a king whose daughters were all beautiful, but the youngest was so beautiful that the sun itself, which has seen so much, was astonished whenever it shone in her face.  Close by the king's castle lay a great dark forest, and under an old lime-tree in the forest was a well, and when the day was very warm, the king's child went out into the forest and sat down by the side of the cool fountain, and when she was bored she took a golden ball, and threw it up on high and caught it, and this ball was her favorite plaything.

Now it so happened that on one occasion the princess's golden ball did not fall into the little hand which she was holding up for it, but on to the ground beyond, and rolled straight into the water.  The king's daughter followed it with her eyes, but it vanished, and the well was deep, so deep that the bottom could not be seen.  At this she began to cry, and cried louder and louder, and could not be comforted.  And as she thus lamented someone said to her, “What ails you, king's daughter?  You weep so that even a stone would show pity.”

She looked round to the side from whence the voice came, and saw a frog stretching forth its big, ugly head from the water.  “Ah, old water-splasher, is it you,” she said, “I am weeping for my golden ball, which has fallen into the well.”  “Be quiet, and do not weep,” answered the frog, “I can help you, but what will you give me if I bring your plaything up again?”  “Whatever you will have, dear frog,” said she, “My clothes, my pearls and jewels, and even the golden crown which I am wearing.”  The frog answered, “I do not care for your clothes, your pearls and jewels, nor for your golden crown, but if you will love me and let me be your companion and play-fellow, and sit by you at your little table, and eat off your little golden plate, and drink out of your little cup, and sleep in your little bed - if you will promise me this I will go down below, and bring you your golden ball up again.”

“Oh yes,” said she, “I promise you all you wish, if you will but bring me my ball back again.”  But she thought, “How the silly frog does talk.  All he does is to sit in the water with the other frogs, and croak.  He can be no companion to any human being.”

But the frog when he had received this promise, put his head into the water and sank down; and in a short while came swimmming up again with the ball in his mouth, and threw it on the grass.  The king's daughter was delighted to see her pretty plaything once more, and picked it up, and ran away with it.  “Wait, wait,” said the frog.  “Take me with you.  I can't run as you can.”  But what did it avail him to scream his croak, croak, after her, as loudly as he could.  She did not listen to it, but ran home and soon forgot the poor frog, who was forced to go back into his well again.

The next day when she had seated herself at table with the king and all the courtiers, and was eating from her little golden plate, something came creeping splish splash, splish splash, up the marble staircase, and when it had got to the top, it knocked at the door and cried, “Princess, youngest princess, open the door for me.”  She ran to see who was outside, but when she opened the door, there sat the frog in front of it.  Then she slammed the door to, in great haste, sat down to dinner again, and was quite frightened.  The king saw plainly that her heart was beating violently, and said, “My child, what are you so afraid of?  Is there perchance a giant outside who wants to carry you away?”  “Ah, no,” replied she.  “It is no giant but a disgusting frog.”

“What does a frog want with you?”  “Ah, dear father, yesterday as I was in the forest sitting by the well, playing, my golden ball fell into the water.  And because I cried so, the frog brought it out again for me, and because he so insisted, I promised him he should be my companion, but I never thought he would be able to come out of his water.  And now he is outside there, and wants to come in to me.”

In the meantime it knocked a second time, and cried, “Princess, youngest princess, open the door for me,  do you not know what you said to me yesterday by the cool waters of the well.  Princess, youngest princess,  open the door for me.”

Then said the king, “That which you have promised must you perform.  Go and let him in.”  She went and opened the door, and the frog hopped in and followed her, step by step, to her chair. There he sat and cried, “Lift me up beside you.”  She delayed, until at last the king commanded her to do it.  Once the frog was on the chair he wanted to be on the table, and when he was on the table he said, “Now, push your little golden plate nearer to me that we may eat together.”  She did this, but it was easy to see that she did not do it willingly.  The frog enjoyed what he ate, but almost every mouthful she took choked her.  At length he said, “I have eaten and am satisfied, now I am tired, carry me into your little room and make your little silken bed ready, and we will both lie down and go to sleep.”

The king's daughter began to cry, for she was afraid of the cold frog which she did not like to touch, and which was now to sleep in her pretty, clean little bed.  But the king grew angry and said, “He who helped you when you were in trouble ought not afterwards to be despised by you.”  So she took hold of the frog with two fingers, carried him upstairs, and put him in a corner, but when she was in bed he crept to her and said, “I am tired, I want to sleep as well as you, lift me up or I will tell your father.”  At this she was terribly angry, and took him up and threw him with all her might against the wall.  “Now, will you be quiet, odious frog,” said she.  But when he fell down he was no frog but a king's son with kind and beautiful eyes.  He by her father's will was now her dear companion and husband.  Then he told her how he had been bewitched by a wicked witch, and how no one could have delivered him from the well but herself, and that to-morrow they would go together into his kingdom.

Then they went to sleep, and next morning when the sun awoke them, a carriage came driving up with eight white horses, which had white ostrich feathers on their heads, and were harnessed with golden chains, and behind stood the young king's servant Faithful Henry. Faithful Henry had been so unhappy when his master was changed into a frog, that he had caused three iron bands to be laid round his heart, lest it should burst with grief and sadness.  The carriage was to conduct the young king into his kingdom.  Faithful Henry helped them both in, and placed himself behind again, and was full of joy because of this deliverance.  And when they had driven a part of the way the king's son heard a cracking behind him as if something had broken. So he turned round and cried, “Henry, the carriage is breaking.“ “No, master, it is not the carriage.  It is a band from my heart, which was put there in my great pain when you were a frog and imprisoned in the well.”  Again and once again while they were on their way something cracked, and each time the king's son thought the carriage was breaking, but it was only the bands which were springing from the heart of Faithful Henry because his master was set free and was happy.

\end{document}

max_stars_repo_name: speedata/examples

max_issues_repo_name: speedata/examples

max_forks_repo_name: speedata/examples


text:
\documentclass[12pt,a4paper]{article}

\usepackage[a4paper,text={16.5cm,25.2cm},centering]{geometry}
\usepackage{lmodern}
\usepackage{amssymb,amsmath}
\usepackage{bm}
\usepackage{graphicx}
\usepackage{microtype}
\usepackage{hyperref}
\setlength{\parindent}{0pt}
\setlength{\parskip}{1.2ex}

\hypersetup
       {   pdfauthor = { Marco Fasondini },
           pdftitle={ foo },
           colorlinks=TRUE,
           linkcolor=black,
           citecolor=blue,
           urlcolor=blue
       }

\usepackage{upquote}
\usepackage{listings}
\usepackage{xcolor}
\lstset{
    basicstyle=\ttfamily\footnotesize,
    upquote=true,
    breaklines=true,
    breakindent=0pt,
    keepspaces=true,
    showspaces=false,
    columns=fullflexible,
    showtabs=false,
    showstringspaces=false,
    escapeinside={(*@}{@*)},
    extendedchars=true,
}
\newcommand{\HLJLt}[1]{#1}
\newcommand{\HLJLw}[1]{#1}
\newcommand{\HLJLe}[1]{#1}
\newcommand{\HLJLeB}[1]{#1}
\newcommand{\HLJLo}[1]{#1}
\newcommand{\HLJLk}[1]{\textcolor[RGB]{148,91,176}{\textbf{#1}}}
\newcommand{\HLJLkc}[1]{\textcolor[RGB]{59,151,46}{\textit{#1}}}
\newcommand{\HLJLkd}[1]{\textcolor[RGB]{214,102,97}{\textit{#1}}}
\newcommand{\HLJLkn}[1]{\textcolor[RGB]{148,91,176}{\textbf{#1}}}
\newcommand{\HLJLkp}[1]{\textcolor[RGB]{148,91,176}{\textbf{#1}}}
\newcommand{\HLJLkr}[1]{\textcolor[RGB]{148,91,176}{\textbf{#1}}}
\newcommand{\HLJLkt}[1]{\textcolor[RGB]{148,91,176}{\textbf{#1}}}
\newcommand{\HLJLn}[1]{#1}
\newcommand{\HLJLna}[1]{#1}
\newcommand{\HLJLnb}[1]{#1}
\newcommand{\HLJLnbp}[1]{#1}
\newcommand{\HLJLnc}[1]{#1}
\newcommand{\HLJLncB}[1]{#1}
\newcommand{\HLJLnd}[1]{\textcolor[RGB]{214,102,97}{#1}}
\newcommand{\HLJLne}[1]{#1}
\newcommand{\HLJLneB}[1]{#1}
\newcommand{\HLJLnf}[1]{\textcolor[RGB]{66,102,213}{#1}}
\newcommand{\HLJLnfm}[1]{\textcolor[RGB]{66,102,213}{#1}}
\newcommand{\HLJLnp}[1]{#1}
\newcommand{\HLJLnl}[1]{#1}
\newcommand{\HLJLnn}[1]{#1}
\newcommand{\HLJLno}[1]{#1}
\newcommand{\HLJLnt}[1]{#1}
\newcommand{\HLJLnv}[1]{#1}
\newcommand{\HLJLnvc}[1]{#1}
\newcommand{\HLJLnvg}[1]{#1}
\newcommand{\HLJLnvi}[1]{#1}
\newcommand{\HLJLnvm}[1]{#1}
\newcommand{\HLJLl}[1]{#1}
\newcommand{\HLJLld}[1]{\textcolor[RGB]{148,91,176}{\textit{#1}}}
\newcommand{\HLJLs}[1]{\textcolor[RGB]{201,61,57}{#1}}
\newcommand{\HLJLsa}[1]{\textcolor[RGB]{201,61,57}{#1}}
\newcommand{\HLJLsb}[1]{\textcolor[RGB]{201,61,57}{#1}}
\newcommand{\HLJLsc}[1]{\textcolor[RGB]{201,61,57}{#1}}
\newcommand{\HLJLsd}[1]{\textcolor[RGB]{201,61,57}{#1}}
\newcommand{\HLJLsdB}[1]{\textcolor[RGB]{201,61,57}{#1}}
\newcommand{\HLJLsdC}[1]{\textcolor[RGB]{201,61,57}{#1}}
\newcommand{\HLJLse}[1]{\textcolor[RGB]{59,151,46}{#1}}
\newcommand{\HLJLsh}[1]{\textcolor[RGB]{201,61,57}{#1}}
\newcommand{\HLJLsi}[1]{#1}
\newcommand{\HLJLso}[1]{\textcolor[RGB]{201,61,57}{#1}}
\newcommand{\HLJLsr}[1]{\textcolor[RGB]{201,61,57}{#1}}
\newcommand{\HLJLss}[1]{\textcolor[RGB]{201,61,57}{#1}}
\newcommand{\HLJLssB}[1]{\textcolor[RGB]{201,61,57}{#1}}
\newcommand{\HLJLnB}[1]{\textcolor[RGB]{59,151,46}{#1}}
\newcommand{\HLJLnbB}[1]{\textcolor[RGB]{59,151,46}{#1}}
\newcommand{\HLJLnfB}[1]{\textcolor[RGB]{59,151,46}{#1}}
\newcommand{\HLJLnh}[1]{\textcolor[RGB]{59,151,46}{#1}}
\newcommand{\HLJLni}[1]{\textcolor[RGB]{59,151,46}{#1}}
\newcommand{\HLJLnil}[1]{\textcolor[RGB]{59,151,46}{#1}}
\newcommand{\HLJLnoB}[1]{\textcolor[RGB]{59,151,46}{#1}}
\newcommand{\HLJLoB}[1]{\textcolor[RGB]{102,102,102}{\textbf{#1}}}
\newcommand{\HLJLow}[1]{\textcolor[RGB]{102,102,102}{\textbf{#1}}}
\newcommand{\HLJLp}[1]{#1}
\newcommand{\HLJLc}[1]{\textcolor[RGB]{153,153,119}{\textit{#1}}}
\newcommand{\HLJLch}[1]{\textcolor[RGB]{153,153,119}{\textit{#1}}}
\newcommand{\HLJLcm}[1]{\textcolor[RGB]{153,153,119}{\textit{#1}}}
\newcommand{\HLJLcp}[1]{\textcolor[RGB]{153,153,119}{\textit{#1}}}
\newcommand{\HLJLcpB}[1]{\textcolor[RGB]{153,153,119}{\textit{#1}}}
\newcommand{\HLJLcs}[1]{\textcolor[RGB]{153,153,119}{\textit{#1}}}
\newcommand{\HLJLcsB}[1]{\textcolor[RGB]{153,153,119}{\textit{#1}}}
\newcommand{\HLJLg}[1]{#1}
\newcommand{\HLJLgd}[1]{#1}
\newcommand{\HLJLge}[1]{#1}
\newcommand{\HLJLgeB}[1]{#1}
\newcommand{\HLJLgh}[1]{#1}
\newcommand{\HLJLgi}[1]{#1}
\newcommand{\HLJLgo}[1]{#1}
\newcommand{\HLJLgp}[1]{#1}
\newcommand{\HLJLgs}[1]{#1}
\newcommand{\HLJLgsB}[1]{#1}
\newcommand{\HLJLgt}[1]{#1}

\def\qqand{\qquad\hbox{and}\qquad}
\def\qqfor{\qquad\hbox{for}\qquad}
\def\qqas{\qquad\hbox{as}\qquad}
\def\half{ {1 \over 2} }
\def\D{ {\rm d} }
\def\I{ {\rm i} }
\def\E{ {\rm e} }
\def\C{ {\mathbb C} }
\def\R{ {\mathbb R} }
\def\H{ {\mathbb H} }
\def\Z{ {\mathbb Z} }
\def\CC{ {\cal C} }
\def\FF{ {\cal F} }
\def\HH{ {\cal H} }
\def\LL{ {\cal L} }
\def\vc#1{ {\mathbf #1} }
\def\bbC{ {\mathbb C} }

\def\fR{ f_{\rm R} }
\def\fL{ f_{\rm L} }

\def\qqqquad{\qquad\qquad}
\def\qqwhere{\qquad\hbox{where}\qquad}
\def\Res_#1{\underset{#1}{\rm Res}\,}
\def\sech{ {\rm sech}\, }
\def\acos{ {\rm acos}\, }
\def\asin{ {\rm asin}\, }
\def\atan{ {\rm atan}\, }
\def\Ei{ {\rm Ei}\, }
\def\upepsilon{\varepsilon}

\def\Xint#1{ \mathchoice
   {\XXint\displaystyle\textstyle{#1} }%
   {\XXint\textstyle\scriptstyle{#1} }%
   {\XXint\scriptstyle\scriptscriptstyle{#1} }%
   {\XXint\scriptscriptstyle\scriptscriptstyle{#1} }%
   \!\int}
\def\XXint#1#2#3{ {\setbox0=\hbox{$#1{#2#3}{\int}$}
     \vcenter{\hbox{$#2#3$}}\kern-.5\wd0} }
\def\ddashint{\Xint=}
\def\dashint{\Xint-}
% \def\dashint
\def\infdashint{\dashint_{-\infty}^\infty}

\def\addtab#1={#1\;&=}
\def\ccr{\\\addtab}
\def\ip<#1>{\left\langle{#1}\right\rangle}
\def\dx{\D x}
\def\dt{\D t}
\def\dz{\D z}
\def\ds{\D s}

\def\rR{ {\rm R} }
\def\rL{ {\rm L} }

\def\norm#1{\left\| #1 \right\|}

\def\pr(#1){\left({#1}\right)}
\def\br[#1]{\left[{#1}\right]}

\def\abs#1{\left|{#1}\right|}
\def\fpr(#1){\!\pr({#1})}

\def\sopmatrix#1{ \begin{pmatrix}#1\end{pmatrix} }

\def\endash{–}
\def\emdash{—}
\def\mdblksquare{\blacksquare}
\def\lgblksquare{\blacksquare}
\def\scre{\E}
\def\mapengine#1,#2.{\mapfunction{#1}\ifx\void#2\else\mapengine #2.\fi }

\def\map[#1]{\mapengine #1,\void.}

\def\mapenginesep_#1#2,#3.{\mapfunction{#2}\ifx\void#3\else#1\mapengine #3.\fi }

\def\mapsep_#1[#2]{\mapenginesep_{#1}#2,\void.}

\def\vcbr[#1]{\pr(#1)}

\def\bvect[#1,#2]{
{
\def\dots{\cdots}
\def\mapfunction##1{\ | \  ##1}
	\sopmatrix{
		 \,#1\map[#2]\,
	}
}
}

\def\vect[#1]{
{\def\dots{\ldots}
	\vcbr[{#1}]
} }

\def\vectt[#1]{
{\def\dots{\ldots}
	\vect[{#1}]^{\top}
} }

\def\Vectt[#1]{
{
\def\mapfunction##1{##1 \cr}
\def\dots{\vdots}
	\begin{pmatrix}
		\map[#1]
	\end{pmatrix}
} }

\def\addtab#1={#1\;&=}
\def\ccr{\\\addtab}

\def\questionequals{= \!\!\!\!\!\!{\scriptstyle ? \atop }\,\,\,}

\begin{document}

\textbf{Applied Complex Analysis (2021)}

\section{Problem sheet 4: Lectures 16-20}
\rule{\textwidth}{1pt}
\subsection{Problem 1}
\begin{itemize}
\item[1. ] Calculate

\end{itemize}
\[
\int_{-1}^1 \log|x - z| x \dx.
\]
\begin{itemize}
\item[2. ] Calculate

\end{itemize}
\[
\int_{-1}^1 \log|x - z| \sqrt{1-x^2} \dx.
\]
Hint: Use

\[
{\D \over \dx}\br[x \sqrt{1-x^2} + \asin x] = 2 \sqrt{1-x^2}
\]
and the fact that

\[
{\pi \over 2} - \asin x = \acos x.
\]
\begin{itemize}
\item[3. ] Solve the logarithmic singular integral equation:

\end{itemize}
\[
\int_{-1}^1 \log|x-t| u(t)  \dt = {1 \over x^2 + 1}.
\]
You may express your solution in terms of the constant

\[
C = \int_{-1}^1 \log | t| u(t) \dt.
\]
\rule{\textwidth}{1pt}
\subsection{Problem 2}
Consider the problem of the potential field generated by a metal sheet on $[-1,1]$ with a point source with positive unit charge located at $(x,y) = (0,1)$, or in complex coordinates $z = x + \I y$, at $z = \I$.

\begin{itemize}
\item[1. ] Express the problem as a solution $v(x,y)$ to Laplace's equation off $[-1,1]$. You can assume that the metal sheet has no net charge, so that the field at infinity is given by $v(x,y) = \log\abs{z - \I} + o(1)$ where $z = x + \I y$.

\item[2. ] Reduce the Laplace's equation to a singular integral equation of the form:

\end{itemize}
\[
\int_{-1}^1 u(t) \log |x-t| \dt = f(t)
\]
where $u$ is a new unknown. What is $f(t)$ and what is the relationship between $v$ and $\int_{-1}^1 u(x) \log|z -x| \dx$?

\begin{itemize}
\item[3. ] Solve the singular integral equation for $u$.

\item[4. ] What is $v(x,y)$?

\end{itemize}
\rule{\textwidth}{1pt}
\subsection{Problem 3}
This problem set considers the Laguerre polynomials

\[
L_n^{(\alpha)}(x) = {(-1)^n \over n! } x^n + O(x^{n-1})
\]
where $\alpha > -1$, which are orthogonal with respect to

\[
\ip<f,g>_\alpha = \int_0^\infty f(x) g(x) x^\alpha \E^{-x}\dx
\]
We also use the notation $L_n(x) = L_n^{(0)}(x)$.

\begin{itemize}
\item[1. ] Show that the Rodrigues formula holds:

\end{itemize}
\[
L_n^{(\alpha)}(x) = {x^{-\alpha} \E^x \over n!} {\D^n \over \dx^n}\br[x^{\alpha+n}\E^{-x}].
\]
\begin{itemize}
\item[2. ] Show that the derivatives form a hierarchy: we have

\end{itemize}

\begin{align*}
{\D L_n^{(\alpha)} \over \dx} & = -L_{n-1}^{(\alpha+1)}(x), \\
{\D \over \dx}\br[x^{\alpha+1} \E^{-x} L_n^{(\alpha+1)}(x) ]  &= (n+1)x^{\alpha} \E^{-x}L_{n+1}^{(\alpha)}(x), \\
x L_n^{(\alpha+1)}(x) &= -(n+1)L_{n+1}^{(\alpha)}(x) + (n+\alpha+1)L_n^{(\alpha)}(x), \\
L_n^{(\alpha)}(x) &= L_n^{(\alpha+1)}(x) - L_{n-1}^{(\alpha +1)}(x).
\end{align*}
\begin{itemize}
\item[3. ] Combine the results from Problem 1.2 to determine the three-term recurrence relationship and the  top $5 \times 5$ block of the Jacobi operator.

\end{itemize}
\rule{\textwidth}{1pt}
\subsection{Problem 4}
\begin{itemize}
\item[1. ] Represent the ordinary differential operator

\end{itemize}
\[
u'(x) - x u(x)  \qqfor x \geq 0
\]
as an operator on the coefficients of $u$ in a weighted Laguerre expansion:

\[
u(x) = \sum_{k=0}^\infty u_k \E^{-x/2} L_k(x) = \E^{-x/2} \bvect[L_0(x),L_1(x),\dots]\Vectt[u_0,u_1,\dots],
\]
where the range of the operator is specified in $\E^{-x/2} \bvect[L_0^{(1)}(x),L_1^{(1)}(x),\dots]$.

\begin{itemize}
\item[2. ] Show that the Laguerre polynomials are eigenfunctions of a Sturm\ensuremath{\endash}Liouville problem, that is, find  $\lambda_n^{(\alpha)}$ so that

\end{itemize}
\[
{\E^x \over x^\alpha} {\D \over \dx} \br[x^{\alpha+1} \E^{-x} {\D L_n^{(\alpha)} \over \dx}] = \lambda_n^{(\alpha)} L_n^{(\alpha)}(x)
\]
Re-express this as an ODE with polynomial coefficients.

\rule{\textwidth}{1pt}

\end{document}


text:
% !TEX root=/home/tavant/these/manuscript/src/manuscript.tex

\section{Monte Carlo computation of the EVDF}
\label{sec-MCM}

  The \ac{1D} \ac{PIC} simulations were computed faster than the \ac{2D} simulations, as the latter needed around a week to compute $10\,\micro\second$ on 360 CPUs, while the former needed only a few days on 64 CPUs to compute $20\,\micro\second$ of physical time.
  However, they still take a rather long time, especially when compared to fluid models that can be solved from under one second to around one day on a single core, depending on the hypotheses used.

  We have seen that the polytropic index depends on several conditions, as the background pressure (see \cref{fig-p}) but also the densities, sizes, heating mechanism, and so on.
  We have seen in \cref{sec-fluid} that the only value of the polytropic index $\gamma$ is enough to describe the \ac{PIC} simulation.
  As the value of $\gamma$ depends on the \ac{EVDF}, we propose here a Monte Carlo approach that could be used in order to obtain the \ac{EVDF} faster than with a \ac{PIC} simulation.
  A possible application would be similar to \citet{kushner1983}, where the author uses a small population of electrons (typically 300-500) and observes their evolutions in a given plasma potential.

  This method gets rid of the Poisson equation, which can take between 30\% and 50\% of the total simulation time.
  Hence, the Debye length does not have to be highly resolved anymore for stability and numerical heating.
  However, we still need to resolve the sheath, which length is of the order of 5 Debye lengths \citep{chabert2014}.
  Consequently, a coarser mesh of cell size 5 times larger can be used.
  The condition on the time step is also reduced.
  This results in a much faster computation.

  \subsection{Description of the Monte Carlo simulation used}

    In order to validate the Monte Carlo approach, we use as reference the converged simulation of the \ac{1D} \ac{PIC} model at a background pressure of $P_n=1$\,mTorr.
    We use the plasma potential $\phi$ computed self-consistently at the end of the \ac{PIC} simulation.
    The Monte Carlo simulation uses the same modules of \LPPic as the \ac{PIC} simulation for the particles, but the fields (charge density, electric field, etc.) are not computed.
    Similarly to the \ac{PIC} simulation, the Monte Carlo simulation is initialized with uniform Maxwellian electrons.
    The electrons motion and collisions are computed as described in \cref{sec-elements}.
    When an electron is collected at the wall, it is re-injected uniformly.

    We validate the Monte Carlo computation by comparing the distribution function obtained with the one measured at the end of the \ac{PIC} simulation.
    \Cref{fig-EEPF_start_end} shows the expected EEPF obtained in the \ac{PIC} simulation with a background pressure of $P=1$\,mTorr.
    The maximum plasma potential, at the center of the domain, is $\max(\phi)=12.2\,\volt$.
    Is also shown in \cref{fig-EEPF_start_end} the EEPF at the beginning of the Monte Carlo computation, which corresponds to the Maxwellian distribution of temperature $\Te=5\,\volt$.
    The results of the Monte Carlo simulation are presented in \cref{subsec-MCMresults}.

    \begin{figure}[!hbt]
      \centering
      \includegraphics[width=\defaultwidth]{EEPF_PIC.pdf}
      \caption{Electron energy probability function obtained from (orange) the PIC simulation after convergence, and (blue) at the beginning of the Monte Carlo simulation. A Maxwellian distribution function at the $\Te{}_{,inj}$ and the local plasma potential are also given.}
      \label{fig-EEPF_start_end}
    \end{figure}

  \subsection{Results of the Monte Carlo computation} \label{subsec-MCMresults}
    In this section, we describe the temporal evolution of the EEPF in the Monte Carlo (MC) simulation, compared to the EEPF measured in the PIC simulation.
    \paragraph{Beginning of the simulation\\ }
    We start by analyzing the evolution of the EEDF at the very early time of the simulation, from $t=0.01$ to $0.08\,\micro\second$.
    \Cref{fig-zoom_init_Mc} shows the measured electron energy probability function (EEPF) at $3\,\centi\meter$ from the left wall.
    The energy of the electrons is oriented, meaning that the electrons with positive energy are coming from the wall, while the negative energy is used for the electrons going toward the wall.

    \begin{figure}[!hbt]
      \centering
      \includegraphics[width=0.9\textwidth]{MC_first_time}
      % \begin{tabular}{@{} cc}
      %   \includegraphics[width=0.4\textwidth]{MCC_EEDF/Heelo_1} &
      %   \includegraphics[width=0.4\textwidth]{MCC_EEDF/Heelo_2} \\
      %   \includegraphics[width=0.4\textwidth]{MCC_EEDF/Heelo_3} &
      %   \includegraphics[width=0.4\textwidth]{MCC_EEDF/Heelo_4} \\
      %   \includegraphics[width=0.4\textwidth]{MCC_EEDF/Heelo_6} &
      %   \includegraphics[width=0.4\textwidth]{MCC_EEDF/Heelo_8} \\
      % \end{tabular}
      \caption{Evolution of (blue) the directed EEPF measured at $x=3\,\centi\meter$ from the left wall in the Monte Carlo simulation. The positive energy is used for the electrons going from the wall, while the negative energy represents the electrons moving toward the wall. The dotted lines correspond to the local potential. Are overlaid (dash-dotted orange) the initial Maxwellian distribution (Maxwellian at $\Te=5\,\volt)$ and (dashed green) the EEPF obtained at the end of the \acs{PIC} simulation ($t=8\,\micro\second$). }
      \label{fig-zoom_init_Mc}
    \end{figure}

    Two phenomenon can be seen in  \cref{fig-zoom_init_Mc}.
    The first is the rapid decrease of the tail of the distribution function, for energies higher than the plasma potential.
    The tail for positive energy decreases faster than for negative energy, as the EEPF is measured closer to one wall than the other ($x=3\,\centi\meter$ against $L-x=7\,\centi\meter$).
    After $ T \simeq 0.06\,\micro\second$ the two tails are largely depleted, as they are one order of magnitude smaller than the initial Maxwellian EEPF.

    The second phenomena is the presence of waves in the velocity space that can be seen in the low energy populations.
    They are due to the plasma potential profiles.
    Indeed, the electrons are initialized uniformly  with a fixed temperature, hence their total energy depends on the local plasma potential.

    \paragraph{Convergence of the simulation\\ }

    \Cref{fig-zoom_Mc_later} shows the evolution of the EEDF over a longer time scale from $t=0.1$ to $3.5\,\micro\second$ (compared to $t=0.01$ to $0.08\,\micro\second$ in \cref{fig-zoom_init_Mc}).
    We can see the slow evolution of the low energy population from the initial, but slightly perturbed, Maxwellian distribution toward a distribution of smaller temperature.
    After $t=1.5\,\micro\second$, the EEPF of the Monte Carlo computation is fairly close to -- and converges slowly towards -- the EEPF measured at $t=8\,\micro\second$ in the \ac{PIC} simulation.

    \begin{figure}[!hbt]
      \includegraphics[width=0.9\textwidth]{MC_later_time}

      % \begin{tabular}{@{} ccc}
      %   \includegraphics[width=0.3\textwidth]{MCC_EEDF/Heelo_1_10.pdf} &
      %   \includegraphics[width=0.3\textwidth]{MCC_EEDF/Heelo_1_100.pdf} &
      %   \includegraphics[width=0.3\textwidth]{MCC_EEDF/Heelo_1_150.pdf} \\
      % \end{tabular}
      \caption{Evolution of (blue) the EEPF measured at $x=3\,\centi\meter$ from the left wall in the Monte Carlo simulation. The dotted line corresponds to the local potential. Are overlaid (dash-dotted orange) the initial Maxwellian distribution and (dashed green) the EEPF obtained at the end of the \acs{PIC} simulation ($t=8\,\micro\second$). }
      \label{fig-zoom_Mc_later}
    \end{figure}

    \vspace{1em}
    This Monte Carlo investigation has shown that in the \ac{1D} model at $P_n=1$\,mTorr, the EEPF depends on the absorption at the wall but also on the electron-neutral collisions.
    The final shape of the distribution is not simple, and is difficult to describe and predict analytically.
    However, given the profile of the plasma potential, the Monte Carlo computation reproduces the same distribution in a much shorter time compared to the \ac{PIC} simulation.
    The obtained EEPF can then be used to determine the electron density and temperature evolution in a low pressure plasma where electrons are non-local.
    This could be used to determine efficiently, and precisely, the electron polytropic coefficient to use in a fluid model.

  \subsection{Discussion on the different time scales}
    The results presented in the previous section show two main time scales.
    In this section, we compare the observed time scales with the theoretical times.
    The electrons collected at the wall have a kinetic energy at least equal to the potential drop to the wall $\ek = e \dphi$, which corresponds in our case to a limit velocity of $v_{\rm lim} = \sn{1.5}{6} \,\meter\per\second$.
    Hence, the limit time of flight between the two boundaries is
    \[ T_{\rm flight} = \frac{L}{v_{\rm lim}} = 0.068 \,\micro\second.  \]
    This is in agreement with the results of \cref{fig-zoom_init_Mc}, where we see that the high energy tails are depleted around $t=0.06\,\micro\second$.

    \vspace{1em}
    The electron-neutral scattering frequency is computed for a background pressure of $0.13$\,Pa (${1}$\,mTorr) at the temperature of $300\,\kelvin$, which corresponds to a neutral density of $${n_g = \sn{3.2}{19} \meter^{-3}}.$$
    For an electron temperature of $5\,\volt$, the thermal electron-neutral elastic scattering frequency for argon is \citep[p.73]{lieberman2005}
    \[ \nu_{\rm ela} = 4.70 \,\mega\hertz,  \]
    which corresponds to a period of $\tau_{\rm ela} = 0.2 \,\micro\second$.
    This period is shorter than the one observed in the Monte-Carlo simulation, as we see in \cref{fig-zoom_Mc_later} that the low energy part of the EEPF is significantly affected after $t=1\,\micro\second$.

    This discrepancy can be due to two reasons.
    First, at high energy the electron-neutral scattering is not isotropic, but instead gives mostly small angles (forward scattering) \citep{vahedi1995}.
    Hence, a large number of collisions is required for the isotropization to be observable.
    Secondly, the argon presents a significant Ramsauer minimum (a quantum mechanical resonance \citep{lieberman2005}) at $0.3 \,\volt$, were the cross-section is two orders of magnitude lower than at $5\,\volt$.

        \paragraph{Numerical artifacts \\}
        In PIC simulations, numerical parameters can induce numerical heating and thermalization \citep{lai2014}.
        The numerical heating has been studied in detail \citep{birdsall1991}.
        It is due to aliasing effects, and depends on the grid size, time step and number of particles per cell.
        It is important to carefully choose these parameters to reduce the effect of the heating.

        The thermalization is the fact that the distribution of the particle tends toward a Maxwellian.
        It originates from fluctuations of the electric field due to the discretization of the particles.
        The first studies showed that the thermalization time $\tau_T$ depends on $N_D$ the number of (numerical) particles per Debye sphere \citep{dawson1964,montgomery1970}.
        The presence of collisions can affect $\tau_T$  \citep{turner2006,lai2014}.
        In \citet{turner2006}, the author observed the evolution of the thermalization time with $N_D$ as
        \begin{equation} \label{eq-taut}
          \tau_T = \frac{1}{\omega_{pe}} \frac{34.4}{N_D^{-2} + 28.0 N_D^{-1} \frac{\nu_m}{\omega_{pe}}}
        \end{equation}
        which gives in our condition a time-scale several orders of magnitude larger than the typical simulation time.
        We confirmed it by doubling the number of particle per cell for one pressure condition, and no observable impact has been detected.
        Hence, the effects of numerical parameters on the simulation results are expected to be negligible.


text:
\documentclass{include/2.5/sig-alternate}
\usepackage{graphicx}
\usepackage[utf8]{inputenc}
\usepackage{csquotes}

\begin{document}
\conferenceinfo{Seminar: Embedded Intelligence for Health Care and Wellbeing,}{University of Augsburg, Germany}
\CopyrightYear{2019}
\crdata{}

\title{Audio Source Separation using Deep Neural Networks}

\numberofauthors{1}
\author{
	\alignauthor
	Maximilian Ammann\\
	\affaddr{University of Augsburg}\\
	\affaddr{Augsburg, Germany}\\
	\email{maximilian.ammann@student.uni-augsburg.de}\\
	Supervisor: Maximilian Schmitt, Shuo Liu\\
}
\maketitle

\section{Expose}\label{sec:intro}
% Arten von Separation: Vocals <-> Companion, Speech <-> Speech, Speech <-> Noise
Audio Source Separation deals with the separation of a single audio signal into multiple signals.
As early as 1953 the \enquote{Cocktail Party Problem} was first mentioned~\cite{Cherry1953}.

Since then, there have been many approaches to the separation of signals, which have been used in a variety of areas such as automated karaoke, object-specific equalizers, hearing prostheses and robust speech recognition~\cite{Wang2018}.
Algorithms can use assumptions such as that the signal is stereo or certain harmonic or redundant compositions exist in the signal to allow separation.

The field of application discussed in this paper is the separation between different voices.
Fist a few early approaches will be reviewed to conclude that they are not sufficient enough for most applications.

The results of \enquote{Robust principal component analysis} or \enquote{Non-negative matrix factorization} will be reviewed shortly to give an overview of the state of the art before the appearance of deep learning.

The next chapter will give an overview of several approaches which have been tried in the past (MLP, CNNs, GANs). This will not contain a detailed description about the network architecture but should give an overview of the research in the past few years.
We will also conclude that the most interesting approach is deep clustering. The rough estimations of the goals should be described in this chapter.
A major part of this chapter will also be to describe the available data for training and testing the network. Ways to remix the audio should be described in the chapter "Data augmentation".

The main chapter will describe the model I want to use. I want to base my model on the TensorFlow implementation by zhr1201 on Github.com.
To be able to describe it in detail the first step is to get his model running and compute the first results.
This chapter is not very clear as of now because I do not know how good the results will be and how good the implementation is. It is also not clear whether the implementation matches the paper exactly.

I also want to tweak parameters to achieve better accuracy. The progress of increasing the accuracy should be discussed in the chapter.

In the last part I want to do an evaluation by comparing SDR, IRS, SIR and SAR metrics.
I want to test different kinds of voice like female vs. male or child vs. adult.
A comparison with one state of the art algorithm should be made if there is data about their accuracy available publicly.

I think implementing the model and gathering the evaluation data will take about 2 month. So I'll have enough time in the last month to write the actual thesis.
I will start with the work as soon as the new semester starts as I have to write an other small paper. So I  think we can register the thesis in July as Max already mentioned.
If I finish earlier than expected I want to evaluate whether the model is usable on embedded hardware. This will be like a outlook for future medial applications.
\end{document}