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

5th IEEE International Conference on Computational Electromagnetics, ICCEM 2019

作者： Tan, Xiaolong Fang, Ming Huang, Zhixiang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230601 China

ISBN: (纸本)9781538671115

The application of radar absorbing materials on the surface of metal aircraft can effectively reduce the radar cross section (RCS). In this paper, the physical optics (PO) method is used to calculate the RCS of electrically large coated targets. First, we calculate the RCS of the original X29 aircraft and the X29 aircraft coated with a broadband two-layer radar absorbing coating. In addition, the backscattered electric field data of coated and uncoated X29 aircraft are obtained by using the PO method, respectively. Finally, the two-dimensional Inverse Fourier Transform (IFT) of the collected data is taken to form the Inverse Synthetic Aperture Radar (ISAR) image. © 2019 IEEE.

关键词： Radar cross section

来源：评论

学校读者我要写书评

暂无评论

An efficient software faults localization method based on program spectrum

An efficient software faults localization method based on pr...

引用

2020 IEEE International Conference on Information Technology, Big Data and Artificial Intelligence, ICIBA 2020

作者： Yu, Xiaoran Tang, Huanrong Zou, Juan Yu, Fan College of Computer Science and College of Cyberspace Security Xiangtan University Xiangtan China Key Laboratory of Intelligent Computing and Information Processing Xiangtan University Ministry of Education Xiangtan China

ISBN: (纸本)9781728152240

The Spectrum-based Software Fault Localization (SBFL) method has been proved to be effective. The SBFL mainly analyzes the execution information of the test case set on each program entity and counts the suspiciousness value of each program entity through the suspiciousness formula. Different measurement methods of program entities have a significant influence on the accuracy of software faults localization because the effectiveness of the SBFL method depends on the suspiciousness calculation formula used. This paper proposes a new suspiciousness formula, fully considered the coverage information of different dimensions of the program spectrum. The suspiciousness formula can be widely used in a variety of faults localization methods extended on the SBFL method. The experimental results show that this method has advantages in effectiveness and efficiency of faults localization. © 2020 IEEE.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

An intelligent self-sustained RAN slicing framework for diverse service provisioning in 5G-beyond and 6G networks

引用

intelligent and Converged Networks 2020年第3期1卷 281-294页

作者： Jie Mei Xianbin Wang Kan Zheng Electrical and Computer Engineering Western UniversityLondonON N6A 5B9Canada Intelligent Computing and Communication(IC2)Lab Wireless Signal Processing and Network(WSPN)LabKey Laboratory of Universal Wireless CommunicationMinistry of EducationBeijing University of Posts and Telecommunications(BUPT)Beijing 100876China

Network slicing is a key technology to support the concurrent provisioning of heterogeneous Quality of Service(QoS)in the 5th Generation(5G)-beyond and the 6th Generation(6G)***,effective slicing of Radio Access Network(RAN)is very challenging due to the diverse QoS requirements and dynamic conditions in the 6G *** this paper,we propose a self-sustained RAN slicing framework,which integrates the self-management of network resources with multiple granularities,the self-optimization of slicing control performance,and self-learning together to achieve an adaptive control strategy under unforeseen network *** proposed RAN slicing framework is hierarchically structured,which decomposes the RAN slicing control into three levels,i.e.,network-level slicing,next generation NodeB(gNodeB)-level slicing,and packet scheduling level *** the network level,network resources are assigned to each gNodeB at a large timescale with coarse resource *** the gNodeB-level,each gNodeB adjusts the configuration of each slice in the cell at the large *** the packet scheduling level,each gNodeB allocates radio resource allocation among users in each network slice at a small ***,we utilize the transfer learning approach to enable the transition from a model-based control to an autonomic and self-learning RAN slicing *** the proposed RAN slicing framework,the QoS performance of emerging services is expected to be dramatically enhanced.

关键词： Radio Access Network(RAN) network slicing network resource management intelligent network

来源：评论

学校读者我要写书评

暂无评论

A Novel Preference-Driven Dynamic Multi-Objective Evolutionary Algorithm for Solving Dynamic Multi-Objective Problems

SSRN

引用

SSRN 2024年

作者： Wang, Xueqing Zheng, Jinhua Hou, Zhanglu Liu, Yuan Zou, Juan Xia, Yizhang Yang, Shengxiang Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Computer Science School of Cyberspace Science of Xiangtan University Hunan Province Xiangtan China Faculty of School of Computer Science School of Cyberspace Science of Xiangtan University Xiangtan411105 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

