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

arXiv 2023年

作者： Zheng, Tongya Wang, Xinchao Feng, Zunlei Song, Jie Hao, Yunzhi Song, Mingli Wang, Xingen Wang, Xinyu Chen, Chun The Big Graph Center College of Computer Science of Hangzhou City University China The College of Computer Science of Zhejiang University Hangzhou China The Department of Electrical and Computer Enigneering National University of Singapore Singapore The School of Software Technology Zhejiang University Hangzhou China The College of Computer Science Zhejiang University Hangzhou China The ZJU-Bangsun Joint Research Center The Shanghai Institute for Advanced Study Zhejiang University Hangzhou China

Temporal graphs exhibit dynamic interactions between nodes over continuous time, whose topologies evolve with time elapsing. The whole temporal neighborhood of nodes reveals the varying preferences of nodes. However, previous works usually generate dynamic representation with limited neighbors for simplicity, which results in both inferior performance and high latency of online inference. Therefore, in this paper, we propose a novel method of temporal graph convolution with the whole neighborhood, namely Temporal Aggregation and Propagation Graph Neural Networks (TAP-GNN). Specifically, we firstly analyze the computational complexity of the dynamic representation problem by unfolding the temporal graph in a message-passing paradigm. The expensive complexity motivates us to design the AP (aggregation and propagation) block, which significantly reduces the repeated computation of historical neighbors. The final TAP-GNN supports online inference in the graph stream scenario, which incorporates the temporal information into node embeddings with a temporal activation function and a projection layer besides several AP blocks. Experimental results on various real-life temporal networks show that our proposed TAP-GNN outperforms existing temporal graph methods by a large margin in terms of both predictive performance and online inference latency. Our code is available at https://***/doujiang-zheng/TAP-GNN. Copyright © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Cdga: A GAN-based Controllable Domain Generation Algorithm

Cdga: A GAN-based Controllable Domain Generation Algorithm

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： You Zhai Jian Yang Zixiang Wang Longtao He Liqun Yang Zhoujun Li State Key Lab of Software Development Environment Beihang University National Computer Network Emergency Response Technical Team Coordination Center of China School of Cyber Science and Technology Beihang University

Recently Command and Control (C&C) servers have attracted considerable attention in botnets and domain generation algorithms (DGAs) further enhance the stealth of C&C servers. However, Algorithmically Generated Domains (AGDs) generated by DGAs can be easily detected by previous DGA detection approaches. More specifically, the previous DGAs are hard to satisfy domain name rules, low repetition rate, and anti-detection in practical scenarios simultaneously. Designing an outstanding DGA has become a crucial issue from the botnet owner’s perspective. To mitigate these problems, we propose Cdga, a Controllable DGA via Generative Adversarial Networks (GAN), which is a popular backbone model for text generation in the natural language processing (NLP) *** text generation approaches are adopted by Cdga to ensure no repetition in the generated domain names and compliance with the domain rules. In addition to cheating DGA detectors, GANs are exploited to equip Cdga with a powerful anti-detection ability. Furthermore, our proposed method uses the technique of NLP to force the AGDs to meet language rules, where the generated domain names are difficult for recognition by human. By utilizing the time-dependent seed, Cdga can dynamically generate domain names, ensuring that the malware can connect to the C&C server conditioned on a specific time stamp. Experimental results demonstrate that the domain names generated by our method are realistic enough to be resistant to the state-of-the-art DGA detectors.

关键词： Command and control systems Privacy Botnet Force Detectors Generative adversarial networks Natural language processing

来源：评论

学校读者我要写书评

暂无评论

STCG: State-Aware Test Case Generation for Simulink Models 23

STCG: State-Aware Test Case Generation for Simulink Models

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Zhuo Su Zehong Yu Dongyan Wang Yixiao Yang Rui Wang Wanli Chang Aiguo Cui Yu Jiang KLISS BNRist School of Software Tsinghua University Beijing China Information Technology Center Renmin University of China Beijing China Information Engineering College Capital Normal University Beijing China Department of Computer Science University of York York United Kingdom HUAWEI Technologies Co. LTD. Shanghai China

ISBN: (纸本)9798350323481

Simulink has been widely used in system design, which supports the efficient modeling and synthesis of embedded controllers, with automatic test case generation to simulate and validate the correctness of the constructed Simulink model. However, the increasing complexity of the model, especially the internal states, brings extra challenges to existing model testing techniques such as constraint solving and random search, which results in difficulties when trying to reach the deeper logic of the model *** this paper, we propose STCG, a state-aware test case generation method for Simulink models. STCG solves only one iteration of the model each time to get the test input that can cover a target branch, then executes the model once to obtain and update the novel model state based on the solved input dynamically. Then, it solves the remaining branches based on the new model state iteratively until all the coverage requirements are satisfied. We implemented STCG and evaluated it on several benchmark Simulink models. Compared to the built-in Simulink Design Verifier and state-of-the-art academic work SimCoTest, STCG achieves an average improvement of 58% and 132% on Decision Coverage, 52% and 70% on Condition Coverage and 239% and 237% on Modified Condition Decision Coverage, respectively.

