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

data-driven Optimization of Complex Systems (DOCS), International Conference on

作者： Xinyu Tian Zesen Zhuang Luyao Zhang Department of Computer Science Duke University Durham United States Pratt School of Engineering Duke University Durham United States Data Science Research Center and Social Science Division Duke Kunshan University Suzhou China

ISBN: (数字)9798350377842

ISBN: (纸本)9798350377859

The Merge changes Ethereum from Proof-of-Work (PoW) to the more secure and less energy-intensive Proof-of-Stake (PoS) mechanism. However, the existence of malicious valida tors still threatens the security of Ethereum, primarily through a discouragement attack. How can we redesign the incentive mech-anism in PoS Ethereum for a more secure blockchain? For this quest, we, for the first time, apply the cutting-edge reinforcement mechanism design method-an interdisciplinary approach at the intersection of reinforcement learning (RL) and mechanism design-to staking mechanism designs. We abstract a generalized staking mechanism as a game environment and implement an RL method for the blockchain as a mechanism designer to explore the optimal incentive design. Our reinforcement mechanism design outperforms the status quo in cultivating honest validators. Furthermore, we identify Advantage Actor-Critic (A2C) as the most efficient RL algorithm among the three alternatives, which intuitively performs better when the initial proportion of honest validator is larger. Our interdisciplinary approach of generalized abstraction could be adapted to analyze the incentive design in any PoS blockchain and beyond.

关键词： Proof of stake Mechanism design Reinforcement learning Games Proof of Work Security Complex systems Optimization

来源：评论

学校读者我要写书评

暂无评论

FedEdge: Accelerating Edge-Assisted Federated Learning 23

FedEdge: Accelerating Edge-Assisted Federated Learning

引用

2023 World Wide Web Conference, WWW 2023

作者： Wang, Kaibin He, Qiang Chen, Feifei Jin, Hai Yang, Yun School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computing Technologies Swinburne University of Technology Australia School of Information Technology Deakin University Australia National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781450394161

Federated learning (FL) has been widely acknowledged as a promising solution to training machine learning (ML) model training with privacy preservation. To reduce the traffic overheads incurred by FL systems, edge servers have been included between clients and the parameter server to aggregate clients' local models. Recent studies on this edge-assisted hierarchical FL scheme have focused on ensuring or accelerating model convergence by coping with various factors, e.g., uncertain network conditions, unreliable clients, heterogeneous compute resources, etc. This paper presents our three new discoveries of the edge-assisted hierarchical FL scheme: 1) it wastes significant time during its two-phase training rounds;2) it does not recognize or utilize model diversity when producing a global model;and 3) it is vulnerable to model poisoning attacks. To overcome these drawbacks, we propose FedEdge, a novel edge-assisted hierarchical FL scheme that accelerates model training with asynchronous local federated training and adaptive model aggregation. Extensive experiments are conducted on two widely-used public datasets. The results demonstrate that, compared with state-of-the-art FL schemes, FedEdge accelerates model convergence by 1.14 × -3.20 ×, and improves model accuracy by 2.14% - 6.63%. © 2023 ACM.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

GCLS2: Towards Efficient Community Detection Using Graph Contrastive Learning with Structure Semantics

arXiv

引用

arXiv 2024年

作者： Wen, Qi Zhang, Yiyang Ye, Yutong Zhou, Yingbo Zhang, Nan Lian, Xiang Chen, Mingsong MoE Engineering Research Center on HW/SW Co-design and Application East China Normal University Shanghai China Department of Computer Science Kent State University KentOH44242 United States

