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

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Wang, Xiaoli Huang, Anqi Wang, Yongli Ke, Guanzhou Hong, Xiaobin Liu, Jun School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210000 China School of Economics and Management Beijing Jiaotong University Beijing100080 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China School of Computing and Communications Lancaster University Lancaster United Kingdom

ISBN: (纸本)157735897X

Partial multi-view classification (PMvC) poses a significant challenge due to the incomplete nature of multi-view data, which complicates effective information fusion and accurate classification. Existing PMvC methods typically rely on heuristic evaluations of view informativeness to achieve global alignment for downstream classification tasks. However, these approaches suffer from two critical issues: information redundancy and semantic misalignment. The complexity of missing data not only leads to over-reliance on redundant or less informative views but also exacerbates semantic misalignment across views, making it difficult for existing methods to effectively capture and discriminate the task-related features. To address these issues, this work proposes a novel GLobal-semantic Alignment Distillation (GLAD) paradigm for partial multi-view classification, implemented in an imputation-free manner. Our approach incorporates a self-distillation mechanism that enables the model to extract informative features and achieve global semantic alignment across views. The key insight of GLAD is leveraging the ground truth as semantic anchors to guide the alignment of partial multi-view features. By integrating the high-level semantics with extracted features via a cross-attention mechanism, we generate ideal embeddings that consistently capture global semantics across views. These embeddings then serve as intermediate supervision for distilling the student model, ensuring robust semantic alignment even with missing views. Furthermore, we introduce a margin-aware weighting strategy to enhance the model’s discriminative ability. Extensive experimental results validate the effectiveness and superiority of the proposed method, showcasing significant improvements in classification performance over existing techniques. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

Ant: An Efficient Lossless Compression Algorithm for IoT Time Series Data 21

Ant: An Efficient Lossless Compression Algorithm for IoT Tim...

引用

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

作者： Li, Junhui Xu, Guangping Yang, Hongzhang Wu, Yulei Tianjin University of Technology School of Computer Science and Engineering Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin China Key Laboratory of Computer Vision and System Ministry of Education China University of Bristol Faculty of Science and Engineering Bristol United Kingdom

ISBN: (纸本)9798350329223

In various applications in Internet of Things like industrial monitoring, large amounts of floating-point time series data are generated at an unprecedented rate. Efficient compression algorithms can effectively reduce the size of data, enhance transmission performance and storage efficiency, and simultaneously lower storage costs. Therefore, there is a need for lightweight and efficient stream compression algorithms. In this paper, we propose a novel lossless floating-point data compression algorithm called Ant. The main idea is to encode double-precision floating-point numbers into integer form, calculate the delta between adjacent values, and then convert the delta into unsigned integers. This encoding method effectively reduces storage costs and improves data compression efficiency. Extensive experiments on real-world datasets demonstrate that our algorithm achieves compression speeds at least as fast as state-of-the-art streaming methods, and a 63% relative improvement in average compression rate. © 2023 IEEE.

关键词： Storage efficiency

来源：评论

学校读者我要写书评

暂无评论

SQCC: Stable Queue Congestion Control 14

SQCC: Stable Queue Congestion Control

引用

14th International Conference on Network of the Future, NoF 2023

作者： Tang, Jian Xu, Tingting Wang, Liming Lin, Zhenjie Zhao, Ming Wang, Xiaoliang Nguyen, Cam-Tu Tian, Chen Qian, Zhuzhong Li, Wenzhong Nanjing University State Key Laboratory for Novel Software Technology China Csg China Southern Power Grid Digital Platform Technology Company China

ISBN: (纸本)9798350338072

The advent of high-speed networks has revolutionized data center capabilities by providing low latency and high bandwidth for applications. However, traditional TCP congestion control algorithms are no longer adequate for data center networks. RTT-based congestion control leverages advanced NIC hardware to identify accumulated queuing delay of the end-to-end path. It is simple, effective, and adaptable to different environments. Nevertheless, RTT-based congestion control faces challenges related to unstable queue length and oscillation caused by RTT feedback delays. With the increase of queue length, the oscillation range also amplifies. To address these issues, we propose SQCC, which introduces two key enhancements. Firstly, it employs a novel error function to regulate the queue length within a controlled range that is proportional to the number of incast flows. Secondly, it incorporates self-adjustable parameters for rate increment and RTT threshold, effectively managing queue oscillation and ensuring a non-empty link. We evaluate the algorithm's effectiveness through NS3 network simulations, and the results demonstrate that SQCC achieves an 80% reduction in queue size upon convergence and exhibits a significantly low oscillation range (27% to 57%) in large-scale incast scenarios. © 2023 IEEE.

关键词： HIgh speed networks

来源：评论

学校读者我要写书评

暂无评论

MIRNet: A Robust RGBT Tracking Jointly with Multi-Modal Interaction and Refinement

MIRNet: A Robust RGBT Tracking Jointly with Multi-Modal Inte...

引用

2022 IEEE International Conference on Multimedia and Expo, ICME 2022

作者： Hou, Ruichao Ren, Tongwei Wu, Gangshan Nanjing University State Key Laboratory for Novel Software Technology Nanjing China

