A Brief Story about the Operators of the Generalized Fractional Calculus

2000 Mathematics Subject Classification: 26A33, 33C60, 44A20

Driving licensing renewal policy using neural network-based probabilistic decision support system

This paper investigates neural network-based probabilistic decision support system to assess drivers' knowledge for the objective of developing a renewal policy of driving licences. The probabilistic model correlates drivers' demographic data to their results in a simulated written driving exam (SWDE). The probabilistic decision support system classifies drivers' into two groups of passing and failing a SWDE. Knowledge assessment of drivers within a probabilistic framework allows quantifying and incorporating uncertainty information into the decision-making system. The results obtained in a Jordanian case study indicate that the performance of the probabilistic decision support systems is more reliable than conventional deterministic decision support systems. Implications of the proposed probabilistic decision support systems on the renewing of the driving licences decision and the possibility of including extra assessment methods are discussed.

Probabilistic DHP adaptive critic for nonlinear stochastic control systems

Following the recently developed algorithms for fully probabilistic control design for general dynamic stochastic systems (Herzallah & Káarnáy, 2011; Kárný, 1996), this paper presents the solution to the probabilistic dual heuristic programming (DHP) adaptive critic method (Herzallah & Káarnáy, 2011) and randomized control algorithm for stochastic nonlinear dynamical systems. The purpose of the randomized control input design is to make the joint probability density function of the closed loop system as close as possible to a predetermined ideal joint probability density function. This paper completes the previous work (Herzallah & Kárnáy, 2011; Kárný, 1996) by formulating and solving the fully probabilistic control design problem on the more general case of nonlinear stochastic discrete time systems. A simulated example is used to demonstrate the use of the algorithm and encouraging results have been obtained.

Fractional Calculus of P-transforms

MSC 2010: 44A20, 33C60, 44A10, 26A33, 33C20, 85A99

A Poster about the Recent History of Fractional Calculus

MSC 2010: 26A33, 05C72, 33E12, 34A08, 34K37, 35R11, 60G22

A Poster about the Old History of Fractional Calculus

MSC 2010: 26A33, 05C72, 33E12, 34A08, 34K37, 35R11, 60G22

Professor Rudolf Gorenflo and his Contribution to Fractional Calculus

MSC 2010: 26A33 Dedicated to Professor Rudolf Gorenflo on the occasion of his 80th anniversary

Matrix-Variate Statistical Distributions and Fractional Calculus

MSC 2010: 15A15, 15A52, 33C60, 33E12, 44A20, 62E15 Dedicated to Professor R. Gorenflo on the occasion of his 80th birthday

Self-adaptive probabilistic roadmap generation for intelligent virtual agents

Agents inhabiting large scale environments are faced with the problem of generating maps by which they can navigate. One solution to this problem is to use probabilistic roadmaps which rely on selecting and connecting a set of points that describe the interconnectivity of free space. However, the time required to generate these maps can be prohibitive, and agents do not typically know the environment in advance. In this paper we show that the optimal combination of different point selection methods used to create the map is dependent on the environment, no point selection method dominates. This motivates a novel self-adaptive approach for an agent to combine several point selection methods. The success rate of our approach is comparable to the state of the art and the generation cost is substantially reduced. Self-adaptation therefore enables a more efficient use of the agent's resources. Results are presented for both a set of archetypal scenarios and large scale virtual environments based in Second Life, representing real locations in London.

Generalized Fractional Calculus, Special Functions and Integral Transforms: What is the Relation?

Виржиния С. Кирякова - В този обзор илюстрираме накратко наши приноси към обобщенията на дробното смятане (анализ) като теория на операторите за интегриране и диференциране от произволен (дробен) ред, на класическите специални функции и на интегралните трансформации от лапласов тип. Показано е, че тези три области на анализа са тясно свързани и взаимно индуцират своето възникване и по-нататъшно развитие. За конкретните твърдения, доказателства и примери, вж. Литературата.

Some Probabilistic Results in a Bisexual Branching Process with Immigration

2000 Mathematics Subject Classification: 60J80.

Probabilistic Approach to Design of Large Antenna Arrays

2000 Mathematics Subject Classification: 78A50

Probabilistic Models in Cryptography, Coding Theory and Tests for PRNG

2000 Mathematics Subject Classification: 94A29, 94B70

A Refinement of some Overrelaxation Algorithms for Solving a System of Linear Equations

In this paper we propose a refinement of some successive overrelaxation methods based on the reverse Gauss–Seidel method for solving a system of linear equations Ax = b by the decomposition A = Tm − Em − Fm, where Tm is a banded matrix of bandwidth 2m + 1. We study the convergence of the methods and give software implementation of algorithms in Mathematica package with numerical examples. ACM Computing Classification System (1998): G.1.3.

Weak and Semi Compatible Maps in Probabilistic Metric Space Using Implicit Relation

2000 Mathematics Subject Classification: 54H25, 47H10.