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

1st EAI International Conference on Computer Science and Engineering, COMPSE 2016

作者： Gui, Yan Liu, Yang Li, Feng Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha Hunan410114 China

ISBN: (纸本)9781631901362

The texture synthesis and design starts with an initial elements arrangement and expands it outward by using local and global growth, to obtain the new larger distribution of texture elements. There are two types of synthesized distributions, and their diversity consists in changing the layout of texture elements and decreasing or increasing the number of texture elements according to user's creation. Furthermore, we apply a set of deformation operations to locally change the shapes of texture elements when placing the extracted texture elements into the synthesized distribution, in order to guarantee structure consistency in final synthesized textures. Experimental results show that our method creates a large variety of textures from a given texture sample.

关键词： Computer graphics

来源：评论

学校读者我要写书评

暂无评论

On the parameterized complexity of minimum/maximum degree vertex deletion on several special graphs

引用

Frontiers of Computer Science 2023年第4期17卷 97-107页

作者： Jia LI Wenjun LI Yongjie YANG Xueying YANG School of Information Engineering Hunan Industry PolytechnicChangsha 410036China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication EngineeringChangsha University of Science and TechnologyChangsha 410015China Chair of Economic Theory Saarland UniversitySaarbrücken 66123Germany

In the minimum degree vertex deletion problem,we are given a graph,a distinguished vertex in the graph,and an integer κ,and the question is whether we can delete at most κ vertices from the graph so that the distinguished vertex has the unique minimum *** maximum degree vertex deletion problem is defined analogously but here we want the distinguished vertex to have the unique maximum *** is known that both problems areΨ-hard and fixed-parameter intractable with respect to some natural *** this paper,we study the(parameterized)complexity of these two problems restricted to split graphs,p-degenerate graphs,and planar *** study provides a comprehensive complexity landscape of the two problems restricted to these special graphs.

关键词： minimum degree maximum degree vertex deletion split graphs planar graphs parameterized complexity

来源：评论

学校读者我要写书评

暂无评论

Parameters Compressing in Deep Learning

引用

Computers, Materials & Continua 2020年第1期62卷 321-336页

作者： Shiming He Zhuozhou Li Yangning Tang Zhuofan Liao Feng Li Se-Jung Lim School of Computer and Communication Engineering Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on TransportationChangsha University of Science and TechnologyChangsha410114China Liberal Arts&Convergence Studies Honam UniversityGwangju62399Korea

With the popularity of deep learning tools in image decomposition and natural language processing,how to support and store a large number of parameters required by deep learning algorithms has become an urgent problem to be *** parameters are huge and can be as many as *** present,a feasible direction is to use the sparse representation technique to compress the parameter matrix to achieve the purpose of reducing parameters and reducing the storage *** methods include matrix decomposition and tensor *** let vector take advance of the compressing performance of matrix decomposition and tensor decomposition,we use reshaping and unfolding to let vector be the input and output of Tensor-Factorized Neural *** analyze how reshaping can get the best compress *** to the relationship between the shape of tensor and the number of parameters,we get a lower bound of the number of *** take some data sets to verify the lower bound.

关键词： Deep neural network parameters compressing matrix decomposition tensor decomposition

来源：评论

学校读者我要写书评

暂无评论

An improved branching algorithm for the proper interval edge deletion problem

引用

Frontiers of Computer Science 2022年第2期16卷 178-180页

作者： Wenjun LI Xiaojing TANG Yongjie YANG School of Computer and Communication Engineering Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on TransportationChangsha University of Science and TechnologyChangsha 410015China School of Computer Science and Engineering Central South UniversityChangsha 410083China

1 Introduction For a graph class G,the G-EDGE DELETION problem is to determine whether a given graph can be transformed into a graph in G by deleting at most k *** G-EDGE DELETION problem for a large body of graph cla... 详细信息

关键词： branching problem transformed

来源：评论

学校读者我要写书评

暂无评论

Fast Multivariate Time Series Anomaly Detection Based on Matrix Completion

