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

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

来源：评论

学校读者我要写书评

暂无评论

LDE-UNet: A Novel Model for Rapid COVID-19 Diagnosis via CT Image Segmentation

LDE-UNet: A Novel Model for Rapid COVID-19 Diagnosis via CT ...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Wang, QiSong Wu, JiaRou Wang, YingZhuo Qu, HuiLi Nie, Shanling Yang, Hai East China University of Science and Technology Department of Computer Science and Engineering Shanghai China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China The University of Sydney Faculty of Engineering Australia

ISBN: (纸本)9798350337488

The COVID-19 pandemic has had a profound impact on human society. It has highlighted the need for faster diagnostic methods. Research has shown that combining semantic segmentation with traditional medical approaches can significantly accelerate the process. To address this, leveraging COVID-19 CT images, our team designs a revolutionary semantic segmentation model called Level of Detail Enhancement U-Net (LDE-UNet), which shows the lesion area on CT images. By introducing the LDE block, the model has the unique advantage of overcoming the loss of data details during the downsampling process by emphasizing and transmitting details at the same level. Our SOTA model outperforms the second-best model by at least 0.7% in the most critical indicator precision. Compared with other models, LDE-UNet's strong reliability determines its ability to be used in the medical field to accelerate the localization and division of lesion areas on CT images by professional doctors, thus completing patient diagnosis faster. In addition, we also propose a standardized method for processing medical images. © 2023 IEEE.

关键词： COVID-19 Downsample LDE-UNet Semantic segmentation

来源：评论

学校读者我要写书评

暂无评论

RAT: A Refactoring-Aware Tool for Tracking Code History 24

RAT: A Refactoring-Aware Tool for Tracking Code History

引用

46th International Conference on software Engineering: Companion, ICSE-Companion 2024

作者： Niu, Feifei Shao, Junqian Xu, Chaofan Mayr-Dorn, Christoph Assunção, Wesley K. G. Huang, Liguo Li, Chuanyi Ge, Jidong Luo, Bin Egyed, Alexander State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Institute for Software Systems Engineering Johannes Kepler University Linz Austria Department of Computer Science North Carolina State University North Carolina United States Department of Computer Science and Engineering Southern Methodist University DallasTX United States

ISBN: (纸本)9798400705021

History of code elements is essential for software maintenance tasks. However, code refactoring is one of the main causes that makes obtaining a consistent view on code evolution difficult as renaming or moving source code elements break such history. To this end, this paper presents RAT, a refactoring-aware tool for keeping track of code elements evolution across time, not just in terms of revisions but also in terms of refactoring. This is the first tool that enables fine-grained code element traceability of the whole repository. Empirical evaluation of leveraging our tool in three bug localization techniques relying on code history shows significant improvement in localization accuracy. Based on our findings, we believe that many of the state-of-the-art approaches using past source code data would benefit from our tool. Demo Tool: https://***/feifeiniu-se/RAT-Demo. Demo Video: https://***/VI-xwUaIPp4. © 2024 IEEE computer Society. All rights reserved.

关键词： Rats

来源：评论

学校读者我要写书评

暂无评论

A New Method of Image Restoration technology Based on WGAN

引用

computer Systems Science & Engineering 2022年第5期41卷 689-698页

作者： Wei Fang Enming Gu Weinan Yi Weiqing Wang Victor S.Sheng School of Computer&Software Engineering Research Center of Digital ForensicsMininstry of EducationNanjing University of Information Science&TechnologyNanjing210044China Provincial Key Laboratory for Computer Information Processing Technology Soochow UniversitySuzhou215325China Texas Tech University USA

With the development of image restoration technology based on deep learning,more complex problems are being solved,especially in image semantic inpainting based on ***,image semantic inpainting techniques are becoming more ***,due to the limitations of memory,the instability of training,and the lack of sample diversity,the results of image restoration are still encountering difficult problems,such as repairing the content of glitches which cannot be well integrated with the original ***,we propose an image inpainting network based on Wasserstein generative adversarial network(WGAN)*** the corresponding technology having been adjusted and improved,we attempted to use the Adam algorithm to replace the traditional stochastic gradient descent,and another algorithm to optimize the training used in recent *** evaluated our algorithm on the ImageNet *** obtained high-quality restoration results,indicating that our algorithm improves the clarity and consistency of the image.

关键词： Image restoration WGAN DCGAN context semantic

来源：评论

