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

arXiv 2020年

作者： Pu, Lingjun Yuan, Xinjing Xu, Xiaohang Chen, Xu Zhou, Pan Xu, Jingdong The College of Computer Science Nankai University Tianjin300071 China The State Key Laboratory of Integrated Services Networks Xidian University Xi’an710126 China The School of Computer Science and Engineering Sun Yat-Sen University Guangzhou510006 China The Pazhou Lab. Guangzhou510335 China The Hubei Engineering Research Center on Big Data Security The School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China

To facilitate the emerging applications in 5G networks, mobile network operators will provide many network functions in terms of control and prediction. Recently, they have recognized the power of machine learning (ML) and started to explore its potential to facilitate those network functions. Nevertheless, the current ML models for network functions are often derived in an offline manner, which is inefficient due to the excessive overhead for transmitting a huge volume of dataset to remote ML training clouds and failing to provide the incremental learning capability for the continuous model updating. As an alternative solution, we propose Cocktail, an incremental learning framework within a reference 5G network architecture. To achieve cost efficiency while increasing trained model accuracy, an efficient online data scheduling policy is essential. To this end, we formulate an online data scheduling problem to optimize the framework cost while alleviating the data skew issue caused by the capacity heterogeneity of training workers from the long-term perspective. We exploit the stochastic gradient descent to devise an online asymptotically optimal algorithm, including two optimal policies based on novel graph constructions for skew-aware data collection and data training. Small-scale testbed and large-scale simulations validate the superior performance of our proposed framework. © 2020, CC BY.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

The Minority Matters: A Diversity-Promoting Collab.rative Metric Learning Algorithm

arXiv

引用

arXiv 2022年

作者： Bao, Shilong Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Alibaba Group China School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University China Key Laboratory of Big Data Mining and Knowledge Management CAS China Peng Cheng Laboratory China

Collab.rative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collab.rative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collab.rative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a diversity control regularization term to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML. © 2022, CC BY-NC-SA.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Bicycle flow dynamics on wide roads: Experiment and modeling

arXiv

引用

arXiv 2019年

作者： Guo, Ning Jiang, Rui Wong, S.C. Hao, Qing-Yi Xue, Shu-Qi Hu, Mao-Bin School of Automotive and Transportation Engineering Hefei University of Technology Hefei230009 China Key Lab. of Transport Industry of Big Data Application Technologies for Comprehensive Transport Ministry of Transport Beijing Jiaotong University Beijing100044 China Department of Civil Engineering University of Hong Kong Pokfulam Road Hong Kong School of Mathematics and Computational Science Anqing Normal University Anqing246133 China School of Engineering Science University of Science and Technology of China Hefei230026 China

Cycling is a green transportation mode, and is promoted by many governments to mitigate traffic congestion. However, studies concerning the traffic dynamics of bicycle flow are very limited. This study experimentally investigated bicycle flow dynamics on a wide road, modeled using a 3-m-wide track. The results showed that the bicycle flow rate remained nearly constant across a wide range of densities, in marked contrast to single-file bicycle flow, which exhibits a unimodal fundamental diagram. By studying the weight density of the radial locations of cyclists, we argue that this behavior arises from the formation of more lanes with the increase of global density. The extra lanes prevent the longitudinal density from increasing as quickly as in single-file bicycle flow. When the density is larger than 0.5 bicycles/m2, the flow rate begins to decrease, and stop-and-go traffic emerges. A cognitive-science-based model to reproduce bicycle dynamics is proposed, in which cyclists apply simple cognitive procedures to adapt their target directions and desired riding speeds. To incorporate differences in acceleration, deceleration, and turning, different relaxation times are used. The model can reproduce the experimental results acceptably well and may also provide guidance on infrastructure design. Copyright © 2019, The Authors. All rights reserved.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

Deep User Modeling for Content-based Event Recommendation in Event-based Social Networks

