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

2022 IEEE Region 10 International Conference, TENCON 2022

作者： Cao, Jiannong Department of Computing Hong Kong Polytechnic University Hong Kong Graduate School Director Research Institute for Ai of IoT Internet and Mobile Computing Lab

来源：评论

学校读者我要写书评

暂无评论

Auto Encoding Neural Process for Multi-interest Recommendation 39

Auto Encoding Neural Process for Multi-interest Recommendati...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Jiang, Yiheng Xu, Yuanbo Yang, Yongjian Yang, Funing Wang, Pengyang Li, Chaozhuo Lab of Mobile Intelligent Computing College of Computer Science and Technology Jilin University China Department of Computer and Information Science The State Key Laboratory of Internet of Things for Smart City University of Macau China Beijing University of Aeronautics and Astronautics China

ISBN: (纸本)157735897X

Multi-interest recommendation constantly aspires to an oracle individual preference modeling approach, one that satisfies the diverse and dynamic properties. Fueled by deep learning technologies, existing neural network (NN)-based recommender systems employ single-point or multi-point interest representation strategies for preference modeling, and boost the recommendation performance with remarkable margins. However, as the parameterized approximate function nature, NN-based methods remain deficiencies regarding the adaptability towards distinctive preference patterns cross different users, and the calibration over individual current intents. In this paper, we revisit multi-interest recommendation with the lens of stochastic process and Bayesian inference. Specifically, we propose to learn a distribution over functions to depict the individual diverse preferences rather than a unified function to approximate preference. Subsequently, the recommendation is equipped with the uncertainty estimation which conforms to the dynamic shifting intent. Along these lines, we establish the connection between multi-interest recommendation and neural processes by proposing NP-Rec, which realizes the flexible multiple interests modeling and uncertainty estimation, simultaneously. Empirical study on 4 real world datasets demonstrates that our NP-Rec attains superior recommendation performances to several state-of-the-art baselines, where the average improvement achieves up to 13.94%. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

HUMAN-DRIVEN EDGE computing AND COMMUNICATION: PART 2

引用

IEEE COMMUNICATIONS MAGAZINE 2018年第2期56卷 134-135页

作者： Cao, Jiannong Castiglione, Aniello Motta, Giovanni Pop, Florin Yang, Yanjiang Zhou, Wanlei Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China Internet & Mobile Computing Lab Dept Hong Kong Hong Kong Peoples R China Univ Res Facil Big Data Analyt Hong Kong Hong Kong Peoples R China Univ Salerno Fisciano Italy Univ Naples Federico II Naples Italy Natl Inst for Res and Dev Bucharest Romania Shield Lab Singapore Singapore Huawei Singapore Singapore Deakin Univ Fac Sci Engn & Built Environm Melbourne Vic Australia

Examines the new challenges posed by human-driven edge computing. The massive proliferation of personal computing devices is opening new human-centered designs that blur the boundaries between man and machine. In addition, edge services are also used to exchange the data collected and processed within the context of the IoT towards external services and/or to visualize them through traditional browser by the users. Now, the frontier for the research on the data management is related to the so-called edge computation and communication, consisting of an architecture of one or more collaborative multitude(s) of computing nodes that are placed between the sensor networks and the cloud-based services. Such a mediating level is responsible for carrying out a substantial amount of data storage and processing to reduce the retrieval time and have more control over the data with respect to cloud-based services, and to consume less resources and energy to reduce the workload.

关键词： Special issues and sections Edge computing internet of Things Access control Cryptography Data collection Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Broadcast Scheduling with Minimum Latency for Low-Duty-Cycle Wireless Sensor Networks

Energy-Efficient Broadcast Scheduling with Minimum Latency f...

引用

IEEE Internatonal Conference on mobile Adhoc and Sensor Systems (MASS)

作者： Lijie Xu Jiannong Cao Shan Lin Haipeng Dai Xiaobing Wu Guihai Chen State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Internet and Mobile Computing Lab Hong Kong Polytechnic University Hong Kong Department of Computer and Information Sciences Temple University Philadelphia USA

For low-duty-cycle wireless sensor networks, multihop broadcasting is a challenging problem, since every node has its own working schedules. In this paper, we design a novel broadcasting algorithm, of which key idea is to let some early wake-up nodes postpone their wake-up slots to overhear broadcasting message from its neighbors. This design utilizes the spatiotemporal locality of broadcasting to reduce the number of transmissions. We show that to find the broadcasting schedule with minimal latency and optimized total energy consumption is NP-hard, and then design an approximation algorithm that can guarantee the optimality of broadcasting latency and achieve a polylogarithmic approximation ratio for total energy consumption. Compared with the traditional solution, extensive experimental results show that our algorithm achieves the minimal broadcasting latency while reducing energy consumption significantly.

