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

IEEE International Conference on Intelligent Transportation engineering (ICITE)

作者： Yuyan Guo Tao Liu National Engineering Laboratory of Integrated Transportation Big Data Application Technology Institute of System Science and Engineering School of Transportation and Logistics Southwest Jiaotong University Chengdu China

ISBN: (数字)9798350314212

ISBN: (纸本)9798350314229

With the advantages of zero emission and comfortable riding experience, battery-electric buses (BEBs) are widely adopted in public transit agencies as a green alternative to conventional diesel buses. Battery swapping technology is an efficient and promising charging technology to address the issues of battery range anxiety and long battery charging time. This study developed a two-stage optimization model to optimize the single-line battery-electric bus scheduling problem considering battery swapping. At the first stage, a bi-objective integer programming model is established to determine the minimum BEB fleet size, together with the BEB-to-trip assignment and battery swapping schedule. At the second stage, an integer linear programming model is formulated to determine the required minimum number of batteries. An $\epsilon$ -constraint method is designed to investigate the trade-off between the required minimum fleet size and the number of back-up batteries. Finally, a real-world case study of a BEB line in Chengdu, China, is conducted to demonstrate the effectiveness of the optimization model and solution method. Sensitivity analyses are further conducted to understand the impacts of some key parameters, including battery capacity, number of trips, cycle time, and battery swapping time. The results show that battery capacity and cycle time have significant influences on BEB-to-trip assignment results and battery swapping schedule.

关键词： Integer programming Schedules Sensitivity analysis Optimization models Transportation Stochastic processes Optimal scheduling Integer linear programming Scheduling Batteries

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Co-Evolution Algorithm with Variable-Importance Grouping for Large-Scale Optimization 13

A Cooperative Co-Evolution Algorithm with Variable-Importanc...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Li, Yongfeng Zhang, Yuze Ma, Lijia Ji, Junkai Liu, Dugang Leung, Victor C. M. Li, Jianqiang Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Guangdong Laboratory of Artificial Intelligence and Digital Economy Shenzhen518123 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518172 China The University of British Columbia Department of Electrical and Computer Engineering VancouverV6T 1Z4 Canada

ISBN: (纸本)9798350308365

Cooperative co-evolution (CC) is a promising direction in solving large-scale multiobjective optimization problems (LMOPs). However, most existing methods of grouping decision variables face some difficulties when searching in the huge search space. Specifically, the methods of grouping decision variables can be classified into two types, i.e., high-consumption grouping methods and non-consumption grouping methods. On the one hand, the former ones divide the decision variables into different groups based on the correlation analysis between variables, which consume much evaluation. This way may lead to premature convergence within limited computational resources. On the other hand, the later ones allocate the decision variables into sub-groups based on some metrics, e.g., order and size, which consume no evaluation while may cause the search fall into local optima. To alleviate the above issues, this paper proposes a CC-based algorithm with a variable-importance grouping (VIG) method, called VICCA. Firstly, the decision variables are classified into several subgroups according to their importance quantified by a meta-gene construction method. Secondly, a CC strategy is designed to simultaneously optimize all subgroups of decision variables formed by VIG using the differential evolution operator, which aims to accelerate the convergence speed. Thirdly, a global evolutionary strategy is proposed to optimize original decision variable space by the competitive swarm optimizer, aiming to maintain the diversity. Finally, the experiments demonstrate that our proposed VICCA has the significant advantage in solving LMOPs when compared with state-of-the-art evolutionary algorithms. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

A survey on graph processing accelerators: Challenges and opportunities

arXiv

引用

arXiv 2019年

作者： Gui, Chuang-Yi Zheng, Long He, Bing-Sheng Liu, Cheng Chen, Xin-Yu Liao, Xiao-Fei Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China School of Computing National University of Singapore 117418 Singapore

Graph is a well known data structure to represent the associated relationships in a variety of applications, e.g., data science and machine learning. Despite a wealth of existing efforts on developing graph processing systems for improving the performance and/or energy efficiency on traditional architectures, dedicated hardware solutions, also referred to as graph processing accelerators, are essential and emerging to provide the benefits significantly beyond those pure software solutions can offer. In this paper, we conduct a systematical survey regarding the design and implementation of graph processing accelerator. Specifically, we review the relevant techniques in three core components toward a graph processing accelerator: preprocessing, parallel graph computation and runtime scheduling. We also examine the benchmarks and results in existing studies for evaluating a graph processing accelerator. Interestingly, we find that there is not an absolute winner for all three aspects in graph acceleration due to the diverse characteristics of graph processing and complexity of hardware configurations. We finially present to discuss several challenges in details, and to further explore the opportunities for the future research. Copyright © 2019, The Authors. All rights reserved.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Localization of Deep Inpainting Using High-Pass Fully Convolutional Network

Localization of Deep Inpainting Using High-Pass Fully Convol...

引用

International Conference on Computer Vision (ICCV)

作者： Haodong Li Jiwu Huang Guangdong Key Laboratory of Intelligent Information Processing and Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China

ISBN: (数字)9781728148038

ISBN: (纸本)9781728148045

