检索结果-内蒙古大学图书馆

Automatic ocular artifact removal from EEG data using a hybrid CAE-RLS approach

The Journal of China Universities of Posts and Telecommunications 2020年第1期27卷 81-91页

作者： Wang Zhongmin Tian Meng Liang Chen Song Hui School of Computer Science and Technology Xi'an University of Posts and TelecommunicationsXi'an 710121China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and TelecommunicationsXi'an 710121China

Traditional methods for removing ocular artifacts(OAs) from electroencephalography(EEG) signals often involve a large number of EEG electrodes or require electrooculogram(EOG) as the reference, these constraints make subjects uncomfortable during the acquisition process and increase the complexity of brain-computer interfaces(BCI). To address these limitations, a method combining a convolutional autoencoder(CAE) and a recursive least squares(RLS) adaptive filter is proposed. The proposed method consists of offline and online stages. In the offline stage, the peak and local mean of the four-channel EOG signals are automatically extracted to obtain the CAE model. Once the model is trained, the EOG channels are no longer needed. In the online stage, by using the CAE model to identify the OAs from a single-channel raw EEG signal, the identified OAs and the given raw EEG signal are used as the reference and input for an RLS adaptive filter. Experiments show that the root mean square error(RMSE) of the CAE-RLS algorithm and independent component analysis(ICA) are 1.253 3 and 1.254 6 respectively, and the power spectral density(PSD) curve for the CAE-RLS is similar to the original EEG signal. These experimental results indicate that by using only a couple of EEG channels, the proposed method can effectively remove OAs without parallel EOG records and accurately reconstruct the EEG signal. In addition, the processing time of the CAE-RLS is shorter than that of ICA, so the CAE-RLS algorithm is very suitable for BCI system.

关键词： electroencephalography(EEG) electrooculogram(EOG) ocular artifacts(OAs) recursive least squares(RLS) convolutional autoencoder(CAE)

来源：评论

学校读者我要写书评

暂无评论

Optimal Power Allocation with Limited Feedback of Channel State Information in Multi-User MIMO Systems

引用

China Communications 2020年第2期17卷 163-175页

作者： Kusi Ankrah Bonsu Weiwei Zhou Su Pan Yan Yan Key Lab Broadband Wireless Communication and Sensor Network Technology Ministry of EducationNanjing University of Posts and Telecommunications Nanjing 210003China Global Big Data Technologies Centre(GBDTC) University of Technology SydneySydney 2007Australia

In this paper,an expression for the user’s achievable data rate in the multi-user multiple-input multiple-output(MU-MIMO)system with limited feedback(LF)of channel state information(CSI)is *** energy efficiency(EE)is optimized through power allocation under quality of service(QoS)*** on mathematical equivalence and Lagrange multiplier approach,an energy-efficient unequal power allocation(EEUPA)with LF of CSI scheme is *** simulation results show that as the number of transmitting antennas increases,the EE also increases which is promising for the next generation wireless communication ***,it can be seen that the QoS requirement has an effect on the EE of the ***,the proposed EEUPA with LF of CSI algorithm performs better than the existing energy-efficient equal power allocation(EEEPA)with LF of CSI schemes.

关键词： energy efficiency unequal power allocation limited feedback MU-MIMO QoSguarantee and precoding

来源：评论

学校读者我要写书评

暂无评论

Efficient image representation for object recognition via pivots selection

引用

Frontiers of Computer science 2015年第3期9卷 383-391页

作者： Bojun XIE Yi LIU HuiZHANG Jian YU Beijing Key Lab of Traffic Data Analysis and Mining School of Computer and Information Technology Beijing Jiaotong University Beijing 100044 China Key Lab of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding 071000 China

