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

arXiv 2023年

作者： Xing, Zhibo Zhang, Zijian Liu, Jiamou Zhang, Ziang Li, Meng Zhu, Liehuang Russello, Giovanni The School of Cyberspace Science and Technology Beijing Institute of Technology Beijing China The School of Computer Science The University of Auckland Auckland New Zealand Southeast Institute of Information Technology Beijing Institute of Technology Fujian China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Anhui Hefei230601 China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology China

With the rapid advancement of artificial intelligence technology, the usage of machine learning models is gradually becoming part of our daily lives. High-quality models rely not only on efficient optimization algorithms but also on the training and learning processes built upon vast amounts of data and computational power. However, in practice, due to various challenges such as limited computational resources and data privacy concerns, users in need of models often cannot train machine learning models locally. This has led them to explore alternative approaches such as outsourced learning and federated learning. While these methods address the feasibility of model training effectively, they introduce concerns about the trustworthiness of the training process since computations are not performed locally. Similarly, there are trustworthiness issues associated with outsourced model inference. These two problems can be summarized as the trustworthiness problem of model computations: How can one verify that the results computed by other participants are derived according to the specified algorithm, model, and input data? To address this challenge, verifiable machine learning (VML) has emerged. This paper presents a comprehensive survey of zero-knowledge proof-based verifiable machine learning (ZKP-VML) technology. We first analyze the potential verifiability issues that may exist in different machine learning scenarios. Subsequently, we provide a formal definition of ZKP-VML. We then conduct a detailed analysis and classification of existing works based on their technical approaches. Finally, we discuss the key challenges and future directions in the field of ZKP-based VML. © 2023, CC BY.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Not all diffusion model activations have been evaluated as discriminative features 24

Not all diffusion model activations have been evaluated as d...

引用

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

作者： Benyuan Meng Qianqian Xu Zitai Wang Xiaochun Cao Qingming Huang Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Peng Cheng Laboratory Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Key Laboratory of Big Data Mining and Knowledge Management CAS

ISBN: (纸本)9798331314385

Diffusion models are initially designed for image generation. Recent research shows that the internal signals within their backbones, named activations, can also serve as dense features for various discriminative tasks such as semantic segmentation. Given numerous activations, selecting a small yet effective subset poses a fundamental problem. To this end, the early study of this field performs a large-scale quantitative comparison of the discriminative ability of the activations. However, we find that many potential activations have not been evaluated, such as the queries and keys used to compute attention scores. Moreover, recent advancements in diffusion architectures bring many new activations, such as those within embedded ViT modules. Both combined, activation selection remains unresolved but overlooked. To tackle this issue, this paper takes a further step with a much broader range of activations evaluated. Considering the significant increase in activations, a full-scale quantitative comparison is no longer operational. Instead, we seek to understand the properties of these activations, such that the activations that are clearly inferior can be filtered out in advance via simple qualitative evaluation. After careful analysis, we discover three properties universal among diffusion models, enabling this study to go beyond specific models. On top of this, we present effective feature selection solutions for several popular diffusion models. Finally, the experiments across multiple discriminative tasks validate the superiority of our method over the SOTA competitors. Our code is available at https://***/Darkbblue/generic-diffusion-feature.

关键词：

来源：评论

学校读者我要写书评

暂无评论

USER: A unified information search and recommendation model based on integrated behavior sequence

arXiv

引用

arXiv 2021年

作者： Yao, Jing Dou, Zhicheng Xie, Ruobing Lu, Yanxiong Wang, Zhiping Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China WeChat Search Application Department Tencent China Beijing Key Laboratory of Big Data Management and Analysis Methods Key Laboratory of Data Engineering and Knowledge Engineering MOE

Search and recommendation are the two most common approaches used by people to obtain information. They share the same goal - satisfying the user's information need at the right time. There are already a lot of Internet platforms and Apps providing both search and recommendation services, showing us the demand and opportunity to simultaneously handle both tasks. However, most platforms consider these two tasks independently - they tend to train separate search model and recommendation model, without exploiting the relatedness and dependency between them. In this paper, we argue that jointly modeling these two tasks will benefit both of them and finally improve overall user satisfaction. We investigate the interactions between these two tasks in the specific information content service domain. We propose first integrating the user's behaviors in search and recommendation into a heterogeneous behavior sequence, then utilizing a joint model for handling both tasks based on the unified sequence. More specifically, we design the Unified Information SEarch and Recommendation model (USER), which mines user interests from the integrated sequence and accomplish the two tasks in a unified way. Experiments on a dataset from a real-world information content service platform verify that our model outperforms separate search and recommendation baselines. Copyright © 2021, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Curb Parking Occupancy Prediction Based on Real-Time Fusion of Multi-View Spatial-Temporal Information Using Graph Attention Gated Networks

SSRN

引用