Most studies in dynamic multi-objective optimization have predominantly focused on rapidly and accurately tracking changes in the Pareto optimal front (POF) and Pareto optimal set (POS) when the environment undergoes changes. However, there are real-world scenarios where it is necessary to simultaneously solve changing objective functions and satisfy the preference of Decision Makers (DMs). In particular, the DMs may be only interested in a partial region of the POF, known as the region of interest (ROI), rather than requiring the entire POF. To meet the challenge of simultaneously predicting a changing POF and/or POS and dynamic ROI, this paper proposes a new dynamic multi-objective evolutionary algorithm (DMOEAs) based on the preference. The proposed algorithm consists of three key components: an evolutionary direction adjustment strategy based on changing reference points to accommodate shifts in preferences, an angle-based search strategy for tracking the varying ROI, and a hybrid prediction strategy that combines linear prediction models and population manifold estimation within the ROI to ensure convergence and distribution in scenarios where preferences remain unchanged. Experimental studies conducted on 16 widely used benchmark problems and empirical results demonstrate the significant advantages of the proposed algorithm over existing state-of-the-art DMOEAs. © 2024, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous influence of individuals’ behavior on mask efficacy in gathering environments

引用

Frontiers of Engineering Management 2022年第4期9卷 550-562页

作者： Haochen SUN Xiaofan LIU Zhanwei DU Ye WU Haifeng ZHANG Xiaoke XU College of Information and Communication Engineering Dalian Minzu UniversityDalian 116600China Web Mining Laboratory Department of Media and CommunicationCity University of Hong KongHong KongChina WHO Collaborating Centre for Infectious Disease Epidemiology and Control School of Public HealthLi Ka Shing Faculty of MedicineThe University of Hong KongHong KongChina Laboratory of Data Discovery for Health Hong Kong Science and Technology ParkHong KongChina Computational Communication Research Center Beijing Normal University(Zhuhai)Zhuhai 519087China School of Journalism and Communication Beijing Normal UniversityBeijing 100875China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical ScienceAnhui UniversityHefei 230601China

Wearing masks is an easy way to operate and popular measure for preventing *** masks can slow down the spread of viruses,their efficacy in gathering environments involving heterogeneous person-to-person contacts remains ***,we aim to investigate the epidemic prevention effect of masks in different real-life gathering *** study uses four real interpersonal contact datasets to construct four empirical networks to represent four gathering *** transmission of COVID-19 is simulated using the Monte Carlo simulation *** heterogeneity of individuals can cause mask efficacy in a specific gathering environment to be different from the baseline efficacy in general ***,the heterogeneity of gathering environments causes the epidemic prevention effect of masks to *** masks can greatly reduce the probability of clustered epidemics and the infection scale in primary schools,high schools,and ***,the use of masks alone in primary schools and hospitals cannot control *** high schools with social distancing between classes and in workplaces where the interpersonal contact is relatively sparse,masks can meet the need for *** the heterogeneity of individual behavior,if individuals who are more active in terms of interpersonal contact are prioritized for mask-wearing,the epidemic prevention effect of masks can be ***,asymptomatic infection has varying effects on the prevention effect of masks in different *** effect can be weakened or eliminated by increasing the usage rate of masks in high schools and ***,the effect on primary schools and hospitals cannot be *** study contributes to the accurate evaluation of mask efficacy in various gathering environments to provide scientific guidance for epidemic prevention.

关键词： COVID-19 masks behavioral heterogeneity asymptomatic infection

来源：评论

学校读者我要写书评

暂无评论

The Mean Time to Absorption on Horizontal Partitioned Sierpinski Gasket Networks

arXiv

引用

arXiv 2022年

作者： Zhang, Zhizhuo Wu, Bo Yu, Zuguo School of Mathematics Southeast University Nanjing210023 China School of Applied Mathematics Nanjing University of Finance and Economics Nanjing210023 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Hunan411105 China

The random walk is one of the most basic dynamic properties of complex networks, which has gradually become a research hotspot in recent years due to its many applications in actual networks. An important characteristic of the random walk is the mean time to absorption, which plays an extremely important role in the study of topology, dynamics and practical application of complex networks. Analyzing the mean time to absorption on the regular iterative self-similar network models is an important way to explore the influence of self-similarity on the properties of random walks on the network. The existing literatures have proved that even local self-similar structures can greatly affect the properties of random walks on the global network, but they have failed to prove whether these effects are related to the scale of these self-similar structures. In this article, we construct and study a class of Horizontal Partitioned Sierpinski Gasket network model based on the classic Sierpinski gasket network, which is composed of local self-similar structures, and the scale of these structures will be controlled by the partition coefficient k. Then, the analytical expressions and approximate expressions of the mean time to absorption on the network model are obtained, which prove that the size of the self-similar structure in the network will directly restrict the influence of the self-similar structure on the properties of random walks on the network. Finally, we also analyzed the mean time to absorption of different absorption nodes on the network to find the location of the node with the highest absorption efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Dynamic Constrained Multi-Objective Optimization Algorithm Based on Co-Evolution and Diversity Enhancement

