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

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Guo, Wangdong Zhu, Qing Mao, Qirong School of Computer Science and Communication Engineering Jiangsu University China Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications China Provincial Key Laboratory of Computational Intelligence and New Technologies in Low-Altitude Digital Agriculture Zhenjiang China

ISBN: (纸本)9798350368741

Group Emotion Recognition (GER) seeks to identify emotional states within multi-person groups. The complexity of the environment and the reliance on a single group emotion label often result in noisy individuals with inconsistent emotional expressions, hampering accurate emotion classification. Mainstream GER networks attempt to downweight noisy individuals, but when their numbers are high and over-relying on a single group label, the negative impact of noise on individuals remains significant, further complicating classification and diminishing accuracy. To address these limitations, we propose the Multi-Scale Contextual and Noise Suppression Model (MCon-NSM), a novel framework that enhances GER by capturing fine-grained interaction contexts and collaboratively suppressing noise at both the individual and group label levels. Extensive experiments on the GAF series datasets demonstrate that our method achieves results comparable to state-of-the-art techniques, validating its effectiveness in mitigating noise in GER. © 2025 IEEE.

关键词： Emotion analysis Group emotion recognition Multi-Scale context learning Noise suppression

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Text Classification for Judicial Texts via Dual Graph and Label Feature Fusion 10

Multi-Label Text Classification for Judicial Texts via Dual ...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Gu, Qiliang Lu, Qin Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China 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 Industrial Network and Information System Security Jinan China

ISBN: (纸本)9798331520861

The legal judgement prediction (LJP) of judicial texts represents a multi-label text classification (MLTC) problem, which in turn involves three distinct tasks: the prediction of charges, legal articles, and terms of penalty. Nevertheless, extant multi-label text classification models tend to eschew the consideration of multiple correlations and semantic information between labels when predicting judicial texts, which may result in the loss of pertinent information. Furthermore, these models do not take full advantage of the local and overall information of the labels in the process of selecting appropriate labels for the text using the multi-head attention mechanism. To address these issues, we propose a new model, BGFLFF, which explores label correlation and semantics among the three tasks by employing Graph Convolutional Network (GCN) and multi-head attention mechanisms. In particular, we propose a Bi-Graph Fusion GCN (BGF-GCN), which fuses the co-occurrence matrix of labels with the cosine similarity matrix, thereby fully exploiting the multiple correlations between labels. Furthermore, prior to embedding the tags, the interpretations of the labels are obtained via Google in order to enhance the semantic information between the labels. To further reinforce the interconnections between labels and text and more effectively comprehend the interrelationships between the three tasks, we propose a Multi-Head Label Feature Fusion Attentional Mechanism (MH-LFFAtt), which assigns distinct weights to the pertinent label information in the text by fusing the local and overall features of the labels. The experimental results demonstrate that the F1 score exhibits an improvement of up to 2. 2 8 % and a minimum of 1. 2 9 % across the various tasks of the two datasets. This evidence substantiates the assertion that BGFLFF outperforms the existing baseline model. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

An Energy-Efficient Virtual Machine Placement Algorithm Based on Improved Grouping GA

An Energy-Efficient Virtual Machine Placement Algorithm Base...

引用

IEEE International Conference on Automation, Electronics and Electrical Engineering (AUTEEE)

作者： Taisheng Zeng Xiaodong Wu School of Mathematics and Computer Science Quanzhou Normal University Fujian Provincial Key Laboratory of Data-Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University Quanzhou China

ISBN: (数字)9798350377033

ISBN: (纸本)9798350377040

