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

Performance Challenges and Solutions in Big Data Platform Hadoop

Recent Advances in computer science and Communications 2023年第9期16卷 27-41页

作者： Singh, Balraj Verma, Harsh K. Madaan, Vishu Department of Computer Science and Engineering Dr. B.R. Ambedkar NIT Jalandhar India School of Computer Science and Engineering Lovely Professional University Phagwara India

Background: The present era demands continuous support to bring improvements in executing complex analytics on large-scale data and to work beyond traditional systems. Objective: The need for processing diverse data types and solutions for different domains of the industry is rising. Such needs increase the requirement for sophisticated techniques and methods to enhance the existing platforms and mechanisms further. It provides an opportunity for the research community to investigate further into the existing systems, find potential issues, and propose new ways to improve the current systems. Hadoop is a popular choice to manage and process Big data. It is an open-source platform and a front-runner in the batch processing of large-scale jobs. The economy associated with the cluster in scaling is low as compared to other platforms. However, this popularity by no means guarantees high performance in all scenarios. With the continuous evolution in data development and industrial requirements, it is imperative to investigate and look into new methods and techniques to bring advancements to the existing system. Method: A systematic review is represented in this paper to have an insight into the current progress in this field. Research publications from various sources are taken and analyzed. The performance of a cluster largely depends upon the different job processing mechanisms and policies associated with it. Conclusion: While extensive studies and solutions are proposed, the performance bottlenecks in terms of load balancing, resource utilization, content management, and efficient processing prevail. Not many of the solutions are there on scheduling about the trade-off between different parameters, the process of content splitting and merging is not explored to a large extent and the skew mitigation solutions are more focused on Reduce side of the MapReduce while the Map side is not utilized much for load balancing. © 2023 Bentham science Publishers.

关键词： Batch data processing

来源：评论

学校读者我要写书评

暂无评论

Improved kernels for triangle packing in tournaments

引用

science China(Information sciences) 2023年第5期66卷 100-113页

作者： Hanchun YUAN Qilong FENG Jianxin WANG School of Computer Science and Engineering Central South University Hunan Provincial Key Lab on Bioinformatics Central South University

Triangle packing problem has been paid lots of attention to in the literature. In this paper, we study the kernelization of the triangle packing problem in tournaments. For the parameterized arc-disjoint triangle packing problem in tournaments, we find a maximal arc-disjoint triangle packing with the number of vertices bounded by 2.5k. Based on the relation between the maximal arc-disjoint triangle packing and the vertices outside of the packing, a kernel of size 3.5k for the problem is obtained, improving the previous best one 6k. For the parameterized vertex-disjoint triangle packing problem in sparse tournaments, several new properties between the triangles in maximal vertex-disjoint triangle packing and the arcs in the feedback arc set are presented, which result in a kernel of size 7k for the problem, improving the previous best one of *** also give a 7k vertex kernel for the parameterized feedback vertex set problem in sparse *** kernelization process presented in this paper for the parameterized arc-disjoint triangle packing can be applied to solve the parameterized arc-disjoint triangle packing problem on other restricted directed graph classes.

关键词： tournaments triangle packing kernelization fixed-parameter tractable graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Reduced-Complexity CRB Optimization for Dual-Function Radar-Communication Systems using Hybrid Linear-Nonlinear Precoding

引用

IEEE Transactions on Signal Processing 2025年 73卷 2123-2138页

作者： Wen, Cai Chen, Yating Huang, Yan Davidson, Timothy N. Northwest University School of Information Science and Technology Xi’an China Southeast University State Key Laboratory of Millimeter Waves School of Information Science and Engineering Nanjing China McMaster University Department of Electrical and Computer Engineering Hamilton Canada