SSRN 2024年

作者： Qian, Chonghui Yang, Kexu He, Jiangping Peng, Xiaojing Huang, Hengjun School of Statistics and Data Science Lanzhou University of Finance and Economics Lanzhou730020 China Key Laboratory of Digital Economy and Social Computing Science of Gansu Lanzhou730020 China School of Information Engineering and Artificial Intelligence Lanzhou University of Finance and Economics Lanzhou730020 China School of Business Administration Lanzhou University of Finance and Economics Lanzhou730020 China

Securing available curb parking space is crucial for reducing traffic congestion, cutting cruising time, and lessening pollution in smart cities. Accurate and timely parking occupancy predictions are essential for intelligent parking systems. However, most existing methods sequentially fuse spatial-temporal information using tandem concatenation, facing challenges such as spatial information lag and insufficient feature fusion. These methods fail to concurrently process spatial-temporal information, hindering real-time fusion capabilities. Furthermore, current research has limitations in utilizing spatial data, primarily focusing on geographic distance and points of interest (POI) information, while overlooking spatial features related to curb parking utilization, such as accessibility (i.e., the time to reach adjacent parking lots). Therefore, this study proposes the multi-view graph attention gated recurrent unit network (MGA-GRU) model for predicting curb parking occupancy. The model uses graph attention gated units to simultaneously fuse spatial-temporal data while constructing an integrated graph to aggregate multi-view spatial information. The proposed model undergoes validation tests using curb parking data from July 2019 to December 2020 in Lanzhou, China. The findings indicate that the MGA-GRU model outperforms the baseline for both short-term and long-term periods, underscoring its effectiveness in predicting curb parking space availability and providing valuable insights for improving parking system functionality. © 2024, The Authors. All rights reserved.

关键词： data fusion

来源：评论

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs

CLDG: Contrastive Learning on Dynamic Graphs

引用

International Conference on data engineering

作者： Yiming Xu Bin Shi Teng Ma Bo Dong Haoyi Zhou Qinghua Zheng Department of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China Department of Distance Education Xi’an Jiaotong University China School of Software Beihang University China Advanced Innovation Center for Big Data and Brain Computing Beihang University China

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph’s augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Intervention Prediction for Patients with Pressure Injury Using Random Forest 12

Intervention Prediction for Patients with Pressure Injury Us...

引用

12th IEEE International Conference on Big knowledge, ICBK 2021

作者： Jin, Liuqi Pan, Yan Yang, Jiaoyun Han, Lin Lv, Lin Raviv, Miki An, Ning Hefei University of Technology Key Laboratory of Knowledge Engineering With Big Data of The Ministry of Education School of Computer Science and Information Engineering Hefei China Lanzhou University Evidence-Based Nursing Center School of Nursing Lanzhou China Wound and Ostomy Care Center Gansu Provincal Hospital Lanzhou China Vitalerter LTD Ha-Yarden Airport City Israel

ISBN: (纸本)9781665438582

Pressure injury (PI) is one of the major causes of short-term death. Early intervention for patients at risk plays an essential role in PI. However, many nurses may ignore risks. This paper aims to establish a model to predict interventions according to the patient's physical signs, which can help nurses develop care plans. We used data from 1, 483 patients with 25 characteristics and 17 interventions. We use the Random Forest and Particle Swarm Optimization (PSO) to optimize model parameters. Then we compared it with KNN, SVM, and Decision Tree. The 10-fold cross-validation result showed that the Random Forest has better accuracy than other methods, with an f1 score of 0.84. This finding proved the feasibility of using machine learning to help formulate care plans according to the classification of index prediction results. Our model shows that hemoglobin, Braden PI score, and age are the three most influential risk factors. © 2021 IEEE.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

HUSS: A Heuristic Method for Understanding the Semantic Structure of Spreadsheets

HUSS: A Heuristic Method for Understanding the Semantic Stru...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Xindong Wu Hao Chen Chenyang Bu Shengwei Ji Zan Zhang Victor S. Sheng Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science Texas Tech University Lubbock TX USA

Spreadsheets contain a lot of valuable data and have many practical applications. The key technology of these practical applications is how to make machines understand the semantic structure of spreadsheets, e.g., identifying cell function types and discovering relationships between cell pairs. Most existing methods for understanding the semantic structure of spreadsheets do not make use of the semantic information of cells. A few studies do, but they ignore the layout structure information of spreadsheets, which affects the performance of cell function classification and the discovery of different relationship types of cell pairs. In this paper, we propose a Heuristic algorithm for Understanding the Semantic Structure of spreadsheets (HUSS). Specifically, based on the existing cell function classification model [11], we propose five types of heuristic rules to extract four different types of cell pairs, based on the cell style and spatial location information. Our experimental results on two real-world datasets demonstrate that the proposed method HUSS can effectively understand the semantic structure of spreadsheets and outperforms corresponding baselines.

