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

14th International Conference on Digital Image Processing, ICDIP 2022

作者： Xiao, Hongli Wang, Bingshu Zheng, Jiangbin Fang, Jin Liu, Zhulin Philip Chen, C.L. School of Software Northwestern Polytechnical University Xi’an710129 China State Key Lab of IOTSC University of Macau 999078 China School of Computer Science and Engineering South China University of Technology Guangzhou510641 China Pazhou Lab Guangzhou510335 China

ISBN: (纸本)9781510657564

COVID-19 and its variants have been posing a large risk to people around the world since the outbreak of the disease. Many techniques like AI are explored to help combat epidemics. People are required or forced to wear a mask to fight against COVID-19 epidemics worldwide. It brings new challenges to the task of masked facial region recognition. When facial regions are occluded by masks, it will result in some failures of face detection algorithms. In this paper, we propose a method to recognize masked faces. It mainly includes three parts. Firstly, the human pose is estimated to produce a series of key points. It is implemented by OpenPose. Secondly, a key-points location strategy is designed to capture the masked facial regions. It can locate the positions of faces accurately. Thirdly, the broad learning system, which is also an incremental learning algorithm, is employed to recognize the classes of candidate regions. Experiments conducted on some datasets shed light on the effectiveness of the proposed method. © 2022 SPIE.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Towards Better Dynamic Graph Learning: New Architecture and Unified Library

arXiv

引用

arXiv 2023年

作者： Yu, Le Sun, Leilei Du, Bowen Lv, Weifeng State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University China

We propose DyGFormer, a new Transformer-based architecture for dynamic graph learning. DyGFormer is conceptually simple and only needs to learn from nodes’ historical first-hop interactions by: (i) a neighbor co-occurrence encoding scheme that explores the correlations of the source node and destination node based on their historical sequences;(ii) a patching technique that divides each sequence into multiple patches and feeds them to Transformer, allowing the model to effectively and efficiently benefit from longer histories. We also introduce DyGLib, a unified library with standard training pipelines, extensible coding interfaces, and comprehensive evaluating protocols to promote reproducible, scalable, and credible dynamic graph learning research. By performing exhaustive experiments on thirteen datasets for dynamic link prediction and dynamic node classification tasks, we find that DyGFormer achieves state-of-the-art performance on most of the datasets, demonstrating its effectiveness in capturing nodes’ correlations and long-term temporal dependencies. Moreover, some results of baselines are inconsistent with previous reports, which may be caused by their diverse but less rigorous implementations, showing the importance of DyGLib. All the used resources are publicly available at https://***/yule-BUAA/DyGLib. Copyright © 2023, The Authors. All rights reserved.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Cross-center Early Sepsis Recognition by Medical Knowledge Guided Collaborative Learning for Data-scarce Hospitals 23

Cross-center Early Sepsis Recognition by Medical Knowledge G...

引用

2023 World Wide Web Conference, WWW 2023

作者： Ding, Ruiqing Rong, Fangjie Han, Xiao Wang, Leye Key Lab of High Confdence Software Technologies Peking University Ministry of Education China School of Computer Science Peking University Beijing China School of Mathematical Science Peking University Beijing China School of Information Management and Engineering Shanghai University of Finance and Economics Shanghai China

ISBN: (纸本)9781450394161

There are significant regional inequities in health resources around the world. It has become one of the most focused topics to improve health services for data-scarce hospitals and promote health equity through knowledge sharing among medical institutions. Because electronic medical records (EMRs) contain sensitive personal information, privacy protection is unavoidable and essential for multi-hospital collaboration. In this paper, for a common disease in ICU patients, sepsis, we propose a novel cross-center collaborative learning framework guided by medical knowledge, SofaNet, to achieve early recognition of this disease. The Sepsis-3 guideline, published in 2016, defines that sepsis can be diagnosed by satisfying both suspicion of infection and Sequential Organ Failure Assessment (SOFA) greater than or equal to 2. Based on this knowledge, SofaNet adopts a multi-channel GRU structure to predict SOFA values of different systems, which can be seen as an auxiliary task to generate better health status representations for sepsis recognition. Moreover, we only achieve feature distribution alignment in the hidden space during cross-center collaborative learning, which ensures secure and compliant knowledge transfer without raw data exchange. Extensive experiments on two open clinical datasets, MIMIC-III and Challenge, demonstrate that SofaNet can benefit early sepsis recognition when hospitals only have limited EMRs. © 2023 ACM.

