Giving up on convergence and autonomy: Why the theories of psychology and neuroscience are codependent as well as irreconcilable

There is a long-standing debate in the philosophy of mind and philosophy of science regarding how best to interpret the relationship between neuroscience and psychology. It has traditionally been argued that either the two domains will evolve and change over time until they converge on a single unified account of human behaviour, or else that they will continue to work in isolation given that they identify properties and states that exist autonomously from one another (due to the multiple-realizability of psychological states). In this paper, I argue that progress in psychology and neuroscience is contingent on the fact that both of these positions are false. Contra the convergence position, I argue that the theories of psychology and the theories of neuroscience are scientifically valuable as representational tools precisely because they cannot be integrated into a single account. However, contra the autonomy position, I propose that the theories of psychology and neuroscience are deeply dependent on one another for further refinement and improvement. In this respect, there is an irreconcilable codependence between psychology and neuroscience that is necessary for both domains to improve and progress. The two domains are forever linked while simultaneously being unable to integrate.     

基于进化规划算法的背包问题求解研究

背包问题是一个具有较强应用价值的NP完全问题.如何设计求解此类问题的算法,则具有很强的实用价值和理论意义.目前已有很多的求解方法,但背包问题并没有完全解决.本文在启发式算法的理论基础上,改进了进化规划算法求解背包问题,此方法简单通用、易于操作.数值实验表明该方法具有较高的准确率,能较快的收敛到全局最优点.     

带NCP函数的滤子SQP方法

提出了一种解约束非线性规划问题的算法,这种算法主要基于信赖域SQP方法,不需要使用罚函数作为价值函数,而是使用滤子去判断迭代点是否有效,从而解决了罚参数难选择的问题。同时还结合了NCP函数,使得最优点满足非线性互补条件。最后,从理论上分析了算法的全局收敛性,并通过数值试验说明本算法是有效的。     

一种新的改进遗传算法——混合式遗传算法

针对遗传算法应用的局限性,把模糊思想应用到大变异操作中,提出了模糊大变异操作;并结合自适应遗传算法、最佳选择策略机制和过滤操作的思想,提出了一种新的遗传算法结构--混合式遗传算法(hybridgeneticalgorithm,HGA).HGA不仅保证了算法的全局收敛性,而且提高了算法的收敛速度和稳定性.算例验证了算法的优越性能.     

A Class of Fast Algorithms in Real-Time Simulation

1.INTRODUCTIONThepartofthesystemisoftenreplacedbyamathematicalmodelinareal-timesimulationsystem.Inordertoimplementtheclassofsimulation,everystepofthesimulationproceduremustbedonequicklysothatitsatisfiesphysicalsubsystems'sexecution11].Withrequestsofthedevelopmentofscienceresearchandlargeprojects'design,real-timesimulationhasbeenappliedextensivelyinaviation,aerospace,nuclearindustry,electronicindustry,andsoon,suchasreal-timesimulationofthecontrolsystemofaircrafts,real--timesimulationofmissi…     

实连续函数列的三种不同收敛性研究

本文主要研究单位闭区间到自身的连续函数组成的函数列上的三种不同的收敛：点态收敛,一致收敛,Hausdorff收敛之间的关系,并得到相应的结果。     

Benjamin-Bona-Mahony方程的一个高精度线性差分格式

本文对一类带有齐次边界条件的Benjamin-Bona-Mahony方程的初边值问题进行了数值研究,提出了一个理论精度为O(τ~2+h~4)的三层线性差分格式,并利用能量方法分析了该格式的收敛性与稳定性.该格式合理地模拟了原问题的一个守恒性质.数值实验表明该方法是可靠的.     

快速模拟退火算法用于MESFET大信号建模

对快速模拟退火算法的关键参数进行确定，将该算法应用于微波半导体大信号建模，解决了多变量非线性优化难题，实验结果表明该方法是有效的。从而为解决ＭＥＳＦＥＴ（ＭｅｔａｌＳｅｍ ｉｃｏｎｄｕｃｔｏｒ Ｆｉｅｌｄ ＥｆｆｅｃｔＴｒａｎｓｉｓｔｏｒ）大信号建模问题提供了一种新思路。     

块AOR,块SOR和块JOR迭代法的收敛性

本文引进块Jacobi迭代矩阵B的优矩阵(?),来研究解线性方程组的块AOR、块SOR和块JOR迭代法的收敛性。即若‖·‖是矩阵的某个相容范数。且‖B_(ij)‖(?)β_(ij),i,j=1,…,m,则令(?)=(β_(ij))。利用(?),我们给出了块AOR(0(?)γ<2/[1+ρ(?)]),0<ω相似文献   

关于推广Polak算法模型收敛性定理的改进

本文改进了 Polak 定理[1]的收敛性条件。