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

4th International Workshop on Advanced Computational Intelligence, IWACI 2011

作者： Zhang, Jie Luo, Wenjian School of Computer Science and Technology University of Science and Technology of China Hefei 230027 Anhui China Anhui Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei 230027 Anhui China

ISBN: (纸本)9781612843735

Self representation problem is very important for the negative selection algorithms. In this paper, two methods, named as K-NN-ASR and B-NN-ASR, are proposed to calculate the self radius of a self sample in the continuous space. As for the K-NN-ASR, the self radius of a self sample is calculated according to the distances from itself to the surrounding self samples. In the B-NN-ASR, both the position of the self sample and the distances to the surrounding self samples are considered. Experiments are done to test the performance of the proposed methods. Experimental results demonstrate that the proposed methods are competitive, and the B-NN-ASR is better. © 2011 IEEE.

关键词： selection algorithm Self tuning CONTINUOUS SPACE

来源：评论

学校读者我要写书评

暂无评论

A Gong-Si-Shaped Heterogeneous Circular-Polarization Array for 5G Application 5

A Gong-Si-Shaped Heterogeneous Circular-Polarization Array f...

引用

5th IEEE International Conference on Electronic Information and communication Technology, ICEICT 2022

作者： Zhou, Wei Qi, Junwei Li, Yingsong Huang, Zhixiang Yang, Lixia College of Information and Communication Engineering Harbin Engineering University Harbin150001 China Anhui Province Key Laboratory of Target Recognition and Feature Extraction LuAn230088 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei China

ISBN: (数字)9781665472111

ISBN: (纸本)9781665472111

In this work, a Gong-Si-shaped circularly polarized (CP) array with power driver for 5G is proposed. The radiator of the constructed CP array consists of two Chinese-like characters ' and '' with the similar size and pronunciation of 'gong' and 'si', Two L-shaped feeding probes of the same size are connected to the designed power driver printed on the bottom layer of ground plate, and the array can radiate circular polarization electromagnetic waves by changing the positions of the L-shaped probes and the angle of the horizontal parts of the L-shaped probes. From the simulating and optimizing, it is finally obtained that the -15 dB bandwidth of modeled Gong-Si-like CP antenna lies in 2.49 - 2.81 GHz and the presented Gong-Si-like CP antenna has a axial bandwidth covering 2.36 - 2.82 GHz, which meets the n41 5G band implementing at 2.515 - 2.675 GHz. © 2022 IEEE.

关键词： Circular polarization

来源：评论

学校读者我要写书评

暂无评论

Differential evolution with a species-based repair strategy for constrained optimization

Differential evolution with a species-based repair strategy ...

引用

Congress on Evolutionary Computation

作者： Chenyang Bu Wenjian Luo Tao Zhu Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781479914869

Evolutionary Algorithms (EAs) with gradient-based repair, which utilize the gradient information of the constraints set, have been proved to be effective. It is known that it would be time-consuming if all infeasible individuals are repaired. Therefore, so far the infeasible individuals to be repaired are randomly selected from the population and the strategy of choosing individuals to be repaired has not been studied yet. In this paper, the Species-based Repair Strategy (SRS) is proposed to select representative infeasible individuals instead of the random selection for gradient-based repair. The proposed SRS strategy has been applied to εDEag which repairs the random selected individuals using the gradient-based repair. The new algorithm is named SRS-εDEag. Experimental results show that SRS-εDEag outperforms εDEag in most benchmarks. Meanwhile, the number of repaired individuals is reduced markedly.

关键词： Maintenance engineering Sociology Statistics Vectors Equations Clustering algorithms Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Evolutionary clustering with differential evolution

Evolutionary clustering with differential evolution

引用

Congress on Evolutionary Computation

作者： Gang Chen Wenjian Luo Tao Zhu Anhui Province key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781479914869

Evolutionary clustering is a hot research topic that clusters the time-stamped data and it is essential to some important applications such as data streams clustering and social network analysis. An evolutionary clustering should accurately reflect the current data at any time step while simultaneously not deviate too drastically from the recent past. In this paper, the differential evolution (DE) is applied to deal with the evolutionary clustering problem. Comparing with the typical k-means, evolutionary clustering based on DE (deEC) could perform a global search in the solution space. Experimental results over synthetic and real-world data sets demonstrate that the deEC provides robust and adaptive solutions.

关键词： Clustering algorithms History Vectors Evolutionary computation Equations Sociology Statistics

来源：评论

学校读者我要写书评

暂无评论

Grasping and folding knots

Grasping and folding knots

引用

IEEE International Conference on Robotics and Automation

作者： Weifu Wang Devin Balkcom Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781467380270

String stretched tightly along a sequence of fixed grasp points takes the shape of a polygonal arc. In this work, we investigate how many points are necessary and sufficient to grasp and tie arbitrary knots while maintaining tension, so that the string remains polygonal. This approach allows reasoning that is entirely geometric, which does not rely on potentially inaccurate dynamic models of the string or detailed knowledge of physical characteristics of the string. Algorithms are proposed to determine the contact locations, and generate the motions needed to tie arbitrary knots. This work shows that a number of grasp points that is linear in the number of crossings in a knot diagram is sufficient to immobilize string in a polygonal shape with the topology of an arbitrary knot, or to fold or unfold the knot from a straight configuration.

关键词： Grasping folding knots

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in Clonal Selection Algorithms and Applications

Recent Advances in Clonal Selection Algorithms and Applicati...

引用

IEEE Symposium Series on Computational Intelligence

作者： Wenjian Luo Xin Lin Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

