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

IEEE Transactions on Artificial Intelligence 2023年第1期4卷 148-160页

作者： Pan, Zhaoqing Yuan, Feng Wang, Xu Xu, Long Shao, Xiao Kwong, Sam the School of Electrical and Information Engineering Tianjin University Tianjin300072 China the College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China the Key Laboratory of Solar Activity National Astronomical Observatories Chinese Academy of Sciences Beijing100012 China the School of Computer and Software Nanjing University of Information Science and Technology Nanjing210044 China the Department of Computer Science City University of Hong Kong Hong Kong

No-reference image quality assessment (NR-IQA) aims to evaluate image quality without using the original reference images. Since the early NR-IQA methods based on distortion types were only applicable to specific distortion scenarios, and lack of practicality, it is challenging to designing a universal NR-IQA method. In this article, a multibranch convolutional neural network (MB-CNN) based NR-IQA method is proposed, which includes a spatial-domain feature extractor, a gradient-domain feature extractor, and a weight mechanism. The spatial-domain feature extractor aims to extract the distortion features from the spatial domain. The gradient-domain feature extractor is used to guide the spatial-domain feature extractor to pay more attention to the distortions of the structure information. Particularly, the spatial-domain feature extractor uses the hierarchical feature merge module to realize multiscale feature representation, and the gradient-domain feature extractor uses pyramidal convolution to extract the multiscale structure information of the distorted image. In addition, a position vector is proposed to build the weight mechanism by considering the position relationships between patches and its entire image for improving the final prediction performance. We conduct the experiments on five representative databases: LIVE, TID2013, CSIQ, LIVE MD and Waterloo Exploration Database, and the experimental results show that the proposed NR-IQA method achieves the state-of-the-art performance, which demonstrate the effectiveness of our proposed NR-IQA method. The code ofthe proposed MB-CNN will be released at https://***/NUIST-Videocoding/MB-CNN. © 2020 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

NfvInsight:A Framework for Automatically Deploying and Benchmarking VNF Chains

引用

Journal of computer science & technology 2022年第3期37卷 680-698页

作者： Tian-Ni Xu Hai-Feng Sun Di Zhang Xiao-Ming Zhou Xiu-Feng Sui Sa Wang Qun Huang Yun-Gang Bao State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China School of Information and Electronics Beijing Institute of TechnologyBeijing 100081China Peng Cheng Laboratory Shenzhen 518055China Department of Computer Science and Technology Peking UniversityBeijing 100871China

With the advent of virtualization techniques and software-defined networking(SDN),network function virtualization(NFV)shifts network functions(NFs)from hardware implementations to software appliances,between which exists a performance *** to narrow the gap is an essential issue of current NFV ***,the cumbersomeness of deployment,the water pipe effect of virtual network function(VNF)chains,and the complexity of the system software stack together make it tough to figure out the cause of low performance in the NFV *** pinpoint the NFV system performance,we propose NfvInsight,a framework for automatic deployment and benchmarking VNF *** framework tackles the challenges in NFV performance *** framework components include chain graph generation,automatic deployment,and fine granularity *** design and implementation of each component have their *** the best of our knowledge,we make the first attempt to collect rules forming a knowledge base for generating reasonable chain *** deploys the generated chain graphs automatically,which frees the network operators from executing at least 391 lines of bash commands for a single *** diagnose the performance bottleneck,NfvInsight collects metrics from multiple layers of the software ***,we collect the network stack latency distribution ingeniously,introducing only less than 2.2%*** showcase the convenience and usability of NfvInsight in finding bottlenecks for both VNF chains and the underlying *** our framework,we find several design flaws of the network stack,which are unsuitable for packet forwarding inside one single server under the NFV *** optimization for these flaws gains at most 3x performance improvement.

关键词： network function virtualization(NFV) service chain performance bottleneck network stack latency

来源：评论

学校读者我要写书评

暂无评论

Differentially Private K-Means Publishing with Distributed Dimensions

