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

Non-SPF routing algorithm based on ordered semi-group preference algebra

The Journal of China Universities of Posts and Telecommunications 2017年第6期24卷 14-23页

作者： Zhang Yongtang Fan Bo Department of Computer Science and Technology Guangdong Neusoft Institute Foshan 528225 China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou 510006 China

Layer 2 network technology is extending beyond its traditional local area implementation and finding wider acceptance in provider＇s metropolitan area networks and large-scale cloud data center networks. This is mainly due to its plug-and-play capability and native mobility support. Many efforts have been put to increase the bisection bandwidth in layer 2 network, which has been constrained by the spanning tree protocol （STP） that layer 2 network uses for preventing looping. The recent trend is to incorporate layer 3＇s routing approach into layer 2 network so that multiple paths can be used for forwarding traffic between any source-destination （S-D） node pair. Equal cost multipath （ECMP） is one such example. However, ECMP may still be limited in generating multiple paths due to its shortest path （lowest cost） requirement. In this paper, we consider a non-shortest-path routing approach, called equal preference multipath （EPMP） based on ordered semi group theory, which can generate more paths than ECMP. In EPMP routing, all the paths with different traditionally-defined costs, such as hops, bandwidth, etc., can be determined equally now and thus they become equal candidate paths. By the comparative tests with ECMP, EPMP routing not only generates more paths, provides 15% higher bisection bandwidth, but also identifies bottleneck links in a hierarchical network when different traffic patterns are applied EPMP is more flexible in controlling the number and length of multipath generation. Simulation results indicate the effectiveness of the proposed algorithm. It is a good reference for non-blocking running of big datacenter networks.

关键词： non-SPF routing algorithm algebraic routing equal preference multipath datacenter networks

来源：评论

学校读者我要写书评

暂无评论

Multi-Cluster Feature Selection Based on Isometric Mapping

引用

IEEE/CAA Journal of Automatica Sinica 2022年第3期9卷 570-572页

作者： Yadi Wang Zefeng Zhang Yinghao Lin Henan Key Laboratory of Big Data Analysis and Processing Henan UniversityKaifeng 475004 Institute of Data and Knowledge Engineering School of Computer and Information EngineeringHenan UniversityKaifeng 475004China

Dear editor,This letter presents an unsupervised feature selection method based on machine *** selection is an important component of artificial intelligence,machine learning,which can effectively solve the curse of d... 详细信息

关键词： problem letter dimensionality

来源：评论

学校读者我要写书评

暂无评论

Character Recognition Based on Multi-scale Feature Fusion Transfer Learning 6th

Character Recognition Based on Multi-scale Feature Fusion Tr...

引用

6th Conference on Signal and Information processing, Networking and Computers, ICSINC 2019

作者： Zhang, Miaohui Pang, Kangning Chen, Yunzhong Zhang, Bo Key Laboratory of Data Analysis and Processing of Henan Province Henan University Kaifeng China

ISBN: (纸本)9789811541629

Video surveillance has been using in daily life widely and has significant impact in security field. Reading time information in video has becoming an essential part. Because of the complex background of timestamp and the high similarity between targets, the features extracted by traditional machine learning algorithm cannot meet the requirements and cannot achieve the required detection speed and accuracy. In this paper, we improved the algorithm with multi-scale features. Features extracted from convolution layers of different scales are used to predict, which could improve the recognition accuracy of small targets. In addition, because the size of the collected dataset is 2860 and the amount of data is not large enough, we use data augmentation and transfer learning to train. Pre-training on the public dataset SVHN firstly, and then trains on the special dataset. Experiments show that the algorithm can recognize timestamps accurately. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

A new double scrambling color image encryption algorithm based on multi chaotic systems and image segmentation 3

A new double scrambling color image encryption algorithm bas...

引用

3rd International Conference on Computer Science and Management Technology, ICCSMT 2022

作者： Tian, Junfeng Wang, Ke Liu, Cheng Henan University Key Laboratory of Big Data Analysis and Processing of Henan Province Kaifeng China

ISBN: (纸本)9798350320404

Aiming at low security of traditional encryption methods, this paper give a new encryption method by using multi chaotic systems and image segmentation. Firstly, use Arnold transform to perturb the RGB component matrices of the source image. Subsequently, the chaotic image chunking algorithm is applied to the mixed component matrix, and the chunked mixed matrix is perturbed by Hyperchaotic Chen system and Logistic mapping. Moreover, Diffusion of pixel transformations to the whole image by inverse transform operations. Finally, logistic system is applied to the secondary pixels scrambling, which achieves image encryption. The experimental data indicate that this encryption method encryption effect is good, and can effectively prevent ciphertext attack and noise attack. © 2022 IEEE.

