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

arXiv 2024年

作者： Fan, Xiaohong Chen, Ke Yi, Huaming Yang, Yin Zhang, Jianping The School of Mathematics and Computational Science Xiangtan University Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan411105 China The Centre for Mathematical Imaging Techniques Department of Mathematical Sciences The University of Liverpool LiverpoolL6972L United Kingdom The School of Mathematics and Computational Science Xiangtan University Hunan National Applied Mathematics Center Xiangtan411105 China The School of Mathematics and Computational Science Xiangtan University Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan411105 China

X-ray Computed Tomography (CT) is one of the most important diagnostic imaging techniques in clinical applications. Sparse-view CT imaging reduces the number of projection views to a lower radiation dose and alleviates the potential risk of radiation exposure. Most existing deep learning (DL) and deep unfolding sparse-view CT reconstruction methods: 1) do not fully use the projection data;2) do not always link their architecture designs to a mathematical theory;3) do not flexibly deal with multi-sparse-view reconstruction assignments. This paper aims to use mathematical ideas and design optimal DL imaging algorithms for sparse-view CT reconstructions. We propose a novel dual-domain unified framework that offers a great deal of flexibility for multi-sparse-view CT reconstruction through a single model. This framework combines the theoretical advantages of model-based methods with the superior reconstruction performance of DL-based methods, resulting in the expected generalizability of DL. We propose a refinement module that utilizes unfolding projection domain to refine full-sparse-view projection errors, as well as an image domain correction module that distills multi-scale geometric error corrections to reconstruct sparse-view CT. This provides us with a new way to explore the potential of projection information and a new perspective on designing network architectures. The multi-scale geometric correction module is end-to-end learnable, and our method could function as a plug-and-play reconstruction technique, adaptable to various applications. Extensive experiments demonstrate that our framework is superior to other existing state-of-the-art methods. Our source codes are available at https://***/fanxiaohong/MVMS-RCN. Copyright © 2024, The Authors. All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Development of Economic Model Predictive Control for Permanent Magnet Synchronous Motor

Development of Economic Model Predictive Control for Permane...

引用

2020 IEEE Sustainable Power and Energy Conference, iSPEC 2020

作者： Chen, Peijie Pan, Tianhong School of Electrical and Information Engineering Jiangsu University Zhenjiang China Key Laboratory of Intelligent Computing and Signal Processing of Minister of Education School of Electrical Engineering and Automation Anhui University Hefei China

ISBN: (纸本)9781728191645

Permanent magnet synchronous motor (PMSM) has gradually become the main driving motor for electric vehicles (EVs). Reducing the electrical loss of PMSM can effectively improve the cruising distance of EVs after a single charge. In order to improve the system operation efficiency, the economic factors of the system are considered, and a drive system for PMSM using the economic model predictive control (EMPC) has been proposed in this paper. Firstly, the mathematical model of PMSM is described, and the electrical loss of the system is investigated. Then, economic performance indicators are embedded into the cost function, and the optimal control law is obtained by solving the optimization problem with constraints. Case studies demonstrate that the proposed EMPC not only improves the dynamic response of the motor, but also reduces the loss of the system. In this way, the system operation efficiency is improved and the purpose of energy saving is achieved. © 2020 IEEE.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

Complete b-symbol weight distribution of some irreducible cyclic codes

arXiv

引用

arXiv 2021年

作者： Zhu, Hongwei Shi, Minjia Özbudak, Ferruh Key Laboratory of Intelligent Computing Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Anhui Hefei230601 China Department of Mathematics Institute of Applied Mathematics Middle East Technical University Ankara Turkey

Recently, b-symbol codes are proposed to protect against b-symbol errors in b-symbol read channels. It is an interesting subject of study to consider the complete b-symbol weight distribution of cyclic codes since b-symbol metric is a generalization for Hamming metric. The complete b-symbol Hamming weight distribution of irreducible codes is known in only a few cases. In this paper, we give a complete b-symbol Hamming weight distribution of a class of irreducible codes with two nonzero b-symbol Hamming weights. © 2021, CC0.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Principled design of translation, scale, and rotation invariant variation operators for metaheuristics

arXiv

引用

arXiv 2021年

作者： Tian, Ye Zhang, Xingyi He, Cheng Tan, Kay Chen Jin, Yaochu Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei230601 China Guangdong Provincial Key Laboratory of Braininspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China Department of Computing The Hong Kong Polytechnic University Hong Kong Department of Computer Science University of Surrey Guildford SurreyGU2 7XH United Kingdom