Differentially Private K-Means Publishing with Distributed D...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Boyu Zhu Yuan Zhang Tingting Chen Sheng Zhong Computer Science and Technology Department State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Computer Science Department College of Science California State Polytechnic University Pomona USA

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

In this paper, we address the critical concerns related to dataset privacy in the context of k-means clustering publishing within a distributed dimension setting. By leveraging differential privacy mechanisms, we propose a novel framework that integrates a differentially private classifier, constructed through voting based on raw clustering results, and an enhanced generative adversarial network (GAN) simulating the classifier’s behavior in inferring class labels for a public dataset. Our approach generates synthetic clustering results that mimic real outcomes in classification tasks, ensuring differential privacy and minimizing noise. Our contributions include a comprehensive exploration of privacy issues, the introduction of a novel privacy-preserving k-means clustering framework, and theoretical analyses demonstrating sensitivity and differential privacy guarantees. Evaluation on the MNIST dataset demonstrates the effectiveness of the framework, achieving 82.22% accuracy with a (10.48, 10 −9 )-differential-privacy guarantee, compared to 83.45% accuracy without privacy-preserving.

关键词： Differential privacy Privacy Accuracy Sensitivity Publishing Federated learning Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Energy-Guided Diffusion Sampling for Offline-to-Online Reinforcement Learning 41

Energy-Guided Diffusion Sampling for Offline-to-Online Reinf...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Liu, Xu-Hui Liu, Tian-Shuo Jiang, Shengyi Chen, Ruifeng Zhang, Zhilong Chen, Xinwei Yu, Yang National Key Laboratory for Novel Software Technology Nanjing University China School of Artificial Intelligence Nanjing University China Polixir Technologies China Department of Computer Science The University of Hong Kong Hong Kong

Combining offline and online reinforcement learning (RL) techniques is indeed crucial for achieving efficient and safe learning where data acquisition is expensive. Existing methods replay offline data directly in the online phase, resulting in a significant challenge of data distribution shift and subsequently causing inefficiency in online fine-tuning. To address this issue, we introduce an innovative approach, Energy-guided DIffusion Sampling (EDIS), which utilizes a diffusion model to extract prior knowledge from the offline dataset and employs energy functions to distill this knowledge for enhanced data generation in the online phase. The theoretical analysis demonstrates that EDIS exhibits reduced suboptimality compared to solely utilizing online data or directly reusing offline data. EDIS is a plug-in approach and can be combined with existing methods in offline-to-online RL setting. By implementing EDIS to off-the-shelf methods Cal-QL and IQL, we observe a notable 20% average improvement in empirical performance on MuJoCo, AntMaze, and Adroit environments. Code is available at https://***/liuxhym/EDIS. Copyright 2024 by the author(s)

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

CIXG: A Comprehensive Approach to Driver Gene Identification and Causal Interpretation

CIXG: A Comprehensive Approach to Driver Gene Identification...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Liu, Yawen Chen, Yiwen Nie, Shanling Yang, Hai East China University of Science and Technology Department of Computer Science and Engineering Shanghai China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China National University of Singapore Center for Continuing and Lifelong Education Singapore University of Sydney Faculty of Engineering Australia

ISBN: (纸本)9798350386226

With the ongoing advancements in science and technology and the increasing research focus on cancer-related issues, there has been a proliferation of omics-related resources for in-depth analysis and exploration. This burgeoning volume and complexity of biological data have fostered the integration of machine-learning techniques into biology. As a result, numerous machine-learning strategies have been established to identify driver mutations. Yet, many of these strategies produce complex models, complicating comprehension and thereby clouding the impact of input features on the resulting predictions. Our analysis presented the CIXG framework, which integrates a driver gene prediction module using XGBoost with a causality interpretation module anchored on CXPlain. This architecture enables quantifying each input feature's contribution to the prediction outcome and ensures precise predictions of driver genes. When benchmarked against the state-of-the-art (SOTA) method, CIXG demonstrated superior accuracy in pinpointing driver genes across pan-cancer studies and within the 32 specific cancer types. Importantly, our results underscored that mutation features chiefly influence CIXG's predictive prowess, with additional support from other omics features. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Learning Order Forest for Qualitative-Attribute Data Clustering 27

