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

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Xinping Chen Xiao Ke Wenzhong Guo Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fuzhou China and Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China

ISBN: (纸本)9798331314385

Few-shot font generation (FFG) aims to learn the target style from a limited number of reference glyphs and generate the remaining glyphs in the target font. Previous works focus on disentangling the content and style features of glyphs, combining the content features of the source glyph with the style features of the reference glyph to generate new glyphs. However, the disentanglement is challenging due to the complexity of glyphs, often resulting in glyphs that are influenced by the style of the source glyph and prone to artifacts. We propose IF-Font, a novel paradigm which incorporates Ideographic Description Sequence (IDS) instead of the source glyph to control the semantics of generated glyphs. To achieve this, we quantize the reference glyphs into tokens, and model the token distribution of target glyphs using corresponding IDS and reference tokens. The proposed method excels in synthesizing glyphs with neat and correct strokes, and enables the creation of new glyphs based on provided IDS. Extensive experiments demonstrate that our method greatly outperforms state-of-the-art methods in both one-shot and few-shot settings, particularly when the target styles differ significantly from the training font styles. The code is available at https://***/Stareven233/IF-Font.

关键词：

来源：评论

学校读者我要写书评

暂无评论

EABC: Energy-aware Centrality-based Caching for Named data Networking in the IoT

EABC: Energy-aware Centrality-based Caching for Named Data N...

引用

IEEE International Symposium on World of Wireless Mobile and Multimedia Networks (WoWMoM)

作者： Xingyun He Hu Liu Wuyungerile Li Alvin Valera Winston K.G. Seah Inner Mongolia Key Lab. of Wireless Networking & Mobile Computing Engineering Research Center of Ecological Big Data Ministry of Education School of Computer Science Inner Mongolia University Hohhot China Wireless Networks Research Group School of Engineering and Computer Science Victoria University of Wellington Wellington New Zealand

ISBN: (数字)9798350394665

ISBN: (纸本)9798350394672

Named data Networking (NDN) is an information-centric internet architecture that delivers packets based on the name of the content in the packet. A key component of NDN is the caching strategy designed to reduce total network latency and load on content producers. To improve the speed and reliability of web content delivery, existing caching strategies typically cache content on a large number of intermediate nodes, which incur significant energy consumption and memory overhead. However, in Internet of Things (IoT) scenarios, memory and energy of nodes are scarce resources. Therefore, in NDN-based IoT applications, traditional caching strategies can cause node failures due to energy depletion, which can significantly reduce the network operational lifetime as well as create problems that caching is supposed to solve. In this paper, a caching strategy based on node centrality and energy availability, called Energy-aware Approximate Betweenness Centrality (EABC) is proposed for NDN-based IoT. EABC uses a topology-based heuristic to cache data content on nodes with high centrality and makes caching decisions based on the remaining energy of the nodes. We evaluate EABC using simulations based on ndnSIM in different topologies and compare it with several existing NDN caching strategies. The results show that EABC performs better in different types of network topologies, reduces the average transmission delay of data and balances the energy consumption of highly central nodes, thus extending the network lifetime.

关键词： Wireless communication Energy consumption Network topology Memory management Topology Delays Internet of Things

来源：评论

学校读者我要写书评

暂无评论

Machine Learning is All You Need: A Simple Token-Based Approach for Effective Code Clone Detection

Machine Learning is All You Need: A Simple Token-Based Appro...

引用

International Conference on Software engineering (ICSE)

作者： Siyue Feng Wenqi Suo Yueming Wu Deqing Zou Yang Liu Hai Jin Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab Jinyinhu Laboratory Wuhan China School of Cyber Science and Engineering HUST Wuhan China Nanyang Technological University Singapore School of Computer Science and Technology HUST Wuhan China

ISBN: (数字)9798400702174

ISBN: (纸本)9798350382143

As software engineering advances and the code demand rises, the prevalence of code clones has increased. This phenomenon poses risks like vulnerability propagation, underscoring the growing importance of code clone detection techniques. While numerous code clone detection methods have been proposed, they often fall short in real-world code environments. They either struggle to identify code clones effectively or demand substantial time and computational resources to handle complex clones. This paper introduces a code clone detection method namely Toma using tokens and machine learning. Specifically, we extract token type sequences and employ six similarity calculation methods to generate feature vectors. These vectors are then input into a trained machine learning model for classification. To evaluate the effectiveness and scalability of Toma, we conduct experiments on the widely used bigCloneBench dataset. Results show that our tool outperforms token-based code clone detectors and most tree-based clone detectors, demonstrating high effectiveness and significant time savings.

