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

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and systems, HPCC/SmartCity/DSS 2019

作者： Sun, Xiao Xu, Xiaolong Xia, Fei Jiangsu Key Laboratory Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Information and communication Branch State Grid Jiangsu Electric Power Company Nanjing China

ISBN: (纸本)9781728120584

Information explosion is a typical feature of the Big data. Learners can easily find a wide variety of knowledge information online. However, the expansion of information also makes it difficult for learners to retrieve the information they want and fall into the problem of knowledge overload. In order to solve this problem effectively, we propose a content-based recommendation optimization algorithm for personalized knowledge services (CROA). First, the feature vector model is established, where each item information is represented by specific words and key information is highlighted by weighting. Second, a dynamic user vector model is then established to capture the latest preference information of the user. Finally, the feature vector model is combined with the multi-user comparison results thereby obtaining a list of recommendations. Experimental results indicate that CROA outstands in knowledge recommendation mechanism and can also alleviate knowledge overload. © 2019 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Towards Demystifying Android Adware: dataset and Payload Location 39

Towards Demystifying Android Adware: Dataset and Payload Loc...

引用

39th ACM/IEEE International Conference on Automated Software Engineering Workshops, ASEW 2024

作者： Wang, Chao Liu, Tianming Zhao, Yanjie Zhang, Lin Du, Xiaoning Li, Li Wang, Haoyu Monash University Clayton Australia Huazhong University of Science and Technology Wuhan China School of Cyber Science and Engineering Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security China The National Computer Emergency Response Beijing China Beihang University Beijing China

ISBN: (纸本)9798400712494

Adware represents a pervasive threat in the mobile ecosystem, yet its inherent characteristics have been largely overlooked by previous research. This work takes a crucial step towards demystifying Android adware. We present a comprehensive, well-annotated Android adware dataset AdwareZoo, which comprises 15,996 adware samples across 118 distinct adware families collected from both security reports and app repositories, providing a robust foundation for in-depth analysis and future research. We identify adware family payloads by isolating packages from adware samples for VirusTotal rescanning. Our analysis unveils critical insights into the adware ecosystem, highlighting distinctive patterns in family naming conventions and exposing the unexpected classification of widely-used ad networks as adware. We identify diverse payload location strategies, with a notable finding that over 30% of adware families employ payloads beyond conventional Java/Kotlin code. Furthermore, we reveal several evasion techniques utilized by ad-ware, including package name obfuscation and dynamic payload loading. This research not only offers a robust foundation for understanding and combating adware but also highlights the pressing need for increased scrutiny of mobile advertising practices. © 2024 ACM.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent Diffusion 38

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent D...

引用

38th Conference on Neural Information Processing systems, NeurIPS 2024

作者： Zeng, Yu Zhang, Yang Liu, Jiachen Shen, Linlin Deng, Kaijun He, Weizhao Wang, Jinbao Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Novel Gradient Descent Least-Squares (GDLSs) Algorithm for Efficient Gridless Line Spectrum Estimation With Applications in Tomographic SAR Imaging

A Novel Gradient Descent Least-Squares (GDLSs) Algorithm for...

引用

作者： Shi, Ruizhe Zhang, Zhe Qiu, Xiaolan Ding, Chibiao University of Chinese Academy of Sciences School of Electronic Electrical and Communication Engineering Beijing100190 China Suzhou Aerospace Information Research Institute Suzhou Key Laboratory of Intelligent Aerospace Big Data Application Technology Suzhou Jiangsu215123 China CAS Key Laboratory of Technology in Geo-Spatial Information Processing and Application System Beijing100190 China

This article presents a novel efficient method for gridless line spectrum estimation problems with single snapshot and sparse signals, namely the gradient descent least-squares (GDLS) method. Conventional single-snapshot (a.k.a. single-measure vector or SMV) line spectrum estimation methods either rely on smoothing techniques that sacrifice the range and/or azimuth resolution or adopt the sparsity constraint and utilize the compressed sensing (CS) method by defining prior grids and resulting in the off-grid problem. Recently emerged atomic norm minimization (ANM) methods achieved gridless SMV line spectrum estimation, but its computational complexity is extremely high;thus, it is practically infeasible in real applications with large problem scales. Our proposed GDLS method reformulates the line spectrum estimations problem into a least-squares (LSs) estimation problem and solves the corresponding objective function via a gradient descent algorithm in an iterative fashion with efficiency. The convergence guarantee, computational complexity, and performance analysis for evenly distributed antenna array cases are discussed in this article. Numerical simulations show that the proposed GDLS algorithm outperforms the state-of-the-art methods, for example, CS and ANM, in terms of estimation performances. It can completely avoid the off-grid problem, and its computational complexity is significantly lower than ANM. Our method has been tested in tomographic SAR (TomoSAR) imaging applications via simulated and real experimental data. Results show the great potential of the proposed method in terms of better cloud point performance and eliminating the gridding effect. © 1980-2012 IEEE.

关键词： Spectrum analysis

来源：评论

学校读者我要写书评

暂无评论

