In the 1980s and 1990s, there was a major theoretical debate in the memory domain regarding the multiple memory systems and processing modes frameworks. The components of processing framework argued for a middle ground: Instead of neatly divided memory systems or processing modes, this framework proposed the existence of numerous processing components that are recruited in different combination...

Functional Data Analysis (FDA) has recently made considerable progress because of easier access to the data that are essentially in the form of curves. Although functional modeling of Iranian precipitation based on temperature or humidity was done before, here we use functional analysis of variance and covariance to analyze the weather data collected randomly from Iranian weather stations in 20...

in this paper, we prove the existence and uniqueness results to the random fractional functional differential equations under assumptions more general than the lipschitz type condition. moreover, the distance between exact solution and appropriate solution, and the existence extremal solution of the problem is also considered.

introduction: the most common manifestation of disturbed neurological function following stroke is motor weakness. muscle weakness has been implicated as a factor underlying deficits in gait performance in subjects who have suffered strokes . the purpose of this study was to investigate the relationship between involved lower extremity isometric muscle strength and two functional tasks: gait ab...

We argue that the possibility to observe a stable biaxial nematic phase in a binary mixture of prolate and oblate hard particles is seriously limited by the existence of entropydriven demixing. This result follows from a simple Onsager-type density functional theory. An important feature15 the coupling of the demixing mechanism to the orientational order of the system. The strength of this coup...

Constraints that are defined by tables of allowed tuples of assignments are common in constraint programming. In this paper we present an approach to reformulating table constraints of large arity into a conjunction of lower arity constraints. Our approach exploits functional dependencies. We study the complexity of finding reformulations that either minimize the memory size or arity of a const...