Patch-level features are essential for achieving good performance in computer vision tasks. Besides well- known pre-defined patch-level descriptors such as scalein- variant feature transform （SIFT） and histogram of oriented gradient （HOG）, the kernel descriptor （KD） method [1] of- fers a new way to ＂grow-up＂ features from a match-kernel defined over image patch pairs using kernel principal compo- nent analysis （KPCA） and yields impressive results. In this paper, we present efficient kernel descriptor （EKD） and efficient hierarchical kernel descriptor （EHKD）, which are built upon incomplete Cholesky decomposition. EKD au- tomatically selects a small number of pivot features for gener- ating patch-level features to achieve better computational effi- ciency. EHKD recursively applies EKD to form image-level features layer-by-layer. Perhaps due to parsimony, we find surprisingly that the EKD and EHKD approaches achieved competitive results on several public datasets compared with other state-of-the-art methods, at an improved efficiency over KD.

关键词： efficient kernel descriptor efficient hierarchi-cal kernel descriptor incomplete Cholesky decomposition,patch-level features image-level features

来源：评论

学校读者我要写书评

暂无评论

Flexible user-centric service selection algorithm for Internet of Things services

引用

Journal of China Universities of Posts and Telecommunications 2014年第SUPPL. 1期21卷 64-70页

作者： Nwe, Nwe Htay Win Bao, Jian-Min Cui, Gang School of Computer Science and Technology Harbin Institute of Technology Harbin 15001 China Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing 210003 China

In Internet of Things (IoT), the similar functional services are evolving in different quality of services (QoS) due to the widespread deployment of spatially distributed things on dynamic networks through the web. Therefore, the user involvement in service selection systems becomes a vital role to enhance the system performance by taking into account of subjective factors. This paper proposes a flexible QoS-based service selection algorithm (FQSA) which mainly targets to the users to be able to give their subjective preferences in an easy and friendly manner. The FQSA algorithm selects the services based on subjective information provided by the service consumers and objective information supported by the service providers. It adopts artificial neural network backpropagation algorithm to find the objective factors and applies similarity aggregation method to evaluate the creditability of the user subjective factors which have already been evaluated by ontological reasoning with the help of proposed QoS ontology. The comparative study and experimental results show that our FQSA algorithm is superior to other service selection approaches. © 2014 The Journal of China Universities of Posts and Telecommunications.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Context-adaptive matrix factorization for multi-context recommendation 15

Context-adaptive matrix factorization for multi-context reco...

引用

24th ACM International Conference on Information and Knowledge Management, CIKM 2015

作者： Man, Tong Shen, Huawei Huang, Junming Cheng, Xueqi CAS Key Lab. of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China CompleX Lab. Web Sciences Center University of Electronic Science and Technology of China Chengdu611731 China

ISBN: (纸本)9781450337946

data sparsity is a long-standing challenge for recommender systems based on collaborative filtering. A promising solution for this problem is multi-context recommendation, i.e., leveraging users' explicit or implicit feedback from multiple contexts. In multi-context recommendation, various types of interactions between entities (users and items) are combined to alleviate data sparsity of a single context in a collective manner. Two issues are crucial for multi-context recommendation: (1) How to differentiate context-specific factors from entity-intrinsic factors shared across contexts? (2) How to capture the salient phenomenon that some entities are insensitive to contexts while others are remarkably context-dependent? Previous methods either do not consider context-specific factors, or assume that a context imposes equal influence on different entities, limiting their capability of combating data sparsity problem by taking full advantage of multiple contexts. In this paper, we propose a context-adaptive matrix factorization method for multi-context recommendation by simultaneously modeling context-specific factors and entity-intrinsic factors in a unified model. We learn an entity-intrinsic latent factor for every entity, and a context-specific latent factor for every entity in each context. Meanwhile, using a context-entity mixture parameter matrix we explicitly model the extent to which each context imposes influence on each entity. Experiments on two real scenarios demonstrate that our method consistently outperforms previous multi-context recommendation methods on all different sparsity levels. Such a consistent performance promotion forms the unique superiority of our method, enabling it to be a reliable model for multi-context recommendation. © 2015 ACM.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Edge Computing Task Scheduling with Joint Blockchain and Task Caching in Industrial Internet

