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

arXiv 2024年

作者： Jia, Yuheng Li, Jia-Nan Wu, Wenhui Wang, Ran The School of Computer Science and Engineering Southeast University Nanjing211189 China Ministry of Education China The College of Electronics and Information Engineering Shenzhen University Shenzhen518060 China The School of Mathematical Sciences Shenzhen University Shenzhen518060 China The Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China The Shenzhen Key Laboratory of Advanced Machine Learning and Applications Shenzhen University Shenzhen518060 China

Semi-supervised symmetric non-negative matrix factorization (SNMF) utilizes the available supervisory information (usually in the form of pairwise constraints) to improve the clustering ability of SNMF. The previous methods introduce the pairwise constraints from the local perspective, i.e., they either directly refine the similarity matrix element-wisely or restrain the distance of the decomposed vectors in pairs according to the pairwise constraints, which overlook the global perspective, i.e., in the ideal case, the pairwise constraint matrix and the ideal similarity matrix possess the same low-rank structure. To this end, we first propose a novel semi-supervised SNMF model by seeking low-rank representation for the tensor synthesized by the pairwise constraint matrix and a similarity matrix obtained by the product of the embedding matrix and its transpose, which could strengthen those two matrices simultaneously from a global perspective. We then propose an enhanced SNMF model, making the embedding matrix tailored to the above tensor low-rank representation. We finally refine the similarity matrix by the strengthened pairwise constraints. We repeat the above steps to continuously boost the similarity matrix and pairwise constraint matrix, leading to a high-quality embedding matrix. Extensive experiments substantiate the superiority of our method. The code is available at https://***/JinaLeejnl/TSNMF. Copyright © 2024, The Authors. All rights reserved.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

A Localization Method of High Energy Transients for All-sky Gamma-ray Monitor

引用

Research in Astronomy and Astrophysics 2024年第10期24卷 25-35页

作者： Yi Zhao Wangchen Xue Shaolin Xiong Qi Luo Yuanhao Wang Jiacong Liu Heng Yu Xiaoyun Zhao Yue Huang Jinyuan Liao Jianchao Sun Xiaobo Li Qibin Yi Ce Cai Shuo Xiao Shenglun Xie Chao Zheng Yanqiu Zhang Chenwei Wang Wenjun Tan Zhiwei Guo Chaoyang Li Zhenghua An Gang Chen Yanqi Du Min Gao Ke Gong Dongya Guo Jiang He Jianjian He Bing Li Gang Li Xinqiao Li Jing Liang Xiaohua Liang Yaqing Liu Xiang Ma Rui Qiao Liming Song Xinying Song Xilei Sun Jin Wang Ping Wang Xiangyang Wen Hong Wu Yanbing Xu Sheng Yang Dali Zhang Fan Zhang Hongmei Zhang Peng Zhang Shu Zhang Zhen Zhang Shijie Zheng Keke Zhang Xingbo Han Haiyan Wu Hu Tai Hao Geng Gaopeng Lu Wei Xu Fanchao Lyu Hongbo Zhang Fangjun Lu Shuangnan Zhang Department of Astronomy Beijing Normal UniversityBeijing 100875China Key Laboratory of Particle Astrophysics Institute of High Energy PhysicsChinese Academy of SciencesBeijing 100049China University of Chinese Academy of Sciences Beijing 100049China School of Physics and Optoelectronics Xiangtan UniversityXiangtan 411105China College of Physics Hebei Normal UniversityShijiazhuang 050024China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal UniversityGuiyang 550001China School of Physics and Electronic Science Guizhou Normal UniversityGuiyang 550001China Institute of Astrophysics Central China Normal UniversityWuhan 430079China College of physics Sciences Technology Hebei UniversityBaoding 071002China Physics and Space Science College China West Normal UniversityNanchong 637002China School of Computing and Artificial Intelligence Southwest Jiaotong UniversityChengdu 611756China College of Electronic and information Engineering Tongji UniversityShanghai 201804China Innovation Academy for Microsatellites of Chinese Academy of Sciences Shanghai 201304China National Space Science Center Chinese Academy of SciencesBeijing 100190China School of Earth and Space Sciences University of Science and Technology of ChinaHefei 230026China Electronic Information School Wuhan UniversityWuhan 430072China Key Laboratory of Transportation Meteorology of China Meteorological Administration Nanjing Joint Institute for Atmospheric SciencesNanjing 210000China Key Laboratory of Middle Atmosphere and Global Environment Observation Institute of Atmospheric PhysicsChinese Academy of SciencesBeijing 100029China

