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

arXiv 2020年

作者： Rong, Guozhen Li, Wenjun Wang, Jianxin Yang, Yongjie School of Computer Science and Engineering Central South University Changsha China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha China Faculty of Human and Business Sciences Saarland University Saarbrücken Germany

In 1990, Hendry conjectured that all Hamiltonian chordal graphs are cycle extendable. After a series of papers confirming the conjecture for a number of graph classes, the conjecture is yet refuted by Lafond and Seamone in 2015. Given that their counterexamples are not strongly chordal graphs and they are all only 2-connected, Lafond and Seamone asked the following two questions: (1) Are Hamiltonian strongly chordal graphs cycle extendable? (2) Is there an integer k such that all k-connected Hamiltonian chordal graphs are cycle extendable? Later, a conjecture stronger than Hendry’s is proposed. In this paper, we resolve all these questions in the negative. On the positive side, we add to the list of cycle extendable graphs two more graph classes, namely, Hamiltonian 4-FAN-free chordal graphs where every induced K5 − e has true twins, and Hamiltonian {4-FAN, A}-free chordal graphs. Copyright © 2020, The Authors. All rights reserved.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

Neural Network Panning: Screening the Optimal Sparse Network Before Training

arXiv

引用

arXiv 2022年

作者： Kang, Xiatao Li, Ping Yao, Jiayi Li, Chengxi School of Computer and Communication Engineering Changsha University of Science and Technology China School of Computer Xidian University China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transp China

Pruning on neural networks before training not only compresses the original models, but also accelerates the network training phase, which has substantial application value. The current work focuses on fine-grained pruning, which uses metrics to calculate weight scores for weight screening, and extends from the initial single-order pruning to iterative pruning. Through these works, we argue that network pruning can be summarized as an expressive force transfer process of weights, where the reserved weights will take on the expressive force from the removed ones for the purpose of maintaining the performance of original networks. In order to achieve optimal expressive force scheduling, we propose a pruning scheme before training called Neural Network Panning which guides expressive force transfer through multi-index and multi-process steps, and designs a kind of panning agent based on reinforcement learning to automate processes. Experimental results show that Panning performs better than various available pruning before training methods. Our code is made public at: https://***/kangxiatao/RLPanning. Copyright © 2022, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Spatial and Contextual Path Network for Image Inpainting

引用

intelligent Automation & Soft Computing 2024年第2期39卷 115-133页

作者： Dengyong Zhang Yuting Zhao 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 International Graduate Institute of AI National Yunlin University of Science and TechnologyYunlinTaiwan Department of Electrical and Computer Engineering Lebanese American UniversityByblosLebanon

Image inpainting is a kind of use known area of information technology to repair the loss or damage to the *** feature extraction is the core of image *** enough space for information and a larger receptive field is very important to realize high-precision image ***,in the process of feature extraction,it is difficult to meet the two requirements of obtaining sufficient spatial information and large receptive fields at the same *** order to obtain more spatial information and a larger receptive field at the same time,we put forward a kind of image restoration based on space path and context path *** the space path,we stack three convolution layers for 1/8 of the figure,the figure retained the rich spatial *** the context path,we use the global average pooling layer,where the accept field is the maximum of the backbone network,and the pooling module can provide global context information for the maximum accept *** order to better integrate the features extracted from the spatial and contextual paths,we study the fusion module of the two *** fusionmodule first path output of the space and context path,and then through themass normalization to balance the scale of the characteristics,finally the characteristics of the pool will be connected into a feature vector and calculate the weight *** of images in order to extract context information,we add attention to the context path refinement *** modules respectively from channel dimension and space dimension to weighted images,in order to obtain more effective *** show that our method is better than the existing technology in the quality and quantity of themethod,and further to expand our network to other inpainting networks,in order to achieve consistent performance improvements.

关键词： Image inpainting attention deep learning convolutional network

来源：评论

学校读者我要写书评

暂无评论

Multi-Scale Noise-Guided Progressive Network for Image Splicing Detection and Localization

SSRN

引用

SSRN 2024年

