latex算法排版
来源:互联网 发布:glibc 源码 编辑:程序博客网 时间:2024/04/28 01:14
下给出使用latex进行算法排版的几个例子,以供参考:
\documentclass{article}
\usepackage[english]{babel}
\usepackage{blindtext}
\usepackage{algorithm} %format of the algorithm
\usepackage{algorithmic} %format of the algorithm
<?xml:namespace prefix = o />
\begin{document}
\blindtext
\begin{algorithm}[htb] %算法的开始
\renewcommand{\algorithmicrequire}{\textbf{Input:}}
\renewcommand\algorithmicensure {\textbf{Output:} }
\caption{ Framework of ensemble learning for our system.} %算法的标题
\label{alg:Framwork} %给算法一个标签,这样方便在文中对算法的引用
\begin{algorithmic}[1] %这个1 表示每一行都显示数字
\REQUIRE ~~\\ %算法的输入参数:Input
The set of positive samples for current batch, $P_n$;\\
The set of unlabelled samples for current batch, $U_n$;\\
Ensemble of classifiers on former batches, $E_{n-1}$;
\ENSURE ~~\\ %算法的输出:Output
Ensemble of classifiers on the current batch, $E_n$;\\
\STATE Extracting the set of reliable negative and/or positive samples $T_n$ from $U_n$ with help of $P_n$; label{code:fram:extract} %算法的一个陈述,对应算法的一个步骤或公式之类的; label{ code:fram:extract }对此行的标记,方便在文中引用算法的某个步骤
\STATE Training ensemble of classifiers $E$ on $T_n cup P_n$, with help of data in former batches; label{code:fram:trainbase}
\STATE $E_n=E_{n-1}cup E$; label{code:fram:add}
\STATE Classifying samples in $U_n-T_n$ by $E_n$; label{code:fram:classify}
\STATE Deleting some weak classifiers in $E_n$ so as to keep the capacity of $E_n$; label{code:fram:select}
\RETURN $E_n$; %算法的返回值
\end{algorithmic}
\end{algorithm}
\blindtext
\end{document}
=====
2.
\documentclass{article}
\usepackage[english]{babel}
\usepackage{blindtext}
\usepackage{algorithm} %format of the algorithm
\usepackage{algorithmic} %format of the algorithm
\begin{document}
\blindtext
\begin{algorithm}[h]
\caption{An example for format For While Loop in Algorithm}
\begin{algorithmic}[1]
\FOR{each $iin [1,9]$}
\STATE initialize a tree $T_{i}$ with only a leaf (the root);\
\STATE $T_{i};$\
\ENDFOR
\FOR{$i=1$; $i<n$; $i++$ }
\STATE $//$ Your source here;
\ENDFOR
\WHILE {$(|E_n| leq L_1 )and(Deq phi)$}
\STATE Selecting the most recent classifier $c_i$ from $D$;
\STATE $D=D-c_i$;
\STATE $E_n=E_n+c_i$;
\ENDWHILE \label{code:recentEnd}
\end{algorithmic}
\end{algorithm}
\blindtext
\end{document}
===========
- Latex算法排版
- LaTeX算法排版例子
- latex算法排版
- LaTeX算法排版例子
- LaTex:算法排版
- LaTex:算法排版
- LaTeX 算法排版
- Latex 算法的排版问题
- LaTeX 排版问题之算法设计
- Latex写算法的伪代码排版
- Latex写算法的伪代码排版
- Latex写算法的伪代码排版
- Latex排版
- Latex排版
- LaTeX排版
- LaTEX排版
- latex算法排版——如何把require变成input
- LaTeX 写作: 算法代码排版 --latex2e范例总结
- JSP 语法
- android 二维码开发,Camera竖屏问题
- boost::function的简单用法
- linux源码安装软件
- jacob基础及其相关代码
- latex算法排版
- 关于宏定义
- 新站点
- Objective-C 和 Core Foundation 对象相互转换的内存管理总结
- 安卓出现android.widget.TextView cannot be cast to android.widget.Button问题
- Leetcode【11】:Container With Most Water
- loadrunner录制脚本,自动关闭的多种原因--待后续在补充
- 计算机视觉开源库集合
- android中如何显示图片的一部分