应用形状因子特征的高效星图识别

针对传统的三角形星图识别算法存在冗余匹配多、抗噪声性能差的问题,提出了一种应用形状因子特征的高效星图识别算法。该算法在传统的三角形算法基础上,引入了形状因子特征参数和方向信息,并择优选择视场内4颗观测星,组成一对观测三角形,进行星点匹配识别。与传统的三角形算法相比,该算法增加了星图识别时图像的特征信息量,降低了匹配时的冗余度,具有导航特征库存储空间小、识别速度快等优点。实验表明,在星点位置噪声标准偏差为2个像素、星等噪声标准偏差为0.7星等的仿真条件下,该算法的识别率均在99%以上;通过地面实验的实物验证,在300 MHz的FT-C6713的DSP硬件平台上,全天自主识别的平均运行时间约为47 ms,具有明显的优势。     

Characterizing Topics in Social Media Using Dynamics of Conversation

Online social media provides massive open-ended platforms for users of a wide variety of backgrounds, interests, and beliefs to interact and debate, facilitating countless discussions across a myriad of subjects. With numerous unique voices being lent to the ever-growing information stream, it is essential to consider how the types of conversations that result from a social media post represent the post itself. We hypothesize that the biases and predispositions of users cause them to react to different topics in different ways not necessarily entirely intended by the sender. In this paper, we introduce a set of unique features that capture patterns of discourse, allowing us to empirically explore the relationship between a topic and the conversations it induces. Utilizing “microscopic” trends to describe “macroscopic” phenomena, we set a paradigm for analyzing information dissemination through the user reactions that arise from a topic, eliminating the need to analyze the involved text of the discussions. Using a Reddit dataset, we find that our features not only enable classifiers to accurately distinguish between content genre, but also can identify more subtle semantic differences in content under a single topic as well as isolating outliers whose subject matter is substantially different from the norm.     

一种基于三角形几何结构的星图识别算法

提出了一种新的以星三角形为基本识别单元的几何结构星图识别算法。通过对观测误差的预处理,将该算法星三角形的匹配过程转换为一个没有误差的三角形识别问题。引入一个能部分描述三角形结构的特征量,将导航三角形的识别所需的特征匹配数量降低,而多三角形的组合有效地提高了正确识别率。仿真实验表明,该算法所需导航星库容量小,识别效率高,误识率低,实时性和鲁棒性优于传统的三角形星图识别算法。     

Contract Theory-Based Incentive Mechanism for Full Duplex Cooperative NOMA with SWIPT Communication Networks

Cooperative Non-Orthogonal Multiple Access (NOMA) with Simultaneous Wireless Information and Power Transfer (SWIPT) communication can not only effectively improve the spectrum efficiency and energy efficiency of wireless networks but also extend their coverage. An important design issue is to incentivize a full duplex (FD) relaying center user to participate in the cooperative process and achieve a win–win situation for both the base station (BS) and the center user. Some private information of the center users are hidden from the BS in the network. A contract theory-based incentive mechanism under this asymmetric information scenario is applied to incentivize the center user to join the cooperative communication to maximize the BS’s benefit utility and to guarantee the center user’s expected payoff. In this work, we propose a matching theory-based Gale–Shapley algorithm to obtain the optimal strategy with low computation complexity in the multi-user pairing scenario. Simulation results indicate that the network performance of the proposed FD cooperative NOMA and SWIPT communication is much better than the conventional NOMA communication, and the benefit utility of the BS with the stable match strategy is nearly close to the multi-user pairing scenario with complete channel state information (CSI), while the center users get the satisfied expected payoffs.     

Outlier-aware cooperative spectrum sensing in cognitive radio networks

This paper considers the problem of cooperative spectrum sensing in cognitive radio networks (CRN). Communication in CRNs may be disrupted due to the presence of malicious secondary users (SU) or channel impairments such as shadowing. This paper proposes a spatio-frequency framework that can detect and track malicious users and anomalous measurements in CRNs. The joint problem of spectrum sensing and malicious user identification is posed as an optimization problem that aims to exploit the sparsity inherent to both, spectrum occupancy and malicious user occurrence. Proposed scheme obtains improved performance by utilizing node location information, and can handle missing or inaccurate location information, and noisy SU reports. A distributed block-coordinate descent-based algorithm is proposed that is shown to outperform the state-of-the-art PCA-based approach, and is flexible enough to defeat a variety of attacks encountered in SU networks. An online algorithm, that can handle incorporate multiple SU readings sequentially and adapt to time-varying channels, primary user, and malicious user activity, is also proposed and shown to be consistent. Simulation results demonstrate the efficacy of the proposed algorithms.     

拉曼光谱特征提取在化学纤维定性鉴别中的应用

