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

Mobile Health from Developers’ Perspective

SN computer Science 2024年第1期5卷 1-23页

作者： Oliveira, Pedro Almir M. Junior, Evilasio Costa Andrade, Rossana M. C. Santos, Ismayle S. Neto, Pedro A. Santos Group of Computer Networks Software Engineering and Systems (GREat) Federal University of Ceará Ceará Brazil Federal Institute of Maranhão (IFMA) Maranhão Brazil Laboratory of Software Optimization and Testing (LOST) Federal University of Piauí Piauí Brazil

This paper extends an initial investigation of eHealth from the developers’ perspective. In this extension, our focus is on mobile health data. Despite the significant potential of this development area, few studies try to understand the challenges faced by these professionals. This perspective is relevant to identify the most used technologies and future perspectives for research investigation. Using a KDD-based process, this work analyzed eHealth and mHealth discussions from Stack Overflow (SO) to comprehend this developers’ community. We got and processed 6082 eHealth and 1832 mHealth questions. The most discussed topics include manipulating medical images, electronic health records with the HL7 standard, and frameworks to support mobile health (mHealth) development. Concerning the challenges faced by these developers, there is a lack of understanding of the DICOM and HL7 standards, the absence of data repositories for testing, and the monitoring of health data in the background using mobile and wearable devices. Our results also indicate that discussions have grown mainly on mHealth, primarily due to monitoring health data through wearables and about how to optimize resource consumption during health-monitoring. © 2023, The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd.

关键词： eHealth mHealth Mining software repositories Stack overflow

来源：评论

学校读者我要写书评

暂无评论

Efficient and Privacy-Preserving Weighted Nearby-Fit Spatial Keyword Query in Cloud

引用

IEEE Internet of Things Journal 2025年第12期12卷 20498-20511页

作者： Sun, Lili Lu, Rongxing Zheng, Yandong Zhang, Yonggang Tao, Yi 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 University of New Brunswick Faculty of Computer Science FrederictonNBE3B 5A3 Canada Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China Jilin University College of Software Changchun130012 China

In the modern digital landscape, integrating geographic locations and textual descriptions within a geo-textual dataset enhances location-based services (LBS) via spatial keyword queries, as these queries combine spatial and textual information to deliver more precise and personalized results. Additionally, the advent of cloud computing allows data owners to outsource data management and services to the cloud, boosting scalability but introducing efficiency challenges due to complex encryption. Although many schemes have been proposed for spatial keyword queries on encrypted geo-textual data, none supports matching a query keyword set with the keyword sets of multiple objects, a common query type in LBS. Imagine a user seeking to rent a house close to his/her workplace, with easy access to conveniences like supermarkets. By using nearby-fit spatial keyword queries, we can match the desired house with a house-type target object and its nearby amenities, offering more practical and flexible recommendations than traditional spatial keyword queries. Hence, in this paper, we introduce an efficient and privacy-preserving scheme called the Privacy-preserving Weighted Nearby-fit Spatial Keyword (PWNSK) query scheme. First, we design a target-oriented spatial keyword (TOSK) tree for data organization and a TOSK tree based WNSK query algorithm for efficient pruning by simultaneously utilizing locations, keywords, and distances from nearby objects to target objects. For privacy, we develop several protocols, including one for polynomial coefficient re-encoding, based on polynomial coefficient encoding and fully homomorphic encryption. Building on these protocols, we introduce our PWNSK scheme. A thorough security analysis confirms its robustness, while extensive experiments also showcase its effectiveness. © 2014 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Low-Cost Federated Broad Learning for Privacy-Preserved Knowledge Sharing in the RIS-Aided Internet of Vehicles

引用

engineering 2024年第2期33卷 178-189页

作者： Xiaoming Yuan Jiahui Chen Ning Zhang Qiang(John)Ye Changle Li Chunsheng Zhu Xuemin Sherman Shen Qinhuangdao Branch Campus Northeastern UniversityQinhuangdao 066004China State Key Laboratory of Integrated Services Networks&the Research Institute of Smart Transportation Xidian UniversityXi’an 710071China Department of Electrical and Computer Engineering University of WindsorWindsorON N9B 3P4Canada Department of Electrical and Software Engineering University of CalgaryCalgaryAB T2N 1N4Canada SUSTech Institute of Future Networks Southern University of Science and TechnologyShenzhen 518055China Department of Electrical and Computer Engineering University of WaterlooWaterlooON N2L 3G1Canada

