寄存

LSPn. This control block receives input from the STA111 instruction register, mode registers, and the TAP controller.

。这个控制块接收来自STA111指令寄存器的输入，模式寄存器和TAP控制器。

If one instruction stores a value in a register, and the next instruction tries to use that register as an operand, then the machine may have to stall waiting for that result to become available.

如果一条指令在某个寄存器中保存了一个值，而下一条指令尝试使用该寄存器作为操作数，那么机器也许不得不暂停来等待结果可用。

The target of the jump instruction itself may be hidden by computing its address in a register and using an indirect jump instruction to transfer control to the address in that register.

可能通过在某个寄存器中计算目标地址、并且使用间接跳转指令把控制传给该寄存器中的地址，把跳转指令本身的目标隐藏起来。

This is because the machine will work faster if the execution of the next microinstruction is delayed by one cycle.

这是因为，如果下一个微指令的执行被延迟一个时钟周期，计算机将工作的更快。这个寄存器被称作一个流水线寄存器。

Now we write the IOReg addres on latch so that we can read 16 bit IOReg later.

现在我们写在门电路上的数据寄存器地址，以便我们稍后能读 16bits的数据寄存器。

Within the kernel, register accesses, too, should be protected by locks, but one also does not want the compiler "optimizing" register accesses within a critical section.

在内核中，也应该使用锁保护寄存器的访问，也不想编译器优化寄存器在临界区域的访问。

Therefore, it is necessary to study these parallel problems. For the linear register systems, this paper presents a (1, N) parallel method with uniform calculating formulas by using the method of matrix equations, and studies to simplify XOR circuits. Comparing with the existing parallel methods for linear shift registers, this method for linear register systems doesn't need to expand the transition matrix, and has the same calculations for arbitrary N, which reduces the complexity.

对一般的线性寄存器系统，本文应用向量矩阵方程的研究方法提出了一种通用的、具有统一计算公式的(1， N)并行方法，研究了其中异或电路的化简，相对于已有的线性移位寄存器的并行方法而言，本文提出的方法不需要扩展矩阵，对任意的N计算公式均是统一的形式，减少了问题复杂性，具有更广泛的应用范围。

The register file is dynamically partitioned between thread blocks by the JIT/driver, and within the allocation for each thread block, the registers are statically assigned to a given thread.

JIT/驱动能够动态的为线程块分配寄存器，而每个线程块中的线程占用的寄存器大小则是静态分配的，在线程块寿命期间都不会更改。

Registers are always the most efficient way to store immediate values, and using them always generates the fastest and smallest code (smallest because most instructions have short preassigned codes for accessing registers).

寄存器是存放马上要使用的变量的最有效的方式，因为只有这样才能产生最快最小的代码(产生最小的代码是因为大多数指令都有用于访问寄存器的较短的预处理指令)。

When realizing on hardware, for an M×N UFPA, at any sampling time, a shift-register is used to store M data which is before the current sample data and the shift-register′s output is updated with the data which is at the same column while the upper row. Meanwhile, a common register is used to store the data which is at the same row while the previous column.

在硬件实现阶段，对于M×N的UFPA器件，在任意采样时刻，利用移位寄存器保存当前采样点之前的M个响应值，使其输出可实时更新为与采样点同列的上一个数据；同时，利用一般的寄存器实时保存与采样点同行的前一个数据，采用同帧行列间内插法实现无效像元的实时补偿。

Results showed that 0.01g/mL extract of Oxalis corniculata L. had obvious antimicrobial effect on S. aureus, but all extract of Oxalis corniculata L has not any antimicrobial effect on E.

结果表明，0.01g/ml的提取物对摇床培养的金黄色葡萄球菌生长具有明显的抑制作用；但各种浓度的提取物对摇床培养的大肠杆菌生长均无抑制作用。

This will be totally different from Zaro's texture mod, it will be desaturated, dirty etc.

这会和Zaro的那个材质补丁有很大不同，这边是更多的不饱和色，整个都灰扑扑的。