作者： Zhang, Dengyong Jiang, Ningjing Li, Feng Chen, Jiaxin Liao, Xin Yang, Gaobo Ding, Xiangling Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha410114 China School of Computer and Communication Engineering Changsha University of Science and Technology Changsha410114 China College of Computer Science and Electronic Engineering Hunan University Changsha410082 China School of Computer and Communication Engineering Hunan University of Science and Technology Hunan Xiangtan411201 China

Image splicing can easily be used in illegal activities, which may have negative impact on society. Therefore, detecting splicing images and precisely localizing tampered regions are challenging tasks. In this work, we propose a dual-branch Multi-Scale Noise-Guided Progressive Network (MSNP-Net). The multi-resolution branch extracts deep semantic features of images while suppressing redundant noise. A multi-scale noise-guided branch is designed to capture more subtle tampering artifacts and guide the network to strengthen the learning of spatial structure features. The two branches complement and restrict each other. The features of different scales are fused in a gradual mechanism, and the feature expression is aggregated through the spatial channel feature aggregation module (SCAM). A large number of experiments show that the MSNP-Net proposed in this paper has better completeness and lower false alarm rate for the detection and localization of spliced images. It can achieve more refined detection results, and has good stability and robustness. Significantly outperforms other state-of-the-art methods. © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Feature Selection Based on Consistent Granulation

SSRN

引用

SSRN 2024年

作者： Yang, Tian Shen, Shuo Deng, Jinsheng Liang, Jie Qian, Yuhua Dai, Jianhua Hunan Provincial Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Hunan Changsha410081 China College of Advanced Interdisciplinary Studies National University of Defense Technology Changsha410073 China Institute of Big Data Science and Industry Shanxi university Shanxi Taiyuan030006 China

Classifying large-scale data is a challenging task in machine learning. Feature selection and feature construction can improve the classification performances of classifiers. However, existing feature selections struggle to handle large-scale data. Granulation is the key process for generating accurate and efficient models. In this paper, we propose a novel granulation approach based on rough sets, consistent granulation, and a novel feature construction based on consistent granulation to improve the computation speed, scale, and classification performance of feature selection. As a result, the time and space complexities are reduced to a linear level in terms of sample scales. Moreover, consistent granulation can precisely represent the topological structure of the data and reduce the parameter space from [0, 1] to a finite set lowering the difficulty of optimal parameter searching. Experiments show that the proposed algorithm, FCG, outperforms four classical feature selection algorithms in handling datasets with millions of samples or tens of thousands of dimensions. Additionally, on the first thirteen datasets, FCG reduces the average runtime by 1145.68 times (NARNeMF), 883.11 times (HANDI), 1333.10 times (GBNRS), and 3.73 times (RMDPS), while increasing the average classification accuracy by 2.73% (FARNeMF), 2.30% (HANDI), 4.61% (GBNRS) and 14.33% (RMDPS) compared to these methods. © 2024, The Authors. All rights reserved.

关键词： Granulation

来源：评论

学校读者我要写书评

暂无评论

The Novel Sensor Network Structure for Classification processing Based on the Machine Learning Method of the ACGAN

引用

Sensors (Switzerland) 2019年第14期19卷 3145页

作者： Chen, Yuantao Tao, Jiajun Wang, Jin Chen, Xi Yang, Kai School of Computer and Communication Engineering & Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportatio Changsha University of Science and Technology Changsha410114 China School of Information Science and Engineering Fujian University of Technology Fuzhou350118 China Hunan Institute of Scientific and Technical Information Changsha410001 China Electronics & Information School Yangtze University Jingzhou434023 China Technical Quality Department Hunan ZOOMLION Heavy Industry Intelligent Technology Corporation Limited Changsha410005 China