Image inpainting has been substantially improved with deep learning in the past years. Deep inpainting can fill image regions with plausible contents, which are not visually apparent. Although inpainting is originally designed to repair images, it can even be used for malicious manipulations, e.g., removal of specific objects. Therefore, it is necessary to identify the presence of inpainting in an image. This paper presents a method to locate the regions manipulated by deep inpainting. The proposed method employs a fully convolutional network that is based on high-pass filtered image residuals. Firstly, we analyze and observe that the inpainted regions are more distinguishable from the untouched ones in the residual domain. Hence, a high-pass pre-filtering module is designed to get image residuals for enhancing inpainting traces. Then, a feature extraction module, which learns discriminative features from image residuals, is built with four concatenated ResNet blocks. The learned feature maps are finally enlarged by an up-sampling module, so that a pixel-wise inpainting localization map is obtained. The whole network is trained end-to-end with a loss addressing the class imbalance. Extensive experimental results evaluated on both synthetic and realistic images subjected to deep inpainting have shown the effectiveness of the proposed method.

关键词： Forensics Feature extraction Convolution Kernel Machine learning Computer vision Probability

来源：评论

学校读者我要写书评

暂无评论

Depth-Aware Multi-Modal Fusion for Generalized Zero-Shot Learning 22

Depth-Aware Multi-Modal Fusion for Generalized Zero-Shot Lea...

引用

22nd IEEE International Conference on Industrial Informatics, INDIN 2024

作者： Cao, Weipeng Yao, Xuyang Xu, Zhiwu Pan, Yinghui Sun, Yixuan Li, Dachuan Qiu, Bohua Wei, Muheng Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Stony Brook University New York United States Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology Shenzhen China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China ZhenDui Industry Artificial Intelligence Co. Ltd Shenzhen China Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China

ISBN: (纸本)9798331527471

Realizing Generalized Zero-Shot Learning (GZSL) based on large models is emerging as a prevailing trend. However, most existing methods merely regard large models as black boxes, solely leveraging the features output by the final layer while disregarding potential performance enhancements from other layers. Indeed, numerous researchers have visually depicted variations in the features learned across different layers of neural networks. Motivated by this observation, we propose a Vision Transformer (ViT)-based GZSL method named Depth-Aware Multi-Modal ViT (DAM2ViT), which exploits multi-level features of ViT. DAM2ViT incorporates a multi-modal interaction block to align semantic information of categories across multiple layers, thereby augmenting the model’s capacity to learn associations between visual and semantic spaces. Extensive experiments conducted on three benchmark datasets (i.e., CUB, SUN, AWA2) have showcased that DAM2ViT achieves competitive results compared to state-of-the-art methods. © 2024 IEEE.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

A Time-Efficient Distributed Constant Conditional Functional Dependency Discovery Algorithm for data Consistency

A Time-Efficient Distributed Constant Conditional Functional...

引用

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Junchao Chen Jian-tao Zhou Xinyu Hao Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology College of Computer Science Inner Mongolia University Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Hohhot China

ISBN: (数字)9798350376968

ISBN: (纸本)9798350376975

The accuracy of data analysis depends on data quality, and addressing data consistency issues is a key challenge to improve it. Constant Conditional Functional Dependency (CCFD) is an effective approach that ensures data consistency by enforcing bindings of semantically related values, thus providing quality assurance for data analysis and decision-making processes. However, with the growth of data scale, especially the increasing number of data tuples and attributes, existing single-machine CCFD discovery algorithms face issues of low computational efficiency and lengthy computation time. This paper proposes a time-efficient distributed CCFD discovery algorithm (DCCFD). Through the optimization of data preprocessing and index mapping, the data organization structure is enhanced, laying the foundation for the discovery of CCFDs under distributed conditions. The Spark parallel computing framework is used to partition the dataset, which accelerates the parallel loading and processing of data. Additionally, this algorithm ensures accuracy and processing speed when discovering dependencies by efficiently generating frequent itemsets and verifying CCFDs in parallel. Experiments on multiple real datasets show that, especially with the complex Airline dataset, the DCCFD algorithm not only accurately discovers CCFDs, but also reduces the average running time by 75.64% compared with the preCFDMiner algorithm.

关键词： Accuracy data preprocessing Software algorithms Distributed databases Parallel processing Software Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Detector Collapse: Physical-World Backdooring Object Detection to Catastrophic Overload or Blindness in Autonomous Driving

arXiv

引用

arXiv 2024年

作者： Zhang, Hangtao Hu, Shengshan Wang, Yichen Zhang, Leo Yu Zhou, Ziqi Wang, Xianlong Zhang, Yanjun Chen, Chao School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China Cluster and Grid Computing Lab China School of Information and Communication Technology Griffith University Australia University of Technology Sydney Australia RMIT University Australia

