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

Reinforced MOOCs Concept Recommendation in Heterogeneous Information Networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Gong, Jibing Wan, Yao Liu, Ye Li, Xuewen Zhao, Yi Wang, Cheng Lin, Yuting Fang, Xiaohan Feng, Wenzheng Zhang, Jingyi Tang, Jie School of Information Science and Engineering The Key Lab for Computer Virtual Technology and System Integration The Key Laboratory for Software Engineering of Hebei Province Yanshan University No. 438 West Hebei Avenue Hebei Qinhuangdao066004 China School of Computer Science and Technology Huazhong University of Science and Technology Luoyu Road 1037 Hubei Wuhan430074 China Salesforce Research 556 Xixi Road Chicago United States School of Cyber Science and Technology Beihang University 37 Xueyuan Road Beijing100191 China Department of Computer Science Tsinghua University Beijing100084 China

Massive open online courses (MOOCs), which offer open access and widespread interactive participation through the internet, are quickly becoming the preferred method for online and remote learning. Several MOOC platforms offer the service of course recommendation to users, to improve the learning experience of users. Despite the usefulness of this service, we consider that recommending courses to users directly may neglect their varying degrees of expertise. To mitigate this gap, we examine an interesting problem © 2022, CC BY.

关键词： Information services

STAR-RIS and UAV Combination in MEC Networks: Simultaneous Task Offloading and Communications

学校读者我要写书评

暂无评论

IEEE Transactions on Communications 2025年

作者： Xiao, Han Hu, Xiaoyan Wang, Wenjie Su, Zhou Wong, Kai-Kit Yang, Kun Xi'an Jiaotong University School of Information and Communications Engineering Xi'an710049 China Southeast University National Mobile Communications Research Laboratory Nanjing210096 China Xi'an Jiaotong University School of Cyber Science and Engineering Xi'an710049 China University College London Department of Electronic and Electrical Engineering Torrington Place LondonWC1E 7JE United Kingdom Yonsei University Yonsei Frontier Lab Seoul Korea Republic of Nanjing University State Key Laboratory of Novel Software Technology Nanjing210008 China School of Intelligent Software and Engineering Suzhou215163 China University of Essex School of Computer Science and Electronic Engineering Essex United Kingdom

This paper explores a simultaneous tasks offloading and communications (STOC) scheme in mobile edge computing (MEC) networks, supported by the combination of simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) and the unmanned aerial vehicle (UAV). Different from the traditional MEC schemes, the proposed scheme concurrently considers the computation and communication capabilities of the MEC networks, which is actually more practical in reality. Specifically, an optimization problem is devised to maximize the weighted sum of the minimum computed task data and communication data, while ensuring the quality of service (QoS) constraints for STOC through joint design of time scheduling, resource allocation, active and passive beamforming, alongside with the UAV trajectory planning. This non-convex problem with strong couplings among variables is challenging to solve directly. Then, a novel alternating optimization method is proposed, leveraging the successive convex approximation (SCA) and semi-definite relaxation (SDR) techniques. We provide sufficient numerical results to validate the effectiveness of the proposed STOC scheme, which demonstrate that the proposed scheme supported by STAR-RIS and UAV outperforms five benchmark schemes in terms of performance gain. It is important to note that the proposed scheme offers a feasible and realistic way for the implementations of STOC in practical MEC networks. © 1972-2012 IEEE.

关键词： Convex optimization

TJCCT: A Two-timescale Approach for UAV-assisted Mobile Edge Computing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sun, Zemin Sun, Geng Wu, Qingqing He, Long Liang, Shuang Pan, Hongyang Niyato, Dusit Yuen, Chau Leung, Victor C.M. The College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China The School of Information Science and Technology Northeast Normal University Changchun130024 China The School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore The School of Electrical and Electronics Engineering Nanyang Technological University Singapore639798 Singapore The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada

Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) is emerging as a promising paradigm to provide aerial-terrestrial computing services in close proximity to mobile devices (MDs). However, meeting the demands of computation-intensive and delay-sensitive tasks for MDs poses several challenges, including the demand-supply contradiction between MDs and MEC servers, the demand-supply heterogeneity between MDs and MEC servers, the trajectory control requirements on energy efficiency and timeliness, and the different time-scale dynamics of the network. To address these issues, we first present a hierarchical architecture by incorporating terrestrial-aerial computing capabilities and leveraging UAV flexibility. Furthermore, we formulate a joint computing resource allocation, computation offloading, and trajectory control problem to maximize the system utility. Since the problem is a non-convex and NP-hard mixed integer nonlinear programming (MINLP), we propose a two-timescale joint computing resource allocation, computation offloading, and trajectory control (TJCCT) approach for solving the problem. In the short timescale, we propose a price-incentive model for on-demand computing resource allocation and a matching mechanism-based method for computation offloading. In the long timescale, we propose a convex optimization-based method for UAV trajectory control. Besides, we theoretically prove the stability, optimality, and polynomial complexity of TJCCT. Extended simulation results demonstrate that the proposed TJCCT outperforms the comparative algorithms in terms of the system utility, average processing rate, average completion delay, and average completion ratio. Copyright © 2024, The Authors. All rights reserved.