To address the problem of unstable training and poor accuracy in image classification algorithms based on generative adversarial networks (GAN), a novel sensor network structure for classification processing using auxiliary classifier generative adversarial networks (ACGAN) is proposed in this paper. Firstly, the real/fake discrimination of sensor samples in the network has been canceled at the output layer of the discriminative network and only the posterior probability estimation of the sample tag is outputted. Secondly, by regarding the real sensor samples as supervised data and the generative sensor samples as labeled fake data, we have reconstructed the loss function of the generator and discriminator by using the real/fake attributes of sensor samples and the cross-entropy loss function of the label. Thirdly, the pooling and caching method has been introduced into the discriminator to enable more ekective extraction of the classification features. Finally, feature matching has been added to the discriminative network to ensure the diversity of the generative sensor samples. Experimental results have shown that the proposed algorithm (CP-ACGAN) achieves better classification accuracy on the MNIST dataset, CIFAR10 dataset and CIFAR100 dataset than other solutions. Moreover, when compared with the ACGAN and CNN classification algorithms, which have the same deep network structure as CP-ACGAN, the proposed method continues to achieve better classification effects and stability than other main existing sensor solutions. © Sensors (Switzerland) 2019. All Rights Reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

MultiAdapt: A Neural Network Adaptation For Pruning Filters Base on Multi-layers Group

引用

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

作者： Jie Yang Zhihong Xie Ping Li School of Computer and Communication Engineering Changsha University of Science and Technology Changsha Hunan Changsha 410114 China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha Hunan Changsha 410114 China

Deep convolutional neural networks have been widely used in various AI applications. The most advanced neural networks are becoming deeper and wider, which has caused some large convolutional neural networks to exceed the size limit of the server or application. The pruning algorithm provides a way to reduce the size of the neural network while keeping the accuracy as high as possible. The automatic progressive pruning algorithm is one of the widely used pruning algorithms. The progressive pruning algorithm prunes a certain layer of the network in each iteration to reduce the sparsity while preserving the accuracy as much as possible. In this article, we design a new automatic progressive pruning algorithm named MultiAdapt. MultiAdapt combines the combination method and the greedy algorithm. This multi-layers progressive pruning method greatly increases the search space of the greedy algorithm, making it possible to obtain a better pruning network. We use MultiAdapt to prune large neural networks VGG-16 and ResNet. The experimental results show that the MultiAdapt algorithm is better than other mainstream methods in the balance of neural network model size and accuracy. For image classification tasks on the ImageNet dataset, our method achieved 88.72% and 90.55% TOP-5 accuracy on the 50% sparsity VGG-16 and ResNet, while obtaining nearly 2×reduction in parameters and floating point numbers. The operation is reduced, and the reduction is higher than the recent popular method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Trajectory data privacy protection based on differential privacy mechanism

引用

IOP Conference Series: Materials Science and Engineering 2018年第1期351卷

作者： Ke Gu Lihao Yang Yongzhi Liu Niandong Liao School of Computer and Communication Engineering Changsha University of Science and Technology Changsha 410114 China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha 410114 China

In this paper, we propose a trajectory data privacy protection scheme based on differential privacy mechanism. In the proposed scheme, the algorithm first selects the protected points from the user's trajectory data; secondly, the algorithm forms the polygon according to the protected points and the adjacent and high frequent accessed points that are selected from the accessing point database, then the algorithm calculates the polygon centroids; finally, the noises are added to the polygon centroids by the differential privacy method, and the polygon centroids replace the protected points, and then the algorithm constructs and issues the new trajectory data. The experiments show that the running time of the proposed algorithms is fast, the privacy protection of the scheme is effective and the data usability of the scheme is higher.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Analysis of SET pulses propagation probabilities in sequential circuits

引用

IOP Conference Series: Materials Science and Engineering 2018年第1期351卷

作者： Shuo Cai Fei Yu Yiqun Yang School of Computer and Communication Engineering Changsha University of Science and Technology Changsha 410114 China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha 410114 China

As the feature size of CMOS transistors scales down, single event transient (SET) has been an important consideration in designing logic circuits. Many researches have been done in analyzing the impact of SET. However, it is difficult to consider numerous factors. We present a new approach for analyzing the SET pulses propagation probabilities (SPPs). It considers all masking effects and uses SET pulses propagation probabilities matrices (SPPMs) to represent the SPPs in current cycle. Based on the matrix union operations, the SPPs in consecutive cycles can be calculated. Experimental results show that our approach is practicable and efficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

Systematic Resource Allocation in Cloud RAN with Caching as ...

引用

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：