学校读者我要写书评

暂无评论

Analyzing the Trade-Off Between Complexity Measures, Ambiguity in Insertion System and Its Application in Natural Languages 11th

Analyzing the Trade-Off Between Complexity Measures, Ambigu...

引用

11th International Conference on Recent Trends in Computing, ICRTC 2022

作者： Mahendran, Anand Kannan, Kumar Hamada, Mohammed Laboratory of Theoretical Computer Science Higher School of Economics Moscow Russia School of Computer Science and Engineering Vellore Institute of Technology Vellore India Software Engineering Lab The University of Aizu Aizuwakamatsu Japan

ISBN: (纸本)9789811988240

Insertion is one of the basic operations in DNA computing. Based on this basic operation, an evolutionary computation model, the insertion system, was defined. For the evolutionary computation model defined above, varying levels of ambiguity and basic descriptional complexity measures have been defined. In this paper, we define twelve new (descriptional) complexity measures based on the integral parts of the derivation, such as axioms, strings to be inserted, and contexts used in the insertion rules. Later, we analyze the trade-off among the complexity measures and the existing ambiguity levels. Finally, we examine the application of the analyzed trade-off in natural languages. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

RePaint-NeRF: NeRF Editting via Semantic Masks and Diffusion Models 32

RePaint-NeRF: NeRF Editting via Semantic Masks and Diffusion...

引用

32nd International Joint Conference on Artificial Intelligence, IJCAI 2023

作者： Zhou, Xingchen He, Ying Richard Yu, F. Li, Jianqiang Li, You College of Computer Science and Software Engineering Shenzhen University China China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China

ISBN: (纸本)9781956792034

The emergence of Neural Radiance Fields (NeRF) has promoted the development of synthesized high-fidelity views of the intricate real world. However, it is still a very demanding task to repaint the content in NeRF. In this paper, we propose a novel framework that can take RGB images as input and alter the 3D content in neural scenes. Our work leverages existing diffusion models to guide changes in the designated 3D content. Specifically, we semantically select the target object and a pre-trained diffusion model will guide the NeRF model to generate new 3D objects, which can improve the editability, diversity, and application range of NeRF. Experiment results show that our algorithm is effective for editing 3D objects in NeRF under different text prompts, including editing appearance, shape, and more. We validate our method on both real-world datasets and synthetic-world datasets for these editing tasks. Please visit https://*** for a better view of our results. © 2023 International Joint Conferences on Artificial Intelligence. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Ant: An Efficient Lossless Compression Algorithm for IoT Time Series Data 21

Ant: An Efficient Lossless Compression Algorithm for IoT Tim...

引用

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on Big Data and Cloud Computing, 16th IEEE International Conference on Social Computing and Networking and 13th International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Li, Junhui Xu, Guangping Yang, Hongzhang Wu, Yulei Tianjin University of Technology School of Computer Science and Engineering Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin China Key Laboratory of Computer Vision and System Ministry of Education China University of Bristol Faculty of Science and Engineering Bristol United Kingdom

ISBN: (纸本)9798350329223

In various applications in Internet of Things like industrial monitoring, large amounts of floating-point time series data are generated at an unprecedented rate. Efficient compression algorithms can effectively reduce the size of data, enhance transmission performance and storage efficiency, and simultaneously lower storage costs. Therefore, there is a need for lightweight and efficient stream compression algorithms. In this paper, we propose a novel lossless floating-point data compression algorithm called Ant. The main idea is to encode double-precision floating-point numbers into integer form, calculate the delta between adjacent values, and then convert the delta into unsigned integers. This encoding method effectively reduces storage costs and improves data compression efficiency. Extensive experiments on real-world datasets demonstrate that our algorithm achieves compression speeds at least as fast as state-of-the-art streaming methods, and a 63% relative improvement in average compression rate. © 2023 IEEE.

关键词： Storage efficiency

来源：评论

学校读者我要写书评

暂无评论

BonsaiKV: Towards Fast, Scalable, and Persistent Key-Value Stores with Tiered, Heterogeneous Memory System 50th

BonsaiKV: Towards Fast, Scalable, and Persistent Key-Value S...

引用

50th International Conference on Very Large Data Bases, VLDB 2024

作者： Cai, Miao Shen, Junru Yuan, Yifan Qu, Zhihao Ye, Baoliu Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University School of Computer and Information Hohai University China School of Computer and Information Hohai University China Intel Labs China State Key Laboratory for Novel Software Technology Nanjing University China