Virtual machine placement (VMP) plays a crucial role in optimizing the efficiency and sustainability of data centers. By consolidating virtual machines (VMs) onto fewer physical machines (PMs), VMP can significantly reduce power consumption and enhance resource utilization. This not only leads to cost savings but also contributes to environmental sustainability by minimizing energy waste. This paper focuses on addressing the energy-efficient VMP problem, which is critical for modern data centers aiming to balance performance and energy consumption. To tackle this challenge, we propose an improved group-based genetic algorithm (GGA). The GGA employs a novel grouping approach to encode chromosomes, allowing for more effective representation of VM-to-PM assignments. Additionally, optimized crossover and mutation operators are designed to improve the algorithm's performance, ensuring faster convergence and better solutions. Experimental results demonstrate that the proposed algorithm outperforms traditional algorithms in terms of energy-saving efficiency and convergence speed.

关键词： data centers Power demand Virtual machines Energy efficiency Resource management Sustainable development Biological cells Optimization Genetic algorithms Convergence

来源：评论

学校读者我要写书评

暂无评论

Invisible Watermark and Hypothesis Testing for Multi-Ownership Verification Framework of Deep Neural Network

Invisible Watermark and Hypothesis Testing for Multi-Ownersh...

引用

IEEE International Symposium on Information (IT) in Medicine and Education, ITME

作者： Ruoxi Wang Yujia Zhu Daoxun Xia School of Big Data and Computer Science Guizhou Normal University Key Laboratory of Information and Computing Science Guizhou Province Guizhou Normal University Engineering Laboratory for Applied Technology of Big Data in Education Guizhou Normal University Guiyang China

ISBN: (数字)9798350356670

ISBN: (纸本)9798350356687

With the rapid development of information technology, artificial intelligence models have become the core asset of tech giants, highlighting the importance of copyright protection. Black-box watermarking has gained attention due to its ability to verify the legality of models remotely without relying on internal model information. The challenges lie in embedding and verifying watermarks without accessing internal model parameters, while ensuring the robustness and stealth of the watermark. This paper focuses on discussing effective ways to protect the copyright of black-box watermarking models and detect and prevent unauthorized user behavior that infringes on model ownership. Therefore, this paper proposes a multi-ownership verification framework based on invisible watermark and hypothesis testing, which mainly consists of two parts: watermark generation and copyright verification. The watermark generation uses a dynamic watermarking method to generate invisible backdoor watermark and verifies copyright through hypothesis testing. This framework has high assurance and effectiveness under various models of CIFAR-10 and MNIST datasets and shows strong robustness in VGG and Resnet model pruning attacks. This research provides new ideas and methods for the protection of model copyrights in deep neural networks.

关键词： Deep learning Education Closed box Watermarking Artificial neural networks Copyright protection Benchmark testing Robustness Protection Information technology

来源：评论

学校读者我要写书评

暂无评论

A Point Cloud Registration Method for Substations Based on an Improved SAC-IA Algorithm

A Point Cloud Registration Method for Substations Based on a...

引用

2023 China Automation Congress, CAC 2023

作者： Wang, Lei Chen, Yiping Zong, Haonan Wang, Lulu Yin, Jun School of Computer Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China School of Internet of Things Nanjing University of Posts and Telecommunications Nanjing210023 China

ISBN: (纸本)9798350303759

This paper proposes a point cloud registration method for substations based on an improved SAC-IA algorithm. This method optimizes the SAC-IA algorithm by filtering the randomly selected point pairs to ensure that the triangles formed by the selected points in the model and scene point clouds have certain similarities. Furthermore, the registration error judgment of the SAC-IA algorithm has been improved. In addition to using the Euclidean distance between the registered model and scene point clouds as the judgment standard, this method also considers the SHOT difference and average curvature difference. Successful registration is only considered when all three standards are satisfied. The experimental research shows that the time performance of this method is twice as high as that of the traditional SAC-IA algorithm on average, and the recognition accuracy is improved in the recognition results. © 2023 IEEE.

关键词： Electric substations

来源：评论

学校读者我要写书评

暂无评论

Collusion Resistant Identity-based Proxy Re-encryption Scheme on Lattice 6

Collusion Resistant Identity-based Proxy Re-encryption Schem...

引用

6th International Conference on Computer Information Science and Application Technology, CISAT 2023

