Associating versus proposing or associating what we propose: Comment on Gawronski and Bodenhausen (2006).

This commentary on the article by B. Gawronski and G. V. Bodenhausen (see record 2006-10465-003) highlights the strengths of the associative-propositional evaluation model. It then describes problems in proposing a qualitative separation between propositional and associative processes. Propositional processes are instead described as associative. Propositions are ordered associations, whereas many other associations do not depend on the order of the involved elements. Implications of this alternative definition for the phenomenology of thought and for social psychology are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

基于移动设备手写签名认证系统的设计与实现

由于移动设备具有通过外部的无线网络访问数据、体积小容易丢失等特征，给操作带来方便的同时．也给后台数据库带来很大的安全隐患。文章针对基于移动设备的无线网络应用系统，在Windows2000和Windows Mobile2003操作平台上．利用Microsoft的Visual Studio．Net2003和．NET Compact Framework开发环境，设计和实现了基于移动设备手写签名认证系统。实验结果表明：在少量样本数据情况下，对于非专业模仿签名的错误接受率FAR为3．65％．而错误拒绝率FRR为2．9％。该系统增强移动设备访问数据的安全性，提高操作员认证的效率．具有很强的舅用性。     

Verification of FM9801: An Out-of-Order Microprocessor Model with Speculative Execution, Exceptions, and Program-Modifying Capability

We have verified the FM9801, a microprocessor design whose features include speculative execution, out-of-order issue and completion of instructions using Tomasulo's algorithm, and precise exceptions and interrupts. As a correctness criterion, we used a commutative diagram that compares the result of the pipelined execution from a flushed state to another flushed state with that of the sequential execution. Like many pipelined microprocessors, the FM9801 may not operate correctly if the executed program modifies itself. We discuss the condition under which the processor is guaranteed to operate correctly. In order to show that the correctness criterion is satisfied, we introduce an intermediate abstraction that records the history of executed instructions. Using this abstraction, we define a number of invariant properties that must hold during the operation of the FM9801. We verify these invariant properties, and then derive the proof of the commutative diagram from them. The proof has been mechanically checked by the ACL2 theorem prover.     

一种定位精确的混沌脆弱数字水印技术

提出了一种特别适用于数字产品的认证、内容篡改证明和完整性证明的脆弱数字水印算法.原始图像的象素灰度值映射为混沌的初值,经过若干次迭代生成水印图像,然后把它嵌入象素灰度值的LSB(Least Significant Bit)平面.利用混沌对初值极端敏感性的特点,能够精确地定位对加入水印图像的篡改,并且水印提取不需要原始图像.实验结果表明了所提出水印方案对篡改证明的有效性,敏感性以及良好的篡改定位能力.     

纸浆浓度控制系统的参数调整

介绍一种纸浆浓度控制系统参数调整的实用方法，并讨论了纸浆浓度控制系统的特点     

Value Constraints in the CLP Scheme

We define value constraints, a method for incorporating constraint propagation into logic programming. It is a subscheme of the CLP scheme and is applicable wherever one has an efficient method for representing sets of possible values. As examples we present: small finite sets, sets of ground instances of a term, and intervals of reals with floating-point numbers as bounds. Value constraints are defined by distinguishing two storage management strategies in the CLP scheme. In value constraints the infer step of the CLP scheme is implemented by Waltz filtering. We give a semantics for value constraints in terms of set algebra that gives algebraic characterizations of local and global consistency. The existing extremal fixpoint characterization of chaotic iteration is shown to be applicable to prove convergence of Waltz filtering.     

RHEOLOGICAL AND PHYSICOCHEMICAL BEHAVIOR OF FORTIFIED YOGURT, WITH FIBER AND CALCIUM

Yogurt systems were prepared from whole milk, adding 50 mg of calcium/100 mL of yogurt, and three levels of fiber from two wheat‐bran sources. In comparison with a plain yogurt, the presence of fiber and calcium augmented the consistency, diminished the syneresis and the pH was higher. Fiber increased the consistency, and all the formulated samples exhibited a non‐Newtonian response. During 3 weeks of storage time, the consistency reduced (from 2.0 to 0.32 Pa·s ⁿ ), syneresis increased (from 20 to 48%) and pH decreased (from 4.5 to 4.2) as a function of the system formulation.     

总线监视器的设计

随着集成电路设计规模的不断增加，传统的验证方法学由于无法提供足够的能力来检查系统所有可能功能的正确性，已经不能满足SoC验证的需求。验证重用方法学是解决这一问题的有效途径。在SoC的验证过程中．利用总线监视器对片上总线上发生的事务进行实时监视，并将监视结果以机器可读的格式显示出来，从而可以帮助验证工程师有效地判断数据传输的正确性，达到验证单个模块和系统功能的目的。本文提出了一种SoC功能。验证平台中总线监视器的设计方法，并给出了具体的实现过程。     

一种用于密码协议形式化验证的简单逻辑

给出了一个可用于密码协议形式化验证与设计的简单逻辑.该逻辑采用抽象的通道概念表示具有多种安全特性的通信链路,可在比现有认证逻辑的更抽象的层次上对协议进行处理.     

Formal verification of software source code through semi-automatic modeling

We describe the experience of modeling and formally verifying a software cache algorithm using the model checker RuleBase. Contrary to prevailing wisdom, we used a highly detailed model created directly from the C code itself, rather than a high-level abstract model.