关键词： Computation offloading

Extracting concise bug-fixing patches from human-written patches in version control systems

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Jiang, Yanjie Liu, Hui Niu, Nan Zhang, Lu Hu, Yamin School of Computer Science and Technology Beijing Institute of Technology China Department of Electrical Engineering and Computer Science University of Cincinnati United States Key Laboratory of High Confidence Software Technologies Peking University China

High-quality and large-scale repositories of real bugs and their concise patches collected from real-world applications are critical for research in software engineering community. In such a repository, each real bug is explicitly associated with its fix. Therefore, on one side, the real bugs and their fixes may inspire novel approaches for finding, locating, and repairing software bugs;on the other side, the real bugs and their fixes are indispensable for rigorous and meaningful evaluation of approaches for software testing, fault localization, and program repair. To this end, a number of such repositories, e.g., Defects4J, have been proposed. However, such repositories are rather small because their construction involves expensive human intervention. Although bug-fixing code commits as well as associated test cases could be retrieved from version control systems automatically, existing approaches could not yet automatically extract concise bug-fixing patches from bug-fixing commits because such commits often involve bug-irrelevant changes. In this paper, we propose an automatic approach, called BugBuilder, to extracting complete and concise bug-fixing patches from human-written patches in version control systems. It excludes refactorings by detecting refactorings involved in bug-fixing commits, and reapplying detected refactorings on the faulty version. It enumerates all subsets of the remaining part and validates them on test cases. If none of the subsets has the potential to be a complete bug-fixing patch, the remaining part as a whole is taken as a complete and concise bug-fixing patch. Evaluation results on 809 real bug-fixing commits in Defects4J suggest that BugBuilder successfully generated complete and concise bug-fixing patches for forty percent of the bug-fixing commits, and its precision (99%) was even higher than human experts. Copyright © 2021, The Authors. All rights reserved.

关键词： software testing

Resistive Memory-based Neural Differential Equation Solver for Score-based Diffusion Model

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yang, Jichang Chen, Hegan Chen, Jia Wang, Songqi Wang, Shaocong Yu, Yifei Chen, Xi Wang, Bo Zhang, Xinyuan Cui, Binbin Li, Yi Lin, Ning Xu, Meng Li, Yi Xu, Xiaoxin Qi, Xiaojuan Wang, Zhongrui Zhang, Xumeng Shang, Dashan Wang, Han Liu, Qi Cheng, Kwang-Ting Liu, Ming Department of Electrical and Electronic Engineering the University of Hong Kong Hong Kong ACCESS – AI Chip Center for Emerging Smart Systems InnoHK Centers Hong Kong Science Park Hong Kong Laboratory of Microelectronic Devices and Integrated Technology Institute of Microelectronics Chinese Academy of Sciences Beijing100029 China State Key Laboratory of Integrated Chips and Systems Frontier Institute of Chip and System Fudan University Shanghai200433 China Institute of the Mind the University of Hong Kong Hong Kong University of Chinese Academy of Sciences Beijing100049 China School of Integrated Circuits Hubei Key Laboratory for Advanced Memories Huazhong University of Science and Technology Wuhan430074 China Department of Electronic and Computer Engineering the Hong Kong University of Science and Technology Hong Kong