关键词： Electronic data interchange

来源：评论

学校读者我要写书评

暂无评论

Ppt4j: Patch Presence Test for Java Binaries 24

Ppt4j: Patch Presence Test for Java Binaries

引用

44th ACM/IEEE International Conference on software engineering, ICSE 2024

作者： Pan, Zhiyuan Hu, Xing Xia, Xin Zhan, Xian Lo, David Yang, Xiaohu Zhejiang University The State Key Laboratory of Blockchain and Data Security Hangzhou China Huawei Software Engineering Application Technology Lab Hangzhou China The Hong Kong Polytechnic University Hong Kong School of Computing and Information Systems Singapore Management University Singapore

ISBN: (纸本)9798400702174

The number of vulnerabilities reported in open source software has increased substantially in recent years. Security patches provide the necessary measures to protect software from attacks and vulnerabilities. In practice, it is difficult to identify whether patches have been integrated into software, especially if we only have binary files. Therefore, the ability to test whether a patch is applied to the target binary, a.k.a. patch presence test, is crucial for practitioners. However, it is challenging to obtain accurate semantic information from patches, which could lead to incorrect results. In this paper, we propose a new patch presence test framework named Ppt4j (Patch Presence Test forJava Binaries). Ppt4j is designed for open-source Java libraries. It takes Java binaries (i.e. bytecode files) as input, extracts semantic information from patches, and uses feature-based techniques to identify patch lines in the binaries. To evaluate the effectiveness of our proposed approach Ppt4j, we construct a dataset with binaries that include 110 vulnerabilities. The results show that Ppt4j achieves an F1 score of 98.5% with reasonable efficiency, improving the baseline by 14.2%. Furthermore, we conduct an in-the-wild evaluation of Ppt4j on JetBrains IntelliJ IDEA. The results suggest that a third-party library included in the software is not patched for two CVEs, and we have reported this potential security problem to the vendor. © 2024 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Pre-trained Model-based Actionable Warning Identification: A Feasibility Study

arXiv

引用

arXiv 2024年

作者： Ge, Xiuting Fang, Chunrong Zhang, Quanjun Wu, Daoyuan Yu, Bowen Zheng, Qirui Guo, An Lin, Shangwei Zhao, Zhihong Liu, Yang Chen, Zhenyu The State Key Laboratory for Novel Software Technology Nanjing University China School of Computer Science and Engineering Nanyang Technological University Singapore

Actionable Warning Identification (AWI) plays a pivotal role in improving the usability of static code analyzers. Currently, Machine Learning (ML)-based AWI approaches, which mainly learn an AWI classifier from labeled warnings, are notably common. However, these approaches still face the problem of restricted performance due to the direct reliance on a limited number of labeled warnings to develop a classifier. Very recently, Pre-Trained Models (PTMs), which have been trained through billions of text/code tokens and demonstrated substantial success applications on various code-related tasks, could potentially circumvent the above problem. Nevertheless, the performance of PTMs on AWI has not been systematically investigated, leaving a gap in understanding their pros and cons. In this paper, we are the first to explore the feasibility of applying various PTMs for AWI. By conducting the extensive evaluation on 10K+ SpotBugs warnings from 10 large-scale and open-source projects, we observe that all studied PTMs are consistently 9.85%∼21.12% better than the state-of-the-art ML-based AWI approaches. Besides, we investigate the impact of three primary aspects (i.e., data preprocessing, model training, and model prediction) in the typical PTM-based AWI workflow. Further, we identify the reasons for current PTMs’ underperformance on AWI. Based on our findings, we provide several practical guidelines to enhance PTM-based AWI in future work. Copyright © 2024, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Unlearnable 3D Point Clouds: Class-wise Transformation Is All You Need 38

Unlearnable 3D Point Clouds: Class-wise Transformation Is Al...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Wang, Xianlong Li, Minghui Liu, Wei Zhang, Hangtao Hu, Shengshan Zhang, Yechao Zhou, Ziqi Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China

