Rapprochement of artificial intelligence and dynamics

It is proposed that continuous time is in effect discretized in the brain by dynamic pattern recognition mechanisms in neurons. Time discretization is required to support formal computations in continuous time systems consisting of a large number of components. The ability to perform formal computations is necessary if the system is to execute high level algorithms of the type used in present day artificial intelligence. The weakness of such algorithms is that they work efficiently only when the forms of patterns and objects presented to them are highly constrained. The dynamic mechanisms which discretize the brain's time line also serve to code patterns into constrained forms suitable for high level processing.     

分类问题的在线顺序双并联快速学习机

双并联前馈神经网络模型是单层感知机和单隐层前馈神经网络的混合结构,本文构造了一种双并联快速学习机算法,与其他类似算法比较,提出的算法能利用较少的隐层单元及更少的待定参数,获得近似的学习性能.数值实验表明,对很多实际分类问题,提出的算法具备更佳的泛化能力,因而可以作为快速学习机算法的有益补充.     

TLP-CCC: Temporal Link Prediction Based on Collective Community and Centrality Feature Fusion

In the domain of network science, the future link between nodes is a significant problem in social network analysis. Recently, temporal network link prediction has attracted many researchers due to its valuable real-world applications. However, the methods based on network structure similarity are generally limited to static networks, and the methods based on deep neural networks often have high computational costs. This paper fully mines the network structure information and time-domain attenuation information, and proposes a novel temporal link prediction method. Firstly, the network collective influence (CI) method is used to calculate the weights of nodes and edges. Then, the graph is divided into several community subgraphs by removing the weak link. Moreover, the biased random walk method is proposed, and the embedded representation vector is obtained by the modified Skip-gram model. Finally, this paper proposes a novel temporal link prediction method named TLP-CCC, which integrates collective influence, the community walk features, and the centrality features. Experimental results on nine real dynamic network data sets show that the proposed method performs better for area under curve (AUC) evaluation compared with the classical link prediction methods.     

Ensemble Approach for Detection of Depression Using EEG Features

Depression is a public health issue that severely affects one’s well being and can cause negative social and economic effects to society. To raise awareness of these problems, this research aims at determining whether the long-lasting effects of depression can be determined from electroencephalographic (EEG) signals. The article contains an accuracy comparison for SVM, LDA, NB, kNN, and D3 binary classifiers, which were trained using linear (relative band power, alpha power variability, spectral asymmetry index) and nonlinear (Higuchi fractal dimension, Lempel–Ziv complexity, detrended fluctuation analysis) EEG features. The age- and gender-matched dataset consisted of 10 healthy subjects and 10 subjects diagnosed with depression at some point in their lifetime. Most of the proposed feature selection and classifier combinations achieved accuracy in the range of 80% to 95%, and all the models were evaluated using a 10-fold cross-validation. The results showed that the motioned EEG features used in classifying ongoing depression also work for classifying the long-lasting effects of depression.     

基于稀疏表示和特征加权的离格双耳声源定位*

基于头相关传递函数数据库的传统双耳声源定位方法的定位角度往往被限定在头相关传递函数数据库的离散测量点上。当头相关传递函数数据库的测量方位角间隔较大时,这类算法的性能会显著下降,这就是典型的离格问题。该文提出了基于加权宽带稀疏贝叶斯学习的离格双耳声源定位算法。首先该算法建立离格双耳信号的稀疏表示模型,然后利用双耳相干与扩散能量比特征对各个频点进行加权以降低噪声和混响的影响,最后通过加权宽带稀疏贝叶斯学习方法估计离格声源的方位角。实验结果表明,该算法在各种复杂的声学环境下都有着较高的定位精度和鲁棒性,特别是提高了离格条件下的声源定位性能。     

基于无信息变量消除法与岭极限学习机的新型变量选择方法：以CO气体浓度反演为例

变量选择是光谱分析领域一个重要的组成部分。为了克服传统区间选择法的缺点与不足,基于无信息变量消除法和岭极限学习机提出一种新型的变量选择与评价方法。首先,利用无信息变量消除法剔除整个光谱区间中无信息的波长点;其次,为了解决传统建模方法(偏最小二乘法、BP神经网络等)存在的共线性问题,采用岭极限学习机方法建立回归模型;最后,最佳的特征光谱波长点组合利用特征选择路径图和稀疏度-误差折中曲线进行确定。CO气体的浓度反演实验结果表明：(1)利用无信息变量消除法可以有效筛选出最能表征CO气体透过光谱的特征波长点;(2)岭极限学习机方法具有快速建模、避免共线性和高精度等优点(CO气体浓度反演模型的决定系数可达0.995);(3)特征选择路径图和稀疏度-误差折中曲线可以直观地帮助用户寻找出最佳的特征波长点组合。     

