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

IEEE Conference on Global Communications (GLOBECOM)

作者： Zhouxiang Zhao Zhaohui Yang Mingzhe Chen Xu Gan Chongwen Huang Wei Xu Zhaoyang Zhang College of Information Science and Electronic Engineering Zhejiang University Hangzhou China Zhejiang Provincial Key Laboratory of Info. Proc. Commun. & Netw. (IPCAN) Hangzhou China Department of Electrical and Computer Engineering and Institute for Data Science and Computing University of Miami Coral Gables FL USA National Mobile Communications Research Laboratory Southeast University Nanjing China

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

In this paper, the energy efficiency maximization problem in space-air-ground integrated network (SAGIN)-enabled probabilistic semantic communication (PSC) is investigated. In the considered model, a satellite needs to transmit data to multiple ground terminals (GTs) via an unmanned aerial vehicle (UAV) acting as a relay. During transmission, the satellite and the UAV can use PSC technique to compress the transmitted data, while the GTs can automatically recover the original data. In the considered PSC system, shared probability graphs serve as a common knowledge base among the transceivers, allowing for resource-saving communication at the expense of increased computation resource. Therefore, it is important to study the trade-off between communication and computation to achieve optimal energy efficiency. The joint communication and computation problem is formulated as an optimization problem aiming to minimize the total communication and computation energy consumption of the network under latency, semantic compression ratio, and UAV location constraints. To solve this non-convex problem, we propose an alternating algorithm. Numerical results show the effectiveness of the proposed algorithm.

关键词： Energy consumption Satellites Autonomous aerial vehicles Space-air-ground integrated networks Semantic communication Probabilistic logic Energy efficiency Transceivers Relays Optimization

来源：评论

学校读者我要写书评

暂无评论

An efficient aggregate signature scheme for healthcare wireless sensor networks

Journal of Network Intelligence

引用

Journal of Network Intelligence 2021年第1期6卷 1-15页

作者： Chen, Jian-Neng Zhou, Yu-Ping Huang, Zhen-Jie Wu, Tsu-Yang Zou, Fu-Min Tso, Raylin Minnan Normal University Zhangzhou363000 China Key Laboratory of Data Science and Intelligence Application Zhangzhou363000 China Lab of Granular Computing Zhangzhou363000 China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China Fujian Key Laboratory of Automotive Electronics and Electric Drive Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology National Demonstration Center for Experimental Electronic Information and Electrical Technology Education Fujian University of Technology Fuzhou350008 China Department of Computer Science National Chengchi University Taipei Taiwan

In healthcare wireless sensor networks, there are a large number of sensors, which need to transmit a lot of information in real time. The aggregate signature scheme combines a great deal of signatures signed by different signers on different messages into one short signature, which greatly improves the efficiency of data transmission. In this paper, we present a scheme of certificate based aggregate signature, and prove its security in the random oracle model. The performance analysis shows that the scheme is efficient in sign and verify phase, and suitable for healthcare wireless sensor networks. © 2021, Taiwan Ubiquitous Information. All rights reserved.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Voice Conversion Augmentation for Speaker Recognition on Defective datasets

arXiv

引用

arXiv 2024年

作者： Tao, Ruijie Shi, Zhan Jiang, Yidi Liu, Tianchi Li, Haizhou Department of Electrical and Computer Engineering National University of Singapore Singapore119077 Singapore School of Data Science The Chinese University of Hong Kong Shenzhen518172 China Singapore Institute of Technology Institute for Infocomm Research A∗STAR Singapore138632 Singapore Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big data Shenzhen518172 China University of Bremen Bremen28359 Germany

Modern speaker recognition system relies on abundant and balanced datasets for classification training. However, diverse defective datasets, such as partially-labelled, small-scale, and imbalanced datasets, are common in real-world applications. Previous works usually studied specific solutions for each scenario from the algorithm perspective. However, the root cause of these problems lies in dataset imperfections. To address these challenges with a unified solution, we propose the Voice Conversion Augmentation (VCA) strategy to obtain pseudo speech from the training set. Furthermore, to guarantee generation quality, we designed the VCA-NN (nearest neighbours) strategy to select source speech from utterances that are close to the target speech in the representation space. Our experimental results on three created datasets demonstrated that VCA-NN effectively mitigates these dataset problems, which provides a new direction for handling the speaker recognition problems from the data aspect. © 2024, CC BY.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Probabilistic methods for approximate archetypal analysis