Object detection tasks, crucial in safety-critical systems like autonomous driving, focus on pinpointing object locations. These detectors are known to be susceptible to backdoor attacks. However, existing backdoor techniques have primarily been adapted from classification tasks, overlooking deeper vulnerabilities specific to object detection. This paper is dedicated to bridging this gap by introducing Detector Collapse (DC), a brand-new backdoor attack paradigm tailored for object detection. DC is designed to instantly incapacitate detectors (i.e., severely impairing detector's performance and culminating in a denial-of-service). To this end, we develop two innovative attack schemes: SPONGE for triggering widespread misidentifications and BLINDING for rendering objects invisible. Remarkably, we introduce a novel poisoning strategy exploiting natural objects, enabling DC to act as a practical backdoor in real-world environments. Our experiments on different detectors across several benchmarks show a significant improvement (∼10%-60% absolute and ∼2-7× relative) in attack efficacy over state-of-the-art attacks. Copyright © 2024, The Authors. All rights reserved.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

VG-Net: Sensor Time Series Anomaly Detection with Joint Variational Autoencoder and Graph Neural Network 10

VG-Net: Sensor Time Series Anomaly Detection with Joint Vari...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Wang, Shuai Liu, Shenghao Fan, Xiaoxuan Wang, Haijun Zhou, Yinxin Gao, Hanjun Lu, Hongwei Deng, Xianjun Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China Hunan Technical College of Railway High-speed China Nanjing University of Posts and Telecommunications China China National Nuclear Power Co Ltd China

ISBN: (纸本)9798331520861

Intelligent Cyber-Physical systems typically utilize sensors to gather a significant amount of raw data which often possesses temporal and high-dimensional characteristics. Ensuring the data reliability is crucial for the normal operation of the system. While most existing methods are capable of identifying anomalies in high-dimensional time series data from sensors, they often lack adequate accuracy and fail to adequately consider the correlation between sensor nodes. To address these limitations, we propose an unsupervised framework which is a combination of variational autoencoder and graph neural network(VG-Net). By jointly optimizing the reconstruction module and the prediction module, VG-Net effectively models the correlation between sensor nodes while simultaneously detecting anomalies. The reconstruction module is responsible for modeling the latent representation space and reconstructing the time series data through variational autoencoder. The prediction module leverages bidirectional long short term memory networks and neural tensor network to learn the relationships between sensor nodes, and uses graph neural network to predict the future behavior of the data. Experiments on eight real and synthetic datasets demonstrate that, compared with existing methods, VG-Net can accurately model the relationship between sensor nodes and enhance the anomaly detection performance of high-dimensional time series data. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

big-MOE: BYPASS ISOLATED GATING MOE FOR GENERALIZED MULTIMODAL FACE ANTI-SPOOFING

arXiv

引用

arXiv 2024年

作者： Ma, Yingjie Yu, Zitong Lin, Xun Xie, Weicheng Shen, Linlin Great Bay University China College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

In the domain of facial recognition security, multimodal Face Anti-Spoofing (FAS) is essential for countering presentation attacks. However, existing technologies encounter challenges due to modality biases and imbalances, as well as domain shifts. Our research introduces a Mixture of Experts (MoE) model to address these issues effectively. We identified three limitations in traditional MoE approaches to multimodal FAS: (1) Coarse-grained experts’ inability to capture nuanced spoofing indicators;(2) Gated networks’ susceptibility to input noise affecting decision-making;(3) MoE’s sensitivity to prompt tokens leading to overfitting with conventional learning methods. To mitigate these, we propose the Bypass Isolated Gating MoE (big-MoE) framework, featuring: (1) Fine-grained experts for enhanced detection of subtle spoofing cues;(2) An isolation gating mechanism to counteract input noise;(3) A novel differential convolutional prompt bypass enriching the gating network with critical local features, thereby improving perceptual capabilities. Extensive experiments on four benchmark datasets demonstrate significant generalization performance improvement in multimodal FAS task. The code is released at https://***/murInJ/bigMoE. Copyright © 2024, The Authors. All rights reserved.

关键词： HTTP

来源：评论

学校读者我要写书评

暂无评论

DarkFed: A data-Free Backdoor Attack in Federated Learning

arXiv

引用

arXiv 2024年

作者： Li, Minghui Wan, Wei Ning, Yuxuan Hu, Shengshan Xue, Lulu Zhang, Leo Yu Wang, Yichen School of Software Engineering Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

Federated learning (FL) has been demonstrated to be susceptible to backdoor attacks. However, existing academic studies on FL backdoor attacks rely on a high proportion of real clients with main task-related data, which is impractical. In the context of real-world industrial scenarios, even the simplest defense suffices to defend against the state-of-the-art attack, 3DFed. A practical FL backdoor attack remains in a nascent stage of development. To bridge this gap, we present DarkFed. Initially, we emulate a series of fake clients, thereby achieving the attacker proportion typical of academic research scenarios. Given that these emulated fake clients lack genuine training data, we further propose a data-free approach to backdoor FL. Specifically, we delve into the feasibility of injecting a backdoor using a shadow dataset. Our exploration reveals that impressive attack performance can be achieved, even when there is a substantial gap between the shadow dataset and the main task dataset. This holds true even when employing synthetic data devoid of any semantic information as the shadow dataset. Subsequently, we strategically construct a series of covert backdoor updates in an optimized manner, mimicking the properties of benign updates, to evade detection by defenses. A substantial body of empirical evidence validates the tangible effectiveness of DarkFed. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：