即时通讯软件的安全性分析

在互联网服务中,即时通讯已成为了最流行的服务模式之一,人们对即时通讯的依赖程度也与日俱增。但是, 频频出现的病毒和黑客攻击使广大用户深受其害,即时通讯的安全问题也日益严峻。为了从根本上解决问题,本文对即时通讯软件的架构和协议进行了深入分析,目的是找出漏洞根源,给开发者和使用者提供防止漏洞的依据。     

A parallel and scalable algorithm for ADI method with pre-propagation and message vectorization

It is hard to implement the ADI method in an efficient way on distributed-memory parallel computers. We propose “P-scheme” which parallelizes a tridiagonal linear system of equations for the ADI method, but its effectiveness is limited to the cases where the problem size is large enough mainly because of the communication cost of the propagation phase of the scheme.

In order to overcome this difficulty, we propose an improved version of the P-scheme with “message vectorization” which aggregates several communication messages into one and alleviates the communication cost. Also we evaluate the effectiveness of message vectorization for the ADI method and show that the improved version of the P-scheme works well even for smaller problems and linear and super-linear speedups can be achieved for 8194 × 8194 and 16,386 × 16,386 problems, respectively.     

Exchange and oxidation of CO on O-predosed Rh---Al2O3 and Rh---CeO2 catalysts

Exchange and oxidation of C¹⁶O were investigated at 450°C on ¹⁸O-predosed Rh and Pt catalysts supported on A1₂O₃, CeO₂ and CeO₂-Al₂O₃. In all cases, a rapid exchange of C¹⁶O with the surface can be observed. CO oxidation leads to C¹⁶O₂, C¹⁶O¹⁸O and C¹⁸O₂. Significant formation of C¹⁶O₂ is due to the relatively high ¹⁶O coverage in reaction resulting from the C¹⁶O exchange and from an exchange between O surface species and ¹⁶O internal atoms. Hydrogen is also formed via a water-gas shift reaction (CO + surface OH) in higher proportion on CeO₂-containing catalysts than on A1₂O₃. Chlorine inhibits all the reactions (exchange, oxidation and WGS) and particularly the internal exchange.     

On collaborative content distribution using multi-message gossip

We study epidemic schemes in the context of collaborative data delivery. In this context, multiple chunks of data reside at different nodes, and the challenge is to simultaneously deliver all chunks to all nodes.     

数据压缩的综合字典模型

文中提出一种无损的数据压缩的字典方法，被称为综合字典方法，该方法在较大程度上消除数据文件中多种形式的冗余，达到较好的压缩效果。     

Secure Multi-Party Computation without Agreement

It has recently been shown that authenticated Byzantine agreement, in which more than a third of the parties are corrupted, cannot be securely realized under concurrent or parallel (stateless) composition. This result puts into question any usage of authenticated Byzantine agreement in a setting where many executions take place. In particular, this is true for the whole body of work of secure multi-party protocols in the case that a third or more of the parties are corrupted. This is because these protocols strongly rely on the extensive use of a broadcast channel, which is in turn realized using authenticated Byzantine agreement. We remark that it was accepted folklore that the use of a broadcast channel (or authenticated Byzantine agreement) is actually essential for achieving meaningful secure multi-party computation whenever a third or more of the parties are corrupted. In this paper we show that this folklore is false. We present a mild relaxation of the definition of secure computation allowing abort. Our new definition captures all the central security issues of secure computation, including privacy, correctness and independence of inputs. However, the novelty of the definition is in decoupling the issue of agreement from these issues. We then show that this relaxation suffices for achieving secure computation in a point-to-point network. That is, we show that secure multi-party computation for this definition can be achieved for any number of corrupted parties and without a broadcast channel (or trusted pre-processing phase as required for running authenticated Byzantine agreement). Furthermore, this is achieved by just replacing the broadcast channel in known protocols with a very simple and efficient echo-broadcast protocol. An important corollary of our result is the ability to obtain multi-party protocols that remain secure under composition, without assuming a broadcast channel.     

虚拟企业模型并行仿真研究

随着各种全新的制造理念,特别是虚拟企业的出现,企业模型的规模不断扩大,使目前存在的大多数企业模型仿真系统的效率大大下降。该文针对此问题,通过深入分析虚拟企业模型结构,并在已有的构件化企业建模体系CEMS及其仿真系统的基础上,结合异步仿真技术和多线程技术提出了一种分层式企业模型仿真体系结构,为虚拟企业模型的快速高效的仿真提供了一种有效的方法。     

基于Boost消息机制研究与实现

消息通信机制可以有效的简化系统设计,增强系统的可扩展性。Boost Signal/Slot机制,为在进行消息机制开发提供了有力的工具。以Boost为基础,分析了Boost消息机制的实现方式,通过引入一个简单实例,演示了利用Boost构造消息机制的基本方法。     

An improved algorithm for finding the median distributively

Given two processes, each having a total-ordered set ofn elements, we present a distributed algorithm for finding median of these 2n elements using no more than logn +O(logn) messages, but if the elements are distinct, only logn +O(1) messages will be required. The communication complexity of our algorithm is better than the previously known result which takes 2 logn messages.     

中国机械工程学会铸造分会创建40周年回顾

对中国机械工程学会铸造分会成立40年来的各种工作进行了回顾和总结，将学会的工作分为3个阶段，即初创阶段、恢复阶段和成长阶段，对各阶段铸造分会理事会的组成，组织的学术年会、国际会议、编辑出版工作、展览（展示）活动、国际交流等进行了回顾。