关键词： Codes Scalability Computational modeling Cloning Machine learning Detectors Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Successive Pose Estimation and Beam Tracking for mmWave Vehicular Communication Systems

Successive Pose Estimation and Beam Tracking for mmWave Vehi...

引用

2023 IEEE Globecom Workshops, GC Wkshps 2023

作者： Liu, Cen Zhu, Guangxu Liu, Fan Liu, Yuanwei Huang, Kaibin National University of Singapore Department of Electrical and Computer Engineering Singapore Shenzhen Research Institute of Big Data Shenzhen China Peng Cheng Laboratory Shenzhen China Guangzhou China Southern University of Science and Technology Department of Electronic and Electrical Engineering Shenzhen China School of Electronic Engineering and Computer Science Queen Mary University of London London United Kingdom The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong

ISBN: (纸本)9798350370218

The millimeter wave (mmWave) radar sensing-aided communications in vehicular mobile communication systems is investigated. To alleviate the beam training overhead under high mobility scenarios, a successive pose estimation and beam tracking (SPEBT) scheme is proposed to facilitate mmWave communications with the assistance of mmWave radar sensing. The proposed SPEBT scheme first resorts to a Fast Conservative Filtering for Efficient and Accurate Radar odometry (Fast-CFEAR) approach to estimate the vehicle pose consisting of 2-dimensional position and yaw from radar point clouds collected by mmWave radar sensor. Then, the pose estimation information is fed into an extend Kalman filter to perform beam tracking for the line-of-sight channel. Owing to the intrinsic robustness of mmWave radar sensing, the proposed SPEBT scheme is capable of operating reliably under extreme weather/illumination conditions and large-scale global navigation satellite systems (GNSS)-denied environments. The practical deployment of the SPEBT scheme is verified through rigorous testing on a real-world sensing dataset. Simulation results demonstrate that the proposed SPEBT scheme is capable of providing precise pose estimation information and accurate beam tracking output, while reducing the proportion of beam training overhead to less than 5% averagely. © 2023 IEEE.

关键词： beam tracking extended Kalman filter millimeter wave pose estimation radar odometry Sensing-aided communications

来源：评论

学校读者我要写书评

暂无评论

Visible Light Positioning Method for Indoor Line-of-Sight Scene Based on Time Series Coding 9

Visible Light Positioning Method for Indoor Line-of-Sight Sc...

引用

9th IEEE International Conference on data science in Cyberspace, DSC 2024

作者： Yu, Yonghao Guo, Yongde Zhao, Dawei Fu, Kexue Tang, Yongwei Wang, Qinyuan City University of Macau Faculty of Data Science China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Shandong University School of Mechanical Engineering Key Laboratory of High Efficiency and Clean Mechanical Manufacture Ministry of Education Jinan China

ISBN: (纸本)9798350391367

Existing indoor visible light positioning methods, such as those based on fingerprint database algorithms, are complex to construct and consume significant resources. In response to this issue, the text proposes an end-to-end indoor visible light positioning method that samples continuous signals at a small number of random coordinate positions in indoor environments. Through a deep learning method based on attention mechanism, a nonlinear mapping between the received signal and spatial position coordinates is constructed, and the time series properties in the received signal are encoded as a feature in the data. The method is further improved by combining residual networks to improve accuracy. Through simulation experiments, it has been verified that the deep learning based localization method described in this article can achieve sub meter level accuracy on small sample datasets, and it has been proven that time series features have a significant impact on localization accuracy in indoor visible light positioning algorithms based on deep learning. © 2024 IEEE.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Text-guided HuBERT: Self-Supervised Speech Pre-training via Generative Adversarial Networks

arXiv

引用

arXiv 2024年

作者： Ma, Duo Yue, Xianghu Ao, Junyi Gao, Xiaoxue Li, Haizhou Shenzhen Research Institute of Big Data School of Data Science The Chinese University of Hong Kong Shenzhen518172 China Department of Electrical and Computer and Engineering National University of Singapore Singapore119077 Singapore

