<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Posts on Rui's Blog</title><link>https://low-hands.github.io/posts/</link><description>Recent content in Posts on Rui's Blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><lastBuildDate>Sat, 14 Mar 2026 00:16:00 -0800</lastBuildDate><atom:link href="https://low-hands.github.io/posts/index.xml" rel="self" type="application/rss+xml"/><item><title>Diffusion LLM paper reading</title><link>https://low-hands.github.io/posts/paper/dllm/</link><pubDate>Sat, 14 Mar 2026 00:16:00 -0800</pubDate><guid>https://low-hands.github.io/posts/paper/dllm/</guid><description>&lt;h1 id="1-residual-context-diffusion-language-models"&gt;1 Residual Context Diffusion Language Models&lt;/h1&gt;
&lt;h2 id="method"&gt;Method&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;Traditional dLLMs discard the [MASK] at unpredicted positions in each round and reset them as new blank [MASK]s. To avoid wasting computational power, this method retains these discarded semantics and transforms them into vectors for the next round of prediction.&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id="algorithm"&gt;Algorithm&lt;/h2&gt;
&lt;ol&gt;
&lt;li&gt;Generate the residual vector by performing a weighted sum of the model&amp;rsquo;s predicted probability and the word embeddings:&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;$\Delta_i^{(t_k)} = \sum_{j=1}^V p_{i,j}^{(t_k)} E_{j,:}$&lt;/p&gt;</description></item><item><title>Encoder-only</title><link>https://low-hands.github.io/posts/internship/llm/llm-architecture/encoder-only/</link><pubDate>Mon, 02 Mar 2026 23:25:00 -0800</pubDate><guid>https://low-hands.github.io/posts/internship/llm/llm-architecture/encoder-only/</guid><description>&lt;h1 id="what-is-pre-training"&gt;What is Pre-training?&lt;/h1&gt;
&lt;p&gt;Initializing neural network model parameters through &lt;strong&gt;self-supervised learning&lt;/strong&gt; (unlabeled data).&lt;/p&gt;
&lt;p&gt;The goal is to learn a &lt;strong&gt;universal language understanding capability&lt;/strong&gt;.&lt;/p&gt;
&lt;hr&gt;
&lt;h1 id="bert"&gt;BERT&lt;/h1&gt;
&lt;h2 id="bert-pre-training-tasks"&gt;BERT Pre-training Tasks&lt;/h2&gt;
&lt;h3 id="masked-language-modeling-mlm"&gt;Masked Language Modeling (MLM)&lt;/h3&gt;
&lt;p&gt;A certain percentage (15%) of tokens in the input sequence are replaced, and the model is tasked with predicting what those original words were.&lt;/p&gt;
&lt;h4 id="the-8-1-1-rule"&gt;The 8-1-1 Rule&lt;/h4&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;80%&lt;/strong&gt; of the selected tokens are replaced with &lt;code&gt;[MASK]&lt;/code&gt;: Acts like a cloze test, enabling the model to learn bidirectional semantic context.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;10%&lt;/strong&gt; are replaced with a &lt;strong&gt;random token&lt;/strong&gt; from the vocabulary: Since the model doesn&amp;rsquo;t know which tokens are random, this improves error-correction capabilities and forces the model to rely on the global context to generate the correct vector representation.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;10%&lt;/strong&gt; remain as the &lt;strong&gt;original token&lt;/strong&gt;: This anchors the model&amp;rsquo;s representations toward the actual &amp;ldquo;true&amp;rdquo; embeddings.&lt;/li&gt;
&lt;/ul&gt;
&lt;h4 id="optimization-objective"&gt;Optimization Objective&lt;/h4&gt;
&lt;p&gt;$$\mathcal{L}&lt;em&gt;{MLM} = - \sum&lt;/em&gt;{i \in m} \log P(x_i | \tilde{X}; \theta)$$
Where $\tilde{X}$ is the corrupted input sequence, $m$ is the set of chosen masked positions, and $\theta$ represents the model parameters.&lt;/p&gt;</description></item><item><title>Yan:Foundational Interactive Video Generation</title><link>https://low-hands.github.io/posts/paper/yan/</link><pubDate>Mon, 09 Feb 2026 00:16:00 -0800</pubDate><guid>https://low-hands.github.io/posts/paper/yan/</guid><description>&lt;h1 id="abstract"&gt;Abstract&lt;/h1&gt;
&lt;h1 id="introduction"&gt;Introduction&lt;/h1&gt;
&lt;p&gt;The first paragraph primarily discusses the applications and deficiencies of Interactive Generative Video (IGV). AIGC is evolving from generating text and images to video synthesis, and has now progressed to IGV. IGV requires dynamic reactions to user input, with applications ranging from virtual simulation to embodied intelligence. However, the deficiencies of current methods lie in the lack of high visual fidelity, sustained temporal coherence, and rich interactivity. Generated content also remains static after creation, failing to adapt in real-time. (Not high-definition, not coherent, not interactive).&lt;/p&gt;</description></item><item><title>LSTM</title><link>https://low-hands.github.io/posts/transformer/models/lstm/</link><pubDate>Tue, 27 Jan 2026 16:49:00 -0800</pubDate><guid>https://low-hands.github.io/posts/transformer/models/lstm/</guid><description>&lt;p&gt;pending&lt;/p&gt;</description></item><item><title>RNN</title><link>https://low-hands.github.io/posts/transformer/models/rnn/</link><pubDate>Mon, 26 Jan 2026 23:57:00 -0800</pubDate><guid>https://low-hands.github.io/posts/transformer/models/rnn/</guid><description>&lt;h1 id="结构"&gt;结构&lt;/h1&gt;
&lt;p&gt;&lt;img src="https://low-hands.github.io/posts/transformer/models/rnn/structure.png" alt="structure"&gt;
纵向看，每一列相当于一个小的传统神经网络&lt;/p&gt;
&lt;p&gt;x：输入层，长度为word embedding的维度&lt;/p&gt;
&lt;p&gt;U：输入层到隐藏层的权重&lt;/p&gt;
&lt;p&gt;s：隐藏层 = f(U * xt + W * s(t-1) + bias),即输入层的计算结果加上上一时刻的结果乘上一个权重W&lt;/p&gt;
&lt;p&gt;V: 隐藏层到输出层的权重&lt;/p&gt;
&lt;p&gt;o：输出 = softmax(V * st + bias)&lt;/p&gt;
&lt;h1 id="注意"&gt;注意&lt;/h1&gt;
&lt;ul&gt;
&lt;li&gt;由公式可见，每个隐藏层s的值不仅依赖于当前时刻的输入，而且依赖于&lt;strong&gt;上一个时刻的的结果s(t-1)&lt;/strong&gt;&lt;/li&gt;
&lt;li&gt;U,V,W都是共享的&lt;/li&gt;
&lt;li&gt;不一定每一个时刻都要有一个输出，也就是说不是每一个小神经网络都必须有输出，它可以是不完整的&lt;/li&gt;
&lt;/ul&gt;
&lt;h1 id="举例"&gt;举例&lt;/h1&gt;
&lt;p&gt;&lt;img src="https://low-hands.github.io/posts/transformer/models/rnn/8397aaf6-1669-46b3-8465-791ed748404f.png" alt="example"&gt;&lt;/p&gt;
&lt;p&gt;这是一个时间序列做预测的例子，一共有三天的数据，预测明天的数据&lt;/p&gt;
&lt;p&gt;w1 = U = 1.8， w2 = W = -0.5，w3 = V = 1.1&lt;/p&gt;
&lt;p&gt;x0 = 1, x1 = 0.5, x2 = 0.5
这里的输入只是数字而不是向量&lt;/p&gt;
&lt;h2 id="day0"&gt;Day0&lt;/h2&gt;
&lt;p&gt;s0 = f(1.8 * 1 + -0.5 * 0) = f(1.8) = 1.8&lt;/p&gt;</description></item><item><title>Tokenizer</title><link>https://low-hands.github.io/posts/transformer/tokenizer/</link><pubDate>Mon, 26 Jan 2026 22:20:00 -0800</pubDate><guid>https://low-hands.github.io/posts/transformer/tokenizer/</guid><description>&lt;p&gt;sasa&lt;/p&gt;</description></item><item><title>Word Embedding</title><link>https://low-hands.github.io/posts/transformer/embedding/</link><pubDate>Mon, 26 Jan 2026 22:20:00 -0800</pubDate><guid>https://low-hands.github.io/posts/transformer/embedding/</guid><description>&lt;h1 id="one-hot"&gt;One-hot&lt;/h1&gt;
&lt;p&gt;每个token表示为一个长向量，每个向量的维度为词表的大小，向量中只有一个维度的值为1，一般为该词在词表中的索引&lt;/p&gt;
&lt;h2 id="举例"&gt;举例&lt;/h2&gt;
&lt;p&gt;假设用 one-hot对句子进行表示，对句子分词之后，我们可以得到[&amp;lsquo;我‘，’爱‘，’北京‘，’天安门‘]，可以用one hot（独热编码）对单词进行编码。具体为：&lt;/p&gt;
&lt;p&gt;“我”可以表示为[1,0,0,0]&lt;/p&gt;
&lt;p&gt;&amp;ldquo;爱&amp;quot;可以表示为[0,1,0,0]&lt;/p&gt;
&lt;p&gt;&amp;lsquo;北京&amp;rsquo;可以表示为[0,0,1,0]&lt;/p&gt;
&lt;p&gt;&amp;lsquo;天安门&amp;rsquo;可以表示为[0,0,0,1]&lt;/p&gt;
&lt;h2 id="问题"&gt;问题&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;one-hot向量之间彼此正交，无法识别每个词之间的关系（无法计算相似度，都为0）&lt;/li&gt;
&lt;li&gt;维度爆炸。维度和词表有关系，模型训练难度增大&lt;/li&gt;
&lt;li&gt;向量稀疏，难以捕捉语义关系，因为数据点分布系数，距离度量失效。而且稀疏矩阵存储效率低&lt;/li&gt;
&lt;/ul&gt;
&lt;h1 id="词嵌入"&gt;词嵌入&lt;/h1&gt;
&lt;p&gt;词嵌入（Word Embedding）是将人类语言中离散、抽象的文本词汇，通过算法映射为计算机可理解的「连续、稠密的低维实数向量」 的文本表示技术&lt;/p&gt;
&lt;h1 id="分布式表示"&gt;分布式表示&lt;/h1&gt;
&lt;p&gt;词嵌入将词表示为一种分布式的形式。分布式表示是将词转化成一个定长、稠密并且存在语义关系的向量，即分布相似的词，是有相似的语义的&lt;/p&gt;
&lt;h2 id="word2vec"&gt;Word2Vec&lt;/h2&gt;
&lt;h3 id="cbow"&gt;CBOW&lt;/h3&gt;
&lt;h3 id="skip-gram"&gt;Skip-gram&lt;/h3&gt;</description></item><item><title>Leetcode 541 - Reverse String II</title><link>https://low-hands.github.io/posts/algorithm/twopointers/leetcode-541-%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2ii/</link><pubDate>Mon, 19 Jan 2026 23:12:00 -0800</pubDate><guid>https://low-hands.github.io/posts/algorithm/twopointers/leetcode-541-%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2ii/</guid><description>&lt;h1 id="leetcode-541-reverse-string-ii"&gt;Leetcode 541. Reverse String II&lt;/h1&gt;
&lt;p&gt;&lt;a href="https://leetcode.cn/problems/reverse-string-ii/description/" target="_blank" rel="noopener"&gt;Problem Link&lt;/a&gt;&lt;/p&gt;
&lt;h2 id="problem-description"&gt;Problem Description&lt;/h2&gt;
&lt;p&gt;Given a string &lt;code&gt;s&lt;/code&gt; and an integer &lt;code&gt;k&lt;/code&gt;, reverse the first &lt;code&gt;k&lt;/code&gt; characters for every &lt;code&gt;2k&lt;/code&gt; characters counting from the start of the string.&lt;/p&gt;
&lt;p&gt;If there are fewer than &lt;code&gt;k&lt;/code&gt; characters left, reverse all of them.&lt;/p&gt;
&lt;p&gt;If there are less than &lt;code&gt;2k&lt;/code&gt; but greater than or equal to &lt;code&gt;k&lt;/code&gt; characters, reverse the first &lt;code&gt;k&lt;/code&gt; characters and leave the other as original.&lt;/p&gt;</description></item><item><title>Leetcode 344 - Reverse String</title><link>https://low-hands.github.io/posts/algorithm/twopointers/leetcode-344-%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2/</link><pubDate>Mon, 19 Jan 2026 09:00:00 -0800</pubDate><guid>https://low-hands.github.io/posts/algorithm/twopointers/leetcode-344-%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2/</guid><description>&lt;p&gt;&lt;a href="https://leetcode.com/problems/reverse-string/" target="_blank" rel="noopener"&gt;Problem Link&lt;/a&gt;&lt;/p&gt;
&lt;h1 id="problem-description"&gt;Problem Description&lt;/h1&gt;
&lt;p&gt;Write a function that reverses a string. The input string is given as an array of characters s.&lt;/p&gt;
&lt;p&gt;You must do this by modifying the input array in-place with O(1) extra memory.&lt;/p&gt;
&lt;p&gt;Example 1:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;Input: s = [&amp;ldquo;h&amp;rdquo;,&amp;ldquo;e&amp;rdquo;,&amp;ldquo;l&amp;rdquo;,&amp;ldquo;l&amp;rdquo;,&amp;ldquo;o&amp;rdquo;]
Output: [&amp;ldquo;o&amp;rdquo;,&amp;ldquo;l&amp;rdquo;,&amp;ldquo;l&amp;rdquo;,&amp;ldquo;e&amp;rdquo;,&amp;ldquo;h&amp;rdquo;]
Example 2:&lt;/p&gt;
&lt;/blockquote&gt;
&lt;blockquote&gt;
&lt;p&gt;Input: s = [&amp;ldquo;H&amp;rdquo;,&amp;ldquo;a&amp;rdquo;,&amp;ldquo;n&amp;rdquo;,&amp;ldquo;n&amp;rdquo;,&amp;ldquo;a&amp;rdquo;,&amp;ldquo;h&amp;rdquo;]
Output: [&amp;ldquo;h&amp;rdquo;,&amp;ldquo;a&amp;rdquo;,&amp;ldquo;n&amp;rdquo;,&amp;ldquo;n&amp;rdquo;,&amp;ldquo;a&amp;rdquo;,&amp;ldquo;H&amp;rdquo;]&lt;/p&gt;
&lt;/blockquote&gt;
&lt;h2 id="approach"&gt;Approach&lt;/h2&gt;
&lt;p&gt;Opposite Direction Pointers: One pointer starts at the beginning, and the other starts at the end.&lt;/p&gt;
&lt;p&gt;Both pointers move inward simultaneously with the same step size until they cross each other (left &amp;gt; right), at which point the traversal ends.&lt;/p&gt;</description></item><item><title>Leetcode 27 - Remove Element</title><link>https://low-hands.github.io/posts/algorithm/twopointers/leetcode-27-%E7%A7%BB%E9%99%A4%E5%85%83%E7%B4%A0/</link><pubDate>Sun, 18 Jan 2026 22:21:00 -0800</pubDate><guid>https://low-hands.github.io/posts/algorithm/twopointers/leetcode-27-%E7%A7%BB%E9%99%A4%E5%85%83%E7%B4%A0/</guid><description>&lt;p&gt;&lt;a href="https://leetcode.cn/problems/remove-element/description/" target="_blank" rel="noopener"&gt;Problem Link&lt;/a&gt;&lt;/p&gt;
&lt;h2 id="problem-description"&gt;Problem Description&lt;/h2&gt;
&lt;p&gt;Given an array &lt;code&gt;nums&lt;/code&gt; and a value &lt;code&gt;val&lt;/code&gt;, you need to &lt;strong&gt;in-place&lt;/strong&gt; remove all instances of that value and return the new length of the array.&lt;/p&gt;
&lt;p&gt;Do not use extra space for another array; you must do this by modifying the input array &lt;strong&gt;in-place&lt;/strong&gt; with &lt;strong&gt;O(1)&lt;/strong&gt; extra space.&lt;/p&gt;
&lt;p&gt;The order of elements can be changed. You do not need to consider the elements beyond the new length.&lt;/p&gt;</description></item><item><title>Shortcodes Samples</title><link>https://low-hands.github.io/posts/shortcodes/</link><pubDate>Tue, 13 Jan 2026 01:07:25 -0800</pubDate><guid>https://low-hands.github.io/posts/shortcodes/</guid><description>&lt;p&gt;This is a sample post intended to test the followings:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Default hero image.&lt;/li&gt;
&lt;li&gt;Different shortcodes.&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id="alert"&gt;Alert&lt;/h2&gt;
&lt;p&gt;The following alerts are available in this theme.&lt;/p&gt;
&lt;div class="alert success"&gt;
&lt;span&gt;&lt;i data-feather="check-circle"&gt;&lt;/i&gt;&lt;/span&gt;
&lt;span&gt;&lt;strong&gt;This is sample alert with &lt;code&gt;type=&amp;quot;success&amp;quot;&lt;/code&gt;.&lt;/strong&gt;&lt;/span&gt;
&lt;/div&gt;
&lt;div class="alert danger"&gt;
&lt;span&gt;&lt;i data-feather="alert-octagon"&gt;&lt;/i&gt;&lt;/span&gt;
&lt;span&gt;&lt;strong&gt;This is sample alert with &lt;code&gt;type=&amp;quot;danger&amp;quot;&lt;/code&gt;.&lt;/strong&gt;&lt;/span&gt;
&lt;/div&gt;
&lt;div class="alert warning"&gt;
&lt;span&gt;&lt;i data-feather="alert-triangle"&gt;&lt;/i&gt;&lt;/span&gt;
&lt;span&gt;&lt;strong&gt;This is sample alert with &lt;code&gt;type=&amp;quot;warning&amp;quot;&lt;/code&gt;.&lt;/strong&gt;&lt;/span&gt;
&lt;/div&gt;
&lt;div class="alert info"&gt;
&lt;span&gt;&lt;i data-feather="info"&gt;&lt;/i&gt;&lt;/span&gt;
&lt;span&gt;&lt;strong&gt;This is sample alert with &lt;code&gt;type=&amp;quot;info&amp;quot;&lt;/code&gt;.&lt;/strong&gt;&lt;/span&gt;
&lt;/div&gt;
&lt;div class="alert dark"&gt;
&lt;span&gt;&lt;i data-feather="alert-circle"&gt;&lt;/i&gt;&lt;/span&gt;
&lt;span&gt;&lt;strong&gt;This is sample alert with &lt;code&gt;type=&amp;quot;dark&amp;quot;&lt;/code&gt;.&lt;/strong&gt;&lt;/span&gt;
&lt;/div&gt;
&lt;div class="alert primary"&gt;
&lt;span&gt;&lt;i data-feather="alert-circle"&gt;&lt;/i&gt;&lt;/span&gt;
&lt;span&gt;&lt;strong&gt;This is sample alert with &lt;code&gt;type=&amp;quot;primary&amp;quot;&lt;/code&gt;.&lt;/strong&gt;&lt;/span&gt;
&lt;/div&gt;
&lt;div class="alert secondary"&gt;
&lt;span&gt;&lt;i data-feather="alert-circle"&gt;&lt;/i&gt;&lt;/span&gt;
&lt;span&gt;&lt;strong&gt;This is sample alert with &lt;code&gt;type=&amp;quot;secondary&amp;quot;&lt;/code&gt;.&lt;/strong&gt;&lt;/span&gt;
&lt;/div&gt;
&lt;h2 id="image"&gt;Image&lt;/h2&gt;
&lt;h4 id="a-sample-image-without-any-attribute"&gt;A sample image without any attribute.&lt;/h4&gt;
&lt;img src="https://low-hands.github.io/posts/shortcodes/boat.jpg"
alt="A boat at the sea"
&gt;
&lt;div style="margin-top: 3rem;"&gt;&lt;/div&gt;
&lt;h4 id="a-sample-image-with-height-and-width-attributes"&gt;A sample image with &lt;code&gt;height&lt;/code&gt; and &lt;code&gt;width&lt;/code&gt; attributes.&lt;/h4&gt;
&lt;img src="https://low-hands.github.io/posts/shortcodes/boat.jpg"
alt="A boat at the sea"
width="600"
height="400"
&gt;
&lt;div style="margin-top: 3rem;"&gt;&lt;/div&gt;
&lt;h4 id="a-center-aligned-image-with-height-and-width-attributes"&gt;A center aligned image with &lt;code&gt;height&lt;/code&gt; and &lt;code&gt;width&lt;/code&gt; attributes.&lt;/h4&gt;
&lt;img src="https://low-hands.github.io/posts/shortcodes/boat.jpg"
alt="A boat at the sea"
width="600"
height="400"
class="center"
&gt;
&lt;div style="margin-top: 3rem;"&gt;&lt;/div&gt;
&lt;h4 id="a-image-with-float-attribute"&gt;A image with &lt;code&gt;float&lt;/code&gt; attribute.&lt;/h4&gt;
&lt;img src="https://low-hands.github.io/posts/shortcodes/boat.jpg"
alt="A boat at the sea"
width="500"
height="200"
style="float: right;"
&gt;
&lt;p&gt;Lorem ipsum dolor sit amet, consectetur adipiscing elit. Cras egestas lectus sed leo ultricies ultricies. Praesent tellus risus, eleifend vel efficitur ac, venenatis sit amet sem. Ut ut egestas erat. Fusce ut leo turpis. Morbi consectetur sed lacus vitae vehicula. Cras gravida turpis id eleifend volutpat. Suspendisse nec ipsum eu erat finibus dictum. Morbi volutpat nulla purus, vel maximus ex molestie id. Nullam posuere est urna, at fringilla eros venenatis quis.&lt;/p&gt;</description></item><item><title>Markdown Samples</title><link>https://low-hands.github.io/posts/markdown-sample/</link><pubDate>Tue, 13 Jan 2026 00:43:25 -0800</pubDate><guid>https://low-hands.github.io/posts/markdown-sample/</guid><description>&lt;p&gt;This is a sample post intended to test the followings:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;A different post author.&lt;/li&gt;
&lt;li&gt;Table of contents.&lt;/li&gt;
&lt;li&gt;Markdown content rendering.&lt;/li&gt;
&lt;li&gt;Math rendering.&lt;/li&gt;
&lt;li&gt;Emoji rendering.&lt;/li&gt;
&lt;/ul&gt;
&lt;hr&gt;
&lt;h1 id="markdown-syntax-rendering"&gt;Markdown Syntax Rendering&lt;/h1&gt;
&lt;h2 id="headings"&gt;Headings&lt;/h2&gt;
&lt;p&gt;The following HTML &lt;code&gt;&amp;lt;h1&amp;gt;&lt;/code&gt;—&lt;code&gt;&amp;lt;h6&amp;gt;&lt;/code&gt; elements represent six levels of section headings. &lt;code&gt;&amp;lt;h1&amp;gt;&lt;/code&gt; is the highest section level while &lt;code&gt;&amp;lt;h6&amp;gt;&lt;/code&gt; is the lowest.&lt;/p&gt;
&lt;h1 id="h1"&gt;H1&lt;/h1&gt;
&lt;h2 id="h2"&gt;H2&lt;/h2&gt;
&lt;h3 id="h3"&gt;H3&lt;/h3&gt;
&lt;h4 id="h4"&gt;H4&lt;/h4&gt;
&lt;h5 id="h5"&gt;H5&lt;/h5&gt;
&lt;h6 id="h6"&gt;H6&lt;/h6&gt;
&lt;h2 id="paragraph"&gt;Paragraph&lt;/h2&gt;
&lt;p&gt;Xerum, quo qui aut unt expliquam qui dolut labo. Aque venitatiusda cum, voluptionse latur sitiae dolessi aut parist aut dollo enim qui voluptate ma dolestendit peritin re plis aut quas inctum laceat est volestemque commosa as cus endigna tectur, offic to cor sequas etum rerum idem sintibus eiur? Quianimin porecus evelectur, cum que nis nust voloribus ratem aut omnimi, sitatur? Quiatem. Nam, omnis sum am facea corem alique molestrunt et eos evelece arcillit ut aut eos eos nus, sin conecerem erum fuga. Ri oditatquam, ad quibus unda veliamenimin cusam et facea ipsamus es exerum sitate dolores editium rerore eost, temped molorro ratiae volorro te reribus dolorer sperchicium faceata tiustia prat.&lt;/p&gt;</description></item></channel></rss>