Deep User Modeling for Content-based Event Recommendation in...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Zhibo Wang Yongquan Zhang Honglong Chen Zhetao Li Feng Xia Jiangsu Key Lab. of Big Data Security & Intelligent Processing NJUPT P. R. China School of Cyber Science and Engineering Wuhan University P. R. China College of Information and Control Engineering China University of Petroleum P. R. China College of Information Engineering Xiangtan University P. R. China School of Software Dalian University of Technology P. R. China

ISBN: (纸本)9781538641293

Event-based social networks (EBSNs) are the newly emerging social platforms for users to publish events online and attract others to attend events offline. The content information of events plays an important role in event recommendation. However, the content-based approaches in existing event recommender systems cannot fully represent the preference of each user on events since most of them focus on exploiting the content information from events' perspective, and the bag-of-words model, commonly used by them, can only capture word frequency but ignore word orders and sentence structure. In this paper, we shift the focus from events' perspective to users' perspective, and propose a Deep User Modeling framework for Event Recommendation (DUMER) to characterize the preference of users by exploiting the contextual information of events that users have attended. Specifically, we utilize convolutional neural network (CNN) with word embedding to deeply capture the contextual information of a user's interested events and build up a user latent model for each user. We then incorporate the user latent model into probabilistic matrix factorization (PMF) model to enhance the recommendation accuracy. We conduct experiments on the real-world dataset crawled from a typical EBSN, ***, and the experimental results show that DUMER outperforms the compared benchmarks.

关键词： Recommender systems Machine learning Social network services Feature extraction Context modeling Conferences Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Generalized Face Forgery Detection via Adaptive Learning for Pre-trained Vision Transformer

arXiv

引用

arXiv 2023年

作者： Luo, Anwei Cai, Rizhao Kong, Chenqi Ju, Yakun Kang, Xiangui Huang, Jiwu Kot, Alex C. The School of Information Technology Jiangxi University of Finance and Economics Nanchang330013 China The School of Computer Science and Engineering Sun Yat-Sen University Guangzhou510006 China Lab. School of Electrical and Electronic Engineering Nanyang Technology University Singapore The Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China The China-Singapore International Joint Research Institute Singapore

With the rapid progress of generative models, the current challenge in face forgery detection is how to effectively detect realistic manipulated faces from different unseen domains. Though previous studies show that pre-trained Vision Transformer (ViT) based models can achieve some promising results after fully fine-tuning on the Deepfake dataset, their generalization performances are still unsatisfactory. One possible reason is that fully fine-tuned ViT-based models may disrupt the pre-trained features [1], [2] and overfit to some data-specific patterns [3]. To alleviate this issue, we present a Forgery-aware Adaptive Vision Transformer (FA-ViT) under the adaptive learning paradigm, where the parameters in the pre-trained ViT are kept fixed while the designed adaptive modules are optimized to capture forgery features. Specifically, a global adaptive module is designed to model long-range interactions among input tokens, which takes advantage of self-attention mechanism to mine global forgery clues. To further explore essential local forgery clues, a local adaptive module is proposed to expose local inconsistencies by enhancing the local contextual association. In addition, we introduce a fine-grained adaptive learning module that emphasizes the common compact representation of genuine faces through relationship learning in fine-grained pairs, driving these proposed adaptive modules to be aware of fine-grained forgery-aware information. Extensive experiments demonstrate that our FA-ViT achieves state-of-the-arts results in the cross-dataset evaluation, and enhances the robustness against unseen perturbations. Particularly, FA-ViT achieves 93.83% and 78.32% AUC scores on Celeb-DF and DFDC datasets in the cross-dataset evaluation. The code and trained model have been released at: https://***/LoveSiameseCat/FAViT. Copyright © 2023, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Solution-Based Tabu Search Algorithm for the Resource-Constrained Project Scheduling Problem with Step Deterioration

引用

Mathematical Problems in engineering 2023年第1期2023卷