Human language can be expressed in either written or spoken form, i.e. text or speech. Humans can acquire knowledge from text to improve speaking and listening. However, the quest for speech pre-trained models to leverage unpaired text has just started. In this paper, we investigate a new way to pre-train such a joint speech-text model to learn enhanced speech representations and benefit various speech-related downstream tasks. Specifically, we propose a novel pre-training method, text-guided HuBERT, or T-HuBERT, which performs self-supervised learning over speech to derive phoneme-like discrete representations. And these phoneme-like pseudo-label sequences are firstly derived from speech via the generative adversarial networks (GAN) to be statistically similar to those from additional unpaired textual data. In this way, we build a bridge between unpaired speech and text in a unsupervised manner. Extensive experiments demonstrate the significant superiority of our proposed method over various strong baselines, which achieves up to 15.3% relative Word Error Rate (WER) reduction on the LibriSpeech dataset. © 2024, CC BY.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

IKGN: Intention-aware Knowledge Graph Network for POI Recommendation

IKGN: Intention-aware Knowledge Graph Network for POI Recomm...

引用

IEEE International Conference on data Mining (ICDM)

作者： Xiaoyu Zhu Chenyang Bu Bingbing Dong Shengwei Ji Yi He Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology China School of Artificial Intelligence and Big Data Hefei University China Department of Computer Science Old Dominion University USA Research Center for Knowledge Engineering Zhejiang Lab China

Point-of-Interest (POI) recommendation, pivotal for guiding users to their next interested locale, grapples with the persistent challenge of data sparsity. Whereas knowledge graphs (KGs) have emerged as a favored tool to mitigate the issue, existing KG-based methods tend to overlook two crucial elements: the intention steering users’ location choices and the high-order topological structure within the KG. In this paper, we craft an Intention-aware Knowledge Graph (IKG) that harmonizes users’ visit histories, movement trajectories, and location categories to model user intentions. Building upon IKG, our novel Intention-aware Knowledge Graph Network (IKGN) delves deeper into the POI recommendation by weighing and propagating node embeddings through an attention mechanism, capturing the unique locational intent of each user. A sequential model like GRU is then employed to ensure a comprehensive representation of users’ short- and long-term location preferences. An empirical study on two real-world datasets validates the effectiveness of our proposed IKGN, with it markedly outshining seven benchmark rival models in both Recall and NDCG metrics. The code of IKGN is available at https://***/Jungle123456/IKGN.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous graph completion collaborative network for attribute-missing heterogeneous graph representation learning

引用

Expert Systems with Applications 2025年 290卷

作者： Yang, Yuanjun Ou, Weihua Fu, Sichao Chen, Jiamin Wu, Yunshun School of Mathematical Sciences Guizhou Normal University Guiyang China School of Big Data and Computer Science Guizhou Normal University Guiyang China School of Electronic Information and Communication Huazhong University of Science and Technology Hubei China Engineering Research Center of Micro-Nano and Intelligent Manufacturing Ministry of Education Kaili Guizhou China

Heterogeneous graph representation learning has attracted significant attention and found widespread application in various real-world scenarios. Due to various uncontrollable factors, heterogeneous graph data often suffers from missing attributes, which affects the performance of existing heterogeneous graph representation learning. Recently proposed attribute-missing heterogeneous graph representation learning methods provide an effective solution to the above issues. However, previous completion methods overlook nodes’ high-order semantic information, leading to insufficient utilization of high-order semantic information and ultimately resulting in poor performance of downstream tasks. Additionally, the process of lacking effective heterogeneous graphs’ information collaborative interaction leads to insufficient representation learning. To solve the above problems, we propose a Heterogeneous Graph Completion Collaborative Network called HGCCN for attribute-missing heterogeneous graph representation learning, which first utilizes high-order diffusion completion method to complete missing attributes, and then introduces a graph transformer with a multi-head attention mechanism to adaptively perform collaborative interaction among multiple completed semantic attributes. Firstly, we construct multiple meta-path subgraphs to explore the nodes’ high-order semantic information in the completion process. Secondly, we propose a novel diffusion completion method that leverages high-order semantic information to more effectively complete missing attributes. Thirdly, we introduce a graph transformer to achieve the heterogeneous graphs’ high-order semantic information collaborative interaction, further obtaining the enhanced completed node attributes. In summary, compared to existing methods, the advantage of HGCCN lies in its ability to utilize high-order semantic information from different meta-path subgraphs for completion, as well as enhancing the completion embeddings th

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

