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

2023 Optical Fiber Communications Conference and Exhibition, OFC 2023

作者： He, Tao Zhang, Shixiong Li, Hao Yan, Zhijun Liu, Deming Sun, Qizhen School of Cyber Science and Engineering Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Wuhan430074 China Optics Valley Laboratory Huazhong University of Science and Technology School of Optical and Electronic Information National Laboratory for Optoelectronics National Engineering Laboratory for Next Generation Internet Access System Wuhan430074 China

A multi-source signals separation algorithm is proposed to identify the potential threatening signals submerged in the strong background noises. Finally, the recognition rate of the mixed signals is improved from 62.8... 详细信息

ISBN: (纸本)9781957171180

关键词： Source separation

来源：评论

学校读者我要写书评

暂无评论

Movable Antenna Enabled Near-Field Communications: Channel Modeling and Performance Optimization

引用

IEEE Transactions on Communications 2025年

作者： Zhu, Lipeng Ma, Wenyan Xiao, Zhenyu Zhang, Rui National University of Singapore Department of Electrical and Computer Engineering 117583 Singapore Beihang University School of Electronic and Information Engineering Beijing100191 China The Chinese University of Hong Kong School of Science and Engineering Shenzhen Research Institute of Big Data Shenzhen518172 China

Movable antenna (MA) technology offers promising potential to enhance wireless communication by allowing flexible antenna movement. To maximize spatial degrees of freedom (DoFs), larger movable regions are required, which may render the conventional far-field assumption for channels between transceivers invalid. In light of it, we investigate in this paper MA-enabled near-field communications, where a base station (BS) with multiple movable subarrays serves multiple users, each equipped with a fixed-position antenna (FPA). First, we extend the field response channel model for MA systems to the near-field propagation scenario. Next, we examine MA-aided multiuser communication systems under both digital and analog beamforming architectures. For digital beamforming, spatial division multiple access (SDMA) is utilized, where an upper bound on the minimum achievable rate across users is derived in closed form. A low-complexity algorithm based on zero-forcing (ZF) is then proposed to jointly optimize the antenna position vector (APV) and digital beamforming matrix (DBFM) to approach this bound. For analog beamforming, orthogonal frequency division multiple access (OFDMA) is employed, and an upper bound on the minimum achievable rate among users is also derived. An alternating optimization (AO) algorithm is proposed to iteratively optimize the APV, analog beamforming vector (ABFV), and power allocation until convergence. For both architectures, we further explore MA design strategies based on statistical channels, with the APV updated less frequently to reduce the antenna movement overhead. Simulation results demonstrate that our proposed algorithms achieve performance close to the derived bounds and also outperform the benchmark schemes using dense or sparse arrays with FPAs. 1972-2012 IEEE.

关键词： Near field communication

来源：评论

学校读者我要写书评

暂无评论

Mining World Indicators for Analyzing and Modeling the Development of Countries

引用

ACM/IMS Transactions on data science 2021年第4期2卷 1–27页

作者： Huang, Hong Chi, Mingyuan Song, Yu Jin, Hai The National Engineering Research Center for Big Data Technology and System Key Laboratory of Service Computing Technology and System Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

The world indicators released by the World Bank or other organizations usually give the basic public knowledge about the world. However, separate and static index lacks the complex interplay among different indicators and thus cannot help us have an overall understanding of the world. To this end, we study the world indicators from a different angle. Firstly, we discover that there exist correlations between indicators either from a static view or from a dynamic view. Moreover, taking the trade and diplomatic relationships into consideration, we construct a multi-relational network to depict the interactions between different countries, and propose a Multiple Relations to Vector (MR2vec) model to study world indicators from a network perspective. The experimental results show the changes of world indicators are predictable with the proposed model, and our proposed MR2vec has wide adaptability in predicting multi-relation networks. © 2022 Copyright held by the owner/author(s).

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

research on NARX wind speed prediction network based on Copula 27

Research on NARX wind speed prediction network based on Copu...

引用

27th International Conference on Automation and Computing, ICAC 2022

