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

arXiv 2023年

作者： Li, Shaofei Dong, Feng Xiao, Xusheng Wang, Haoyu Shao, Fei Chen, Jiedong Guo, Yao Chen, Xiangqun Li, Ding School of Computer Science Peking University China Arizona State University United States Case Western Reserve University United States Sangfor Technologies Inc. China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology China

Advanced Persistent Threats (APT) attacks have plagued modern enterprises, causing significant financial losses. To counter these attacks, researchers propose techniques that capture the complex and stealthy scenarios of APT attacks by using provenance graphs to model system entities and their dependencies. Particularly, to accelerate attack detection and reduce financial losses, online provenance-based detection systems that detect and investigate APT attacks under the constraints of timeliness and limited resources are in dire need. Unfortunately, existing online systems usually sacrifice detection granularity to reduce computational complexity and produce provenance graphs with more than 100,000 nodes, posing challenges for security admins to interpret the detection results. In this paper, we design and implement NODLINK, the first online detection system that maintains high detection accuracy without sacrificing detection granularity. Our insight is that the APT attack detection process in online provenance-based detection systems can be modeled as a Steiner Tree Problem (STP), which has efficient online approximation algorithms that recover concise attack-related provenance graphs with a theoretically bounded error. To utilize the frameworks of the STP approximation algorithm for APT attack detection, we propose a novel design of in-memory cache, an efficient attack screening method, and a new STP approximation algorithm that is more efficient than the conventional one in APT attack detection while maintaining the same complexity. We evaluate NODLINK in a production environment. The open-world experiment shows that NODLINK outperforms two state-of-the-art (SOTA) online provenance analysis systems by achieving magnitudes higher detection and investigation accuracy while having the same or higher throughput. Copyright © 2023, The Authors. All rights reserved.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Experimental Study on the Zebra Crossing Behavior of Mixed Bicycles and Pedestrians

SSRN

引用

SSRN 2022年

作者： Ma, Jian Wang, Qiao Chen, Juan Jiang, Rui Song, Weiguo Li, Ruoyu Lian, Liping School of Transportation and Logistics National Engineering Laboratory of Integrated Transportation Big Data Application Technology National United Engineering Laboratory of Integrated and Intelligent Transportation Southwest Jiaotong University Chengdu610031 China Faculty of Geosciences and Environmental Engineering Southwest Jiaotong University Chengdu610031 China Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport Ministry of Transport Beijing Jiaotong University Beijing100044 China State Key Laboratory of Fire Science University of Science and Technology of China Hefei230027 China School of Urban Planning and Design Peking University Shenzhen Graduate School School of Architectural Engineering Shenzhen Polytechnic Shenzhen518055 China

Slow transportation mode, consisting of walking and cycling, plays an important role in urban traffic system. Based on the fact that bicycles and pedestrians often share the common road facility, we conducted bicycle-pedestrian mixed flow experiments to investigate the interaction effect among individuals in a 10 m-long, 3 m-wide passageway, mimicking the zebra crossing area. The goal is to explore the influence of bicycles proportion ( p ) on traffic efficiency and investigate the spatial distribution of agents in the mixed flow. Our analyses showed that the increase of bicycle proportion results in longer passing time and less travel time because of large personal space requirements of cyclists. When the bicycle proportion is small or large, the majority pedestrians (bicycles) were divided into several parts by minor bicycles (pedestrians) along the motion direction. We also recorded the following- and lateral- distance between two nearest individuals to calculate the theoretical formula of the passing time for unidirectional bicycle-pedestrian mixed flow based on the existing formula. Comparing the passing time between numerical calculation and experimental data, the effect coefficients for bicycle and pedestrian were obtained. Focusing on the overtaking bicycles, the through gap, lateral and headway distance that decide the overtaking behavior were analyzed. These findings are the first step toward the development of bicycle-pedestrian mixed flow on zebra crossing, which is contribute to provide practical implications for the planning and design of bicycle and pedestrian shared infrastructures. © 2022, The Authors. All rights reserved.

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