High-efficiency and low-cost knowledge sharing can improve the decision-making ability of autonomous vehicles by mining knowledge from the Internet of Vehicles(IoVs).However,it is challenging to ensure high efficiency of local data learning models while preventing privacy leakage in a high mobility *** order to protect data privacy and improve data learning efficiency in knowledge sharing,we propose an asynchronous federated broad learning(FBL)framework that integrates broad learning(BL)into federated learning(FL).In FBL,we design a broad fully connected model(BFCM)as a local model for training client *** enhance the wireless channel quality for knowledge sharing and reduce the communication and computation cost of participating clients,we construct a joint resource allocation and reconfigurable intelligent surface(RIS)configuration optimization framework for *** problem is decoupled into two convex *** to improve the resource scheduling efficiency in FBL,a double Davidon–Fletcher–Powell(DDFP)algorithm is presented to solve the time slot allocation and RIS configuration *** on the results of resource scheduling,we design a reward-allocation algorithm based on federated incentive learning(FIL)in FBL to compensate clients for their *** simulation results show that the proposed FBL framework achieves better performance than the comparison models in terms of efficiency,accuracy,and cost for knowledge sharing in the IoV.

关键词： Knowledge sharing Internet of Vehicles Federated learning Broad learning Reconfigurable intelligent surfaces Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Covert Communication in Underlay Multi-Antenna Cognitive Radio networks

引用

IEEE Transactions on Cognitive Communications and Networking 2024年第3期11卷 1493-1507页

作者： Fan, Hongbin Yang, Weiwei Shi, Hui Pan, Gaofeng Si, Jiangbo Wang, Yutao Rong, Chuanzhen Army Engineering University of PLA College of Communications Engineering Nanjing210007 China Xiangnan University College of Computer and Artificial Intelligence Chenzhou423000 China Guilin University of Electronic Technology Guangxi Key Laboratory of Trusted Software Guilin541004 China Beijing Institute of Technology School of Cyberspace Science and Technology Beijing100081 China Xidian University State Key Laboratory of Integrated Services Networks Xi'an710100 China

In this paper, we investigated a multi-antenna covert communication in underlay cognitive radio networks (UCRNs), by considering both cases that Willie has the perfect and statistical channel state information (CSI) of the link from the secondary transmitter (ST) to the primary receiver (PR), respectively. Specifically, the optimal antenna of the secondary receiver (SR) is selected to receive the private information from ST, and then one of the remaining antennas is randomly selected to transmit jamming signals. The closed-form expressions of Willie's detection error probability, the average minimum detection error probability, the transmission outage probability and the maximum effective covert rate under both cases are derived. The maximum effective covert rate is obtained by optimising the maximum jamming power of SR. The numerical results show that the combined effect of the maximum interference tolerance of PR and the maximum interference power of SR provides the positive effective covert rate between ST and SR. It is further found that the maximum effective covert rate between ST and SR when Willie knows the perfect CSI of the ST-SR link is greater than that when Willie only knows the statistical CSI of the ST-SR link. © 2015 IEEE.

关键词： Jamming

来源：评论

学校读者我要写书评

暂无评论

FedIERF: Federated Incremental Extremely Random Forest for Wearable Health Monitoring

引用

Journal of computer Science & Technology 2023年第5期38卷 970-984页

作者：胡春雨忽丽莎袁林陆佃杰吕蕾陈益强 Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center(National Supercomputer Center in Jinan)Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan 250000China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan 25000China Institute of Information Technology Hebei University of Economics and BusinessShijiazhuang 050061China School of Information Science and Engineering Shandong Normal UniversityJinan 250358China Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China

