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

IEEE International Conference on intelligent Data Acquisition and Advanced computing Systems

作者： Zhiwei Ye Yiheng Sun Shuang Sun Sikai Zhan Han Yu Quanfeng Yao Key Laboratory of Intelligent Computing and Information Processing Fujian Province University School of computer Science Hubei university of Technology Wuhan China Wuhan FiberHome Technical Services Co. Ltd.

As one of the most important parts of network security, more significance is attached to intrusion detection system (IDS). Numerous techniques including support vector machine (SVM) have been applied to the intrusion detection. However, many methods are utilized to improve the original SVM whose performance is markedly depended on its kernel parameters. Evolutionary algorithms such as genetic algorithm (GA) and particle swarm algorithm (PSO) are also employed to search better kernel parameters while the traditional optimization methods are vulnerable to fall into local minima with slow speed of convergence. In order to improve the precision of SVM in intrusion detection, the support vector machine based on grasshopper optimization algorithm (GOA-SVM) is proposed in the paper. To verify the practicality of the proposed method, several contrast experiments have been carried out using tool of Matlab. The experimental results finally demonstrates the superior performance of the proposed method on intrusion detection.

关键词： Support vector machines Optimization Intrusion detection Kernel Genetic algorithms Particle swarm optimization Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Multi-Scale Structure-Guided Graph Generation for Multi-View Semi-Supervised Classification

SSRN

引用

SSRN 2024年

作者： Wu, Yilin Chen, Zhaoliang Zou, Ying Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Department of Computer Science Hong Kong Baptist University Hong Kong

Graph convolutional network has emerged as a focal point in machine learning because of its robust graph processing capability. Most existing graph convolutional network-based approaches are designed for single-view data, yet in many practical scenarios, data is represented through multiple views. Although the ability of graph convolutional network is undeniable, the quality of graph directly affects its performance. Moreover, the process of graph generation with traditional nearest neighbor in traditional multi-view learning actually amplifies the influence of different information on performance across these views. To tackle the aforementioned challenges, this paper proposes a multi-scale graph generation deep learning framework, called multi-scale semi-supervised graph generation based multi-view classification, consisting of two modules: edge sampling and path sampling. The former aims to generate an adjacency graph by selecting edges based on the maximum likelihood among graphs from different views. Meanwhile, the latter seeks to construct adjacency graphs according to the characteristics of paths within the graphs. Extensive experimental results robustly demonstrate the superior performance of our proposed framework, compared to other state-of-the-art multi-view semi-supervised approaches. © 2024, The Authors. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

A news image captioning approach based on multimodal pointer-generator network

A news image captioning approach based on multimodal pointer...

引用

作者： Chen, Jingqiang Zhuge, Hai School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science and Network Engineering Guangzhou University Guangzhou China Department of Computer Science School of Engineering and Applied Science Aston University Birmingham United Kingdom Key Laboratory of Intelligent Information Processing Institute of Computing Technology University of Chinese Academy of Sciences Chinese Academy of Sciences Beijing China

News image captioning aims to generate captions or descriptions for news images automatically, serving as draft captions for creating news image captions manually. News image captions are different from generic captions as news image captions contain more detailed information such as entity names and events. Therefore, both images on news and the accompanying text are the source of generating caption of news image. Pointer-generator network is a neural method defined for text summarization. This article proposes the Multimodal pointer-generation network by incorporating visual information into the original network for news image captioning. The multimodal attention mechanism is proposed by splitting attention into visual attention paid to the image and textual attention paid to the text. The multimodal pointer mechanism is proposed by using both textual attention and visual attention to compute pointer distributions, where visual attention is first transformed into textual attention via the word-image relationships. The multimodal coverage mechanism is defined to reduce repetitions of attentions or repetitions of pointer distributions. Experiments on the DailyMail test dataset and the out-of-domain BBC test dataset show that the proposed model outperforms the original pointer-generator network, the generic image captioning method, the extractive news image captioning method, and the LDA-based method according BLEU, METEOR, and ROUGL-L evaluations. Experiments also show that the proposed multimodal coverage mechanisms can improve the model, and that transforming visual attention to pointer distributions can improve the model. © 2020 John Wiley & Sons, Ltd.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

