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

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

学校读者我要写书评

暂无评论

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

学校读者我要写书评

暂无评论

14th International Conference on Bio-inspired computing: Theories and Applications, BIC-TA 2019

作者： Sun, Dengdi Sun, Haifeng Wu, Hang Liang, Huadong Ding, Zhuanlian Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei230601 China iFlytek Co. Ltd. Hefei230088 China School of Internet Anhui University Hefei230039 China

ISBN: (纸本)9789811534140

Determining the functional roles of proteins is a vital task to understand life at molecular level and has great biomedical and pharmaceutical implications. With the development of novel high-throughput techniques, enormous amounts of protein-protein interaction (PPI) data are collected and provide an important and feasible way for studying protein function predictions. According to this, many approaches assign biological functions to all proteins using PPI networks directly. However, due to the extreme complexity of the topology structure of real PPI networks, it is very difficult and time consuming to seek the global optimization or clustering on the networks. In addition, biological functions are often highly correlated, which makes functions assigned to proteins are not independent. To address these challenges, in this paper we propose a two-stage function annotation method with robust feature selection. First, we transform the network into the low-dimensional representations of nodes via manifold learning. Then, we integrate the functional correlation into the framework of multi-label linear regression, and introduce robust sparse penalty to achieve the function assignment and representative feature selection simultaneously. For the optimization, we design an efficient algorithm to iteratively solve several subproblems with closed-form solutions. Extensive experiments against other baseline methods on Saccharomyces cerevisiae data demonstrate the effectiveness of the proposed approach. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Proteins

Disentangled Generation Network for Enlarged License Plate Recognition and A Unified Dataset

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Chenglong Yang, Xiaobin Wang, Guohao Zheng, Aihua Tan, Chang Jia, Ruoran Tang, Jin Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Artificial Intelligence Anhui University Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Key Lab of Intelligent Computing and Signal Processing Ministry of Education Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China iFLYTEK Co. Ltd. Hefei230088 China

License plate recognition plays a critical role in many practical applications, but license plates of large vehicles are difficult to be recognized due to the factors of low resolution, contamination, low illumination, and occlusion, to name a few. To overcome the above factors, the transportation management department generally introduces the enlarged license plate behind the rear of a vehicle. However, enlarged license plates have high diversity as they are non-standard in position, size, and style. Furthermore, the background regions contain a variety of noisy information which greatly disturbs the recognition of license plate characters. Existing works have not studied this challenging problem. In this work, we first address the enlarged license plate recognition problem and contribute a dataset containing 9342 images, which cover most of the challenges of real scenes. However, the created data are still insufficient to train deep methods of enlarged license plate recognition, and building large-scale training data is very time-consuming and high labor cost. To handle this problem, we propose a novel task-level disentanglement generation framework based on the Disentangled Generation Network (DGNet), which disentangles the generation into the text generation and background generation in an end-to-end manner to effectively ensure diversity and integrity, for robust enlarged license plate recognition. Extensive experiments on the created dataset are conducted, and we demonstrate the effectiveness of the proposed approach in three representative text recognition frameworks. © 2022, CC BY.

关键词： Optical character recognition

Designs, permutations, and transitive groups

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Shi, Minjia Li, XiaoXiao Solé, Patrick Key Laboratory of Intelligent Computing & Signal Processing of Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China I2M Aix-Marseille Univ. Centrale Marseille CNRS Marseille France

A notion of t-designs in the symmetric group on n letters, called permutation designs in this paper, was introduced by Godsil in 1988. In particular t-transitive sets of permutations form a t-design in that sense. We derive special lower bounds for t = 1 and t = 2 by a power moment method. For general n, t we give a a lower bound on the size of such t-designs of n(n − 1) . . . (n − t + 1), which is best possible when sharply t-transitive sets of permutations exist. This shows, in particular, that tight 2-designs do not *** Codes Primary 05E35, Secondary O5E20, 05E24 © 2021, CC BY.

关键词： Method of moments

On the structure of 1-generator quasi-polycyclic codes over finite chain rings

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wu, Rongsheng Shi, Minjia Solé, Patrick Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China Lab I2M CNRS Aix-Marseille University Centrale Marseille Marseille France

Quasi-polycyclic (QP for short) codes over a finite chain ring R are a generalization of quasi-cyclic codes, and these codes can be viewed as an R[x]-submodule of Rm, where Rm := R[x]/hfi, and f is a monic polynomial of degree m over R. If f factors uniquely into monic and coprime basic irreducibles, then their algebraic structure allow us to characterize the generator polynomials and the minimal generating sets of 1-generator QP codes as R-modules. In addition, we also determine the parity check polynomials for these codes by using the strong Gröbner bases. In particular, via Magma system, some quaternary codes with new parameters are derived from these 1-generator QP codes. © 2021, CC0.

关键词： Polynomials