Clonal selection algorithms (CSAs) are a kind of Artificial Immune Algorithms (AIAs). In this paper, recent advances in clonal selection algorithms are summarized and reviewed. First, the basic framework of clonal selection algorithms is given. Second, various types of applications using clonal selection algorithms are summarized, including global optimization, constrained optimization, combinatorial optimization, multiobjective optimization, dynamic optimization and other applications. Last, a brief conclusion and some remarks about clonal selection algorithms are given.

关键词： Immune Computation Clonal Selection Algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

An improved genetic algorithm for dynamic shortest path problems

An improved genetic algorithm for dynamic shortest path prob...

引用

Congress on Evolutionary Computation

作者： Xuezhi Zhu Wenjian Luo Tao Zhu Anhui Province key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

The Shortest Path (SP) problems are conventional combinatorial optimization problems. There are many deterministic algorithms for solving the shortest path problems in static topologies. However, in dynamic topologies, these deterministic algorithms are not efficient due to the necessity of restart. In this paper, an improved Genetic Algorithm (GA) with four local search operators for Dynamic Shortest Path (DSP) problems is proposed. The local search operators are inspired by Dijkstra's Algorithm and carried out when the topology changes to generate local shortest path trees, which are used to promote the performance of the individuals in the population. The experimental results show that the proposed algorithm could obtain the solutions which adapt to new environments rapidly and produce high-quality solutions after environmental changes.

关键词： Sociology Statistics Heuristic algorithms Topology Algorithm design and analysis Digital signal processing Biological cells

来源：评论

学校读者我要写书评

暂无评论

TMI: Two-dimensional maintainability index for automotive software maintainability measurement

引用

Journal of Systems Architecture 2025年 166卷

作者： Jiao Xie Jialing Yang Sirong Zhao Jianmei Lei Kaiwei Fan Guoqi Xie Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan University Changsha 410082 Hunan China Center of Convergence of Automobile and Cyberspace Research Institute of Hunan University in Chongqing Chongqing 401120 China China Automotive Engineering Research Institute Co Ltd Electronic Communication and Software Evaluation Research Center Chongqing 401122 China

The mass adoption of autonomous driving and Advanced Driver-Assistance System (ADAS) technologies increases the complexity and maintenance cost of automotive-embedded software during model-based development. Through model-based development tools (e.g., MATLAB/Simulink), the code is automatically generated by architectural transformation; however, unreasonable software architecture design could make the final generated code be difficult to maintain. Currently, both Microsoft Maintainability Index (MMI) and Bosch Maintainability Index (BMI) are used to measure the maintainability of code, but neither software architecture. We establish a four-layer maintainability index model by analyzing the characteristics of automotive software architecture, software quality model, and industry-related standards. We then propose a Two-dimensional Maintainability Index (TMI), meaning the code and architecture dimensions are simultaneously considered. This is the first work of maintainability measurement to combine code and architecture dimensions while ensuring low redundancy. TMI utilizes nine index metrics to guide architecture refactoring and code optimization, significantly improving software maintainability.

关键词： MATLAB

来源：评论

学校读者我要写书评

暂无评论

A fine-grained algorithm for generating hard-toreverse negative databases

A fine-grained algorithm for generating hard-toreverse negat...

引用

International Workshop on Artificial Immune Systems, AIS 2015

作者： Zhao, Dongdong Luo, Wenjian Liu, Ran Yue, Lihua School of Computer Science and Technology University of Science and Technology of China Hefei Anhui230027 China Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui230027 China School of Computer Science China University of Geosciences Wuhan430074 China

ISBN: (纸本)9781509002986

The negative database (NDB) is a new technique for privacy preserving and information hiding. It hides information by storing the complementary set instead of the original data. In order to protect the hidden information, NDBs should be hard-to-reverse. In this paper, we propose the Khidden algorithm for generating hard-to-reverse NDBs (called Khidden-NDBs). The K-hidden algorithm could be controlled in a more fine-grained manner than existing NDB generation algorithms. Moreover, in terms of the SAT solvers based on the local search strategy, we formally prove that the K-hidden-NDBs could be more hard-to-reverse than the NDBs generated by the typical p-hidden algorithm. Furthermore, we show that the Khidden-NDB could be more hard-to-reverse (against the local search strategy) than the q-hidden-NDB (NDBs generated by the q-hidden algorithm) when the sizes of NDBs are the same. Finally, as for the Unit Clause heuristic solvers, we prove that the K-hidden-NDB could be the same hard-to-reverse as the qhidden-NDB. © 2015 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Airborne moving vehicle detection for urban traffic surveillance

Airborne moving vehicle detection for urban traffic surveill...

引用

11th International IEEE Conference on Intelligent Transportation Systems, ITSC 2008

作者： Lin, Renjun Cao, Xianbin Xu, Yanwu Wei, Chuangxian Qiao, Hong University of Science and Technology China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230026 China Institute of Automation Chinese Academy of Sciences Beijing 100080 China University of Manchester United Kingdom

ISBN: (纸本)9781424421121

At present, moving vehicle detection on airborne platform has been an important technology for urban traffic surveillance. In such a situation, most commonly used methods (e.g. image subtraction) could hardly work well because of some additional difficulties such as slow movement of vehicles and jam. This paper proposed a new moving vehicle detection method named MVD-RD for airborne urban traffic surveillance. First, the non-road regions are extracted using road detection technique. Secondly, the non-road regions with no vehicles are removed according to their size. As a result of this two-stage regions shrinkage, the detection area reduces a lot. Finally, to the reduced area, image subtraction is used to get all moving regions and then moving vehicles can be accurately filtered in a simple way. The experimental results show that, compared with traditional image subtraction methods used in airborne moving vehicle detection, the proposed MVD-RD method achieves much better performance in detection rate, false alarm rate, and detection speed. © 2008 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：