Due to the power of learning representations from unlabeled graphs, graph contrastive learning (GCL) has shown excellent performance in community detection tasks. Existing GCL-based methods on the community detection usually focused on learning attribute representations of individual nodes, which, however, ignores structural semantics of communities (e.g., nodes in the same community should be structurally cohesive). Therefore, in this paper, we consider the community detection under the community structure semantics and propose an effective framework for graph contrastive learning under structure semantics (GCLS2) to detect communities. To seamlessly integrate interior dense and exterior sparse characteristics of communities with our contrastive learning strategy, we employ classic community structures to extract high-level structural views and design a structure semantic expression module to augment the original structural feature representation. Moreover, we formulate the structure contrastive loss to optimize the feature representation of nodes, which can better capture the topology of communities. To adapt to large-scale networks, we design a high-level graph partitioning (HGP) algorithm that minimizes the community detection loss for GCLS2 online training. It is worth noting that we prove a lower bound on the training of GCLS2 from the perspective of the information theory, explaining why GCLS2 can learn a more accurate representation of the structure. Extensive experiments have been conducted on various real-world graph datasets and confirmed that GCLS2 outperforms nine state-of-the-art methods, in terms of the accuracy, modularity, and efficiency of detecting communities. © 2024, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Exploring the Potential of Large Vision-Language Models for Unsupervised Text-Based Person Retrieval 39

Exploring the Potential of Large Vision-Language Models for ...

引用

39th Annual AAai Conference on Artificial Intelligence, AAai 2025

作者： Li, Zongyi Jianbo, Li Shi, Yuxuan Chen, Jiazhong Huang, Shijuan Tu, Linnan Shen, Fei Ling, Hefei Department of Computer Science and Technology Huazhong University of Science and Technology China National Engineering Research Center of Educational Big Data The Faculty of Artificial Intelligence in Education Central China Normal University China Nanjing University of Science and Technology China

ISBN: (纸本)157735897X

The aim of text-based person retrieval is to identify pedestrians using natural language descriptions within a large-scale image gallery. Traditional methods rely heavily on manually annotated image-text pairs, which are resource-intensive to obtain. With the emergence of Large Vision-Language Models (LVLMs), the advanced capabilities of contemporary models in image understanding have led to the generation of highly accurate captions. Therefore, this paper explores the potential of employing Large Vision-Language Models for unsupervised text-based pedestrian image retrieval and proposes a Multi-grained Uncertainty Modeling and Alignment framework (MUMA). Initially, multiple Large Vision-Language Models are employed to generate diverse and hierarchically structured pedestrian descriptions across different styles and granularities. However, the generated captions inevitably introduce noise. To address this issue, an uncertainty-guided sample filtration module is proposed to estimate and filter out unreliable image-text pairs. Additionally, to simulate the diversity of styles and granularities in captions, a multi-grained uncertainty modeling approach is applied to model the distributions of captions, with each caption represented as a multivariate Gaussian distribution. Finally, a multi-level consistency distillation loss is employed to integrate and align the multi-grained captions, aiming to transfer knowledge across different granularities. Experimental evaluations conducted on three widely-used datasets demonstrate the significant advancements achieved by our approach. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Attention in Attention for PET-CT Modality Consensus Lung Tumor Segmentation

Attention in Attention for PET-CT Modality Consensus Lung Tu...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Yuzhou Zhao Xinyu Zhou Haijing Guo Qianyu Guo Yan Zuo Shaoli Song Shuyong Gao Wenqiang Zhang Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University Department of Nuclear Medicine Fudan University Shanghai Cancer Center China Shanghai Engineering Research Center of AI Robotics Academy for Engineering and Technology Fudan University

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Combination of multi-modal PET-CT imaging for lung tumor segmentation is significant for clinical treatment. Existing methods have not fully considered the impact of noise in PET-CT on the multi-modal interaction. To address this, we propose a novel Attention in Attention Network (aiANet). aiANet can mutually learn multi-modal characteristics for segmentation through its cross-learning modules. Within the cross-learning module, we introduce two nested-attention blocks, namely Attention in Self-Attention (aiSA) and Attention in Cross-Attention (aiCA), for multi-scale feature enhancement and multi-modal feature interaction. Importantly, since traditional attention weights calculated solely or unilaterally based on PET or CT can be vulnerable to the inevitable noisy information, we embed a novel Attention in Attention (aiA) module into aiSA and aiCA. The aiA module can seek cross-modal consensus for attention weights to alleviate their noise. Experimental results on clinical PET-CT data of lung cancer demonstrate the superiority of our method.

关键词： Image segmentation Computed tomography Aggregates Noise Lung cancer Imaging Noise measurement Tumors

来源：评论

学校读者我要写书评

暂无评论