Fast and reliable localization of high-energy transients is crucial for characterizing the burst properties and guiding the follow-up *** based on the relative counts of different detectors has been widely used for all-sky gamma-ray *** are two major methods for this count distribution localization:χ^(2)minimization method and the Bayesian *** we propose a modified Bayesian method that could take advantage of both the accuracy of the Bayesian method and the simplicity of the χ^(2)*** comprehensive simulations,we find that our Bayesian method with Poisson likelihood is generally more applicable for various bursts than the χ^(2)method,especially for weak *** further proposed a location-spectrum iteration approach based on the Bayesian inference,which could alleviate the problems caused by the spectral difference between the burst and location *** method is very suitable for scenarios with limited computation resources or timesensitive applications,such as in-flight localization software,and low-latency localization for rapidly follow-up observations.

关键词： methods:data analysis methods:analytical (stars:)gamma-ray burst:general

来源：评论

学校读者我要写书评

暂无评论

Tiny Multi-Agent DRL for Twins Migration in UAV Metaverses: A Multi-Leader Multi-Follower Stackelberg Game Approach

arXiv

引用

arXiv 2024年

作者： Kang, Jiawen Zhong, Yue Xu, Minrui Nie, Jiangtian Wen, Jinbo Du, Hongyang Ye, Dongdong Huang, Xumin Niyato, Dusit Xie, Shengli China 111 Center for Intelligent Batch Manufacturing Based on IoT Technology Guangzhou510006 China Key Laboratory of Intelligent Information Processing and System Integration of IoT Ministry of Education Guangzhou510006 China Guangdong-HongKong-Macao Joint Laboratory for Smart Discrete Manufacturing Guangzhou510006 China Key Laboratory of Intelligent Detection and IoT in Manufacturing Ministry of Education Guangzhou510006 China Guangdong Key Laboratory of IoT Information Technology Guangzhou510006 China The School of Computer Science and Engineering Nanyang Technological University Singapore Singapore The Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China

The synergy between Unmanned Aerial Vehicles (UAVs) and metaverses is giving rise to an emerging paradigm named UAV metaverses, which create a unified ecosystem that blends physical and virtual spaces, transforming drone interaction and virtual exploration. UAV Twins (UTs), as the digital twins of UAVs that revolutionize UAV applications by making them more immersive, realistic, and informative, are deployed and updated on ground base stations, e.g., RoadSide Units (RSUs), to offer metaverse services for UAV Metaverse Users (UMUs). Due to the dynamic mobility of UAVs and limited communication coverages of RSUs, it is essential to perform real-time UT migration to ensure seamless immersive experiences for UMUs. However, selecting appropriate RSUs and optimizing the required bandwidth is challenging for achieving reliable and efficient UT migration. To address the challenges, we propose a tiny machine learning-based Stackelberg game framework based on pruning techniques for efficient UT migration in UAV metaverses. Specifically, we formulate a multi-leader multi-follower Stackelberg model considering a new immersion metric of UMUs in the utilities of UAVs. Then, we design a Tiny Multi-Agent Deep Reinforcement Learning (Tiny MADRL) algorithm to obtain the tiny networks representing the optimal game solution. Specifically, the actor-critic network leverages the pruning techniques to reduce the number of network parameters and achieve model size and computation reduction, allowing for efficient implementation of Tiny MADRL. Numerical results demonstrate that our proposed schemes have better performance than traditional schemes. Copyright © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Pano-NeRF: Synthesizing High Dynamic Range Novel Views with Geometry from Sparse Low Dynamic Range Panoramic Images

arXiv

引用

arXiv 2023年

作者： Lu, Zhan Zheng, Qian Shi, Boxin Jiang, Xudong School of Electrical and Electronic Engineering Nanyang Technological University Singapore College of Computer Science and Technology Zhejiang University China The State Key Lab of Brain-Machine Intelligence Zhejiang University China National Key Laboratory for Multimedia Information Processing School of Computer Science Peking University China National Engineering Research Center of Visual Technology School of Computer Science Peking University China

Panoramic imaging research on geometry recovery and High Dynamic Range (HDR) reconstruction becomes a trend with the development of Extended Reality (XR). Neural Radiance Fields (NeRF) provide a promising scene representation for both tasks without requiring extensive prior data. However, in the case of inputting sparse Low Dynamic Range (LDR) panoramic images, NeRF often degrades with under-constrained geometry and is unable to reconstruct HDR radiance from LDR inputs. We observe that the radiance from each pixel in panoramic images can be modeled as both a signal to convey scene lighting information and a light source to illuminate other pixels. Hence, we propose the irradiance fields from sparse LDR panoramic images, which increases the observation counts for faithful geometry recovery and leverages the irradiance-radiance attenuation for HDR reconstruction. Extensive experiments demonstrate that the irradiance fields outperform state-of-the-art methods on both geometry recovery and HDR reconstruction and validate their effectiveness. Furthermore, we show a promising byproduct of spatially-varying lighting estimation. The code is available at https://***/Lu-Zhan/Pano-NeRF. Copyright © 2023, The Authors. All rights reserved.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