Human brains image complicated scenes when reading a novel. Replicating this imagination is one of the ultimate goals of AI-Generated Content (AIGC). However, current AIGC methods, such as score-based diffusion, are still deficient in terms of rapidity and efficiency. This deficiency is rooted in the difference between the brain and digital computers. Digital computers have physically separated storage and processing units, resulting in frequent data transfers during iterative calculations, incurring large time and energy overheads. This issue is further intensified by the conversion of inherently continuous and analog generation dynamics, which can be formulated by neural differential equations, into discrete and digital operations. Inspired by the brain, we propose a time-continuous and analog in-memory neural differential equation solver for score-based diffusion, employing emerging resistive memory. The integration of storage and computation within resistive memory synapses surmount the von Neumann bottleneck, benefiting the generative speed and energy efficiency. The closed-loop feedback integrator is time-continuous, analog, and compact, physically implementing an infinite-depth neural network. Moreover, the software-hardware co-design is intrinsically robust to analog noise. We experimentally validate our solution with 180 nm resistive memory in-memory computing macros. Demonstrating equivalent generative quality to the software baseline, our system achieved remarkable enhancements in generative speed for both unconditional and conditional generation tasks, by factors of 64.8 and 156.5, respectively. Moreover, it accomplished reductions in energy consumption by factors of 5.2 and 4.1. Our approach heralds a new horizon for hardware solutions in edge computing for generative AI applications. © 2024, CC BY-NC-SA.

关键词： Diffusion

A Switch Architecture for Time-Triggered Transmission with Best-Effort Delivery

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Zonghui Zhu, Wenlin Shin, Kang G. Wan, Hai Song, Xiaoyu Yang, Dong Ai, Bo The Beijing Key Laboratory of Transportation Data Analysis and Mining School of Computer and Information Technology Beijing Jiaotong University Beijing100044 China The Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2121 United States The Software School Tsinghua University Beijing100084 China The Department of Electrical and Computer Engineering Portland State University PortlandOR United States The School of Electronic and Information Engineering Beijing Jiaotong University Beijing100044 China

In Time-Triggered (TT) or time-sensitive networks, the transmission of a TT frame is required to be scheduled at a precise time instant for industrial distributed real-time control systems. Other (or best-effort (BE)) frames are forwarded in a BE manner. Under this scheduling strategy, the transmission of a TT frame must wait until its scheduled instant even if it could have been transmitted sooner. On the other hand, BE frames are transmitted whenever possible but may miss deadlines or may even be dropped due to congestion. As a result, TT transmission and BE delivery are incompatible with each other. To remedy this incompatibility, we propose a synergistic switch architecture (SWA) for TT transmission with BE delivery to dynamically improve the end-to-end (e2e) latency of TT frames by opportunistically exploiting BE delivery. Given a TT frame, the SWA generates and transmits a cloned copy with BE delivery. The first frame arriving at the receiver device is delivered with a configured jitter and the other copy ignored. So, the SWA achieves shorter latency and controllable jitter, the best of both worlds. We have implemented SWA using FPGAs in an industry-strength TT switches and used four test scenarios to demonstrate SWA's improvements of e2e latency and controllable jitter over the state-of-the-art TT transmission scheme. Copyright © 2023, The Authors. All rights reserved.

关键词： Field programmable gate arrays (FPGA)

Dynamic neural network with memristive CIM and CAM for 2D and 3D vision

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Yue Zhang, Woyu Wang, Shaocong Lin, Ning Yu, Yifei He, Yangu Wang, Bo Jiang, Hao Lin, Peng Xu, Xiaoxin Qi, Xiaojuan Wang, Zhongrui Zhang, Xumeng Shang, Dashan Liu, Qi Cheng, Kwang-Ting Liu, Ming Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong Key Laboratory of Microelectronic Devices & Integrated Technology Institute of Microelectronics Chinese Academy of Sciences Beijing100049 China ACCESS – AI Chip Center for Emerging Smart Systems InnoHK Centers Hong Kong Science Park Hong Kong Institute of the Mind The University of Hong Kong Hong Kong Key Lab of Fabrication Technologies for Integrated Circuits Chinese Academy of Sciences Beijing100049 China State Key Laboratory of Integrated Chips and Systems Frontier Institute of Chip and System Fudan University Shanghai200433 China University of Chinese Academy of Sciences Beijing100049 China College of Computer Science and Technology Zhejiang University Zhejiang310027 China Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology Hong Kong

