Representations of Inverse Functions by the Integral Transform with the Sign Kernel

Mathematics Subject Classification: Primary 30C40

On q-Laplace Transforms of the q-Bessel Functions

Mathematics Subject Classification: 33D15, 44A10, 44A20

Caputo-Type Modification of the Erdélyi-Kober Fractional Derivative

2000 Math. Subject Classification: 26A33; 33E12, 33E30, 44A15, 45J05

On q–Analogues of Caputo Derivative and Mittag–Leffler Function

Mathematics Subject Classification: 33D60, 33E12, 26A33

On a Class of Fractional Type Integral Equations in Variable Exponent Spaces

2000 Mathematics Subject Classification: 45A05, 45B05, 45E05,45P05, 46E30

Design of Fractional Order Digital Differentiators and Integrators Using Indirect Discretization

Mathematics Subject Classification: 26A33, 93B51, 93C95

A Brief Story about the Operators of the Generalized Fractional Calculus

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

Fractional Integration and Fractional Differentiation of the M-Series

Mathematics Subject Classification: 26A33, 33C60, 44A15

Construction and evaluation of achievement tests In English

Доклад, поместен в сборника на Националната конференция "Образованието в информационното общество", Пловдив, май, 2011 г.

Use of Start Pages for Building a Mashup Personal Learning Environment to Support Self-Organized Learners

The paper explores the functionalities of eight start pages and considers their usefulness when used as a mashable platform for deployment of personal learning environments (PLE) for self-organized learners. The Web 2.0 effects and eLearning 2.0 strategies are examined from the point of view of how they influence the methods of gathering and capturing data, information and knowledge, and the learning process. Mashup technology is studied in order to see what kind of components can be used in PLE realization. A model of a PLE for self-organized learners is developed and it is used to prototype a personal learning and research environment in the start pages Netvibes, Pageflakes and iGoogle.

On Extremal Binary Doubly-Even Self-Dual Codes of Length 88*

In this paper we present 35 new extremal binary self-dual doubly-even codes of length 88. Their inequivalence is established by invariants. Moreover, a construction of a binary self-dual [88, 44, 16] code, having an automorphism of order 21, is given.

Methods for Investigation of Dependencies between Attributes in Databases

This paper surveys research in the field of data mining, which is related to discovering the dependencies between attributes in databases. We consider a number of approaches to finding the distribution intervals of association rules, to discovering branching dependencies between a given set of attributes and a given attribute in a database relation, to finding fractional dependencies between a given set of attributes and a given attribute in a database relation, and to collaborative filtering.

The Computational Analysis of Bulgarian Dialect Pronunciation

The paper presents a computational analysis of Bulgarian dialect variation, concentrating on pronunciation differences. It describes the phonetic data set compiled during the project* ‘Measuring Linguistic Unity and Diversity in Europe’ that consists of the pronunciations of 157 words collected at 197 sites from all over Bulgaria. We also present the results of analyzing this data set using various quantitative methods and compare them to the traditional scholarship on Bulgarian dialects. The results have shown that various dialectometrical techniques clearly identify east-west division of the country along the ‘jat’ border, as well as the third group of varieties in the Rodopi area. The rest of the groups specified in the traditional atlases either were not confirmed or were confirmed with a low confidence.

An Observation about Variations of the Diffie-Hellman Assumption

We generalize the Strong Boneh-Boyen (SBB) signature scheme to sign vectors; we call this scheme GSBB. We show that if a particular (but most natural) average case reduction from SBB to GSBB exists, then the Strong Diffie-Hellman (SDH) and the Computational Diffie-Hellman (CDH) have the same worst-case complexity.

Computing with the Square Root of NOT

To the two classical reversible 1-bit logic gates, i.e. the identity gate (a.k.a. the follower) and the NOT gate (a.k.a. the inverter), we add an extra gate, the square root of NOT. Similarly, we add to the 24 classical reversible 2-bit circuits, both the square root of NOT and the controlled square root of NOT. This leads to a new kind of calculus, situated between classical reversible computing and quantum computing.