作者： Dai, Huafeng Li, Lei Mao, Run Liu, Xingyue Zhou, Kun School of Mechanical Engineering Chengdu University Chengdu610105 China Technology and Equipment of Rail Transit Operation and Maintenance Key Laboratory of Sichuan Province Chengdu610031 China CNPC National Engineering Research Center for Oil & Gas Drilling Equipment Co. Ltd. Chengdu610052 China School of Information Science and Engineering Chengdu University Chengdu610105 China Key Lab. of Intelligent Manufacturing Quality Big Data Tracing and Analysis of Zhejiang Province China Jiliang University Hangzhou310018 China

This paper integrates the classical resource-constrained project scheduling problem with step deterioration and accordingly presents a solution-based tabu search (SB-TS) algorithm to solve it with challenging computations. First, we choose successor list size as the priority rule to generate the initial solution of the presented methods. Next, the corresponding solution decoding and calculation ways are defined to update the related configuration at each iteration. Compared with the state-of-the-art methods, in terms of the known datasets, the proposed SB-TS finds the optimal solution for each instance in J30 and shows strongly competitive performance in J60, J90, and J120. Then, on newly generated datasets, where the step deterioration is attached to, the comparison experimental data state that the SB-TS with high-quality solution is superior to the move-based tabu search (MB-TS) algorithm. In addition, two key components are investigated to emphasize their attributions to the proposed algorithm. © 2023 Huafeng Dai et al.

关键词： Deterioration

来源：评论

学校读者我要写书评

暂无评论

Mandari: Multi-Modal Temporal knowledge Graph-aware Sub-graph Embedding for Next-POI Recommendation

Mandari: Multi-Modal Temporal Knowledge Graph-aware Sub-grap...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoqian Liu Xiuyun Li Yuan Cao Fan Zhang Xiongnan Jin Jinpeng Chen School of Computer Science (National Pilot Software Engineering School) Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) Ministry of Education Beijing China The Technology Innovation Center of Cultural Tourism Big Data of Hebei Province Chengde China Hebei Normal University for Nationalities Chengde China Knowledge Discovery and Data Mining Research Center Zhejiang Lab Hangzhou China

Next-POI recommendation aims to explore from user check-in sequence to predict the next possible location to be visited. Existing methods are often difficult to model the implicit association of multi-modal data with user choices. Moreover, traditional methods struggle to fully explore the variation of user preferences at variable time intervals. To tackle these limitations, we propose a Multi-Modal Temporal knowledge Graph-aware Sub-graph Embedding approach (Mandari). We first construct a novel Multi-Modal Temporal knowledge Graph. Based on the proposed knowledge graph, we integrate multi-modal information and leverage the graph attention network to calculate sub-graph prediction probability. Next, we implement a temporal knowledge mining method to model the segmentation and periodicity of user check-in and obtain temporal prediction probability. Finally, we fuse temporal prediction probability with the previous sub-graph prediction probability to obtain the final result. Extensive experiments demonstrate that our approach outperforms existing state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning personalized attribute preference via multi-task auc optimization

arXiv

引用

arXiv 2019年

作者： Yang, Zhiyong Xu, Qianqian Cao, Xiaochun Huang, Qingming SKLOIS Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Lab of Intell. Info. Process. Inst. of Comput. Tech. CAS Beijing China University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management CAS Beijing China

Traditionally, most of the existing attribute learning methods are trained based on the consensus of annotations aggregated from a limited number of annotators. However, the consensus might fail in settings, especially when a wide spectrum of annotators with different interests and comprehension about the attribute words are involved. In this paper, we develop a novel multi-task method to understand and predict personalized attribute annotations. Regarding the attribute preference learning for each annotator as a specific task, we first propose a multi-level task parameter decomposition to capture the evolution from a highly popular opinion of the mass to highly personalized choices that are special for each person. Meanwhile, for personalized learning methods, ranking prediction is much more important than accurate classification. This motivates us to employ an Area Under ROC Curve (AUC) based loss function to improve our model. On top of the AUC-based loss, we propose an efficient method to evaluate the loss and gradients. Theoretically, we propose a novel closed-form solution for one of our non-convex subproblem, which leads to provable convergence behaviors. Furthermore, we also provide a generalization bound to guarantee a reasonable performance. Finally, empirical analysis consistently speaks to the efficacy of our proposed method. Copyright © 2019, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Applications of Game Theory in Vehicular Networks: A Survey

