Physiological arousal, dissonance, and attitude change: Evidence for a dissonance-arousal link and a "Don't remind me" effect.

Two experiments, with 80 undergraduates, replicated and extended research by R. T. Croyle and J. Cooper (see record 1984-11595-001) indicating that cognitive dissonance involves physiological arousal. In Exp I, Ss wrote counterattitudinal essays under conditions of high or low choice and, to assess arousal effects owing to effort, with or without a list of arguments provided by the experimenter. In high-choice conditions only and regardless of effort, Ss showed both arousal (heightened galvanic skin response) and attitude change. Arousal, however, did not decline following attitude change. The more effortful task (no arguments provided) produced increased arousal but not greater attitude change. In Exp II, the opportunity to change one's attitude following a freely chosen counterattitudinal essay was manipulated. As in Exp I, arousal increased following the essay but did not decline following a postessay attitude change opportunity. When Ss were not given an attitude change opportunity, however, arousal did decline. It is suggested that if dissonance is a drive state, drive reduction typically may be accomplished through gradual cognitive change or forgetting. (47 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

The pulse distributed file system

A network of powerful personal computers, linked by a high-speed local area network, is being seen increasingly as an alternative to a traditional centralized time-sharing operating system. The PULSE project is investigating how such a system may be constructed to give the benefits of a self-sufficient personal computer to each user without losing the facilities for communication and sharing of data inherent in centralized systems. In particular, a distributed file system has been built which provides a single global UNIX

1 UNIX is a trademark of Bell Laboratories.

-like hierarchy, with a consistent appearance when accessed from any machine. Replicated copies of files are maintained to improve reliability, increase performance, and enable each machine to run stand-alone, albeit with reduced facilities.     

OsMre11 Is Required for Mitosis during Rice Growth and Development

Meiotic recombination 11 (Mre11) is a relatively conserved nuclease in various species. Mre11 plays important roles in meiosis and DNA damage repair in yeast, humans and Arabidopsis, but little research has been done on mitotic DNA replication and repair in rice. Here, it was found that Mre11 was an extensively expressed gene among the various tissues and organs of rice, and loss-of-function of Mre11 resulted in severe defects of vegetative and reproductive growth, including dwarf plants, abnormally developed male and female gametes, and completely abortive seeds. The decreased number of cells in the apical meristem and the appearance of chromosomal fragments and bridges during the mitotic cell cycle in rice mre11 mutant roots revealed an essential role of OsMre11. Further research showed that DNA replication was suppressed, and a large number of DNA strand breaks occurred during the mitotic cell cycle of rice mre11 mutants. The expression of OsMre11 was up-regulated with the treatment of hydroxyurea and methyl methanesulfonate. Moreover, OsMre11 could form a complex with OsRad50 and OsNbs1, and they might function together in non-homologous end joining and homologous recombination repair pathways. These results indicated that OsMre11 plays vital roles in DNA replication and damage repair of the mitotic cell cycle, which ensure the development and fertility of rice by maintaining genome stability.     

基于K-距离拓扑的分布式数据存储方法

针对分布式数据存储算法通常需要较长的等待时间、且对海量数据加密时严重浪费计算资源和时间的问题,提出了一种基于K-距离拓扑的分布式数据存储方法.通过寻找K-距离拓扑子图来实现数据的安全放置,优先选择存取速度更快的节点和自身保护能力强的节点实现总体性能的提升.在Internet 2拓扑图与随机拓扑图下的仿真测试结果表明,所提出的方法能在满足安全距离约束的条件下选择到最优的数据存储节点,从而减小数据存取时间.     

融合节点状态信息的跨社交网络用户对齐