引用

Computers, Materials & Continua 2023年第4期75卷 2101-2117页

作者： Yanping Chen Xuyang Bai Xiaomin Jin Zhongmin Wang Fengwei Wang Li Ling School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’an710121China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anShaanxi710121China ZTE Corporation Shenzhen51805China

Deploying task caching at edge servers has become an effectiveway to handle compute-intensive and latency-sensitive tasks on the industrialinternet. However, how to select the task scheduling location to reduce taskdelay and cost while ensuring the data security and reliable communicationof edge computing remains a challenge. To solve this problem, this paperestablishes a task scheduling model with joint blockchain and task cachingin the industrial internet and designs a novel blockchain-assisted cachingmechanism to enhance system security. In this paper, the task schedulingproblem, which couples the task scheduling decision, task caching decision,and blockchain reward, is formulated as the minimum weighted cost problemunder delay constraints. This is a mixed integer nonlinear problem, which isproved to be nonconvex and NP-hard. To solve the optimal solution, thispaper proposes a task scheduling strategy algorithm based on an improvedgenetic algorithm (IGA-TSPA) by improving the genetic algorithm initializationand mutation operations to reduce the size of the initial solutionspace and enhance the optimal solution convergence speed. In addition,an Improved Least Frequently Used algorithm is proposed to improve thecontent hit rate. Simulation results show that IGA-TSPA has a faster optimalsolution-solving ability and shorter running time compared with the existingedge computing scheduling algorithms. The established task scheduling modelnot only saves 62.19% of system overhead consumption in comparison withlocal computing but also has great significance in protecting data security,reducing task processing delay, and reducing system cost.

关键词： Edge computing task scheduling blockchain task caching industrial security

来源：评论

学校读者我要写书评

暂无评论

Identity-Preserving Adversarial Training for Robust network Embedding

引用

Journal of Computer science & technology 2024年第1期39卷 177-191页

作者：岑科廷沈华伟曹婍徐冰冰程学旗 Data Intelligence System Research Center Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 101480China Beijing Academy of Artificial Intelligence Beijing 100000China Chinese Academy of Sciences Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China

network embedding,as an approach to learning low-dimensional representations of nodes,has been proved extremely useful in many applications,e.g.,node classification and link ***,existing network embed-ding models are vulnerable to random or adversarial perturbations,which may degrade the performance of network em-bedding when being applied to downstream *** achieve robust network embedding,researchers introduce adversari-al training to regularize the embedding learning process by training on a mixture of adversarial examples and original ***,existing methods generate adversarial examples heuristically,failing to guarantee the imperceptibility of generated adversarial examples,and thus limit the power of adversarial *** this paper,we propose a novel method Identity-Preserving Adversarial Training(IPAT)for network embedding,which generates imperceptible adversarial exam-ples with explicit identity-preserving *** formalize such identity-preserving regularization as a multi-class classification problem where each node represents a class,and we encourage each adversarial example to be discriminated as the class of its original *** experimental results on real-world datasets demonstrate that our proposed IPAT method significantly improves the robustness of network embedding models and the generalization of the learned node representations on various downstream tasks.

关键词： network embedding identity-preserving adversarial training adversarial the example

来源：评论

学校读者我要写书评

暂无评论

FortisAVQA and MAVEN: a Benchmark dataset and Debiasing Framework for Robust Multimodal Reasoning

arXiv

引用

arXiv 2025年

作者： Ma, Jie Gao, Zhitao Chai, Qi Liu, Jun Wang, Pinghui Tao, Jing Su, Zhou Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Cyber Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China Shannxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China Guangdong Guangzhou510000 China

