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

3rd APWeb and WAIM Joint Conference on Web and Big data, APWeb-WAIM 2019

作者： Zhang, Xiaolei Zhang, Chunxi Li, Yuming Zhang, Rong Zhou, Aoying International Research Center of Trustworthy Software Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China School of Data Science and Engineering East China Normal University Shanghai China

ISBN: (纸本)9783030260743

data partition and replication mechanisms directly determine query execution patterns in parallel database systems, which have a great impact on system performance. Recently, there have been some workload-aware data storage techniques, but they suffer from problems of narrow support to complex workloads or large requirements for storage. In order to enable the support for complex analytical workloads over massive distributed database systems, we design and implement a workload-aware data partition and replication tool, called Apara. We design two heuristic algorithms and define two cost models for effective data partition calculation and efficient replication usages. We run a set of experiments to compare and demonstrate the performance between Apara and the other representative work. The results show that Apara consistently outperforms the primary solutions on TPC-H workloads. © 2019, Springer Nature Switzerland AG.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Block Broyden's Methods for Solving Nonlinear Equations 37

Block Broyden's Methods for Solving Nonlinear Equations

引用

37th Conference on Neural Information Processing Systems, NeurIPS 2023

作者： Liu, Chengchang Chen, Cheng Luo, Luo Lui, John C.S. Department of Computer Science & Engineering The Chinese University of Hong Kong Hong Kong Shanghai Key Laboratory of Trustworthy Computing East China Normal University China School of Data Science Fudan University China

ISBN: (纸本)9781713899921

This paper studies quasi-Newton methods for solving nonlinear equations. We propose block variants of both good and bad Broyden's methods, which enjoy explicit local superlinear convergence rates. Our block good Broyden's method has a faster condition-number-free convergence rate than existing Broyden's methods because it takes the advantage of multiple rank modification on Jacobian estimator. On the other hand, our block bad Broyden's method directly estimates the inverse of the Jacobian provably, which reduces the computational cost of the iteration. Our theoretical results provide some new insights on why good Broyden's method outperforms bad Broyden's method in most of the cases. The empirical results also demonstrate the superiority of our methods and validate our theoretical analysis. © 2023 Neural information processing systems foundation. All rights reserved.

关键词： Nonlinear equations

来源：评论

学校读者我要写书评

暂无评论

Tri-level combination for image representation 17th

Tri-level combination for image representation

引用

17th Pacific-Rim Conference on Multimedia, PCM 2016

作者： Li, Ruiying Zhang, Chunjie Huang, Qingming School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783319488899

The context of objects can provide auxiliary discrimination beyond objects. However, this effective information has not been fully explored. In this paper, we propose Tri-level Combination for Image Representation (TriCoIR) to solve the problem at three different levels: object intrinsic, strongly-related context and weakly-related context. Object intrinsic excludes external disturbances and more focuses on the objects themselves. Strongly-related context is cropped from the input image with a more loose bound to contain surrounding context. Weaklyrelated one is recovered from the image other than object for global context. First, strongly and weakly-related context are constructed from input images. Second, we make cascade transformations for more intrinsical object information, which depends on the consistency between generated global context and input images in the regions other than object. Finally, a joint representation is acquired based on these three level features. The experiments on two benchmark datasets prove the effectiveness of TriCoIR. © Springer International Publishing AG 2016.

关键词： Image representation

来源：评论

学校读者我要写书评

暂无评论

DDoS Detection and Defense Based on FLAD and SDN 20

DDoS Detection and Defense Based on FLAD and SDN

引用

20th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2024

作者： Dong, Jie Fang, Wenyu Zheng, Wanling Liu, Jinkun Liu, Yanhua College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China

ISBN: (纸本)9798350356328

In order to achieve more efficient and accurate DDoS detection while ensuring data privacy, this paper proposes a DDoS detection method based on FLAD. Firstly, this paper uses the FLAD algorithm to train a global DDoS detection model without leaving local traffic data, protecting the privacy and security of traffic data between different hosts, and improving aggregation efficiency by dynamically adjusting the aggregation weights to adapt to different sub-dataset increments. Secondly, a DDoS traffic detection method based on the integration of LSTM and CNN is proposed, which extracts and analyzes the temporal correlation of traffic data by calculating the statistical characteristics of traffic data within a time period, to achieve real-time detection of traffic feature data. Again, combined with the concept of SDN, real-time defense against DDoS based on ODL-API is implemented, and precise matching of DDoS detection results with network entity information is achieved, realizing the technology of real-time and precise issuance of multiple flow rules, effectively blocking DDoS malicious attack traffic, protecting important entities in the topology, and maintaining stable traffic in the topology. This paper focuses on solving the detection problem of DDoS traffic data increments and uneven data distribution through the FLAD algorithm. Experimental results show that the proposed method improves the accuracy of DDoS attack detection by more than 4% and the F1 Score by more than 7% compared to the FedAvg aggregation algorithm. © 2024 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Graph Neural Network Enabled Fluid Antenna Systems: A Two-Stage Approach