关键词： Broadcasting Schedules Wireless sensor networks Approximation methods Spatiotemporal phenomena Energy consumption Steiner trees

来源：评论

学校读者我要写书评

暂无评论

Middleware support for context-awareness in asynchronous pervasive computing environments

Middleware support for context-awareness in asynchronous per...

引用

International Workshop on Wireless Network Algorithm and Theory

作者： Yu, Jianping Huang, Yu Cao, Jiannong Tao, Xianping State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science and Technology Nanjing University Nanjing 210093 China Internet and Mobile Computing Lab. Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong

ISBN: (纸本)9780769543222

Context-awareness is an essential feature of pervasive applications, and runtime detection of contextual properties is one of the primary approaches to enabling context-awareness. However, existing context-aware middleware does not provide sufficient support for detection of contextual properties in asynchronous environments. We argue that in asynchronous environments, the concept of time needs to be reexamined. Instead of assuming the availability of global time or synchronous interaction, we should rely on logical time. To this end, we present the Middleware Infrastructure for Predicate detection in Asynchronous environments (MIPA), which supports context-awareness based on logical time. Design and operation of MIPA are explained in detail. We also evaluate MIPA with a comprehensive case study. The evaluation results show the cost-effectiveness and scalability of MIPA. © 2010 IEEE.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

Detection of behavioral contextual properties in asynchronous pervasive computing environments

Detection of behavioral contextual properties in asynchronou...

引用

16th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2010

作者： Huang, Yu Yu, Jianping Cao, Jiannong Tao, Xianping State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science and Technology Nanjing University Nanjing 210093 China Internet and Mobile Computing Lab. Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong

ISBN: (纸本)9780769543079

Detection of contextual properties is one of the primary approaches to enabling context-awareness. In order to adapt to temporal evolution of the pervasive computing environment, context-aware applications often need to detect behavioral properties specified over the contexts. This problem is challenging mainly due to the intrinsic asynchrony of pervasive computing environments. However, existing schemes implicitly assume the availability of a global clock or synchronous coordination, thus not working in asynchronous environments. We argue that in pervasive computing environments, the concept of time needs to be reexamined. Toward this objective, we propose the Ordering Global Activity (OGA) algorithm, which detects behavioral contextual properties in asynchronous environments. The essence of our approach is to utilize the message causality and its on-the-fly coding as logical vector clocks. The OGA algorithm is implemented and evaluated based on the open-source context-aware middleware MIPA. The evaluation results show the impact of asynchrony on the detection of contextual properties, which justifies the primary motivation of our work. They also show that OGA can achieve accurate detection of contextual properties in dynamic pervasive computing environments. © 2010 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Middleware Support for Context-awareness in Asynchronous Pervasive computing Environments

Middleware Support for Context-awareness in Asynchronous Per...

引用

IEEE/IFIP International Conference on Embedded and Ubiquitous computing, EUC

作者： Jianping Yu Yu Huang Jiannong Cao Xianping Tao Department of Computer Science and Technology Nanjing University Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Internet and Mobile Computing Lab Department of Computing Hong Kong Polytechnic University Hong Kong China

Context-awareness is an essential feature of pervasive applications, and runtime detection of contextual properties is one of the primary approaches to enabling context awareness. However, existing context-aware middleware does not provide sufficient support for detection of contextual properties in asynchronous environments. We argue that in asynchronous environments, the concept of time needs to be reexamined. Instead of assuming the availability of global time or synchronous interaction, we should rely on logical time. To this end, we present the Middleware Infrastructure for Predicate detection in Asynchronous environments (MIPA), which supports context-awareness based on logical time. Design and operation of MIPA are explained in detail. We also evaluate MIPA with a comprehensive case study. The evaluation results show the cost-effectiveness and scalability of MIPA.

关键词： Context Radiofrequency identification Context modeling Middleware Memory management Pervasive computing

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithm for constructing data aggregation trees for wireless sensor networks

引用

中国高等学校学术文摘·计算机科学 2009年第4期3卷 524-534页

