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

Interactive PBIL with Multiple Probability Vectors for Multimodal Optimization with Implicit Performance Indices

Interactive PBIL with Multiple Probability Vectors for Multi...

2010 2nd International Conference on Computer engineering and Technology(2010年第二届计算机工程与技术国际会议 ICCET 2010)

作者： Haifeng You Xufa Wang Department of Computer Science and Technology Anhui Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei China

ISBN: (纸本)9781424463473

Interactive population-based incremental learning (IPBIL) is an effective method to solve optimization problems with implicit performance indices. It can significantly reduce user fatigue compared with interactive evolutionary computation (IEC). However,each run of IPBIL can only find one solution or some similar solutions. Thus it is not suitable for multimodal optimization problems with implicit performance indices. To solve this problem,we propose an IPBIL with multiple probability vectors (IPBIL-MPV) in this work. The key idea is to utilize multiple probability vectors to catch different search directions and thus find more than one solutions. We perform a subjective experiment in which IPBIL-MPV is applied to a fashion design problem. The experimental results show that IPBIL-MPV can find several distinct solutions in a run. Thus it is an effective method to solve multimodal optimization problems with implicit performance indices.

关键词： population-based incremental learning multimodal optimization:implicit performance indices:fashion design

来源：评论

学校读者我要写书评

