《无机及分析化学》在多媒体教学的应用及思考

对多媒体技术在无机及分析化学教学的应用进行了，阐述和分析，指出使用多媒体教学应注意的问题。     

Adaptive prescribed time control for quadrotor formation with stochastic links failure

The formation control for multiple quadrotors subject to maintaining the formation configuration and collision avoidance in the situation of stochastic links failure is investigated in this paper. First, the distributed formation controller is designed, the position controller is developed to manage the desired formation of position, and the attitude controller is developed to control the translation and rotation movements of the quadrotor. Then, in order to avoid the collisions between multiple quadrotors and the obstacles, a potential energy function method is introduced into the quadrotor formation control combined with the nest adaptive control. Inspired by the design of event trigger controller, a communication compensation controller is designed to ensure the stability of quadrotor formation under the condition of random communication interruption and recovery. Moreover, a prescribed time function is designed, which means the convergence time of the formation system can be set in advance. The prescribed time stability of the formation control system is proved by Lyapunov theory. Finally, the simulation results verify the effectiveness and superiority of this method.     

滚筒反力式制动检验台制动力测量不确定度评定

本文介绍了滚筒反力式制动检验台制动力的不确定度评定。     

A review on mechanisms and recent developments of nanomaterials based carbon fiber reinforced composites for enhanced interface performance

Carbon fiber reinforced composites have attracted lots of attention in many fields. However, on account of the poor infiltration of resin to carbon fiber, the weak interface performance between fiber and resin has been restricting the interface properties of composites. In recent progress, the review attaches more importance to the introduction of the third phase monomer, which mainly uses physical and chemical methods to assemble nanomaterials (such as carbon nanotubes, graphene, etc.) on the carbon fiber surface to modify the interface structure of the carbon fiber reinforced composites, and all of them have been demonstrated in this paper. Furthermore, the effects of introducing nanomaterials on the structure of the fiber/resin interface and the relationship between multi-scale interface structure and properties have been investigated. It can be seen that the design idea of researchers mainly uses one or more theories to improve the interface properties of carbon fiber reinforced composites, such as transition layer, chemical bonding, mechanical interlocking, infiltration, diffusion, and adsorption. In brief, this work provides some novel insights for the preparation of carbon fiber reinforced composites with excellent interlaminar shear strength.     

基于P2P的语义Web服务发现机制

分析集中式语义Web服务发现机制存在的问题,利用P2P和本体技术,提出一种基于P2P的语义Web服务发现机制。将服务的部署与发布无缝地绑定在一起,按应用领域和服务目标将整个P2P网络组织成3层结构,基于该结构建立3阶段服务发现算法,达到优化网络结构、提高服务发现效率的目的。     

Continuous-variable quantum homomorphic signature

Quantum cryptography is believed to be unconditionally secure because its security is ensured by physical laws rather than computational complexity. According to spectrum characteristic, quantum information can be classified into two categories, namely discrete variables and continuous variables. Continuous-variable quantum protocols have gained much attention for their ability to transmit more information with lower cost. To verify the identities of different data sources in a quantum network, we propose a continuous-variable quantum homomorphic signature scheme. It is based on continuous-variable entanglement swapping and provides additive and subtractive homomorphism. Security analysis shows the proposed scheme is secure against replay, forgery and repudiation. Even under nonideal conditions, it supports effective verification within a certain verification threshold.     

人群运动中的视觉显著性研究

在公共场所中人们都倾向于以分组的形式进行运动,本文把这种以分组形式运动的若干个行人称为运动群组,具有视觉显著性的人群运动群组是场景理解的重点,其对人群的整体运动也影响最大。本文对运动群组的视觉显著性展开了研究,分别从规模、速度、组内紧致度和变化度４个方面来对运动群组的视觉显著性进行度量,并基于该度量给出了视觉显著性运动群组检测方法。首先,利用光流法对运动人群进行分析得到光流向量;然后通过层次聚类算法对运动人群进行分组;最后,基于本文所给出的度量计算每个群组的视觉显著性,以检测出视觉显著性最高的运动群组。实验表明该方法能够有效地对视觉显 著性运动群组进行检测,该研究成果可应用于人群场景理解、人群运动分析和人群场景分类等计算机视觉研究领域。     

A private versus a public space: Anonymity and buying decorative symbolic goods for avatars in a virtual world

The virtual world has become a new channel in which people can contact with others, and organizations can provide service to their customers. Selling symbolic virtual goods has also emerged as a new economy in the virtual world. Such symbolic goods cannot facilitate people to accomplish any specific tasks; people buy them simply to decorate their avatars. This study is based on the theories of symbolic consumption, self-presentation, and computer-mediated environment, to investigate why people buy decorative symbolic goods in the virtual world. The results show that people buy symbolic virtual goods for both emotional and social values. While user perceived social presence and telepresence affect both social and emotional value of symbolic goods, individual self-presentation motivation affects only social value. Besides, anonymous users in the virtual world show behaviors that differ with non-anonymous ones.     

Shift-full-rank matrices and applications in space-time trellis codes for relay networks with asynchronous cooperative diversity

To achieve full cooperative diversity in a relay network, most of the existing space-time coding schemes require the synchronization between terminals. A family of space-time trellis codes that achieve full cooperative diversity order without the assumption of synchronization has been recently proposed. The family is based on the stack construction by Hammons and El Gamal and its generalizations by Lu and Kumar. It has been shown that the construction of such a family is equivalent to the construction of binary matrices that have full row rank no matter how their rows are shifted, where a row corresponds to a terminal (or transmit antenna) and its length corresponds to the memory size of the trellis code on that terminal. We call such matrices as shift-full-rank (SFR) matrices. A family of SFR matrices has been also constructed, but the memory sizes of the corresponding space-time trellis codes (the number of columns of SFR matrices) grow exponentially in terms of the number of terminals (the number of rows of SFR matrices), which may cause a high decoding complexity when the number of terminals is not small. In this paper, we systematically study and construct SFR matrices of any sizes for any number of terminals. Furthermore, we construct shortest (square) SFR (SSFR) matrices that correspond to space-time trellis codes with the smallest memory sizes and asynchronous full cooperative diversity. We also present some simulation results to illustrate the performances of the space-time trellis codes associated with SFR matrices in asynchronous cooperative communications.