A Novel Drug-Drug Interaction Prediction Model Based on Line Subgraph Generation Strategy

A Novel Drug-Drug Interaction Prediction Model Based on Line...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Tian Bai Chu Li Xinyue Peng Haotian Guan Zefan Zhang Guishen Wang College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China College of Software Jilin University Changchun China School of Nursing Jilin University Changchun China School of Life Sciences Jilin University Changchun China College of Computer Science and Engineering Changchun University of Technology Changchun China

Drug-Drug Interaction (DDI) prediction task is helpful for better-understanding drugs. In this paper, we propose a novel drug-drug interaction prediction model based on line subgraph generation strategy, named DDI-LSG model. Our DDI-LSG model consists of three main parts which include drug relation graph construction, line subgraph generation strategy, and graph-level classification. To consider more relationships among drugs, we propose a node feature-enhancing method to encode drug features in drug relation graph construction process. To consider drugs and DDI as equivalent factors of our DDI-LSG model, we introduce line graph transformation to integrate DDI with drug feature enhancing vector. Combining Jaccard similarity with cosine similarity, we propose a line subgraph generation strategy to evaluate node relation and extract key structures around target DDI in the line graph. Then, we reformulate the DDI prediction task into a graph-level classification task for the line subgraph of the target DDI. Therefore, in the final part of our DDI-LSG model, we use a graph-level classifier to classify the line subgraphs. Our DDI-LSG model outperforms better experiment results than baselines. Ablation results have validated the node feature enhancing method and line subgraph generation strategy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TraffNet: Learning Causality of Traffic Generation for What-if Prediction

arXiv

引用

arXiv 2023年

作者： Xu, Ming Ai, Qiang Li, Ruimin Ma, Yunyi Qi, Geqi Meng, Xiangfu Jin, Haibo The Software College Liaoning Technical University Liaoning Huludao125100 China The Department of Civil Engineering Tsinghua University Beijing100084 China The Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport Beijing Jiaotong University Beijing100091 China The School of Electronic and Information Engineering Liaoning Technical University Liaoning Huludao125100 China

Real-time what-if traffic prediction is crucial for decision making in intelligent traffic management and control. Although current deep learning methods demonstrate significant advantages in traffic prediction, they are powerless in what-if traffic prediction due to their nature of correla-tion-based. Here, we present a simple deep learning framework called TraffNet that learns the mechanisms of traffic generation for what-if pre-diction from vehicle trajectory data. First, we use a heterogeneous graph to represent the road network, allowing the model to incorporate causal features of traffic flows, such as Origin-Destination (OD) demands and routes. Next, we propose a method for learning segment representations, which models the process of assigning OD demands onto the road network. The learned segment represen-tations effectively encapsulate the intricate causes of traffic generation, facilitating downstream what-if traffic prediction. Finally, we conduct experiments on synthetic datasets to evaluate the effectiveness of TraffNet. The code and datasets of TraffNet is available at https://***/iCityLab/TraffNet. Copyright © 2023, The Authors. All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Intersection-policy private mutual authentication from authorized private set intersection

引用

Science China(Information Sciences) 2020年第2期63卷 116-130页

作者： Yamin WEN Fangguo ZHANG Huaxiong WANG Yinbin MIAO Zheng GONG School of Statistics and Mathematics Guangdong University of Finance and Economics State Key Laboratory of Cryptology School of Data and Computer Science Sun Yat-sen University Guangdong Key Laboratory of Information Security Sun Yat-sen University School of Physical and Mathematical Sciences Nanyang Technological University Department of Cyber Engineering Xidian University School of Computer South China Normal University