Learning Order Forest for Qualitative-Attribute Data Cluster...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Zhao, Mingjie Feng, Sen Zhang, Yiqun Li, Mengke Lu, Yang Cheung, Yiu-Ming School of Computer Science and Technology Guangdong University of Technology Guangzhou China Shenzhen China School of Computer Science and Software Engineering Shenzhen University Shenzhen China Fujian Key Laboratory of Sensing and Computing for Smart City School of Informatics Xiamen University China Key Laboratory of Multimedia Trusted Perception and Efficient Computing Ministry of Education of China Xiamen University China Department of Computer Science Hong Kong Baptist University Hong Kong

ISBN: (纸本)9781643685489

Clustering is a fundamental approach to understanding data patterns, wherein the intuitive Euclidean distance space is commonly adopted. However, this is not the case for implicit cluster distributions reflected by qualitative attribute values, e.g., the nominal values of attributes like symptoms, marital status, etc. This paper, therefore, discovered a tree-like distance structure to flexibly represent the local order relationship among intra-attribute qualitative values. That is, treating a value as the vertex of the tree allows to capture rich order relationships among the vertex value and the others. To obtain the trees in a clustering-friendly form, a joint learning mechanism is proposed to iteratively obtain more appropriate tree structures and clusters. It turns out that the latent distance space of the whole dataset can be well-represented by a forest consisting of the learned trees. Extensive experiments demonstrate that the joint learning adapts the forest to the clustering task to yield accurate results. Comparisons of 10 counterparts on 12 real benchmark datasets with significance tests verify the superiority of the proposed method. Source code of the proposed method is available at [39]. © 2024 The Authors.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Differentiate Xp11.2 Translocation Renal Cell Carcinoma from Computed Tomography Images and Clinical Data with ResNet-18 CNN and XGBoost

引用

computer Modeling in Engineering & sciences 2023年第7期136卷 347-362页

作者： Yanwen Lu Wenliang Ma Xiang Dong Mackenzie Brown Tong Lu Weidong Gan Department of Urology Nanjing Drum Tower HospitalThe Affiliated Hospital of Nanjing University Medical SchoolNanjing210008China School of Data Science Perdana UniversitySerdang43400Malaysia State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing210008China

This study aims to apply ResNet-18 convolutional neural network(CNN)and XGBoost to preoperative computed tomography(CT)images and clinical data for distinguishing Xp11.2 translocation renal cell carcinoma(Xp11.2 tRCC)from common subtypes of renal cell carcinoma(RCC)in order to provide patients with individualized treatment *** from45 patients with Xp11.2 tRCC fromJanuary 2007 to December 2021 are *** cell RCC(ccRCC),papillary RCC(pRCC),or chromophobe RCC(chRCC)can be detected from each *** images are acquired in the following three phases:unenhanced,corticomedullary,and nephrographic.A unified framework is proposed for the classification of renal *** this framework,ResNet-18 CNN is employed to classify renal cancers with CT images,while XGBoost is adopted with clinical *** demonstrate that,if applying ResNet-18 CNN or XGBoost singly,the latter outperforms the former,while the framework integrating both technologies performs similarly or better than ***,the possibility of misclassifying Xp11.2 tRCC,pRCC,and chRCC as ccRCC by the proposed framework is much lower than urologists.

关键词： ResNet-18 CNN XGBoost computed tomography TFE3 renal cell carcinoma

来源：评论

学校读者我要写书评

暂无评论

Weighting Online Decision Transformer with Episodic Memory for Offline-to-Online Reinforcement Learning

Weighting Online Decision Transformer with Episodic Memory f...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Xiao Ma Wu-Jun Li Department of Computer Science and Technology National Key Laboratory for Novel Software Technology Nanjing University Nanjing PRC

ISBN: (数字)9798350384574

ISBN: (纸本)9798350384581

