2009 International Conference on Innovations in Information Technology (IIT)最新文献_第7页

Middleware for remote healthcare monitoring 用于远程医疗监控的中间件

2009 International Conference on Innovations in Information Technology (IIT) Pub Date : 2009-12-15 DOI: 10.1109/IIT.2009.5413781

C. Leite, Bruno G. de Araujo, R. Valentim, G. B. Brandao, Ana Gueirreiro

引用次数: 8

A cooperative and conversational virtual agent for M-commerce applications 用于移动商务应用程序的协作和会话虚拟代理

2009 International Conference on Innovations in Information Technology (IIT) Pub Date : 2009-12-15 DOI: 10.1109/IIT.2009.5413766

Siwar Rekik, S. Selouani, H. Hamam

引用次数: 0

Stochastic approximation driven Particle Swarm Optimization 随机逼近驱动粒子群优化

2009 International Conference on Innovations in Information Technology (IIT) Pub Date : 2009-12-01 DOI: 10.1109/IIT.2009.5413787

S. Kiranyaz, T. Ince, M. Gabbouj

{"title":"Stochastic approximation driven Particle Swarm Optimization","authors":"S. Kiranyaz, T. Ince, M. Gabbouj","doi":"10.1109/IIT.2009.5413787","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413787","url":null,"abstract":"Particle Swarm Optimization (PSO) is attracting an ever-growing attention and more than ever it has found many application areas for many challenging optimization problems. In this paper, we draw the focus on a major drawback of the PSO algorithm: the poor gbest update. This can be a severe problem, which causes pre-mature convergence to local optima since gbest as the common term in the update equation of all particles, is the primary guide of the swarm. Therefore, we basically seek a solution for the social problem in PSO, i.e. “Who will guide the guide?” which resembles the rhetoric question posed by Plato in his famous work on government: “Who will guard the guards?” (Quis custodiet ipsos custodes?). Stochastic approximation (SA) is purposefully adapted into two approaches to guide (or drive) the gbest particle (with simultaneous perturbation) towards the right direction with the gradient estimate of the underlying surface (or function) whilst avoiding local traps due to its stochastic nature. We purposefully used simultaneous perturbation SA (SPSA) for its low cost and since SPSA is applied only to the gbest (not the entire swarm), both approaches have thus a negligible overhead cost over the entire PSO process. Yet we have shown over a wide range of non-linear functions that both approaches significantly improve the performance of PSO especially if the parameters of SPSA suits to the problem in hand.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115630769","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Data path refinement algorithm in high-level synthesis based on dynamic programming 基于动态规划的高级综合数据路径优化算法

2009 International Conference on Innovations in Information Technology (IIT) Pub Date : 2009-11-01 DOI: 10.1109/IIT.2009.5413775

A. Rahimi, S. Mohammadi, Aidin Foroughi

引用次数: 0