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

Signal, Information and data Processing (ICSIDP), IEEE International Conference on

作者： Xinlong Pan Xueqi Cheng Libo Yao Zhenqiu Zhu Biao Ding Tiantian Tang Minbo Li Chuanhui Liu CAS Key Laboratory of Network Data Science & Technology Inistitute of Computing Technology Beijing China Institute of Information Fusion Naval Aviation University Yantai China School of Software Fudan University Shanghai China

ISBN: (数字)9781728123455

ISBN: (纸本)9781728123462

Through the fusion processing of target data obtained by radar, electronic reconnaissance, space reconnaissance, technical reconnaissance and civil cooperative system in early warning and surveillance system, multidimensional target data including explicit state information such as target attributes, type, position, speed and course could be obtained. The latent potential information, such as regular behavior, intention and threat degree, need to be mastered by human intelligence and experience analysis. It is urgent to use big data mining technology to realize intelligent analysis of target behavior. Based on the analysis of big data related technologies, this paper designs an intelligent target behavior analysis system based on distributed computing, which provides theoretical and technical support for intelligent upgrading of intelligence processing systems and command decision systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Deep Look into Neural Ranking Models for Information Retrieval

arXiv

引用

arXiv 2019年

作者： Guo, Jiafeng Fan, Yixing Pang, Liang Yang, Liu Ai, Qingyao Zamani, Hamed Wu, Chen Croft, W. Bruce Cheng, Xueqi University of Chinese Academy of Sciences Beijing China Cas Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China Center for Intelligent Information Retrieval University of Massachusetts Amherst AmherstMA United States

Ranking models lie at the heart of research on information retrieval (IR). During the past decades, different techniques have been proposed for constructing ranking models, from traditional heuristic methods, probabilistic methods, to modern machine learning methods. Recently, with the advance of deep learning technology, we have witnessed a growing body of work in applying shallow or deep neural networks to the ranking problem in IR, referred to as neural ranking models in this paper. The power of neural ranking models lies in the ability to learn from the raw text inputs for the ranking problem to avoid many limitations of hand-crafted features. Neural networks have sufficient capacity to model complicated tasks, which is needed to handle the complexity of relevance estimation in ranking. Since there have been a large variety of neural ranking models proposed, we believe it is the right time to summarize the current status, learn from existing methodologies, and gain some insights for future development. In contrast to existing reviews, in this survey, we will take a deep look into the neural ranking models from different dimensions to analyze their underlying assumptions, major design principles, and learning strategies. We compare these models through benchmark tasks to obtain a comprehensive empirical understanding of the existing techniques. We will also discuss what is missing in the current literature and what are the promising and desired future directions. Copyright © 2019, The Authors. All rights reserved.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

A quantum-inspired classical algorithm for separable non-negative matrix factorization

arXiv

引用

arXiv 2019年

作者： Chen, Zhihuai Li, Yinan Sun, Xiaoming Yuan, Pei Zhang, Jialin CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China Centrum Wiskunde & Informatica and QuSoft Science Park 123 Amsterdam1098XG Netherlands

Non-negative Matrix Factorization (NMF) asks to decompose a (entry-wise) non-negative matrix into the product of two smaller-sized nonnegative matrices, which has been shown intractable in general. In order to overcome this issue, separability assumption is introduced which assumes all data points are in a conical hull. This assumption makes NMF tractable and is widely used in text analysis and image processing, but still impractical for huge-scale datasets. In this paper, inspired by recent development on dequantizing techniques, we propose a new classical algorithm for separable NMF problem. Our new algorithm runs in polynomial time in the rank and logarithmic in the size of input matrices, which achieves an exponential speedup in the low-rank setting. Copyright © 2019, The Authors. All rights reserved.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Graph based Tensor Recovery for Accurate Internet Anomaly Detection

Graph based Tensor Recovery for Accurate Internet Anomaly De...

引用

2018 IEEE Conference on Computer Communications, INFOCOM 2018

作者： Xie, Kun Li, Xiaocan Wang, Xin Xie, Gaogang Wen, Jigang Zhang, Dafang College of Computer Science and Electronics Engineering Hunan University China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China Department of Electrical and Computer Engineering State University of New York at Stony Brook United States Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9781538641286