In the past three decades, a large number of metaheuristics have been proposed and shown high performance in solving complex optimization problems. While most variation operators in existing metaheuristics are empirically designed, this paper aims to design new operators automatically, which are expected to be search space independent and thus exhibit robust performance on different problems. For this purpose, this work first investigates the influence of translation invariance, scale invariance, and rotation invariance on the search behavior and performance of some representative operators. Then, we deduce the generic form of translation, scale, and rotation invariant operators. Afterwards, a principled approach is proposed for the automated design of operators, which searches for highperformance operators based on the deduced generic form. The experimental results demonstrate that the operators generated by the proposed approach outperform state-of-theart ones on a variety of problems with complex landscapes and up to 1000 decision variables. © 2021, CC BY.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Variable Rate Syndrome-Trellis Codes for Steganography on Bursty Channels 19th

Variable Rate Syndrome-Trellis Codes for Steganography on Bu...

引用

19th International Workshop on Digital Forensics and Watermarking, IWDW 2020

作者： Feng, Bingwen Liu, Zhiquan Wei, Kaimin Lu, Wei Lin, Yuchun College of Information Science and Technology Jinan University Guangzhou510632 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Guangdong Key Laboratory of Intelligent Information Processing and Shenzhen Key Laboratory of Media Security Shenzhen518060 China School of Computer Science and Engineering Guangdong Province Key Laboratory of Information Security Technology Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing Sun Yat-sen University Guangzhou510006 China Guangzhou Institute of Science and Technology Guangzhou510006 China

ISBN: (纸本)9783030694487

This paper presents a type of variable rate syndrome-trellis codes (VR-STC) for bursty channels. It can embed message bits with two different embedding rates. In the embedding, a cover vector is sliced into segments, and the embedding rates for each segment depend on the local channel distribution. The parities of stego segments are exploited to indicate the selected embedding rates according to a mapping function between parities and embedding rates. The core of the VR-STC is the parity-aware encoder, which can simultaneously output two candidate stego segments with different embedding rates and opposite parities, either of which can be used to constitute the final stego vector. A Viterbi algorithm is also suggested to find the closed stego segments. Besides, the mapping function between parities and embedding rates is designed by minimizing the embedding costs on a down sampled version of the cover vector. It can further improve the undetectability of the VR-STC. Experimental results on artificial signals and binary images suggest that the proposed VR-STC can provide high success rate of embedding and reduce the embedding cost on bursty channels. © 2021, Springer Nature Switzerland AG.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

Critical Node Detection for Sequential Attacks in Complex Networks via Multi-objective Optimization

Critical Node Detection for Sequential Attacks in Complex Ne...

引用

International Conference on Industrial Artificial Intelligence (IAI)

作者： Lei Zhang Qing Liu Jiajun Xia Haipeng Yang Xingyi Zhang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University China

The following topics are dealt with: learning (artificial intelligence); adaptive control; optimisation; control system synthesis; nonlinear control systems; neural nets; probability; pattern classification; feature e... 详细信息

ISBN: (数字)9781728182162

ISBN: (纸本)9781728182179

关键词： Statistics Sociology Complex networks Search problems Power system protection Power system faults Optimization

来源：评论

学校读者我要写书评

暂无评论

Deep Learning-based Multi-task Network for intelligent Management of Garbage Deposit Points

Deep Learning-based Multi-task Network for Intelligent Manag...

引用

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

作者： Yezhen Wang Haobin Zheng Changjiang Mao Jing Zhang Xiao Ke College of Computer and Data Science Fuzhou University Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou

ISBN: (纸本)9781728194202

With the economic and social development and the substantial improvement of material conditions, the generation of domestic waste has grown rapidly and has become a constraint factor for the development of new urbanization. In the past few years, research on the domestic waste industry has been limited to intelligent waste sorting, neglecting the role of intelligent management of waste storage sites. To relieve it, We propose a deep learning-based multi-task network for intelligent management of garbage deposit points, which combines algorithms such as YoloV5,Deepsort, Insightface, and Openpose to achieve waste bin detection, waste bin status recognition and analysis, face recognition, action recognition, and multiple object tracking based on real-time surveillance video. Besides, we propose a new dataset named Waste Bin Status, which provides a meaningful addition to the existing field of waste bin identification. Experiments on WBS dataset validate that our method is superior to other methods for garbage point status identification. Moreover, our network is trained to work with different scenarios of garbage deposits, demonstrating state-of-the-art performance in real-world tests.

