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

arXiv 2023年

作者： Qian, Junkai Jiang, Yuning Liu, Xin Wang, Qiong Wang, Ting Shi, Yuanming Chen, Wei The MoE Engineering Research Center of Software/Hardware Co-design Technology and Application The Shanghai Key Lab. of Trustworthy Computing East China Normal University China The Automatic Control Laboratory EPFL Switzerland The School of Information Science and Technology ShanghaiTech University China The State Grid Beijing Electric Power Company China The Department of Electronic Engineering Tsinghua University China

With the growing popularity of electric vehicles (EVs), maintaining power grid stability has become a significant challenge. To address this issue, EV charging control strategies have been developed to manage the switch between vehicle-to-grid (V2G) and grid-to-vehicle (G2V) modes for EVs. In this context, multi-agent deep reinforcement learning (MADRL) has proven its effectiveness in EV charging control. However, existing MADRL-based approaches fail to consider the natural power flow of EV charging/discharging in the distribution network and ignore driver privacy. To deal with these problems, this paper proposes a novel approach that combines multi-EV charging/discharging with a radial distribution network (RDN) operating under optimal power flow (OPF) to distribute power flow in real time. A mathematical model is developed to describe the RDN load. The EV charging control problem is formulated as a Markov Decision Process (MDP) to find an optimal charging control strategy that balances V2G profits, RDN load, and driver anxiety. To effectively learn the optimal EV charging control strategy, a federated deep reinforcement learning algorithm named FedSAC is further proposed. Comprehensive simulation results demonstrate the effectiveness and superiority of our proposed algorithm in terms of the diversity of the charging control strategy, the power fluctuations on RDN, the convergence efficiency, and the generalization ability. © 2023, CC BY-NC-SA.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Model-enhanced vector index 23

Model-enhanced vector index

引用

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Hailin Zhang Yujing Wang Qi Chen Ruiheng Chang Ting Zhang Ziming Miao Yingyan Hou Yang Ding Xupeng Miao Haonan Wang Bochen Pang Yuefeng Zhan Hao Sun Weiwei Deng Qi Zhang Fan Yang Xing Xie Mao Yang Bin Cui School of Computer Science & Key Lab of High Confidence Software Technologies Peking University and Microsoft Microsoft Microsoft and Aerospace Information Research Institute & Key Laboratory of Target Cognition and Application Technology Chinese Academy of Sciences Microsoft and Institute of Information Engineering Chinese Academy of Sciences Carnegie Mellon University National University of Singapore School of Computer Science & Key Lab of High Confidence Software Technologies Peking University and National Engineering Laboratory for Big Data Analysis and Applications Peking University

Embedding-based retrieval methods construct vector indices to search for document representations that are most similar to the query representations. They are widely used in document retrieval due to low latency and decent recall performance. Recent research indicates that deep retrieval solutions offer better model quality, but are hindered by unacceptable serving latency and the inability to support document updates. In this paper, we aim to enhance the vector index with end-to-end deep generative models, leveraging the differentiable advantages of deep retrieval models while maintaining desirable serving efficiency. We propose Model-enhanced Vector Index (MEVI), a differentiable model-enhanced index empowered by a twin-tower representation model. MEVI leverages a Residual Quantization (RQ) codebook to bridge the sequence-to-sequence deep retrieval and embedding-based models. To substantially reduce the inference time, instead of decoding the unique document ids in long sequential steps, we first generate some semantic virtual cluster ids of candidate documents in a small number of steps, and then leverage the well-adapted embedding vectors to further perform a fine-grained search for the relevant documents in the candidate virtual clusters. We empirically show that our model achieves better performance on the commonly used academic benchmarks MSMARCO Passage and Natural Questions, with comparable serving latency to dense retrieval solutions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Perceptive self-supervised learning network for noisy image watermark removal

arXiv

引用

arXiv 2024年

作者： Tian, Chunwei Zheng, Menghua Li, Bo Zhang, Yanning Zhang, Shichao Zhang, David School of Software Northwestern Polytechnical University Xi’an710129 China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Xi’an710129 China School of Electronics and Information Northwestern Polytechnical University Xi’an710129 China School of Computer Science Northwestern Polytechnical University National Engineering Laboratory for Integrated AeroSpace-Ground-Ocean Big Data Application Technology Xi’an710129 China Guangxi Key Lab of Multisource Information Mining & Security College of Computer Science & Engineering Guangxi Normal University Guilin541004 China Shenzhen518172 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518172 China