Detecting anomalous traffic is a crucial task of managing networks. Many anomaly detection algorithms have been proposed recently. However, constrained by their matrix-based traffic data model, existing algorithms often suffer from low detection accuracy. To fully utilize the multi-dimensional information hidden in the traffic data, this paper takes an initiative to investigate the potential and methodologies of performing tensor factorization for more accurate Internet anomaly detection. Only considering the low-rank linearity features hidden in the data, current tensor factorization techniques would result in low anomaly detection accuracy. We propose a novel Graph-based Tensor Recovery model (Graph-TR) to well explore both low rank linearity features as well as the non-linear proximity information hidden in the traffic data for better anomaly detection. We encode the non-linear proximity information of the traffic data by constructing nearest neighbor graphs and incorporate this information into the tensor factorization using the graph Laplacian. Moreover, to facilitate the quick building of neighbor graph, we propose a nearest neighbor searching algorithm with the simple locality-sensitive hashing (LSH). We have conducted extensive experiments using Internet traffic trace data Abilene and GEANT. Compared with the state of art algorithms on matrix-based anomaly detection and tensor recovery approach, our Graph-Trcan achieve significantly lower False Positive Rate and higher True Positive Rate. © 2018 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Primitives generation policy learning without catastrophic forgetting for robotic manipulation 19

Primitives generation policy learning without catastrophic f...

引用

19th IEEE International Conference on data Mining Workshops, ICDMW 2019

作者： Xiong, Fangzhou Liu, Zhiyong Huang, Kaizhu Yang, Xu Hussain, Amir State Key Lab of Management and Control for Complex Systems Institute of Automation Chinese Academy of Science China China CAS Centre for Excellence in Brain Science and Intelligence Technology Chinese Academy of Sciences China Department of EEE Xi'an Jiaotong-Liverpool University China School of Computing Edinburgh Napier University United Kingdom

ISBN: (纸本)9781728146034

Catastrophic forgetting is a tough challenge when agent attempts to address different tasks sequentially without storing previous information, which gradually hinders the development of continual learning. Except for image classification tasks in continual learning, however, there are little reviews related to robotic manipulation. In this paper, we present a novel hierarchical architecture called Primitives Generation Policy Learning to enable continual learning. More specifically, a generative method by Variational Autoencoder is employed to generate state primitives from task space, then separate policy learning component is designed to learn torque control commands for different tasks sequentially. Furthermore, different task policies could be identified automatically by comparing reconstruction loss in the autoencoder. Experiment on robotic manipulation task shows that the proposed method exhibits substantially improved performance over some other continual learning methods. © 2019 IEEE.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Identifying High Potential Talent: A Neural network Based Dynamic Social Profiling Approach

Identifying High Potential Talent: A Neural Network Based Dy...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yuyang Ye Hengshu Zhu Tong Xu Fuzhen Zhuang Runlong Yu Hui Xiong Anhui Province Key Lab of Big Data Analysis and Application University of Science and Technology of China Baidu Talent Intelligence Center Baidu Inc Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology University of Chinese Academy of Sciences

How to identify high-potential talent (HIPO) earlier in their career always has strategic importance for human resource management. While tremendous efforts have been made in this direction, most existing approaches are still based on the subjective selection of human resource experts. This could lead to unintentional bias and inconsistencies. To this end, in this paper, we propose a neural network based dynamic social profiling approach for quantitatively identifying HIPOs from the newly-enrolled employees by modeling the dynamics of their behaviors in organizational social networks. A basic assumption is that HIPOs usually perform more actively and have higher competencies than their peers to accumulate their social capitals during their daily work practice. Along this line, we first propose to model the social profiles of employees with both Graph Convolutional network (GCN) and social centrality analysis in a comprehensive way. Then, an adaptive Long Short Term Memory (LSTM) network with global attention mechanism is designed to capture the profile dynamics of employees in the organizational social networks during their early career. Finally, extensive experiments on real-world data clearly validate the effectiveness of our approach as well as the interpretability of our results.

关键词： Social networking (online) Companies Artificial neural networks Germanium Engineering profession

来源：评论

学校读者我要写书评

暂无评论

Priority-Based Optimization of I/O Isolation for Hybrid Deployed Services 15th

Priority-Based Optimization of I/O Isolation for Hybrid Depl...

引用

15th EAI International Conference on Collaborative computing: networking, Applications and Worksharing, CollaborateCom 2019