An efficient binary salp swarm algorithm for user selection in multiuser MIMO antenna systems

引用

Scientific Reports 2025年第1期15卷 1-17页

作者： Sasikumar, A. Ravi, Logesh Devarajan, Malathi Almazyad, Abdulaziz S. De, Shuvodeep Xiong, Guojiang Mousavirad, Seyed Jalaleddin Mohamed, Ali Wagdy Department of Data Science and Business Systems Faculty of Engineering and Technology SRM Institute of Science and Technology Tamil Nadu Kattankulathur 603203 India Centre for Advanced Data Science Tamil Nadu Chennai 600127 India School of Electronics Engineering Vellore Institute of Technology Tamil Nadu Chennai 600127 India School of Computer Science and Engineering Vellore Institute of Technology Chennai 600127 India Department of Computer Engineering College of Computer and Information Sciences King Saud University Riyadh 11543 Saudi Arabia Virginia Tech Blacksburg United States Guizhou Key Laboratory of Intelligent Technology in Power System College of Electrical Engineering Guizhou University Guiyang 550025 China Department of Computer and Electrical Engineering Mid Sweden University Sundsvall Sweden Operations Research Department Faculty of Graduate Studies for Statistical Research Cairo University Giza 12613 Egypt Applied Science Research Center Applied Science Private University Amman 11931 Jordan Centre for Research Impact and Outcome Chitkara University Institute of Engineering and Technology Chitkara University Punjab Rajpura 140401 India

The past ten years have seen notable research activity and significant advancements in multiuser multiple-input multiple-output (MU-MIMO) antennas. An MU-MIMO antenna system must accommodate many subscribers without additional bandwidth or energy. User scheduling becomes a critical strategy to take advantage of multiuser heterogeneity and acquire maximum gain in systems where the total number of recipients exceeds the number of transmitting antennas. Due to their high computational cost, many user selection methods currently in use, such as greedy algorithms and exhaustive search are unsuitable for MU-MIMO systems. A suitable scheduling mechanism is essential for the various users in an MU-MIMO system to utilise bandwidth and enhance the system’s total rate effectively. In this article, we proposed a user and antenna scheduling with a population-based meta-heuristic approach, namely the binary salp swarm algorithm (binary SSA), to increase the system sum rate with low computing complexity. We specifically used a population-based meta-heuristics optimisation technique to simulate the user scheduling problem in MU-MIMO systems, characterising complicated issues with binary decisions. Additionally, binary SSA significantly outperforms existing population-based models, such as the binary bat algorithm (binary BA), PSO, SSA, FPA and binary flower pollination algorithm (binary FPA), regarding system throughput/sum rate. The proposed binary SSA technique also effectively achieves a system sum rate compared to a random search scheme and other existing suboptimal scheduling methods. Compared to binary BA and binary FPA approaches, the binary SSA has a higher convergence rate and superior searching capabilities. The simulation outcomes show the proposed binary SSA-based scheduling scheme delivers noticeable performance benefits. © The Author(s) 2025.

关键词： Antenna Binary salp swarm algorithm Metaheuristics optimization Multiuser MIMO User scheduling

来源：评论

学校读者我要写书评

暂无评论

VG-Net: Sensor Time Series Anomaly Detection with Joint Variational Autoencoder and Graph Neural Network 10

VG-Net: Sensor Time Series Anomaly Detection with Joint Vari...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Wang, Shuai Liu, Shenghao Fan, Xiaoxuan Wang, Haijun Zhou, Yinxin Gao, Hanjun Lu, Hongwei Deng, Xianjun Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China Hunan Technical College of Railway High-speed China Nanjing University of Posts and Telecommunications China China National Nuclear Power Co Ltd China

ISBN: (纸本)9798331520861

intelligent Cyber-Physical systems typically utilize sensors to gather a significant amount of raw data which often possesses temporal and high-dimensional characteristics. Ensuring the data reliability is crucial for the normal operation of the system. While most existing methods are capable of identifying anomalies in high-dimensional time series data from sensors, they often lack adequate accuracy and fail to adequately consider the correlation between sensor nodes. To address these limitations, we propose an unsupervised framework which is a combination of variational autoencoder and graph neural network(VG-Net). By jointly optimizing the reconstruction module and the prediction module, VG-Net effectively models the correlation between sensor nodes while simultaneously detecting anomalies. The reconstruction module is responsible for modeling the latent representation space and reconstructing the time series data through variational autoencoder. The prediction module leverages bidirectional long short term memory networks and neural tensor network to learn the relationships between sensor nodes, and uses graph neural network to predict the future behavior of the data. Experiments on eight real and synthetic datasets demonstrate that, compared with existing methods, VG-Net can accurately model the relationship between sensor nodes and enhance the anomaly detection performance of high-dimensional time series data. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Backdoor Attacks on Bimodal Salient Object Detection with RGB-Thermal data 24

Backdoor Attacks on Bimodal Salient Object Detection with RG...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Yin, Wen Zhu, Bin Benjamin Xie, Yulai Zhou, Pan Feng, Dan School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Microsoft Corporation Beijing China Wuhan National Laboratory for Optoelectronics Huazhong University of Science and Technology Wuhan China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9798400706868