关键词： test case generation

来源：评论

学校读者我要写书评

暂无评论

BRFL: A Blockchain-based Byzantine-Robust Federated Learning Model

arXiv

引用

arXiv 2023年

作者： Li, Yang Xia, Chunhe Li, Chang Wang, Tianbo The Key Laboratory of Beijing Network Technology Beihang University Beijing100191 China The Guangxi Collaborative Innovation Center of Multi-Source Information Integration and Intelligent Processing Guangxi Normal University Guilin541004 China The School of Computer Science and Technology Zhengzhou University of Light Industry Zhengzhou450000 China The School of Cyber Science and Technology Beihang University Beijing100191 China The Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai201112 China

With the increasing importance of machine learning, the privacy and security of training data have become critical. Federated learning, which stores data in distributed nodes and shares only model parameters, has gained significant attention for addressing this concern. However, a challenge arises in federated learning due to the Byzantine Attack Problem, where malicious local models can compromise the global model's performance during aggregation. This article proposes the Blockchainbased Byzantine-Robust Federated Learning (BRLF) model that combines federated learning with blockchain technology. This integration enables traceability of malicious models and provides incentives for locally trained clients. Our approach involves selecting the aggregation node based on Pearson's correlation coefficient, and we perform spectral clustering and calculate the average gradient within each cluster, validating its accuracy using local dataset of the aggregation nodes. Experimental results on public datasets demonstrate the superior byzantine robustness of our secure aggregation algorithm compared to other baseline byzantine robust aggregation methods, and proved our proposed model effectiveness in addressing the resource consumption problem. Copyright © 2023, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

An acceleration method of optical flow calculation for automotive ADAS

An acceleration method of optical flow calculation for autom...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Wenjie Chen Ruixin Sun Zhilei Chai MoE Engineering Research Center for Software/Hardware Co-design Technology East China Normal University Shanghai China School of artificial Intelligence and computer science Jiangnan University Wuxi China

An essential component of advanced driver assistance systems (ADAS) is the real-time processing of various image types that are perceived by multiple sources. Although the optical flow is a crucial tool for determining how the camera (or vehicle) is moving in relation to its surroundings, due to the amount of computation involved, it is challenging to use it in real-time. Some of the existing fast optical flow calculation techniques are typically run on a server, which is large, expensive, and consumes a lot of power, making it difficult to mount on a real vehicle. This paper proposes an optimization technique appropriate for embedded GPU s mounted on vehicles that targets the pyramid LK optical flow method. A new dynamic window design strategy based on GPU architecture is proposed. By localizing the feature extraction algorithm to reduce the time-consuming sorting stage, improving the bidirectional constraint evaluation, and ending the iteration as soon as possible, the computational bit width is reduced, improving overall performance. Experiments with a real vehicle scene in the simultaneous localization and mapping (SLAM) system show that our approach meets the real-time requirement with 30 frames per second and improves performance by 3.8 times compared to the GPU-optimized version of OpenCV.

关键词： Point cloud compression Simultaneous localization and mapping Graphics processing units Feature extraction Cameras Real-time systems Vehicle dynamics

来源：评论

学校读者我要写书评

暂无评论

A Data-Driven Near-Optimization Approach for Smart Parking Management Platforms 18

A Data-Driven Near-Optimization Approach for Smart Parking M...

引用

18th IEEE International Conference on Networking, Sensing and Control, ICNSC 2021

作者： Bai, Mingyan Zhong, Shenghua Yan, Pengyu Chen, Zhibin Zhang, Zhixian University of Electronic Science and Technology of China School of Management and Economics Chengdu China Chengdu Communication Investment Group Intelligent Parking Industrial Development Company Ltd Chengdu China NYU Shanghai Division of Engineering and Computer Science Center for Data Science and Artificial Intelligence Shanghai China China Telecom Research Institute Shanghai China

ISBN: (纸本)9781665440486

This paper addresses an allocation optimization problem of parking slots in a real-time parking reservation platform in which parking demands randomly show up. For each decision period of a finite horizon, the reservation platform allocates the available parking slots at hand for the random demands with different types specified by the parking duration to maximize the total revenue over the whole horizon. This paper presents a real-time reservation framework and formulates the problem as a stochastic programming model, considering the different type demands with unknown probability distributions. We propose a data-driven near-optimization approach entitled a two-sample average approximation (2-SAA) to determine the allocation scheme over the horizon. In the 2-SAA approach, the confidence interval of the total revenue is established by the out-of-sample resampling method. The results of the numerical experiment validate the performance of the proposed 2-SAA algorithm. © 2021 IEEE.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

