可串行化

According to actual condition, a model of wall thickness of rotary kiln is established. The constant coefficients in the model, including thermal conductivity, heat transfer coefficient, Fourier coefficient and contact resistance, are closely calculated. A formula of contact resistance is draw from a great deal of data of surface and inner temperature of rotary kiln. The wall thickness of rotary kiln is simulated by MATLAB. The simulation result is transmitted from MATLAB to DELPHI through a group of interface functions compiled by VC++. The basic graphs-circle and line are analyzed by the means of the technique of Visualization in Scientific Computing and the Bresenham arithmetic, and are realized the visualization of the wall thickness. The contents of communication between master computer and slaver computer are designed and the error control technique, the idea of multi-thread and the embedded assembly language are applied to realize the temperature data transmission and graph transmission, which largely improved the speed of transmission and the reliability and stability of system.

建立了符合现场实际的回转窑壁厚数学模型；结合现场采用红外测温仪测量所得的温度数据和回转窑的实际结构数据，确定出适合该模型的定常系数(包括导热系数、换热系数、傅立叶系数、接触热阻等)，并得出与回转窑工况的相近的接触热阻公式ln=T~(0.5154)-36.7868；利用MATLAB软件仿真出回转窑壁厚，并将运算结果通过在VC++的编译环境下编译出MATLAB和DELPHI的接口函数传输到该监测系统中，实现了温度数据的转换和交换；运用科学计算可视化技术和Bresenham扫描转换算法对基本图形——圆和直线进行分析，从而实现了仿真后的壁厚数据可视化；在研究异步串行通信方式的基础上，设计了该系统上下位机功能和通信内容，并运用差错控制技术、多线程思想以及嵌入式汇编语言实现了温度数据和图形数据在上下位机之间的远程传输，提高了数据传输的速率和系统的可靠性、稳定性。

Are there serializability and permanence requirements associated with such actions?

这些动作是否应满足可串行化和持久性的要求？

Formal transaction model of its transaction system is given and its property of supporting dynamic security attributes revocation and serializability of the history of well-formed transactions is proven.

对系统框架中的关键组件进行了伪码描述，并通过形式化的事务模型证明了事务系统对动态安全属性撤销的支持和良构事务构成的历史的可串行化的性质。

Concurrency control and recovery techniques are used in conventional DBMS's to preserve the serializability and the permanence requirements of database transactions.

在传统数据库管理系统中，采用并发控制和恢复技术来保证数据库事务的可串行化和持久性要求。

The features of transaction in multidatabase systems are analyzed, and the necessity to keep the global serializability when concurrency control of transaction processing in multidatabases is emphasized.

分析了多数据库系统中事务的特征，指出多数据库事务处理的并发控制问题需保持全局可串行化，即要求在各局部场地局部事务的执行不违反全局的执行次序。

In order to improve the efficiency of DBMS, Concurrent Control is the basic requirement on concurrent transactions execution. When transactions execute instantaneously, Lock Mechanism which could ensure transaction serializability is a good way. But the problem that LM produces should be faced.

并发控制是数据库管理系统提高运行效率的基本要求，事务并发执行时，采用锁机制是保证事务可串行化的一个方法，但因此而产生的死锁问题是一个必须面对的问题，其根本原因是由于数据共享的要求而造成的。

Firstly, the definition of cooperative transactions is given and the states of them are specified. Secondly, the dependencies among cooperative transactions and those between cooperative transactions and outside environments are specified in terms of states of cooperative transactions. Finally, the serializability correctness criterion for the presented model is specified by state dependencies of cooperative transactions.

首先给出了协同事务的定义，并描述了协同事务的状态，然后从协同事务的状态角度刻画协同事务之间、协同事务与外部环境之间的复杂依赖关系，最后用协同事务的状态依赖描述了可串行化正确性准则。

Traditional concurrency control methods constrain the concurrency of transactions and are disadvantageous to satisfaction of Real-Time transactions' timing constraints. We develop a novel quasi-consistent serializable concurrency control strategy. The inconsistency brought by transactions to the system was restricted to an extent.

传统的并发控制策略限制了事务执行的并发度，对实时事务定时限制的满足是不利的，我们开发了一种适合于实时应用环境的新颖的&准一致性可串行化&并发控制方法，事务给系统带来的不一致程度被限定在一定范围内。

Serializing the tasklet simplifies the life of device driver developers, since the tasklet function needs not to be re-entrant.

串行化tasklet简化了设备驱动程序开发者的工作，因为tasklet函数不需要可重入的。

This paper considers the problem of view self-maintenance, where the views are maintained without base database, including how to maintain a view and determining whether a view is maintainable.

由于延迟视图维护机制允许修改事务在全局视图没有进行相应的改动之前提交，有暂时的数据不一致情况出现，在这种情况下，即使严格的ZPL协议也不能保证全局事务的可串行化执行。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。