This paper proposes a waveform design technique for dual-function radar-communication (DFRC) systems that employ hybrid linear-nonlinear precoding (HLNP). The HLNP signal is a superposition of linear precoding of the communication symbols that enables conventional coherent decoding and a nonlinearly precoded auxiliary signal that introduces additional degrees of design freedom that can be used to improve system performance. Our design goal is to obtain accurate direction of arrival (DOA) estimation and satisfactory waveform ambiguity properties, and hence we optimize a weighted sum of a Cramer-Rao bound (CRB) on DOA estimation and a waveform similarity metric. To simultaneously enable effective communication at the chosen data rates, we set lower bounds on the communication SINRs, and to facilitate implementation, we constrain the total transmission power, the per-antenna power, and the peak-to-average power ratio (PAPR) on each antenna. We deploy successive convex approximation to solve the resultant nonconvex design problem, while leveraging feasible point pursuit to provide a feasible initial point. To reduce the computational cost, we introduce sub-block and null space variants of our design technique. Simulation results verify the effectiveness of the proposed algorithm and its variants, and validate their performance advantages over regular nonlinear precoding schemes. © 1991-2012 IEEE.

关键词： Signaling

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Publishing Mechanism for Real-Time Vehicle Trajectory in Vehicle-to-Grid Networks 5

Privacy-Preserving Publishing Mechanism for Real-Time Vehicl...

引用

5th IEEE International Conference on Power, Electronics and computer Applications, ICPECA 2025

作者： Wang, Yulong Xu, Jianbo Gong, Bo School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China

ISBN: (纸本)9798331533694

The Vehicle-to-Grid (V2G) network is a smart grid technology generated under the background of the rapid development of new energy technology, which allows mobile energy storage vehicles (MESVs) to realize bidirectional energy exchange with the grid system. As distributed energy storage units within the V2G network, MESVs help meet the grid's load-balancing demands. To accurately schedule grid loads, V2G networks rely on MESVs' real-time trajectory data. After collecting this data, the central authority (CA) publishes it to the grid enterprise (GM) for load-balancing decisions. However, before publication, the CA must process the data to protect the location privacy of MESVs and prevent GM from extracting sensitive information. To address this privacy protection challenge during data publication, we propose a differential privacy-based mechanism. Our mechanism uses the unscented Kalman filter to predict and correct the published data at the sampling point and intelligently adjusts the sampling interval. Additionally, we introduce a privacy budget allocation method based on regional access frequency and travel time, enhancing privacy protection of trajectory in high-access areas and peak hours. Through security analysis and experimental validation, our mechanism effectively preserves the privacy of real-time vehicle trajectory data while ensuring data validity. © 2025 IEEE.

关键词： Vehicle-to-grid

来源：评论

学校读者我要写书评

暂无评论

A novel approach to detect, analyze and block adversarial web pages

引用

International Journal of Information Technology (Singapore) 2024年第6期16卷 3617-3622页

作者： Kumar, M. Ranjith Naik, Darshana A. Kapila, Neha Mohan, Chinnem Rama Prasad, Ch Raghava Shelke, Chetan Rao, C. V. Guru School of Computer Science and Engineering Vellore Institute of Technology Department of Computer Science and Engineering M S Ramaiah Institute of Technology Department of Electronics and Electrical Engineering Lovely Professional University Department of Computer Science and Engineering Narayana Engineering College Electronics and Communication Engineering Koneru Lakshmaiah Education Foundation Alliance College of Engineering and Design Alliance University School of CS & amp AI SR Universtity

The phenomenon of distraction is very common, and its adverse effects are seen among people. The major cause underlying this issue is the ease with which adversarial web sites and web pages can be accessed. It is of utmost importance to locate, evaluate, and actively block such web pages in an effort to comprehensively and globally solve this societal issue. Thus, the given paper proposes an extension or plug-in to detect, analyze, and block websites smartly. The proposed approach takes keywords entered by the user as input into consideration, which eventually leads to the generation of web pages and web links. The filtering of web links is done by the proposed extension, followed by the extraction of features, the utilization of support vector machines (SVM) for binary classification, and the summarization of textual data using natural language processing (NLP). Lastly, the precise results corresponding to relevant web links are presented to the users, which will increase their productivity, thereby reducing their distraction levels under all working circumstances. The performance of the proposed approach is validated against existing recent studies based on evaluation metrics such as adversarial website detection time (ms) and accuracy (%). © Bharati Vidyapeeth's Institute of computer Applications and Management 2024.