A Hydrodynamic Analysis of Water System in Dadahup Swamp Irrigation Area 1

A Hydrodynamic Analysis of Water System in Dadahup Swamp Irr...

引用

1st International Conference on computer science and Artificial Intelligence, ICCSai 2021

作者： Purboseno, Sentot Suparyanto, Teddy Hidayat, Alam Ahmad Pardamean, Bens Institute of Agriculture STIPER Department of Agricultural Engineering Yogyakarta55283 Indonesia Bina Nusantara University Bioinformatics and Data Science Research Center Jakarta11480 Indonesia Bina Nusantara University Bioinformatics and Data Science Research Center BINUS Graduate Program-Master of Computer Science Computer Science Department Jakarta11480 Indonesia

ISBN: (纸本)9781728133331

Dadahup Swamp Irrigation Area (DIR) in Kapuas Regency, Central Kalimantan is developed for agricultural activities to provide food security after the pandemic. The water system consists of various channels, gates, and a flood embankment structure, which is also connected to three different rivers: Barito River, Mangkatif River, and Kapuas Mumpung River. To quantify flood risk assessments in the area, we perform a hydrodynamic analysis using the unsteady flow method via HEC-RAS software version 4.1.0. We use geometrical profiles from topography measurements and the outer boundary of the Dadahup DIR as input for the hydrologic model. Our results estimate the maximum surface water level from both cross and longitudinal sections in the channels and find that several points near the flood embankment area are prone to flood events. Our modeling approach provides a preliminary assessment for the local government to formulate a flood mitigation plan and policy in the area. © 2021 IEEE.

关键词： Rivers

来源：评论

学校读者我要写书评

暂无评论

Waveform Boundary Detection for Partially Spoofed Audio

Waveform Boundary Detection for Partially Spoofed Audio

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zexin Cai Weiqing Wang Ming Li Department of Electrical and Computer Engineering Duke University Durham NC USA Data Science Research Center Duke Kunshan University Kunshan PR China

The present paper proposes a waveform boundary detection system for audio spoofing attacks containing partially manipulated segments. Partially spoofed/fake audio, where part of the utterance is replaced, either with synthetic or natural audio clips, has recently been reported as one scenario of audio deepfakes. As deepfakes can be a threat to social security, the detection of such spoofing audio is essential. Accordingly, we propose to address the problem with a deep learning-based frame-level detection system that can detect partially spoofed audio and locate the manipulated pieces. Our proposed method is trained and evaluated on data provided by the ADD2022 Challenge. We evaluate our detection model concerning various acoustic features and network configurations. As a result, our detection system achieves an equal error rate (EER) of 6.58% on the ADD2022 challenge test set, which is the best performance in partially spoofed audio detection systems that can locate manipulated clips.

关键词： Deepfakes Adaptation models Error analysis Signal processing Feature extraction Acoustics Security

来源：评论

学校读者我要写书评

暂无评论

Safe and Reliable Training of Learning-Based Aerospace Controllers

Safe and Reliable Training of Learning-Based Aerospace Contr...

引用

Conference on Digital Avionics Systems (DASC)

作者： Udayan Mandal Guy Amir Haoze Wu Ieva Daukantas Fletcher Lee Newell Umberto Ravaioli Baoluo Meng Michael Durling Kerianne Hobbs Milan Ganai Tobey Shim Guy Katz Clark Barrett Center for AI Safety Stanford University Stanford USA School of CS & Engineering The Hebrew University of Jerusalem Jerusalem Israel Department of Computer Science IT University of Copenhagen Copenhagen Denmark Google Mountain View USA GE Aerospace Research Niskayuna USA Air Force Research Laboratory US Air Force Dayton USA Department of Computer Science Stanford University Stanford USA Department of Data Science Stanford University Stanford USA

ISBN: (数字)9798350349610

ISBN: (纸本)9798350349627