Traditional unlearnable strategies have been proposed to prevent unauthorized users from training on the 2D image data. With more 3D point cloud data containing sensitivity information, unauthorized usage of this new type data has also become a serious concern. To address this, we propose the first integral unlearnable framework for 3D point clouds including two processes: (i) we propose an unlearnable data protection scheme, involving a class-wise setting established by a category-adaptive allocation strategy and multi-transformations assigned to samples;(ii) we propose a data restoration scheme that utilizes class-wise inverse matrix transformation, thus enabling authorized-only training for unlearnable data. This restoration process is a practical issue overlooked in most existing unlearnable literature, i.e., even authorized users struggle to gain knowledge from 3D unlearnable data. Both theoretical and empirical results (including 6 datasets, 16 models, and 2 tasks) demonstrate the effectiveness of our proposed unlearnable framework. Our code is available at https://***/CGCL-codes/UnlearnablePC. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TRANSFORMER-PATCHER: ONE MISTAKE WORTH ONE NEURON 11

TRANSFORMER-PATCHER: ONE MISTAKE WORTH ONE NEURON

引用

11th International Conference on Learning Representations, ICLR 2023

作者： Huang, Zeyu Shen, Yikang Zhang, Xiaofeng Zhou, Jie Rong, Wenge Xiong, Zhang State Key Laboratory of Software Development Environment Beihang University China Sino-French Engineer School Beihang University China School of Computer Science and Engineering Beihang University China Mila University of Montreal Canada WeChat AI Tencent Inc. China

Large Transformer-based Pretrained Language Models (PLMs) dominate almost all Natural Language Processing (NLP) tasks. Nevertheless, they still make mistakes from time to time. For a model deployed in an industrial environment, fixing these mistakes quickly and robustly is vital to improve user experiences. Previous works formalize such problems as Model Editing (ME) and mostly focus on fixing one mistake. However, the one-mistake-fixing scenario is not an accurate abstraction of the real-world challenge. In the deployment of AI services, there are ever-emerging mistakes, and the same mistake may recur if not corrected in time. Thus a preferable solution is to rectify the mistakes as soon as they appear nonstop. Therefore, we extend the existing ME into Sequential Model Editing (SME) to help develop more practical editing methods. Our study shows that most current ME methods could yield unsatisfying results in this scenario. We then introduce Transformer-Patcher, a novel model editor that can shift the behavior of transformer-based models by simply adding and training a few neurons in the last Feed-Forward Network layer. Experimental results on both classification and generation tasks show that Transformer-Patcher can successively correct up to thousands of errors (Reliability) and generalize to their equivalent inputs (Generality) while retaining the model's accuracy on irrelevant inputs (Locality). Our method outperforms previous fine-tuning and HyperNetwork-based methods and achieves state-of-the-art performance for Sequential Model Editing (SME). The code is available at https://***/ZeroYuHuang/Transform er-Patcher. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词： Network layers

来源：评论

学校读者我要写书评

暂无评论

HetVis: A Visual Analysis Approach for Identifying Data Heterogeneity in Horizontal Federated Learning

引用

IEEE Transactions on Visualization and computer Graphics 2023年第1期29卷 310-319页

作者： Wang, Xumeng Chen, Wei Xia, Jiazhi Wen, Zhen Zhu, Rongchen Schreck, Tobias TMCC CS Nankai University China State Key Lab of CAD&CG Zhejiang University China Laboratory of Art and Archaeology Image Zhejiang University Ministry of Education China School of Computer Science and Engineering Central South University China Graz University of Technology Austria

Horizontal federated learning (HFL) enables distributed clients to train a shared model and keep their data privacy. In training high-quality HFL models, the data heterogeneity among clients is one of the major concerns. However, due to the security issue and the complexity of deep learning models, it is challenging to investigate data heterogeneity across different clients. To address this issue, based on a requirement analysis we developed a visual analytics tool, HetVis, for participating clients to explore data heterogeneity. We identify data heterogeneity through comparing prediction behaviors of the global federated model and the stand-alone model trained with local data. Then, a context-aware clustering of the inconsistent records is done, to provide a summary of data heterogeneity. Combining with the proposed comparison techniques, we develop a novel set of visualizations to identify heterogeneity issues in HFL. We designed three case studies to introduce how HetVis can assist client analysts in understanding different types of heterogeneity issues. Expert reviews and a comparative study demonstrate the effectiveness of HetVis. © 2022 IEEE.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Probabilistic-Search and Neighbor-Density Based Doppler-Shift Acquisition in Space Communications