ADEdgeDrop: Adversarial Edge Dropping for Robust Graph Neural Networks

arXiv

引用

arXiv 2024年

作者： Chen, Zhaoliang Wu, Zhihao Sadikaj, Ylli Plant, Claudia Dai, Hong-Ning Wang, Shiping Cheung, Yiu-Ming Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350116 China Department of Computer Science Hong Kong Baptist University Hong Kong Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China Faculty of Computer Science and with the research network Data Science @ Uni Vienna University of Vienna Vienna1090 Austria

Although Graph Neural Networks (GNNs) have exhibited the powerful ability to gather graph-structured information from neighborhood nodes via various message-passing mechanisms, the performance of GNNs is limited by poor generalization and fragile robustness caused by noisy and redundant graph data. As a prominent solution, Graph Augmentation Learning (GAL) has recently received increasing attention in the literature. Among the existing GAL approaches, edge-dropping methods that randomly remove edges from a graph during training are effective techniques to improve the robustness of GNNs. However, randomly dropping edges often results in bypassing critical edges. Consequently, the effectiveness of message passing is weakened. In this paper, we propose a novel adversarial edgedropping method (ADEdgeDrop) that leverages an adversarial edge predictor guiding the removal of edges, which can be flexibly incorporated into diverse GNN backbones. Employing an adversarial training framework, the edge predictor utilizes the line graph transformed from the original graph to estimate the edges to be dropped, which improves the interpretability of the edge-dropping method. The proposed ADEdgeDrop is optimized alternately by stochastic gradient descent and projected gradient descent. Comprehensive experiments on eight graph benchmark datasets demonstrate that the proposed ADEdgeDrop outperforms state-of-the-art baselines across various GNN backbones, demonstrating improved generalization and robustness. Copyright © 2024, The Authors. All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Mel-S3r: Combining Mel-Spectrogram and Self-Supervised Speech Representation for Voice Conversion

SSRN

引用

SSRN 2022年

作者： Yang, Jichen Zhou, Yi Huang, Hao School of Cyberspace Security Guangdong Polytechnic Normal University Guangzhou and School of Electronics and Information Engineering South China Normal University Foshan China Department of Electrical and Computer Engineering National University of Singapore Singapore School of Information Science and Engineering Xinjiang University Xinjiang Provincial Key Laboratory of Multilingual Information Technology Urumqi China

The self-supervised speech representation (S3R) has succeeded in many downstream tasks, such as speaker recognition and voice conversion thanks to its high-level information. Voice conversion (VC) is a task to convert the source speech into a target speaker’s voice. Though S3R features effectively encode content and speaker information, spectral features contain lowlevel acoustic information that is complementary to the S3R. As a result, solely relying on the S3R features for VC may not be optimal. In order to seek speech representation carrying both high-level learned information and low-level spectral details for VC, we proposed a three-level attention to combine Melspectrogram (Mel) and S3R, denoted as Mel-S3R. In particular, S3R features are high-level learned representations extracted by a pre-trained network with self-supervised learning. Whereas Mel is the spectral feature representing the acoustic information. VC experiments are performed as a downstream task. Objective metrics and subjective listening tests have demonstrated that the proposed Mel-S3R speech representation facilitates the VC framework to achieve robust performance in terms of both speech quality and speaker similarity. © 2022, The Authors. All rights reserved.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Graph-Sequence Anomaly Detection for 5G Core Network Control Plane Traffic

Unsupervised Graph-Sequence Anomaly Detection for 5G Core Ne...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Min Wang Peng Li Zhang Cheng Wenmao Liu Lei Nie Haizhou Bao Qin Liu Kai Zhang School of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System China NSFOCUS Technologies Group Co. Ltd School of Cyber Science and Engineering Wuhan University China