Fast Multivariate Time Series Anomaly Detection Based on Mat...

引用

2023 International Conference on Frontiers of Robotics and Software Engineering, FRSE 2023

作者： He, Shiming Yi, Tongzhijian Yang, Bo Guo, Chenxi Changsha University of Science & Technology School of Computer and Communication Engineering The Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha China

ISBN: (纸本)9798350301113

Increasingly complex systems contain large numbers of devices that generate great number of multivariate time series that are monitored and recorded. For anomaly detection of these complex time series, deep learning technology is often used to build a learning model for anomaly detection. The method based on deep learning usually takes a long time to train data in practice, and the online service system is deployed or changed very frequently, which makes the online service system need to frequently spend a lot of time updating the anomaly detection model. To overcome this challenge, this paper proposes a fast multivariate time series anomaly detection (FMAD) approach based on matrix completion. After sampling the primitive low-rank matrix, FMAD uses matrix completion to reconstruct the original low-rank matrix to detect anomalies in multivariate time series. We conducted related experimental analysis and discussion. The experimental results on three real data sets show that FMAD has improved the problem of too long model training time and improved the detection efficiency. © 2023 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

LogADCH: Hyperspheric-Based Log Message Anomaly Detection And Classification

LogADCH: Hyperspheric-Based Log Message Anomaly Detection An...

引用

2023 International Conference on Frontiers of Robotics and Software Engineering, FRSE 2023

作者： He, Shiming Xiao, Jinpan Chen, Bowen Lei, Ying Changsha University of Science & Technology School of Computer and Communication Engineering The Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha China

ISBN: (纸本)9798350301113

Web services have been integrated with all walks of life in society. Abnormalities in the network and services seriously affect user experience and company revenue. The system log records various information of the system, and the information-rich log messages usually show different anomalies. It is particularly important to accurately and timely identify the anomalies of the log messages and classify the anomalies. In addition, most of the current existing work only detects anomalies and does not classify them, and a few existing works require anomaly labels to classify anomalies. Based on these potential challenges, we propose an unsupervised hypersphere-based log message anomaly detection and classification method, LogADCH. We use the hypersphere loss function to let the BERT model learn compact representations of log messages and perform anomaly detection. Finally, K-Means clustering is performed on the semantic feature vectors detected as anomalies to form clusters of different types of anomalies. Compared with other works, LogADCH further classifies the abnormal types after detecting the abnormal logs, helping the operation and maintenance personnel to quickly locate the fault. We compare our method with other methods on two public datasets, and the experimental results show that LogADCH has superior performance in anomaly detection as well as anomaly classification. © 2023 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Instant Edit Propagation on Images Based on Bilateral Grid

引用

Computers, Materials & Continua 2019年第8期61卷 643-656页

作者： Feng Li Chaofeng Ou Yan Gui Lingyun Xiang Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and TechnologyChangsha410114China School of Computer and Communication Engineering Changsha University of Science and TechnologyChangsha410114China School of Mechanical and Aerospace Engineering Nanyang Technological UniversitySingapore639798Singapore

The ability to quickly and intuitively edit digital content has become increasingly important in our everyday ***,existing edit propagation methods for editing digital images are typically based on optimization with high computational cost for large ***,existing edit propagation methods are generally inefficient and highly ***,to improve edit efficiency,this paper proposes a novel edit propagation method using a bilateral grid,which can achieve instant propagation of sparse image ***,given an input image with user interactions,we resample each of its pixels into a regularly sampled bilateral grid,which facilitates efficient mapping from an image to the bilateral *** a result,all pixels with the same feature information(color,coordinates)are clustered to the same grid,which can achieve the goal of reducing both the amount of image data processing and the cost of *** then reformulate the propagation as a function of the interpolation problem in bilateral space,which is solved very efficiently using radial basis *** results show that our method improves the efficiency of color editing,making it faster than existing edit approaches,and results in excellent edited images with high quality.

关键词： Instant edit propagation bilateral grid radial basis function image editing

来源：评论

学校读者我要写书评

