diff options
Diffstat (limited to 'Master/texmf-dist/doc/latex/thuthesis/data')
-rw-r--r-- | Master/texmf-dist/doc/latex/thuthesis/data/abstract.tex | 55 | ||||
-rw-r--r-- | Master/texmf-dist/doc/latex/thuthesis/data/acknowledgements.tex (renamed from Master/texmf-dist/doc/latex/thuthesis/data/ack.tex) | 10 | ||||
-rw-r--r-- | Master/texmf-dist/doc/latex/thuthesis/data/appendix-survey.tex | 172 | ||||
-rw-r--r-- | Master/texmf-dist/doc/latex/thuthesis/data/appendix-translation.tex | 96 | ||||
-rw-r--r-- | Master/texmf-dist/doc/latex/thuthesis/data/appendix.tex (renamed from Master/texmf-dist/doc/latex/thuthesis/data/appendix01.tex) | 34 | ||||
-rw-r--r-- | Master/texmf-dist/doc/latex/thuthesis/data/chap01.tex | 31 | ||||
-rw-r--r-- | Master/texmf-dist/doc/latex/thuthesis/data/chap02.tex | 12 | ||||
-rw-r--r-- | Master/texmf-dist/doc/latex/thuthesis/data/cover.tex | 118 | ||||
-rw-r--r-- | Master/texmf-dist/doc/latex/thuthesis/data/denotation.tex | 2 | ||||
-rw-r--r-- | Master/texmf-dist/doc/latex/thuthesis/data/resume.tex | 2 |
10 files changed, 359 insertions, 173 deletions
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/acknowledgements.tex index bdab98fb983..0ef68793d56 100644 --- a/Master/texmf-dist/doc/latex/thuthesis/data/ack.tex +++ b/Master/texmf-dist/doc/latex/thuthesis/data/acknowledgements.tex @@ -1,6 +1,6 @@ -% 如果使用声明扫描页,将可选参数指定为扫描后的 PDF 文件名,例如: -% \begin{acknowledgement}[scan-statement.pdf] -\begin{acknowledgement} +% !TeX root = ../main.tex + +\begin{acknowledgements} 衷心感谢导师 xxx 教授和物理系 xxx 副教授对本人的精心指导。他们的言传身教将使 我终生受益。 @@ -8,5 +8,5 @@ 胜感激。感谢 xx 实验室主任 xx 教授,以及实验室全体老师和同学们的热情帮助和支 持!本课题承蒙国家自然科学基金资助,特此致谢。 - 感谢 \LaTeX 和 \thuthesis\cite{thuthesis},帮我节省了不少时间。 -\end{acknowledgement} + 感谢 \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/appendix01.tex b/Master/texmf-dist/doc/latex/thuthesis/data/appendix.tex index f34536ed5b7..94a4a0595c2 100644 --- a/Master/texmf-dist/doc/latex/thuthesis/data/appendix01.tex +++ b/Master/texmf-dist/doc/latex/thuthesis/data/appendix.tex @@ -1,20 +1,17 @@ -\chapter{外文资料原文} -\label{cha:engorg} +\chapter{单目标规划} -\title{The title of the English paper} - -\textbf{Abstract:} As one of the most widely used techniques in operations +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]}$. +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$^{[2,3]}$. +throughout the book. \section{Single-Objective Programming} @@ -169,24 +166,6 @@ the {\em branch-and-bound enumeration} developed by Balas (1965) and Dakin \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{单目标规划} 北冥有鱼,其名为鲲。鲲之大,不知其几千里也。化而为鸟,其名为鹏。鹏之背,不知其几 千里也。怒而飞,其翼若垂天之云。是鸟也,海运则将徙于南冥。南冥者,天池也。 @@ -256,8 +235,3 @@ the {\em branch-and-bound enumeration} developed by Balas (1965) and Dakin 巧伪人孔丘非邪?为我告之:尔作言造语,妄称文、武,冠枝木之冠,带死牛之胁,多辞缪 说,不耕而食,不织而衣,摇唇鼓舌,擅生是非,以迷天下之主,使天下学士不反其本,妄 作孝弟,而侥幸于封侯富贵者也。子之罪大极重,疾走归!不然,我将以子肝益昼餔之膳。” - - -\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{个人简历} |