Private mutual authentication(PMA) enables two-way anonymous authentication between two users certified by the same trusted group authority. Most existing PMA schemes focus on acquiring a relatively onefold authentication policy that ensures affiliation-hiding or designated single-attribute ***, in practice, users are typically provided with multiple attributes. In addition to the affiliation-hiding requirement, how to effectively achieve a more flexible authentication policy for multi-attribute applications remains a challenging issue. The intersection policy for authentication is also required when the attribute intersection is not an empty set or its cardinality is no less than a threshold value. To solve the above problems, we first propose an optimal authorized private set intersection protocol with forward security based on identity-based encryption and then design a new PMA protocol with intersection-policy called IP-PMA, which provides a simple solution for secret handshakes between two members(holding multiple attributes) from the same organization. Formal security analyses proved that our two proposed protocols are secure in the random oracle model. Empirical tests demonstrated that the IP-PMA protocol is optimized with linear complexity and may be more suitable for resource-constrained applications.

关键词： private mutual authentication secret handshake intersection policy authorized private set intersection multi-attribute matching

来源：评论

学校读者我要写书评

暂无评论

Solving Multitrip Pickup and Delivery Problem With Time Windows and Manpower Planning Using Multiobjective Algorithms

引用

IEEE/CAA Journal of Automatica Sinica 2020年第4期7卷 1134-1153页

作者： Jiahai Wang Yuyan Sun Zizhen Zhang Shangce Gao the Department of Computer Science and also with the Key Laboratory of Machine Intelligence and Advanced ComputingMinistry of Educationand also with the Guangdong Key Laboratory of Big Data Analysis and ProcessingSun Yat-sen UniversityGuangzhou 510275China the Department of Computer Science Sun Yat-sen UniversityGuangzhou 510275China the Faculty of Engineering University of ToyamaToyama-shi 930-8555Japan

The multitrip pickup and delivery problem with time windows and manpower planning(MTPDPTW-MP)determines a set of ambulance routes and finds staff assignment for a hospital. It involves different stakeholders with diverse interests and objectives. This study firstly introduces a multiobjective MTPDPTW-MP(MO-MTPDPTWMP) with three objectives to better describe the real-world scenario. A multiobjective iterated local search algorithm with adaptive neighborhood selection(MOILS-ANS) is proposed to solve the problem. MOILS-ANS can generate a diverse set of alternative solutions for decision makers to meet their requirements. To better explore the search space, problem-specific neighborhood structures and an adaptive neighborhood selection strategy are carefully designed in MOILS-ANS. Experimental results show that the proposed MOILS-ANS significantly outperforms the other two multiobjective algorithms. Besides, the nature of objective functions and the properties of the problem are analyzed. Finally, the proposed MOILS-ANS is compared with the previous single-objective algorithm and the benefits of multiobjective optimization are discussed.

关键词： Adaptive neighborhood selection manpower planning multiobjective optimization multitrip pickup and delivery problem with time windows

来源：评论

学校读者我要写书评

暂无评论

TVEG: Model Selection of the Time-Varying Exponential Family Distributions Graphical Models

引用

IEEE Transactions on Network Science and engineering 2025年

作者： Liu, Juan Mei, Guofeng Xia, Yuanqing Wu, Xiaoqun Lu, Jinhu Beijing Forestry University School of Technology Beijing100107 China Italy Zhongyuan University of Technology Henan 451191 China Wuhan University School of Mathematics and Statistics Wuhan430072 China Beihang University State Key Laboratory of Software Development Environment Beijing Advanced Innovation Center for Big Data and Brain Machine Intelligence School of Automation Science and Electrical Engineering Beijing100191 China

The undirected graphical model, a popular class of statistical model, offers a way to describe and explain the relationships among a set of variables. However, it remains a challenge to choose a certain graphical model to explain the relationships of variables adequately, especially when the relationships of variables are rewiring over time. This paper proposes the Time-Varying Exponential Family Distributions Graphical (TVEG) models, with time-varying structures and exponential family node-wise conditional distributions. TVEG models extend the scope of available graph models and can be applied to time-varying and exponential family distribution observation data in reality. We propose the Temporally Smoothed L1regularized exponential family graphical estimator (TSLEG), an estimator to infer the structure of TVEG from observations. We derive sufficient conditions for the TSLEG to recover the block partition and sparse pattern with high probability. We derive a message-passing optimization method to solve the TSLEG for time-varying Ising, Gaussian, exponential, and Poisson graphs based on the ADMM. The synthetic network simulations corroborate the theoretical analysis. Analysing of real data of stocks and the US Senate by the time-varying exponential model and Poisson model indicates the effectiveness and practicality of TVEG models. © 2025 IEEE. All rights reserved.