Exploring Multi-loss Function Based Attention Framework for Vehicle Re-Identification

Exploring Multi-loss Function Based Attention Framework for ...

引用

IEEE International Symposium on information (IT) in Medicine and Education, ITME

作者： Wei Liu Yi Zhang Zhiming Luo Shaozi Li East China Jiaotong University Jiangxi China Hubei Key Laboratory of Intelligent Vision Based Monitoring for Hydroelectric Engineering Yi Chang China Postdoc Center of Information and Communication Engineering Xiamen University China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions Wuyishan China Cognitive Science Department Xiamen University Fujian China

Vehicle Re-identification(Re-ID) refers to the task of matching a specific vehicle across multiple non-overlapping cameras. Precise vehicle Re-ID suffers from two main challenges: (1) different vehicle identities with a similar appearance of the same type have a subtle inter-instance discrepancy, (2) one vehicle usually has large intra-instance differences due to viewpoint and illumination variations. To address these challenges, in this paper, we proposed an Attention-based Framework for Vehicle Re-ID named AFVR, which combines the benefits of both the cross-entropy loss function and the triplet loss function. Experimental results on two popular vehicle Re-ID benchmarks demonstrate the effectiveness of our proposed method, compared with the state of the arts.

关键词： Feature extraction Cameras Training Measurement Lighting Visualization Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

intelligent ultrasonic distance measurer system with temperature compensation algorithm

Intelligent ultrasonic distance measurer system with tempera...

引用

2022 International Applied Computational Electromagnetics Society Symposium, ACES-China 2022

作者： Wu, Yuwen Yang, Qiang Tang, Kai Zou, Jianhang Zhuo, Jianming Feng, Naixing Cai, Yijun Xiamen University of Technology Smart Sensing Integrated Circuit Engineering Research Center of Universities in Fujian Province Xiamen361024 China Xiamen Wish Information Technology Co. Ltd Xiamen361006 China Xiamen Blue Ocean Technology Co. Ltd Xiamen361022 China Anhui University Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Hefei China

ISBN: (纸本)9781665452366

With regard to distance measurement in daily life, the traditional way is to measure the distance between objects through rulers. Nowadays, ultrasonic ranging, laser ranging, radar ranging, sonar ranging and other technologies have enriched the way of distance measurement. At the same time, it is possible to choose a suitable solution according to different actual environments. This paper design an intelligent ultrasonic ranging system through the research of ultrasonic characteristics and the application of existing ultrasonic ranging. The paper introduces the design ideas and process of the intelligent ultrasonic ranging system. Through the design of independent buttons, the normal mode ranging and the high-precision mode ranging are generated to achieve the division of the measurement range and accuracy. When the distance between the measured object and the intelligent ultrasonic ranging system is less than the preset value or exceeds the range of this mode, the buzzer will sound an alarm, so that the system can be used in more fields. The system detects the current ambient temperature in real time, so that the distance measurement can be compensated and modified by the temperature compensation algorithm in the system to achieve self-adaptation and reduce measurement errors. © 2022 IEEE.

关键词： Range finding

来源：评论

学校读者我要写书评

暂无评论

Direct Participant Recruitment Strategy in Sparse Mobile Crowdsensing

引用

Jisuanji Xuebao/Chinese Journal of Computers 2022年第7期45卷 1539-1556页

作者： Tu, Chun-Yu Yu, Zhi-Yong Han, Lei Zhu, Wei-Ping Huang, Fang-Wan Guo, Wen-Zhong Wang, Le-Ye College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Department of Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China School of Computer Science Northwestern Polytechnical University Xi'an710072 China Key Lab of High Confidence Software Technologies Peking University Beijing100871 China School of Computer Science Peking University Beijing100871 China

