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

Optimizing network resource allocation with graph pointer neural network in large-scale AI systems

Digital Communications and Networks 2024年

作者： Peiying Zhang Yilin Li Athanasios V. Vasilakos Konstantin Igorevich Kostromitin Jianyong Zhang Mohsen Guizani Qingdao Institute of Software College of Computer Science and Technology China University of Petroleum (East China) Qingdao 266580 China State Key Laboratory of Integrated Services Networks Xidian University Xi'an 710071 China 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 250013 China Department of Networks and Communications College of Computer Science and Information Technology Imam Abdulrahman Bin Faisal University P.O. Box 1982 Dammam 31441 Saudi Arabia Department of Physics of Nanoscale Systems South Ural State University Chelyabinsk 454080 the Russian Federation Institute of Lightwave Technology Beijing Jiaotong University Beijing 100044 China Key Lab of All Optical Network and Advanced Telecommunication of EMC Institute of Lightwave Technology Beijing Jiaotong University Beijing 100044 China Machine Learning Department Mohamed Bin Zayed University of Artificial Intelligence (MBZUAI) Abu Dhabi 999041 United Arab Emirates

For increasingly complex communication demands of large-scale AI communication systems, the Space-Air-Ground Integrated Network (SAGIN) better caters to demands but also raises concerns about resource scarcity and diversity. This paper innovatively combines Graph Pointer Neural Networks (GPNN) and Reinforcement Learning (RL) to enhance resource allocation efficiency. The method leverages the advantages of GPNN in handling graph data and RL in optimizing decisions in dynamic environments. It also targets the optimization goal of maximizing resource allocation while minimizing deployment latency. This paper begins by modeling SAGIN and elucidating the SAGIN logical architecture based on software-defined Networking (SDN). Subsequently, it introduces an SFC deployment algorithm aimed at joint optimization of resource allocation and latency. The algorithm leverages GPNN and RL to deploy virtual nodes and links, with the goal of optimizing resource allocation and deployment latency. Experiment findings conclusively demonstrate that the efficacy of proposed algorithm in effectively weighing limited heterogeneous resources and minimum mapping delay. Notably, when compared to three other SFC mapping algorithms MLRL, NFVdeep, and RL, the proposed algorithm consistently outperforms them, with an average improvement of 10.17% in long-term average reward/cost, 11.21% in link resource utilization ratio, 15.34% in node resource utilization ratio, and 16.38% in acceptance ratio.

关键词： Space-air-ground integrated network Topological structure Reinforcement learning Service function chain Graph pointer neural network

来源：评论

学校读者我要写书评

暂无评论

Enhancing Device-Free Gesture Recognition Capability of Mobile Communication Signals

引用

IEEE Transactions on Communications 2025年

作者： Wu, Jingmiao He, Weijie Sun, Kai Huang, Wei Zhang, Haijun Leung, Victor C. M. Inner Mongolia University School of Electronic Information Engineering Inner Mongolia Key Laboratory of Intelligent Communication and Sensing and Signal Processing Hohhot010021 China University of Science and Technology at Beijing Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services Beijing100083 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China The University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T 1Z4 Canada

Device-free gesture recognition using mobile communication signals is a convenient and efficient technology with broad application prospects in smart homes and human-computer interaction. It utilizes the effect of gestures on surrounding signals to achieve gesture recognition. The cell-specific reference signals (CRS) information can be used to achieve the task in close-range training scenarios. However, when gestures are performed at long-range or in non-training scenarios, the recognition performance will significantly degrade. To enhance device-free gesture recognition capability in arbitrary scenarios, we propose the signal quality enhancement algorithm and the gesture spectrogram construction method to solve this problem. Specifically, we superimpose the CRS information from multiple carriers to improve the gesture signal-to-noise ratio and increase the gesture sensing range. Then, we extract the gesture dynamic components from the CRS information and construct gesture spectrograms to represent scenario-independent gesture motion patterns. Using the gesture spectrogram features, we design a deep network to accomplish the gesture recognition task. We built a prototype system on a software-defined radio platform. Experimental results show that our proposed method can effectively increase the gesture sensing range from 30m² to 228m² and achieve an average recognition accuracy of 82.5% for five types of gestures in arbitrary scenarios. © 1972-2012 IEEE.

关键词： Gesture recognition

来源：评论

学校读者我要写书评

暂无评论

Big networks: A survey

arXiv

引用

arXiv 2020年

作者： Bedru, Hayat Dino Yu, Shuo Xiao, Xinru Zhang, Da Wan, Liangtian Guo, He Xiaa, Feng Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology Dalian116620 China Department of Electrical and Computer Engineering University of Miami United States School of Science Engineering and Information Technology Federation University Australia Australia