Wearable health monitoring is a crucial technical tool that offers early warning for chronic diseases due to its superior portability and low power ***,most wearable health data is distributed across dfferent organizations,such as hospitals,research institutes,and companies,and can only be accessed by the owners of the data in compliance with data privacy *** first challenge addressed in this paper is communicating in a privacy-preserving manner among different *** second technical challenge is handling the dynamic expansion of the federation without model *** address the first challenge,we propose a horizontal federated learning method called Federated Extremely Random Forest(FedERF).Its contribution-based splitting score computing mechanism significantly mitigates the impact of privacy protection constraints on model *** on FedERF,we present a federated incremental learning method called Federated Incremental Extremely Random Forest(FedIERF)to address the second technical *** introduces a hardness-driven weighting mechanism and an importance-based updating scheme to update the existing federated model *** experiments show that FedERF achieves comparable performance with non-federated methods,and FedIERF effectively addresses the dynamic expansion of the *** opens up opportunities for cooperation between different organizations in wearable health monitoring.

关键词： federated learning incremental learning random forest wearable health monitoring

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Selective Parameter Sharing Mechanism Embedded with Multi-Level Reasoning Abstractions 26

A Dynamic Selective Parameter Sharing Mechanism Embedded wit...

引用

26th European Conference on Artificial Intelligence, ECAI 2023

作者： Liu, Yan He, Ying Ming, Zhong Yu, F. Richard Shenzhen Key Lab of Digital & Intelligent Technologies & Systems College of Computer Science and Software Engineering Shenzhen University China State Key Laboratory of Integrated Services Networks Xidian University China Shenzhen China

ISBN: (纸本)9781643684369

Cooperative multi-agent reinforcement learning (Co-MARL) commonly employs different parameter sharing mechanisms, such as full and partial sharing. However, imprudent application of these mechanisms can potentially constrain policy diversity and limit cooperation flexibility. Recent methods that group agents into distinct sharing categories often exhibit poor performance due to challenges in precisely differentiating agents and neglecting the issue of promoting cooperation among these categories. To address these issues, we introduce a dynamic selective parameter sharing mechanism embedded with multi-level reasoning abstractions (DSPS-MA). Our approach uses self-comparison sequences to infer agents' abstract concepts, defining the differences between agents and allowing them to dynamically select partners to share parameters based on these abstract concepts. We also design an intrinsic reward to offer comprehensive collaboration guidance for agents, and introduce a policy cosine similarity regularization term to ensure sufficient policy diversity. Empirical evaluations demonstrate that our approach yields higher returns and faster convergence than state-of-the-art methods. © 2023 The Authors.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

A Novel Association Rule Mining Method for Streaming Temporal Data

引用

Annals of Data Science 2022年第4期9卷 863-883页

作者： Zheng, Hui Li, Peng He, Jing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Jiangsu Nanjing China School of Software and Electrical Engineering Swinburne University of Technology Melbourne Australia

Streaming temporal data contains time stamps and values, challenging to quantify relationships of time stamps and corresponding values. Moreover, the characteristics and relationships of streaming temporal data are not invariable. Thus, it is impossible to analyse all data by a trained model at the beginning of data streams. Practically, the trained model to analyse streaming temporal data should change according to the increasing volume of data. Association rule mining, on the other hand, can find potential relationships from given data. This paper proposes an association rule mining method for streaming temporal data to discover potential relationships from streaming temporal data. Our experiments verify our proposed method. A public data set is applied to compare the performance of the proposed method and its counterpart. A small data set is also applied for two case studies to further illustrate our proposed method mine association rules with streaming temporal data with time stamps and corresponding values. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Association rule mining Potential relationships Streaming data

来源：评论

学校读者我要写书评

暂无评论

Uplink Control Information Based Clustered Access and Discontinuous Reception Management for mMTC

引用

IEEE Communications Letters 2025年第6期29卷 1380-1384页

作者： Wang, Shao-Di Wang, Chang-Long Wang, Hui-Ming Zhou, Feng Leung, Victor C. M. Xidian University Key Laboratory of Electronic Information Countermeasure and Simulation Technology of Ministry of Education Xi’an710071 China Xi’an Jiaotong University School of Information and Communication Engineering Ministry of Education Key Lab for Intelligent Networks and Network Security Xi’an710049 China Shenzhen MSU BIT University Artificial Intelligence Research Institute Shenzhen518172 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China The University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T 1Z4 Canada