作者： Wu, Dizhi Dai, Jun Zhang, Taihao Yu, Shengping Xing, Bing Chen, Liangyin SiChuan University School of Computer Science ChengDu China The Second Research Institute CASRI ChengDu China Northeastern University Liaoning China Chongqing Innovation Center of Industrial Big-Data Chongqing China

ISBN: (数字)9781665498074

ISBN: (纸本)9781665498074

Accurate wind speed forecasting is the key to ensure the safe and stable access of wind energy to the grid system. Accurate wind speed forecasting can avoid the unnecessary loss of wind turbines due to high wind speed, and it is also helpful for wind power forecasting. However, the wind speed data is different from the general time series data, and the intermittency of the wind brings great volatility due to the weak continuity. There are a large number of peak points within the range of high wind speed. These peak points make it difficult to achieve accurate wind speed forecasting, no improvement method has been proposed for these wind speed characteristics in existing studies. This work proves the inaccuracy of maximum wind speed prediction through mathematical modeling, analyzes the correlation between meteorological data and wind speed in the data set, and proposes to take the most dependent meteorological data as an additional input to train the network, and through the copula connection function, it is proved that there is a tail dependence between the new parameters and the maximum wind speed. It can be used as a new method to improve the prediction accuracy of high wind speed peak. © 2022 IEEE.

关键词： Wind speed

来源：评论

学校读者我要写书评

暂无评论

AdvMap: Crafting Adversarial Maps to Counter AI Aimbot in First-Person Shooter Games

引用

IEEE Transactions on Games 2025年

作者： Yan, Kai Chen, Xianyi Cui, Qi Yuan, Haoqin Tan, Zhenshan Nanjing University of Information Science and Technology Engineering Research Center of Digital Forensics Ministry of Education the School of Computer Science Nanjing210044 China Beijing Jiaotong University Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport Beijing100044 China

AI-based automatic aiming cheats (a.k.a., AI aimbots) have proliferated in first-person shooter (FPS) games, which grant malicious users an unfair gameplay advantage. Since AI aimbots operate independently of game data and are developed using object detection algorithms, they are difficult to detect with traditional anti-cheating methods. To actively counter AI aimbots, we propose AdvMap, which introduces invisible adversarial perturbations into game scene elements. In optimizing these adversarial perturbations, we design a mixture-of-misleading loss function that increases the total target confidence score within each misleading bounding box. It mitigates the risk of segment missing even when AdvMap is obscured, thereby enhancing the robustness. Besides, an L1-norm constraint with a small scale is employed during each update of the adversarial perturbations, which preserves the fidelity of the game scene. Additionally, to enable effective adaptation to interact with various elements within game environments, we introduce an Image-Subspace-Based Multi-Directional (ISMD) optimization strategy. It enables the adversarial perturbations to adaptively fit into each element by leveraging the mapping relationship between the game's 3D scenes and its corresponding 2D images. Furthermore, we construct a comprehensive benchmark, which includes various FPS games with different graphics styles and perspectives. Extensive experimental results demonstrate the efficacy of our method in countering various AI aimbot tools on different state-of-the-art object detection methods. © 2021 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

SumPA: Efficient Pattern-Centric Graph Mining with Pattern Abstraction 21

SumPA: Efficient Pattern-Centric Graph Mining with Pattern A...

引用

Proceedings of the 30th International Conference on Parallel Architectures and Compilation Techniques

作者： Chuangyi Gui Xiaofei Liao Long Zheng Pengcheng Yao Qinggang Wang Hai Jin National Engineering Research Center for Big Data Technology and System/Service Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781665442787