A network is a typical expressive form of representing complex systems in terms of vertices and links, in which the pattern of interactions amongst components of the network is intricate. The network can be static that does not change over time or dynamic that evolves through time. The complication of network analysis is different under the new circumstance of network size explosive increasing. In this paper, we introduce a new network science concept called big network. Big networks are generally in large-scale with a complicated and higher-order inner structure. This paper proposes a guideline framework that gives an insight into the major topics in the area of network science from the viewpoint of a big network. We first introduce the structural characteristics of big networks from three levels, which are micro-level, meso-level, and macro-level. We then discuss some state-of-the-art advanced topics of big network analysis. Big network models and related approaches, including ranking methods, partition approaches, as well as network embedding algorithms are systematically introduced. Some typical applications in big networks are then reviewed, such as community detection, link prediction, recommendation, etc. Moreover, we also pinpoint some critical open issues that need to be investigated further. Copyright © 2020, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

URIR: Recommendation algorithm of user RNN encoder and item encoder based on knowledge graph

arXiv

引用

arXiv 2021年

作者： Zhao, Na Long, Zhen Zhao, Zhi-Dan Wang, Jian Key Laboratory in Software Engineering of Yunnan Province School of Software Yunnan University Kunming650504 China Electric Power Research Institute of Yunnan Power Grid Co. Ltd Kunming650200 China Department of Computer Science School of Engineering Shantou University Shantou515063 China Shantou University Shantou515063 China College of Information Engineering and Automation Kunming University of Science and Technology Kunming650217 China

Due to a large amount of information, it is difficult for users to find what they are interested in among the many choices. In order to improve users’ experience, recommendation systems have been widely used in music recommendations, movie recommendations, online shopping, and other scenarios. Recently, Knowledge Graph (KG) has been proven to be an effective tool to improve the performance of recommendation systems. However, a huge challenge in applying knowledge graphs for recommendation is how to use knowledge graphs to obtain better user codes and item codes. In response to this problem, this research proposes a user Recurrent Neural Network (RNN) encoder and item encoder recommendation algorithm based on Knowledge Graph (URIR). This study encodes items by capturing high-level neighbor information to generate items’ representation vectors and applies an RNN and items’ representation vectors to encode users to generate users’ representation vectors, and then perform inner product operation on users’ representation vectors and items’ representation vectors to get probabilities of users interaction with items. Numerical experiments on three real-world datasets demonstrate that URIR is superior performance to state-of-the-art algorithms in indicators such as AUC, Precision, Recall, and MRR. This implies that URIR can effectively use knowledge graph to obtain better user codes and item codes, thereby obtaining better recommendation results. © 2021, CC BY.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Distantly Supervised Relation Extraction via Recursive Hierarchy-Interactive Attention and Entity-Order Perception

arXiv

引用

arXiv 2021年

作者： Han, Ridong Peng, Tao Han, Jiayu Cui, Hai Liu, Lu College of Computer Science and Technology Jilin University Jilin Changchun130012 China College of Software Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun130012 China Department of Linguistics University of Washington SeattleWA98195 United States

Wrong-labeling problem and long-tail relations severely affect the performance of distantly supervised relation extraction task. Many studies mitigate the effect of wrong-labeling through selective attention mechanism and handle long-tail relations by introducing relation hierarchies to share knowledge. However, almost all existing studies ignore the fact that, in a sentence, the appearance order of two entities contributes to the understanding of its semantics. Furthermore, they only utilize each relation level of relation hierarchies separately, but do not exploit the heuristic effect between relation levels, i.e., higher-level relations can give useful information to the lower ones. Based on the above, in this paper, we design a novel Recursive Hierarchy-Interactive Attention network (RHIA) to further handle long-tail relations, which models the heuristic effect between relation levels. From the top down, it passes relation-related information layer by layer, which is the most significant difference from existing models, and generates relation-augmented sentence representations for each relation level in a recursive structure. Besides, we introduce a newfangled training objective, called Entity-Order Perception (EOP), to make the sentence encoder retain more entity appearance information. Substantial experiments on the popular New York Times (NYT) dataset are conducted. Compared to prior baselines, our RHIA-EOP achieves state-of-the-art performance in terms of precision-recall (P-R) curves, AUC, Top-N precision and other evaluation metrics. Insightful analysis also demonstrates the necessity and effectiveness of each component of RHIA-EOP. © 2021, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

REFUGE2 CHALLENGE: A TREASURE TROVE FOR MULTI-DIMENSION ANALYSIS AND EVALUATION IN GLAUCOMA SCREENING