拉曼光谱作为快速、无损的检测技术受到越来越广泛的关注,已经成功的应用于过程监控、质量监测、考古鉴定等领域。针对纺织纤维拉曼光谱的特性,提出了一种基于特征提取的拉曼光谱定性鉴别方法。该方法通过直接测取织物、纤维的激光拉曼光谱,并结合光谱预处理技术与特征峰提取、匹配识别方法,能够定性地鉴别织物、纤维的成分归属,对纺织品检验中的难点化学纤维成分的鉴别效果尤其显著。利用94份测试样品对织物成分中普遍存在的4种纤维品种——涤纶、腈纶、锦纶和粘胶进行了鉴别以验证算法的有效性。实验结果表明,该鉴别方法快速、有效,并具有很好的扩展性能,且该方法属纯粹的光学方法,需要样品量少、无需前处理,测试过程对样品无损,不产生化学污染物,适宜对各类织物成分的定性鉴别,突破了现有检测方法存在的局限。     

移动计算环境下远程用户体验数据挖掘方法研究

在移动计算环境下,通过对远程用户的体验数据优化挖掘,满足远程用户的个性化需求,提高对远程用户QoS服务质量。传统的数据挖掘方法采用显著特征关联信息提取算法,当远程用户体验数据之间的差异性特征不明显时,挖掘的准确性不好。提出一种基于关联用户自适应链路跟踪补偿的移动计算环境下远程用户体验数据挖掘模型,进行远程用户体验数据挖掘模型的总体设计和数据结构特征分析,对采集的远程用户体验数据进行非线性时间序列分解,对数据序列通过自相关特征匹配和特征压缩实现挖掘数据的指向性信息优化提取,采用关联用户自适应链路跟踪补偿方法实现对数据挖掘误差的控制和补偿,提高了数据挖掘的准确性和有效性。仿真结果表明,采用该挖掘方法进行移动计算环境下远程用户体验数据挖掘的准确度高,实时性较好,满足了移动远程用户的个性化需求,提高了对用户服务的针对性。     

Personalized Sliding Window Recommendation Algorithm Based on Sequence Alignment

With the explosive growth of the amount of information in social networks, the recommendation system, as an application of social networks, has attracted widespread attention in recent years on how to obtain user-interested content in massive data. At present, in the process of algorithm design of the recommending system, most methods ignore structural relationships between users. Therefore, in this paper, we designed a personalized sliding window for different users by combining timing information and network topology information, then extracted the information sequence of each user in the sliding window and obtained the similarity between users through sequence alignment. The algorithm only needs to extract part of the data in the original dataset, and the time series comparison shows that our method is superior to the traditional algorithm in recommendation Accuracy, Popularity, and Diversity.     

Influence Cascades: Entropy-Based Characterization of Behavioral Influence Patterns in Social Media

Influence cascades are typically analyzed using a single metric approach, i.e., all influence is measured using one number. However, social influence is not monolithic; different users exercise different influences in different ways, and influence is correlated with the user and content-specific attributes. One such attribute could be whether the action is an initiation of a new post, a contribution to a post, or a sharing of an existing post. In this paper, we present a novel method for tracking these influence relationships over time, which we call influence cascades, and present a visualization technique to better understand these cascades. We investigate these influence patterns within and across online social media platforms using empirical data and comparing to a scale-free network as a null model. Our results show that characteristics of influence cascades and patterns of influence are, in fact, affected by the platform and the community of the users.     

社交网络用户浏览轨迹信息隐私保护方法仿真

随着网络应用的广泛普及,QQ、微信、YY语音、陌陌等社交软件走进千家万户,但社交网络用户浏览轨迹信息隐私保护问题也随之而来。由于社交网络平台安全机制存在漏洞,抵御网络攻击性能不强,使社交网络用户信息纷纷泄露。针对问题根源,提出ACP用户隐私信息防护系统,建立社交网络用户真空登陆模块(VM)、通讯信息密码文模块(RDT)及信息储存保护墙模块(LDM)一体化ACP用户隐私信息防护系统,从根源保护社交网络用户浏览轨迹信息的隐私安全。通过数据模拟仿真实验证明提出的ACP用户隐私信息防护系统,对社交网络用户浏览轨迹信息隐私保护具有可用性与有效性。     

基于最大熵模型的微博传播网络中的链路预测

微博是基于用户关注关系建立的具有媒体特性的实时信息分享社交平台.微博上的信息扩散具有快速性、爆发性和时效性.理解信息的传播机理,预测信息转发行为,对研究微博上舆论的形成、产品的推广等具有重要意义.本文通过解析微博转发记录来研究影响信息转发的因素或特征,把微博信息转发预测问题抽象为链路预测问题,并提出基于最大熵模型的链路预测算法.实例验证的结果表明:1)基于最大熵模型的算法在运行时间上具有明显的优势;2)在预测结果方面,最大熵模型比同类其他算法表现优异;3)当训练集大小和特征数量变化时,基于最大熵模型的预测结果表现稳定.该方法在预测链路时避免了特征之间相互独立的约束,准确率优于其他同类方法,对解决复杂网络中其他类型的预测问题具有借鉴意义.     