Attention-Guided Generative Adversarial Network for Whisper to Normal Speech Conversion

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Gao, Teng Zhou, Jian Wang, Huabin Tao, Liang Kwan, Hon Keung Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230601 China Department of Electrical and Computer Engineering University of Windsor WindsorONN9B 3P4 Canada

Whispered speech is a special way of pronunciation without using vocal cord vibration. A whispered speech does not contain a fundamental frequency, and its energy is about 20dB lower than that of a normal speech. Converting a whispered speech into a normal speech can improve speech quality and intelligibility. In this paper, a novel attention-guided generative adversarial network model incorporating an autoencoder, a Siamese neural network, and an identity mapping loss function for whisper to normal speech conversion (AGANW2SC) is proposed. The proposed method avoids the challenge of estimating the fundamental frequency of the normal voiced speech converted from a whispered speech. Specifically, the proposed model is more amendable to practical applications because it does not need to align speech features for training. Experimental results demonstrate that the proposed AGANW2SC can obtain improved speech quality and intelligibility compared with dynamic-time-warping-based methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Generative adversarial networks

CycleGAN with dual adversarial loss for bone-conducted speech enhancement

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Pan, Qing Gao, Teng Zhou, Jian Wang, Huabin Tao, Liang Kwan, Hon Keung Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei230601 China Department of Electrical and Computer Engineering University of Windsor WindsorONN9B 3P4 Canada

Compared with air-conducted speech, bone-conducted speech has the unique advantage of shielding background noise. Enhancement of bone-conducted speech helps to improve its quality and intelligibility. In this paper, a novel CycleGAN with dual adversarial loss (CycleGAN-DAL) is proposed for bone-conducted speech enhancement. The proposed method uses an adversarial loss and a cycle-consistent loss simultaneously to learn forward and cyclic mapping, in which the adversarial loss is replaced with the classification adversarial loss and the defect adversarial loss to consolidate the forward mapping. Compared with conventional baseline methods, it can learn feature mapping between bone-conducted speech and target speech without additional air-conducted speech assistance. Moreover, the proposed method also avoids the over-smooth problem which is occurred commonly in conventional statistical based models. Experimental results show that the proposed method outperforms baseline methods such as CycleGAN, GMM, and BLSTM. © 2021, CC BY.

关键词： Speech enhancement

A Recommender System for Metaheuristic Algorithms for Continuous Optimization Based on Deep Recurrent Neural Networks

学校读者我要写书评

暂无评论

IEEE Transactions on Artificial Intelligence

IEEE Transactions on Artificial Intelligence 2020年第1期1卷 5-18页

作者： Tian, Ye Peng, Shichen Zhang, Xingyi Rodemann, Tobias 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 Hefei 230601 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230601 China Honda Research Institute Europe Offenbach 63073 Germany Department of Computer Science City University of Hong Kong Kowloon Tong Hong Kong Hong Kong Department of Computer Science University of Surrey Guildford GU2 7XH United Kingdom Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang 110819 China

As revealed by the no free lunch theorem, no single algorithm can outperform any others on all classes of optimization problems. To tackle this issue, methods for recommending an existing algorithm for solving given problems have been proposed. However, existing recommendation methods for continuous optimization suffer from low practicability and transferability, mainly due to the difficulty in extracting features that can effectively describe the problem structure and lack of data for training a recommendation model. This work proposes a generic recommender system to address the above two challenges. First, a novel method is proposed to represent an analytic objective function of a continuous optimization problem as a tree, which is directly used as the features of the problem. For black-box optimization problems whose objective function is unknown, a symbolic regressor is adopted to estimate the tree structure. Second, a large number of benchmark problems are randomly created based on the proposed tree representation, providing an abundant amount of training data with various levels of difficulty. By employing a deep recurrent neural network, a recommendation model is trained to recommend a most suitable metaheuristic algorithm for white- or black-box optimization, making a significant step forward towards fully automated algorithm recommendation for continuous optimization. Experimental results on 100 000 benchmark problems show that the proposed recommendation model achieves considerably better performance than existing ones, and exhibits high transferability to real-world problems. Impact Statement—Real-world optimization problems, such as aerodynamic design of turbine engines and automated trading, have been successfully solved by metaheuristics. However, practitioners are confronted with the challenge of how to choose an appropriate metaheuristic algorithm to solve a particular instance of these problems. This paper proposes a recommender system that can auto

关键词： Algorithm recommendation continuous optimization problem decision tree deep recurrent neural network metaheuristics symbolic regression

intelligent ultrasonic distance measurer system with temperature compensation algorithm

学校读者我要写书评

暂无评论

Intelligent ultrasonic distance measurer system with tempera...

International Applied Computational Electromagnetics Society Symposium (ACES)

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

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.

关键词： Temperature measurement Performance evaluation Temperature distribution Laser radar Ultrasonic variables measurement Current measurement Measurement uncertainty