ISBN: (数字)9781665485630

ISBN: (纸本)9781665485630

RGBT tracking attempts to design a robust all-weather tracker by integrating the complementary features of visible and thermal spectrums. To explore the latent interdependencies across modalities, we propose a novel real-time tracker named MIR-Net, which contains a multi-modal interaction module (MIM) and a refinement mechanism (RM), thereby adaptively merging multi-modal features and achieving precise scale estimation. Specifically, to enhance instance representation in low-quality modality, the MIM reinforces discriminative features from one modality to another in a bidirectional way. Considering the negative effects of unreliable modality, we further introduce a gate function in MIM to filter redundancy. To address the problem of random drifting and estimate the precise scale in the online tracking, we present a well-designed RM that combines optical flow and refinement network. Comprehensive experiments on two public RGBT benchmarks validate that our tracker outperforms the state-of-the-art methods. © 2022 IEEE.

关键词： Optical flows

来源：评论

学校读者我要写书评

暂无评论

Sequence generation model of traditional Chinese medicine 12

Sequence generation model of traditional Chinese medicine

引用

12th International Conference on Information technology in Medicine and Education, ITME 2022

作者： Duan, Chengzhi Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan China

ISBN: (纸本)9798350310153

The application of artificial intelligence in the field of traditional Chinese medicine is more and more extensive, and the related research is also more and more. Increasingly, the electronic processing of TCM textual information is becoming more and more important. In this paper, we propose a TCM text-based prescription generation task, intending to be able to implement automatic prescription generation functions based on the sequence-to-sequence (seq2seq) model. Traditional TCM prescriptions are given by the attending physicians, and the prescription recommendation system proposed in this paper achieves a certain degree of accuracy compared to real doctors. After a series of system data training, we improved the accuracy rate to 76%. For FI the value reached the best result of 74% at the existing stage. © 2022 IEEE.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Hardware Computation Graph for DNN Accelerator Design Automation Without Inter-PU Templates

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Li, Jun Wang, Wei Li, Wu-Jun Nanjing University National Key Laboratory for Novel Software Technology School of Computer Science Jiangsu Nanjing210023 China

Existing deep neural network (DNN) accelerator design automation (ADA) methods adopt architecture templates to predetermine parts of design choices and then explore the remaining design choices beyond templates. Based on the architecture hierarchy at the processing unit (PU) level, these templates can be classified into intra-PU templates and inter-PU templates. Since templates limit the flexibility of ADA, designing effective ADA methods without templates has become an important research topic. Although there have appeared some works to enhance the flexibility of ADA by removing intra-PU templates, to the best of our knowledge no existing works have studied ADA methods without inter-PU templates. ADA with predetermined inter-PU templates is typically inefficient in terms of resource utilization, especially for DNNs with complex topology. In this paper, we propose a novel method, called hardware computation graph (HCG), for ADA without inter-PU templates. In HCG, a novel inter-PU architecture exploration strategy is proposed to optimize on-chip memory utilization. This strategy mainly depends on an appearing-frequency guided pruning method and an appearing-frequency first generation method. Experiments show that HCG can achieve competitive latency while using only 13% ⁓ 90% of on-chip memory, compared with existing state-of-the-art ADA methods. © 1982-2012 IEEE.

关键词： Integrated circuit design

来源：评论

学校读者我要写书评

暂无评论

DIG: Improved DINO for Graffiti Detection

引用

IEEE Transactions on Systems, Man, and Cybernetics: Systems 2025年第5期55卷 3557-3569页

作者： Wang, Bingshu Mao, Qianchen Liu, Aifei Chen, Long Chen, C. L. Philip Northwestern Polytechnical University School of Software Xi’an710129 China Shenzhen University Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security Shenzhen518060 China University of Macao Department of Computer and Information Science China South China University of Technology School of Computer Science and Engineering Guangzhou510641 China

Graffiti detection is essential in historic building protection and urban neighborhood management. Graffiti detection has made significant progress in recent years based on the development of deep learning. However, small-scale graffiti, interference from the background, and the false detection of word parts in graffiti make it a challenging problem. This article proposes a Transformer-based high-precision graffiti detection method, namely DIG. Precisely, it consists of three modules: 1) Spatial query selection (SQS), scale-aware IoU loss (SIL);2) Denoising Task with binary contrastive denoising (BCDN);and 3) IoU-guided box denoising (IBD) modules. To detect small-scale graffiti, this paper proposes SIL to help the loss function to perceive small-scale graffiti and large-scale graffiti fairly. To reduce the false detection of word parts, this article presents the SQS module, which integrates spatial information into the query selection process of the Encoder to filter out falsely detected bounding boxes within the graffiti. To reduce the interference from the background, this article introduces a denoising task with BCDN and IBD modules, improving the model’s ability to distinguish graffiti from the background and accurately select appropriate bounding boxes. A large number of experimental results on the STORM dataset show that our method achieves state-of-the-art results with an AP50 of 87.9%. Moreover, DIG achieved competitive results on the FineFM dataset for mask detection. This indicates that DIG can also be conveniently transferred to detect other scenarios. © 2013 IEEE.