arXiv

引用

arXiv 2022年

作者： Fang, Huihui Li, Fei Wu, Junde Fu, Huazhu Sun, Xu Son, Jaemin Yu, Shuang Zhang, Menglu Yuan, Chenglang Bian, Cheng Lei, Baiying Zhao, Benjian Xu, Xinxing Li, Shaohua Fumero, Francisco Sigut, José Almubarak, Haidar Bazi, Yakoub Guo, Yuanhao Zhou, Yating Baid, Ujjwal Innani, Shubham Guo, Tianjiao Yang, Jie Orlando, José Ignacio Bogunović, Hrvoje Zhang, Xiulan Xu, Yanwu The REFUGE2 Challenge Australia State Key Laboratory of Ophthalmology Zhongshan Ophthalmic Center Sun Yat-Sen University Guangdong Provincial Key Laboratory of Ophthalmology and Visual Science Guangzhou China Intelligent Healthcare Unit Baidu Inc. Beijing China The Institute of High Performance Computing Agency for Science Technology and Research Singapore Yatiris Group PLADEMA Institute CONICET UNICEN Tandil Argentina Christian Doppler Lab for Artificial Intelligence in Retina Department of Ophthalmology and Optometry Medical University of Vienna Vienna Austria VUNO Inc Seoul Korea Republic of Tencent HealthCare Tencent Shenzhen China Computer Vision Institute College of Computer Science and Software Engineering of Shenzhen University Shenzhen China School of Biomedical Engineering Health Science Center Shenzhen University China Xiaohe Healthcare ByteDance Guangdong Guangzhou510000 China School of Biomedical Engineering Shenzhen University China College of Computer Science & Software Engineering Shenzhen University China Department of Computer Science and Systems Engineering Universidad de La Laguna Spain Saudi Electronic University Saudi Arabia King Saud University Saudi Arabia Institute of Automation Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China SGGS Institute of Engineering and Technology India Institute of Medical Robotics Shanghai Jiao Tong University China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China

With the rapid development of artificial intelligence (AI) in medical image processing, deep learning in color fundus photography (CFP) analysis is also evolving. Although there are some open-source, labeled datasets of CFPs in the ophthalmology community, large-scale datasets for screening only have labels of disease categories, and datasets with annotations of fundus structures are usually small in size. In addition, labeling standards are not uniform across datasets, and there is no clear information on the acquisition device. Here we release a multi-annotation, multi-quality, and multi-device color fundus image dataset for glaucoma analysis on an original challenge-Retinal Fundus Glaucoma Challenge 2nd Edition (REFUGE2). The REFUGE2 dataset contains 2000 color fundus images with annotations of glaucoma classification, optic disc/cup segmentation, as well as fovea localization. Meanwhile, the REFUGE2 challenge sets three sub-tasks of automatic glaucoma diagnosis and fundus structure analysis and provides an online evaluation framework. Based on the characteristics of multi-device and multi-quality data, some methods with strong generalizations are provided in the challenge to make the predictions more robust. This shows that REFUGE2 brings attention to the characteristics of real-world multi-domain data, bridging the gap between scientific research and clinical application. © 2022, CC BY-NC-ND.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Pareto-wise Ranking Classifier for Multi-objective Evolutionary Neural Architecture Search

arXiv

引用

arXiv 2021年

作者： Ma, Lianbo Li, Nan Yu, Guo Geng, Xiaoyu Cheng, Shi Wang, Xingwei Huang, Min Jin, Yaochu College of Software Northeastern University Shenyang110819 China The Institute of Intelligent Manufacturing Nanjing Tech University Nanjing211816 China The School of Computer Science Shaanxi Normal University Xi’an710062 China The College of Computer Science Northeastern University Shenyang110819 China The College of Information Science and Engineering State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China The Faculty of Technology Bielefeld University Bielefeld33619 Germany The Department of Computer Science University of Surrey GuildfordGU2 7XH United Kingdom

In multi-objective evolutionary neural architecture search (NAS), existing predictor-based methods commonly suffer from the rank disorder issue that a candidate high-performance architecture may have a poor ranking compared with the worse architecture in terms of the trained *** alleviate the above issue, we aim to train a Pareto-wise end-to-end ranking classifier to simplify the architecture search process by transforming the complex multi-objective NAS task into a simple classification task. To this end, a classifier-based Pareto evolution approach is proposed, where an online classifier is trained to directly predict the dominance relationship between the candidate and reference architectures. Besides, an adaptive clustering method is designed to select reference architectures for the classifier, and an α-domination assisted approach is developed to address the imbalance issue of positive and negative samples. The proposed approach is compared with a number of state-of-the-art NAS methods on widely-used test datasets, and computation results show that the proposed approach is able to alleviate the rank disorder issue and outperforms other methods. Especially, the proposed method is able to find a set of promising network architectures with different model sizes ranging from 2M to 5M under diverse objectives and constraints. © 2021, CC BY.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Identification of failure regions for programs with numeric inputs