arXiv

引用

arXiv 2021年

作者： Han, Ruijian Osting, Braxton Wang, Dong Xu, Yiming Department of Statistics The Chinese University of Hong Kong Hong Kong Department of Mathematics University of Utah Salt Lake City United States School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China Scientific Computing and Imaging Institute University of Utah Salt Lake City United States

Archetypal analysis is an unsupervised learning method for exploratory data analysis. One major challenge that limits the applicability of archetypal analysis in practice is the inherent computational complexity of the existing algorithms. In this paper, we provide a novel approximation approach to partially address this issue. Utilizing probabilistic ideas from high-dimensional geometry, we introduce two preprocessing techniques to reduce the dimension and representation cardinality of the data, respectively. We prove that provided the data is approximately embedded in a low-dimensional linear subspace and the convex hull of the corresponding representations is well approximated by a polytope with a few vertices, our method can effectively reduce the scaling of archetypal analysis. Moreover, the solution of the reduced problem is near-optimal in terms of prediction errors. Our approach can be combined with other acceleration techniques to further mitigate the intrinsic complexity of archetypal analysis. We demonstrate the usefulness of our results by applying our method to summarize several moderately large-scale datasets. Copyright © 2021, The Authors. All rights reserved.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Task-Aware Dynamic Transformer for Efficient Arbitrary-Scale Image Super-Resolution

arXiv

引用

arXiv 2024年

作者： Xu, Tianyi Zhou, Yijie Hu, Xiaotao Zhang, Kai Zhang, Anran Qiu, Xingye Xu, Jun School of Statistics and Data Science Nankai University Tianjin China College of Computer Science Nankai University Tianjin China School of Intelligence Science and Technology Nanjing University Suzhou China Tencent Data Platform Beijing China Zhejiang University Hangzhou China Systems Engineering Research Institute China State Shipbuilding Corporation Limited Beijing China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China

Arbitrary-scale super-resolution (ASSR) aims to learn a single model for image super-resolution at arbitrary magnifying scales. Existing ASSR networks typically comprise an off-the-shelf scale-agnostic feature extractor and an arbitrary scale upsampler. These feature extractors often use fixed network architectures to address different ASSR inference tasks, each of which is characterized by an input image and an upsampling scale. However, this overlooks the difficulty variance of super-resolution on different inference scenarios, where simple images or small SR scales could be resolved with less computational effort than difficult images or large SR scales. To tackle this difficulty variability, in this paper, we propose a Task-Aware Dynamic Transformer (TADT) as an input-adaptive feature extractor for efficient image ASSR. Our TADT consists of a multi-scale feature extraction backbone built upon groups of Multi-Scale Transformer Blocks (MSTBs) and a Task-Aware Routing Controller (TARC). The TARC predicts the inference paths within feature extraction backbone, specifically selecting MSTBs based on the input images and SR scales. The prediction of inference path is guided by a new loss function to trade-off the SR accuracy and efficiency. Experiments demonstrate that, when working with three popular arbitrary-scale upsamplers, our TADT achieves state-of-the-art ASSR performance when compared with mainstream feature extractors, but with relatively fewer computational costs. The code will be publicly released. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Random node reinforcement and K-core structure of complex networks

arXiv

引用

arXiv 2022年

作者： Ma, Rui Hu, Yanqing Zhao, Jin-Hua Guangdong Provincial Key Laboratory of Nuclear Science Institute of Quantum Matter South China Normal University Guangzhou510006 China Guangdong-Hong Kong Joint Laboratory of Quantum Matter Southern Nuclear Science Computing Center South China Normal University Guangzhou510006 China Department of Statistics and Data Science College of Science Southern University of Science and Technology Shenzhen518055 China School of Data Science and Engineering South China Normal University Shanwei516622 China

To enhance robustness of complex networked systems, a simple method is introducing reinforced nodes which always function during failure propagation. A random scheme of node reinforcement can be considered as a benchmark for finding an optimal reinforcement solution. Yet there still lacks a systematic evaluation on how node reinforcement affects network structure at a mesoscopic level upon failures. Here we study this problem through the lens of K-cores of networks. Based on an analytical percolation framework, we first show that, on uncorrelated random graphs, with a critical size of reinforced nodes, an abrupt emergence of K-cores is smoothed out to a continuous one, and a detailed phase diagram is derived. We then show that, with a cost-benefit analysis on random reinforcement, for proper weight factors in cost functions with constant and increasing marginal costs, a gain function shows a unimodality, thus we can analytically find an optimal reinforcement fraction by locating the maximal gain. In all, our framework offers a gain-oriented analytical perspective to designing robust interconnected systems. Copyright © 2022, The Authors. All rights reserved.