Graph mining aims to explore interesting structural information of a graph. Pattern-centric systems typically transform a generic-purpose graph mining problem into a series of subgraph matching problems for high performance. Existing pattern-centric mining systems reduce the substantial search space towards a single pattern by exploring a highly-optimized matching order, but inherent computational redundancies of such a matching order itself still suffer severely, leading to significant performance degradation. The key innovation of this work lies in a general redundancy criterion that characterizes computational redundancies arising in not only handing a single pattern but also matching multiple patterns simultaneously. In this paper, we present SumPA, a high-performance pattern-centric graph mining system that can sufficiently remove redundant computations for any complex graph mining problems. SumPA features three key designs: (1) a pattern abstraction technique that can simplify numerous complex patterns into a few simple abstract patterns based on pattern similarity, (2) abstraction-guided pattern matching that completely eliminates (totally and partially) redundant computations during subgraph enumeration, and (3) a suite of system optimizations to maximize storage and computation efficiency. Our evaluation on a wide variety of real-world graphs shows that SumPA outperforms the two state-of-the-art systems Peregrine and GraphPi by up to 61.89× and 8.94×, respectively. For many mining problems on large graphs, Peregrine takes hours or even days while SumPA finishes in only a few minutes.

关键词： data reuse

来源：评论

学校读者我要写书评

暂无评论

The Adaptive Fault-tolerant Routing Based on an Improved Local Security Information Model of the Exchanged Hypercube 21

The Adaptive Fault-tolerant Routing Based on an Improved Loc...

引用

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on big data and Cloud Computing, 16th IEEE International Conference on Social Computing and Networking and 13th International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Zhang, Yazhi Luo, Chuanwen Wang, Guijuan Zhang, Li Lv, Mengjie Yu, Jiguo Qilu University of Technology School of Computer Science and Technology Jinan China Beijing Forestry University School of Information Science and Technology Beijing China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China Nanjing University of Posts and Telecommunications College of Computer Nanjing China Qilu University of Technology Shandong Academy of Sciences Big Data Research Institute Jinan China

ISBN: (纸本)9798350329223

With the increasing amount of computation in high-performance computing, the scale of interconnection networks is becoming larger and larger. It is inevitable that processors or links in the network become faulty. Therefore, it is very important for a processor to understand the security status of itself and neighbors, and then adaptively and reliably communicate. However, the existing security information models consider faulty processors or faulty links separately, and do not consider the situation where both processors and links fail simultaneously. The Exchanged Hypercube is an excellent interconnection network structure which achieves a balance between network functionality and hardware overhead while preserving many excellent properties of the Hypercube. In this paper, we propose an adaptive fault-tolerant routing algorithm of the Exchanged Hypercube based on an improved local security information model, which considers the faulty processors and faulty links simultaneously. This algorithm always can select suitable processors for routing based on the local security information and unsafe coefficients of processors, which greatly reduces the impact of the faulty of networks. The adaptive fault-tolerant routing algorithm of the Exchanged Hypercube network is not only suitable for regular networks but also for heterogeneous networks since the Exchanged Hypercube is a semi regular network. Sufficient experimental results show that the algorithm proposed in this paper has a lower packet loss rate, a higher success rate, and a shorter average path length. © 2023 IEEE.

关键词： Hypercube networks

来源：评论

学校读者我要写书评

暂无评论

Audio-Visual Active Speaker Extraction for Sparsely Overlapped Multi-Talker Speech

Audio-Visual Active Speaker Extraction for Sparsely Overlapp...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Junjie Li Ruijie Tao Zexu Pan Meng Ge Shuai Wang Haizhou Li Shenzhen Research Institute of Big Data Shenzhen China Department of Electrical and Computer Engineering National University of Singapore Singapore School of Data Science The Chinese University of Hong Kong Shenzhen China

Target speaker extraction aims to extract the speech of a specific speaker from a multi-talker mixture as specified by an auxiliary reference. Most studies focus on the scenario where the target speech is highly overlapped with the interfering speech. However, this scenario only accounts for a small percentage of real-world conversations. In this paper, we aim at the sparsely overlapped scenarios in which the auxiliary reference needs to perform two tasks simultaneously: detect the activity of the target speaker and disentangle the active speech from any interfering speech. We propose an audio-visual speaker extraction model named ActiveExtract, which leverages speaking activity from audio-visual active speaker detection (ASD). The ASD directly provides the frame-level activity of the target speaker, while its intermediate feature representation is trained to discriminate speech-lip synchronization that could be used for speaker disentanglement. Experimental results show our model outperforms baselines across various overlapping ratios, achieving an average improvement of more than 4 dB in terms of SI-SNR.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PipeEdge: A Trusted Pipelining Collaborative Edge Training based on Blockchain 23

