Fractional calculus (FC) generalizes standard integrals and derivatives to non-integer or even to complex order [Diethelm, 2010], [Kilbas et al., 2006], [Klimek, 2009], [Miller & Ross, 1993], [Oldham & Spanier, 1974], [Podlubny, 1999], [Samko et al., 1993]. During the last decade it was found that FC plays a fundamental role in the modelling of a considerable number of phenomena characterized b...

We prove that the interaction among neutral atoms in ThomasFermi theory behaves, for large separation I, like Π~. The constant Γ is independent of the atomic nuclear charges, but does depend on the relative positions of the nuclei. We also show that Γ is not a simple sum of pair terms, i.e. in TF theory three and higher body terms persist into the asymptotic (in /) region.

Gudrun Bachmann, University of Basel, Switzerland Peter Baumgartner, Fern-University of Hagen, Germany Claudia Bremer, University of Frankfurt/Main, Germany Rafael Corchuelo, University of Sevilla, Spain Gregor Engels, University of Paderborn, Germany Andreas Holzinger, University of Graz, Austria Ali R. Hurson, Pennsylvania State University, USA Reinhard Keil-Slawik, University of Paderborn, G...

Lognormal random variables appear naturally in many engineering disciplines, including wireless communications, reliability theory, and finance. So, too, does the sum of (correlated) lognormal random variables. Unfortunately, no closed form probability distribution exists for such a sum, and it requires approximation. Some approximation methods date back over 80 years and most take one of two a...

Journal of Experimental & Theoretical Artificial Intelligence Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713723652 Meta-case-based reasoning: self-improvement through self-understanding J. William Murdock a; Ashok K. Goel b a IBM Watson Research Center, 19 Skyline Drive, Hawthorne, NY 10532, USA b Artific...

The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, it has been used almost exclusively for propositional logic so far because of its highly inefficient treatment of quantifiers, based on instantiation into ground formulas. The recent FDPLL calculus by Baumgartner was ...

Parallel implementation of algorithm of numerical solution of Navier-Stokes equations for large eddy simulation (LES) of turbulence is presented in this research. The Dynamic Smagorinsky model is applied for sub-grid simulation of turbulence. The numerical algorithm was worked out using a scheme of splitting on physical parameters. At the first stage it is supposed that carrying over movement a...

In this paper, we rst show that there are several equivalent keys for t + 1 chosen plaintexts if the degree of the reduced cipher is t?1. This is against the claim by Jakobsen and Knudsen. We also derive an upper bound on the number of equivalent last round keys for t + 1 chosen plaintexts. We further show an eecient method which nds all the equivalent keys by using Rabin's root nding algorithm...

A matching covered graph is a nontrivial connected graph in which every edge is in some perfect matching. A matching covered graph G is near-bipartite if it is nonbipartite and there is a removable double ear R such that G−R is matching covered and bipartite. In 2000, C. Little and I. Fischer characterized Pfaffian near-bipartite graphs in terms of forbidden subgraphs [3]. However, their charac...

This paper investigates spectral contrast enhancement techniques and their implementation complexity. Three algorithms are dealt with in this paper. The first is the method described by Baer, Moore and Gatehouse. Two alternative methods are also proposed and investigated in this paper from a practical application and implementation point of view. Theoretical analyses and results from laboratory...