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

26th International Conference on Information and Communications Security, ICICS 2024

作者： Li, Jingtao Gao, Bo Wan, Jianxiong Li, Leixiao Zhang, Jiaxiang School of Data Science and Application Inner Mongolia University of Technology Hohhot China Inner Mongolia Key Laboratory of Beijiang Cyberspace Security Hohhot China School of Information Engineering Beijing Institute of Graphic Communication Beijing China Research Center of Large-Scale Energy Storage Technologies Ministry of Education of the People’s Republic of China Beijing China

ISBN: (纸本)9789819787975

The cube attack is a powerful technique for attacking symmetric ciphers, of which one of the core parts is the search for good cubes. The construction of candidate cubes targeting linear superpolies, proposed at Asiacrypt 2021 [20], is the dominant strategy for searching good cubes. However, the time spent on constructing candidate cubes increases significantly with initialization rounds on Trivium. To address this issue, we propose a novel framework called fast framework (The source code and data for this paper are available at https://***/Elpsys/Fast-Framework.), which enhances the efficiency of constructing candidates and discovers better cubes. The integration of numeric mapping and division property is the core of our framework;they can improve efficiency while guaranteeing accuracy. The proposed method is successfully applied to 830-and 832-round Trivium, both identifying more than 20 valuable cubes whose superpolies contain linear-independent terms and have the potential to be used in further practical key-recovery attacks. The experimental results demonstrated that the efficiency of constructing the mother cube is improved by at least a factor of 9 compared to conventional methods. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

CroPrompt: Cross-task Interactive Prompting for Zero-shot Spoken Language Understanding

CroPrompt: Cross-task Interactive Prompting for Zero-shot Sp...

引用

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

作者： Qin, Libo Wei, Fuxuan Chen, Qiguang Zhou, Jingxuan Huang, Shijue Si, Jiasheng Lu, Wenpeng Che, Wanxiang School of Computer Science and Engineering Central South University China Key Laboratory of Data Intelligence and Advanced Computing in Provincial Universities Soochow University China Research Center for Social Computing and Information Retrieval Harbin Institute of Technology China Harbin Institute of Technology Shenzhen China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology Shandong Academy of Sciences China

ISBN: (纸本)9798350368741

Slot filling and intent detection are two highly correlated tasks in spoken language understanding (SLU). Recent SLU research attempts to explore zero-shot prompting techniques in large language models to alleviate the data scarcity problem. Nevertheless, the existing prompting work ignores the cross-task interaction information for SLU, which leads to sub-optimal performance. To solve this problem, we present the pioneering work of Cross-task Interactive Prompting (CroPrompt) for SLU, which enables the model to interactively leverage the information exchange across the correlated tasks in SLU. Additionally, we further introduce a multi-task self-consistency mechanism to mitigate the error propagation caused by the intent information injection. We conduct extensive experiments on the standard SLU benchmark and the results reveal that CroPrompt consistently outperforms the existing prompting approaches. In addition, the multi-task self-consistency mechanism can effectively ease the error propagation issue, thereby enhancing the performance. We hope this work can inspire more research on cross-task prompting for SLU. © 2025 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SIGNAL-COMPARISON-BASED DISTRIBUTED ESTIMATION UNDER DECAYING AVERAGE data RATE COMMUNICATIONS

引用

SIAM Journal on Control and Optimization 2025年第2期63卷 1129-1155页

作者： Ke, Jieming Lu, Xiaodong Zhao, Yanlong Zhang, Ji-Feng School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100049 China School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing100083 China Key Laboratory of Knowledge Automation for Industrial Processes Ministry of Education Beijing100083 China State Key Laboratory of Mathematical Sciences Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100149 China School of Automation and Electrical Engineering Zhongyuan University of Technology Henan Province Zhengzhou450007 China

The paper investigates the distributed estimation problem under low data rate communications. Based on the signal-comparison (SC) consensus protocol under binary-valued communications, a new consensus+innovations type distributed estimation algorithm is proposed. First, the high-dimensional estimates are compressed into binary-valued messages by using a periodic compressive strategy, dithering noises, and a sign function. Next, based on the dithering noises and expanding triggering thresholds, a new stochastic event-triggered mechanism is proposed to reduce the communication frequency. Then, a modified SC consensus protocol is applied to fuse the neighborhood information. Finally, a stochastic approximation estimation algorithm is used to process innovations. The proposed SC-based algorithm has the advantages of high effectiveness and low communication cost. For the effectiveness, the estimates of the SC-based algorithm converge to the true value in the almost sure and mean square sense, and a polynomial almost sure convergence rate is also obtained. For the communication cost, the local and global average data rates decay to zero at a polynomial rate. The trade-off between the convergence rate and the communication cost is established through event-triggered coefficients. A better convergence rate can be achieved by decreasing event-triggered coefficients, while a lower communication cost can be achieved by increasing event-triggered coefficients. A simulation example is given to demonstrate the theoretical results. © 2025 Society for Industrial and Applied Mathematics.

关键词： Cost benefit analysis

来源：评论

学校读者我要写书评

暂无评论

TraSculptor: Visual Analytics for Enhanced Decision-Making in Road Traffic Planning

引用

IEEE Transactions on Visualization and Computer Graphics 2025年 PP卷 PP页

作者： Deng, Zikun Liu, Yuanbang Zhu, Mingrui Xiang, Da Yu, Haiyue Su, Zicheng Lu, Qinglong Schreck, Tobias Cai, Yi South China University of Technology School of Software Engineering China South China University of Technology Ministry of Education Key Laboratory of Big Data and Intelligent Robot China Tongji University Key Laboratory of Road and Traffic Engineering of the Ministry of Education China National University of Singapore Department of Civil and Environmental Engineering Singapore Graz University of Technology Austria

The design of urban road networks significantly influences traffic conditions, underscoring the importance of informed traffic planning. Traffic planning experts rely on specialized platforms to simulate traffic systems, assessing the efficacy of the road network across various states of modifications. Nevertheless, a prevailing issue persists: many existing traffic planning platforms exhibit inefficiencies in flexibly interacting with the road network's structure and attributes and intuitively comparing multiple states during the iterative planning process. This paper introduces TraSculptor, an interactive planning decision-making system. To develop TraSculptor, we identify and address two challenges: interactive modification of road networks and intuitive comparison of multiple network states. For the first challenge, we establish flexible interactions to enable experts to easily and directly modify the road network on the map. For the second challenge, we design a comparison view with a history tree of multiple states and a road-state matrix to facilitate intuitive comparison of road network states. To evaluate TraSculptor, we provided a usage scenario where the Braess's paradox was showcased, invited experts to perform a case study on the Sioux Falls network, and collected expert feedback through interviews. © 1995-2012 IEEE.

关键词： Visual analytics

来源：评论

学校读者我要写书评

暂无评论

A granular-ball generation method based on local density for classification

引用

Information Sciences 2025年 717卷

作者： Liu, Fan Zhang, Qinghua Xia, Shuyin Xie, Qin Liao, Wei Zhang, Siyang School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunication Chongqing400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing400065 China Tourism Multi-source Data Perception and Decision Technology Key Laboratory of the Ministry of Culture and Tourism Chongqing400065 China

As a new branch of granular computing, granular-ball computing (GBC) has become increasingly popular due to its high efficiency, robustness, and scalability. However, in classification tasks, the existing mainstream methods for generating granular-ball (GB) have two common issues: GBs generated by the existing methods are not accurate enough to describe the distribution of the original data and there are de-overlap operations in the existing GB generation process, which increase the workload of the GB generation process. Therefore, to solve the above two issues, a GB generation method based on local density (LDGBG) is proposed in this paper. First, centers of GBs are selected based on local density to ensure the generated GBs are more consistent with the original data distribution. Second, the method for calculating radii avoids overlaps and incorporates the idea of compact within class and decentralized between classes, which will improve classification performance. Furthermore, a sparsity index is introduced to assess the sparsity of datasets, thereby enabling more effective utilization of original samples in sparse datasets. Finally, comparative experiments are conducted on 27 benchmark datasets and the experimental results show that LDGBG is superior to the existing mainstream models in effectiveness and robustness. © 2025 Elsevier Inc.

关键词： Classification Granular computing Granular-ball computing Granular-ball generation Local density

来源：评论

学校读者我要写书评

暂无评论

Convolution Type of Metaplectic Cohen's Distribution Time-Frequency Analysis Theory, Method and Technology

引用

IEEE Transactions on Information Theory 2025年第3期71卷 2292-2314页

作者： Cui, Manjun Zhang, Zhichao Han, Jie Chen, Yunjie Cao, Chunzheng Nanjing University of Information Science and Technology School of Mathematics and Statistics Center for Applied Mathematics of Jiangsu Province Jiangsu International Joint Laboratory on System Modeling and Data Analysis Nanjing210044 China Nanjing University of Information Science and Technology School of Mathematics and Statistics Nanjing210044 China Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China Hainan Normal University Key Laboratory of Computational Science and Application of Hainan Province Haikou571158 China Nanjing University of Information Science and Technology School of Remote Sensing and Geomatics Engineering Nanjing210044 China

The conventional Cohen's distribution can't meet the requirement of additive noises jamming signals high-performance denoising under the condition of low signal-to-noise ratio, it is necessary to integrate the metaplectic transform for non-stationary signal fractional domain time-frequency analysis. In this paper, we embark on blending time-frequency operators and coordinate operator fractionizations to formulate the definition of the joint fractionizations metaplectic Wigner distribution (JFMWD), based on which we integrate the generalized metaplectic convolution to address the unified representation issue of the convolution type of metaplectic Cohen's distribution (CMCD), whose special cases and essential properties are also derived. We blend Wiener filter principle and fractional domain filter mechanism of the metaplectic transform to design the least-squares adaptive filter method in the JFMWD domain, giving birth to the least-squares adaptive filter-based CMCD whose kernel function can be adjusted with the input signal automatically to achieve the minimum mean-square error (MSE) denoising in Wigner distribution domain. We discuss the optimal symplectic matrices selection strategy of the proposed adaptive CMCD through the minimum MSE minimization modeling and solving. Some examples are also carried out to demonstrate that the proposed filtering method outperforms some state-of-the-arts including the classical Gaussian filter, the Cohen's distribution filtering methods with fixed kernel functions, the classical Wiener filter, the adaptive generalized linear canonical convolution-based filtering method, the adaptive Cohen's distribution filtering method, the adaptive JFMWD-based Cohen's distribution filtering method, and the adaptive generalized metaplectic convolution-based Cohen's distribution filtering method in noise suppression. © 1963-2012 IEEE.

关键词： Adaptive filtering

来源：评论

学校读者我要写书评

暂无评论

UAV-Assisted Joint Mobile Edge Computing and data Collection via Matching-Enabled Deep Reinforcement Learning

引用

IEEE Internet of Things Journal 2025年

作者： Wang, Boxiong Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanyang Technological University College of Computing and Data Science 639798 Singapore

Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) and data collection (DC) have been popular research issues. Different from existing works that consider MEC and DC scenarios separately, this paper investigates a multi-UAV-assisted joint MEC-DC system. Specifically, we formulate a joint optimization problem to minimize the MEC latency and maximize the collected data volume. This problem can be classified as a non-convex mixed integer programming problem that exhibits long-term optimization and dynamics. Thus, we propose a deep reinforcement learning-based approach that jointly optimizes the UAV movement, user transmit power, and user association in real time to solve the problem efficiently. Specifically, we reformulate the optimization problem into an action space-reduced Markov decision process (MDP) and optimize the user association by using a two-phase matching-based association (TMA) strategy. Subsequently, we propose a soft actor-critic (SAC)-based approach that integrates the proposed TMA strategy (SAC-TMA) to solve the formulated joint optimization problem collaboratively. Simulation results demonstrate that the proposed SAC-TMA is able to coordinate the two subsystems and can effectively reduce the system latency and improve the data collection volume compared with other benchmark algorithms. © 2025 IEEE. All rights reserved,

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE Internet of Things Journal 2025年