关键词： Analytical models Heuristic algorithms Semantics Layout Feature extraction Classification algorithms data mining

来源：评论

学校读者我要写书评

暂无评论

New entanglement-assisted quantum codes from negacyclic codes

arXiv

引用

arXiv 2023年

作者： Chen, Xiaojing Lu, Xingbo Zhu, Shixin Jiang, Wan Wang, Xindi School of Internet Anhui University Anhui Hefei230039 China School of Mathematics Hefei University of Technology Anhui Hefei230601 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Anhui Hefei230601 China School of Computer and Information Hefei University of Technology Anhui Hefei230601 China

The theory of entanglement-assisted quantum error-correcting codes (EAQECCs) is a generalization of the standard stabilizer quantum error-correcting codes, which can be possibly constructed from any classical codes by relaxing the duality condition and utilizing preshared entanglement between the sender and receiver. In this paper, a new family of EAQECCs is constructed from negacyclic codes of length n = q2a+1, where q is an odd prime power, a = m22+1 and m is an odd integer. Some new entanglement-assisted quantum maximum distance separable (EAQMDS) codes are obtained in the sense that their parameters are not covered by the previously known ones. Copyright © 2023, The Authors. All rights reserved.

关键词： Quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

Optimizing Carbon Emissions in Green Logistics for Time-Dependent Routing

SSRN

引用

SSRN 2024年

作者： Liu, Yiming Yu, Yang Roberto, Baldacci Tang, Jiafu Sun, Wei State Key Laboratory of Synthetic Automation for Process Industries Institute of Intelligent Data and Systems Engineering Northeastern University Shenyang110819 China Dalian University of Technology School of Economics and Management Liaoning Dalian116024 China Division of Engineering Management and Decision Sciences College of Science and Engineering Hamad Bin Khalifa University Qatar Foundation P.O. Box 34110 Doha Qatar College of Management Science and Engineering Dongbei University of Finance and Economics Shahekou Dalian116026 China Business School Liaoning University Shenyang110316 China

This paper considers a green vehicle routing problem termed the time-dependent green vehicle routing problem with time windows (TDGVRPTW). The TDGVRPTW is an extension of the green vehicle routing problem with time windows in green logistics. It considers time-dependent vehicle speed and aims to minimize carbon emissions. Since the travel times and carbon emissions between locations depend on the departure time from the starting location, optimizing carbon emissions requires determining the optimal departure times from both the depot and customers. This paper presents a branch-price-and-cut (BPC) algorithm to solve the TDGVRPTW. The problem is formulated based on a set-partitioning model. To solve the pricing problem associated with the set-partitioning model, we first define backward non-dominated time-dependent arcs and optimal timed routes. We also introduce three types of routes, forward, backward, and patchwork optimal timed routes, and analyze their characteristics. Then, we introduce a method to adjust the times in backward and patchwork optimal timed routes from the latest to the earliest. We prove that this method guarantees correctness and effectively reduces complexity. We propose a bidirectional labeling algorithm to generate routes. The pricing problem employs state-of-the-art techniques, including limited memory subset row cuts (lm-SRCs), ng-route relaxation, and bucket graphs to enhance the algorithm’s efficiency. The BPC algorithm is tested on a set of instances derived from benchmark instances in the literature. The results demonstrate the effectiveness of the proposed algorithm in solving the TDGVRPTW. © 2024, The Authors. All rights reserved.

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

Generative AI for Advanced UAV Networking

引用

IEEE Network 2024年

作者： Sun, Geng Xie, Wenwen Niyato, Dusit Du, Hongyang Kang, Jiawen Wu, Jing Sun, Sumei Zhang, Ping Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China Nanyang Technological University College of Computing and Data Science Singapore639798 Singapore The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong999077 Hong Kong Guangdong University of Technology School of Automation Guangzhou510006 China Agency for Science Technology and Research Institute for Infocomm Research Singapore639798 Singapore Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing100876 China

With the impressive achievements of chatGPT and Sora, generative artificial intelligence (GAI) has received increasing attention. Not limited to the field of content generation, GAI is also widely used to solve the problems in wireless communication scenarios due to its powerful learning and generalization capabilities. Therefore, we discuss key applications of GAI in improving unmanned aerial vehicle (UAV) communication and networking performance in this article. Specifically, we first review the key technologies of GAI and the important roles of UAV networking. Then, we show how GAI can improve the communication, networking, and security performances of UAV systems. Subsequently, we propose a novel framework of GAI for advanced UAV networking, and then present a case study of UAV-enabled spectrum map estimation and transmission rate optimization based on the proposed framework to verify the effectiveness of GAI-enabled UAV systems. Finally, we discuss some important open directions. © 2024 IEEE.

关键词： Aircraft communication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：