Offline reinforcement learning (RL) has been shown to be successfully modeled as a sequence modeling problem, drawing inspiration from the success of Transformers. Offline RL is often limited by the quality of the offline dataset, so offline-to-online RL is a more realistic setting. Online decision transformer (ODT) is an effective and representative sequence modeling-based offline-to-online RL method. Despite its effectiveness, ODT still suffers from the sample inefficiency problem during the online fine-tuning phase. This sample inefficiency problem arises because the agent treats all state-action pairs in the replay buffer equally when trying to learn from the replay buffer. In this paper, we propose a simple yet effective method, called weighting online decision transformer with episodic memory (WODTEM), to improve sample efficiency. We first attempt to introduce an episodic memory (EM) mechanism into the sequence modeling-based RL methods. By utilizing the EM mechanism, we propose a novel training objective with a weighting function, based on ODT, to improve sample efficiency. Experimental results on multiple tasks show that WODTEM can improve sample efficiency.

关键词： Training Memory management Reinforcement learning Transformers Task analysis Robotics and automation

来源：评论

学校读者我要写书评

暂无评论

PIP: Perturbation-based Iterative Pruning for Large Language Models

arXiv

引用

arXiv 2025年

作者： Cao, Yi Xu, Wei-Jie Shen, Yucheng Shi, Weijie Chan, Chi-Min Xu, Jiajie School of Computer Science and Technology Soochow University China State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong

The rapid increase in the parameter counts of Large Language Models (LLMs), reaching billions or even trillions, presents significant challenges for their practical deployment, particularly in resource-constrained environments. To ease this issue, we propose PIP (Perturbation-based Iterative Pruning), a novel double-view structured pruning method to optimize LLMs, which combines information from two different views: the unperturbed view and the perturbed view. With the calculation of gradient differences, PIP iteratively prunes those that struggle to distinguish between these two views. Our experiments show that PIP reduces the parameter count by approximately 20% while retaining over 85% of the original model’s accuracy across varied benchmarks. In some cases, the performance of the pruned model is within 5% of the unpruned version, demonstrating PIP’s ability to preserve key aspects of model effectiveness. Moreover, PIP consistently outperforms existing state-of-the-art (SOTA) structured pruning methods, establishing it as a leading technique for optimizing LLMs in environments with constrained resources. Our code is available at: https://***/caoyiiiiii/PIP. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Validity-Preserving Delta Debugging via Generator Trace Reduction

arXiv

引用

arXiv 2024年

作者： Ren, Luyao Zhang, Xing Hua, Ziyue Jiang, Yanyan He, Xiao Xiong, Yingfei Xie, Tao Key Laboratory of High Confidence Software Technologies Ministry of Education School of Computer Science Peking University Beijing China State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China School of Computer and Communication Engineering University of Science and Technology Beijing China

Reducing test inputs that trigger bugs is crucial for efficient debugging. Delta debugging is the most popular approach for this purpose. When test inputs need to conform to certain specifications, existing delta debugging practice encounters a validity problem: it blindly applies reduction rules, producing a large number of invalid test inputs that do not satisfy the required specifications. This overall diminishing effectiveness and efficiency becomes even more pronounced when the specifications extend beyond syntactical structures. Our key insight is that we should leverage input generators, which are aware of these specifications, to generate valid reduced inputs, rather than straightforwardly performing reduction on test inputs. In this paper, we propose a generator-based delta debugging method, namely GReduce, which derives validity-preserving reducers. Specifically, given a generator and its execution, demonstrating how the bug-inducing test input is generated, GReduce searches for other executions on the generator that yield reduced, valid test inputs. The evaluation results on five benchmarks (i.e., graphs, DL models, JavaScript programs, SymPy, and algebraic data types) show that GReduce substantially outperforms state-of-the-art syntax-based reducers including Perses and T-PDD, and also outperforms QuickCheck, SmartCheck, as well as the state-of-the-art choice-sequence-based reducer Hypothesis, demonstrating the effectiveness, efficiency, and versatility of GReduce. Copyright © 2024, The Authors. All rights reserved.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：