Emerging NUMA/CXL-based tiered memory systems with heterogeneous memory devices such as DRAM and NVMM deliver ultrafast speed, large capacity, and data persistence all at once, offering great promise to high-performance in-memory key-value stores. To fully unleash the performance potential of such memory systems, this paper presents BonsaiKV, a key-value store that makes the best use of different components in a tiered memory system. The core of BonsaiKV is a tri-layer hierarchical storage architecture that separates data indexing, persistence, and scalability from each other and realizes each of them within a specialized software-hardware layer. We design BonsaiKV with a set of novel techniques, including collaborative tiered indexing, NVMM congestion control mechanisms, fine-grained data striping, and NUMA-aware data management, to leverage hardware strengths and tackle device deficiencies. We compare BonsaiKV with state-of-the-art NVMM-optimized key-value stores and persistent index structures using a variety of YCSB workloads. Evaluation results demonstrate that BonsaiKV outperforms others by up to 7.69×, 19.59×, and 12.86× in read-, write- and scan-intensive scenarios, respectively. © 2023, VLDB Endowment. All rights reserved.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

Adaptive Occlusion Face Recognition Feature Fusion Network Based on Precise Guidance Mask Extraction

引用

Journal of Shanghai Jiaotong University (Science) 2025年 1-12页

作者： Ye, Jihua Zhang, Lei Wang, Chao Tu, Qixuan Zheng, Rehua Huang, Huiyuan Jiang, Aiwen School of Computer and Information Engineering Jiangxi Normal University Nanchang330022 China Jiangxi Provincial Key Laboratory for High Performance Computing Jiangxi Normal University Nanchang330022 China State International Science & Technology Cooperation Base of Networked Supporting Software Jiangxi Normal University Nanchang330022 China

The uncertainty in the position and size of occluding objects greatly affects the extraction of identity features in facial recognition, which is a challenge that existing methods fail to effectively address. To tackle this issue, this paper introduces a novel feature fusion network for occluded facial recognition that adaptively handles arbitrary occlusions and accurately extracts occlusion information masks. The network effectively mitigates the impact of occlusions on facial identity features through a feature fusion module. The proposed method employs an occlusion classification module and an occlusion classification loss to precisely guide the extraction of accurate occlusion masks. Subsequently, an occlusion-aware hybrid attention module is introduced, which focuses on the relationship between facial features and occlusion masks across channel and spatial dimensions. This fusion strategy enables the extraction of facial identity features that are resilient to occlusions. Experimental results indicate that the proposed method holds a significant advantage in handling facial recognition tasks with arbitrary occlusions. On the LFW and MF1 synthetic occlusion datasets, the average accuracy rates reached 93.19% and 72.57%, respectively, showing improvements of 1.7 and 2.39 percent points over mainstream methods. © Shanghai Jiao Tong University 2025.

关键词： A feature fusion occluded facial recognition occlusion mask occlusion perception TP391.41

来源：评论

学校读者我要写书评

暂无评论

Transformer-based multi-level attention integration network for video saliency prediction

引用

Multimedia Tools and Applications 2025年第13期84卷 11833-11854页

作者： Tan, Rui Sun, Minghui Liang, Yanhua Software College Jilin University Qianjin Street Jilin Changchun130012 China College of Computer Science and Technology Jilin University Qianjin Street Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Qianjin Street Jilin Changchun130012 China

Most existing models for video saliency prediction heavily rely on 3D convolutional operations to extract spatio-temporal features. However, it is worth noting that 3D convolution produces a local receptive field, which may struggle to capture long-range spatio-temporal dependencies effectively. To compensate for such shortage, this paper introduces a novel approach called the Transformer-based Multi-level Attention Integration Network (TMAI-Net) for video saliency prediction. TMAI-Net is designed as a two-stream encoder-decoder model, carefully integrating multi-level features of semantic information. Our model incorporates a Multi-level Interactive Attention(MLIA) module and a Transformer, both implemented based on self-attention mechanism, which are placed at different levels of the model to capture long-range spatio-temporal feature dependencies. Additionally, our model operates on input video frames and attentional patches, allowing the Transformer module to capture structural similarities between related objects in global features and attention features. This, in turn, enables the model to allocate increased attention to salient areas. The efficacy of our proposed approach is validated through extensive experiments conducted on three widely recognized benchmark datasets. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：