关键词： Historic preservation

来源：评论

学校读者我要写书评

暂无评论

A new method to analyze visual efficiency in interactive web environment

A new method to analyze visual efficiency in interactive web...

引用

2023 International Conference on computer Graphics, Artificial Intelligence, and Data Processing, ICCAID 2023

作者： Lv, Wen Li, Tingting Xie, Zhenping School of Artificial Intelligence and Computer Science Jiangnan University China Jiangsu Key Laboratory of Media Design and Software Technology China

ISBN: (纸本)9781510677685

Interactive web interfaces are widely used, yet users often struggle to discover important and useful information. Psychologists have pointed out that in the process of human visual perception, the global topological characteristics of objects will be perceived first. In this study, we propose a cognitive experiment system to explore what object properties affect visual efficiency in interactive web environments. Our experimental results showed that, first, if a small number of colors are allocated to different objects, these objects could be more effectively memorized than no color or too many colors. Second, in static single-page, different topology structures will not cause apparently different visual attraction, however, topological structural differences could be stronger memorized. Third, in dynamic HTML, the motion changes will induce stronger visual attention and memory intensity, than their own topology changes. Subsequently, we verified the feasibility of the experiment system in real webpages and demonstrated that the above results can theoretically guide better web interaction design works with less cognitive load of users, higher operation efficiency and more natural user experience. In addition, some design reference suggestions are also provided in our study. © 2024 SPIE.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

SAT-based Formal Verification of Fault Injection Countermeasures for Cryptographic Circuits∗

IACR Transactions on Cryptographic Hardware and Embedded Sys...

引用

IACR Transactions on Cryptographic Hardware and Embedded Systems 2024年第4期2024卷 1-39页

作者： Tan, Huiyu Gao, Pengfei Song, Fu Chen, Taolue Wu, Zhilin ShanghaiTech University Shanghai201210 China Wingsemi Technology Co. Ltd. Shanghai201203 China Bytedance Beijing100098 China Key Laboratory of System Software Chinese Academy of Sciences and State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing100190 China Nanjing Institute of Software Technology Nanjing211135 China Birkbeck University of London WC1E 7HX United Kingdom

Fault injection attacks represent a type of active, physical attack against cryptographic circuits. Various countermeasures have been proposed to thwart such attacks, however, the design and implementation of which are intricate, error-prone, and laborious. The current formal fault-resistance verification approaches are limited in efficiency and scalability. In this paper, we formalize the fault-resistance verification problem and show that it is coNP-complete. We then devise a novel approach for encoding the fault-resistance verification problem as the Boolean satisfiability (SAT) problem so that modern off-the-shelf SAT solvers can be utilized. The approach is implemented in an open-source tool FIRMER which is evaluated extensively on realistic cryptographic circuit benchmarks. The experimental results show that FIRMER is able to verify fault-resistance of almost all (72/76) benchmarks in 3 minutes (the other three are verified in 35 minutes and the hardest one is verified in 4 hours). In contrast, the prior approach fails on 31 fault-resistance verification tasks even after 24 hours (per task). © 2024, Ruhr-University of Bochum. All rights reserved.

关键词： Formal verification

来源：评论

学校读者我要写书评

暂无评论

Thoth: Provisioning Over-Committed Memory Resource with Differentiated QoS in Public Clouds 25

Thoth: Provisioning Over-Committed Memory Resource with Diff...

引用

25th IEEE International Conferences on High Performance Computing and Communications, 9th International Conference on Data science and Systems, 21st IEEE International Conference on Smart City and 9th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC/DSS/SmartCity/DependSys 2023

作者： Tang, Wenda Zhu, Jiazhen Ai, Tianxiang Li, Guanghui Yu, Bin Yang, Xin Dou, Wanchun China Telecom ESurfing Cloud Beijing China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China

ISBN: (纸本)9798350330014

Due to workload fluctuation in virtualized systems running multiple Virtual Machines (VMs), tenants often allocate more memory than actually used to handle peak memory demands. Memory adjustment by reclaiming inactive memory in VMs is an effective way to enable memory overcommitment so as to improve memory utilization and reduce the cost. However, memory overcommitment may increase the chance of swapping and thus results in performance degradation. While prior work has proposed a variety of memory adjustment schemes to try to guarantee the performance of workloads, it still remains unexplored to reduce disparity in performance across co-located VMs during dynamic memory adjustment and investigate the chance of far memory support to release memory pressure by orchestrating rack-level stranded memory. To bridge the gap, we propose Thoth, a rack-level memory resource orchestrator that enables a fairness-aware memory adjustment scheme to guarantee differentiated performance across all co-located workloads within each physical server while opportunistically leveraging available far memory to reduce the performance degradation of workloads from traditional SSD- based swapping. Thoth adopts a credit-based resource allocation strategy cross all co-located VMs to maintain a long-term fairness and reduce disparity in performance. Thoth is evaluated with typical cloud applications in our data center environment. The results show that Thoth could improve the performance of latency-critical workloads by 3 x on average. © 2023 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：