聚集诱导发光分子在双光束超分辨光存储中的潜在应用

聚集诱导发光分子因其高效的发光性质而被广泛应用于生物成像、光波导和电致发光等领域,但在光信息存储领域还鲜有研究。与其他光存储材料相比,聚集诱导发光分子的局域密度变化会引发荧光强度的变化,这在光存储领域是一个显著优点。该文针对聚集诱导发光分子的特性,讨论了该类分子在超分辨光存储领域的可能应用方式,以及需要解决的关键问题。     

基于MADDPG和智能合约的微电网交易决策优化

为解决微电网在传统集中化交易模式下面临的决策耗时长、信任成本高和隐私安全等问题,提出了基于多智能体深度确定性策略梯度(multi-agent deep deterministic policy gradient, MADDPG)算法与智能合约的微电网去中心化市场交易体系。首先,对微电网市场中多智能体进行划分后设计了适用于各主体参与分布式交易的微电网去中心化交易机制,以保障市场主体利益。其次,为实现交易确认阶段微电网市场主体的交易策略优化,采用MADDPG算法对各主体追求利益最大的竞价模型进行求解。最后,通过算例仿真验证了MADDPG算法在智能合约下微电网市场主体交易策略优化过程中的可行性和经济性。     

基于5G-R系统的高铁站台场景信道特性

为推进智能铁路总体建设,实现高速铁路智能化,高铁信息基础设施将应用第五代移动通信技术(5G)建设铁路5G专用移动通信系统,2.1 GHz有望成为铁路5G专用移动通信系统的承载频段。高铁站台作为客货乘降与调度中转的功能核心,其在2.1 GHz下的电波传播特性亟待研究。本文以厦门北站高铁站台为研究场景,利用射线跟踪(RT)技术仿真2.1 GHz频段下的电波传播,基于仿真结果分析此场景无线信道特性,包括均方根时延扩展(RMS DS)、到达/离开方位角扩展、到达/离开俯仰角扩展(ASA/ASD, ESA/ESD)、交叉极化比(XPR)和以上参数的互相关。根据以上结果,对高铁站台场景中铁路5G专用移动通信系统的设计和评估提出相关建议。     

基于点云配准的多固态激光雷达标定算法

针对多个固态激光雷达协同工作时,需要准确地进行外参标定的实际需求,提出一种基于点云配准的多固态激光雷达自动标定算法。该标定算法由标定物分割、初始配准和精确配准三个阶段构成。在标定物分割阶段,首先通过叠加多帧非重复扫描数据制作标定点云,再使用半径滤波和体素下采样滤波分割出纹理特征明显的目标点云。在初始配准阶段,使用3D-HARRIS算法提取关键点,并使用方向直方图(SHOT)特征描述子进行特征描述,然后匹配对应点并使用采样一致算法完成初始配准;在精配准阶段使用迭代最近邻(ICP)算法进行精确配准,从而获得精确的外参标定效果。在Bunny兔数据集和现场获得的数据上进行实验,结果表明,当保证配准平均误差小于1 mm的前提下,所提出算法的性能优于多种现有算法。     

Dynamic material properties of wood subjected to low-velocity impact

This article studied the effects of low-velocity impact on the failure stresses and stiffness using a pendulum test. The specimens were of variable depth (20, 30, and 40 mm), a width of 50 mm, length of 650 mm, and span-length of 480 mm. The smallest specimen depth was similar to specimen sizes tested in the literature used to create the duration of load curve, while the largest specimen depth are considered structural size specimens. The impact was predicted using a numerical approach with Euler–Bernoulli beam, as well as Timoshenko beam theory, with a plastic contact law. The models were validated for impact from a low release-angle (where the beam remained elastic), but could use improvement for the force prediction at a high incidence velocity. The measured force signals were used as forcing functions to obtain the dynamic failure stresses for all of the evaluated specimens, and the Timoshenko–Goens–Hearmon Method to derive the dynamic E. The resulting strain rates ranged from 9.11?×?10^?5 s^?1 for the quasi-static specimens up to 25 s^?1 for the greatest incidence velocity. The results from this study suggest different duration of load factors than the Madison Curve, influencing the design of structures subjected to dynamic loading.     

A conjugate bayesian approach for calculating process capability indices

Process capability indices measure the ability of a production process to produce items within specification limits. The calculation of process capability indices has been focusing on using traditional frequency approach, which requires a large sample size for an accurate estimation. In order to eliminate this defect of traditional frequency approach on multi-batch and low volume production, Bayesian approach was used. The conjugate Bayesian approach is chosen to estimate the process distribution parameters. The algorithm with these conjugate Bayes estimators is proposed for measuring the process capability for multi-batch and low volume production. A case study is presented to demonstrate how the approach can be applied to actual data collected in practice.     

Efficient and short certificateless signatures secure against realistic adversaries

The notion of certificateless cryptography is aimed to eliminate the use of certificates in traditional public key cryptography and also to solve the key-escrow problem in identity-based cryptography. Many kinds of security models have been designed for certificateless cryptography and many new schemes have been introduced based on the correspondence of the security models. In generally speaking, a stronger security model can ensure a certificateless cryptosystem with a higher security level, but a realistic model can lead to a more efficient scheme. In this paper, we focus on the efficiency of a certificateless signature (CLS) scheme and introduce an efficient CLS scheme with short signature size. On one hand, the security of the scheme is based on a realistic model. In this model, an adversary is not allowed to get any valid signature under false public keys. On the other hand, our scheme is as efficient as BLS short signature scheme in both communication and computation and, therefore, turns out to be more efficient than other CLS schemes proposed so far. We provide a rigorous security proof of our scheme in the random oracle model. The security of our scheme is based on the k-CAA hard problem and a new discovered hard problem, namely the modified k-CAA problem. Our scheme can be applied to systems where signatures are typed in by human or systems with low-bandwidth channels and/or low-computation power.