焊缝超声相控阵检测数据深度学习降噪方法

超声相控阵检测技术在焊缝检测中具有广泛的应用.超声相控阵检测技术检测信号中常混入噪声导致检测成像时难以分辨真实的缺陷特征.这些噪声主要为无关的反射信号和局部相关的结构噪声,传统的超声图像降噪方法难以有效滤除这些噪声,且存在计算效率低、参数优化复杂等问题.该文提出了一种基于深度学习的焊缝超声相控阵检测技术检测S扫图像的降...     

基于热图像的种蛋气室变化监测算法

种蛋气室的大小是监测种蛋孵化过程的重要指标之一。根据种蛋的热力学结构,种蛋在孵化过程中,包裹气室部分蛋壳会与其他部分蛋壳产生温差,从而可通过热红外图像进行观察。针对在种蛋孵化过程中,人工照蛋检测气室效率低的问题,探索设计了一种基于热图像的种蛋气室变化俯视监测算法。监测种蛋气室热图像的算法主要包括种蛋目标检测,种蛋图像分割和种蛋气室面积计算3个部分,其中种蛋的目标检测采用Faster-RCNN算法实现;种蛋图像分割采用BP神经网络算法实现;种蛋气室面积是在种蛋图像分割的基础上进行计算。使用孵化5天及以上的种蛋作为研究对象,并拍取种蛋的热图像进行试验。试验结果表明：种蛋热图像的目标检测的平均精度（mAP）为99.85%,拥有较好的检测效果。使用BP网络对种蛋进行图像分割。BP神经网络经过调参后,其网络最佳的结构为三层隐藏层,每个隐藏层拥有1 000个神经元,最优初始学习率为0.000 1,最优最大迭代次数为500。以F1-measure作为分割效果的评价指标,BP神经网络的图像分割总体结果为87.02%,Otsu算法的总体结果为65.25%。其中只有一个蛋的情况下,BP神经网络的分割结果为87.17%,Otsu算法的结果为68.86%。存在其他种蛋的干扰条件下,BP神经网络的分割结果为86.94%,Otsu算法的结果为61.64%,BP神经网络的分割效果优于Otsu分割算法,BP神经网络拥有更强的抗干扰能力。最后提取了孵化5～19 d种蛋的气室变化,通过观察种蛋气室大小曲线来监测种蛋的孵化情况,可看出随着天数的增加,气室有着明显变大的趋势。人工测量法与热红外测量法比较结果说明两者相关性为0.934 3,拥有较好的相关性。基于热图像的种蛋气室变化监测算法可在实际生产中实现种蛋的识别与气室大小的快速监测,为实现监测种蛋孵化的自动化提供了技术参考。     

Machine learning-based direct solver for one-to-many problems on temporal shaping of relativistic electron beams

To control the temporal profile of a relativistic electron beam to meet requirements of various advanced scientific applications like free-electron-laser and plasma wakefield acceleration, a widely-used technique is to manipulate the dispersion terms which turns out to be one-to-many problems. Due to their intrinsic one-to-many property, current popular stochastic optimization approaches on temporal shaping may face the problems of long computing time or sometimes suggesting only one solution. Here we propose a real-time solver for one-to-many problems of temporal shaping, with the aid of a semi-supervised machine learning method, the conditional generative adversarial network (CGAN). We demonstrate that the CGAN solver can learn the one-to-many dynamics and is able to accurately and quickly predict the required dispersion terms for different custom temporal profiles. This machine learning-based solver is expected to have the potential for wide applications to one-to-many problems in other scientific fields.     

Quantum algorithm for neighborhood preserving embedding

Neighborhood preserving embedding (NPE) is an important linear dimensionality reduction technique that aims at preserving the local manifold structure. NPE contains three steps, i.e., finding the nearest neighbors of each data point, constructing the weight matrix, and obtaining the transformation matrix. Liang et al. proposed a variational quantum algorithm (VQA) for NPE [Phys. Rev. A 101 032323 (2020)]. The algorithm consists of three quantum sub-algorithms, corresponding to the three steps of NPE, and was expected to have an exponential speedup on the dimensionality n. However, the algorithm has two disadvantages: (i) It is not known how to efficiently obtain the input of the third sub-algorithm from the output of the second one. (ii) Its complexity cannot be rigorously analyzed because the third sub-algorithm in it is a VQA. In this paper, we propose a complete quantum algorithm for NPE, in which we redesign the three sub-algorithms and give a rigorous complexity analysis. It is shown that our algorithm can achieve a polynomial speedup on the number of data points m and an exponential speedup on the dimensionality n under certain conditions over the classical NPE algorithm, and achieve a significant speedup compared to Liang et al.'s algorithm even without considering the complexity of the VQA.