1.0 Is Cognition Discrete or Continuous? 1.1 Although I hate to haggle over words, Harnad's use ofànalog' confuses a number of issues. The problem begins with the phrasèanalog world' in the title, which does not correspond to any technical or nontechnical usage ofànalog' with which I'm familiar. Although I don't know precisely what he means byànalog', it is clearly related to the distinction be...

Communicated by the former editorial board e se™ondEorder —™™ur—te di'eren™e s™heme is developed to solve foussinesq sysE temF por the time integr—tionD — gr—nkExi™olson type s™heme is usedF „he error estim—tes for the numeri™—l solution —re o˜t—inedF xumeri™—l results —re —lso preE sentedF AMS 2010 Subject Classication: TSwHTD TSwIPD TSwISF Key words: foussinesq systemD di'eren™e s™hemeD error...

In this paper, a numerical solution of time fractional advection-dispersion equations are presented.The new implicit nite dierence methods for solving these equations are studied. We examinepractical numerical methods to solve a class of initial-boundary value fractional partial dierentialequations with variable coecients on a nite domain. Stability, consistency, and (therefore) convergenceof t...

In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...

A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...

29 computation. On the other hand, for network learning, at least 14-16 bits of precision must be used for the weights to avoid having the training process divert too much from the trajectory of the high precision computation. References [1] D. Hammerstrom. A VLSI architecture for high-performance, low cost, on-chip learning. Figure 10: The average squared dierences between the desired and actu...

In this article we have applied a numerical finite difference method to solve the Black-Scholes European and American option pricing both presented by fractional differential equations in time and asset.

diffusivity equation commonly used for pressure distribution prediction in porous media results from substituting equation of state and continuity equation in navier-stokes momentum equation. from mathematical point of view this equation format shows infinite propagation speed for pressure pulse through porous media, which is physically impossible. this issue may caused by numerous assumptions ...

In this paper, we intend to solve special kind of ordinary differential equations which is called Heun equations, by converting to a corresponding stochastic differential equation(S.D.E.). So, we construct a stochastic linear equation system from this equation which its solution is based on computing fundamental matrix of this system and then, this S.D.E. is solved by numerically methods. Moreo...

In this paper, for the numerical approximation of random partial differential equations (RPDEs) of parabolic type, an explicit higher order finite difference scheme is constructed. In continuation the main properties of deterministic difference schemes, i.e. consistency, stability and convergency are developed for the random cases. It is shown that the proposed random difference scheme has thes...