关键词： Adversarial web pages Distraction Natural language processing (NLP) Support vector machine (SVM) Text summarization

来源：评论

学校读者我要写书评

暂无评论

A video data hiding technique based on pixel sequence, weight interpolation and quorum function

引用

Multimedia Tools and Applications 2024年第41期83卷 88881-88901页

作者： Roselinkiruba, R. Jothi, C. Saranya Koushik, C.P. Keerthika, A. Sathya, Vanlin School of Computer and Science Engineering Vel Tech Rangarajan Dr.Sagunthala R & D Institute of Science and Technology Chennai Avadi India School of Computer and Science Engineering VIT Bhopal University Bhopal India Electronics and Communication Engineering Aarupadai Veedu Institute of Technology Chennai India Celona Inc CampbellCA United States

The development of multimedia technology has increased the challenge in protecting the information. This paper proposes an effective method for data hiding in videos based on the Pixel Sequence (PS), weight interpolation to protect the secret data from intruders. Initially, the noise is removed from the video with the help of median filter and Moving Objects (MO) inside the frames having different backgrounds are accurately detected using Fast Region-based Convolution Neural Network (FR-CNN). Next, the MO and Non Moving Object (NMO) pixel from each frame are mapped with the adjacent frames to determine the weights applying PS. Then, the cover video is up-scaled with interpolated pixels based on weights of MO and NMO. Finally, the secret data are hidden inside the both interpolated and non-interpolated pixels elevate Embedding Capacity (EC). In interpolated pixels, both Most Significant Bit (MSB) and Least Significant Bit (LSB) of each frames based on their weight are utilized to hide data. Whereas, in non-interpolated pixels, Quorum Function (QF) is used to embed data. Two different data embedding techniques are adopted in each frame to enhance the security. The performance evaluation of the proposed method out-performs the existing methods in terms of precision and recall. Experimental results also show that the stego-video quality is uncompromised and is resistive to security attacks. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

A Cover-Independent Deep Image Hiding Method Based on Domain Attention Mechanism

引用

computers, Materials & Continua 2024年第3期78卷 3001-3019页

作者： Nannan Wu Xianyi Chen James Msughter Adeke Junjie Zhao School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China School of Electronics and Information Engineering Nanjing University of Information Science and TechnologyNanjing210044China

Recently,deep image-hiding techniques have attracted considerable attention in covert communication and high-capacity information ***,these approaches have some *** example,a cover image lacks self-adaptability,information leakage,or weak *** address these issues,this study proposes a universal and adaptable image-hiding ***,a domain attention mechanism is designed by combining the Atrous convolution,which makes better use of the relationship between the secret image domain and the cover image ***,to improve perceived human similarity,perceptual loss is incorporated into the training *** experimental results are promising,with the proposed method achieving an average pixel discrepancy(APD)of 1.83 and a peak signal-to-noise ratio(PSNR)value of 40.72 dB between the cover and stego images,indicative of its high-quality ***,the structural similarity index measure(SSIM)reaches 0.985 while the learned perceptual image patch similarity(LPIPS)remarkably registers at ***,self-testing and cross-experiments demonstrate the model’s adaptability and generalization in unknown hidden spaces,making it suitable for diverse computer vision tasks.

关键词： Deep image hiding attention mechanism privacy protection data security visual quality

来源：评论

学校读者我要写书评

暂无评论

Cross-modal Gaussian Localization Distillation for Optical Information guided SAR Object Detection

Cross-modal Gaussian Localization Distillation for Optical I...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Wang, Chao Luo, Lei Fang, Wenxuan Yang, Jian School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China

ISBN: (纸本)9798350368741