FC-NT: A crime prediction algorithm incorporating formal context and neural networks 3

FC-NT: A crime prediction algorithm incorporating formal con...

引用

3rd International Conference on Advanced Algorithms and Signal Image Processing, AASIP 2023

作者： Zao, Feifei Lv, Lingling Ding, Feng Jin, Shixian Guo, Xiaoding Henan Province Engineering Research Center of Spatial Information Processing Henan Key Laboratory of Big Data Analysis and Processing School of Computer and Information Engineering Henan University Zhengzhou450046 China School of Electrical Engineering North China University of Water Resources and Electric Power Zhengzhou450046 China School of Internet of Things Engineering Jiangnan University Wuxi214122 China Henan Provincial Educational Resources Guarantee Center Zhengzhou450003 China

ISBN: (纸本)9781510668522

The task of crime prediction is to predict the charges of a case based on the given description of the case, which has become a research hot spot. Most of the existing methods use neural networks and machine learning algorithms to predict. The prediction results have high accuracy, but the prediction results are often not well interpretable. In addition, some early traditional methods can explain the prediction results, but their accuracy is often very low. Formal concept analysis is an effective data extraction tool. Therefore, this paper combines formal concept analysis with neural network to improve the accuracy of the algorithm. The experimental results show that our method has higher prediction results and can better explain the prediction results than the original neural network model. © COPYRIGHT SPIE. Downloading of the abstract is permitted for personal use only.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Blockchain and PUF-based secure key establishment protocol for cross-domain digital twins in industrial Internet of Things architecture

引用

Journal of Advanced research 2024年 62卷 155-163页

作者： Mahmood, Khalid Shamshad, Salman Saleem, Muhammad Asad Kharel, Rupak Das, Ashok Kumar Shetty, Sachin Rodrigues, Joel J.P.C. School of Psychology and Computer Science University of Central Lancashire Preston United Kingdom Graduate School of Intelligent Data Science National Yunlin University of Science and Technology Yunlin 64002 Taiwan Department of Software Engineering The University of Lahore Lahore 54590 Pakistan Department of Computer Science University of Sahiwal Punjab Sahiwal 57000 Pakistan Center for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad 500 032 India Department of Modeling Simulation and Visualization Engineering Virginia Modeling Analysis and Simulation Center and Center for Cybersecurity Education and Research Old Dominion University Suffolk 23435 VA United States COPELABS Lusófona University Campo Grande 376 Lisbon 1749-024 Portugal

Introduction: The Industrial Internet of Things (IIoT) is a technology that connects devices to collect data and conduct in-depth analysis to provide value-added services to industries. The integration of the physical and digital domains is crucial for unlocking the full potential of the IIoT, and digital twins can facilitate this integration by providing a virtual representation of real-world entities. Objectives: By combining digital twins with the IIoT, industries can simulate, predict, and control physical behaviors, enabling them to achieve broader value and support industry 4.0 and 5.0. Constituents of cooperative IIoT domains tend to interact and collaborate during their complicated operations. Methods: To secure such interaction and collaborations, we introduce a blockchain-based cross-domain authentication protocol for IIoT. The blockchain maintains only each domain's dynamic accumulator, which accumulates crucial materials derived from devices, decreasing the overhead. In addition, we use the on-chain accumulator to effectively validate the unlinkable identities of cross-domain IIoT devices. Results: The implementation of the concept reveals the fact that our protocol is efficient and reliable. This efficiency and reliability of our protocol is also substantiated through comparison with state-of-the-art literature. In contrast to related protocols, our protocol exhibits a minimum 22.67% increase in computation cost efficiency and a 16.35% rise in communication cost efficiency. Conclusion: The developed protocol guarantees data transfer security across the domain and thwarts IoT devices from potential physical attacks. Additionally, in order to protect privacy, anonymity and unlinkability are also guaranteed. © 2024

关键词： Digital twins Industrial Internet of Things (IIoT) Key agreement Mutual authentication Physically Unclonable Functions (PUFs)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：