Sparse Mobile Crowdsensing (Sparse MCS) selects a small part of sub-areas for data collection and infers the data of other sub-areas from the collected data. Compared with Mobile Crowdsensing (MCS) that does not use data inference methods, Sparse MCS saves sensing costs while ensuring the quality of global data. However, the existing research works on Sparse MCS only focus on selecting a small part of sub-areas with higher value. It does not consider whether the recruited participants can collect the data of the required sub-areas, and also ignores the value of other data collected by the participants. In order to solve the limitations of traditional methods in sub-areas selection, this paper starts from the perspective of participants and concentrates on the contribution of the data collected by each participant to the entire collection task. All the data contributions collected by each participant will become the basis for decision-making for the participant's choice. And correspondingly, a new idea to deal with the problem of participant selection under Sparse MCS is proposed. In view of the fact that each person's daily movement trajectory is basically stable, and the data collected by different people on their respective trajectories have different values, this paper uses this regularity and difference to study how to directly recruit participants who can collect high-value data. Furthermore, the participant selection problem considered in this paper is not limited to the data collection in the next cycle, but directly recruits some participants to continue the data collection task in the next multiple cycles. The participant selection problem that spans multiple cycles can be modeled as a dynamic decision-making problem. Since heuristic strategies may fall into a local optimal solution, this paper uses reinforcement learning to solve the participant selection problem: We use the participant selection system as an agent of reinforcement learning, and design the

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Object tracking by the least spatiotemporal searches

arXiv

引用

arXiv 2020年

作者： Yu, Zhiyong Han, Lei Chen, Chao Guo, Wenzhong Yu, Zhiwen College of Mathematics and Computer Sciences Fuzhou University Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350108 China School of Computer Science Northwestern Polytechnical University Xi'an710072 China School of Computer Science Chongqing University Chongqing400044 China

Tracking a suspicious car or a person in a city efficiently is crucial in urban safety management. But how can we complete the task with the minimal number of spatiotemporal searches when massive camera records are involved? To this end, this study proposes a strategy named intermediate searching at heuristic moments (IHMs). At each step, we determine which moment is the best one for the search based on a heuristic indicator. Then, at that moment, locations are searched one by one in descending order of predicted appearing probabilities until a search hit is obtained. We iterate this step until we derive the object's current location. Five searching strategies are compared via experiments. Among these strategies, the IHMs strategy is validated as the most efficient. IHMs can save up to 1/3 of the total cost. This result provides evidence that "searching at intermediate moments can save cost. Copyright © 2020, The Authors. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Chinese Lexical Based Sentiment Analysis Framework in Meteorology

Chinese Lexical Based Sentiment Analysis Framework in Meteor...

引用

IEEE International Conference on Big Data and Cloud computing (BdCloud)

作者： Yinan Li Fuquan Zhang Yifan Zhu Sifan Zhang Yu Mao Zhendong Niu School of Computer Science and Technology Beijing Institute of Technology Beijing China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou China School of Computing and Information University of Pittsburgh Pittsburgh PA USA

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

Evaluating the performance of meteorological service not only relies on physical measurements but also requires public feedback. As a significant part of the evaluation, assessing the sentiment of these feedbacks gives an insightful view which can help to establish reliable decision support in policy making and emergency responding. However, climate and weather are always accompanying phenomena in the evolutionary process of human beings, making the climate and weather-related words themselves contain a large number of extend meanings in people's daily expression. These polysemy phenomena have led to a decline in the performance of traditional general sentiment calculations in the vertical field of meteorology. As far as we know, there is no Chinese sentiment calculation tool in the meteorological field, due to the different expressions between different languages. Facing with the above problems and issues, this paper proposes and establishes a sentiment analysis based on lexicon-based framework of Chinese text in the meteorological field. The framework fuses two major sentiment assessment method consists of two approaches, namely machine learning-based and knowledge based one. First, word embedding similarity and word co-occurrence methods are utilized to construct the domain sentiment dictionary which includes 8,796 negative words and 4,751 positive words. Then, by using the extend sentiment dictionary to select theme words from original text as feature, machine learning models are introduced to assess the sentiment tendency. Experiment showed that the performance of the proposed framework was improved up to 85.79% in terms of overall accuracy compared with traditional methods.