作者： Li, Yangning Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Wang, Jiacheng Zhao, Changyuan Niyato, Dusit Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanyang Technological University College of Computing and Data Science 639798 Singapore

An expansion of Internet of Things (IoTs) has led to significant challenges in wireless data harvesting, dissemination, and energy management due to the massive volumes of data generated by IoT devices. These challenges are exacerbated by data redundancy arising from spatial and temporal correlations. To address these issues, this paper proposes a novel data-driven collaborative beamforming (CB)-based communication framework for IoT networks. Specifically, the framework integrates CB with an overlap-based multi-hop routing protocol (OMRP) to enhance data transmission efficiency while mitigating energy consumption and addressing hot spot issues in remotely deployed IoT networks. Based on the data aggregation to a specific node by OMRP, we formulate a node selection problem for the CB stage, with the objective of optimizing uplink transmission energy consumption. Given the complexity of the problem, we introduce a softmax-based proximal policy optimization with long-short-term memory (SoftPPO-LSTM) algorithm to intelligently select CB nodes for improving transmission efficiency. Simulation results show that the proposed OMRP improves network lifetime by 17% compared to benchmark routing protocols, while the SoftPPO-LSTM method for CB node selection achieves an 8.3% increase in throughput over benchmark algorithms. The results also reveal that the combined OMRP with the SoftPPO-LSTM method effectively mitigates hot spot problems and offers superior performance compared to traditional strategies. © 2014 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Dual Space Representation Learning for Skeleton-based Action Recognition

