快速直接还原法生产金属化球团工艺的探讨

研究开发了冷固结含碳铁矿球团的还原工艺，它与环形转底炉相结合，形成快速直接还原新工艺，生产金属此球团，具有一系列优点，如：设备简单，生产效率高、能耗低等等。     

归约算法统一描述

归约算法在并行计算中应用广泛,目前有很多归约算法应用于不同的情形。这些归约算法各不相同, 逻辑拓扑是 造成区别的关键 。为了统一描述归约算法,揭示它们的共性,给出了一个逻辑拓扑的定义及其性质。在此基础上,给出了归约算法的统一描述,以利于对归约算法的理解,从而设计适应不同应用和环境的归约算法。该描述也可视为可集成不同语义的归约算法框架,从而有助于设计具有新语义的归约算法。本质上,该统一描述是一个归约算法形式定义,有助于验证归约算法的正确性。     

The Double‐Edged Sword: The Effects of Journalists' Social Media Activities on Audience Perceptions of Journalists and Their News Products

As social media become popular news platforms, journalists and news organizations have been keen to capitalize on their potential to build and maintain audiences. However, little is known about the extent to which these efforts may have adverse implications. Based on normative theories, the present study investigates the influence of journalists' social media activities (specifically, self‐disclosure and interaction with other users) on audience perceptions of journalists. An experiment (N = 267) revealed that: Although both journalists' self‐disclosure and interaction positively influenced audience perceptions of the journalists in the personal dimension, interaction negatively influenced audience perceptions in the professional dimension; and the perceptions transferred to perceptions of news products, thereby mediating the relationship between journalists' social media activities and audience news perceptions.     

基于非线性降维算法的膜蛋白类型识别

众所周知,研究未知膜蛋白的类型可对基础研究和药物发现提供有用的线索。在后基因组时代,伴随着蛋白质序列数量的剧增,用实验方法确定膜蛋白类型太过昂贵和费时。因此,研究出一种能够自动发现可能的膜蛋白的计算方法变得很重要。鉴于这种情况,曾有人采用DC(Dipeptide Composition)方法表示蛋白质序列并取得了很好的预测结果。然而,采用这种表示方法得到的特征维数很高,冗余很大,使得预测系统十分复杂。为了解决这个问题,本文采用非线性降维算法KPCA(Kernel Principle component analysis),通过从高维的DC(Dipeptide Composition)特征空间中提取出低维的重要特征来简化该系统,采用K-NN(K-nearest neighbor)分类器从约简后的低维特征中预测膜蛋白类型。实验结果表明,使用KPCA方法预测膜蛋白类型非常有效。     

From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time

We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows users to apply their domain knowledge to control the construction of the agreement subtrees in order to get better results. We show that the MCAST problem can be reduced to the MAST problem in linear time and thus we have algorithms for MCAST with running times matching the fastest known algorithms for MAST. A preliminary version of this paper appears in the Proceedings of the Fifth Workshop on Algorithms in Bioinformatics (WABI 2005). Research of H.F. Ting is supported in part by Hong Kong RGC Grant HKU-7172/06E.     

一种快速映射Isomap算法

传统的Isomap算法仅侧重于当前数据的分析,不能提供由高维空间到低维空间的快速直接映射,因此无法用于特征提取和高维数据检索.针对这一问题,文中提出一种基于Isornap的快速数据检索算法.该算法能够快速得到新样本的低维嵌入坐标,并基于此坐标检索与输入样本最相似的参考样本.在典型测试集上的实验结果表明,该算法在实现新样本到低维流形快速映射的同时,能较好保留样本的近邻关系.     

Elastic block ciphers: method, security and instantiations

We introduce the concept of an elastic block cipher which refers to stretching the supported block size of a block cipher to any length up to twice the original block size while incurring a computational workload that is proportional to the block size. Our method uses the round function of an existing block cipher as a black box and inserts it into a substitution- permutation network. Our method is designed to enable us to form a reduction between the elastic and the original versions of the cipher. Using this reduction, we prove that the elastic version of a cipher is secure against key-recovery attacks if the original cipher is secure against such attacks. We note that while reduction-based proofs of security are a cornerstone of cryptographic analysis, they are typical when complete components are used as sub-components in a larger design. We are not aware of the use of such techniques in the case of concrete block cipher designs. We demonstrate the general applicability of the elastic block cipher method by constructing examples from existing block ciphers: AES, Camellia, MISTY1, and RC6. We compare the performance of the elastic versions to that of the original versions and evaluate the elastic versions using statistical tests measuring the randomness of the ciphertext. We also use our examples to demonstrate the concept of a generic key schedule for block ciphers.

An operational semantics for a calculus for wireless systems

In wireless systems, the communication mechanism combines features of broadcast, synchrony, and asynchrony. We develop an operational semantics for a calculus of wireless systems. We present different Reduction Semantics and a Labelled Transition Semantics and prove correspondence results between them. Finally, we apply CWS to the modelling of the Alternating Bit Protocol, and prove a simple correctness result as an example of the kind of properties that can be formalized in this framework.A major goal of the semantics is to describe the forms of interference among the activities of processes that are peculiar of wireless systems. Such interference occurs when a location is simultaneously reached by two transmissions. The Reduction Semantics differ on how information about the active transmissions is managed.We use the calculus to describe and analyse a few properties of a version of the Alternating Bit Protocol.     

Passive control of uncertain multiple input-delayed systems using reduction method

In order to conveniently analyze stability of uncertain multiple input-delayed closed-loop systems and successfully synthesize passive controllers for a general class of uncertain multiple input-delayed systems with disturbance, the so-called reduction method is applied to the multiple input-delayed systems with parametric uncertainties. A feedback controller associated with the system state and the past control action is designed to guarantee the passivity of the closed-loop systems for all admissible uncertainties. The theoretical findings are illustrated and verified with one numerical example.