作者： Zhang, Jiancheng Li, Youhuizi Zhou, Li Ren, Zujie Wan, Jian Wang, Yuan Key Laboratory of Complex Systems Modeling and Simulation Ministry of Education Hangzhou Dianzi University Hangzhou China School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China Zhejiang Lab Hangzhou China School of Information and Electronic Engineering Zhejiang University of Science and Technology Hangzhou China Key Enterprise Research Institute of NetEase Big Data of Zhejiang Province Netease Hangzhou Network Co.Ltd Hangzhou China

ISBN: (纸本)9783030301453

With the increasing of software complexity and user demands, collaborative service is becoming more and more popular. Each service focuses on its own specialty, their cooperation can support complicated task with high efficiency. To improve the resources utilization, virtualization technology like container is used and it enables multiple services running in the same physical machine. However, since the host physical machine is shared by several services, the resource competition is inevitable. Isolation is an effective solution, but the weak isolation mechanisms of container cannot handle such complicated scenarios. In the worst situation, the performance of services cannot meet the requirements and the system may crash. In order to solve this problem, we propose a priority-based optimization mechanism for I/O isolation after analyzing the characteristics of typical service workloads. Based on the real-time performance data, priority is automatically assigned to each service and corresponding optimization methods are applied. We evaluate the optimization effects of the priority-based mechanism in both static and dynamic workload cases, besides, the influence of different priority order is also analyzed. The experimental results show that our approach can indeed improve the system performance and guarantee the requirements of all the running services are satisfied. © 2019, ICST institute for Computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

Fully Learnable Group Convolution for Acceleration of Deep Neural networks

Fully Learnable Group Convolution for Acceleration of Deep N...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Xijun Wang Meina Kan Shiguang Shan Xilin Chen Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China University of Chinese Academy of Sciences Beijing China CAS Center for Excellence in Brain Science and Intelligence Technology Shanghai China

ISBN: (纸本)9781728132945

Benefitted from its great success on many tasks, deep learning is increasingly used on low-computational-cost devices, e.g. smartphone, embedded devices, etc. To reduce the high computational and memory cost, in this work, we propose a fully learnable group convolution module (FLGC for short) which is quite efficient and can be embedded into any deep neural networks for acceleration. Specifically, our proposed method automatically learns the group structure in the training stage in a fully end-to-end manner, leading to a better structure than the existing pre-defined, two-steps, or iterative strategies. Moreover, our method can be further combined with depthwise separable convolution, resulting in 5 times acceleration than the vanilla Resnet50 on single CPU. An additional advantage is that in our FLGC the number of groups can be set as any value, but not necessarily 2^k as in most existing methods, meaning better tradeoff between accuracy and speed. As evaluated in our experiments, our method achieves better performance than existing learnable group convolution and standard group convolution when using the same number of groups.

关键词： acceleration Convolution numerical invariant Group Structure Neural network

来源：评论

学校读者我要写书评

暂无评论

Sdgan: Improve Speech Enhancement Quality by Information Filter

引用

Journal of Physics: Conference Series 2021年第1期1871卷

作者： Xiaozhou Guo Yi Liu Wenyu Mao Jixing Li Wenchang Li Guoliang Gong Huaxiang Lu Institute of Semiconductors Chinese Academy of Sciences Beijing 100083 China University of Chinese Academy of Sciences Beijing 100089 China CAS Center for Excellence in Brain Science and Intelligence Technology Chinese Academy of Sciences Beijing 200031 China Semiconductor Neural Network Intelligent Perception and Computing Technology Beijing Key Lab Beijing 100083 China

The speech denoising model based on adversarial generative network has achieved better results than the traditional machine learning model. In this paper, for the short cut connection in the generator, we discuss its influence on the information transfer between encoder and decoder, and propose SDGAN at target. SDGAN sets linear and convolution filters in the short cut connection which adaptively learn the optimal information processing. The information filter still enables the generator to solve the gradient vanishing problem, and it can also avoid information redundancy and improve expression ability. In addition, SDGAN replaces the L1 regularization term in loss function with the L2 regularization term, which not only makes the output speech of the generator closer to the clean speech, but also avoids sparsity. In the experiments, SDGAN significantly performs better than other traditional GAN in five performance metrics (such as PESQ), and the effect of convolution filter is better than that of linear filter.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：