Synthetic Aperture Radar (SAR) images contain a dense clutter of objects that can be better characterized using bounding boxes with angles. However, accurately detecting the angles of objects remains challenging due to the imaging mechanism of SAR. To address this issue, we propose a novel knowledge distillation method called cross-modal Gaussian Localization Distillation (GaLD). It aims to improve SAR object detection performance by utilizing the angle information from optical images. Specifically, we convert the oriented bounding box into a Gaussian distribution and design a Gaussian Angle Distillation (GAD) loss function to align the angle information between optical and SAR images. In addition, to mitigate the negative impact of low-quality angle information on the network, we design an Adaptive Weighting Strategy (AWS) to guide the student network to prioritize high-quality angle information. The lack of high-quality oriented labels and objects in the OGSOD-1.0 dataset has hindered the progress in related fields. Therefore, we have added high-quality oriented labels and images to the OGSOD-1.0 dataset to construct a new dataset. Extensive experiments demonstrate the effectiveness and superiority of our proposed GaLD over existing methods. The dataset and code are available at: https://***/wchao0601/GaLD. © 2025 IEEE.

关键词： knowledge distillation object detection Remote sensing synthetic aperture radar (SAR)

来源：评论

学校读者我要写书评

暂无评论

Sparse and Dense: Learning Confusion Representation Network for 3-D Action Recognition

引用

IEEE Internet of Things Journal 2025年第12期12卷 21240-21254页

作者： Hou, Xinran Geng, Pei Li, Tianchen Li, Yalin Li, Yan Lyu, Lei Shandong Normal University School of Information Science and Engineering Jinan250358 China Shandong Management University School of Information Engineering Jinan250100 China Shandong Normal University School of Information Science and Engineering Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan250358 China

In the field of the Internet of Medical Things (IoMT), the demand for Human action recognition (HAR) is growing. Due to the limitations of portability and privacy of traditional sensors, many endeavors have made significant progress in 3-D skeleton-based action recognition. However, existing methods ignore potential higher-order semantic information between joints and fail to perceive rapidly changing dynamic details, resulting in frequent confusion of actions with similar motion trajectories. To alleviate this issue, we propose a novel learning confusion representation network (LCR-Net). Specifically, a progressive feature enhancement module is first designed to utilize self-attention to gradually aggregate lower-order features to higher-order features, emphasizing the relative movement between body parts. Second, we design the enhanced spatio-temporal convolution to explore the potential spatio-temporal dependencies between joints by adding a mask matrix and an attention fusion mechanism. To further perceive the spatio-temporal relationships in subtle changes, we divide the interactive sparse-dense pathways at different spatio-temporal resolutions and enhance the complementary information between the two pathways through feature interaction. Finally, the frequency excitation learning module is proposed to efficiently learn the importance of different frequencies by cross-channel modeling, promoting the compactness of actions within classes and the separability of confusion actions. In addition, the lightweight LCR-Net+ is achieved through model compression optimization to meet the deployment requirements of IoT systems. Comprehensive experiments conducted on three public datasets (NTU-RGB+D60&120, NW-UCLA) demonstrate the superior performance of our model. © 2014 IEEE.

关键词： Joints (anatomy)

来源：评论

学校读者我要写书评

暂无评论

Queryable Prototype Multiple Instance Learning with Vision-Language Models for Incremental Whole Slide Image Classification 39

Queryable Prototype Multiple Instance Learning with Vision-L...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Gou, Jiaxiang Ji, Luping Liu, Pei Ye, Mao School of Computer Science and Engineering University of Electronic Science and Technology of China China

ISBN: (纸本)157735897X

Whole Slide Image (WSI) classification has very significant applications in clinical pathology, e.g., tumor identification and cancer diagnosis. Currently, most research attention is focused on Multiple Instance Learning (MIL) using static WSI datasets. One of the most obvious weaknesses of these methods is that they cannot efficiently preserve and utilize previously learned knowledge. With any new data arriving, classification models are required to be re-trained on both previous and current new data. To overcome this shortcoming and break through traditional vision modality, this paper proposes the first Vision-Language-based framework with Queryable Prototype Multiple Instance Learning (QPMIL-VL) specially designed for incremental WSI classification. This framework mainly consists of two information processing branches: one is for generating bag-level features by prototype-guided aggregation of instance features, while the other is for enhancing class features through a combination of class ensemble, tunable vector and class similarity loss. The experiments on four public WSI datasets demonstrate that our QPMIL-VL framework is effective for incremental WSI classification and often significantly outperforms other compared methods, achieving state-of-the-art (SOTA) performance. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：