نتایج جستجو برای: bf pso algorithm

تعداد نتایج: 764712  

2011
Weng Cho Chew B. Mhamdi K. Grayaa

Recently, the use of the particle swarm optimization (PSO) technique for the reconstruction of microwave images has received increasing interest from the optimization community due to its simplicity in implementation and its inexpensive computational overhead. However, the basic PSO algorithm is easily trapping into local minimum and may lead to the premature convergence. When a local optimal s...

Journal: :Pattern Recognition Letters 2007
Shu-Kai S. Fan Yen Lin

This paper presented a hybrid optimal estimation algorithm for solving multi-level thresholding problems in image segmentation. The distribution of image intensity is modeled as a random variable, which is approximated by a mixture Gaussian model. The Gaussian’s parameter estimates are iteratively computed by using the proposed PSO + EM algorithm, which consists of two main components: (i) glob...

2005
Feng Pan Jie Chen Ming-Gang Gan Tao Cai Xu-yan Tu

Particle Swarm Optimizer, PSO, exhibits good performance for optimization problem, although, PSO can not guarantee convergence of a global minimum, even a local minimum. However, there are some adjustable parameters and restrictive conditions which can affect performance of the algorithm. In this paper, a new adaptive PSO algorithm—Balloon PSO (BPSO) is proposed. The sufficient conditions for a...

2007
Yuelin Gao Zihui Ren Chengxian Xu

A branch and bound-PSO hybrid algorithm for solving integer separable concave programming problems is proposed, in which the lower bound of the optimal value was determined by solving linear programming relax and the upper bound of the optimal value and the best feasible solution at present were found and renewed with particle swarm optimization (PSO). It is shown by the numerical results that ...

2014
Kun Zhang K. Zhang

Network traffic flow prediction model is fundamental to the network performance evaluation and the design of network control scheme which is crucial for the success of high-speed networks. Aiming at shortcoming of the conventional network traffic time series prediction model and the problem that BP training algorithms easily plunge into local solution, a network traffic prediction model based o...

2013
T. Geetha

PSO is a robust and stochastic optimization technique based on the movement and the intelligence of the swarms. PSO is inspired with social behavior of bird flocking and fish schooling. PSO algorithm is applied to solve the real world complex optimization problems. So many real world optimization problems are solved by using different combinations and variations of PSO algorithms. In this paper...

Journal: :JNW 2013
Zhenwu Wang Xuejun Zhao Benting Wan Jun Xie

The paper proposes an approach to optimize the connection weights and network structure of BP neural network (BPNN) which based on improved particle swarm optimization (PSO) algorithm. For each network structure, the algorithm generates a series of particles which consist of connection weights and threshold values, and selects the best network structure according to the improved PSO algorithm. ...

2012
P. Acharjee S. K. Goswami

Particle Swarm Optimization (PSO) with elite PSO parameters has been developed for power flow analysis under practical constrained situations. Multiple solutions of the power flow problem are useful in voltage stability assessment of power system. A method of determination of multiple power flow solutions is presented using a hybrid of Particle Swarm Optimization (PSO) and local search techniqu...

Journal: :Appl. Soft Comput. 2011
Wiehann Matthysen Andries Petrus Engelbrecht

The Particle Swarm Optimisation (PSO) algorithm consists of a population (or swarm) of particles that are “flown” through an n-dimensional space in search of a global best solution to an optimisation problem. PSO operates in Cartesian space, producing Cartesian solution vectors. By making use of an appropriate mapping function the algorithm can be modified to search in polar space. This mapping...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->