RGB-Thermal Salient Object Detection (RGBT-SOD) plays a critical role in complex scene recognition applications, such as autonomous driving. However, security research in this domain is still in its infancy. This paper presents the first backdoor attack on RGBT-SOD systems, generating saliency maps on triggered inputs that depict non-existent salient objects chosen by the attacker or falsely mark an entire image as fully salient or entirely non-salient. We uncover that triggers have an influence range for generating non-existent salient objects, supported by a theoretical analysis. Extensive experiments show the effectiveness of our attack in both digital and physical-world scenarios. Notably, our dual-modality backdoor attack achieves an Attack Success Rate (ASR) of 86.72% with only five pairs of poisoned images in model training. After investigating potential countermeasures, we find them inadequate in mitigating our attacks, highlighting the urgent need for robust defenses against sophisticated backdoor attacks in RGBT-SOD systems. © 2024 ACM.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Hyperspectral Image Destriping and Denoising with Spectral Low Rank and Tensor Nuclear Norm

Hyperspectral Image Destriping and Denoising with Spectral L...

引用

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： Pengfei Liu Lanlan Liu School of Computer Science Nanjing University of Posts and Telecommunications China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing China

In this paper, we propose a new method for simultaneous hyperspectral image (HSI) destriping and denoising with spectral low-rank and tensor nuclear norm under the tensor framework. Specifically, the tensor nuclear norm is used to model the tensor low-rank property of stripe. Moreover, the nuclear norm is used to model the low-rank property of spectral gradient of HSI. Then, the ADMM algorithm is used to effectively solve the proposed model. Experimental results on simulated HSI dataset and real HSI dataset verify the superiority of the proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cascade Detector Based on Multi-scale Features for Small Objects in Various Backgrounds of Remote Sensing 2nd

Cascade Detector Based on Multi-scale Features for Small Obj...

引用

2nd International Conference on Image, Vision and intelligent systems, ICIVIS 2022

作者： Li, Yan Han, Shi-Yuan Xu, Tao Yang, Xiao-hui Lu, Qiu Shen, Yuan University of Jinan Jinan250022 China China High-Resolution Earth Observation System Shandong Center of Data and Application University of Jinan Jinan250022 China Shandong Provincial Key Laboratory of Network-Based Intelligent Computing University of Jinan Jinan250022 China

ISBN: (纸本)9789819909223

Different from natural images, remote sensing images in complex backgrounds have the challenges of small object feature extraction with small size, few available features, and high localization accuracy requirements. Consequently, it is difficult to detect these small objects with mainstream object detection methods. To enhance the retention of small object feature details during feature extraction and characteristics enhancement, this paper improves the Cascade R-CNN algorithm to solve the above problems of small object detection. Res2Net was used to enhance feature representation and feature fusion to extract features with fine-grained and rich semantic information. PAFPN was used for learning high-resolution features with large perceptual fields to perceive contextual information from the area around the object for inference. Cascade R-CNN was used as a high-quality detector by continuously increasing the threshold of IOU. Experiments show that the detection performance of the method proposed in this paper is 4.3% higher than that of the current mainstream deep learning methods, which is significantly better than other mainstream detection methods. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

BSL: Understanding and Improving Softmax Loss for Recommendation

BSL: Understanding and Improving Softmax Loss for Recommenda...

引用

International Conference on data Engineering

作者： Junkang Wu Jiawei Chen Jiancan Wu Wentao Shi Jizhi Zhang Xiang Wang MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition University of Science and Technology of China Hefei China The State Key Laboratory of Blockchain and Data Security Zhejiang Unversity

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Loss functions steer the optimization direction of recommendation models and are critical to model performance, but have received relatively little attention in recent recommendation research. Among various losses, we find Softmax loss (SL) stands out for not only achieving remarkable accuracy but also better robustness and fairness. Nevertheless, the current literature lacks a comprehensive explanation for the efficacy of SL. Toward addressing this research gap, we conduct theoretical analyses on SL and uncover three insights: 1) Optimizing SL is equivalent to performing Distributionally Robust Optimization (DRO) on the negative data, thereby learning against perturbations on the negative distribution and yielding robustness to noisy negatives. 2) Comparing with other loss functions, SL implicitly penalizes the prediction variance, resulting in a smaller gap between predicted values and and thus producing fairer results. Building on these insights, we further propose a novel loss function Bilateral SoftMax Loss (BSL) that extends the advantage of SL to both positive and negative sides. BSL augments SL by applying the same Log-Expectation-Exp structure to positive examples as is used for negatives, making the model robust to the noisy positives as well. Remarkably, BSL is simple and easy-to-implement - requiring just one additional line of code compared to SL. Experiments on four real-world datasets and three representative backbones demonstrate the effectiveness of our proposal. The code is available at https://***/junkangwu/BSL.

关键词： Codes Accuracy Perturbation methods data engineering Robustness Noise measurement Proposals

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：