暂无评论

Traceable certificateless ring signature scheme for no full anonymous applications

引用

International Journal of Network Security 2018年第4期20卷 762-773页

作者： Gu, Ke Wang, LinYu Wu, Na Liao, NianDong School of Computer and Communication Engineering Changsha University of Science and Technology Wangjiali Rd Tianxin district Changsha Hunan Province410114 China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology China

With the rapid development of identity-based cryptography, several traceable (or linkable) identity-based ring signature (TIBRS) schemes have been proposed. Compared with ring signature based on public key cryptography, TIBRS can simplify public key management and be used for more applications. However, identity-based cryptography still has the problem of private key management and few traceable ring signature schemes are constructed in the standard model. In this paper, we present a fully traceable certificateless ring signature (TCRS) scheme in the standard model, which has a security reduction to the computational Diffie-Hellman (CDH) assumption. © 2018, Femto Technique Co., Ltd.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

DSAFF-Net:A Backbone Network Based on Mask R-CNN for Small Object Detection

引用

Computers, Materials & Continua 2023年第2期74卷 3405-3419页

作者： Jian Peng Yifang Zhao Dengyong Zhang Feng Li Arun Kumar Sangaiah Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and TechnologyChangsha410114China School of Computer and Communication Engineering Changsha University of Science and TechnologyChangsha410114China School of Computing Science and Engineering Vellore Institute of Technology(VIT)Vellore632014India

Recently,object detection based on convolutional neural networks(CNNs)has developed *** backbone networks for basic feature extraction are an important component of the whole detection ***,we present a new feature extraction strategy in this paper,which name is *** this strategy,we design:1)a sandwich attention feature fusion module(SAFF module).Its purpose is to enhance the semantic information of shallow features and resolution of deep features,which is beneficial to small object detection after feature fusion.2)to add a new stage called D-block to alleviate the disadvantages of decreasing spatial resolution when the pooling layer increases the receptive *** method proposed in the new stage replaces the original method of obtaining the P6 feature map and uses the result as the input of the regional proposal network(RPN).In the experimental phase,we use the new strategy to extract *** experiment takes the public dataset of Microsoft Common Objects in Context(MS COCO)object detection and the dataset of Corona Virus Disease 2019(COVID-19)image classification as the experimental object *** results show that the average recognition accuracy of COVID-19 in the classification dataset is improved to 98.163%,and small object detection in object detection tasks is improved by 4.0%.

关键词： Small object detection classification RPN MS COCO COVID-19

来源：评论

学校读者我要写书评

暂无评论

Improved VGG Model for Road Traffic Sign Recognition

引用

Computers, Materials & Continua 2018年第10期57卷 11-24页

作者： Shuren Zhou Wenlong Liang Junguo Li Jeong-Uk Kim Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science&TechnologyChangsha410114China School of Computer&Communication Engineering Changsha University of Science&TechnologyChangsha410114China Department of Energy Grid Sangmyung UniversitySeoul110743Korea

Road traffic sign recognition is an important task in intelligent transportation *** neural networks(CNNs)have achieved a breakthrough in computer vision tasks and made great success in traffic sign *** this paper,it presents a road traffic sign recognition algorithm based on a convolutional neural *** natural scenes,traffic signs are disturbed by factors such as illumination,occlusion,missing and deformation,and the accuracy of recognition decreases,this paper proposes a model called Improved VGG(IVGG)inspired by VGG *** IVGG model includes 9 layers,compared with the original VGG model,it is added max-pooling operation and dropout operation after multiple convolutional layers,to catch the main features and save the training *** paper proposes the method which adds dropout and Batch Normalization(BN)operations after each fully-connected layer,to further accelerate the model convergence,and then it can get better classification *** uses the German Traffic Sign Recognition Benchmark(GTSRB)dataset in the *** IVGG model enhances the recognition rate of traffic signs and robustness by using the data augmentation and transfer learning,and the spent time is also reduced greatly.

关键词： intelligent transportation traffic sign deep learning GTSRB data augmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：