Popular methods usually use a degradation model in a supervised way to learn a watermark removal model. However, it is true that reference images are difficult to obtain in the real world, as well as collected images by cameras suffer from noise. To overcome these drawbacks, we propose a perceptive self-supervised learning network for noisy image watermark removal (PSLNet) in this paper. PSLNet depends on a parallel network to remove noise and watermarks. The upper network uses task decomposition ideas to remove noise and watermarks in sequence. The lower network utilizes the degradation model idea to simultaneously remove noise and watermarks. Specifically, mentioned paired watermark images are obtained in a self-supervised way, and paired noisy images (i.e., noisy and reference images) are obtained in a supervised way. To enhance the clarity of obtained images, interacting two sub-networks and fusing obtained clean images are used to improve the effects of image watermark removal in terms of structural information and pixel enhancement. Taking into texture information account, a mixed loss uses obtained images and features to achieve a robust model of noisy image watermark removal. Comprehensive experiments show that our proposed method is very effective in comparison with popular convolutional neural networks (CNNs) for noisy image watermark removal. Codes can be obtained at https://***/hellloxiaotian/PSLNet. Copyright © 2024, The Authors. All rights reserved.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

Why Blockchain Needs Graph: A Survey on Studies, Scenarios, and Solutions

SSRN

引用

SSRN 2023年

作者： Song, Jie Zhang, Pengyi Qu, Qiang Bai, Yongjie Gu, Yu Yu, Ge Software College Northeastern University Shenyang110819 China Shenzhen Institute of Advanced Technology Chinese Academy of Science Shenzhen518055 China Blockchain Lab Huawei Cloud Tech Co. Ltd Shenzhen518101 China School of Computer Science and Engineering Northeastern University Shenyang110819 China

The popularity of blockchain platforms and their applications in industry and academia keeps rising. The multifarious requirements stimulate another technique, graph data and algorithms, to join the blockchains;thus, studies, scenarios, and solutions about graph-related blockchains have emerged. State-of-the-art studies have reported on ``blockchain + graph'' solutions, but few of them natively integrate graph computing into a blockchain. Here, the ``graph integration'' means processing on-chain graph data, which contains blockchain information, in a real-time, distributed, and consensual manner. Aiming to answer why a blockchain needs graphs, and why a Graph-integrated Blockchain Platform (GiBP for short) is necessary and challengeable, we analyze literature about blockchain and graph, as well as use cases on the application-oriented and graph-related scenarios collected from practical blockchain projects. We draw the findings for three graph-related blockchain scenarios: graph algorithms for blockchains, graph data in blockchains, and graph applications on blockchains. Based on these findings, we explain why a GiBP is inevitable, the challenges of a GiBP, and the GiBPs’ main functions and features people expect. We also propose the prospection of a GiBP for future research. © 2023, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Finding Simplex Items in Data Streams

Finding Simplex Items in Data Streams

引用

International Conference on Data engineering

作者： Zhuochen Fan Jiarui Guo Xiaodong Li Tong Yang Yikai Zhao Yuhan Wu Bin Cui Yanwei Xu Steve Uhlig Gong Zhang School of Computer Science and National Engineering Laboratory for Big Data Analysis Technology and Application Peking University Beijing China Peng Cheng Laboratory Shenzhen China Theory Lab Central Research Institute 2012 Labs Huawei Technologies Co. Ltd. Hong Kong SAR China School of Electronic Engineering and Computer Science Queen Mary University of London London UK

In this paper, we propose a new type of item in data streams, called simplex items. Simplex items have frequencies in consecutive p windows that can be approximated by a polynomial of degree at most k, where k = 0, 1, 2. These low-order representable simplex items have a wide range of potential applications. For example, when k = 1, we can leverage these items whose frequency has obvious linear increase or decrease to speed up the running time of a class of machine learning models and detect network attacks such as distributed denial-of-service (DDoS), etc. To find k-degree simplex items in real time, we propose a novel sketch, namely X-Sketch, to accurately record simplex items in a compact space. The key idea of X-Sketch is to effectively filter out non-simplex items with less memory overhead, and then monitor the remaining potential simplex items and keep those items with more consecutive windows. We conduct extensive experiments, and the experimental results show that the F1 Score of X-Sketch is on average 68.6%, 57.9%, and 42.2% higher than the baseline solution for k = 0, 1, 2, respectively. Finally, we also provide a case study that applies X-Sketch to "accelerate" the two machine learning models through end-to-end experiments. We have released our source code at GitHub.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Visual Tuning