In recent years, deep reinforcement learning (DRL) approaches have generated highly successful controllers for a myriad of complex domains. However, the opaque nature of these models limits their applicability in aerospace systems and sasfety-critical domains, in which a single mistake can have dire consequences. In this paper, we present novel advancements in both the training and verification of DRL controllers, which can help ensure their safe behavior. We showcase a design-for-verification approach utilizing k-induction and demonstrate its use in verifying liveness properties. In addition, we also give a brief overview of neural Lyapunov Barrier certificates and summarize their capabilities on a case study. Finally, we describe several other novel reachability-based approaches which, despite failing to provide guarantees of interest, could be effective for verification of other DRL systems, and could be of further interest to the community.

关键词： Training Space vehicles Neural networks Aerospace electronics Deep reinforcement learning Control systems Aerospace safety Reliability Reachability analysis Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Kbpt: Knowledge-Based Prompt Tuning for Zero-Shot Relation Triplet Extraction

SSRN

引用

SSRN 2023年

作者： Guo, Qian Guo, Yi Zhao, Jin Department of Computer Science and Engineering East China University of Science and Technology Shanghai200237 China Business Intelligence and Visualization Research Center National Engineering Laboratory for Big Data Distribution and Exchange Technologies Shanghai200436 China Shanghai Engineering Research Center of Big Data & Internet Audience Shanghai200072 China Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Shanghai200433 China

Knowledge representation is becoming an effective way of information extraction. However, considerable studies ignored its application scenarios in the zero-shot setting. In this paper, we propose a novel framework for prompt language models based on external ontology knowledge called Knowledge-Based Prompt Tuning for the Zero-shot Relation Triplet Extraction (KBPT), which encourages further investigation in low-resource regimes to address the data scarcity problem in Relation Triplet Extraction (RTE). The major task of relation triplet extraction in zero-shot learning is to extract multiple triplets that are consisted of head entities, tail entities, and relation labels from an input sentence where the extracted relation labels do not exist in the training set. The fundamental idea of prompt tuning is to construct a prompt template, then append it behind the input text as the pre-trained language models (PLMs) input, thus, transforming the classification task into a masked language model prediction. However, our proposed model does not involve the mask language model prediction but a well-designed prompt template in a structured text format to generate synthetic training data containing the unseen relation category. Concretely, we utilize the relation labels and incorporate virtual tokens sources from the relation semantics to construct a structured prompt template for generating synthetic training instances. Moreover, to further enrich and supplement prior knowledge, we draw on ontology schema based on external knowledge bases to enhance the capability of semantic representation in the prompt template. To address the problem of knowledge heterogeneity, we synergistically optimize these embedding representations by way of collective training. In addition, we carefully design a Multiple Triplets Decoding (MTD) algorithm to break through the limitation of extracting multiple relation triplets in a sentence, and our proposed model is model-agnostic and can be orthogon

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Providing and evaluating a model for big data anonymization streams by using in-memory processing

引用

Knowledge and Information Systems 2025年

作者： Shamsinejad, Elham Banirostam, Hamid BaniRostam, Touraj Pedram, Mir Mohsen Rahmani, Amir Masoud Computer Engineering (Software) Specializing in Data Science Tehran Iran Master of Data Analytics University of Niagara Falls Niagara Falls ON Canada Electrical and Computer Engineering Department Faculty of Engineering Kharazmi University Tehran Iran Future Technology Research Center National Yunlin University of Science and Technology Yunlin Taiwan

Extracting valuable information from vast sources of social networks while protecting confidentiality and preventing data disclosure is a significant challenge in big data environments. Traditional anonymization methods often fall short in handling the volume, variety, and velocity of big data, leading to high data loss and inefficiency. This article addresses these challenges by proposing a novel anonymization method based on K-means clustering within the Spark framework, leveraging its in-memory processing capabilities. Our model uses K-means clustering to determine optimal cluster heads, significantly reducing data loss and identity disclosure risks. By utilizing Spark's RDD abilities and the MLlib component, our method achieves faster processing times compared to traditional methods that rely on non-in-memory big data tools. Performance evaluation demonstrates that at k = 9, the cost factor is minimized to 0.20, indicating the efficiency and effectiveness of our approach. The proposed method not only enhances processing speed but also ensures minimal data loss, making it suitable for real-time anonymization of big data streams. This work provides a balanced solution that addresses the critical need for high-speed data anonymization while maintaining data privacy and utility. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Anonymity confidentiality Big data data disclosure Privacy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：