引用

IEEE Transactions on Communications 2025年

作者： Zhang, Zhaowei Du, Shuai Liu, Lin Liu, Hui Zuo, Jiakuo Miao, Wang Zhao, Haitao Nanjing University of Posts and Telecommunications School of Internet of Things China Nanjing University State Key Laboratory for Novel Software Technology China Jinling Institute of Technology School of Software Engineering China University of Exeter Department of Computer Science United Kingdom

In space communications, the signal's long-distance transmission between a flying transmitter-receiver pair encounters two obstacles: a huge path-loss and a high-speed movement. The huge path-loss results in a low signal-to-noise ratio (SNR) and the high-speed movement brings a dynamic Doppler-shift, thus posing a great challenge for Doppler-shift acquisition. Under the low SNR, the Doppler-shift acquisition has to accumulate many symbols in a long-time period. However, during this period, the dynamic Doppler-shift disperses all these symbols' total energy over a wide range, thus causing the energy dispersion problem. To address this problem, we propose a probabilistic-search and neighbor-density (PSND) scheme, where the probabilistic-search considers the element's amplitude and sacrifices some redundant signal elements for a narrower search-range, while the neighbordensity sums the signal element's all neighbors for a larger signal energy. The PSND scheme includes two algorithms: the Generic PSND and Iterative PSND. The Generic PSND algorithm first selects some search-elements with their probabilities to construct a probabilistic-search-range, then selects some density-elements with their neighbor-elements to derive the neighbor-densities, and finally searches the largest neighbor-density to obtain the acquisition result. Built upon the Generic PSND algorithm above, the Iterative PSND algorithm iteratively updates the searchelements to further strengthen the neighbor-density in a narrower probabilistic-search-range. Moreover, the simulations results have demonstrated our PSND scheme's higher acquisition probability, as compared with the existing schemes. © 1972-2012 IEEE.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Online crowdsourced truck delivery using historical information

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2022年第2期301卷 486-501页

作者： Zhang, Huili Luo, Kelin Xu, Yao Xu, Yinfeng Tong, Weitian [a]School of Management Xi’an Jiaotong University and State Key Lab for Manufacturing Systems Engineering Xi’an 710049 China [b]Department of Mathematics and Computer Science Eindhoven University of Technology Eindhoven the Netherlands [c]Department of Computer Science Georgia Southern University Statesboro GA 30458 USA

Various crowdsourced logistics platforms are forming rapidly along with the booming mobile Internet. Motivated by modern crowdsourced truck logistics platforms, we introduce the online crowdsourced truck delivery (OCTD) problem and reformulate it as the online bipartite hyper-matching problem. We then explore the possibility of accommodating historical information to design efficient online algorithms to serve online orders. To the best of our knowledge, it is the first work on incorporating historical information to solve the online bipartite hyper-matching problem. Depending on whether orders can be partially served, we investigate two practical situations, i.e. separable and inseparable cases. For the inseparable case, we propose a randomized online algorithm, named HYPER-MATCHING , whose competitive ratio is a non-decreasing function of the amount of historical information. For the separable case, we modify HYPER-MATCHING to present another randomized online algorithm, named SEPARABLE-HYPER-MATCHING . It is worth noting that the competitive ratios of HYPER-MATCHING and SEPARABLE-HYPER-MATCHING either beat or match the current best online algorithms when no historical information is considered. We then present four computationally efficient heuristic algorithms, including a greedy variant and a batch processing variant for each of the inseparable and separable cases. We perform a sequence of experiments using synthetic and real-world datasets, with an emphasis on the influence that historical information has on algorithm performance. The experiment results demonstrate the effectiveness of our algorithms and particularly the positive influence of historical information on our algorithms.(c) 2021 Elsevier B.V. All rights reserved.

关键词： Transportation Online crowdsourced truck delivery Online bipartite hyper-matching Random order model Historical information

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：