基于词法特征的恶意域名快速检测算法

针对互联网中恶意域名攻击事件频发，现有域名检测方法实时性不强的问题，提出一种基于词法特征的恶意域名快速检测算法。该算法根据恶意域名的特点，首先将所有待测域名按照长度进行正则化处理后赋予权值；然后利用聚类算法将待测域名划分成多个小组，并利用改进的堆排序算法按照组内权值总和计算各域名小组优先级，根据优先级降序依次计算各域名小组中每一域名与黑名单上域名之间的编辑距离；最后依据编辑距离值快速判定恶意域名。算法运行结果表明，基于词法特征的恶意域名快速检测算法与单一使用域名语义和单一使用域名词法的恶意域名检测算法相比，准确率分别提高1.7%与2.5%，检测速率分别提高13.9%与6.8%，具有更高的准确率和实时性。     

Adaptive backstepping repetitive learning control design for nonlinear discrete‐time systems with periodic uncertainties

This paper addresses a tracking problem for uncertain nonlinear discrete‐time systems in which the uncertainties, including parametric uncertainty and external disturbance, are periodic with known periodicity. Repetitive learning control (RLC) is an effective tool to deal with periodic unknown components. By using the backstepping procedures, an adaptive RLC law with periodic parameter estimation is designed. The overparameterization problem is overcome by postponing the parameter estimation to the last backstepping step, which could not be easily solved in robust adaptive control. It is shown that the proposed adaptive RLC law without overparameterization can guarantee the perfect tracking and boundedness of the states of the whole closed‐loop systems in presence of periodic uncertainties. In addition, the effectiveness of the developed controller is demonstrated by an implementation example on a single‐link flexible‐joint robot. Copyright © 2014 John Wiley & Sons, Ltd.     

Calf massager: Intervention for body muscle discomfort during prolonged standing

Many occupations require workers to stand for long periods of time without proper interventions, which causes discomfort in the back and lower limbs. Therefore, this study aims to assess the effectiveness in alleviating body muscle discomfort during prolonged standing through the use of a calf massager. This study was conducted among male workers at a manufacturer with production line workers and the list was obtained from the HR Department and simple random sampling was done by number categorization. A total of 100 respondents (50 respondents for both the control and the experimental groups) participated in this study. The experiment took place in a room with a similar setup for the production line. Each respondent was requested to perform the simulated task for 2 hr. For the experimental group, the calf massager was turned on every 15 min. At every 15‐min interval after turning on the calf massager, respondents from both groups were required to evaluate their discomfort level on a Borg's scale CR‐10 questionnaire. The results showed that the level of body discomfort among respondents in the experimental group reduced (20–30%) compared with that of the control group. Multivariate analysis results revealed that the discomfort rating for the lower back, knees, thighs, calves, and feet was significantly lower (p < .05) among the experimental group compared with the control group. For lower body parts, the lower back region was statistically significant (p < .05) at the 90th, 105th, and 120th min; the thigh region was statistically significant (p < .05) at the 120th min; the knee region was statistically significant (p < .05) at the 105th and 120th min; the calf region was statistically significant (p < .05) at all minute intervals except the 15th and 45th min, while the feet region, was statistically significant at the 105th and 120th min. Therefore, this study indicates that calf massage treatment is capable of reducing body muscle discomfort during prolonged standing and highlights the significance of calf massage.     

ATSP:时态网络可视化的自适应时间片划分方法

现有的时态网络可视化方法大多采用等量时间片来可视化网络的演变，不利于时态模式的快速挖掘和发现。为此，根据时态网络固有的特征提出自适应时间片划分方法（Adaptive Time Slice Partition method，ATSP）。在时态网络的两种表示方式（基于事件的表示方式和基于快照的表示方式）的基础上，构建了ATSP的基础模型，同时提出了一种改进模型用来描述事件间隔时间服从长尾分布的时态网络。为了实现时间片的不等量划分，针对探索任务的不同提出了基于时态模式的ATSP规则和基于中心节点的ATSP规则，并提出了实现算法--层次划分算法（Hierarchical Partition algorithm，HP）和增量划分算法（Incremental Partition algorithm，IP）。实验结果表明，ATSP方法比传统的时间片划分方法更能准确地表示网络的时态特征，且该方法应用于可视化时，能有效归纳并展示网络的特征，明显提高了视觉分析的效率。     

马尔可夫跳变线性系统最优控制的研究现状与进展