作者： Deng, Xiaohong Xie, Hua Xiong, Weizhi School of Electronics and Information Engineering Gannan University of Science and Technology Ganzhou341000 China College of Information Science Jiangxi University of Science and Technology Ganzhou341000 China Key Laboratory of Cloud Computing and Big Data Ganzhou341000 China

ISBN: (纸本)9781510668546

Proxy re-encryption plays an important role for data security in cloud computing and big data, but the traditional reencryption scheme based on the classical number theory problem cannot resist quantum attack, and the lattice based cryptosystem has been proved to have the ability to resist quantum attack, so the lattice based re-encryption scheme has always been a research hotspot. In view of the problem that collusion-resistance and multi-hop can not be satisfied at the same time in existing schemes, this paper proposes a new identity-based proxy re-encryption scheme on lattice. Firstly, the scheme uses trapdoors as private keys to achieve one-way anti-collusion. In addition, we constructs a variant of learning with errors (LWE), which uses a convert algorithm to transform the user matrix and replace the vector with a uniform matrix, so that the scheme can meet the requirements of multi-hop and encrypt multiple bits of messages at one time. Theoretical analysis and experimental simulation prove that the security of the new scheme can be reduced to a decision LWE problem, which can reach the IND-sID-CPA security in the standard model, and can improve the encryption efficiency while ensuring the security. © 2023 SPIE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Boosting Meaningful Dependency Mining with Clustering and Covariance Analysis 40

Boosting Meaningful Dependency Mining with Clustering and Co...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Wang, Xi Jin, Ruochun Huang, Wanrong Tang, Yuhua Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha China College of Computer Science and Technology Department of Intelligent Data Science National University of Defense Technology Changsha China

ISBN: (纸本)9798350317152

Functional dependencies (FDs) form a valuable ingredient for various data management tasks. However, existing methods can hardly discover practical and interpretable FDs, especially in large noisy real-life datasets. This paper studies the problem of discovering meaningful functional dependencies (FDms) that utilize support and error parameters to capture interesting dependencies in such datasets and proposes an efficient discovery algorithm called FDM?. In order to scale with large datasets, FDM ? employs an efficient sampling method with accuracy guarantees to capture the differences between tuple pairs and to quantify the connection between support/error of dependencies on samples and those on the entire dataset. Moreover, it adopts a clustering-based correlated attributes extraction to divide the exponentially large search space into multiple small sub-spaces and proposes an easy-first traversal strategy with covariance-based guidance that quickly detects candidate dependencies and validates them. Additionally, we prove a covariance lower bound as an additional pruning criterion to reduce the search space. Extensive experiments on real-life and synthetic datasets demonstrate that FDM ? is 14 times faster than existing discovery algorithms on average, up to 31 times, and scales to larger datasets with the least memory cost. © 2024 IEEE.

关键词： Large datasets

来源：评论

学校读者我要写书评

暂无评论

Mobility-aware Seamless Service Migration and Resource Allocation in Multi-edge IoV Systems

引用

IEEE Transactions on Mobile computing 2025年第7期24卷 6315-6332页

作者： Chen, Zheyi Huang, Sijin Min, Geyong Ning, Zhaolong Li, Jie Zhang, Yan Fuzhou University College of Computer and Data Science Fuzhou350116 China Ministry of Education Engineering Research Center of Big Data Intelligence Fuzhou350002 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China University of Exeter Department of Computer Science Faculty of Environment Science and Economy ExeterEX4 4QF United Kingdom Chongqing University of Posts and Telecommunications School of Communications and Information Engineering Chongqing400065 China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China University of Oslo Department of Informatics Oslo0316 Norway