暂无评论

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)

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

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 K-hidden algorithm for generating hard-to-reverse NDBs (called K-hidden-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 K-hidden-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 q-hidden-NDB.

关键词： Search problems Databases Security Data privacy Algorithm design and analysis Computer science NP-hard problem

来源：评论

学校读者我要写书评

暂无评论

Learning with only multiple instance positive bags

Learning with only multiple instance positive bags

引用

2016 International Joint Conference on Neural Networks, IJCNN 2016

作者： Wang, Zhigang Zhao, Zengshun Zhang, Changshui Computer and Communication Engineering School Tianjin University of Technology Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology China Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education China College of Electronics Communication and Physics Shandong University of Science and Technology China Automation Department Tsinghua University State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology China

ISBN: (纸本)9781509006199

In traditional multiple instance learning (MIL), both positive and negative bags are required to learn a prediction function. However, a high human cost is needed to know the label of each bag - positive or negative. Only positive bags contain our focus (positive instances) while negative bags consist of noise or background (negative instances). So we do not expect to spend too much to label the negative bags. Contrary to our expectation, nearly all existing MIL methods require enough negative bags besides positive ones. In this paper we propose an algorithm called 'Positive Multiple Instance' (PMI), which learns a classifier given only a set of positive bags. So the annotation of negative bags becomes unnecessary in our method. PMI is constructed based on the assumption that the unknown positive instances in positive bags be similar each other and constitute one compact cluster in feature space and the negative instances locate outside this cluster. The experimental results demonstrate that PMI achieves the performances close to or a little worse than those of the traditional MIL algorithms on benchmark and real data sets. However, the number of training bags in PMI is reduced significantly compared with traditional MIL algorithms. © 2016 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Method to Verify Internal Parameters of Camera Calibration in World Coordinate System 6

A Method to Verify Internal Parameters of Camera Calibration...

引用

6th IEEE International Conference on Electronic Information and communication Technology, ICEICT 2023

作者： Xing, Zheng Wang, Qingchun Li, Yingsong Qi, Junwei College of Information and Communication Engineering Harbin Engineering University Harbin150001 China Shanghai Yanding Information Technology Co. Ltd. Shanghai201210 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China

ISBN: (纸本)9798350399059

Aiming at the problem that reprojection error (RE) cannot reflect the camera calibration accuracy intuitively, this paper proposes a method to verify the camera calibration results in world coordinate system. Firstly, the checkerboard calibration target is photographed with the camera under test, and the internal parameters and distortion parameters of the camera are calculated by using the pinhole model and the Kannala-Brandt (KB) fisheye model, respectively. Then, the same camera is used to shoot two targets in the field of view (FOV), and the pixel coordinates of the two target points are detected from the image. Thirdly, the inverse projection model is used to calculate the distance between the two objects and the angle between the camera and the two objects, and the real distance and angle are compared. The experimental results show that the average distance errors of the pinhole model and the KB fisheye model are 0.34% and 0.35%, respectively, and the angle errors are 0.40% and 0.12%, respectively, which proves that the verification method can effectively characterize the calibration accuracy of the camera. © 2023 IEEE.

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

A novel denoising method for infrared image based on bilateral filtering and non-local means

引用

Optoelectronics Letters 2017年第3期13卷 237-240页

作者：刘凤连孙梦尧蔡文娜 Key Laboratory of Computer Vision and System Ministry of Education of ChinaTianjin Key Laboratory of Intelligence Computing and Novel Software TechnologySchool of Computer and Communication EngineeringTianjin University of TechnologyTianjin 300384China

This paper presents an image denoising method based on bilateral filtering and non-local means. The non-local region texture or structure of the image has the characteristics of repetition, which can be used to effectively preserve the edge and detail of the image. And compared with classical methods, bilateral filtering method has a better performance in denosing for the reason that the weight includes the geometric closeness factor and the intensity similarity factor. We combine the geometric closeness factor with the weight of non-local means, and construct a new weight. Experimental results show that the modified algorithm can achieve better performance. And it can protect the image detail and structure information better.

关键词： bilateral filtering similarity pixel texture combine repetition neighborhood preserve noisy

来源：评论

学校读者我要写书评

暂无评论

Empirical Study of Population-Based Dynamic Constrained Multimodal Optimization Algorithms

Empirical Study of Population-Based Dynamic Constrained Mult...

引用

IEEE Symposium Series on Computational Intelligence (SSCI)

作者： Xin Lin Wenjian Luo Yingying Qiao Peilan Xu Tao Zhu Anhui Province Key Laboratory of Software Engineering in Computing and Communication School of Computer Science and Technology University of Science and Technology of China Hefei China School of Software Engineering University of South China Hengyang China

ISBN: (数字)9781728124858

ISBN: (纸本)9781728124865

There are many dynamic optimization problems in real-world applications. Although many variants of evolutionary algorithms and swarm intelligence have been proposed to solve such problems, little work has been conducted to address the dynamic constrained multimodal optimization problems (DCMMOPs). In DCMMOPs, there exist multiple optimal solutions corresponding to each environment that the algorithm is required to find. Sometimes, it is also necessary to identify the accepted local optima. Therefore, for each environment, the decision maker can select one from among multiple returned solutions according to his/her domain knowledge and/or preferences. The objective of this paper is to test the performance of various combinations of several population-based dynamic multimodal optimization algorithms and popular constraint handling techniques. First, the typical dynamic constrained optimization problems are slightly modified to be in the form of the dynamic constrained multimodal optimization problems. Second, four different population-based dynamic multimodal optimization algorithms, and five different constraint handling techniques, are pairwise tested in the experiments. Experimental results demonstrate that, among the candidates, DCMM-CSA-SR performs most successfully at all accuracy levels.

关键词： Heuristic algorithms Optimization Vehicle dynamics Sociology Statistics Evolutionary computation Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A simplification method of polymorphic boolean functions

arXiv

引用

arXiv 2017年

作者： Luo, Wenjian Li, Zhifang Anhui Key Laboratory of Software in Computing and Communication School of Computer Science and Technology University of Science and Technology of China Hefei230027 China

Polymorphic circuits are a special kind of circuits which possess multiple build-in functions, and these functions are activated by environment parameters, like temperature, light and VDD. The behavior of a polymorphic circuit can be described by a polymorphic Boolean function. For the first time, this brief presents a simplification method of the polymorphic Boolean function. Copyright © 2017, The Authors. All rights reserved.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Coverage-preserving Data Gathering in Wireless Sensor Networks

Coverage-preserving Data Gathering in Wireless Sensor Networ...

引用

ACIS International Conference on software engineering, Artificial Intelligence, Networking, and Parallel/Distributed computing (SNPD)

作者： Hongli Xu Liusheng Huang Jumin Wu Yang Wang Depart. of Computer Science and Technology Anhui Province key Laboratory of Software in Computing and Communication University of Science and Technology Hefei China

The power is the most significant resource in wireless sensor nodes, so energy conservation is the most important factor in designing the protocol for sensor networks. In this paper, we study the problem of energy-efficient collection of the physical information from the target area. The coverage-preserving data gathering (CPDG) problem is to build up a tree, which minimizes the total energy consumption, and preserves the original coverage to ensure the result correctness. This problem can be formalized as 0-1 integer linear programming, and solved by an efficient heuristic algorithm. Furthermore, an improved algorithm is also proposed to balance the energy consumption among all the sensor nodes. The experimental results show that CPDG algorithm can conserve the energy about 30% of PEDAP protocol, which is regarded as one of the most efficient data gathering protocols as we know.

关键词： Wireless sensor networks Energy efficiency Energy consumption Heuristic algorithms Monitoring Distributed computing Computer networks Energy conservation Wireless application protocol Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A Hormone-based Clustering Algorithm in Wireless Sensor Networks

A Hormone-based Clustering Algorithm in Wireless Sensor Netw...

引用

2010 2nd International Conference on Computer engineering and Technology(2010年第二届计算机工程与技术国际会议 ICCET 2010)

作者： Dayuan Dong Haifeng You Yipeng Zhang Xufa Wang Key Laboratory of Software in Computing and Communication Anhui Province School of Computer Science and Technology University of Science and Technology of China HefeiChina

ISBN: (纸本)9781424463473;9781424463497;9781424463503

Clustering problem is one of the hottest issues in wireless sensor networks (WSNs). The strategy for selection of cluster head has not been sufficiently investigated. In this paper,we propose a hormone-based clustering algorithm (HCA) inspired by the communication mechanism of bioendocrine system to prolong the lifetime of the sensor nodes. Two kinds of hormones,cluster hormone and member hormone,are used in the algorithm. Hormone message can promote a node to become a cluster head or a member node. Comparative experiment shows that the proposed algorithm has effectively prolong the lifetime of WSN compared with LEACH[1] and HEED[2].

关键词： hormone:clustering:wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

An efficient group key agreement protocol with administrator 3

An efficient group key agreement protocol with administrator

引用

3rd International Conference on Internet of Things and Smart City, IoTSC 2023

作者： Fang, Qihao Zhang, Lei Zhang, Mingrui Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai200062 China Science and Technology on Communication Security Laboratory Chengdu610041 China Engineering Research Center of Software/Hardware Co-design Technology and Application Ministry of Education Shanghai200062 China

ISBN: (纸本)9781510666375

Group key agreement technology is one of the most popular solution to establish a reliable secure channel between communicating entities of a group. Group key agreement protocol with administrator (GKAA) can handle a large number of group operations in sequence to resolve disorder problem and it is widely used in practical applications. However, in most of existing protocol, the administrator has to compute materials for each participant in the group which brings huge calculate overhead. In this paper, we propose an efficient group key agreement protocol with Administrator. Our GKAA protocol is able to perform group operation in a high efficacy way with the help of a key tree. It is also flexible and scalable since it suits for any network communication environment like IoT, video meeting, social applications, etc. Our protocol satisfies the properties including forward secrecy, PCS and key control resistance. © 2023 SPIE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：