马尔可夫跳变线性系统（MJLS）是一种具有多个模态的随机系统，系统在各个模态之间的跳变转移由一组马尔可夫链来决定。MJLS模型因其在表示过程中可以产生突变而更能精确的描述实际工程应用中的系统。近年来，MJLS的最优控制问题成为了研究的热点，动态规划、极大值原理以及线性矩阵不等式等成为了解决此类问题的主流方法。本文对MJLS最优控制领域的研究现状进行了综述。分别对一般情况下、带有噪声的情况下、带有时滞的情况下以及某些特定情况下的MLJS最优控制问题的国内外研究现状进行论述。最后进行了总结并提出MJLS最优控制领域未来值得关注的研究方向。     

Chromium evaporation and oxidation characteristics of alumina-forming austenitic stainless steels for balance of plant applications in solid oxide fuel cells

The chromium (Cr) evaporation behavior of several different types of iron (Fe)-based AFA alloys and benchmark Cr₂O₃-forming Fe-based 310 and Ni-based 625 alloys was investigated for 500 h exposures at 800 °C to 900 °C in air with 10% H₂O. The Cr evaporation rates from alumina-forming austenitic (AFA) alloys were ~5 to 35 times lower than that of the Cr₂O₃-forming alloys depending on alloy and temperature. The Cr evaporation behavior was correlated with extensive characterization of the chemistry and microstructure of the oxide scales, which also revealed a degree of quartz tube Si contamination during the test. Long-term oxidation kinetics were also assessed at 800 to 1000 °C for up to 10,000 h in air with 10% H₂O to provide further guidance for SOFC BOP component alloy selection.     

基于区块链技术的公益时间银行系统

在现有的时间银行系统中，时间币的发行功能和结算功能完全集中到一个中心节点上。这种极度中心化的功能结构，不仅存在容易发生中心节点单点失效、数据容易被篡改等信息安全问题，还存在着时间币的发行和流通缺乏透明度以及时间币的结算依赖中心化的结算机构等问题。针对这些问题，提出了一种基于区块链技术的解决方法。首先，将时间币的发行功能和结算功能从中心节点上分离出来；然后，利用具有分布式去中心化、集体维护和不可篡改等特性的区块链技术，将分离出来的发行功能逐步去中心化，将分离出来的结算功能去中心化，形成公益时间链（PWTB）；最终，PWTB利用区块链技术以去中心化的方式将时间银行系统由单个节点维护账本变成由集体维护一个分布式的共享账本，使时间币的发行和流通公开透明，时间币的结算不依赖某个中心化的节点。安全分析表明所设计的PWTB能够实现安全的信息传输与存储，以及数据的共享。     

Usability of a cloud-based collaborative learning framework to improve learners’ experience

Computer-Supported Collaborative Learning (CSCL) is concerned with how Information and Communication Technology (ICT) might facilitate learning in groups which can be co-located or distributed over a network of computers such as Internet. CSCL supports effective learning by means of communication of ideas and information among learners, collaborative access of essential documents, and feedback from instructors and peers on learning activities. As the cloud technologies are increasingly becoming popular and collaborative learning is evolving, new directions for development of collaborative learning tools deployed on cloud are proposed. Development of such learning tools requires access to substantial data stored in the cloud. Ensuring efficient access to such data is hindered by the high latencies of wide-area networks underlying the cloud infrastructures. To improve learners’ experience by accelerating data access, important files can be replicated so a group of learners can access data from nearby locations. Since a cloud environment is highly dynamic, resource availability, network latency, and learner requests may change. In this paper, we present the advantages of collaborative learning and focus on the importance of data replication in the design of such a dynamic cloud-based system that a collaborative learning portal uses. To this end, we introduce a highly distributed replication technique that determines optimal data locations to improve access performance by minimizing replication overhead (access and update). The problem is formulated using dynamic programming. Experimental results demonstrate the usefulness of the proposed collaborative learning system used by institutions in geographically distributed locations.     

Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time

We study a two-agent scheduling problem in a two-machine permutation flowshop with learning effects. The objective is to minimize the total completion time of the jobs from one agent, given that the maximum tardiness of the jobs from the other agent cannot exceed a bound. We provide a branch-and-bound algorithm for the problem. In addition, we present several genetic algorithms to obtain near-optimal solutions. Computational results indicate that the algorithms perform well in either solving the problem or efficiently generating near-optimal solutions.