PipeEdge: A Trusted Pipelining Collaborative Edge Training b...

引用

32nd ACM World Wide Web Conference, WWW 2023

作者： Yuan, Liang He, Qiang Chen, Feifei Dou, Ruihan Jin, Hai Yang, Yun School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computing Technologies Swinburne University of Technology Australia School of Information Technology Deakin University Australia Faculty of Mathematics University of Waterloo Canada National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781450394161

Powered by the massive data generated by the blossom of mobile and Web-of-Things (WoT) devices, Deep Neural Networks (DNNs) have developed both in accuracy and size in recent years. Conventional cloud-based DNN training incurs rapidly-increasing data and model transmission overheads as well as privacy issues. Mobile edge computing (MEC) provides a promising solution by facilitating DNN model training on edge servers at the network edge. However, edge servers often suffer from constrained resources and need to collaborate on DNN training. Unfortunately, managed by different telecoms, edge servers cannot properly collaborate with each other without incentives and trust. In this paper, we introduce PipeEdge, a scheme that promotes collaborative edge training between edge servers by introducing incentives and trust based on blockchain. Under the PipeEdge scheme, edge servers can hire trustworthy workers for pipelined DNN training tasks based on model parallelism. We implement PipeEdge and evaluate it comprehensively with four different DNN models. The results show that it outperforms state-of-the-art schemes by up to 173.98% with negligible overheads. © 2023 ACM.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Semantic and Emotional Dual Channel for Emotion Recognition in Conversation

引用

IEEE Transactions on Affective Computing 2025年

作者： Yang, Zhenyu Zhang, Zhibo Cheng, Yuhu Zhang, Tong Wang, Xuesong Jinan250353 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China China University of Mining and Technology Engineering Research Center of Intelligent Control for Underground Space Ministry of Education Xuzhou Key Laboratory of Artificial Intelligence and Big Data School of Information and Control Engineering Xuzhou221116 China South China University of Technology Guangdong Provincial Key Laboratory of Computational Intelligence and Cyberspace Information School of Computer Science and Engineering Guangzhou510006 China Pazhou Lab Guangzhou510335 China Engineering Research Center Ministry of Education on Health Intelligent Perception and Paralleled Digital-Human Guangzhou China

Emotion recognition in conversation (ERC) aims at accurately identifying emotional states expressed in conversational content. Existing ERC methods, although relying on semantic understanding, often encounter challenges when confronted with incomplete or misleading semantic information. In addition, when dealing with the interaction between emotional and semantic information, existing methods are often difficult to effectively distinguish the complex relationship between the two, which affects the accuracy of emotion recognition. To address the problems of semantic misdirection and emotional cross-talk encountered by traditional models when confronted with complex conversational data, we propose a semantic and emotional dual channel (SEDC) strategy for emotion recognition in conversations to process emotional and semantic information independently. Under this strategy, emotion information provides an auxiliary recognition function when the semantics are unclear or lacking, enhancing the accuracy of the model. Our model consists of two modules: the emotion processing module accurately captures the emotional features of each utterance through contrastive learning, and then constructs a dialogue emotion propagation map to simulate the emotional information conveyed in the dialogue;the semantic processing module combines an external knowledge base to enhance the semantic expression of the dialogue through knowledge enhancement strategies. This divide-and-conquer approach allows us to more deeply analyze the emotional and semantic dimensions of complex dialogues. Experimental results on the IEMOCAP, EmoryNLP, MELD, and DailyDialog datasets show that our approach significantly outperforms existing techniques and effectively improves the accuracy of dialogue emotion recognition. Our code is available at https://***/r/SEDC-FCF1. © 2010-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：