DPA-2:a large atomic model as a multitask learner

引用

npj Computational Materials 2024年第1期10卷 185-199页

作者： Duo Zhang Xinzijian Liu Xiangyu Zhang Chengqian Zhang Chun Cai Hangrui Bi Yiming Du Xuejian Qin Anyang Peng Jiameng Huang Bowen Li Yifan Shan Jinzhe Zeng Yuzhi Zhang Siyuan Liu Yifan Li Junhan Chang Xinyan Wang Shuo Zhou Jianchuan Liu Xiaoshan Luo Zhenyu Wang Wanrun Jiang Jing Wu Yudi Yang Jiyuan Yang Manyi Yang Fu-Qiang Gong Linshuang Zhang Mengchao Shi Fu-Zhi Dai Darrin M.York Shi Liu Tong Zhu Zhicheng Zhong Jian Lv Jun Cheng Weile Jia Mohan Chen Guolin Ke Weinan E Linfeng Zhang Han Wang AI for Science Institute BeijingP.R.China DP Technology BeijingP.R.China Academy for Advanced Interdisciplinary Studies Peking UniversityBeijingP.R.China State Key Lab of Processors Institute of Computing TechnologyChinese Academy of SciencesBeijingP.R.China University of Chinese Academy of Sciences BeijingP.R.China HEDPS CAPTCollege of EngineeringPeking UniversityBeijingP.R.China Ningbo Institute of Materials Technology and Engineering Chinese Academy of SciencesNingboP.R.China CAS Key Laboratory of Magnetic Materials and Devices and Zhejiang Province Key Laboratory of Magnetic Materials and Application Technology Chinese Academy of SciencesNingboP.R.China School of Electronics Engineering and Computer Science Peking UniversityBeijingP.R.China Shanghai Engineering Research Center of Molecular Therapeutics&New Drug Development School of Chemistry and Molecular EngineeringEast China Normal UniversityShanghaiP.R.China Laboratory for Biomolecular Simulation Research Institute for Quantitative Biomedicine and Department of Chemistry and Chemical BiologyRutgers UniversityPiscatawayNJUSA Department of Chemistry Princeton UniversityPrincetonNJUSA College of Chemistry and Molecular Engineering Peking UniversityBeijingP.R.China Yuanpei College Peking UniversityBeijingP.R.China School of Electrical Engineering and Electronic Information Xihua UniversityChengduP.R.China State Key Laboratory of Superhard Materials College of PhysicsJilin UniversityChangchunP.R.China Key Laboratory of Material Simulation Methods&Software of Ministry of Education College of PhysicsJilin UniversityChangchunP.R.China International Center of Future Science Jilin UniversityChangchunP.R.China Key Laboratory for Quantum Materialsof Zhejiang Province Department of PhysicsSchool of ScienceWestlake UniversityHangzhouP.R.China Atomistic Simulations Italian Institute of TechnologyGenovaItaly State Key Laboratory of Physical Chemistry of Solid Surface iChEMCollege of Chemistry and Chemical EngineeringXiame

The rapid advancements in artificial intelligence(AI)are catalyzing transformative changes in atomic modeling,simulation,and ***-driven potential energy models havedemonstrated the capability to conduct large-scale,long-duration simulations with the accuracy of ab initio electronic structure ***,the model generation process remains a bottleneck for large-scale *** propose a shift towards a model-centric ecosystem,wherein a large atomic model(LAM),pretrained across multiple disciplines,can be efficiently fine-tuned and distilled for various downstream tasks,thereby establishing a new framework for molecular *** this study,we introduce the DPA-2 architecture as a prototype for ***-trained on a diverse array of chemical and materials systemsusing a multi-task approach,DPA-2demonstrates superior generalization capabilities across multiple downstream tasks compared to the traditional single-task pre-training and fine-tuning *** approach sets the stage for the development and broad application of LAMs in molecular and materials simulation research.

关键词： DPA establishing thereby

来源：评论

学校读者我要写书评

暂无评论

H2-MARL: Multi-Agent Reinforcement Learning for Pareto Optimality in Hospital Capacity Strain and Human Mobility during Epidemic

arXiv

引用

arXiv 2025年

作者： Luo, Xueting Deng, Hao Yang, Jihong Shen, Yao Guo, Huanhuan Sun, Zhiyuan Liu, Mingqing Wei, Jiming Zhao, Shengjie School of Computer Science and Technology Tongji University Shanghai201804 China China Land Surveying and Planning Institute Beijing100035 China College of Architecture and Urban Planning Tongji University Shanghai200092 China Chongqing Institute of Planning and Natural Resources Investigation and Monitoring Chongqing401121 China Li-Fi Research and Development Centre University of Cambridge CambridgeCB3 0FA United Kingdom Guangdong Urban-rural Planning and Design Research Institute Technology Group Co. Ltd. Guangzhou510290 China Engineering Research Center of Key Software Technologies for Smart City Perception and Planning Ministry of Education Shanghai201804 China