关键词： image segmentation

来源：评论

学校读者我要写书评

暂无评论

High-resolution rock abundance derivation of lunar cold spot craters based on RA-SAR model

引用

Planetary and Space Science 2025年 263卷

作者： Sun, Jiacheng Lu, Xin Shu, Gaofeng Guo, Zhengwei Li, Ning School of Computer and Information Engineering Henan University Kaifeng475004 China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China Henan Province Engineering Research Center of Spatial Information Processing Henan University Kaifeng475004 China

The distribution of rock abundance (RA) on the lunar surface plays a pivotal role in understanding its geological evolution. This study focuses on the derivation of high-resolution RA data for lunar cold spot craters using Mini-RF (Miniature Radio Frequency) synthetic aperture radar (SAR) data. Firstly, terrain correction was applied to the SAR data. Secondly, the correlation between the Stokes parameters (S1, S2, S3, and S4) and RA was examined using optically-derived RA data, which aligns with the resolution of the Mini-RF SAR images. By plotting scatter diagrams showing the relationships between the Stokes parameters and the optically-derived RA, strong statistical associations were established. Finally, based on these findings, we formulated a regression-based RA-SAR model. This model was applied to other lunar cold spot craters in order to derive their high-resolution RA distributions. The experimental results show that the model yields highly precise outcomes when validated against both Diviner RA and optical data. The study provides a new approach for inferring rock distribution across the lunar surface using SAR data, and offers valuable insights for advancing lunar geological research. © 2025

关键词：

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous-attributes enhancement deep framework for network embedding

引用

Frontiers of Computer Science 2021年第6期15卷 121-131页

作者： Lisheng QIAO Fan ZHANG Xiaohui HUANG Kai LI Enhong CHEN Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of ChinaHefei 230022China National Key Laboratory of Blind Signal Processing Chengdu 610041China School of Computer Science and Technology University of Science and Technology of ChinaHefei 230022China

Network embedding,which targets at learning the vector representation of vertices,has become a crucial issue in network ***,considering the complex structures and heterogeneous attributes in real-world networks,existing methods may fail to handle the inconsistencies between the structure topology and attribute ***,more comprehensive techniques are urgently required to capture the highly non-linear network structure and solve the existing inconsistencies with retaining more *** that end,in this paper,we propose a heterogeneous-attributes enhancement deep framework(HEDF),which could better capture the non-linear structure and associated information in a deep learningway,and effectively combine the structure information of multi-views by the combining *** this line,the inconsistencies will be handled to some extent and more structure information will be preserved through a semi-supervised *** extensive validations on several real-world datasets show that our model could outperform the baselines,especially for the sparse and inconsistent situation with less training data.

关键词： network embedding heterogeneous-attributes deep framework inconsistent

来源：评论

学校读者我要写书评

暂无评论

Multimodal Sentiment analysis of Graphic Texts Based on Multicategorical Relative Fusion 6

Multimodal Sentiment Analysis of Graphic Texts Based on Mult...

引用

6th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2023

作者： Zhai, Sheping Gao, Mingyang Yang, Rui Kang, Xinnian Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications China

ISBN: (纸本)9798400707674

Unlike the traditional unimodal sentiment analysis, multimodal sentiment analysis can jointly process features between different modalities. Existing multimodal sentiment analysis methods simply extract features from text and images ignoring the influence of emoticons that may be contained in text and scene information in images on sentiment polarity judgment. At the same time, the unimodal feature fusion stage does not fully fuse the features of each modality resulting in low accuracy of sentiment analysis. Therefore, this paper proposes a multimodal sentiment analysis model based on multicategorical relative fusion of images and texts. which separates text content and emoji in the word embedding stage in the feature extraction stage, the traditional emoji sentiment dictionary is queried to obtain their sentiment scores and attention mechanism is introduced to extract scene features and object features of images respectively;in the feature fusion stage, the emoji sentiment scores. mixed image. The final multimodal features are obtained by fusion the emoji sentiment scores. mixed image features and text features with layer normalization. The experiments on the dataset Yelp show that the improvement of the model in the feature extraction and feature fusion stages effectively improves the accuracy and F1 value of multimodal sentiment analysis in which the accuracy increases by 4.7 percentage points on the New York dataset and the F1 value reaches 85.7% on the San Francisco dataset. © 2023 ACM.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Low-resource generation of multi-hop reasoning questions 58