引用

IEEE Signal Processing Letters 2025年 32卷 2104-2108页

作者： Yang, Yuheng Chen, Haipeng Liu, Zhenguang Hu, Sihao Jiao, Yingying Jilin University College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Zhejiang University School of Cyber Science and Technology Hangzhou310007 China Georgia Institute of Technology College of Computing GA United States

Skeleton-based action recognition is crucial for machine intelligence. Current methods generally learn from 3D articulated motion sequences in the straightforward Euclidean space. Yet, the vanilla Euclidean space may not be the optimal choice for modeling the intricate correlations among human body joints. This challenge arises from the non-Euclidean nature of human anatomy, where joint correlations often vary non-linearly during movement. To address this, we propose a dual space representation learning method. Specifically, we represent the motion sequences in Hyperbolic space, leveraging its intrinsic properties to capture the non-Euclidean latent anatomy of human motions. We then incorporate the motion features from both Hyperbolic and Euclidean spaces, allowing us to precisely model the non-linear joint correlations while effectively sketching human poses. The proposed method empirically achieves state-of-the-art performance on the NTU RGB+D 60, NTURGB+D 120, and NW-UCLA datasets. © 1994-2012 IEEE.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

A PARALLEL DOMAIN DECOMPOSITION METHOD FOR SOLVING ELLIPTIC EQUATIONS ON MANIFOLDS

引用

SIAM Journal on Scientific Computing 2025年第2期47卷 A916-A942页

作者： Qin, Lizhen Wang, Feng Wang, Yun School of Mathematics Nanjing University Nanjing210093 China Key Laboratory of Numerical Simulation of Large Scale Complex Systems Nanjing Normal University Ministry of Education Nanjing210023 China Jiangsu International Joint Laboratory of Big Data Modeling Computing and Application Nanjing Normal University Nanjing210023 China School of Mathematical Sciences Nanjing Normal University Nanjing210023 China School of Mathematical Sciences Center for Dynamical Systems and Differential Equations Soochow University Suzhou215006 China

We propose a new numerical domain decomposition method for solving elliptic equations on compact Riemannian manifolds. One advantage of this method is its ability to bypass the need for global triangulations or grids on the manifolds. Additionally, it features a highly parallel iterative scheme. To verify its efficacy, we conduct numerical experiments on some four-dimensional manifolds without and with boundary. © 2025 Society for Industrial and Applied Mathematics Publications. All rights reserved.

关键词： Domain decomposition methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：