关键词： ADMM exponential family distributions Graphical model pseudo maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Communication-Efficient Federated Learning by Quantized Variance Reduction for Heterogeneous Wireless Edge Networks

引用

IEEE Transactions on Mobile Computing 2025年

作者： Wang, Shuai Xu, Yanqing You, Chaoqun Shao, Mingjie Quek, Tony Q.S. University of Electronic Science and Technology of China National Key Laboratory of Wireless Communications Chengdu611731 China The Chinese University of HongKong Shenzhen Research Institute of Big Data School of Science and Engineering Shenzhen518172 China Fudan University School of Computer Science and Technology 200433 China Beijing100149 China Singapore University of Technology and Design Information Systems Technology and Design 487372 Singapore

Federated learning (FL) has been recognized as a viable solution for local-privacy-aware collaborative model training in wireless edge networks, but its practical deployment is hindered by the high communication overhead caused by frequent and costly server-device synchronization. Notably, most existing communication-efficient FL algorithms fail to reduce the significant inter-device variance resulting from the prevalent issue of device heterogeneity. This variance severely decelerates algorithm convergence, increasing communication overhead and making it more challenging to achieve a well-performed model. In this paper, we propose a novel communication-efficient FL algorithm, named FedQVR, which relies on a sophisticated variance-reduced scheme to achieve heterogeneity-robustness in the presence of quantized transmission and heterogeneous local updates among active edge devices. Comprehensive theoretical analysis justifies that FedQVR is inherently resilient to device heterogeneity and has a comparable convergence rate even with a small number of quantization bits, yielding significant communication savings. Besides, considering non-ideal wireless channels, we propose FedQVR-E which enhances the convergence of FedQVR by performing joint allocation of bandwidth and quantization bits across devices under constrained transmission delays. Extensive experimental results are also presented to demonstrate the superior performance of the proposed algorithms over their counterparts in terms of both communication efficiency and application performance. © 2025 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

An Exact Potential Game-Based End-Edge-Cloud Collaborative Task Offloading Approach

An Exact Potential Game-Based End-Edge-Cloud Collaborative T...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, UIC-ATC

作者： Yue Shen Bowen Liu Fei Dai Wanchun Dou State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Guangdong Laboratory of Artificial Intelligence and Digital Economy(SZ) Shenzhen China College of Big Data and Intelligent Engineering Southwest Forestry University Kunming China

With the development of Industrial Internet of Things(IIoT), massive industrial devices produce a large number of delay-sensitive and computing-intensive tasks. Offloading tasks under the end-edge-cloud collaboration mode can improve the efficiency of completing tasks. However, on the one hand, tasks need to be finished before corresponding deadlines and pay for consuming resources, so delay and cost constitute the main factors affecting task offloading decisions. On the other hand, limited real-time resources in the system may not meet the needs of all devices, so we should ensure that as many devices can complete tasks on time as possible while optimizing task delay and cost of each device. To tackle the challenges, we propose an end-edge-cloud collaborative task offloading approach based on exact potential game. Aiming at optimizing delay-cost of each device and task completion rate of the whole system, the end-edge-cloud collaborative task offloading problem is modeled as an exact potential game and solved. Extensive experiments show that the approach can improve the task completion rate of the system while optimizing the delay-cost of each device.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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 Beijing100044 China Beijing Jiaotong University School of Electronics and Information Engineering Beijing100044 China University College London Department of Electronic and Electrical Engineering LondonWC1E 6BT United Kingdom Yonsei University Yonsei Frontier Laboratory School of Integrated Technology Seoul03722 Korea Republic of 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.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：