Neural Correlates of Realisation of Satisfaction in a Successful Search Process

2021 ◽  
Vol 58 (1) ◽  
pp. 282-291
Author(s):  
Sakrapee Paisalnan ◽  
Yashar Moshfeghi ◽  
Frank Pollick

2009 ◽  
Vol 20 (06) ◽  
pp. 817-830
Author(s):  
DEBANJAN CHOWDHURY

For most of the important processes in DNA metabolism, a protein has to reach a specific binding site on the DNA. The specific binding site may consist of just a few base-pairs while the DNA is usually several millions of base-pairs long. How does the protein search for the target site? What is the most efficient mechanism for a successful search? Motivated by these fundamental questions on intracellular biological processes, we have developed a model for searching a specific site on a model DNA by a single protein. We have made a comparative quantitative study on the efficiencies of sliding, inter-segmental hoppings and detachment/re-attachments of the particle during its search for the specific site on the DNA. We also introduce some new quantitative measures of efficiency of a search process by defining a relevant quantity, which can be measured in in-vitro experiments.



One of the most successful search algorithms of the last decade is Artificial Bee Colony (ABC) algorithm. It was first coined by Dervis Karaboga, 2005. Since then a group of variants of the algorithm have been anticipated to find solutions for the problems of optimization. The motivation for the algorithm is the search process of honey bees for food sources. The present paper aimed to bring out the evolutionary developments of the algorithm that cover numerous versions of the algorithm with the strategic changes to meet the optimization needs of the adopted problem contexts. This survey clearly reviewed the basic types, advancements, application areas, and the relevance of the ABC algorithm addressing various problem contexts. The efforts made by the research community since the last two decades along with the success stories are discussed in detail. The attachment of the optimization process of ABC with data mining is dealt in particular. Finally the opportunities and the scope of the application of the algorithm in large areas of problem domains are highlighted.



2021 ◽  
Vol 15 (5) ◽  
Author(s):  
Peng Yang ◽  
Qi Yang ◽  
Ke Tang ◽  
Xin Yao

AbstractEffective exploration is key to a successful search process. The recently proposed negatively correlated search (NCS) tries to achieve this by coordinated parallel exploration, where a set of search processes are driven to be negatively correlated so that different promising areas of the search space can be visited simultaneously. Despite successful applications of NCS, the negatively correlated search behaviors were mostly devised by intuition, while deeper (e.g., mathematical) understanding is missing. In this paper, a more principled NCS, namely NCNES, is presented, showing that the parallel exploration is equivalent to a process of seeking probabilistic models that both lead to solutions of high quality and are distant from previous obtained probabilistic models. Reinforcement learning, for which exploration is of particular importance, are considered for empirical assessment. The proposed NCNES is applied to directly train a deep convolution network with 1.7 million connection weights for playing Atari games. Empirical results show that the significant advantages of NCNES, especially on games with uncertain and delayed rewards, can be highly owed to the effective parallel exploration ability.



2016 ◽  
Vol 21 (1) ◽  
pp. 33-43 ◽  
Author(s):  
Sofia Ribeirinho Leite ◽  
Cory David Barker ◽  
Marc G. Lucas




2012 ◽  
Author(s):  
Nicole Scott ◽  
Apostolos Georgopoulos ◽  
Maria Sera


2011 ◽  
Author(s):  
J. Karbach ◽  
S. Brieber


2007 ◽  
Author(s):  
Marco Sperduti ◽  
Ralf Veit ◽  
Andrea Caria ◽  
Paolo Belardinelli ◽  
Niels Birbaumer ◽  
...  


2013 ◽  
Author(s):  
Elke U. Weber ◽  
Anna C. van Duijvenvoorde ◽  
Leah H. Somerville ◽  
Alisa Powers ◽  
Wouter D. Weeda ◽  
...  




Sign in / Sign up

Export Citation Format

Share Document