Uplink control information (UCI) and discontinuous reception (DRX) play important roles for massive machine type communication (mMTC). Despite their standalone significance, a conspicuous gap exists in comprehensively exploring the synergy between UCI and DRX concerning both energy conservation and latency reduction for mMTC. In this letter, we propose a UCI-based clustered access and DRX management (UCADM) scheme that strikes a balance between these two critical performance metrics, reducing energy usage while preserving low latency in uplink-downlink interaction for mMTC. Specifically, we present a strictly feasible solution for the proposed UCADM scheme by using the spectral radius and the constraint projection, which can effectively solve DRX switching operations as indicated by scheduling information from UCI. Simulation results confirm the effectiveness of our scheme. © 1997-2012 IEEE.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Analysis of the Spatial Smoothing Influence on the Perfomance of 2D-MUSIC for Ultra-Dense networks

Analysis of the Spatial Smoothing Influence on the Perfomanc...

引用

2023 Wave Electronics and its Application in Information and Telecommunication Systems, WECONF 2023

作者： Grishin, Ilya Fokin, Grigoriy Sevidov, Vladimir Okuneva, Darina The Bonch-Bruevich SPbSUT Department of Communication Networks Saint Petersburg Russia The Bonch-Bruevich SPbSUT Laboratory of Software Defined Radio Saint Petersburg Russia S.M. Budyonny VAS Department of Radio Engineering Saint Petersburg Russia The Bonch-Bruevich SPbSUT Department of Software Engineering and Computer Facilities Saint Petersburg Russia

ISBN: (纸本)9798350348293

In this paper, we analyze the spatial smoothing as a method of signal processing, preceding the algorithm for determining the direction of arrival of 2D-MUSIC signals. The purpose of the method is to compensate the possible coherence of signals coming from different user devices to the uniform rectangular antenna array of the base station of the ultra-dense network operating in the millimeter wavelength range. The results of computational experiments allow to estimate the dependence of the performance of the 2D-MUSIC algorithm to the spatial smoothing procedure. © 2023 IEEE.

关键词： Direction of arrival

来源：评论

学校读者我要写书评

暂无评论

Anonym-Recognizer: Relationship-preserving Face Anonymization and Recognition 3

Anonym-Recognizer: Relationship-preserving Face Anonymizatio...

引用

3rd International Workshop on Human-Centric Multimedia Analysis, HCMA 2022, held in conjunction with the ACM Multimedia 2022

作者： Peng, Chunlei Wan, Shuang Miao, Zimin Liu, Decheng Zheng, Yu Wang, Nannan School of Cyber Engineering Xidian University Xi'an China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China State Key Laboratory of Integrated Services Networks Xidian University Xi'an China

ISBN: (纸本)9781450394925

With the widespread application of big data technology, we are exposed to more and more video monitoring. To prevent serious social problems caused by face data leakage, face anonymization has become an important kind of method to protect face privacy. The face anonymization mentioned in this paper refers to the anonymization generation of the visual appearance in face images. Existing face anonymization methods mainly focus on removing identity information. However, in the scenario of face recognition technology that needs to protect privacy, existing face anonymization technology makes anonymized faces that can no longer be used for face recognition, limiting the application scope of face anonymization. Therefore, when using face anonymization, it is equally important to ensure that the anonymized face images can still be used for downstream tasks such as face recognition. To this end, we propose Anonym-Recognizer, a relationship-preserving face anonymization and recognition method. Our method uses relationship cyphertext which can be any binary identity number representing the identity of the image owner and designs a generative adversarial network to perform face anonymization and relationship cyphertexts embedding. In our framework, we first use Visual Anonymizer to manipulate the visual appearance of the input image, then use Cyphertext Embedder to get the anonymized image with the identity information embedded. With the help of Anonym Recognizer, the face recognition system can extract the relationship cyphertexts from the anonymized image as the credentials to match the identity information. The proposed Anonym-Recognizer provides a new perspective for the recognition and application of anonymized face images. Experiments on the Megaface dataset show that our method can encourage a 100% recognition accuracy on anonymized faces while finishing the task of face anonymization with high qualitative and quantitative quality. © 2022 ACM.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：