Mobile Edge computing (MEC) offers low-latency and high-bandwidth support for Internet-of-Vehicles (IoV) applications. However, due to high vehicle mobility and finite communication coverage of base stations, it is hard to maintain uninterrupted and high-quality services without proper service migration among MEC servers. Existing solutions commonly rely on prior knowledge and rarely consider efficient resource allocation during the service migration process, making it hard to reach optimal performance in dynamic IoV environments. To address these important challenges, we propose SR-CL, a novel mobility-aware seamless Service migration and Resource allocation framework via Convex-optimization-enabled deep reinforcement Learning in multi-edge IoV systems. First, we decouple the Mixed Integer Nonlinear Programming (MINLP) problem of service migration and resource allocation into two sub-problems. Next, we design a new actor-critic-based asynchronous-update deep reinforcement learning method to handle service migration, where the delayed-update actor makes migration decisions and the one-step-update critic evaluates the decisions to guide the policy update. Notably, we theoretically derive the optimal resource allocation with convex optimization for each MEC server, thereby further improving system performance. Using the real-world datasets of vehicle trajectories and testbed, extensive experiments are conducted to verify the effectiveness of the proposed SR-CL. Compared to benchmark methods, the SR-CL achieves superior convergence and delay performance under various scenarios. © 2025 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Cost-Sensitive Portfolio Selection via Deep Reinforcement Learning (Extended Abstract) 39

Cost-Sensitive Portfolio Selection via Deep Reinforcement Le...

引用

39th IEEE International Conference on data Engineering, ICDE 2023

作者： Zhang, Yifan Zhao, Peilin Wu, Qingyao Li, Bin Huang, Junzhou Tan, Mingkui National University of Singapore Singapore Tencent AI Lab United States South China University of Technology China Wuhan University China University of Texas at Arlington United States Ministry of Education Key Laboratory of Big Data and Intelligent Robot China Pazhou Laboratory China

ISBN: (纸本)9798350322279

Portfolio Selection is an important real-world financial task and has attracted extensive attention in artificial intelligence communities. This task, however, has two main difficulties: (i) the non-stationary price series and complex asset correlations make the learning of feature representation very hard;(ii) the practicality principle in financial markets requires controlling both transaction and risk costs. Most existing methods adopt handcraft features and/or consider no constraints for the costs, which may make them perform unsatisfactorily and fail to control both costs in practice. In this paper, we propose a cost-sensitive portfolio selection method with deep reinforcement learning. Specifically, a novel two-stream portfolio policy network is devised to extract both price series patterns and asset correlations, while a new cost-sensitive reward function is developed to maximize the accumulated return and constrain both costs via reinforcement learning. We theoretically analyze the near-optimality of the proposed reward, which shows that the growth rate of the policy regarding this reward function can approach the theoretical optimum. We also empirically evaluate the proposed method on real-world datasets. Promising results demonstrate the effectiveness and superiority of the proposed method in terms of profitability, cost-sensitivity and representation abilities. © 2023 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Online Q&A for Machine Learning Courses Based on Formula Recognition 4

Online Q&A for Machine Learning Courses Based on Formula Rec...

引用

4th International Conference on Information Science and Education, ICISE-IE 2023

作者： Zhu, Xiaoke Chen, Xiaopan Li, Minghao Zhang, Tianxiang School of Computer and Information Engineering Henan University Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan University Kaifeng China Henan University Kaifeng Henan Key Laboratory of Big Data Analysis and Processing China

ISBN: (纸本)9798350394610

Mathematical formulas are ubiquitous in courses such as Machine Learning. Understanding these formulas is the primary challenge for studying of students. If a searchable knowledge base can be built for these formulas, it will help students learn. Accurate identification of these formulas is an important step in building and querying the knowledge base. However, mathematical formulas have complex two-dimensional and nested structures, which makes them inconvenient to search like ordinary text. This paper employs Faster R-CNN to detect regions containing mathematical formulas and improves its backbone network, anchor box dimensions, and pre-training network to make it more accurate and efficient in identifing these formulas. Furthermore, in order to enhance the features and meaningful representation of mathematical formulas in the input image, we introduce the distance transformation. Finally, comparative experiments were conducted on the publicly dataset GTDB. Our proposed approach achieved recognition rates of 91.22% and 85.74% for isolated and hybrid formulas detection. © 2023 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：