Audio-Visual Question Answering (AVQA) is a challenging multimodal reasoning task requiring intelligent systems to answer natural language queries based on paired audio-video inputs accurately. However, existing AVQA approaches often suffer from overfitting to dataset biases, leading to poor robustness. Moreover, current datasets may not effectively diagnose these methods. To address these challenges, we first introduce a novel dataset, FortisAVQA, constructed in two stages: (1) rephrasing questions in the test split of the public MUSIC-AVQA dataset and (2) introducing distribution shifts across questions. The first stage expands the test space with greater diversity, while the second enables a refined robustness evaluation across rare, frequent, and overall question distributions. Second, we introduce a robust Multimodal Audio-Visual Epistemic network (MAVEN) that leverages a multifaceted cycle collaborative debiasing strategy to mitigate bias learning. Experimental results demonstrate that our architecture achieves state-of-the-art performance on FortisAVQA, with a notable improvement of 7.81%. Extensive ablation studies on both datasets validate the effectiveness of our debiasing components. Additionally, our evaluation reveals the limited robustness of existing multimodal QA methods. We also verify the plug-and-play capability of our strategy by integrating it with various baseline models across both datasets. Our dataset and code are available at https://***/reml-group/fortisavqa. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the optimality of tape merge of two lists with similar size 27

On the optimality of tape merge of two lists with similar si...

引用

27th International Symposium on Algorithms and Computation, ISAAC 2016

作者： Li, Qian Sun, Xiaoming Zhang, Jialin CAS Key Lab. of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783959770262

The problem of merging sorted lists in the least number of pairwise comparisons has been solved completely only for a few special cases. Graham and Karp [18] independently discovered that the tape merge algorithm is optimal in the worst case when the two lists have the same size. Stockmeyer and Yao[28], Murphy and Paull[24], and Christen[6] independently showed when the lists to be merged are of size m and n satisfying m ≤ n ≤ ⌊3/2m⌋ + 1, the tape merge algorithm is optimal in the worst case. This paper extends this result by showing that the tape merge algorithm is optimal in the worst case whenever the size of one list is no larger than 1.52 times the size of the other. The main tool we used to prove lower bounds is Knuth's adversary methods [18]. In addition, we show that the lower bound cannot be improved to 1.8 via Knuth's adversary methods. We also develop a new inequality about Knuth's adversary methods, which might be interesting in its own right. Moreover, we design a simple procedure to achieve constant improvement of the upper bounds for 2m - 2 ≤ n ≤ 3m. © Qian Li, Xiaoming Sun, and Jialin Zhang.

关键词： Mergers and acquisitions

来源：评论

学校读者我要写书评

暂无评论

MetaSLRCL: A Self-Adaptive Learning Rate and Curriculum Learning Based Framework for Few-Shot Text Classification 29

MetaSLRCL: A Self-Adaptive Learning Rate and Curriculum Lear...

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Zhao, Kailin Jin, Xiaolong Guan, Saiping Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of SciencesSchool of Computer Science and Technology University of Chinese Academy of Sciences

Due to the lack of labeled data in many realistic scenarios, a number of few-shot learning methods for text classification have been proposed, among which the meta learning based ones have recently attracted much attention. Such methods usually consist of a learner as the classifier and a meta learner for specializing the learner to different tasks. For the learner, learning rate is crucial to its performance. However, existing methods treat it as a hyper parameter and adjust it manually, which is time-consuming and laborious. Intuitively, for different tasks and neural network layers, the learning rates should be different and self-adaptive. For the meta learner, it requires a good generalization ability so as to quickly adapt to new tasks. Motivated by these issues, we propose a novel meta learning framework, called MetaSLRCL, for few-shot text classification. Specifically, we present a novel meta learning mechanism to obtain different learning rates for different tasks and neural network layers so as to enable the learner to quickly adapt to new training data. Moreover, we propose a task-oriented curriculum learning mechanism to help the meta learner achieve a better generalization ability by learning from different tasks with increasing difficulties. Extensive experiments on three benchmark datasets demonstrate the effectiveness of MetaSLRCL. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：