arXiv

引用

arXiv 2023年

作者： Yu, Bruce X.B. Chang, Jianlong Wang, Haixin Liu, Lingbo Wang, Shijie Wang, Zhiyu Lin, Junfan Xie, Lingxi Li, Haojie Lin, Zhouchen Tian, Qi Chen, Chang Wen Zhejiang University University of Illinois Urbana-Champaign Institute Zhejiang University China Huawei China National Engineering Research Center for Software Engineering Peking University China Peng Cheng Laboratory China College of Computer Science and Engineering Shandong University of Science and Technology China National Key Lab of General AI School of Intelligence Science and Technology Peking University China Department of Computing The Hong Kong Polytechnic University Hong Kong

Fine-tuning visual models has been widely shown promising performance on many downstream visual tasks. With the surprising development of pre-trained visual foundation models, visual tuning jumped out of the standard modus operandi that fine-tunes the whole pre-trained model or just the fully connected layer. Instead, recent advances can achieve superior performance than full-tuning the whole pre-trained parameters by updating far fewer parameters, enabling edge devices and downstream applications to reuse the increasingly large foundation models deployed on the cloud. With the aim of helping researchers get the full picture and future directions of visual tuning, this survey characterizes a large and thoughtful selection of recent works, providing a systematic and comprehensive overview of existing work and models. Specifically, it provides a detailed background of visual tuning and categorizes recent visual tuning techniques into five groups: fine-tuning, prompt tuning, adapter tuning, parameter tuning, and remapping tuning. Meanwhile, it offers some exciting research directions for prospective pre-training and various interactions in visual tuning. Copyright © 2023, The Authors. All rights reserved.

关键词： Vision

来源：评论

学校读者我要写书评

暂无评论

Computation Offloading and Task Scheduling with Fault-Tolerance for Minimizing Redundancy in Edge Computing

Computation Offloading and Task Scheduling with Fault-Tolera...

引用

IEEE International Conference on software Reliability engineering Workshops (ISSRE Wksp)

作者： Xinying Liu Jianhui Jiang Long Li School of Software Engineering Tongjj University Shanghai China RAMS Technology Lab Huawei Technologies Co. Ltd. Shenzhen China

ISBN: (纸本)9781665426046

Edge computing can effectively overcome the problems of long transmission distance and high response delay of traditional cloud computing because it can offload computing tasks to edge or cloud. However, edge resources are relatively limited, so the design of an appropriate task scheduling mechanism is critical. Furthermore, ensuring reliability in edge computing is also an urgent problem to be solved. For a 3-layer architecture with local device layer, edge layer, and cloud layer, this paper presents a computing offloading and task scheduling approach with fault-tolerance for minimizing redundancy. It consists of three procedures, i.e., offloading decision, task scheduling, and minimizing redundancy. The offloading decision algorithm is used to decide which layer the task will be executed. As for the primary-backup task scheduling algorithm, the execution time, the energy consumption, the CPU utilization and the reliability are considered for the task scheduling of edge and cloud. To meet the reliability requirement of an application, the minimizing redundancy algorithm is used during the replication process. The experimental results obtained by using EdgeCloudSim show that the proposed approach is superior to other methods given in [21] [24] [38], in terms of execution time, energy consumption and redundancy.

关键词： Cloud computing Energy consumption Scheduling algorithms Redundancy Fault tolerant systems Scheduling software reliability

来源：评论

学校读者我要写书评

暂无评论

Recommender System for Telecom Packages Based on the Deep & Cross Network

Research Square

引用

Research Square 2021年

作者： Shi, Congming Wang, Wen Wei, Shoulin Lv, Feiya School of Software Engineering Anyang Normal University China Faculty of Information Engineering and Automation Kunming University of Science and Technology China Computer Technology Application Key Lab of Yunnan Province Kunming University of Science and Technology China