The necessity of achieving an effective balance between minimizing the losses associated with restricting human mobility and ensuring hospital capacity has gained significant attention in the aftermath of COVID-19. Reinforcement learning (RL)-based strategies for human mobility management have recently advanced in addressing the dynamic evolution of cities and epidemics;however, they still face challenges in achieving coordinated control at the township level and adapting to cities of varying scales. To address the above issues, we propose a multi-agent RL approach that achieves Pareto optimality in managing hospital capacity and human mobility (H2-MARL), applicable across cities of different scales. We first develop a township-level infection model with online-updatable parameters to simulate disease transmission and construct a city-wide dynamic spatiotemporal epidemic simulator. On this basis, H2-MARL is designed to treat each division as an agent, with a trade-off dual-objective reward function formulated and an experience replay buffer enriched with expert knowledge built. To evaluate the effectiveness of the model, we construct a township-level human mobility dataset containing over one billion records from four representative cities of varying scales. Extensive experiments demonstrate that H2-MARL has the optimal dual-objective trade-off capability, which can minimize hospital capacity strain while minimizing human mobility restriction loss. Meanwhile, the applicability of the proposed model to epidemic control in cities of varying scales is verified, which showcases its feasibility and versatility in practical applications. Copyright © 2025, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Modeling Inter-Intra Heterogeneity for Graph Federated Learning

arXiv

引用

arXiv 2024年

作者： Yu, Wentao Chen, Shuo Tong, Yongxin Gu, Tianlong Gong, Chen School of Computer Science and Engineering Nanjing University of Science and Technology China Center for Advanced Intelligence Project RIKEN Japan State Key Laboratory of Complex & Critical Software Environment Beihang University China Jinan University China Department of Automation Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China

Heterogeneity is a fundamental and challenging issue in federated learning, especially for the graph data due to the complex relationships among the graph nodes. To deal with the heterogeneity, lots of existing methods perform the weighted federation based on their calculated similarities between pairwise clients (i.e., subgraphs). However, their inter-subgraph similarities estimated with the outputs of local models are less reliable, because the final outputs of local models may not comprehensively represent the real distribution of subgraph data. In addition, they ignore the critical intra-heterogeneity which usually exists within each subgraph itself. To address these issues, we propose a novel Federated learning method by integrally modeling the Inter-Intra Heterogeneity (FedIIH). For the inter-subgraph relationship, we propose a novel hierarchical variational model to infer the whole distribution of subgraph data in a multi-level form, so that we can accurately characterize the inter-subgraph similarities with the global perspective. For the intra-heterogeneity, we disentangle the subgraph into multiple latent factors and partition the model parameters into multiple parts, where each part corresponds to a single latent factor. Our FedIIH not only properly computes the distribution similarities between subgraphs, but also learns disentangled representations that are robust to irrelevant factors within subgraphs, so that it successfully considers the inter- and intra- heterogeneity simultaneously. Extensive experiments on six homophilic and five heterophilic graph datasets in both non-overlapping and overlapping settings demonstrate the effectiveness of our method when compared with nine state-of-the-art methods. Specifically, FedIIH averagely outperforms the second-best method by a large margin of 5.79% on all heterophilic datasets. Code is available at https://***/blgpb/FedIIH. Copyright © 2024, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Anomaly detection in multi-class time series 4

Anomaly detection in multi-class time series

引用

2021 4th International Conference on Mechatronics and computer technology Engineering, MCTE 2021

作者： Wang, Weihong Wu, Zhuolin Liu, Xuan Jia, Lei Wang, Xiaoguang College of Computer Science and Technology Zhejiang University of Technology Zhejiang Hangzhou310000 China Faculty of Computer Science Dalhousie University HalifaxNSB3H 4R2 Canada Research and Development Center of Agricultural Bank of China Zhejiang Hangzhou310000 China Beijing Broada Software Ltd Zhejiang Hangzhou310000 China

For modern operation and maintenance systems, they are usually required to monitor multiple types and large quantities of machine's key performance indicators (KPIs) at the same time with limited resources. In this paper, to tackle these problems, we propose a highly compatible time series anomaly detection model based on K-means clustering algorithm with a new Wavelet Feature Distance (WFD). Our work is inspired by some ideas from image processing and signal processing domain. Our model detects abnormalities in the time series datasets which are first clustered by K-means to boost the accuracy. Our experiments show significant accuracy improvements compared with traditional algorithms, and excellent compatibilities and operating efficiencies compared with algorithms based on deep learning. © 2021 Institute of Physics Publishing. All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：