关键词： Dictionaries Meteorology Sentiment analysis Feature extraction Machine learning Vocabulary Semantics

来源：评论

学校读者我要写书评

暂无评论

AGNN: Alternating Graph-Regularized Neural networks to Alleviate Over-Smoothing

arXiv

引用

arXiv 2023年

作者： Chen, Zhaoliang Wu, Zhihao Lin, Zhenghong Wang, Shiping Plant, Claudia Guo, Wenzhong The College of Computer and Data Science Fuzhou University Fuzhou350116 China The Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China The Faculty of Computer Science Austria The research network Data Science @ Uni Vienna University of Vienna Vienna1090 Austria

Graph Convolutional network (GCN) with the powerful capacity to explore graph-structural data has gained noticeable success in recent years. Nonetheless, most of the existing GCN-based models suffer from the notorious over-smoothing issue, owing to which shallow networks are extensively adopted. This may be problematic for complex graph datasets because a deeper GCN should be beneficial to propagating information across remote neighbors. Recent works have devoted effort to addressing over-smoothing problems, including establishing residual connection structure or fusing predictions from multi-layer models. Because of the indistinguishable embeddings from deep layers, it is reasonable to generate more reliable predictions before conducting the combination of outputs from various layers. In light of this, we propose an Alternating Graph-regularized Neural network (AGNN) composed of Graph Convolutional Layer (GCL) and Graph Embedding Layer (GEL). GEL is derived from the graph-regularized optimization containing Laplacian embedding term, which can alleviate the over-smoothing problem by periodic projection from the low-order feature space onto the high-order space. With more distinguishable features of distinct layers, an improved Adaboost strategy is utilized to aggregate outputs from each layer, which explores integrated embeddings of multi-hop neighbors. The proposed model is evaluated via a large number of experiments including performance comparison with some multi-layer or multi-order graph neural networks, which reveals the superior performance improvement of AGNN compared with state-of-the-art models. Copyright © 2023, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Image Segmentation Using Fuzzy C-means Optimized by Ant Lion Optimization

Image Segmentation Using Fuzzy C-means Optimized by Ant Lion...

引用

IEEE International Conference on intelligent Data Acquisition and Advanced computing Systems

作者： Can Jin Zhiwei Ye Lingyu Yan Ye Cao Aixin Zhang Lie Ma Xiang Hu Jiwei Hu School of Computer Science Hubei University of Technology Wuhan China Fujian Provincial Key Laboratory of Data Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University Wuhan Jingzhi Technology Co. Ltd. Wuhan China Wuhan FiberHome Technical Services Co. Ltd. Wuhan China

Image segmentation is the indispensable part in the field of computer vision. There are tremendous methods for handling this task such as Otsu-thresholding and Fuzzy C-means (FCM). However, the segmentation results of the images are occasionally unsatisfactory due to the presence of noise. In this paper, two kinds of spatial information consisting of the relative position information and the intensity information of the neighborhood pixels in an image are taken into consideration in constructing the objective function in FCM. Moreover, Ant Lion Optimization, one of the recently proposed optimization algorithms is utilized to optimize the relevant index. Bio-inspired ALO has the robust ability to find optimal parameters in search spaces. So the proposed approach to image segmentation based on Fuzzy C-Means (FCM) and Ant Lion Optimization (ALO) may alleviate this problem to a certain degree. A series of experimental validation has been implemented for demonstrating the performance of the proposed approach in the end of the paper.

关键词： Clustering algorithms Image segmentation Optimization Convergence Linear programming Standards Gaussian noise

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：