Intelligent radio resource management in reconfigurable IRS-enabled NOMA networks

Intelligent reflecting surfaces (IRSs) are anticipated to provide reconfigurable propagation environment for next generation communication systems. In this paper, we investigate a downlink IRS-aided multi-carrier (MC) non-orthogonal multiple access (NOMA) system, where the IRS is deployed to especially assist the blocked users to establish communication with the base station (BS). To maximize the system sum rate under network quality-of-service (QoS), rate fairness and successive interference cancellation (SIC) constraints, we formulate a problem for joint optimization of IRS elements, sub-channel assignment and power allocation. The formulated problem is mixed non-convex. Therefore, a novel three stage algorithm is proposed for the optimization of IRS elements, sub-channel assignment and power allocation. First, the IRS elements are optimized using the bisection method based iterative algorithm. Then, the sub-channel assignment problem is solved using one-to-one stable matching algorithm. Finally, the power allocation problem is solved under the given sub-channel and optimal number of IRS elements using Lagrangian dual-decomposition method based on Lagrangian multipliers. Moreover, in an effort to demonstrate the low-complexity of the proposed resource allocation scheme, we provide the complexity analysis of the proposed algorithms. The simulated results illustrate the various factors that impact the optimal number of IRS elements and the superiority of the proposed resource allocation approach in terms of network sum rate and user fairness. Furthermore, we analyze the proposed approach against a new performance metric called computational efficiency (CE).     

Total aromatics of diesel fuels analysis by deep learning and near-infrared spectroscopy

Abstract

This article proposes a method for quickly detecting the total aromatics content of diesel fuels based on a deep learning algorithm and near-infrared spectroscopy. First, extract the features of the diesel fuel spectral data and eliminate redundant information through the deep belief nets. Second, use a new extreme learning machine to build a prediction model. The experimental results show that the root-mean-square error of prediction value is 0.715 and the coefficient of determination value is 0.988, which proves that the method has good performance. Compared with other typical prediction methods, this method has better predictive ability.     

User Identity Linkage across Social Networks with the Enhancement of Knowledge Graph and Time Decay Function

Users participate in multiple social networks for different services. User identity linkage aims to predict whether users across different social networks refer to the same person, and it has received significant attention for downstream tasks such as recommendation and user profiling. Recently, researchers proposed measuring the relevance of user-generated content to predict identity linkages of users. However, there are two challenging problems with existing content-based methods: first, barely considering the word similarities of texts is insufficient where the semantical correlations of named entities in the texts are ignored; second, most methods use time discretization technology, where the texts are divided into different time slices, resulting in failure of relevance modeling. To address these issues, we propose a user identity linkage model with the enhancement of a knowledge graph and continuous time decay functions that are designed for mitigating the influence of time discretization. Apart from modeling the correlations of the words, we extract the named entities in the texts and link them into the knowledge graph to capture the correlations of named entities. The semantics of texts are enhanced through the external knowledge of the named entities in the knowledge graph, and the similarity discrimination of the texts is also improved. Furthermore, we propose continuous time decay functions to capture the closeness of the posting time of texts instead of time discretization to avoid the matching error of texts. We conduct experiments on two real public datasets, and the experimental results show that the proposed method outperforms state-of-the-art methods.     

QCF: Quantum Collaborative Filtering Recommendation Algorithm

With the rapid development of the Internet, e-commerce plays an important role in people’s lives, and the recommendation system is one of the most critical technologies. However, as the number of users and the scale of goods increase sharply, the traditional collaborative filtering recommendation algorithm has a large computational complexity in the part of calculating the user similarity, which leads to a low recommendation efficiency. In response to the above problems, this paper introduces the concept of quantum computing theory. The user score vector is first prepared into a quantum state, the similarity score is calculated in parallel, then the similarity information is saved into the quantum bit, and finally the similar user is searched by the Grover search algorithm. Compared with the traditional collaborative filtering recommendation algorithm, the time complexity of the collaborative filtering recommendation algorithm based on Grover algorithm can be effectively reduced under certain conditions.

     

基于多光谱图像融合的掌纹识别方法