The brain is dynamic, associative and efficient. It reconfigures by associating the inputs with past experiences, with fused memory and processing. In contrast, AI models are static, unable to associate inputs with past experiences, and run on digital computers with physically separated memory and processing. We propose a hardware-software co-design, a semantic memory-based dynamic neural network (DNN) using memristor. The network associates incoming data with the past experience stored as semantic vectors. The network and the semantic memory are physically implemented on noise-robust ternary memristor-based Computing-In-Memory (CIM) and Content-Addressable Memory (CAM) circuits, respectively. We validate our co-designs, using a 40nm memristor macro, on ResNet and PointNet++ for classifying images and 3D points from the MNIST and ModelNet datasets, which not only achieves accuracy on par with software but also a 48.1% and 15.9% reduction in computational budget. Moreover, it delivers a 77.6% and 93.3% reduction in energy consumption. © 2024, CC BY.

关键词： Memristors

Reconfigurable Intelligence Surface Assisted Opportunistic Multiple Access in UAV-IoT Networks

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年

作者： Zhang, Xi-Ran Sun, Wen-Bin Zhang, Zhaolin Wang, Ling Gao, Ang Cheng, Nan Meng, Wei-Xiao Leung, Victor C. M. Northwestern Polytechnical University School of Electronics And Information Xi'an China Xidian University State Key Laboratory of ISN Xi'an710071 China Xidian University School of Cyber Engineering Xi'an710071 China Harbin Institute of Technology Communication Research Center Harbin150001 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China The University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T1Z4 Canada

Due to the advantages of flexible deployment and strong environmental adaptability of an unmanned aerial vehicle (UAV), UAVs serve as aerial base stations (BSs) to meet Quality of Services (QoSs) of ground users in internet of things (IoT) networks. NOMA (Non-Orthogonal Multiple Access) is a potential technique in wireless communications area, which can significantly improve sum spectrum efficiency (SE) of systems. To avoid the limitation of perfect CSI, opportunistic beamforming (OBF) is proposed, where a set of randomly generated weights is used to preprocess transmitted signals. Due to multiuser diversity gain introduced by OBF, OBF-NOMA systems can achieve approximate sum SE to conventional NOMA systems. Additionally, reconfigurable intelligent surfaces (RISs) are involved to overcome obstruction and obtain further improvements of SE. Therefore, this paper proposes a RIS-aid OBF-NOMA system in UAV-IoT networks, where random weights and opportunistic phase matrix are respectively applied in a UAV and RIS. Statistical characteristics of equivalent channels are derived in Nakagami-m (m≥1) fading channels. Theoretical asymptotic analyses of SE and bit error rate (BER) are then presented. Furthermore, a non-convex optimization problem is formulated to maximize SE. To obtain the optimal solution, we divide the problem into two sub-optimization problems and apply a joint iterative algorithm. Numerical results show that the proposed method achieves a satisfactory SE without complex channel estimation and perfect CSI. © 2014 IEEE.

关键词： Micro air vehicle (MAV)

Document-Level Relation Extraction with Entity Type Constraints

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Han, Ridong Peng, Tao Zhu, BeiBei Bi, Haijia Han, Jiayu Liu, Lu College of Computer Science and Technology Jilin University Jilin Changchun130012 China College of Software Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin Changchun130012 China College of Computer and Artificial Intelligence Liaoning Normal University Liaoning Dalian116081 China Department of Linguistics University of Washington SeattleWA98195 United States

Long-tail problem and multi-label problem are two commonly encountered challenges in document-level relation extraction task. Current efforts are concerned with enhancing the representations of entity pairs through Transformer or document graphs, which cannot tackle the above challenges well. Relation correlations are a potential solution, which allows head relations to assist in the training of tail ones by transferring correlation knowledge between them, and can measure the semantic distance between relations to assist the classifier in assigning multiple semantically similar relations to multi-label instances. This paper proposes to learn relation correlations from both global and local views using entity type constraints, which means that the subject-object entity types limit the scope of possible relations. Globally, we statistically construct the Type-constrained Graph between entity types and relations, which formulates all possible subject/object types for each relation. Different relations are connected by common entity types, reflecting the desired correlations. Locally, given an entity pair, the classification probability of relations matching its entity types should be greater than those unmatched. Therefore, the Type-constrained Loss is proposed to make the matched relations have greater probabilities. Detailed experiments are conducted on DocRED and DWIE datasets, and our model significantly outperforms baselines under long-tail and multi-label setups. © 2024, The Authors. All rights reserved.

关键词： Extraction