Low-resource generation of multi-hop reasoning questions

引用

58th Annual Meeting of the Association for Computational Linguistics, ACL 2020

作者： Yu, Jianxing Liu, Wei Qiu, Shuang Su, Qinliang Wang, Kai Quan, Xiaojun Yin, Jian School of Data and Computer Science Sun Yat-Sen University Guangdong Key Laboratory of Big Data Analysis and Processing China

ISBN: (纸本)9781952148255

This paper focuses on generating multi-hop reasoning questions from the raw text in a low resource circumstance. Such questions have to be syntactically valid and need to logically correlate with the answers by deducing over multiple relations on several sentences in the text. Specifically, we first build a multi-hop generation model and guide it to satisfy the logical rationality by the reasoning chain extracted from a given text. Since the labeled data is limited and insufficient for training, we propose to learn the model with the help of a large scale of unlabeled data that is much easier to obtain. Such data contains rich expressive forms of the questions with structural patterns on syntax and semantics. These patterns can be estimated by the neural hidden semi-Markov model using latent variables. With latent patterns as a prior, we can regularize the generation model and produce the optimal results. Experimental results on the HotpotQA data set demonstrate the effectiveness of our model. Moreover, we apply the generated results to the task of machine reading comprehension and achieve significant performance improvements. © 2020 Association for Computational Linguistics

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Type-Aware Question Answering over Knowledge Base with Attention-Based Tree-Structured Neural Networks

引用

Journal of Computer Science & Technology 2017年第4期32卷 805-813页

作者： Jun Yin Wayne Xin Zhao Xiao-Ming Li School of Electronic Engineering and Computer Science Peking University Beijing 100871 China School of Information Renmin University of China Beijing 100872 China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou 510006 China

Question answering (QA) over knowledge base (KB) aims to provide a structured answer from a knowledge base to a natural language question. In this task, a key step is how to represent and understand the natural language query. In this paper, we propose to use tree-structured neural networks constructed based on the constituency tree to model natural language queries. We identify an interesting observation in the constituency tree: different constituents have their own semantic characteristics and might be suitable to solve different subtasks in a QA system. Based on this point, we incorporate the type information as an auxiliary supervision signal to improve the QA performance. We call our approach type-aware QA. We jointly characterize both the answer and its answer type in a unified neural network model with the attention mechanism. Instead of simply using the root representation, we represent the query by combining the representations of different constituents using task-specific attention weights. Extensive experiments on public datasets have demonstrated the effectiveness of our proposed model. More specially, the learned attention weights are quite useful in understanding the query. The produced representations for intermediate nodes can be used for analyzing the effectiveness of components in a QA system.

关键词： question answering deep neural network knowledge base

来源：评论

学校读者我要写书评

暂无评论

Edge Computing Task Scheduling with Joint Blockchain and Task Caching in Industrial Internet

引用

Computers, Materials & Continua 2023年第4期75卷 2101-2117页

作者： Yanping Chen Xuyang Bai Xiaomin Jin Zhongmin Wang Fengwei Wang Li Ling School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’an710121China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anShaanxi710121China ZTE Corporation Shenzhen51805China

Deploying task caching at edge servers has become an effectiveway to handle compute-intensive and latency-sensitive tasks on the industrialinternet. However, how to select the task scheduling location to reduce taskdelay and cost while ensuring the data security and reliable communicationof edge computing remains a challenge. To solve this problem, this paperestablishes a task scheduling model with joint blockchain and task cachingin the industrial internet and designs a novel blockchain-assisted cachingmechanism to enhance system security. In this paper, the task schedulingproblem, which couples the task scheduling decision, task caching decision,and blockchain reward, is formulated as the minimum weighted cost problemunder delay constraints. This is a mixed integer nonlinear problem, which isproved to be nonconvex and NP-hard. To solve the optimal solution, thispaper proposes a task scheduling strategy algorithm based on an improvedgenetic algorithm (IGA-TSPA) by improving the genetic algorithm initializationand mutation operations to reduce the size of the initial solutionspace and enhance the optimal solution convergence speed. In addition,an Improved Least Frequently Used algorithm is proposed to improve thecontent hit rate. Simulation results show that IGA-TSPA has a faster optimalsolution-solving ability and shorter running time compared with the existingedge computing scheduling algorithms. The established task scheduling modelnot only saves 62.19% of system overhead consumption in comparison withlocal computing but also has great significance in protecting data security,reducing task processing delay, and reducing system cost.

关键词： Edge computing task scheduling blockchain task caching industrial security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：