arXiv

引用

arXiv 2020年

作者： Huang, Rubing Sun, Weifeng Chen, Tsong Yueh Ng, Sebastian Chen, Jinfu School of Computer Science and Communication Engineering Jiangsu Key Laboratory of Security Technology for Industrial Cyberspace Jiangsu University ZhenjiangJiangsu212013 China School of Computer Science and Communication Engineering Jiangsu University ZhenjiangJiangsu212013 China Department of Computer Science and Software Engineering Swinburne University of Technology HawthornVIC3122 Australia

Failure region, where failure-causing inputs reside, has provided many insights to enhance testing effectiveness of many testing methods. Failure region may also provide some important information to support other processes such as software debugging. When a testing method detects a software failure, indicating that a failure-causing input is identified, the next important question is about how to identify the failure region based on this failure-causing input, i.e., Identification of Failure Regions (IFR). In this paper, we introduce a new IFR strategy, namely Search for Boundary (SB), to identify an approximate failure region of a numeric input domain. SB attempts to identify additional failure-causing inputs that are as close to the boundary of the failure region as possible. To support SB, we provide a basic procedure, and then propose two methods, namely Fixed-orientation Search for Boundary (FSB) and Diverse-orientation Search for Boundary (DSB). In addition, we implemented an automated experimentation platform to integrate these methods. In the experiments, we evaluated the proposed SB methods using a series of simulation studies andempirical studies with different types of failure regions. The results show that our methods can effectively identify a failure region, within the limited testing resources. Copyright © 2020, The Authors. All rights reserved.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

Context-Aware Point-of-Interest Recommendation Algorithm with Interpretability 15th

Context-Aware Point-of-Interest Recommendation Algorithm wit...

引用

15th EAI International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2019

作者： Zhang, Guoming Qi, Lianyong Zhang, Xuyun Xu, Xiaolong Dou, Wanchun State Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Information Science and Engineering Qufu Normal University Qufu China Department of Electrical Computer Engineering The University of Auckland Auckland New Zealand School of Computer and Software Nanjing University of Information Science and Technology Nanjing China Health Statistics and Information Center of Jiangsu Province Nanjing China

ISBN: (纸本)9783030301453

With the rapid development of mobile Internet, smart devices, and positioning technologies, location-based social networks (LBSNs) are growing rapidly. In LBSNs, point-of-interest (POI) recommendation is a crucial personalized location service that has become a research hotspot. To address extreme sparsity of user check-in data, a growing line of research exploits spatial-temporal information, social relationship, content information, popularity, and other factors to improve recommendation performance. However, the temporal and spatial transfers of user preferences are seldom mentioned in existing works, and interpretability, which is an important factor to enhance credibility of recommendation result, is overlooked. To cope with these issues, we propose a context-aware POI recommendation framework, which integrates users’ long-term static and time-varying preferences to improve recommendation performance and provide explanations. Experimental results over two real-world LBSN datasets demonstrate that the proposed solution has better performance than other advanced POI recommendation approaches. © 2019, ICST Institute for computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Clustering of Complex Symbolic Data and Application for Emitter Identification

引用

Journal of computer science & technology 2018年第4期33卷 807-822页

作者： Xin Xu Jiaheng Lu Wei Wang Laboratory of Science and Technology on Information System Engineering Nanjing Research Institute of Electronics Engineering Nanjing 21000~ China Department of Computer Science University of Helsinki Helsinki 00014 Finland State Key Laboratory for Novel Software and Technology Nanjing University Nanjing 210046 China

It is well-known that the values of symbolic variables may take various forms such as an interval, a set of stochastic measurements of some underlying patterns or qualitative multi-values and so on. However, the majority of existing work in symbolic data analysis still focuses on interval values. Although some pioneering work in stochastic pattern based symbolic data and mixture of symbolic variables has been explored, it still lacks flexibility and computation efficiency to make full use of the distinctive individual symbolic variables. Therefore, we bring forward a novel hierarchical clustering method with weighted general Jaccard distance and effective global pruning strategy for complex symbolic data and apply it to emitter identification. Extensive experiments indicate that our method has outperformed its peers in both computational efficiency and emitter identification accuracy.

关键词： symbolic data analysis stochastic pattern fuzzy interval hierarchical clustering emitter identification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：