关键词： Reinforcement

来源：评论

学校读者我要写书评

暂无评论

Image super resolution via multi-regularization combining hybrid Tikhonov-TV prior and deep denoiser prior

Image super resolution via multi-regularization combining hy...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Jiahao Zhang Shengrong Zhao Hu Liang Changchun Wen Chen Liang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

In a real scenario, the image is often corrupted by complex degradation, and a lot of useful information is lost, which makes super-resolution (SR) reconstruction seriously ill-posed. To effectively solve such a problem, it is crucial to correctly exploit image prior knowledge. Although existing deep learning-based methods can obtain excellent results, they cannot deal with the complex degradation effectively, which would lead to the loss of texture details and the destruction of edge details. In this paper, an efficient multi-regularization method for SR is proposed, which can simultaneously exploit both internal and external image priors within a unified framework. The hybrid Tikhonov-TV prior and deep denoiser prior are introduced to constrain the reconstruction process. That is, the proposed model combines the superiority of the piecewise-smooth prior and deep prior. Moreover, an adaptive weight parameter is employed to make the hybrid component more detail-preserving. Experimental demonstrate that the proposed method achieves better performance in image detail protection than advanced methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Topic-based Multi-layer Knowledge Filtering for Emotion Recognition in Conversation

Topic-based Multi-layer Knowledge Filtering for Emotion Reco...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Xiaoyang Li Zhenyu Yang Yiwen Li Zhijun Li Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Emotion recognition in conversation (ERC) is a prominent research topic in natural language processing, widely applicable in various scenarios. However, accessing external commonsense knowledge and related dialogue topics, along with the complexity of fusing utterances, presents significant challenges. In this paper, we introduce a Topic-based Multilayer Knowledge Filtering (TMKF) model to enhance dialog emotion recognition accuracy. TMKF acquires commonsense knowledge for each utterance and employs two Variational Autoencoder (VAE) modules to extract global and speaker-level dialogue topics. We utilize Global Knowledge Filtering (GKF) and Local Knowledge Filtering (LKF) to obtain topic-specific knowledge representations after filtering commonsense information through global and local topic hierarchies. Subsequently, we leverage relational graphs to convolve commonsense knowledge with utterances, resulting in knowledge-constrained utterance representations for classification. Our proposed model is evaluated through extensive experiments on four widely used benchmark datasets for conversational emotion recognition. The results underscore the effectiveness of TMKF, which significantly outperforms other methods in standard metric evaluations.

关键词： Measurement Emotion recognition Filtering Convolution Oral communication Benchmark testing Nonhomogeneous media

来源：评论

学校读者我要写书评

暂无评论

Research on Optimization and Scheduling of MPTCP data Networks in GNSS Network Reference Stations

Research on Optimization and Scheduling of MPTCP Data Networ...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Fengqi Hao Yuxin Wang Hoiio Kong Dexin Ma Xiyuan Zhao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Faculty of Data Science City University of Macau Macau China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Communication College Qingdao Agricultural University Qingdao China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

The Global Navigation Satellite System Network Reference Stations (GNSS-NRS) are pivotal in modern po-sitioning and navigation applications. However, GNSS-NRS face significant communication challenges, including instability during rapid user movement and inconsistent coverage by different operators, which often results in data transmission interruptions and delays. Moreover, the conventional Multipath Transmission Control Protocol (MPTCP) scheduling strategy does not accommodate the diversity of the data types managed by GNSS-NRS. This default approach treats all data uniformly, even under deteriorating network conditions. To overcome these limitations, this paper introduces a ‘Multiple Reception’ strategy based on MPTCP that ensures timely and reliable GNSS data transmission. This novel strategy differentiates between observational and control data based on their real-time criticality and applies tailored transmission techniques. Under adverse conditions, it utilizes multiple transmission paths and selectively receives control data, thus prioritizing the transfer of critical information. We conducted simulation experiments using MiniNet to compare the ‘Multiple Reception’ method against conventional and redundant strategies, demonstrating that it significantly reduces data loss rates in GNSS-NRS.

关键词： Global navigation satellite system Protocols Real-time systems Delays MPTCP Reliability data communication Kernel Optimization Faces

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：