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

IEEE workshop on Machine Learning for Signal Processing

作者： Jie Chen Cédric Richard Alfred O. Hero Ali H. Sayed Universite de Nice Sophia-Antipolis CNRS France University of Michigan Ann Arbor USA University of California Los Angeles USA

There are many important applications that are multitask-oriented in the sense that there are multiple optimum parameter vectors to be inferred simultaneously by networked agents. In this paper, we formulate an online multitask learning problem where node hypothesis spaces partly overlap. A cooperative algorithm based on diffusion adaptation is derived. Some results on its stability and convergence properties are also provided. Simulations are conducted to illustrate the theoretical results.

关键词： Vectors Least squares approximations Convergence optimization Estimation Adaptive systems Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Ant Colony optimization and Swarm Intelligence 2008

引用

丛书名： Lecture Notes in Computer Science

2008年

作者： Marco Dorigo Mauro Birattari Christian Blum Maurice Clerc Thomas Stützle Alan Winfield

ISBN: (数字)9783540875277

ISBN: (纸本)9783540875260

This book constitutes the refereed proceedings of the 6th international workshop on Ant Colony optimization and Swarm Intelligence, ANTS 2008, held in Brussels, Belgium, in September 2008. The 17 revised full papers, 24 revised short papers, and 10 extended abstracts presented were carefully reviewed and selected from 91 submissions. The papers cover theoretical and foundational aspects of computational intelligence and related disciplines with special focus on swarm intelligence and are devoted to behavioral models of social insects and new algorithmic approaches, empirical and theoretical research in swarm intelligence, applications such as ant colony optimization or particle swarm optimization, and theoretical and experimental research in swarm robotics systems.

关键词： Ant algorithms Congresses. Mathematical optimization Computer programs Congresses.

来源：评论

学校读者我要写书评

暂无评论

Topology design for service overlay networks with bandwidth guarantees

Topology design for service overlay networks with bandwidth ...

引用

international workshop on Quality of Service

作者： S.L. Vieira J. Liebeherr Department of Computer Science Catholic University of Goias Goiania Brazil Department of Computer Science University of Virginia Charlottesville VA USA

The Internet still lacks adequate support for QoS applications with real-time requirements. In great part, this is due to the fact that provisioning of end-to-end QoS to traffic that traverses multiple autonomous systems (ASs) requires a level of cooperation between ASs that is difficult to achieve in the current architecture. Recently, service overlay networks have been considered as an approach to QoS deployment that avoids these difficulties. In this study, we address the problem of the topological synthesis of a service overlay network, where endsystems and nodes of the overlay network (provider nodes) are connected through ISPs that supports bandwidth reservations. We express the topology design problem as an optimization problem. Even though the design problem is related to the (in general NP-hard) quadratic assignment problem, we are able to show that relatively simple heuristic algorithms can deliver results that are sometimes close to the optimal solution.

关键词： Network topology Bandwidth Peer to peer computing IP networks Web and internet services Telecommunication traffic Computer science Application software Network synthesis Design optimization

来源：评论

学校读者我要写书评

暂无评论

Robust 3D vision for robots using dynamic programming

Robust 3D vision for robots using dynamic programming

引用

IEEE international workshop on Imaging Systems and Techniques (IST)

作者： Lazaros Nalpantidis John Kalomiros Antonios Gasteratos Laboratory of Robotics and Automation Department of Production and Management Engineering Democritus University of Thrace Xanthi Greece Department of Informatics and Communications School of Technological Applications Technological Educational Institute of Serres Serres Greece

In this paper a new stereo vision method is presented that combines the use of a lightness-invariant pixel dissimilarity measure within a dynamic programming depth estimation framework. This method uses concepts such as the proper projection of the HSL colorspace for lightness tolerance, as well as the Gestalt-based adaptive support weight aggregation and a dynamic programming optimization scheme. The robust behavior of this method is suitable for the working environments of outdoor robots, where non ideal lighting conditions often occur. Such problematic conditions heavily affect the efficiency of robot vision algorithms in exploration, military and security applications. The proposed algorithm is presented and applied to standard image sets.

关键词： Pixel Stereo vision Lighting Image color analysis Dynamic programming Robots Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive Dynamic Aquila optimization Incorporating with Improved Sine Cosine

Adaptive Dynamic Aquila Optimization Incorporating with Impr...

引用

IEEE international workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and applications

作者： Lang Huang Hui Xu Zhengbin Qin Yang Jin Hubei University of Technology Wuhan China

To address the issues of the Aquila optimization (AO) easily falling into local optima, slow convergence speed, and low convergence accuracy, this paper proposes a fusion of adaptive dynamic Aquila optimization incorporating with improved Sine Cosine (AO-SC). The AO-SC algorithm combines the adaptive weight mechanism and the nonlinearly decreasing search factor of the sine cosine algorithm to perform secondary optimization, effectively improving convergence accuracy and speed, and escaping from local optima. Additionally, the Cauchy-Gaussian mutation operator is also utilized to enhance the proposed AO-SC algorithm's global search capability. Finally, the introduction of nonlinear adaptive weight factors and the combination of archimedean spiral pattern with the variable step size feature of the original AO algorithm generate new local solutions to improve the local search capability and search accuracy of the AO algorithm. Through testing and comparison with seven other algorithms on ten benchmark functions, the final experimental results demonstrate that, the proposed AO-SC algorithm has significant advantages in terms of convergence speed, accuracy, and stability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Shape optimization of multi-band antennas using the coupling between microgenetic algorithms and TLM method