With the evolution of 5G technology, the telecom industry has influenced the livelihood of people and impacted the development of the national economy significantly. To increase revenue per customer and secure long-term contracts of users, telecommunications firms and enterprises have launched different types of telecom packages to satisfy the varying requirements of users. Although several recommender systems have been proposed in recent years for telecommunication package recommendation, extracting effective feature information from large and complex consumption data remains challenging. Considering the telecom package recommendation problems, traditional recommendation methods either use complex expert feature engineering or fail to perform end-to-end deep learning training. In this study, a recommender system based on deep & cross network (DCN), deep belief network (DBN), Embedding, and Word2Vec is proposed using the powerful learning abilities of deep learning. The proposed system fits the telecom package recommender system in terms of click-through rate prediction to provide a potential solution for the recommendation challenges faced by telecom enterprises. The proposed model can effectively capture the finite order interactional features and deep hidden features. Additionally, the text information in the data is completely used to further improve the recommendation ability of the model. Moreover, the proposed method does not require feature engineering. We conducted comprehensive experiments using real-world datasets, and the results verify that our method can generate improved recommendation accuracy in comparison with those observed in DBN, DCN, deep factorization machine, and deep neural network models individually. © 2021, CC BY.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

CHECKING CONTINUOUS STOCHASTIC LOGIC AGAINST QUANTUM CONTINUOUS-TIME MARKOV CHAINS

arXiv

引用

arXiv 2022年

作者： Mei, Jingyi Xu, Ming Guan, Ji Deng, Yuxin Yu, Nengkun Shanghai Key Lab of Trustworthy Computing East China Normal University China Shanghai Key Lab of Trustworthy Computing & MoE Engineering Research Center of Software/Hardware Co-design Technology and Application East China Normal University China State Key Lab of Computer Science Institute of Software Chinese Academy of Sciences China Department of Computer Science Stony Brook University United States

Verifying quantum systems has attracted a lot of interest in the last decades. In this paper, we study the quantitative model-checking of quantum continuous-time Markov chains (quantum CTMCs). The branching-time properties of quantum CTMCs are specified by continuous stochastic logic (CSL), which is famous for verifying real-time systems, including classical CTMCs. The core of checking the CSL formulas lies in tackling multiphase until formulas. We develop an algebraic method using proper projection, matrix exponentiation, and definite integration to symbolically calculate the probability measures of path formulas. Thus the decidability of CSL is established. To be efficient, numerical methods are incorporated to guarantee that the time complexity is polynomial in the encoding size of the input model and linear in the size of the input formula. A running example of Apollonian networks is further provided to demonstrate our method. © 2022, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

3D-TOGO: Towards Text-Guided Cross-Category 3D Object Generation

arXiv

引用

arXiv 2022年

作者： Jiang, Zutao Lu, Guansong Liang, Xiaodan Zhu, Jihua Zhang, Wei Chang, Xiaojun Xu, Hang School of Software Engineering Xi’an Jiaotong University China Huawei Noah’s Ark Lab Canada Sun Yat-sen University China MBZUAI United Arab Emirates ReLER AAII University of Technology Sydney Australia PengCheng Laboratory China

Text-guided 3D object generation aims to generate 3D objects described by user-defined captions, which paves a flexible way to visualize what we imagined. Although some works have been devoted to solving this challenging task, these works either utilize some explicit 3D representations (e.g., mesh), which lack texture and require post-processing for rendering photo-realistic views;or require individual time-consuming optimization for every single case. Here, we make the first attempt to achieve generic text-guided cross-category 3D object generation via a new 3D-TOGO model, which integrates a text-to-views generation module and a views-to-3D generation module. The text-to-views generation module is designed to generate different views of the target 3D object given an input caption. prior-guidance, caption-guidance and view contrastive learning are proposed for achieving better view-consistency and caption similarity. Meanwhile, a pixelNeRF model is adopted for the views-to-3D generation module to obtain the implicit 3D neural representation from the previously-generated views. Our 3D-TOGO model generates 3D objects in the form of the neural radiance field with good texture and requires no time-cost optimization for every single caption. Besides, 3D-TOGO can control the category, color and shape of generated 3D objects with the input caption. Extensive experiments on the largest 3D object dataset (i.e., ABO) are conducted to verify that 3D-TOGO can better generate high-quality 3D objects according to the input captions across 98 different categories, in terms of PSNR, SSIM, LPIPS and CLIP-score, compared with text-NeRF and Dreamfields. Copyright © 2022, The Authors. All rights reserved.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：