引用

IEEE Transactions on Vehicular Technology 2025年

作者： He, Changpeng Lu, Yang Chen, Wei Ai, Bo Wong, Kai-Kit Niyato, Dusit State Key Laboratory of Advanced Rail Autonomous Operation China Beijing Jiaotong University School of Computer Science and Technology Beijing 100044 China Beijing Jiaotong University School of Electronics and Information Engineering Beijing 100044 China University College London Department of Electronic and Electrical Engineering London WC1E 6BT United Kingdom Yonsei University Yonsei Frontier Laboratory School of Integrated Technology Seoul 03722 South Korea Nanyang Technological University College of Computing and Data Science 639798 Singapore

An emerging fluid antenna system (FAS) brings a new dimension, i.e., the antenna positions, to deal with the deep fading, but simultaneously introduces challenges related to the transmit design. This paper proposes an “unsupervised learning to optimize” paradigm to optimize the FAS. Particularly, we formulate the sum-rate and energy efficiency (EE) maximization problems for a multiple-user multiple-input single-output (MU-MISO) FAS and solved by a two-stage graph neural network (GNN) where the first stage and the second stage are for the inference of antenna positions and beamforming vectors, respectively. The outputs of the two stages are jointly input into an unsupervised loss function to train the two-stage GNN. The numerical results demonstrate that the advantages of the FAS for performance improvement and the two-stage GNN for real-time and scalable optimization. Besides, the two stages can function separately. © 1967-2012 IEEE.

关键词： FAS MU-MISO two-stage GNN unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

NDRIDC: NMF-based deep representation algorithm for incomplete data clustering

引用

Knowledge-Based Systems 2025年 324卷

作者： Dexian Wang Zonglin Li Sha Yang Tianrui Ren Pengfei Zhang Ping Deng Tianrui Li Chengdu University of Traditional Chinese Medicine Chengdu 611137 China Chinese Academy of Medical Sciences & Peking Union Medical College Beijing 100730 China School of Computer and Software Engineering Xihua University Chengdu 610039 China School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu 611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu 611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Chengdu 611756 China

Incomplete data clustering is a hot research topic in the field of data mining. Many methods based on incomplete clustering have two issues: (1) their models do not have non-negative constraints; (2) their model building strategies do not consider combining traditional machine learning and deep learning. To address these issues, we proposed the NMF-based deep representation algorithm for incomplete data clustering (NDRIDC). First, the element-based objective function is constructed based on the known elements in the incomplete data matrix with matrix factorization principle. Then the NDRIDC deep network is constructed based on the element update gradient and nonlinear function with non-negative value domain. The learning of the NDRIDC network enables the optimization of the objective function and the filling of missing values. Further, based on the same learning framework, the NDRIDC network is employed to perform low-dimensional representation of the filled matrix. Finally, extensive experiments on regular and large-scale datasets show that our proposed algorithm has good performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-modal Denoising Diffusion Pre-training for Whole-Slide Image Classification 24

Multi-modal Denoising Diffusion Pre-training for Whole-Slide...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Lou, Wei Li, Guanbin Wan, Xiang Li, Haofeng The Chinese University of Hong Kong Shenzhen Shenzhen China Shenzhen Research Institute of Big Data Shenzhen China School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Provincial Key Laboratory of Big Data Computing Shenzhen China

ISBN: (纸本)9798400706868

Whole-slide image (WSI) classification methods play a crucial role in tumor diagnosis. Most of them use hematoxylin and eosin (H&E) stained images, while Immunohistochemistry (IHC) staining provides molecular markers and protein expression information that highlights cancer regions. However, obtaining IHC-stained images requires higher costs in practice. In this work, we propose a multi-modal denoising diffusion pre-training framework that harnesses the advantages of IHC staining to learn visual representations. The framework is trained with the H&E-to-IHC re-staining task and IHC-stained image reconstruction task, which helps capture the structural similarity and staining difference between two image modalities. The trained model can then provide IHC-guided features, by taking only H&E-stained images as inputs. Besides, we build a new class-constraint constrastive loss to achieve the semantic consistency between dual-modal features from our pre-training framework. To integrate with WSI classifiers based on multi-instance learning, we further propose a bag feature augmentation strategy to extend bags with the features extracted by our pre-trained model. Experimental results on three datasets show that our pre-training framework effectively improves WSI classification and surpasses the state-of-the-art pre-training approaches. Code and model are released via https://***/lhaof/MDDP. © 2024 ACM.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Selective Similarity Integration for Drug-Target Interaction Prediction

arXiv

引用

arXiv 2022年

作者： Liu, Bin Wang, Jin Sun, Kaiwei Tsoumakas, Grigorios Key Laboratory of Data Engineering and Visual Computing Chongqing University of Posts and Telecommunications Chongqing400065 China School of Informatics Aristotle University of Thessaloniki Thessaloniki54124 Greece

