summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/doc/latex/thuthesis/data/appendix01.tex
diff options
context:
space:
mode:
authorKarl Berry <karl@freefriends.org>2015-12-24 23:08:08 +0000
committerKarl Berry <karl@freefriends.org>2015-12-24 23:08:08 +0000
commit21c374dac3e9da7af20b033b1356184556c0cb89 (patch)
tree006bb1542cfc82912d2d05613def55bec556145a /Master/texmf-dist/doc/latex/thuthesis/data/appendix01.tex
parentb0887a408058ad36d79cda138316ce8840398c8f (diff)
thuthesis (24dec15)
git-svn-id: svn://tug.org/texlive/trunk@39192 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/doc/latex/thuthesis/data/appendix01.tex')
-rw-r--r--Master/texmf-dist/doc/latex/thuthesis/data/appendix01.tex36
1 files changed, 18 insertions, 18 deletions
diff --git a/Master/texmf-dist/doc/latex/thuthesis/data/appendix01.tex b/Master/texmf-dist/doc/latex/thuthesis/data/appendix01.tex
index acd380a6df2..2bef97964e4 100644
--- a/Master/texmf-dist/doc/latex/thuthesis/data/appendix01.tex
+++ b/Master/texmf-dist/doc/latex/thuthesis/data/appendix01.tex
@@ -1,7 +1,7 @@
-%%% Local Variables:
+%%% Local Variables:
%%% mode: latex
%%% TeX-master: "../main"
-%%% End:
+%%% End:
\chapter{外文资料原文}
\label{cha:engorg}
@@ -78,7 +78,7 @@ 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}
+\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
@@ -98,17 +98,17 @@ solving linear programming.
would not appear in the list of tables}
\label{tab:badtabular2}
\begin{tabular}[c]{|c|m{0.8in}|c|c|c|c|c|}\hline
- \multicolumn{2}{|c|}{Network Topology} & \# of nodes &
+ \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}{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}{1in}{Xue} & Rui & Ni &\multicolumn{4}{c|}{\multirow{2}*{\thuthesis}}\\\cline{2-3}
& \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
@@ -131,7 +131,7 @@ concerned with analyzing the structure of problems.
\includegraphics[clip]{thu-lib-logo}
\caption*{Figure~1\hskip1em This is an example for manually numbered figure,
which would not appear in the list of figures}
- \label{tab:badfigure2}
+ \label{tab:badfigure2}
\end{figure}
Now we consider a nonlinear programming which is confronted solely with
@@ -170,7 +170,7 @@ 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
+\noindent{\itshape NOTE: These references are only for demonstration. They are
not real citations in the original text.}
\begin{enumerate}[{$[$}1{$]$}]
@@ -183,7 +183,7 @@ the {\em branch-and-bound enumeration} developed by Balas (1965) and Dakin
\chapter{外文资料的调研阅读报告或书面翻译}
\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})}
@@ -201,17 +201,17 @@ the {\em branch-and-bound enumeration} developed by Balas (1965) and Dakin
\caption*{表~1\hskip1em 这是手动编号但不出现在索引中的一个表格例子}
\label{tab:badtabular3}
\begin{tabular}[c]{|c|m{0.8in}|c|c|c|c|c|}\hline
- \multicolumn{2}{|c|}{Network Topology} & \# of nodes &
+ \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}{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}{1in}{Xue} & Rui & Ni &\multicolumn{4}{c|}{\multirow{2}*{\thuthesis}}\\\cline{2-3}
& \multicolumn{2}{c|}{ABCDEF} &\multicolumn{4}{c|}{} \\\hline
-\end{tabular}
+\end{tabular}
\end{table}
文惠君曰:“嘻,善哉!技盖至此乎?”庖丁释刀对曰:“臣之所好者道也,进乎技矣。始臣之
@@ -235,7 +235,7 @@ the {\em branch-and-bound enumeration} developed by Balas (1965) and Dakin
\centering
\includegraphics{hello}
\caption*{图~1\hskip1em 这是手动编号但不出现索引中的图片的例子}
- \label{tab:badfigure3}
+ \label{tab:badfigure3}
\end{figure}
柳下季曰:“先生言为人父者必能诏其子,为人兄者必能教其弟,若子不听父之诏,弟不受
@@ -254,4 +254,4 @@ the {\em branch-and-bound enumeration} developed by Balas (1965) and Dakin
\chapter{其它附录}
前面两个附录主要是给本科生做例子。其它附录的内容可以放到这里,当然如果你愿意,可
-以把这部分也放到独立的文件中,然后将其 \verb|\input| 到主文件中。 \ No newline at end of file
+以把这部分也放到独立的文件中,然后将其 \verb|\input| 到主文件中。