关键词： Industries Face recognition Surveillance Education Streaming media Multitasking Real-time systems

来源：评论

学校读者我要写书评

暂无评论

A GENERAL ALTERNATING-DIRECTION IMPLICIT FRAMEWORK WITH GAUSSIAN PROCESS REGRESSION PARAMETER PREDICTION FOR LARGE SPARSE LINEAR SYSTEMS

arXiv

引用

arXiv 2021年

作者： Jiang, Kai Su, Xuehong Zhang, Juan Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Hunan Key Laboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

This paper proposes an efficient general alternating-direction implicit (GADI) framework for solving large sparse linear systems. The convergence property of the GADI framework is discussed. Most of existing ADI methods can be unified in the developed framework. Meanwhile the GADI framework can derive new ADI methods. Moreover, as the algorithm efficiency is sensitive to the splitting parameters, we offer a data-driven approach, the Gaussian process regression (GPR) method based on the Bayesian inference, to predict the GADI framework’s relatively optimal parameters. The GPR method only requires a small training data set to learn the regression prediction mapping, can predict accurate splitting parameters, and has high generalization capability. It allows us to efficiently solve linear systems with a one-shot computation, and does not require any repeated computations. Finally, we use the three-dimensional convection-diffusion equation, two-dimensional parabolic equation, and continuous Sylvester matrix equation to examine the performance of our proposed methods. Numerical results demonstrate that the proposed framework is faster tens to thousands of times than the existing ADI methods, such as (inexact) Hermitian and skew-Hermitian splitting type methods in which the consumption of obtaining relatively optimal splitting parameters is ignored. As a result, our proposed methods can solve much larger linear systems which these existing ADI methods have not reached. Copyright © 2021, The Authors. All rights reserved.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

A Jacobi Collocation Method for the Fractional Ginzburg-Landau Differential Equation

引用

Advances in Applied Mathematics and Mechanics 2020年第1期12卷 57-86页

作者： Yin Yang Jianyong Tao Shangyou Zhang Petr V.Sivtsev Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing&Information Processing of Ministry of EducationSchool of Mathematics and Computational ScienceXiangtan UniversityXiangtanHunan 411105China Department of Mathematical Sciences University of DelawareNewarkDE 19716USA International Scientific and Research Laboratory of Multiscale Model Reduction and High Performance Computing Ammosov North Eastern UniversityKulakovskogo677013YakutskRussia

In this paper,we design a collocation method to solve the fractional Ginzburg-Landau equation.A Jacobi collocation method is developed and implemented in two ***,we space-discretize the equation by the Jacobi-Gauss-Lobatto collocation(JGLC)method in one-and two-dimensional *** equation is then converted to a system of ordinary differential equations(ODEs)with the time variable based on *** second step applies the Jacobi-Gauss-Radau collocation(JGRC)method for the time ***,we give a theoretical proof of convergence of this Jacobi collocation method and some numerical results showing the proposed scheme is an effective and high-precision algorithm.

关键词： The fractional Ginzburg-Landau equation Jacobi collocation method convergence

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-Based Multi-Cloud Storage Data Consistency Verification Scheme

A Blockchain-Based Multi-Cloud Storage Data Consistency Veri...

引用

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

作者： Feiyu Wang Jian-tao Zhou Hao Wang Xu Guo College of Computer Science Inner Mongolia University Hohhot China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China

Users worldwide widely use cloud storage because of its efficiency, convenience, and high availability. Multi-cloud storage is usually selected to ensure the high availability of data. Unfortunately, when data is migrated and replicated between multi-cloud data centers, it is not easy to guarantee data con-sistency. This paper proposes an efficient, secure, and new data consistency verification scheme using blockchain technology. In order to reduce the computation and communication overhead in the verification process, our scheme uses encrypted tags to build Merkle hash tree to generate unique and lightweight verification proofs and does not use third-party auditors. The final theoretical and experimental analysis shows that our scheme has higher security and a faster verification process in multi-cloud storage.

关键词： Cloud computing Data centers Costs Blockchains Behavioral sciences

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：