The discovery of drug-target interactions (DTIs) is a pivotal process in pharmaceutical development. Computational approaches are a promising and efficient alternative to tedious and costly wet-lab experiments for predicting novel DTIs from numerous candidates. Recently, with the availability of abundant heterogeneous biological information from diverse data sources, computational methods have been able to leverage multiple drug and target similarities to boost the performance of DTI prediction. Similarity integration is an effective and flexible strategy to extract crucial information across complementary similarity views, providing a compressed input for any similarity-based DTI prediction model. However, existing similarity integration methods filter and fuse similarities from a global perspective, neglecting the utility of similarity views for each drug and target. In this study, we propose a Fine-Grained Selective similarity integration approach, called FGS, which employs a local interaction consistency-based weight matrix to capture and exploit the importance of similarities at a finer granularity in both similarity selection and combination steps. We evaluate FGS on five DTI prediction datasets under various prediction settings. Experimental results show that our method not only outperforms similarity integration competitors with comparable computational costs, but also achieves better prediction performance than state-of-the-art DTI prediction approaches by collaborating with conventional base models. Furthermore, case studies on the analysis of similarity weights and on the verification of novel predictions confirm the practical ability of FGS. Copyright © 2022, The Authors. All rights reserved.

关键词： Integration

来源：评论

学校读者我要写书评

暂无评论

Byzantine-Robust Federated Learning on Non-IID data via Inversing Artificial Gradients

Byzantine-Robust Federated Learning on Non-IID Data via Inve...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Li, Minyang Tang, Xiangyun Zhang, Tao Liu, Guangyuan Weng, Yu Minzu University of China Key Laboratory of Ethnic Language Intelligent Analysis and Security Governance China Beijing Jiaotong University School of Software Engineering China Nanyang Technological University College of Computing and Data Science Singapore

ISBN: (纸本)9798350351255

Federated Learning (FL) is a distributed machine learning framework that enhances privacy by enabling multiple participants to train a global model without sharing their raw data. However, FL still faces the threat posed by data and Byzantine attacks (e.g., data poisoning and model poisoning attacks) from malicious clients aimed to decrease the FL global training accuracy. Previous studies have proposed solutions to improve the robustness of FL systems. However, these robust approaches have not effectively defended against Byzantine attacks from malicious clients in non-Independent and Identically Distributed (non-IID) environments, decreasing overall training accuracy. In this work to address this issues, we propose a new defence framework that aims to enhance model accuracy against Byzantine attacks from malicious clients in non-IID environments. In our approach, the central server performs the Inverse Deep Learning Gradient attack using the gradient data submitted by users in each round, obtaining an inversed artificial gradient. We then assess the squared L2 norm difference between this inversed gradient and the actual gradients to detect malicious clients. Simultaneously, we assign weights to each client involved in the aggregation based on differences in the squared L2 norm, aiming to minimize the impact of malicious actors on the overall model. We have experimentally evaluated our method and demonstrated its ability to maintain training accuracy under attack in non-IID environments using standard datasets. © 2024 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

A Novel Multi-Source Contrastive Learning Approach for Robust Cross-Subject Emotion Recognition in Eeg data

SSRN

引用

SSRN 2024年

作者： Deng, Xin Li, Chenhui Hong, Xinyi Huo, Huaxiang Qin, Hongxing The Key Laboratory of Data Engineering and Visual Computing Chongqing University of Posts and Telecommunications Chongqing400065 China College of Computer Science Chongqing University Chongqing400044 China

Emotion Brain Computer Interface (BCI) based on Electroencephalography (EEG) is a significant branch in the field of affective computing. However, the variability in emotional feedback among subjects facing the same emotional stimuli and the potential presence of noisy labels in the data significantly limit the effectiveness and generalizability of EEG-based emotion recognition models. In this paper, we propose the Multi-Source Contrastive Learning Transfer Learning Model (MSCL) to address the emotion recognition in cross-subject scenarios. The MSCL model consists of three components: Firstly, the unsupervised and supervised contrastive learning are utilized to learn the differences and commonalities among different individuals. Secondly, domain adaptation methods and feature learning in multiple domains enhance the interaction of information between source and target domains, thereby improving the model's generalization across different individuals. Thirdly, in order to mitigate the detrimental effects of noisy labels on the model, this research dynamically allocate the weights to source domains similar to the target domain based on behavioral characteristics within the target domain and employ the corresponding noise learning methods. In our experiments, MSCL achieves excellent cross-subject emotion recognition performance on the CEED dataset and the SEED dataset. Our research highlights the significant capability of MSCL model in addressing the issues associated with inter-subject variability and label noise within EEG-based emotion BCI systems. This advancement sets the stage for the development of more refined and broadly applicable affective computing applications. © 2024, The Authors. All rights reserved.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：