提出一种融合节点状态信息的跨社交网络用户对齐方法, 通过网络表示捕获节点的局部特征和节点状态信息得到每个账户的嵌入向量, 计算不同账户对应表示之间的相似性发现对齐用户。在2个真实数据集上的试验结果表明, 提出的方法相对于其他方法可以对齐更多的用户。在预测不同尺度的top-k时, 提出的方法在网络结构较稠密的Twitter-Foursquare数据集上能够在top-9时对齐准确率达到50%且在稀疏且大网络数据集DM-ML上相比其他方法对齐准确率提高12.06%~36.62%;在分析F1-score时, 提出的方法能够有效提高用户对齐的性能。     

WiNoC中基于Edge first算法的流量平衡设计

在无线片上网络中,无线节点拥塞以及不同子网和全局网络内的流量平衡情况对整个片上网络的通信效率有着重要的影响,为此提出了基于Edge first算法的全局流量平衡机制（GTB）。首先优化了划分有线无线数据包的机制,减少了无线节点处的拥塞;其次根据无线路由器（WR）的拥塞情况,提出Edge first路由算法平衡子网内的流量;最后在全局网络中提出了全局子网拥塞感知（GSCA）判断机制,使得长距离数据包优先从低拥塞子网通过,平衡了全局网络的流量。实验表明,该方案在可接受的硬件开销、功耗开销下,保证较低的网络延迟和较高的网络吞吐率,并且大幅的提升了网络的流量平衡性能。     

关注区可变的实时仿真方法与平台

交直流混合电网的实时仿真既要考虑电力电子设备的开关特性,又要保证适应较大的电网规模,在实际工程中面临诸多困难.给子网络赋予动态可变的关注标志,对关注子网络采用存储压力小的节点消去法,对非关注子网络采用计算量少的线性组合法,从而保证骨架型节点电压法的实用性.在Xilinx公司的Virtex-7 FPGA VC709开发板中,采用无缝的并行化仿真计算程序对接方式和灵活的结构参数查询方法解决了现场可编程逻辑门阵列资源的紧缺问题,设计了一种关注区可变的实时数字仿真平台.以典型的交直流混合电网为例,仿真验证了所提方法的可行性与所研发平台的有效性.     

等误差直线逼近非圆曲线节点计算新方法

传统的等误差直线逼近法从被逼曲线的端点开始计算节点.文章在此基础上提出一种非圆曲线节点计算新方法,以被逼曲线曲率半径最小点开始,按等误差法求取节点,再根据曲线规律对节点重新进行排序,输出节点坐标值.用该种方法逼近曲线,在逼近误差等于等误差法逼近误差的条件下,节点数少于等误差法求得的节点数,文中用C语言编写新方法求取节点程序,并与传统方法进行比较,最后用曲线方程进行验证,结论正确,具有实际意义.     

Dynamic replica placement and selection strategies in data grids— A comprehensive survey

Data replication techniques are used in data grid to reduce makespan, storage consumption, access latency and network bandwidth. Data replication enhances data availability and thereby increases the system reliability. There are two steps involved in data replication, namely, replica placement and replica selection. Replica placement involves identifying the best possible node to duplicate data based on network latency and user request. Replica selection involves selecting the best replica location to access the data for job execution in the data grid. Various replica placement and selection algorithms are available in the literature. These algorithms measure and analyze different parameters such as bandwidth consumption, access cost, scalability, execution time, storage consumption and makespan. In this paper, various replica placement and selection strategies along with their merits and demerits are discussed. This paper also analyses the performance of various strategies with respect to the parameters mentioned above. In particular, this paper focuses on the dynamic replica placement and selection strategies in the data grid environment.     

基于贪婪算法无线传感器网络中继节点布局的研究

为实现远距离的无线通信, 在网络中添加中继节点, 采用多跳路由传输数据。对于中继节点的布局问题, 依据线性结构使网络整体能量消耗最小的特征, 提出一种中继节点贪婪布局算法。该算法通过最近贪婪策略、中继节点通信容量、传感器节点数据转发跳数等约束方法限制中继节点的布局位置。理论分析和实验验证了该算法能够有效减少能量消耗, 延长网络寿命。