引用

international JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS 2004年第3期17卷 193-205页

作者： Chu, HS Dubard, JL Staraj, R Univ Nice Sophia Antipolis CNRS UMR 6071 Lab Elect Antennes & Telecommun F-06560 Valbonne France

This paper presents a new combination between transmission line matrix method (TLM) and microgenetic algorithm (muGA). This coupling is used to design patch shapes of microstrip and planar inverted-F antennas (PIFA) for broad-band or multi-band applications. Measured results of the muGA/TLM optimized designs show good agreement with TLM simulation. Copyright (C) 2004 John Wiley Sons, Ltd.

关键词： genetic algorithms TLM method microstrip antenna PIFA antenna

来源：评论

学校读者我要写书评

暂无评论

Topology and parameter optimization of ANN using genetic algorithm for application of textiles

Topology and parameter optimization of ANN using genetic alg...

引用

IEEE international workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and applications

作者： Lalita Admuthe Shaila Apte Sunil Admuthe Textile and Engineering Institute Ichalkaranji India Walchand College of Engineering and Technology Sangli India Padmabhooshan Vasantraodada Patil Institute of Technology Sangli India

The BP feed-forward neural network is popular in solving many non-linear multivariate and complex problems. The most important problem with neural network is to decide optimal structure and parameter settings. Literature presents a multitude of methods but there is no rigorous and accurate analytical method. This paper presents the hybrid approach of genetic algorithm and neural network computing for establishment of the optimum number of neurons on layers, transfer functions, learning rate, momentum and number of epochs for a given problem. The method can be used without restrictions to model a network with many inputs and outputs. The process involves GA evolving several structures, different parameters and fitness level of each structure. GA decides fitness using neural network as the fitness function. This technique can help to eliminate trial and error work for deciding the optimal network. The proposed Neuron-Genetic classifier has been successfully applied for prediction of yarn properties in spinning process of Textile industry.

关键词： Genetic algorithms Textiles Neural networks Network topology Artificial neural networks Feedforward systems Feedforward neural networks Computer networks Neurons Transfer functions

来源：评论

学校读者我要写书评

暂无评论

A new improved fruit fly optimization algorithm for traveling salesman problem

A new improved fruit fly optimization algorithm for travelin...

引用

international workshop on Advanced Computational Intelligence (IWACI)

作者： Lvjiang Yin Xinyu Li Liang Gao Chao Lu The State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology Wuhan China

Traveling salesman problem (TSP) which is a classic combinational optimization problem has a wide range of applications in many areas. Many researchers focus on this problem and propose several algorithms. However, it was proved to be NP-hard, which is very difficult to be solved. No algorithm can solve any types of this problem effectively. In order to propose an effective algorithm for TSP, this paper improves the fruit fly optimization algorithm (FOA) proposed recently. As far as we know, the FOA has not yet been applied to solve TSP. Therefore, several modifications of FOA have to be made to meet the characteristics of TSP. Based on the whole search framework and the essence of FOA, some operations of particle swarm optimization (PSO) have been introduced into this method. In the smell search phase, the cluster mechanism of the fruit flies has been used to copy flies to one point and the mutation operation of genetic algorithm is used as the method of information exchanging among fruit flies for random search. In the visual search phase, the generalized PSO is applied to balance the global search and local search abilities of proposed algorithm. To evaluate the performance of proposed algorithm, some experiments and comparisons with other reported algorithms have been conducted. The results show the feasibility and effectiveness of proposed algorithm in solving TSP.

关键词： optimization Sociology Statistics Visualization Convergence Traveling salesman problems Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Program modelling via inter-reference gaps and applications

Program modelling via inter-reference gaps and applications

引用

international Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)

作者： V. Phalke B. Gopinath Department of Computer Science Rutgers University NJ USA Department of Electrical and Computer Engineering Rutgers University NJ USA

Locality of reference in program behavior has been studied and modelled extensively because of its application to CPU, cache and virtual memory design, code optimization, multiprogramming etc. In this paper we propose a scheme based on Markov chains for modelling the time interval between successive references to the same address in a program execution. Using this technique and trace driven simulations, it is shown that memory references are predictable and repetitive. This is used to improve miss ratios of memory replacement algorithms. Using trace driven simulations over a wide range of traces we get improvements up to 35% over the least recently used (LRU) replacement algorithm.< >

关键词： Predictive models Application software Computer science Central Processing Unit Design optimization Computational modeling Computer simulation Prefetching Clocks Legged locomotion

来源：评论

学校读者我要写书评

暂无评论

Fast 3D face modeling using mesh optimization and vertex integration

Fast 3D face modeling using mesh optimization and vertex int...

引用

international Conference on e-health Networking, applications and Services (HealthCom)

作者： Hyun Cheol Lee Eun Seok Kim Gi Tack Hur Department of Digital Contents Dong-shin University South Korea

ISBN: (纸本)0780389409

3D animation is a field in computer graphics with vibrant recent research activities, and one of the important research areas in 3D animation is animating the human being. Animation production using 3D faces has traditionally involved the animator conducting frame-by-frame manual work, requiring much effort, time, equipment and 3D software. This paper describes the implementation process of creating a fast and simple 3D face model that resembles the actual human face by inputting the frontal facial image, and suggests a technique for simplifying the mesh data of the general 3D model.

关键词： Facial animation Face Humans Rendering (computer graphics) Clustering algorithms optimization methods Solid modeling Computer graphics Production Memory management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：