SSRN

引用

SSRN 2024年

作者： Che, Wang Zheng, Jinhua Hu, Yaru Zou, Juan Yang, Shengxiang Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Computer Science School of Cyberspace Science of Xiangtan University Hunan Province Xiangtan China Faculty of School of Computer Science School of Cyberspace Science of Xiangtan University Xiangtan411105 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

Dynamic constrained multi-objective optimization problems (DCMOPs) involve objectives, constraints, and parameters that change over time. This kind of problem presents a greater challenge for evolutionary algorithms because it requires the population to quickly track the changing pareto-optimal set (PS) while being subject to constrained limitations and maintaining a good distribution of solutions. This paper proposes a dynamic constrained multi-objective optimization algorithm based on co-evolution and diversity enhancement (CEDE). The static optimization involves the co-evolution of three populations. We evolve the first population to prioritize the preservation of feasible individuals. The second population is evolved to assist the first population in finding better feasible regions, while the third population is evolved to aid the first population in exploring feasible regions comprehensively. At different stages, the co-evolution of these three populations will also be adjusted. Additionally, to prevent the elimination of potentially valuable infeasible individuals due to pareto domination, we employ an archive set to store and update these individuals, providing more useful information for both static and dynamic optimization. When the environment changes, we propose a diversity enhancement strategy, which includes a diversity maintenance strategy and a center point-based exploration strategy. The experimental results demonstrate that CEDE is highly competitive in handling DCMOPs compared to several state-of-the-art algorithms. © 2024, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Hand Hygiene Assessment via Joint Step Segmentation and key Action Scorer

arXiv

引用

arXiv 2022年

作者： Li, Chenglong Zhu, Qiwen Liu, Tubiao Tang, Jin Su, Yu 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 of Ministry of Education Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China Hefei Normal University Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei230061 China

Hand hygiene is a standard six-step hand-washing action proposed by the World Health Organization (WHO). However, there is no good way to supervise medical staff to do hand hygiene, which brings the potential risk of disease spread. Existing action assessment works usually make an overall quality prediction on an entire video. However, the internal structures of hand hygiene action are important in hand hygiene assessment. Therefore, we propose a novel fine-grained learning framework to perform step segmentation and key action scorer in a joint manner for accurate hand hygiene assessment. Existing temporal segmentation methods usually employ multi-stage convolutional network to improve the segmentation robustness, but easily lead to over-segmentation due to the lack of the long-range dependence. To address this issue, we design a multi-stage convolution-transformer network for step segmentation. Based on the observation that each hand-washing step involves several key actions which determine the hand-washing quality, we design a set of key action scorers to evaluate the quality of key actions in each step. In addition, there lacks a unified dataset in hand hygiene assessment. Therefore, under the supervision of medical staff, we contribute a video dataset that contains 300 video sequences with fine-grained annotations. Extensive experiments on the dataset suggest that our method well assesses hand hygiene videos and achieves outstanding performance. Copyright © 2022, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

SSD Real-Time Illegal Parking Detection Based on Contextual Information Transmission

引用

Computers, Materials & Continua 2020年第1期62卷 293-307页

作者： Huanrong Tang Aoming Peng Dongming Zhang Tianming Liu Jianquan Ouyang Key Laboratory of Intelligent Computing and Information Processing Ministry of EducationCollege of Information EngineeringXiangtan UniversityXiangtan411105China National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing100029China Department of Computer Science the University of GeorgiaAthensGeorgiaUSA

With the improvement of the national economic level,the number of vehicles is still increasing year by *** to the statistics of National Bureau of Statics,the number is approximately up to 327 million in China by the end of 2018,which makes urban traffic pressure continues to rise so that the negative impact of urban traffic order is *** parking-the common problem in the field of transportation security is urgent to be solved and traditional methods to address it are mainly based on ground loop and manual supervision,which may miss detection and cost much *** to the rapidly developing deep learning sweeping the world in recent years,object detection methods relying on background segmentation cannot meet the requirements of complex and various scenes on speed and ***,an improved Single Shot MultiBox Detector(SSD)based on deep learning is proposed in our study,we introduce attention mechanism by spatial transformer module which gives neural networks the ability to actively spatially transform feature maps and add contextual information transmission in specified ***,we found out the best connection layer in the detection model by repeated experiments especially for small objects and increased the precision by 1.5%than the baseline SSD without extra training ***,we designed an illegal parking vehicle detection method by the improved SSD,reaching a high precision up to 97.3%and achieving a speed of 40FPS,superior to most of vehicle detection methods,will make contributions to relieving the negative impact of illegal parking.

关键词： Contextual information transmission illegal parking detection spatial attention mechanism deep learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：