summaryrefslogtreecommitdiff
path: root/macros/latex/contrib/hitszthesis/back
diff options
context:
space:
mode:
Diffstat (limited to 'macros/latex/contrib/hitszthesis/back')
-rw-r--r--macros/latex/contrib/hitszthesis/back/appendix01.tex6
-rw-r--r--macros/latex/contrib/hitszthesis/back/appendix02.tex15
2 files changed, 16 insertions, 5 deletions
diff --git a/macros/latex/contrib/hitszthesis/back/appendix01.tex b/macros/latex/contrib/hitszthesis/back/appendix01.tex
index 85bec68984..84e77e7efd 100644
--- a/macros/latex/contrib/hitszthesis/back/appendix01.tex
+++ b/macros/latex/contrib/hitszthesis/back/appendix01.tex
@@ -1,7 +1,9 @@
% !TEX root = ../main.tex
% 附录1
-\chapter{外文资料的调研阅读报告或书面翻译}
+\chapter{外文资料翻译}
+% 设置附录页码从1开始编号
+% \SetPageNumberingFromOne
\title{英文资料的中文标题}
@@ -23,8 +25,8 @@
庖丁为文惠君解牛,手之所触,肩之所倚,足之所履,膝之所倚,砉然响然,奏刀騞然,莫
不中音,合于桑林之舞,乃中经首之会。
\begin{table}[ht]
-\centering
\centering
+ \wuhao
\caption*{表~1\hskip1em 这是手动编号但不出现在索引中的一个表格例子}
\label{tab:badtabular3}
\begin{tabular}[c]{|m{1.5cm}|c|c|c|c|c|c|}\hline
diff --git a/macros/latex/contrib/hitszthesis/back/appendix02.tex b/macros/latex/contrib/hitszthesis/back/appendix02.tex
index 0dd811b0ab..46975ad85a 100644
--- a/macros/latex/contrib/hitszthesis/back/appendix02.tex
+++ b/macros/latex/contrib/hitszthesis/back/appendix02.tex
@@ -94,11 +94,11 @@ 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
+ \appendixcaption{Table~1\hskip1em This is an example for manually numbered table, which
would not appear in the list of tables}
\label{tab:badtabular2}
+ \wuhao
\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
@@ -109,7 +109,7 @@ solving linear programming.
\multirow{2}{1.2in}{Max. Connectivity}\\\cline{1-3}
\multicolumn{2}{|c|}{Inet-2.1} & 6000 & & & &\\\hline
& \multicolumn{2}{c|}{ABCDEF} &\multicolumn{4}{c|}{} \\\hline
-\end{tabular}
+ \end{tabular}
\end{table}
Roughly speaking, the simplex algorithm examines only the extreme points of the
@@ -119,6 +119,15 @@ 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.
+% 附录算法请用这个新环境 <algorithmen>
+\begin{algorithmen}
+ \wuhao
+ \DontPrintSemicolon
+ \KwData{$G=(X,U)$ such that $G^{tc}$ is an order.}
+ \KwResult{$G’=(X,V)$ with $V\subseteq U$ such that $G’^{tc}$ is an interval order.}
+ \caption{\textsc{Fast}SLAM}
+\end{algorithmen}
+
\subsection{Nonlinear Programming}
If at least one of the functions $f(x),g_j(x),j=1,2,\cdots,p$ is nonlinear, then