arXiv

引用

arXiv 2021年

作者： Sun, Zemin Liu, Yanheng Wang, Jian Li, Guofa Anil, Carie Li, Keqiang Guo, Xinyu Sun, Geng Tian, Daxin Cao, Dongpu College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Institute of Human Factors and Ergonomics College of Mechatronics and Control Engineering Shenzhen University Guangdong Shenzhen518060 China School of Computer Science and Engineering VIT-AP Andhra Pradesh Amaravati522237 India College of Engineering Nanjing Agricultural University Nanjing210031 China State Key Laboratory of Automotive Safety and Energy Department of Automotive Engineering Tsinghua University Beijing100084 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control School of Transportation Science and Engineering Beihang University Beijing100191 China Waterloo Cognitive Autonomous Driving Lab University of Waterloo N2L 3G1 Canada

In the Internet of things (IoT) era, vehicles and other intelligent components in an intelligent transportation system (ITS) are connected, forming vehicular networks (VNs) that provide efficient and safe traffic and ubiquitous access to various applications. However, as the number of nodes in an ITS increases, it is challenging to satisfy a varied and large number of service requests with different quality of service (QoS) and security requirements in highly dynamic VNs. Intelligent nodes in VNs can compete or cooperate for limited network resources to achieve the objective for either an individual or a group. Game theory (GT), a theoretical framework designed for strategic interactions among rational decision makers sharing scarce resources, can be used to model and analyze individual or group behaviors of communicating entities in VNs. This paper primarily surveys the recent developments of GT in solving various challenges of VNs. This survey starts with an introduction to the background of VNs. A review of GT models studied in the VNs is then introduced, including the basic concepts, classifications, and applicable vehicular issues. After discussing the requirements of VNs and the motivation of using GT, a comprehensive literature review on GT applications in dealing with the challenges of current VNs is provided. Furthermore, recent contributions of GT to VNs that are integrated with diverse emerging 5G technologies are surveyed. Finally, the lessons learned are given, and several key research challenges and possible solutions of applying GT in VNs are outlined. Copyright © 2021, The Authors. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Based Homomorphic Transaction Framework for Enhanced Consumer Security and Business Scalab.lity

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Guo, Tao Shang, Fengjun Dai, Xiangguang Liu, Qilie Chongqing University of Posts and Telecommunications School of Computer Science and Technology Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing400065 China Chongqing Three Gorges University Key Lab. of Intelligent Info. Proc. and Contr. of Chongqing Munic. Institutions of Higher Education Chongqing Engineering Research Center of Internet of Things and Intelligent Control Technology School of Three Gorges Artificial Intelligence Chongqing400044 China Chongqing University of Posts and Telecommunications School of Communications and Information Engineering Chongqing400065 China

Energy trading in distributed microgrids represents an effective means of enhancing the utilization of renewable energy. However, the aggregation of large-scale consumption data may encounter business scalab.lity issues and potential privacy exposure concerns, necessitating the development of novel secure and scalab.e frameworks for integrating consumption demands between prosumer and microgrid entities. we research focuses on providing a user-friendly transaction model for consumers and microgrid operators. Firstly, a privacy aggregation scheme for user resource requests is designed to ensure the security and decentralization of user data. In addition, the model employs a bidirectional heterogeneous resource allocation mechanism to support the optimal allocation of multiple resources, such as renewable energy, power assets, energy storage devices, and carbon credits, among different microgrids. Finally, a microgrid transaction prototype has been constructed on the Truffle development framework. In this context, smart contracts has been designed to ensure that the transactions are carried out automatically. Experimental results indicate that the scheme provides enhanced security for multi-resource trading in a cluster context relative to existing methodologies. The number of transactions increases linearly with the resource overhead, resulting in more efficient utilization of energy trading. Furthermore, the framework's scalab.lity has been demonstrated through both temporal and spatial considerations. © 1975-2011 IEEE.

关键词： Decentralized finance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：