作者： Deying LI Jiannong CAO Qinghua ZHU Key Laboratory of Data Engineering and Knowledge Engineering School of InformationRenmin University of ChinaBeijing 100872China Internet and Mobile Computing Lab Department of ComputingHong Kong Polytechnic UniversityHong KongChina

This paper considers the problem of constructing data aggregation trees in wireless sensor networks (WSNs)for a group of sensor nodes to send collected information to a single sink *** data aggregation tree contains the sink node,all the source nodes,and some other non-source *** goal of constructing such a data aggregation tree is to minimize the number of non-source nodes to be included in the tree so as to save *** prove that the data aggregation tree problem is NP-hard and then propose an approximation algorithm with a performance ratio of four and a greedy *** also give a distributed version of the approximation *** simulations are performed to study the performance of the proposed *** results show that the proposed algorithms can find a tree of a good approximation to the optimal tree and has a high degree of scalability.

关键词： WSNs data aggregation tree approximation algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

On accuracy of region-based localization algorithms for wireless sensor networks

On accuracy of region-based localization algorithms for wire...

引用

2009 IEEE 6th International Conference on mobile Adhoc and Sensor Systems, MASS '09

作者： Shigeng, Zhang Jiannong, Cao Lijun, Chen DaoXu, Chen State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Internet and Mobile Computing Lab Hong Kong Polytechnic University Hong Kong Hong Kong

ISBN: (纸本)9781424451135

Localization is an essential problem in Wireless Sensor Networks (WSNs). Many localization algorithms have been proposed, but few efforts have been paid on theoretical analysis on the accuracy of these algorithms. Because it is naturally to formalize range-based localization problems as deterministic parameter estimation problems, for range-based localization algorithms Cramer-Rae Lower Bound (CRLB) has been used to lower bound the variance on the estimation of sensor's positions. However, few similar works have been done for range-free localization algorithms. In this paper, based on geometry properties, we theoretically analyze bounds on accuracy for Region-Based Localization (RBL) algorithms which can be classified as one type of range-free localization algorithms. We prove that if in a RBL algorithm, the deployment region R with the area size 8 is partitioned into k regions (they can be with any shape and any area size), the localization accuracy is bounded below by -√s/k 2/3√π, no matter how the algorithm partitions R. Although the lower bound is not theoretically tight, our simulation results show that the gap between this bound and achievable accuracy is very small. We conjecture a tighter lower bound 1.003-√s/k 2/3√π when k is large enough. We also observe that in order to achieve high localization accuracy, partitioned regions should have nearly the same size. We give three examples with simulation results to show how the results can be used to set the values of the parameters, like k and the corresponding anchor/event number, in a RBL algorithm in order to achieve desired localization accuracy. ©2009 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

CED: A community-based event delivery protocol in publish/subscribe systems for Delay Tolerant Sensor Network (DTSN)

CED: A community-based event delivery protocol in publish/su...

引用

38th International Conference on Parallel Processing, ICPP-2009

作者： Zhu, Jinqi Liu, Ming Cao, Jiannong Chen, Guihai Gong, Haigang Xu, Fulong Dept. of Computer Science and Engineering University of Electronic Science and Technology of China Cheng du China Internet and Mobile Computing Lab. Department of Computing Hong Kong Polytechnic University Hong Kong State Key Laboratory for Novel Software Technology Nanjing University China

ISBN: (纸本)9780769538020

The basic operation of Delay Tolerant Sensor Network (DTSN) is to finish pervasive data gathering in networks with intermittent connectivity, while the publish/subscribe (Pub/Sub for short) paradigm is used to deliver events from a source to interested clients in an asynchronous way. Recently, to extend a Pub/Sub system in DTSN has become a promising topic. However, due to the unique characteristic of frequent partitioning in DTSN, to extend a Pub/Sub system in DTSN is a considerably difficult and challenging problem, and there is no good solution to it in existing works. To adapt Pub/Sub systems to DTSN, we propose CED, a community-based event delivery protocol. In our design, event delivery is based on several unchanged communities, which are formed by sensor nodes in the network according to their connectivity. CED consists of two components: Event delivery and queue management. In event delivery, events in a community are delivered to mobile subscribers once a subscriber comes into the community, for improving the data delivery ratio. The queue management employs both the event successful delivery time and the event survival time to decide whether an event should be delivered or dropped for minimizing the transmission overhead. The effectiveness of CED is demonstrated through comprehensive simulation studies. © 2009 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：