5G Core network (5GC) employs a Service Based Architecture (SBA). This architecture decomposes the control plane into multiple independent Network Functions (NFs). NFs open interfaces to provide services to other NFs, which makes the control plane more susceptible to external malicious attacks. However, existing anomaly detection methods focus more on traffic statistics features and are difficult to apply to the 5GC control plane. In this paper, we proposed GSAD, a Graph-Sequence analysis-based Anomaly Detection method for 5GC control plane traffic. We model control plane traffic as a directed graph to depict topological and NF interaction information. Further, we use the normalizing flows with temporal dependencies to mine the sequential information in the traffic. GSAD combines the topological and sequential information to provide fine-grained detection. We evaluate our proposed framework on the 5GC testbed using Free5GC and UERANSIM in various scenarios. Experimental results demonstrate that our framework outperforms the baselines significantly in terms of detection performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Self-Supervised Speech Denoising Using Only Noisy Audio Signals

arXiv

引用

arXiv 2021年

作者： Wu, Jiasong Li, Qingchun Yang, Guanyu Li, Lei Senhadji, Lotfi Shu, Huazhong LIST Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing210096 China Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing Southeast University Nanjing210096 China RennesF-35042 France The 28th Research Institute of China Electronics Technology Group Corporation Nanjing210007 China Univ Rennes INSERM LTSI UMR 1099 RennesF-35042 France

In traditional speech denoising tasks, clean audio signals are often used as the training target, but absolutely clean signals are collected from expensive recording equipment or in studios with the strict environments. To overcome this drawback, we propose an end-to-end self-supervised speech denoising training scheme using only noisy audio signals, named Only-Noisy Training (ONT), without extra training conditions. The proposed ONT strategy constructs training pairs only from each single noisy audio, and it contains two modules: training audio pairs generated module and speech denoising module. The first module adopts a random audio sub-sampler on each noisy audio to generate training pairs. The sub-sampled pairs are then fed into a novel complex-valued speech denoising module. Experimental results show that the proposed method not only eliminates the high dependence on clean targets of traditional audio denoising tasks, but also achieves on-par or better performance than other training strategies. Availability-ONT is available at https://***/liqingchunnnn/Only-Noisy-Training. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

A secure broadcasting method based on the generalized aryabhata remainder theorem

引用

Journal of information Hiding and Multimedia Signal processing 2014年第4期5卷 709-718页

作者： Liu, Yanjun Chang, Chin-Chen Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University No.111 Jiulong Rd Hefei230601 China Department of Computer Science and Information Engineering Asia University No.500 Lioufeng Rd Wufeng Taichung413 Taiwan Department of Information Engineering and Computer Science Feng Chia University No.100 Wenhwa Rd Seatwen Taichung407 Taiwan

With the prevalence of group communications, how to implement secure broadcasting among group members has become one of the most important issues. Broadcasting is a point-to-multipoint communication, and secure broadcasting should ensure that only authorized group members can obtain the correct content of the message that is broadcast by a sender. In this paper, we propose a secure broadcasting method based on the generalized Aryabhata remainder theorem (GART). By the use of the RSA public-key scheme, the proposed scheme allows the sender to send one copy of an encrypted message to all group members, but only the authorized members can recover the plaintext. Analysis showed that our scheme is secure and efficient. © 2014.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Multi-view multi-instance multi-label learning based on collaborative matrix factorization

arXiv

引用

arXiv 2019年

作者： Xing, Yuying Yu, Guoxian Domeniconi, Carlotta Wang, Jun Zhang, Zili Guo, Maozu College of Computer and Information Science Southwest University Chongqing China Hubei Key Laboratory of Intelligent Geo-Information Processing China University of Geosciences Wuhan China Department of Computer Science George Mason University FairfaxVA United States School of Information Technology Deakin University GeelongVIC Australia School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing China

Multi-view Multi-instance Multi-label Learning(M3L) deals with complex objects encompassing diverse instances, represented with different feature views, and annotated with multiple labels. Existing M3L solutions only partially explore the inter or intra relations between objects (or bags), instances, and labels, which can convey important contextual information for M3L. As such, they may have a compromised performance. In this paper, we propose a collaborative matrix factorization based solution called M3Lcmf. M3Lcmf first uses a heterogeneous network composed of nodes of bags, instances, and labels, to encode different types of relations via multiple relational data matrices. To preserve the intrinsic structure of the data matrices, M3Lcmf collaboratively factorizes them into low-rank matrices, explores the latent relationships between bags, instances, and labels, and selectively merges the data matrices. An aggregation scheme is further introduced to aggregate the instance-level labels into bag-level and to guide the factorization. An empirical study on benchmark datasets show that M3Lcmf outperforms other related competitive solutions both in the instance-level and bag-level prediction. Copyright © 2019, The Authors. All rights reserved.

关键词： Matrix factorization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：