生物特征识别在信息安全领域发挥着重要作用,掌纹识别作为一种新型生物特征识别方式,具有低失真、非侵入性和高唯一性等优势。传统掌纹研究大多使用自然光成像系统以灰度格式获取,识别精度很难进一步提升。为了获得更多的身份鉴别信息,提出利用多光谱掌纹图像代替自然光掌纹图像。针对现有掌纹识别算法由于没有考虑到不同光谱的特性而导致纹理细节丢失,识别精准率低的问题,提出了一种基于多光谱图像融合的掌纹识别算法。该方法通过对不同光谱下的掌纹图像进行快速自适应二维经验模式分解（FABEMD）,将多光谱掌纹图像分解成一系列频率由高到低的二维固有模态函数(BIMF)和一个残余分量,残余分量可被视为该光谱图像低频信息的初步估计。图像采集过程中光照条件很难保持稳定,而近红外光谱图像在进行FABEMD分解时对光照变换敏感,容易导致分解后的BIMF背景信息过于冗余;因此对分解后的近红外掌纹图像进行背景重建及特征细化,在对背景冗余信息进行平滑处理的同时可以有效增强高频信息的特征表达。为避免直接融合处理后引发的图像过度曝光问题,提出对近红外特征压缩后再融合。此外,提出了一种结合了注意力机制的改进残差网络（IRCANet）,用于融合后的掌纹图像分类,在网络中引入分阶段残差结构,缓解了网络的退化问题,在学习过程中有效地减少信息丢失,对于融合后的多光谱掌纹图像,分阶段残差结构能够稳定地将图像信息在网络间传输,但对图像中的高低频信息区分效果不够显著,为了使网络关注更多区分性特征,利用特征通道间的相互依赖性,在分阶段残差结构中结合了通道注意力(Channel Attention)机制。最终,在香港理工大学（PolyU）多光谱掌纹数据集上进行的综合实验表明,该方法可以取得良好的效果,算法识别准确率能达到99.67%且具有良好的实时性。     

Asynchronous code-division random access using convex optimization

Many applications in cellular systems and sensor networks involve a random subset of a large number of users asynchronously reporting activity to a base station. This paper examines the problem of multiuser detection (MUD) in random access channels for such applications. Traditional orthogonal signaling ignores the random nature of user activity in this problem and limits the total number of users to be on the order of the number of signal space dimensions. Contention-based schemes, on the other hand, suffer from delays caused by colliding transmissions and the hidden node problem. In contrast, this paper presents a novel pairing of an asynchronous non-orthogonal code-division random access scheme with a convex optimization-based MUD algorithm that overcomes the issues associated with orthogonal signaling and contention-based methods. Two key distinguishing features of the proposed MUD algorithm are that it does not require knowledge of the delay or channel state information of every user and it has polynomial-time computational complexity. The main analytical contribution of this paper is the relationship between the performance of the proposed MUD algorithm in the presence of arbitrary or random delays and two simple metrics of the set of user codewords. The study of these metrics is then focused on two specific sets of codewords, random binary codewords and specially constructed algebraic codewords, for asynchronous random access. The ensuing analysis confirms that the proposed scheme together with either of these two codeword sets significantly outperforms the orthogonal signaling-based random access in terms of the total number of users in the system.     

Role-Aware Information Spread in Online Social Networks

Understanding the complex process of information spread in online social networks (OSNs) enables the efficient maximization/minimization of the spread of useful/harmful information. Users assume various roles based on their behaviors while engaging with information in these OSNs. Recent reviews on information spread in OSNs have focused on algorithms and challenges for modeling the local node-to-node cascading paths of viral information. However, they neglected to analyze non-viral information with low reach size that can also spread globally beyond OSN edges (links) via non-neighbors through, for example, pushed information via content recommendation algorithms. Previous reviews have also not fully considered user roles in the spread of information. To address these gaps, we: (i) provide a comprehensive survey of the latest studies on role-aware information spread in OSNs, also addressing the different temporal spreading patterns of viral and non-viral information; (ii) survey modeling approaches that consider structural, non-structural, and hybrid features, and provide a taxonomy of these approaches; (iii) review software platforms for the analysis and visualization of role-aware information spread in OSNs; and (iv) describe how information spread models enable useful applications in OSNs such as detecting influential users. We conclude by highlighting future research directions for studying information spread in OSNs, accounting for dynamic user roles.     

静音掩蔽和频域分段的音频指纹检索算法

为解决背景音及噪音等条件下音频检索识别率低的问题,提出静音掩蔽和频域分段的音频指纹检索算法。首先采用端点检测技术进行语音预处理,将有效语音帧重新组合并利用相邻子带能量差对其提取指纹特征,可有效解决静音帧指纹特征不鲁棒的问题。然后在检索匹配时根据不同音频信号在频域范围内的分布特点,对音频指纹在不同频率区间进行分段和加权,以更精确地计算模板和待检音频之间的相似度。实验表明,与Philips基线算法相比,所提算法在检索速度上提升了一倍,在受背景音等干扰的数据集上,平均准确率与召回率分别绝对提升17.94%和4.66%;与最新Philips算法相比,平均准确率与召回率分别绝对提升13.68%和2.45%。