From b90e1c4c691829f12ea51000c619eb3b8f3f424f Mon Sep 17 00:00:00 2001 From: Karl Berry Date: Sun, 5 Jan 2020 23:08:16 +0000 Subject: thuthesis (6jan20) git-svn-id: svn://tug.org/texlive/trunk@53329 c570f23f-e606-0410-a88d-b1316a301751 --- Master/texmf-dist/doc/latex/thuthesis/README.md | 50 ++-- .../doc/latex/thuthesis/data/abstract.tex | 55 ++++ Master/texmf-dist/doc/latex/thuthesis/data/ack.tex | 12 - .../doc/latex/thuthesis/data/acknowledgements.tex | 12 + .../doc/latex/thuthesis/data/appendix-survey.tex | 172 ++++++++++++ .../latex/thuthesis/data/appendix-translation.tex | 96 +++++++ .../doc/latex/thuthesis/data/appendix.tex | 237 +++++++++++++++++ .../doc/latex/thuthesis/data/appendix01.tex | 263 ------------------- .../texmf-dist/doc/latex/thuthesis/data/chap01.tex | 31 +-- .../texmf-dist/doc/latex/thuthesis/data/chap02.tex | 12 +- .../texmf-dist/doc/latex/thuthesis/data/cover.tex | 118 --------- .../doc/latex/thuthesis/data/denotation.tex | 2 + .../texmf-dist/doc/latex/thuthesis/data/resume.tex | 2 + .../texmf-dist/doc/latex/thuthesis/dtx-style.sty | 64 ++++- Master/texmf-dist/doc/latex/thuthesis/latexmkrc | 23 +- Master/texmf-dist/doc/latex/thuthesis/main.pdf | Bin 1063986 -> 768081 bytes Master/texmf-dist/doc/latex/thuthesis/main.tex | 84 +++--- .../doc/latex/thuthesis/math_commands.tex | 290 +++++++++++++++++++++ .../doc/latex/thuthesis/ref/appendix.bib | 14 + Master/texmf-dist/doc/latex/thuthesis/ref/refs.bib | 2 +- Master/texmf-dist/doc/latex/thuthesis/shuji.pdf | Bin 26554 -> 0 bytes Master/texmf-dist/doc/latex/thuthesis/shuji.tex | 20 -- Master/texmf-dist/doc/latex/thuthesis/spine.pdf | Bin 0 -> 20221 bytes Master/texmf-dist/doc/latex/thuthesis/spine.tex | 19 ++ Master/texmf-dist/doc/latex/thuthesis/thusetup.tex | 154 +++++++++++ .../texmf-dist/doc/latex/thuthesis/thuthesis.pdf | Bin 709954 -> 937163 bytes 26 files changed, 1210 insertions(+), 522 deletions(-) create mode 100644 Master/texmf-dist/doc/latex/thuthesis/data/abstract.tex delete mode 100644 Master/texmf-dist/doc/latex/thuthesis/data/ack.tex create mode 100644 Master/texmf-dist/doc/latex/thuthesis/data/acknowledgements.tex create mode 100644 Master/texmf-dist/doc/latex/thuthesis/data/appendix-survey.tex create mode 100644 Master/texmf-dist/doc/latex/thuthesis/data/appendix-translation.tex create mode 100644 Master/texmf-dist/doc/latex/thuthesis/data/appendix.tex delete mode 100644 Master/texmf-dist/doc/latex/thuthesis/data/appendix01.tex delete mode 100644 Master/texmf-dist/doc/latex/thuthesis/data/cover.tex create mode 100644 Master/texmf-dist/doc/latex/thuthesis/math_commands.tex create mode 100644 Master/texmf-dist/doc/latex/thuthesis/ref/appendix.bib delete mode 100644 Master/texmf-dist/doc/latex/thuthesis/shuji.pdf delete mode 100644 Master/texmf-dist/doc/latex/thuthesis/shuji.tex create mode 100644 Master/texmf-dist/doc/latex/thuthesis/spine.pdf create mode 100644 Master/texmf-dist/doc/latex/thuthesis/spine.tex create mode 100644 Master/texmf-dist/doc/latex/thuthesis/thusetup.tex (limited to 'Master/texmf-dist/doc/latex/thuthesis') diff --git a/Master/texmf-dist/doc/latex/thuthesis/README.md b/Master/texmf-dist/doc/latex/thuthesis/README.md index ff9a88378d2..3691ac56b61 100644 --- a/Master/texmf-dist/doc/latex/thuthesis/README.md +++ b/Master/texmf-dist/doc/latex/thuthesis/README.md @@ -1,18 +1,20 @@ -[![Build Status](https://travis-ci.org/xueruini/thuthesis.svg?branch=master)](https://travis-ci.org/xueruini/thuthesis) +[![Actions Status](https://github.com/xueruini/thuthesis/workflows/build/badge.svg)](https://github.com/xueruini/thuthesis/actions) [![Join the chat at https://gitter.im/thuthesis/Lobby](https://badges.gitter.im/thuthesis/Lobby.svg)](https://gitter.im/thuthesis/Lobby) -[![Github downloads](https://img.shields.io/github/downloads/xueruini/thuthesis/total.svg)](https://github.com/xueruini/thuthesis/releases) -[![GitHub release](https://img.shields.io/github/release/xueruini/thuthesis/all.svg)](https://github.com/xueruini/thuthesis/releases/latest) -[![GitHub commits](https://img.shields.io/github/commits-since/xueruini/thuthesis/latest.svg)](https://github.com/xueruini/thuthesis/commits/master) +[![GitHub downloads](https://img.shields.io/github/downloads/xueruini/thuthesis/total)](https://github.com/xueruini/thuthesis/releases) +[![GitHub commits](https://img.shields.io/github/commits-since/xueruini/thuthesis/latest)](https://github.com/xueruini/thuthesis/commits/master) +[![GitHub release](https://img.shields.io/github/v/release/xueruini/thuthesis)](https://github.com/xueruini/thuthesis/releases/latest) +[![CTAN](https://img.shields.io/ctan/v/thuthesis)](https://www.ctan.org/pkg/thuthesis) # What's ThuThesis? ThuThesis is an abbreviation of Tsinghua University Thesis LaTeX Template. -This package establishes a simple and easy-to-use LaTeX template for Tsinghua dissertations, including general undergraduate research papers, masters theses, doctoral theses, doctoral dissertations, and post-doc reports. Additional support for other formats (what else is there?) will be added continuously. An English translation of this README follows the Chinese below. +This package establishes a simple and easy-to-use LaTeX template for Tsinghua dissertations, including general undergraduate research papers, masters theses, doctoral dissertations, and postdoctoral reports. An English translation of this README follows the Chinese below. + # ThuThesis是什么? ThuThesis为 Tsinghua University Thesis LaTeX Template之缩写。 -此宏包旨在建立一个简单易用的清华大学学位论文LaTeX模板,包括本科综合论文训练、硕士论文、博士论文、博士哲学论文以及博士后出站报告。现在支持本科、硕士、博士论文、博士后出站报告格式,对其它格式(还有么?)的支持会陆续加入。 +此宏包旨在建立一个简单易用的清华大学学位论文LaTeX模板,包括本科综合论文训练、硕士论文、博士论文以及博士后出站报告。 # 文档 请[下载](https://github.com/xueruini/thuthesis/releases)模板,里面包括具体使用说明以及示例文档: @@ -21,12 +23,12 @@ ThuThesis为 Tsinghua University Thesis LaTeX Templa * 示例文档 (main.pdf) # 下载 -* 发行版:[CTAN](http://www.ctan.org/pkg/thuthesis) +* 发行版:[CTAN](https://www.ctan.org/pkg/thuthesis) * 开发版:[GitHub](https://github.com/xueruini/thuthesis) # 升级 ## 自动更新 -通过 TeX 发行版工具自动从 [CTAN](http://www.ctan.org/pkg/thuthesis) 更新。 +通过 TeX 发行版工具自动从 [CTAN](https://www.ctan.org/pkg/thuthesis) 更新。 ## 手动更新 从 [GitHub](https://github.com/xueruini/thuthesis) 下载放入论文目录,执行命令(Windows 用户在文件夹空白处按`Shift+鼠标右键`,点击“在此处打开命令行窗口”): @@ -39,22 +41,19 @@ ThuThesis为 Tsinghua University Thesis LaTeX Templa 按推荐顺序排序: * 先到 [FAQ](https://github.com/xueruini/thuthesis/wiki/FAQ) 看看常见问题 -* [Github Issues](http://github.com/xueruini/thuthesis/issues) -* [TeX@newsmth](http://www.newsmth.net/nForum/#!board/TeX) -* [ThuThesis@Google Groups](http://groups.google.com/group/thuthesis) +* [GitHub Issues](https://github.com/xueruini/thuthesis/issues) # Makefile的用法 ```shell -make [{all|thesis|shuji|doc|clean|cleanall|distclean}] +make [{all|thesis|spine|doc|clean|cleanall|distclean}] ``` ## 目标 -* `make all` 等于 `make thesis && make shuji && make doc`; -* `make cls` 生成模板文件; * `make thesis` 生成论文 main.pdf; -* `make shuji` 生成书脊 shuji.pdf; -* `make doc` 生成使用说明书 thuthesis.pdf; +* `make spine` 生成书脊 spine.pdf; +* `make doc` 生成模板使用说明书 thuthesis.pdf; +* `make all` 生成论文和书籍,相当于 `make thesis && make spine`; * `make clean` 删除示例文件的中间文件(不含 main.pdf); * `make cleanall` 删除示例文件的中间文件和 main.pdf; * `make distclean` 删除示例文件和模板的所有中间文件和 PDF。 @@ -65,12 +64,12 @@ Download and unzip the template. Specific usage documentation and examples can b * Template example (main.pdf) # Downloads -* Published version: [CTAN](http://www.ctan.org/pkg/thuthesis) +* Published version: [CTAN](https://www.ctan.org/pkg/thuthesis) * Developer version: [GitHub](https://github.com/xueruini/thuthesis) # Updates ## Automatic -Get the most up-to-date published version of the TeX tools from [CTAN](http://www.ctan.org/pkg/thuthesis). +Get the most up-to-date published version of the TeX tools from [CTAN](https://www.ctan.org/pkg/thuthesis). ## Manual Download the package from [GitHub](https://github.com/xueruini/thuthesis) to the root directory of your thesis, then execute the command (Windows users `Shift + right click` white area in the file window and click "Open command line window here from the popup menu"): @@ -82,23 +81,20 @@ You'll get `thuthesis.cls` along with other template files. # Reporting Issues Please follow the procedure below: -* Check the [FAQ](https://github.com/xueruini/thuthesis/wiki/FAQ) -* [Github Issues](http://github.com/xueruini/thuthesis/issues) -* [TeX@newsmth](http://www.newsmth.net/nForum/#!board/TeX) -* [ThuThesis@Google Groups](http://groups.google.com/group/thuthesis) +* Check the [FAQ](https://github.com/xueruini/thuthesis/wiki/FAQ) +* [GitHub Issues](https://github.com/xueruini/thuthesis/issues) # Makefile Usage ```shell -make [{all|thesis|shuji|doc|clean|cleanall|distclean}] +make [{all|thesis|spine|doc|clean|cleanall|distclean}] ``` ## Targets -* `make all` same as `make thesis && make shuji && make doc`; -* `make cls` generate template file; * `make thesis` generate thesis main.pdf; -* `make shuji` generate book spine for printing shuji.pdf; -* `make doc` generate documentation thuthesis.pdf; +* `make spine` generate book spine for printing spine.pdf; +* `make doc` generate template documentation thuthesis.pdf; +* `make all` generate thesis and spine, same as `make thesis && make spine`; * `make clean` delete all examples' files (excluding main.pdf); * `make cleanall` delete all examples' files and main.pdf; * `make distclean` delete all examples' and templates' files and PDFs. diff --git a/Master/texmf-dist/doc/latex/thuthesis/data/abstract.tex b/Master/texmf-dist/doc/latex/thuthesis/data/abstract.tex new file mode 100644 index 00000000000..a7737b51685 --- /dev/null +++ b/Master/texmf-dist/doc/latex/thuthesis/data/abstract.tex @@ -0,0 +1,55 @@ +% !TeX root = ../main.tex + +% 中英文摘要和关键字 + +\begin{abstract} + 论文的摘要是对论文研究内容和成果的高度概括。摘要应对论文所研究的问题及其研究目 + 的进行描述,对研究方法和过程进行简单介绍,对研究成果和所得结论进行概括。摘要应 + 具有独立性和自明性,其内容应包含与论文全文同等量的主要信息。使读者即使不阅读全 + 文,通过摘要就能了解论文的总体内容和主要成果。 + + 论文摘要的书写应力求精确、简明。切忌写成对论文书写内容进行提要的形式,尤其要避 + 免“第 1 章……;第 2 章……;……”这种或类似的陈述方式。 + + 本文介绍清华大学论文模板 \thuthesis{} 的使用方法。本模板符合学校的本科、硕士、 + 博士论文格式要求。 + + 本文的创新点主要有: + \begin{itemize} + \item 用例子来解释模板的使用方法; + \item 用废话来填充无关紧要的部分; + \item 一边学习摸索一边编写新代码。 + \end{itemize} + + 关键词是为了文献标引工作、用以表示全文主要内容信息的单词或术语。关键词不超过 5 + 个,每个关键词中间用分号分隔。(模板作者注:关键词分隔符不用考虑,模板会自动处 + 理。英文关键词同理。) + + % 关键词用“英文逗号”分隔 + \thusetup{ + keywords = {TeX, LaTeX, CJK, 模板, 论文}, + } +\end{abstract} + +\begin{abstract*} + An abstract of a dissertation is a summary and extraction of research work + and contributions. Included in an abstract should be description of research + topic and research objective, brief introduction to methodology and research + process, and summarization of conclusion and contributions of the + research. An abstract should be characterized by independence and clarity and + carry identical information with the dissertation. It should be such that the + general idea and major contributions of the dissertation are conveyed without + reading the dissertation. + + An abstract should be concise and to the point. It is a misunderstanding to + make an abstract an outline of the dissertation and words ``the first + chapter'', ``the second chapter'' and the like should be avoided in the + abstract. + + Key words are terms used in a dissertation for indexing, reflecting core + information of the dissertation. An abstract may contain a maximum of 5 key + words, with semi-colons used in between to separate one another. + \thusetup{ + keywords* = {TeX, LaTeX, CJK, template, thesis}, + } +\end{abstract*} diff --git a/Master/texmf-dist/doc/latex/thuthesis/data/ack.tex b/Master/texmf-dist/doc/latex/thuthesis/data/ack.tex deleted file mode 100644 index bdab98fb983..00000000000 --- a/Master/texmf-dist/doc/latex/thuthesis/data/ack.tex +++ /dev/null @@ -1,12 +0,0 @@ -% 如果使用声明扫描页,将可选参数指定为扫描后的 PDF 文件名,例如: -% \begin{acknowledgement}[scan-statement.pdf] -\begin{acknowledgement} - 衷心感谢导师 xxx 教授和物理系 xxx 副教授对本人的精心指导。他们的言传身教将使 - 我终生受益。 - - 在美国麻省理工学院化学系进行九个月的合作研究期间,承蒙 xxx 教授热心指导与帮助,不 - 胜感激。感谢 xx 实验室主任 xx 教授,以及实验室全体老师和同学们的热情帮助和支 - 持!本课题承蒙国家自然科学基金资助,特此致谢。 - - 感谢 \LaTeX 和 \thuthesis\cite{thuthesis},帮我节省了不少时间。 -\end{acknowledgement} diff --git a/Master/texmf-dist/doc/latex/thuthesis/data/acknowledgements.tex b/Master/texmf-dist/doc/latex/thuthesis/data/acknowledgements.tex new file mode 100644 index 00000000000..0ef68793d56 --- /dev/null +++ b/Master/texmf-dist/doc/latex/thuthesis/data/acknowledgements.tex @@ -0,0 +1,12 @@ +% !TeX root = ../main.tex + +\begin{acknowledgements} + 衷心感谢导师 xxx 教授和物理系 xxx 副教授对本人的精心指导。他们的言传身教将使 + 我终生受益。 + + 在美国麻省理工学院化学系进行九个月的合作研究期间,承蒙 xxx 教授热心指导与帮助,不 + 胜感激。感谢 xx 实验室主任 xx 教授,以及实验室全体老师和同学们的热情帮助和支 + 持!本课题承蒙国家自然科学基金资助,特此致谢。 + + 感谢 \LaTeX{} 和 \thuthesis\cite{thuthesis},帮我节省了不少时间。 +\end{acknowledgements} diff --git a/Master/texmf-dist/doc/latex/thuthesis/data/appendix-survey.tex b/Master/texmf-dist/doc/latex/thuthesis/data/appendix-survey.tex new file mode 100644 index 00000000000..4a753f5211f --- /dev/null +++ b/Master/texmf-dist/doc/latex/thuthesis/data/appendix-survey.tex @@ -0,0 +1,172 @@ +% !TeX root = ../main.tex + +\begin{survey} +\label{cha:survey} + +\title{Title of the Survey} +\maketitle + +写出至少 5000 外文印刷字符的调研阅读报告或者书面翻译 1-2 篇(不少于 2 万外文印刷符)。 + +It is impossible to cover in a single chapter every concept of mathematical +programming.\cite{tex} This chapter introduces only the basic concepts and techniques of +mathematical programming such that readers gain an understanding of them +throughout the book\cite{abrahams99tex,salomon1995advanced}. + + +\section{Single-Objective Programming} +The general form of single-objective programming (SOP) is written +as follows, +\begin{equation*} % 如果附录中的公式不想让它出现在公式索引中,那就请 + % 用 equation* +\left\{\begin{array}{l} +\max \,\,f(x)\\[0.1 cm] +\mbox{subject to:} \\ [0.1 cm] +\qquad g_j(x)\le 0,\quad j=1,2,\cdots,p +\end{array}\right. +\end{equation*} +which maximizes a real-valued function $f$ of +$x=(x_1,x_2,\cdots,x_n)$ subject to a set of constraints. + +\newcommand\Real{\mathbf{R}} +\newtheorem{mpdef}{Definition}[chapter] +\begin{mpdef} +In SOP, we call $x$ a decision vector, and +$x_1,x_2,\cdots,x_n$ decision variables. The function +$f$ is called the objective function. The set +\begin{equation*} +S=\left\{x\in\Real^n\bigm|g_j(x)\le 0,\,j=1,2,\cdots,p\right\} +\end{equation*} +is called the feasible set. An element $x$ in $S$ is called a +feasible solution. +\end{mpdef} + +\newtheorem{mpdefop}[mpdef]{Definition} +\begin{mpdefop} +A feasible solution $x^*$ is called the optimal +solution of SOP if and only if +\begin{equation} +f(x^*)\ge f(x) +\end{equation} +for any feasible solution $x$. +\end{mpdefop} + +One of the outstanding contributions to mathematical programming was known as +the Kuhn-Tucker conditions\ref{eq:ktc}. In order to introduce them, let us give +some definitions. An inequality constraint $g_j(x)\le 0$ is said to be active at +a point $x^*$ if $g_j(x^*)=0$. A point $x^*$ satisfying $g_j(x^*)\le 0$ is said +to be regular if the gradient vectors $\nabla g_j(x)$ of all active constraints +are linearly independent. + +Let $x^*$ be a regular point of the constraints of SOP and assume that all the +functions $f(x)$ and $g_j(x),j=1,2,\cdots,p$ are differentiable. If $x^*$ is a +local optimal solution, then there exist Lagrange multipliers +$\lambda_j,j=1,2,\cdots,p$ such that the following Kuhn-Tucker conditions hold, +\begin{equation} +\label{eq:ktc} +\left\{\begin{array}{l} + \nabla f(x^*)-\sum\limits_{j=1}^p\lambda_j\nabla g_j(x^*)=0\\[0.3cm] + \lambda_jg_j(x^*)=0,\quad j=1,2,\cdots,p\\[0.2cm] + \lambda_j\ge 0,\quad j=1,2,\cdots,p. +\end{array}\right. +\end{equation} +If all the functions $f(x)$ and $g_j(x),j=1,2,\cdots,p$ are convex and +differentiable, and the point $x^*$ satisfies the Kuhn-Tucker conditions +(\ref{eq:ktc}), then it has been proved that the point $x^*$ is a global optimal +solution of SOP. + +\subsection{Linear Programming} +\label{sec:lp} + +If the functions $f(x),g_j(x),j=1,2,\cdots,p$ are all linear, then SOP is called +a {\em linear programming}. + +The feasible set of linear is always convex. A point $x$ is called an extreme +point of convex set $S$ if $x\in S$ and $x$ cannot be expressed as a convex +combination of two points in $S$. It has been shown that the optimal solution to +linear programming corresponds to an extreme point of its feasible set provided +that the feasible set $S$ is bounded. This fact is the basis of the {\em simplex + algorithm} which was developed by Dantzig as a very efficient method for +solving linear programming. +\begin{table}[ht] +\centering + \centering + \caption*{Table~1\hskip1em This is an example for manually numbered table, which + would not appear in the list of tables} + \label{tab:badtabular2} + \begin{tabular}[c]{|m{1.5cm}|c|c|c|c|c|c|}\hline + \multicolumn{2}{|c|}{Network Topology} & \# of nodes & + \multicolumn{3}{c|}{\# of clients} & Server \\\hline + GT-ITM & Waxman Transit-Stub & 600 & + \multirow{2}{2em}{2\%}& + \multirow{2}{2em}{10\%}& + \multirow{2}{2em}{50\%}& + \multirow{2}{1.2in}{Max. Connectivity}\\\cline{1-3} + \multicolumn{2}{|c|}{Inet-2.1} & 6000 & & & &\\\hline + \multirow{2}{1.5cm}{Xue} & Rui & Ni &\multicolumn{4}{c|}{\multirow{2}*{\thuthesis}}\\\cline{2-3} + & \multicolumn{2}{c|}{ABCDEF} &\multicolumn{4}{c|}{} \\\hline +\end{tabular} +\end{table} + +Roughly speaking, the simplex algorithm examines only the extreme points of the +feasible set, rather than all feasible points. At first, the simplex algorithm +selects an extreme point as the initial point. The successive extreme point is +selected so as to improve the objective function value. The procedure is +repeated until no improvement in objective function value can be made. The last +extreme point is the optimal solution. + +\subsection{Nonlinear Programming} + +If at least one of the functions $f(x),g_j(x),j=1,2,\cdots,p$ is nonlinear, then +SOP is called a {\em nonlinear programming}. + +A large number of classical optimization methods have been developed to treat +special-structural nonlinear programming based on the mathematical theory +concerned with analyzing the structure of problems. +\begin{figure}[h] + \centering + \includegraphics{thu-lib-logo.pdf} + \caption*{Figure~1\quad This is an example for manually numbered figure, + which would not appear in the list of figures} + \label{tab:badfigure2} +\end{figure} + +Now we consider a nonlinear programming which is confronted solely with +maximizing a real-valued function with domain $\Real^n$. Whether derivatives are +available or not, the usual strategy is first to select a point in $\Real^n$ which +is thought to be the most likely place where the maximum exists. If there is no +information available on which to base such a selection, a point is chosen at +random. From this first point an attempt is made to construct a sequence of +points, each of which yields an improved objective function value over its +predecessor. The next point to be added to the sequence is chosen by analyzing +the behavior of the function at the previous points. This construction continues +until some termination criterion is met. Methods based upon this strategy are +called {\em ascent methods}, which can be classified as {\em direct methods}, +{\em gradient methods}, and {\em Hessian methods} according to the information +about the behavior of objective function $f$. Direct methods require only that +the function can be evaluated at each point. Gradient methods require the +evaluation of first derivatives of $f$. Hessian methods require the evaluation +of second derivatives. In fact, there is no superior method for all +problems. The efficiency of a method is very much dependent upon the objective +function. + +\subsection{Integer Programming} + +{\em Integer programming} is a special mathematical programming in which all of +the variables are assumed to be only integer values. When there are not only +integer variables but also conventional continuous variables, we call it {\em + mixed integer programming}. If all the variables are assumed either 0 or 1, +then the problem is termed a {\em zero-one programming}. Although integer +programming can be solved by an {\em exhaustive enumeration} theoretically, it +is impractical to solve realistically sized integer programming problems. The +most successful algorithm so far found to solve integer programming is called +the {\em branch-and-bound enumeration} developed by Balas (1965) and Dakin +(1965). The other technique to integer programming is the {\em cutting plane + method} developed by Gomory (1959). + +\hfill\textit{Uncertain Programming\/}\quad(\textsl{BaoDing Liu, 2006.2}) + +\bibliographystyle{plainnat} +\bibliography{ref/refs,ref/appendix} + +\end{survey} diff --git a/Master/texmf-dist/doc/latex/thuthesis/data/appendix-translation.tex b/Master/texmf-dist/doc/latex/thuthesis/data/appendix-translation.tex new file mode 100644 index 00000000000..f085815300f --- /dev/null +++ b/Master/texmf-dist/doc/latex/thuthesis/data/appendix-translation.tex @@ -0,0 +1,96 @@ +% !TeX root = ../main.tex + +\begin{translation} +\label{cha:translation} + +\title{书面翻译题目} +\maketitle + +\section{单目标规划} +北冥有鱼,其名为鲲。鲲之大,不知其几千里也。化而为鸟,其名为鹏。鹏之背,不知其几 +千里也。怒而飞,其翼若垂天之云。是鸟也,海运则将徙于南冥。南冥者,天池也。 +\begin{equation}\tag*{(123)} + p(y|\mathbf{x}) = \frac{p(\mathbf{x},y)}{p(\mathbf{x})}= +\frac{p(\mathbf{x}|y)p(y)}{p(\mathbf{x})} +\end{equation} + +吾生也有涯,而知也无涯。以有涯随无涯,殆已!已而为知者,殆而已矣!为善无近名,为 +恶无近刑,缘督以为经,可以保身,可以全生,可以养亲,可以尽年。 + +\subsection{线性规划} +庖丁为文惠君解牛,手之所触,肩之所倚,足之所履,膝之所倚,砉然响然,奏刀騞然,莫 +不中音,合于桑林之舞,乃中经首之会。 +\begin{table}[ht] +\centering + \centering + \caption*{表~1\hskip1em 这是手动编号但不出现在索引中的一个表格例子} + \label{tab:badtabular3} + \begin{tabular}[c]{|m{1.5cm}|c|c|c|c|c|c|}\hline + \multicolumn{2}{|c|}{Network Topology} & \# of nodes & + \multicolumn{3}{c|}{\# of clients} & Server \\\hline + GT-ITM & Waxman Transit-Stub & 600 & + \multirow{2}{2em}{2\%}& + \multirow{2}{2em}{10\%}& + \multirow{2}{2em}{50\%}& + \multirow{2}{1.2in}{Max. Connectivity}\\\cline{1-3} + \multicolumn{2}{|c|}{Inet-2.1} & 6000 & & & &\\\hline + \multirow{2}{1.5cm}{Xue} & Rui & Ni &\multicolumn{4}{c|}{\multirow{2}*{\thuthesis}}\\\cline{2-3} + & \multicolumn{2}{c|}{ABCDEF} &\multicolumn{4}{c|}{} \\\hline +\end{tabular} +\end{table} + +文惠君曰:“嘻,善哉!技盖至此乎?”庖丁释刀对曰:“臣之所好者道也,进乎技矣。始臣之 +解牛之时,所见无非全牛者;三年之后,未尝见全牛也;方今之时,臣以神遇而不以目视, +官知止而神欲行。依乎天理,批大郤,导大窾,因其固然。技经肯綮之未尝,而况大坬乎! +良庖岁更刀,割也;族庖月更刀,折也;今臣之刀十九年矣,所解数千牛矣,而刀刃若新发 +于硎。彼节者有间而刀刃者无厚,以无厚入有间,恢恢乎其于游刃必有余地矣。是以十九年 +而刀刃若新发于硎。虽然,每至于族,吾见其难为,怵然为戒,视为止,行为迟,动刀甚微, +謋然已解,如土委地。提刀而立,为之而四顾,为之踌躇满志,善刀而藏之。” + +文惠君曰:“善哉!吾闻庖丁之言,得养生焉。” + + +\subsection{非线性规划} +孔子与柳下季为友,柳下季之弟名曰盗跖。盗跖从卒九千人,横行天下,侵暴诸侯。穴室枢 +户,驱人牛马,取人妇女。贪得忘亲,不顾父母兄弟,不祭先祖。所过之邑,大国守城,小 +国入保,万民苦之。孔子谓柳下季曰:“夫为人父者,必能诏其子;为人兄者,必能教其弟。 +若父不能诏其子,兄不能教其弟,则无贵父子兄弟之亲矣。今先生,世之才士也,弟为盗 +跖,为天下害,而弗能教也,丘窃为先生羞之。丘请为先生往说之。” +\begin{figure}[h] + \centering + \includegraphics{thu-whole-logo.pdf} + \caption*{图~1\hskip1em 这是手动编号但不出现索引中的图片的例子} + \label{tab:badfigure3} +\end{figure} + +柳下季曰:“先生言为人父者必能诏其子,为人兄者必能教其弟,若子不听父之诏,弟不受 +兄之教,虽今先生之辩,将奈之何哉?且跖之为人也,心如涌泉,意如飘风,强足以距敌, +辩足以饰非。顺其心则喜,逆其心则怒,易辱人以言。先生必无往。” + +孔子不听,颜回为驭,子贡为右,往见盗跖。 + +\subsection{整数规划} +盗跖乃方休卒徒大山之阳,脍人肝而餔之。孔子下车而前,见谒者曰:“鲁人孔丘,闻将军 +高义,敬再拜谒者。”谒者入通。盗跖闻之大怒,目如明星,发上指冠,曰:“此夫鲁国之 +巧伪人孔丘非邪?为我告之:尔作言造语,妄称文、武,冠枝木之冠,带死牛之胁,多辞缪 +说,不耕而食,不织而衣,摇唇鼓舌,擅生是非,以迷天下之主,使天下学士不反其本,妄 +作孝弟,而侥幸于封侯富贵者也。子之罪大极重,疾走归!不然,我将以子肝益昼餔之膳。” + + +\nocite{abrahams99tex,salomon1995advanced} +\bibliographystyle{plainnat} +\bibliography{ref/appendix} + +% 也可以使用 thebiliography 环境手写 +% \begin{thebibliography}{2} +% \bibitem{abrahams99tex} +% P.~W. Abrahams, K.~Berry, and K.~A. Hargreaves, \emph{{\TeX} for the +% Impatient}.\hskip 1em plus 0.5em minus 0.4em\relax Addison-Wesley, 1990. + +% \bibitem{salomon1995advanced} +% D.~Salomon, ``The advanced {\TeX}book.''\hskip 1em plus 0.5em minus 0.4em\relax +% New York: Springer, 1995. +% \end{thebibliography} + + +\end{translation} diff --git a/Master/texmf-dist/doc/latex/thuthesis/data/appendix.tex b/Master/texmf-dist/doc/latex/thuthesis/data/appendix.tex new file mode 100644 index 00000000000..94a4a0595c2 --- /dev/null +++ b/Master/texmf-dist/doc/latex/thuthesis/data/appendix.tex @@ -0,0 +1,237 @@ +\chapter{单目标规划} + +As one of the most widely used techniques in operations +research, \emph{ mathematical programming} is defined as a means of maximizing a +quantity known as \emph{bjective function}, subject to a set of constraints +represented by equations and inequalities. Some known subtopics of mathematical +programming are linear programming, nonlinear programming, multiobjective +programming, goal programming, dynamic programming, and multilevel +programming. + +It is impossible to cover in a single chapter every concept of mathematical +programming. This chapter introduces only the basic concepts and techniques of +mathematical programming such that readers gain an understanding of them +throughout the book. + + +\section{Single-Objective Programming} +The general form of single-objective programming (SOP) is written +as follows, +\begin{equation*} % 如果附录中的公式不想让它出现在公式索引中,那就请 + % 用 equation* +\left\{\begin{array}{l} +\max \,\,f(x)\\[0.1 cm] +\mbox{subject to:} \\ [0.1 cm] +\qquad g_j(x)\le 0,\quad j=1,2,\cdots,p +\end{array}\right. +\end{equation*} +which maximizes a real-valued function $f$ of +$x=(x_1,x_2,\cdots,x_n)$ subject to a set of constraints. + +\newcommand\Real{\mathbf{R}} +\newtheorem{mpdef}{Definition}[chapter] +\begin{mpdef} +In SOP, we call $x$ a decision vector, and +$x_1,x_2,\cdots,x_n$ decision variables. The function +$f$ is called the objective function. The set +\begin{equation*} +S=\left\{x\in\Real^n\bigm|g_j(x)\le 0,\,j=1,2,\cdots,p\right\} +\end{equation*} +is called the feasible set. An element $x$ in $S$ is called a +feasible solution. +\end{mpdef} + +\newtheorem{mpdefop}[mpdef]{Definition} +\begin{mpdefop} +A feasible solution $x^*$ is called the optimal +solution of SOP if and only if +\begin{equation} +f(x^*)\ge f(x) +\end{equation} +for any feasible solution $x$. +\end{mpdefop} + +One of the outstanding contributions to mathematical programming was known as +the Kuhn-Tucker conditions\ref{eq:ktc}. In order to introduce them, let us give +some definitions. An inequality constraint $g_j(x)\le 0$ is said to be active at +a point $x^*$ if $g_j(x^*)=0$. A point $x^*$ satisfying $g_j(x^*)\le 0$ is said +to be regular if the gradient vectors $\nabla g_j(x)$ of all active constraints +are linearly independent. + +Let $x^*$ be a regular point of the constraints of SOP and assume that all the +functions $f(x)$ and $g_j(x),j=1,2,\cdots,p$ are differentiable. If $x^*$ is a +local optimal solution, then there exist Lagrange multipliers +$\lambda_j,j=1,2,\cdots,p$ such that the following Kuhn-Tucker conditions hold, +\begin{equation} +\label{eq:ktc} +\left\{\begin{array}{l} + \nabla f(x^*)-\sum\limits_{j=1}^p\lambda_j\nabla g_j(x^*)=0\\[0.3cm] + \lambda_jg_j(x^*)=0,\quad j=1,2,\cdots,p\\[0.2cm] + \lambda_j\ge 0,\quad j=1,2,\cdots,p. +\end{array}\right. +\end{equation} +If all the functions $f(x)$ and $g_j(x),j=1,2,\cdots,p$ are convex and +differentiable, and the point $x^*$ satisfies the Kuhn-Tucker conditions +(\ref{eq:ktc}), then it has been proved that the point $x^*$ is a global optimal +solution of SOP. + +\subsection{Linear Programming} +\label{sec:lp} + +If the functions $f(x),g_j(x),j=1,2,\cdots,p$ are all linear, then SOP is called +a {\em linear programming}. + +The feasible set of linear is always convex. A point $x$ is called an extreme +point of convex set $S$ if $x\in S$ and $x$ cannot be expressed as a convex +combination of two points in $S$. It has been shown that the optimal solution to +linear programming corresponds to an extreme point of its feasible set provided +that the feasible set $S$ is bounded. This fact is the basis of the {\em simplex + algorithm} which was developed by Dantzig as a very efficient method for +solving linear programming. +\begin{table}[ht] +\centering + \centering + \caption*{Table~1\hskip1em This is an example for manually numbered table, which + would not appear in the list of tables} + \label{tab:badtabular2} + \begin{tabular}[c]{|m{1.5cm}|c|c|c|c|c|c|}\hline + \multicolumn{2}{|c|}{Network Topology} & \# of nodes & + \multicolumn{3}{c|}{\# of clients} & Server \\\hline + GT-ITM & Waxman Transit-Stub & 600 & + \multirow{2}{2em}{2\%}& + \multirow{2}{2em}{10\%}& + \multirow{2}{2em}{50\%}& + \multirow{2}{1.2in}{Max. Connectivity}\\\cline{1-3} + \multicolumn{2}{|c|}{Inet-2.1} & 6000 & & & &\\\hline + \multirow{2}{1.5cm}{Xue} & Rui & Ni &\multicolumn{4}{c|}{\multirow{2}*{\thuthesis}}\\\cline{2-3} + & \multicolumn{2}{c|}{ABCDEF} &\multicolumn{4}{c|}{} \\\hline +\end{tabular} +\end{table} + +Roughly speaking, the simplex algorithm examines only the extreme points of the +feasible set, rather than all feasible points. At first, the simplex algorithm +selects an extreme point as the initial point. The successive extreme point is +selected so as to improve the objective function value. The procedure is +repeated until no improvement in objective function value can be made. The last +extreme point is the optimal solution. + +\subsection{Nonlinear Programming} + +If at least one of the functions $f(x),g_j(x),j=1,2,\cdots,p$ is nonlinear, then +SOP is called a {\em nonlinear programming}. + +A large number of classical optimization methods have been developed to treat +special-structural nonlinear programming based on the mathematical theory +concerned with analyzing the structure of problems. +\begin{figure}[h] + \centering + \includegraphics{thu-lib-logo.pdf} + \caption*{Figure~1\quad This is an example for manually numbered figure, + which would not appear in the list of figures} + \label{tab:badfigure2} +\end{figure} + +Now we consider a nonlinear programming which is confronted solely with +maximizing a real-valued function with domain $\Real^n$. Whether derivatives are +available or not, the usual strategy is first to select a point in $\Real^n$ which +is thought to be the most likely place where the maximum exists. If there is no +information available on which to base such a selection, a point is chosen at +random. From this first point an attempt is made to construct a sequence of +points, each of which yields an improved objective function value over its +predecessor. The next point to be added to the sequence is chosen by analyzing +the behavior of the function at the previous points. This construction continues +until some termination criterion is met. Methods based upon this strategy are +called {\em ascent methods}, which can be classified as {\em direct methods}, +{\em gradient methods}, and {\em Hessian methods} according to the information +about the behavior of objective function $f$. Direct methods require only that +the function can be evaluated at each point. Gradient methods require the +evaluation of first derivatives of $f$. Hessian methods require the evaluation +of second derivatives. In fact, there is no superior method for all +problems. The efficiency of a method is very much dependent upon the objective +function. + +\subsection{Integer Programming} + +{\em Integer programming} is a special mathematical programming in which all of +the variables are assumed to be only integer values. When there are not only +integer variables but also conventional continuous variables, we call it {\em + mixed integer programming}. If all the variables are assumed either 0 or 1, +then the problem is termed a {\em zero-one programming}. Although integer +programming can be solved by an {\em exhaustive enumeration} theoretically, it +is impractical to solve realistically sized integer programming problems. The +most successful algorithm so far found to solve integer programming is called +the {\em branch-and-bound enumeration} developed by Balas (1965) and Dakin +(1965). The other technique to integer programming is the {\em cutting plane + method} developed by Gomory (1959). + +\hfill\textit{Uncertain Programming\/}\quad(\textsl{BaoDing Liu, 2006.2}) + +\section{单目标规划} +北冥有鱼,其名为鲲。鲲之大,不知其几千里也。化而为鸟,其名为鹏。鹏之背,不知其几 +千里也。怒而飞,其翼若垂天之云。是鸟也,海运则将徙于南冥。南冥者,天池也。 +\begin{equation}\tag*{(123)} + p(y|\mathbf{x}) = \frac{p(\mathbf{x},y)}{p(\mathbf{x})}= +\frac{p(\mathbf{x}|y)p(y)}{p(\mathbf{x})} +\end{equation} + +吾生也有涯,而知也无涯。以有涯随无涯,殆已!已而为知者,殆而已矣!为善无近名,为 +恶无近刑,缘督以为经,可以保身,可以全生,可以养亲,可以尽年。 + +\subsection{线性规划} +庖丁为文惠君解牛,手之所触,肩之所倚,足之所履,膝之所倚,砉然响然,奏刀騞然,莫 +不中音,合于桑林之舞,乃中经首之会。 +\begin{table}[ht] +\centering + \centering + \caption*{表~1\hskip1em 这是手动编号但不出现在索引中的一个表格例子} + \label{tab:badtabular3} + \begin{tabular}[c]{|m{1.5cm}|c|c|c|c|c|c|}\hline + \multicolumn{2}{|c|}{Network Topology} & \# of nodes & + \multicolumn{3}{c|}{\# of clients} & Server \\\hline + GT-ITM & Waxman Transit-Stub & 600 & + \multirow{2}{2em}{2\%}& + \multirow{2}{2em}{10\%}& + \multirow{2}{2em}{50\%}& + \multirow{2}{1.2in}{Max. Connectivity}\\\cline{1-3} + \multicolumn{2}{|c|}{Inet-2.1} & 6000 & & & &\\\hline + \multirow{2}{1.5cm}{Xue} & Rui & Ni &\multicolumn{4}{c|}{\multirow{2}*{\thuthesis}}\\\cline{2-3} + & \multicolumn{2}{c|}{ABCDEF} &\multicolumn{4}{c|}{} \\\hline +\end{tabular} +\end{table} + +文惠君曰:“嘻,善哉!技盖至此乎?”庖丁释刀对曰:“臣之所好者道也,进乎技矣。始臣之 +解牛之时,所见无非全牛者;三年之后,未尝见全牛也;方今之时,臣以神遇而不以目视, +官知止而神欲行。依乎天理,批大郤,导大窾,因其固然。技经肯綮之未尝,而况大坬乎! +良庖岁更刀,割也;族庖月更刀,折也;今臣之刀十九年矣,所解数千牛矣,而刀刃若新发 +于硎。彼节者有间而刀刃者无厚,以无厚入有间,恢恢乎其于游刃必有余地矣。是以十九年 +而刀刃若新发于硎。虽然,每至于族,吾见其难为,怵然为戒,视为止,行为迟,动刀甚微, +謋然已解,如土委地。提刀而立,为之而四顾,为之踌躇满志,善刀而藏之。” + +文惠君曰:“善哉!吾闻庖丁之言,得养生焉。” + + +\subsection{非线性规划} +孔子与柳下季为友,柳下季之弟名曰盗跖。盗跖从卒九千人,横行天下,侵暴诸侯。穴室枢 +户,驱人牛马,取人妇女。贪得忘亲,不顾父母兄弟,不祭先祖。所过之邑,大国守城,小 +国入保,万民苦之。孔子谓柳下季曰:“夫为人父者,必能诏其子;为人兄者,必能教其弟。 +若父不能诏其子,兄不能教其弟,则无贵父子兄弟之亲矣。今先生,世之才士也,弟为盗 +跖,为天下害,而弗能教也,丘窃为先生羞之。丘请为先生往说之。” +\begin{figure}[h] + \centering + \includegraphics{thu-whole-logo.pdf} + \caption*{图~1\hskip1em 这是手动编号但不出现索引中的图片的例子} + \label{tab:badfigure3} +\end{figure} + +柳下季曰:“先生言为人父者必能诏其子,为人兄者必能教其弟,若子不听父之诏,弟不受 +兄之教,虽今先生之辩,将奈之何哉?且跖之为人也,心如涌泉,意如飘风,强足以距敌, +辩足以饰非。顺其心则喜,逆其心则怒,易辱人以言。先生必无往。” + +孔子不听,颜回为驭,子贡为右,往见盗跖。 + +\subsection{整数规划} +盗跖乃方休卒徒大山之阳,脍人肝而餔之。孔子下车而前,见谒者曰:“鲁人孔丘,闻将军 +高义,敬再拜谒者。”谒者入通。盗跖闻之大怒,目如明星,发上指冠,曰:“此夫鲁国之 +巧伪人孔丘非邪?为我告之:尔作言造语,妄称文、武,冠枝木之冠,带死牛之胁,多辞缪 +说,不耕而食,不织而衣,摇唇鼓舌,擅生是非,以迷天下之主,使天下学士不反其本,妄 +作孝弟,而侥幸于封侯富贵者也。子之罪大极重,疾走归!不然,我将以子肝益昼餔之膳。” diff --git a/Master/texmf-dist/doc/latex/thuthesis/data/appendix01.tex b/Master/texmf-dist/doc/latex/thuthesis/data/appendix01.tex deleted file mode 100644 index f34536ed5b7..00000000000 --- a/Master/texmf-dist/doc/latex/thuthesis/data/appendix01.tex +++ /dev/null @@ -1,263 +0,0 @@ -\chapter{外文资料原文} -\label{cha:engorg} - -\title{The title of the English paper} - -\textbf{Abstract:} As one of the most widely used techniques in operations -research, \emph{ mathematical programming} is defined as a means of maximizing a -quantity known as \emph{bjective function}, subject to a set of constraints -represented by equations and inequalities. Some known subtopics of mathematical -programming are linear programming, nonlinear programming, multiobjective -programming, goal programming, dynamic programming, and multilevel -programming$^{[1]}$. - -It is impossible to cover in a single chapter every concept of mathematical -programming. This chapter introduces only the basic concepts and techniques of -mathematical programming such that readers gain an understanding of them -throughout the book$^{[2,3]}$. - - -\section{Single-Objective Programming} -The general form of single-objective programming (SOP) is written -as follows, -\begin{equation*} % 如果附录中的公式不想让它出现在公式索引中,那就请 - % 用 equation* -\left\{\begin{array}{l} -\max \,\,f(x)\\[0.1 cm] -\mbox{subject to:} \\ [0.1 cm] -\qquad g_j(x)\le 0,\quad j=1,2,\cdots,p -\end{array}\right. -\end{equation*} -which maximizes a real-valued function $f$ of -$x=(x_1,x_2,\cdots,x_n)$ subject to a set of constraints. - -\newcommand\Real{\mathbf{R}} -\newtheorem{mpdef}{Definition}[chapter] -\begin{mpdef} -In SOP, we call $x$ a decision vector, and -$x_1,x_2,\cdots,x_n$ decision variables. The function -$f$ is called the objective function. The set -\begin{equation*} -S=\left\{x\in\Real^n\bigm|g_j(x)\le 0,\,j=1,2,\cdots,p\right\} -\end{equation*} -is called the feasible set. An element $x$ in $S$ is called a -feasible solution. -\end{mpdef} - -\newtheorem{mpdefop}[mpdef]{Definition} -\begin{mpdefop} -A feasible solution $x^*$ is called the optimal -solution of SOP if and only if -\begin{equation} -f(x^*)\ge f(x) -\end{equation} -for any feasible solution $x$. -\end{mpdefop} - -One of the outstanding contributions to mathematical programming was known as -the Kuhn-Tucker conditions\ref{eq:ktc}. In order to introduce them, let us give -some definitions. An inequality constraint $g_j(x)\le 0$ is said to be active at -a point $x^*$ if $g_j(x^*)=0$. A point $x^*$ satisfying $g_j(x^*)\le 0$ is said -to be regular if the gradient vectors $\nabla g_j(x)$ of all active constraints -are linearly independent. - -Let $x^*$ be a regular point of the constraints of SOP and assume that all the -functions $f(x)$ and $g_j(x),j=1,2,\cdots,p$ are differentiable. If $x^*$ is a -local optimal solution, then there exist Lagrange multipliers -$\lambda_j,j=1,2,\cdots,p$ such that the following Kuhn-Tucker conditions hold, -\begin{equation} -\label{eq:ktc} -\left\{\begin{array}{l} - \nabla f(x^*)-\sum\limits_{j=1}^p\lambda_j\nabla g_j(x^*)=0\\[0.3cm] - \lambda_jg_j(x^*)=0,\quad j=1,2,\cdots,p\\[0.2cm] - \lambda_j\ge 0,\quad j=1,2,\cdots,p. -\end{array}\right. -\end{equation} -If all the functions $f(x)$ and $g_j(x),j=1,2,\cdots,p$ are convex and -differentiable, and the point $x^*$ satisfies the Kuhn-Tucker conditions -(\ref{eq:ktc}), then it has been proved that the point $x^*$ is a global optimal -solution of SOP. - -\subsection{Linear Programming} -\label{sec:lp} - -If the functions $f(x),g_j(x),j=1,2,\cdots,p$ are all linear, then SOP is called -a {\em linear programming}. - -The feasible set of linear is always convex. A point $x$ is called an extreme -point of convex set $S$ if $x\in S$ and $x$ cannot be expressed as a convex -combination of two points in $S$. It has been shown that the optimal solution to -linear programming corresponds to an extreme point of its feasible set provided -that the feasible set $S$ is bounded. This fact is the basis of the {\em simplex - algorithm} which was developed by Dantzig as a very efficient method for -solving linear programming. -\begin{table}[ht] -\centering - \centering - \caption*{Table~1\hskip1em This is an example for manually numbered table, which - would not appear in the list of tables} - \label{tab:badtabular2} - \begin{tabular}[c]{|m{1.5cm}|c|c|c|c|c|c|}\hline - \multicolumn{2}{|c|}{Network Topology} & \# of nodes & - \multicolumn{3}{c|}{\# of clients} & Server \\\hline - GT-ITM & Waxman Transit-Stub & 600 & - \multirow{2}{2em}{2\%}& - \multirow{2}{2em}{10\%}& - \multirow{2}{2em}{50\%}& - \multirow{2}{1.2in}{Max. Connectivity}\\\cline{1-3} - \multicolumn{2}{|c|}{Inet-2.1} & 6000 & & & &\\\hline - \multirow{2}{1.5cm}{Xue} & Rui & Ni &\multicolumn{4}{c|}{\multirow{2}*{\thuthesis}}\\\cline{2-3} - & \multicolumn{2}{c|}{ABCDEF} &\multicolumn{4}{c|}{} \\\hline -\end{tabular} -\end{table} - -Roughly speaking, the simplex algorithm examines only the extreme points of the -feasible set, rather than all feasible points. At first, the simplex algorithm -selects an extreme point as the initial point. The successive extreme point is -selected so as to improve the objective function value. The procedure is -repeated until no improvement in objective function value can be made. The last -extreme point is the optimal solution. - -\subsection{Nonlinear Programming} - -If at least one of the functions $f(x),g_j(x),j=1,2,\cdots,p$ is nonlinear, then -SOP is called a {\em nonlinear programming}. - -A large number of classical optimization methods have been developed to treat -special-structural nonlinear programming based on the mathematical theory -concerned with analyzing the structure of problems. -\begin{figure}[h] - \centering - \includegraphics{thu-lib-logo.pdf} - \caption*{Figure~1\quad This is an example for manually numbered figure, - which would not appear in the list of figures} - \label{tab:badfigure2} -\end{figure} - -Now we consider a nonlinear programming which is confronted solely with -maximizing a real-valued function with domain $\Real^n$. Whether derivatives are -available or not, the usual strategy is first to select a point in $\Real^n$ which -is thought to be the most likely place where the maximum exists. If there is no -information available on which to base such a selection, a point is chosen at -random. From this first point an attempt is made to construct a sequence of -points, each of which yields an improved objective function value over its -predecessor. The next point to be added to the sequence is chosen by analyzing -the behavior of the function at the previous points. This construction continues -until some termination criterion is met. Methods based upon this strategy are -called {\em ascent methods}, which can be classified as {\em direct methods}, -{\em gradient methods}, and {\em Hessian methods} according to the information -about the behavior of objective function $f$. Direct methods require only that -the function can be evaluated at each point. Gradient methods require the -evaluation of first derivatives of $f$. Hessian methods require the evaluation -of second derivatives. In fact, there is no superior method for all -problems. The efficiency of a method is very much dependent upon the objective -function. - -\subsection{Integer Programming} - -{\em Integer programming} is a special mathematical programming in which all of -the variables are assumed to be only integer values. When there are not only -integer variables but also conventional continuous variables, we call it {\em - mixed integer programming}. If all the variables are assumed either 0 or 1, -then the problem is termed a {\em zero-one programming}. Although integer -programming can be solved by an {\em exhaustive enumeration} theoretically, it -is impractical to solve realistically sized integer programming problems. The -most successful algorithm so far found to solve integer programming is called -the {\em branch-and-bound enumeration} developed by Balas (1965) and Dakin -(1965). The other technique to integer programming is the {\em cutting plane - method} developed by Gomory (1959). - -\hfill\textit{Uncertain Programming\/}\quad(\textsl{BaoDing Liu, 2006.2}) - -\section*{References} -\noindent{\itshape NOTE: These references are only for demonstration. They are - not real citations in the original text.} - -\begin{translationbib} -\item Donald E. Knuth. The \TeX book. Addison-Wesley, 1984. ISBN: 0-201-13448-9 -\item Paul W. Abrahams, Karl Berry and Kathryn A. Hargreaves. \TeX\ for the - Impatient. Addison-Wesley, 1990. ISBN: 0-201-51375-7 -\item David Salomon. The advanced \TeX book. New York : Springer, 1995. ISBN:0-387-94556-3 -\end{translationbib} - -\chapter{外文资料的调研阅读报告或书面翻译} - -\title{英文资料的中文标题} - -{\heiti 摘要:} 本章为外文资料翻译内容。如果有摘要可以直接写上来,这部分好像没有 -明确的规定。 - -\section{单目标规划} -北冥有鱼,其名为鲲。鲲之大,不知其几千里也。化而为鸟,其名为鹏。鹏之背,不知其几 -千里也。怒而飞,其翼若垂天之云。是鸟也,海运则将徙于南冥。南冥者,天池也。 -\begin{equation}\tag*{(123)} - p(y|\mathbf{x}) = \frac{p(\mathbf{x},y)}{p(\mathbf{x})}= -\frac{p(\mathbf{x}|y)p(y)}{p(\mathbf{x})} -\end{equation} - -吾生也有涯,而知也无涯。以有涯随无涯,殆已!已而为知者,殆而已矣!为善无近名,为 -恶无近刑,缘督以为经,可以保身,可以全生,可以养亲,可以尽年。 - -\subsection{线性规划} -庖丁为文惠君解牛,手之所触,肩之所倚,足之所履,膝之所倚,砉然响然,奏刀騞然,莫 -不中音,合于桑林之舞,乃中经首之会。 -\begin{table}[ht] -\centering - \centering - \caption*{表~1\hskip1em 这是手动编号但不出现在索引中的一个表格例子} - \label{tab:badtabular3} - \begin{tabular}[c]{|m{1.5cm}|c|c|c|c|c|c|}\hline - \multicolumn{2}{|c|}{Network Topology} & \# of nodes & - \multicolumn{3}{c|}{\# of clients} & Server \\\hline - GT-ITM & Waxman Transit-Stub & 600 & - \multirow{2}{2em}{2\%}& - \multirow{2}{2em}{10\%}& - \multirow{2}{2em}{50\%}& - \multirow{2}{1.2in}{Max. Connectivity}\\\cline{1-3} - \multicolumn{2}{|c|}{Inet-2.1} & 6000 & & & &\\\hline - \multirow{2}{1.5cm}{Xue} & Rui & Ni &\multicolumn{4}{c|}{\multirow{2}*{\thuthesis}}\\\cline{2-3} - & \multicolumn{2}{c|}{ABCDEF} &\multicolumn{4}{c|}{} \\\hline -\end{tabular} -\end{table} - -文惠君曰:“嘻,善哉!技盖至此乎?”庖丁释刀对曰:“臣之所好者道也,进乎技矣。始臣之 -解牛之时,所见无非全牛者;三年之后,未尝见全牛也;方今之时,臣以神遇而不以目视, -官知止而神欲行。依乎天理,批大郤,导大窾,因其固然。技经肯綮之未尝,而况大坬乎! -良庖岁更刀,割也;族庖月更刀,折也;今臣之刀十九年矣,所解数千牛矣,而刀刃若新发 -于硎。彼节者有间而刀刃者无厚,以无厚入有间,恢恢乎其于游刃必有余地矣。是以十九年 -而刀刃若新发于硎。虽然,每至于族,吾见其难为,怵然为戒,视为止,行为迟,动刀甚微, -謋然已解,如土委地。提刀而立,为之而四顾,为之踌躇满志,善刀而藏之。” - -文惠君曰:“善哉!吾闻庖丁之言,得养生焉。” - - -\subsection{非线性规划} -孔子与柳下季为友,柳下季之弟名曰盗跖。盗跖从卒九千人,横行天下,侵暴诸侯。穴室枢 -户,驱人牛马,取人妇女。贪得忘亲,不顾父母兄弟,不祭先祖。所过之邑,大国守城,小 -国入保,万民苦之。孔子谓柳下季曰:“夫为人父者,必能诏其子;为人兄者,必能教其弟。 -若父不能诏其子,兄不能教其弟,则无贵父子兄弟之亲矣。今先生,世之才士也,弟为盗 -跖,为天下害,而弗能教也,丘窃为先生羞之。丘请为先生往说之。” -\begin{figure}[h] - \centering - \includegraphics{thu-whole-logo.pdf} - \caption*{图~1\hskip1em 这是手动编号但不出现索引中的图片的例子} - \label{tab:badfigure3} -\end{figure} - -柳下季曰:“先生言为人父者必能诏其子,为人兄者必能教其弟,若子不听父之诏,弟不受 -兄之教,虽今先生之辩,将奈之何哉?且跖之为人也,心如涌泉,意如飘风,强足以距敌, -辩足以饰非。顺其心则喜,逆其心则怒,易辱人以言。先生必无往。” - -孔子不听,颜回为驭,子贡为右,往见盗跖。 - -\subsection{整数规划} -盗跖乃方休卒徒大山之阳,脍人肝而餔之。孔子下车而前,见谒者曰:“鲁人孔丘,闻将军 -高义,敬再拜谒者。”谒者入通。盗跖闻之大怒,目如明星,发上指冠,曰:“此夫鲁国之 -巧伪人孔丘非邪?为我告之:尔作言造语,妄称文、武,冠枝木之冠,带死牛之胁,多辞缪 -说,不耕而食,不织而衣,摇唇鼓舌,擅生是非,以迷天下之主,使天下学士不反其本,妄 -作孝弟,而侥幸于封侯富贵者也。子之罪大极重,疾走归!不然,我将以子肝益昼餔之膳。” - - -\chapter{其它附录} -前面两个附录主要是给本科生做例子。其它附录的内容可以放到这里,当然如果你愿意,可 -以把这部分也放到独立的文件中,然后将其 \cs{input} 到主文件中。 diff --git a/Master/texmf-dist/doc/latex/thuthesis/data/chap01.tex b/Master/texmf-dist/doc/latex/thuthesis/data/chap01.tex index 7277f2fb259..e1ab5e19d8f 100644 --- a/Master/texmf-dist/doc/latex/thuthesis/data/chap01.tex +++ b/Master/texmf-dist/doc/latex/thuthesis/data/chap01.tex @@ -1,3 +1,5 @@ +% !TeX root = ../main.tex + \chapter{带 English 的标题} \label{cha:intro} @@ -68,7 +70,7 @@ \subsection{基本表格} \label{sec:basictable} -模板中关于表格的宏包有三个:\pkg{booktabs}、\pkg{array} 和 \pkg{longtabular},命 +模板中关于表格的宏包有三个:\pkg{booktabs}、\pkg{array} 和 \pkg{longtable},命 令有一个 \cs{hlinewd}。三线表可以用 \pkg{booktabs} 提供 的 \cs{toprule}、\cs{midrule} 和 \cs{bottomrule}。它们与 \pkg{longtable} 能很好的 配合使用。如果表格比较简单的话可以直接用命令 \cs{hlinewd}\marg{width} 控制。 @@ -85,9 +87,9 @@ thuthesis.ins & \LaTeX{} 安装文件,DocStrip\footnote{表格中的脚注} \\ thuthesis.dtx & 所有的一切都在这里面\footnote{再来一个}。\\ thuthesis.cls & 模板类文件。\\ - thuthesis-numeric.bst & 参考文献 Bib\TeX\ 样式文件。\\ - thuthesis-author-year.bst & 参考文献 Bib\TeX\ 样式文件。\\ - thuthesis.sty & 常用的包和命令写在这里,减轻主文件的负担。\\ + thuthesis-numeric.bst & 参考文献 BibTeX 样式文件。\\ + thuthesis-author-year.bst & 参考文献 BibTeX 样式文件。\\ + thusetup.tex & 基本配置和常用的包、命令,减轻主文件的负担。\\ \bottomrule[1.5pt] \end{tabularx} \end{minipage} @@ -286,9 +288,9 @@ EP.B.8 & 126.74 & 0.003 & 0.017 & 0.005 & 0.083 & 1656 \\ \bottomrule[1.5pt] \end{longtable} -要想用好论文模板还是得提前学习一些 \TeX/\LaTeX{}的相关知识,具备一些基本能力,掌 +要想用好论文模板还是得提前学习一些 \TeX/\LaTeX{} 的相关知识,具备一些基本能力,掌 握一些常见技巧,否则一旦遇到问题还真是比较麻烦。我们见过很多这样的同学,一直以来 -都是使用 Word 等字处理工具,以为 \LaTeX{}模板的用法也应该类似,所以就沿袭同样的思 +都是使用 Word 等字处理工具,以为 \LaTeX{} 模板的用法也应该类似,所以就沿袭同样的思 路来对待这种所见非所得的排版工具,结果被折腾的焦头烂额,疲惫不堪。 如果您要排版的表格长度超过一页,那么推荐使用 \pkg{longtable} 或者 \pkg{supertabular} @@ -331,6 +333,7 @@ EP.B.8 & 126.74 & 0.003 & 0.017 & 0.005 & 0.083 & 1656 \\ 杰出的文学家,哲学家,同时也是一位政治改革家。与韩愈共同倡导唐代古文运动,并称 韩柳\footnote{唐宋八大家之首二位。}。 \end{minipage} +\\ 唐朝安史之乱后,宦官专权,藩镇割据,土地兼并日渐严重,社会生产破坏严重,民不聊生。柳宗 元对这种社会现实极为不满,他积极参加了王叔文领导的“永济革新”,并成为这一 @@ -504,7 +507,7 @@ V_j & = v_j, & \qquad X_j & = x_j, 当然参考文献可以直接写 \cs{bibitem},虽然费点功夫,但是好控制,各种格式可以自己随意改 写。 -本模板推荐使用 BIB\TeX,分别提供数字引用(\texttt{thuthesis-numeric.bst})和作 +本模板推荐使用 BibTeX,分别提供数字引用(\texttt{thuthesis-numeric.bst})和作 者年份引用(\texttt{thuthesis-author-year.bst})样式,基本符合学校的参考文献格式 (如专利等引用未加详细测试)。看看这个例子,关于书的~\cite{tex, companion, ColdSources},还有这些~\cite{Krasnogor2004e, clzs, zjsw},关于杂志 @@ -532,21 +535,19 @@ V_j & = v_j, & \qquad X_j & = x_j, \section{公式} \label{sec:equation} -\renewcommand\vec{\symbf} -\newcommand\mat{\symbf} -贝叶斯公式如式~(\ref{equ:chap1:bayes}),其中 $p(y|\vec{x})$ 为后验; -$p(\vec{x})$ 为先验;分母 $p(\vec{x})$ 为归一化因子。 +贝叶斯公式如式~(\ref{equ:chap1:bayes}),其中 $p(y|\vx)$ 为后验; +$p(\vx)$ 为先验;分母 $p(\vx)$ 为归一化因子。 \begin{equation} \label{equ:chap1:bayes} -p(y|\vec{x}) = \frac{p(\vec{x},y)}{p(\vec{x})}= -\frac{p(\vec{x}|y)p(y)}{p(\vec{x})} +p(y|\vx) = \frac{p(\vx,y)}{p(\vx)}= +\frac{p(\vx|y)p(y)}{p(\vx)} \end{equation} 论文里面公式越多,\TeX{} 就越 happy。再看一个 \pkg{amsmath} 的例子: \newcommand{\envert}[1]{\left\lvert#1\right\rvert} \begin{equation}\label{detK2} -\det\mat{K}(t=1,t_1,\dots,t_n)=\sum_{I\in\vec{n}}(-1)^{\envert{I}} -\prod_{i\in I}t_i\prod_{j\in I}(D_j+\lambda_jt_j)\det\vec{A} +\det\mK(t=1,t_1,\dots,t_n)=\sum_{I\in\vn}(-1)^{\envert{I}} +\prod_{i\in I}t_i\prod_{j\in I}(D_j+\lambda_jt_j)\det\mA ^{(\lambda)}(\overline{I}|\overline{I})=0. \end{equation} diff --git a/Master/texmf-dist/doc/latex/thuthesis/data/chap02.tex b/Master/texmf-dist/doc/latex/thuthesis/data/chap02.tex index e7604f525c0..d4200f2dc49 100644 --- a/Master/texmf-dist/doc/latex/thuthesis/data/chap02.tex +++ b/Master/texmf-dist/doc/latex/thuthesis/data/chap02.tex @@ -1,5 +1,7 @@ -\chapter{中华人民共和国} -\label{cha:china} +% !TeX root = ../main.tex + +\chapter{图表公式例子} +\label{cha:chapter02} \section{其它例子} \label{sec:other} @@ -8,8 +10,8 @@ 习一下: \begin{equation} \label{equ:chap2:bayes} -p(y|\vec{x}) = \frac{p(\vec{x},y)}{p(\vec{x})}= -\frac{p(\vec{x}|y)p(y)}{p(\vec{x})} +p(y|\vx) = \frac{p(\vx,y)}{p(\vx)}= +\frac{p(\vx|y)p(y)}{p(\vx)} \end{equation} \subsection{绘图} @@ -23,7 +25,7 @@ jPicEdt, jaxdraw 等等。 \subsection{插图} \label{sec:graphs} -强烈推荐《\LaTeXe\ 插图指南》!关于子图形的使用细节请参看 \pkg{subcaption} 宏包的说明文档。 +强烈推荐《\LaTeXe{} 插图指南》!关于子图形的使用细节请参看 \pkg{subcaption} 宏包的说明文档。 \subsubsection{一个图形} \label{sec:onefig} diff --git a/Master/texmf-dist/doc/latex/thuthesis/data/cover.tex b/Master/texmf-dist/doc/latex/thuthesis/data/cover.tex deleted file mode 100644 index 8aae6b84432..00000000000 --- a/Master/texmf-dist/doc/latex/thuthesis/data/cover.tex +++ /dev/null @@ -1,118 +0,0 @@ -\thusetup{ - %****************************** - % 注意: - % 1. 配置里面不要出现空行 - % 2. 不需要的配置信息可以删除 - %****************************** - % - %===== - % 秘级 - %===== - secretlevel={秘密}, - secretyear={10}, - % - %========= - % 中文信息 - %========= - ctitle={清华大学学位论文 \LaTeX\ 模板\\使用示例文档 v\version}, - cdegree={工学硕士}, - cdepartment={计算机科学与技术系}, - cmajor={计算机科学与技术}, - cauthor={薛瑞尼}, - csupervisor={郑纬民教授}, - cassosupervisor={陈文光教授}, % 副指导老师 - ccosupervisor={某某某教授}, % 联合指导老师 - % 日期自动使用当前时间,若需指定按如下方式修改: - % cdate={超新星纪元}, - % - % 博士后专有部分 - catalognumber = {分类号}, % 可以留空 - udc = {UDC}, % 可以留空 - id = {编号}, % 可以留空: id={}, - cfirstdiscipline = {计算机科学与技术}, % 流动站(一级学科)名称 - cseconddiscipline = {系统结构}, % 专 业(二级学科)名称 - postdoctordate = {2009 年 7 月——2011 年 7 月}, % 工作完成日期 - postdocstartdate = {2009 年 7 月 1 日}, % 研究工作起始时间 - postdocenddate = {2011 年 7 月 1 日}, % 研究工作期满时间 - % - %========= - % 英文信息 - %========= - etitle={An Introduction to \LaTeX{} Thesis Template of Tsinghua University v\version}, - % 这块比较复杂,需要分情况讨论: - % 1. 学术型硕士 - % edegree:必须为Master of Arts或Master of Science(注意大小写) - % “哲学、文学、历史学、法学、教育学、艺术学门类,公共管理学科 - % 填写Master of Arts,其它填写Master of Science” - % emajor:“获得一级学科授权的学科填写一级学科名称,其它填写二级学科名称” - % 2. 专业型硕士 - % edegree:“填写专业学位英文名称全称” - % emajor:“工程硕士填写工程领域,其它专业学位不填写此项” - % 3. 学术型博士 - % edegree:Doctor of Philosophy(注意大小写) - % emajor:“获得一级学科授权的学科填写一级学科名称,其它填写二级学科名称” - % 4. 专业型博士 - % edegree:“填写专业学位英文名称全称” - % emajor:不填写此项 - edegree={Doctor of Engineering}, - emajor={Computer Science and Technology}, - eauthor={Xue Ruini}, - esupervisor={Professor Zheng Weimin}, - eassosupervisor={Chen Wenguang}, - % 日期自动生成,若需指定按如下方式修改: - % edate={December, 2005} - % - % 关键词用“英文逗号”分割 - ckeywords={TeX, LaTeX, CJK, 模板, 论文}, - ekeywords={TeX, LaTeX, CJK, template, thesis} -} - -% 定义中英文摘要和关键字 -\begin{cabstract} - 论文的摘要是对论文研究内容和成果的高度概括。摘要应对论文所研究的问题及其研究目 - 的进行描述,对研究方法和过程进行简单介绍,对研究成果和所得结论进行概括。摘要应 - 具有独立性和自明性,其内容应包含与论文全文同等量的主要信息。使读者即使不阅读全 - 文,通过摘要就能了解论文的总体内容和主要成果。 - - 论文摘要的书写应力求精确、简明。切忌写成对论文书写内容进行提要的形式,尤其要避 - 免“第 1 章……;第 2 章……;……”这种或类似的陈述方式。 - - 本文介绍清华大学论文模板 \thuthesis{} 的使用方法。本模板符合学校的本科、硕士、 - 博士论文格式要求。 - - 本文的创新点主要有: - \begin{itemize} - \item 用例子来解释模板的使用方法; - \item 用废话来填充无关紧要的部分; - \item 一边学习摸索一边编写新代码。 - \end{itemize} - - 关键词是为了文献标引工作、用以表示全文主要内容信息的单词或术语。关键词不超过 5 - 个,每个关键词中间用分号分隔。(模板作者注:关键词分隔符不用考虑,模板会自动处 - 理。英文关键词同理。) -\end{cabstract} - -% 如果习惯关键字跟在摘要文字后面,可以用直接命令来设置,如下: -% \ckeywords{\TeX, \LaTeX, CJK, 模板, 论文} - -\begin{eabstract} - An abstract of a dissertation is a summary and extraction of research work - and contributions. Included in an abstract should be description of research - topic and research objective, brief introduction to methodology and research - process, and summarization of conclusion and contributions of the - research. An abstract should be characterized by independence and clarity and - carry identical information with the dissertation. It should be such that the - general idea and major contributions of the dissertation are conveyed without - reading the dissertation. - - An abstract should be concise and to the point. It is a misunderstanding to - make an abstract an outline of the dissertation and words ``the first - chapter'', ``the second chapter'' and the like should be avoided in the - abstract. - - Key words are terms used in a dissertation for indexing, reflecting core - information of the dissertation. An abstract may contain a maximum of 5 key - words, with semi-colons used in between to separate one another. -\end{eabstract} - -% \ekeywords{\TeX, \LaTeX, CJK, template, thesis} diff --git a/Master/texmf-dist/doc/latex/thuthesis/data/denotation.tex b/Master/texmf-dist/doc/latex/thuthesis/data/denotation.tex index 46d4172d85c..aeefccbf9a8 100644 --- a/Master/texmf-dist/doc/latex/thuthesis/data/denotation.tex +++ b/Master/texmf-dist/doc/latex/thuthesis/data/denotation.tex @@ -1,3 +1,5 @@ +% !TeX root = ../main.tex + \begin{denotation}[3cm] \item[HPC] 高性能计算 (High Performance Computing) \item[cluster] 集群 diff --git a/Master/texmf-dist/doc/latex/thuthesis/data/resume.tex b/Master/texmf-dist/doc/latex/thuthesis/data/resume.tex index 890bd51305a..80bd6aa06b2 100644 --- a/Master/texmf-dist/doc/latex/thuthesis/data/resume.tex +++ b/Master/texmf-dist/doc/latex/thuthesis/data/resume.tex @@ -1,3 +1,5 @@ +% !TeX root = ../main.tex + \begin{resume} \resumeitem{个人简历} diff --git a/Master/texmf-dist/doc/latex/thuthesis/dtx-style.sty b/Master/texmf-dist/doc/latex/thuthesis/dtx-style.sty index 0a193c42672..0481881cd92 100644 --- a/Master/texmf-dist/doc/latex/thuthesis/dtx-style.sty +++ b/Master/texmf-dist/doc/latex/thuthesis/dtx-style.sty @@ -8,7 +8,7 @@ %% %% This is a generated file. %% -%% Copyright (C) 2005-2019 by Ruini Xue +%% Copyright (C) 2005-2020 by Ruini Xue %% %% This work may be distributed and/or modified under the %% conditions of the LaTeX Project Public License, either version 1.3 @@ -22,20 +22,19 @@ %% through LaTeX. %% \RequirePackage{ifxetex} -\ifxetex\else - \ClassError{thuthesis}{You should use XeLaTeX}{} - \end{document} -\fi +\RequireXeTeX \ProvidesPackage{dtx-style} \RequirePackage{hypdoc} \RequirePackage{ifthen} +\RequirePackage{fontspec}[2017/01/20] +\RequirePackage{amsmath} +\RequirePackage{unicode-math} \RequirePackage[UTF8,scheme=chinese]{ctex} -\RequirePackage{newpxtext} -\RequirePackage{newpxmath} \RequirePackage[ top=2.5cm, bottom=2.5cm, left=4cm, right=2cm, headsep=3mm]{geometry} +\RequirePackage{hologo} \RequirePackage{array,longtable,booktabs} \RequirePackage{listings} \RequirePackage{fancyhdr} @@ -44,9 +43,54 @@ \RequirePackage{etoolbox} \RequirePackage{metalogo} -\ifthenelse{\equal{\@nameuse{g__ctex_fontset_tl}}{mac}}{% +\ifthenelse{\equal{\@nameuse{g__ctex_fontset_tl}}{mac}}{ + \setmainfont{Palatino} + \setsansfont[Scale=MatchLowercase]{Helvetica} + \setmonofont[Scale=MatchLowercase]{Menlo} \xeCJKsetwidth{‘’“”}{1em} -}{} +}{ + \setmainfont[ + Extension = .otf, + UprightFont = *-regular, + BoldFont = *-bold, + ItalicFont = *-italic, + BoldItalicFont = *-bolditalic, + ]{texgyrepagella} + \setsansfont[ + Extension = .otf, + UprightFont = *-regular, + BoldFont = *-bold, + ItalicFont = *-italic, + BoldItalicFont = *-bolditalic, + ]{texgyreheros} + \setmonofont[ + Extension = .otf, + UprightFont = *-regular, + BoldFont = *-bold, + ItalicFont = *-italic, + BoldItalicFont = *-bolditalic, + Scale = MatchLowercase, + ]{texgyrecursor} +} +\unimathsetup{ + math-style=ISO, + bold-style=ISO, +} +\IfFontExistsTF{XITSMath-Regular.otf}{ + \setmathfont[ + Extension = .otf, + BoldFont = XITSMath-Bold, + StylisticSet = 8, + ]{XITSMath-Regular} + \setmathfont[range={cal,bfcal},StylisticSet=1]{XITSMath-Regular.otf} +}{ + \setmathfont[ + Extension = .otf, + BoldFont = *bold, + StylisticSet = 8, + ]{xits-math} + \setmathfont[range={cal,bfcal},StylisticSet=1]{xits-math.otf} +} \colorlet{thu@macro}{blue!60!black} \colorlet{thu@env}{blue!70!black} @@ -101,7 +145,7 @@ breakautoindent=true, columns=flexible, keepspaces=true, - gobble=2, + gobble=4, framesep=3pt, rulesep=1pt, framerule=1pt, diff --git a/Master/texmf-dist/doc/latex/thuthesis/latexmkrc b/Master/texmf-dist/doc/latex/thuthesis/latexmkrc index d9969694c22..3ba76129433 100644 --- a/Master/texmf-dist/doc/latex/thuthesis/latexmkrc +++ b/Master/texmf-dist/doc/latex/thuthesis/latexmkrc @@ -1,14 +1,23 @@ # vim: set ft=perl: -$xdvipdfmx="xdvipdfmx -q -E -o %D %O %S"; -$clean_ext = 'thm bbl hd loe synctex.gz xdv'; -$makeindex = 'makeindex -s gind.ist %O -o %D %S'; -add_cus_dep('glo', 'gls', 0, 'makeglo2gls'); -sub makeglo2gls { + +$pdf_mode = 5; + +$xelatex = "xelatex -file-line-error -halt-on-error -interaction=nonstopmode -no-pdf -synctex=1 %O %S"; +$xdvipdfmx = "xdvipdfmx -q -E -o %D %O %S"; + +$bibtex_use = 1.5; + +$clean_ext = "hd loe synctex.gz thm xdv"; + +$makeindex = "makeindex -s gind.ist %O -o %D %S"; +add_cus_dep('glo', 'gls', 0, 'glo2gls'); +sub glo2gls { system("makeindex -s gglo.ist -o \"$_[0].gls\" \"$_[0].glo\""); } -push @generated_exts, "glo", "gls"; +push @generated_exts, 'glo', 'gls'; + add_cus_dep('nlo', 'nls', 0, 'nlo2nls'); sub nlo2nls { system("makeindex -s nomencl.ist -o \"$_[0].nls\" \"$_[0].nlo\""); } -push @generated_exts, "nlo", "nls"; +push @generated_exts, 'nlo', 'nls'; diff --git a/Master/texmf-dist/doc/latex/thuthesis/main.pdf b/Master/texmf-dist/doc/latex/thuthesis/main.pdf index 35f10b2a08b..25ebfc57028 100644 Binary files a/Master/texmf-dist/doc/latex/thuthesis/main.pdf and b/Master/texmf-dist/doc/latex/thuthesis/main.pdf differ diff --git a/Master/texmf-dist/doc/latex/thuthesis/main.tex b/Master/texmf-dist/doc/latex/thuthesis/main.tex index f0acc491aa8..aa452200541 100644 --- a/Master/texmf-dist/doc/latex/thuthesis/main.tex +++ b/Master/texmf-dist/doc/latex/thuthesis/main.tex @@ -1,76 +1,72 @@ -\documentclass[degree=master,tocarialchapter]{thuthesis} -% 选项 -% degree=[bachelor|master|doctor|postdoctor], % 必选,学位类型 -% language=[chinese|english], % 可选(默认:chinese),论文的主要语言 -% secret, % 可选(默认:关闭),是否有密级 -% tocarialchapter, % 可选(默认:关闭),章目录中使用黑体(这项表示同时打开下面两项) -% tocarialchapterentry, % 可选(默认:关闭),单独控制章标题在目录中使用黑体 -% tocarialchapterpage, % 可选(默认:关闭),单独控制章页码在目录中使用黑体 +% !TeX encoding = UTF-8 +% !TeX program = xelatex +% !TeX spellcheck = en_US -% 所有其它可能用到的包都统一放到这里了,可以根据自己的实际添加或者删除。 -\usepackage{thuthesis} +\documentclass[fontset=windows,degree=master]{thuthesis} + % 学位 degree: + % doctor | master | bachelor | postdoc + % 学位类型 degree-type: + % academic(默认)| professional -% 定义所有的图片文件在 figures 子目录下 -\graphicspath{{figures/}} -% 可以在这里修改配置文件中的定义。导言区可以使用中文。 -% \def\myname{薛瑞尼} +% 论文基本配置,加载宏包等全局配置 +\input{thusetup.tex} + \begin{document} -%%% 封面部分 +% 封面 +\maketitle + +% 使用授权的说明 +\copyrightpage + \frontmatter -\input{data/cover} -% 如果使用授权说明扫描页,将可选参数中指定为扫描得到的 PDF 文件名,例如: -% \makecover[scan-auth.pdf] -\makecover +\input{data/abstract.tex} -%% 目录 +% 目录 \tableofcontents -%% 符号对照表 +% 符号对照表 \input{data/denotation} -%%% 正文部分 +% 正文部分 \mainmatter \input{data/chap01} \input{data/chap02} -%%% 其它部分 +% 其它部分 \backmatter -%% 本科生要这几个索引,研究生不要。选择性留下。 -% 插图索引 -\listoffigures -% 表格索引 -\listoftables -% 公式索引 -\listofequations +%% 本科生要求的几个索引。 +% \listoffigures % 插图索引 +% \listoftables % 表格索引 +% \listofequations % 公式索引 - -%% 参考文献 -% 注意:至少需要引用一篇参考文献,否则下面两行可能引起编译错误。 -% 如果不需要参考文献,请将下面两行删除或注释掉。 +% 参考文献 \bibliographystyle{thuthesis-numeric} % 顺序编码制 % \bibliographystyle{thuthesis-author-year} % 著者-出版年制 % \bibliographystyle{thuthesis-bachelor} % 本科生参考文献的著录格式 \bibliography{ref/refs} +% 致谢 +\input{data/acknowledgements} -%% 致谢 -\input{data/ack} +% 声明 +\statement -%% 附录 -\begin{appendix} -\input{data/appendix01} -\end{appendix} +% 附录 +\appendix +% \input{data/appendix-survey} % 本科生:外文资料的调研阅读报告 +% \input{data/appendix-translation} % 本科生:外文资料的书面翻译 +\input{data/appendix} -%% 个人简历 +% 个人简历 \input{data/resume} -%% 本科生进行格式审查是需要下面这个表格,答辩可能不需要。选择性留下。 -% 综合论文训练记录表 -\includepdf[pages=-]{scan-record.pdf} +% 本科生的综合论文训练记录表 +% \includepdf[pages=-]{scan-record.pdf} + \end{document} diff --git a/Master/texmf-dist/doc/latex/thuthesis/math_commands.tex b/Master/texmf-dist/doc/latex/thuthesis/math_commands.tex new file mode 100644 index 00000000000..5fc9be6751a --- /dev/null +++ b/Master/texmf-dist/doc/latex/thuthesis/math_commands.tex @@ -0,0 +1,290 @@ +% Adapted for use with thuthesis. +% Original code is at https://github.com/goodfeli/dlbook_notation/blob/master/math_commands.tex + +%%%%% NEW MATH DEFINITIONS %%%%% + +\newcommand\ceil[1]{\lceil #1 \rceil} +\newcommand\floor[1]{\lfloor #1 \rfloor} + + +% Vectors +\newcommand\Vector[1]{\symbf{#1}} + +\newcommand\0{{\Vector{0}}} +\newcommand\vzero{{\Vector{0}}} +\newcommand\1{{\Vector{1}}} +\newcommand\vone{{\Vector{1}}} + +\newcommand\va{{\Vector{a}}} +\newcommand\vb{{\Vector{b}}} +\newcommand\vc{{\Vector{c}}} +\newcommand\vd{{\Vector{d}}} +\newcommand\ve{{\Vector{e}}} +\newcommand\vf{{\Vector{f}}} +\newcommand\vg{{\Vector{g}}} +\newcommand\vh{{\Vector{h}}} +\newcommand\vi{{\Vector{i}}} +\newcommand\vj{{\Vector{j}}} +\newcommand\vk{{\Vector{k}}} +\newcommand\vl{{\Vector{l}}} +\newcommand\vm{{\Vector{m}}} +\newcommand\vn{{\Vector{n}}} +\newcommand\vo{{\Vector{o}}} +\newcommand\vp{{\Vector{p}}} +\newcommand\vq{{\Vector{q}}} +\newcommand\vr{{\Vector{r}}} +\newcommand\vs{{\Vector{s}}} +\newcommand\vt{{\Vector{t}}} +\newcommand\vu{{\Vector{u}}} +\newcommand\vv{{\Vector{v}}} +\newcommand\vw{{\Vector{w}}} +\newcommand\vx{{\Vector{x}}} +\newcommand\vy{{\Vector{y}}} +\newcommand\vz{{\Vector{z}}} + +\newcommand\valpha{{\Vector{\alpha}}} +\newcommand\vbeta{{\Vector{\beta}}} +\newcommand\vgamma{{\Vector{\gamma}}} +\newcommand\vdelta{{\Vector{\delta}}} +\newcommand\vepsilon{{\Vector{\epsilon}}} +\newcommand\vtheta{{\Vector{\theta}}} +\newcommand\viota{{\Vector{\iota}}} +\newcommand\vkappa{{\Vector{\kappa}}} +\newcommand\vlambda{{\Vector{\lambda}}} +\newcommand\vmu{{\Vector{\mu}}} +\newcommand\vnu{{\Vector{\nu}}} +\newcommand\vxi{{\Vector{\xi}}} +\newcommand\vpi{{\Vector{\pi}}} +\newcommand\vrho{{\Vector{\rho}}} +\newcommand\vsigma{{\Vector{\sigma}}} +\newcommand\vtau{{\Vector{\tau}}} +\newcommand\vupsilon{{\Vector{\upsilon}}} +\newcommand\vphi{{\Vector{\phi}}} +\newcommand\vchi{{\Vector{\chi}}} +\newcommand\vpsi{{\Vector{\psi}}} +\newcommand\vomega{{\Vector{\omega}}} + + +% Matrix +\newcommand\MATRIX[1]{\symbf{#1}} + +\newcommand\mA{{\MATRIX{A}}} +\newcommand\mB{{\MATRIX{B}}} +\newcommand\mC{{\MATRIX{C}}} +\newcommand\mD{{\MATRIX{D}}} +\newcommand\mE{{\MATRIX{E}}} +\newcommand\mF{{\MATRIX{F}}} +\newcommand\mG{{\MATRIX{G}}} +\newcommand\mH{{\MATRIX{H}}} +\newcommand\mI{{\MATRIX{I}}} +\newcommand\mJ{{\MATRIX{J}}} +\newcommand\mK{{\MATRIX{K}}} +\newcommand\mL{{\MATRIX{L}}} +\newcommand\mM{{\MATRIX{M}}} +\newcommand\mN{{\MATRIX{N}}} +\newcommand\mO{{\MATRIX{O}}} +\newcommand\mP{{\MATRIX{P}}} +\newcommand\mQ{{\MATRIX{Q}}} +\newcommand\mR{{\MATRIX{R}}} +\newcommand\mS{{\MATRIX{S}}} +\newcommand\mT{{\MATRIX{T}}} +\newcommand\mU{{\MATRIX{U}}} +\newcommand\mV{{\MATRIX{V}}} +\newcommand\mW{{\MATRIX{W}}} +\newcommand\mX{{\MATRIX{X}}} +\newcommand\mY{{\MATRIX{Y}}} +\newcommand\mZ{{\MATRIX{Z}}} + +\newcommand\mGamma{{\MATRIX{\Gamma}}} +\newcommand\mDelta{{\MATRIX{\Delta}}} +\newcommand\mTheta{{\MATRIX{\Theta}}} +\newcommand\mLambda{{\MATRIX{\Lambda}}} +\newcommand\mXi{{\MATRIX{\Xi}}} +\newcommand\mPi{{\MATRIX{\Pi}}} +\newcommand\mSigma{{\MATRIX{\Sigma}}} +\newcommand\mUpsilon{{\MATRIX{\Upsilon}}} +\newcommand\mPhi{{\MATRIX{\Phi}}} +\newcommand\mPsi{{\MATRIX{\Psi}}} +\newcommand\mOmega{{\MATRIX{\Omega}}} + + +% Tensor +\newcommand\tens[1]{\symbfsf{#1}} +\newcommand\tA{{\tens{A}}} +\newcommand\tB{{\tens{B}}} +\newcommand\tC{{\tens{C}}} +\newcommand\tD{{\tens{D}}} +\newcommand\tE{{\tens{E}}} +\newcommand\tF{{\tens{F}}} +\newcommand\tG{{\tens{G}}} +\newcommand\tH{{\tens{H}}} +\newcommand\tI{{\tens{I}}} +\newcommand\tJ{{\tens{J}}} +\newcommand\tK{{\tens{K}}} +\newcommand\tL{{\tens{L}}} +\newcommand\tM{{\tens{M}}} +\newcommand\tN{{\tens{N}}} +\newcommand\tO{{\tens{O}}} +\newcommand\tP{{\tens{P}}} +\newcommand\tQ{{\tens{Q}}} +\newcommand\tR{{\tens{R}}} +\newcommand\tS{{\tens{S}}} +\newcommand\tT{{\tens{T}}} +\newcommand\tU{{\tens{U}}} +\newcommand\tV{{\tens{V}}} +\newcommand\tW{{\tens{W}}} +\newcommand\tX{{\tens{X}}} +\newcommand\tY{{\tens{Y}}} +\newcommand\tZ{{\tens{Z}}} + + +% Graph +\newcommand\gA{{\mathcal{A}}} +\newcommand\gB{{\mathcal{B}}} +\newcommand\gC{{\mathcal{C}}} +\newcommand\gD{{\mathcal{D}}} +\newcommand\gE{{\mathcal{E}}} +\newcommand\gF{{\mathcal{F}}} +\newcommand\gG{{\mathcal{G}}} +\newcommand\gH{{\mathcal{H}}} +\newcommand\gI{{\mathcal{I}}} +\newcommand\gJ{{\mathcal{J}}} +\newcommand\gK{{\mathcal{K}}} +\newcommand\gL{{\mathcal{L}}} +\newcommand\gM{{\mathcal{M}}} +\newcommand\gN{{\mathcal{N}}} +\newcommand\gO{{\mathcal{O}}} +\newcommand\gP{{\mathcal{P}}} +\newcommand\gQ{{\mathcal{Q}}} +\newcommand\gR{{\mathcal{R}}} +\newcommand\gS{{\mathcal{S}}} +\newcommand\gT{{\mathcal{T}}} +\newcommand\gU{{\mathcal{U}}} +\newcommand\gV{{\mathcal{V}}} +\newcommand\gW{{\mathcal{W}}} +\newcommand\gX{{\mathcal{X}}} +\newcommand\gY{{\mathcal{Y}}} +\newcommand\gZ{{\mathcal{Z}}} + + +% Sets +\newcommand\sA{{\mathbb{A}}} +\newcommand\sB{{\mathbb{B}}} +\newcommand\sC{{\mathbb{C}}} +\newcommand\sD{{\mathbb{D}}} +% Don't use a set called E, because this would be the same as our symbol +% for expectation. +\newcommand\sF{{\mathbb{F}}} +\newcommand\sG{{\mathbb{G}}} +\newcommand\sH{{\mathbb{H}}} +\newcommand\sI{{\mathbb{I}}} +\newcommand\sJ{{\mathbb{J}}} +\newcommand\sK{{\mathbb{K}}} +\newcommand\sL{{\mathbb{L}}} +\newcommand\sM{{\mathbb{M}}} +\newcommand\sN{{\mathbb{N}}} +\newcommand\sO{{\mathbb{O}}} +\newcommand\sP{{\mathbb{P}}} +\newcommand\sQ{{\mathbb{Q}}} +\newcommand\sR{{\mathbb{R}}} +\newcommand\sS{{\mathbb{S}}} +\newcommand\sT{{\mathbb{T}}} +\newcommand\sU{{\mathbb{U}}} +\newcommand\sV{{\mathbb{V}}} +\newcommand\sW{{\mathbb{W}}} +\newcommand\sX{{\mathbb{X}}} +\newcommand\sY{{\mathbb{Y}}} +\newcommand\sZ{{\mathbb{Z}}} + + +% Random variables +\newcommand\RandomVariable[1]{\symit{#1}} + +\newcommand\rA{{\RandomVariable{A}}} +\newcommand\rB{{\RandomVariable{B}}} +\newcommand\rC{{\RandomVariable{C}}} +\newcommand\rD{{\RandomVariable{D}}} +\newcommand\rE{{\RandomVariable{E}}} +\newcommand\rF{{\RandomVariable{F}}} +\newcommand\rG{{\RandomVariable{G}}} +\newcommand\rH{{\RandomVariable{H}}} +\newcommand\rI{{\RandomVariable{I}}} +\newcommand\rJ{{\RandomVariable{J}}} +\newcommand\rK{{\RandomVariable{K}}} +\newcommand\rL{{\RandomVariable{L}}} +\newcommand\rM{{\RandomVariable{M}}} +\newcommand\rN{{\RandomVariable{N}}} +\newcommand\rO{{\RandomVariable{O}}} +\newcommand\rP{{\RandomVariable{P}}} +\newcommand\rQ{{\RandomVariable{Q}}} +\newcommand\rR{{\RandomVariable{R}}} +\newcommand\rS{{\RandomVariable{S}}} +\newcommand\rT{{\RandomVariable{T}}} +\newcommand\rU{{\RandomVariable{U}}} +\newcommand\rV{{\RandomVariable{V}}} +\newcommand\rW{{\RandomVariable{W}}} +\newcommand\rX{{\RandomVariable{X}}} +\newcommand\rY{{\RandomVariable{Y}}} +\newcommand\rZ{{\RandomVariable{Z}}} + +% Random vectors +\newcommand\RandomVector[1]{\symbf{#1}} + +\newcommand\rvA{{\RandomVector{A}}} +\newcommand\rvB{{\RandomVector{B}}} +\newcommand\rvC{{\RandomVector{C}}} +\newcommand\rvD{{\RandomVector{D}}} +\newcommand\rvE{{\RandomVector{E}}} +\newcommand\rvF{{\RandomVector{F}}} +\newcommand\rvG{{\RandomVector{G}}} +\newcommand\rvH{{\RandomVector{H}}} +\newcommand\rvI{{\RandomVector{I}}} +\newcommand\rvJ{{\RandomVector{J}}} +\newcommand\rvK{{\RandomVector{K}}} +\newcommand\rvL{{\RandomVector{L}}} +\newcommand\rvM{{\RandomVector{M}}} +\newcommand\rvN{{\RandomVector{N}}} +\newcommand\rvO{{\RandomVector{O}}} +\newcommand\rvP{{\RandomVector{P}}} +\newcommand\rvQ{{\RandomVector{Q}}} +\newcommand\rvR{{\RandomVector{R}}} +\newcommand\rvS{{\RandomVector{S}}} +\newcommand\rvT{{\RandomVector{T}}} +\newcommand\rvU{{\RandomVector{U}}} +\newcommand\rvV{{\RandomVector{V}}} +\newcommand\rvW{{\RandomVector{W}}} +\newcommand\rvX{{\RandomVector{X}}} +\newcommand\rvY{{\RandomVector{Y}}} +\newcommand\rvZ{{\RandomVector{Z}}} + +\newcommand\laplace{\mathrm{Laplace}} % Laplace distribution + +\newcommand\E{\mathbb{E}} +\newcommand\Ls{\mathcal{L}} +\newcommand\R{\mathbb{R}} +\newcommand\emp{\tilde{p}} +\newcommand\lr{\alpha} +\newcommand\reg{\lambda} +\newcommand\rect{\mathrm{rectifier}} +\newcommand\softmax{\mathrm{softmax}} +\newcommand\sigmoid{\sigma} +\newcommand\softplus{\zeta} +\newcommand\KL{D_{\mathrm{KL}}} +\newcommand\Var{\mathrm{Var}} +\newcommand\standarderror{\mathrm{SE}} +\newcommand\Cov{\mathrm{Cov}} +% Wolfram Mathworld says $L^2$ is for function spaces and $\ell^2$ is for vectors +% But then they seem to use $L^2$ for vectors throughout the site, and so does +% wikipedia. +\newcommand\normlzero{L^0} +\newcommand\normlone{L^1} +\newcommand\normltwo{L^2} +\newcommand\normlp{L^p} +\newcommand\normmax{L^\infty} + +\DeclareMathOperator*{\argmax}{arg\,max} +\DeclareMathOperator*{\argmin}{arg\,min} + +\DeclareMathOperator{\sign}{sign} +\DeclareMathOperator{\Tr}{Tr} +\let\ab\allowbreak diff --git a/Master/texmf-dist/doc/latex/thuthesis/ref/appendix.bib b/Master/texmf-dist/doc/latex/thuthesis/ref/appendix.bib new file mode 100644 index 00000000000..4fbfb750fca --- /dev/null +++ b/Master/texmf-dist/doc/latex/thuthesis/ref/appendix.bib @@ -0,0 +1,14 @@ +@book{abrahams99tex, + author = {Paul W. Abrahams and Karl Berry and Kathryn A. Hargreaves}, + title = {{\TeX} for the Impatient}, + publisher = {Addison-Wesley}, + year = {1990}, +} + +@incollection{salomon1995advanced, + author = {David Salomon}, + title = {The advanced {\TeX}book}, + address = {New York}, + publisher = {Springer}, + year = {1995}, +} diff --git a/Master/texmf-dist/doc/latex/thuthesis/ref/refs.bib b/Master/texmf-dist/doc/latex/thuthesis/ref/refs.bib index 4832dbb425a..f9d99381e77 100644 --- a/Master/texmf-dist/doc/latex/thuthesis/ref/refs.bib +++ b/Master/texmf-dist/doc/latex/thuthesis/ref/refs.bib @@ -58,7 +58,7 @@ @book{tex, author = "Donald E. Knuth", - title = "The {\TeX} Book", + title = "The {\TeX}book", publisher = "Addison-Wesley Publishing Company", address = "Reading, MA", year = 1989, diff --git a/Master/texmf-dist/doc/latex/thuthesis/shuji.pdf b/Master/texmf-dist/doc/latex/thuthesis/shuji.pdf deleted file mode 100644 index 0c61d58ba90..00000000000 Binary files a/Master/texmf-dist/doc/latex/thuthesis/shuji.pdf and /dev/null differ diff --git a/Master/texmf-dist/doc/latex/thuthesis/shuji.tex b/Master/texmf-dist/doc/latex/thuthesis/shuji.tex deleted file mode 100644 index 5467371b802..00000000000 --- a/Master/texmf-dist/doc/latex/thuthesis/shuji.tex +++ /dev/null @@ -1,20 +0,0 @@ -\documentclass[degree=master]{thuthesis} - -\begin{document} -\thusetup{ - cauthor={薛瑞尼}, - ctitle={没有英文的中文标题} -} - -\shuji % 使用默认标题和默认作者 - -\shuji[使用默认作者的标题] - -\shuji[同时修改标题和作者的标题][尼瑞薛] - -\ifxetex - \shuji[清华大学学位 \raisebox{-5pt}{\LaTeX} 论文模板 \raisebox{-5pt}{v\version} 样例] -\else - \shuji[清华大学学位 \raisebox{8pt}{\LaTeX} 论文模板 \raisebox{8pt}{v\version} 样例] -\fi -\end{document} diff --git a/Master/texmf-dist/doc/latex/thuthesis/spine.pdf b/Master/texmf-dist/doc/latex/thuthesis/spine.pdf new file mode 100644 index 00000000000..714858ee1d4 Binary files /dev/null and b/Master/texmf-dist/doc/latex/thuthesis/spine.pdf differ diff --git a/Master/texmf-dist/doc/latex/thuthesis/spine.tex b/Master/texmf-dist/doc/latex/thuthesis/spine.tex new file mode 100644 index 00000000000..aec1fde0b3d --- /dev/null +++ b/Master/texmf-dist/doc/latex/thuthesis/spine.tex @@ -0,0 +1,19 @@ +\documentclass[degree=master]{thuthesis} + +\thusetup{ + author = {薛瑞尼}, + title = {没有英文的中文标题} +} + +\begin{document} + + +\spine % 使用默认标题和默认作者 + +\spine[使用默认作者的标题] + +\spine[同时修改标题和作者的标题][尼瑞薛] + +% 中英文混合时需要微调 +\spine[清华大学学位 \raisebox{-5pt}{\LaTeX} 论文模板 \raisebox{-5pt}{v\version} 样例] +\end{document} diff --git a/Master/texmf-dist/doc/latex/thuthesis/thusetup.tex b/Master/texmf-dist/doc/latex/thuthesis/thusetup.tex new file mode 100644 index 00000000000..2571c78f04a --- /dev/null +++ b/Master/texmf-dist/doc/latex/thuthesis/thusetup.tex @@ -0,0 +1,154 @@ +% !TeX root = ../main.tex + +% 论文基本信息配置 + +\thusetup{ + %****************************** + % 注意: + % 1. 配置里面不要出现空行 + % 2. 不需要的配置信息可以删除 + %****************************** + % + % 标题 + % 可使用“\\”命令手动控制换行 + % + title = {清华大学学位论文 \LaTeX{} 模板\\使用示例文档 v\version}, + title* = {An Introduction to \LaTeX{} Thesis Template of Tsinghua + University v\version}, + % + % 学位 + % 1. 学术型 + % - 中文 + % 需注明所属的学科门类,例如: + % 哲学、经济学、法学、教育学、文学、历史学、理学、工学、农学、医学、 + % 军事学、管理学、艺术学 + % - 英文 + % 博士:Doctor of Philosophy + % 硕士: + % 哲学、文学、历史学、法学、教育学、艺术学门类,公共管理学科 + % 填写“Master of Arts“,其它填写“Master of Science” + % 2. 专业型 + % 直接填写专业学位的名称,例如: + % 教育博士、工程硕士等 + % Doctor of Education, Master of Engineering + % 3. 本科生不需要填写 + % + degree-name = {工学硕士}, + degree-name* = {Master of Science}, + % + % 培养单位 + % 填写所属院系的全名 + % + department = {计算机科学与技术系}, + % + % 学科 + % 1. 学术型学位 + % 获得一级学科授权的学科填写一级学科名称,其他填写二级学科名称 + % 2. 工程硕士 + % 工程领域名称 + % 3. 其他专业型学位 + % 不填写此项 + % 4. 本科生不需要填写 + % + discipline = {计算机科学与技术}, + discipline* = {Computer Science and Technology}, + % + % 姓名 + % + author = {薛瑞尼}, + author* = {Xue Ruini}, + % + % 指导教师 + % 中文姓名和职称之间以英文逗号“,”分开,下同 + % + supervisor = {郑纬民教授}, + supervisor* = {Professor Zheng Weimin}, + % + % 副指导教师 + % + associate-supervisor = {陈文光教授}, + associate-supervisor* = {Professor Chen Wenguang}, + % + % 联合指导教师 + % + % joint-supervisor = {某某某教授}, + % joint-supervisor* = {Professor Mou Moumou}, + % + % 日期 + % 使用 ISO 格式;默认为当前时间 + % + % date = {2019-07-07}, + % + % 密级和年限 + % 秘密, 机密, 绝密 + % + % secret-level = {秘密}, + % secret-year = {10}, + % + % 博士后专有部分 + % + % clc = {分类号}, + % udc = {UDC}, + % id = {编号}, + % discipline-level-1 = {计算机科学与技术}, % 流动站(一级学科)名称 + % discipline-level-2 = {系统结构}, % 专业(二级学科)名称 + % start-date = {2011-07-01}, % 研究工作起始时间 +} + +%% Put any packages you would like to use here + +% 表格中支持跨行 +\usepackage{multirow} + +% 跨页表格 +\usepackage{longtable} + +% 固定宽度的表格 +\usepackage{tabularx} + +% 表格中的反斜线 +\usepackage{diagbox} + +% 确定浮动对象的位置,可以使用 H,强制将浮动对象放到这里(可能效果很差) +\usepackage{float} + +% 浮动图形控制宏包。 +% 允许上一个 section 的浮动图形出现在下一个 section 的开始部分 +% 该宏包提供处理浮动对象的 \FloatBarrier 命令,使所有未处 +% 理的浮动图形立即被处理。这三个宏包仅供参考,未必使用: +% \usepackage[below]{placeins} +% \usepackage{floatflt} % 图文混排用宏包 +% \usepackage{rotating} % 图形和表格的控制旋转 + +% 定理类环境宏包 +\usepackage[amsmath,thmmarks,hyperref]{ntheorem} + +% 给自定义的宏后面自动加空白 +% \usepackage{xspace} + +% 借用 ltxdoc 里面的几个命令。 +\def\cmd#1{\cs{\expandafter\cmd@to@cs\string#1}} +\def\cmd@to@cs#1#2{\char\number`#2\relax} +\DeclareRobustCommand\cs[1]{\texttt{\char`\\#1}} + +\newcommand*{\meta}[1]{{% + \ensuremath{\langle}\rmfamily\itshape#1\/\ensuremath{\rangle}}} +\providecommand\marg[1]{% + {\ttfamily\char`\{}\meta{#1}{\ttfamily\char`\}}} +\providecommand\oarg[1]{% + {\ttfamily[}\meta{#1}{\ttfamily]}} +\providecommand\parg[1]{% + {\ttfamily(}\meta{#1}{\ttfamily)}} +\providecommand\pkg[1]{{\sffamily#1}} + +% 定义所有的图片文件在 figures 子目录下 +\graphicspath{{figures/}} + +% 数学命令 +\input{math_commands.tex} + +% 定义自己常用的东西 +% \def\myname{薛瑞尼} + +% hyperref 宏包在最后调用 +\usepackage{hyperref} diff --git a/Master/texmf-dist/doc/latex/thuthesis/thuthesis.pdf b/Master/texmf-dist/doc/latex/thuthesis/thuthesis.pdf index 9eb21cceeaa..6be654adc5c 100644 Binary files a/Master/texmf-dist/doc/latex/thuthesis/thuthesis.pdf and b/Master/texmf-dist/doc/latex/thuthesis/thuthesis.pdf differ -- cgit v1.2.3