提交 eb65b4e4 编写于 作者: D dengkaipeng

\frac -> \frac. test=develop

上级 8167588f
...@@ -267,7 +267,7 @@ Example: ...@@ -267,7 +267,7 @@ Example:
hend &= hstart + ksize[0] \\ hend &= hstart + ksize[0] \\
wstart &= j * strides[1] - paddings[1] \\ wstart &= j * strides[1] - paddings[1] \\
wend &= wstart + ksize[1] \\ wend &= wstart + ksize[1] \\
Output(i ,j) &= \\frac{sum(Input[hstart:hend, wstart:wend])}{ksize[0] * ksize[1]} Output(i ,j) &= \frac{sum(Input[hstart:hend, wstart:wend])}{ksize[0] * ksize[1]}
For exclusive = true: For exclusive = true:
...@@ -277,7 +277,7 @@ Example: ...@@ -277,7 +277,7 @@ Example:
hend &= min(H, hstart + ksize[0]) \\ hend &= min(H, hstart + ksize[0]) \\
wstart &= max(0, j * strides[1] - paddings[1]) \\ wstart &= max(0, j * strides[1] - paddings[1]) \\
wend &= min(W, wstart + ksize[1]) \\ wend &= min(W, wstart + ksize[1]) \\
Output(i ,j) &= \\frac{sum(Input[hstart:hend, wstart:wend])}{(hend - hstart) * (wend - wstart)} Output(i ,j) &= \frac{sum(Input[hstart:hend, wstart:wend])}{(hend - hstart) * (wend - wstart)}
For adaptive = true: For adaptive = true:
...@@ -287,7 +287,7 @@ Example: ...@@ -287,7 +287,7 @@ Example:
hend &= ceil((i + 1) * H_{in} / H_{out}) \\ hend &= ceil((i + 1) * H_{in} / H_{out}) \\
wstart &= floor(j * W_{in} / W_{out}) \\ wstart &= floor(j * W_{in} / W_{out}) \\
wend &= ceil((j + 1) * W_{in} / W_{out}) \\ wend &= ceil((j + 1) * W_{in} / W_{out}) \\
Output(i ,j) &= \\frac{sum(Input[hstart:hend, wstart:wend])}{(hend - hstart) * (wend - wstart)} Output(i ,j) &= \frac{sum(Input[hstart:hend, wstart:wend])}{(hend - hstart) * (wend - wstart)}
)DOC"); )DOC");
} }
...@@ -426,7 +426,7 @@ Example: ...@@ -426,7 +426,7 @@ Example:
hend &= hstart + ksize[1] \\ hend &= hstart + ksize[1] \\
wstart &= k * strides[2] - paddings[2] \\ wstart &= k * strides[2] - paddings[2] \\
wend &= wstart + ksize[2] \\ wend &= wstart + ksize[2] \\
Output(i ,j, k) &= \\frac{sum(Input[dstart:dend, hstart:hend, wstart:wend])}{ksize[0] * ksize[1] * ksize[2]} Output(i ,j, k) &= \frac{sum(Input[dstart:dend, hstart:hend, wstart:wend])}{ksize[0] * ksize[1] * ksize[2]}
For exclusive = true: For exclusive = true:
...@@ -437,7 +437,7 @@ Example: ...@@ -437,7 +437,7 @@ Example:
hend &= min(H, hstart + ksize[1]) \\ hend &= min(H, hstart + ksize[1]) \\
wstart &= max(0, k * strides[2] - paddings[2]) \\ wstart &= max(0, k * strides[2] - paddings[2]) \\
wend &= min(W, wstart + ksize[2]) \\ wend &= min(W, wstart + ksize[2]) \\
Output(i ,j, k) &= \\frac{sum(Input[dstart:dend, hstart:hend, wstart:wend])}{(dend - dstart) * (hend - hstart) * (wend - wstart)} Output(i ,j, k) &= \frac{sum(Input[dstart:dend, hstart:hend, wstart:wend])}{(dend - dstart) * (hend - hstart) * (wend - wstart)}
For adaptive = true: For adaptive = true:
...@@ -449,7 +449,7 @@ Example: ...@@ -449,7 +449,7 @@ Example:
hend &= ceil((j + 1) * H_{in} / H_{out}) \\ hend &= ceil((j + 1) * H_{in} / H_{out}) \\
wstart &= floor(k * W_{in} / W_{out}) \\ wstart &= floor(k * W_{in} / W_{out}) \\
wend &= ceil((k + 1) * W_{in} / W_{out}) \\ wend &= ceil((k + 1) * W_{in} / W_{out}) \\
Output(i ,j, k) &= \\frac{sum(Input[dstart:dend, hstart:hend, wstart:wend])}{(dend - dstart) * (hend - hstart) * (wend - wstart)} Output(i ,j, k) &= \frac{sum(Input[dstart:dend, hstart:hend, wstart:wend])}{(dend - dstart) * (hend - hstart) * (wend - wstart)}
)DOC"); )DOC");
} }
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册