In this paper we consider a systematic study of several new Lp-boundedness properties for the index 2F1-transform over spaces L?,p (R+), 1 ? p < ?, R, and L? (R+). We also obtain Parseval-type relations these spaces.

ABSTRACT In modern electronic circuits pose a reliability threat, a many applications are necessary to use protection against soft errors, there is no exceptions in the field of communications and signal processing systems. In new trend interesting option is to use Algorithmic Based Fault Tolerant techniques (ABFT) that try to develop the algorithmic properties to detect and correct the errors....

Recent studies focussed on the question whether less-configurational languages like German are harder to parse than English, or whether the lower parsing scores are an artefact of treebank encoding schemes and data structures, as claimed by Kübler et al. (2006). This claim is based on the assumption that PARSEVAL metrics fully reflect parse quality across treebank encoding schemes. In this pape...

In this paper, some new families of orthogonal functions in two variables produced by using Fourier transform bivariate polynomials and their orthogonality relations obtained from Parseval identity are introduced.

Ranked data sets, where m judges/voters specify a preference ranking of n objects/candidates, are increasingly prevalent in contexts such as political elections, computer vision, recommender systems, and bioinformatics. The vote counts for each can be viewed an n! vector lying on the permutahedron, which is Cayley graph symmetric group with vertices labeled by permutations edge when two differ ...

PARSEVAL, the default paradigm for evaluating constituency parsers, calculates parsing success (Precision/Recall) as a function of the number of matching labeled brackets across the test set. Nodes in constituency trees, however, are connected together to reflect important linguistic relations such as predicate-argument and direct-dominance relations between categories. In this paper, we presen...

We develop a unifying perspective on several decompositions exhibiting directional parabolic scaling. In each decomposition, the individual atoms are highly anisotropic at fine scales, with effective support obeying the parabolic scaling principle length ≈ width. Our comparisons allow to extend Theorems known for one decomposition to others. We start from a Continuous Curvelet Transform f → Γf ...

We consider classes of reconstruction systems (RS’s) for finite dimensional real or complex Hilbert spaces H, called group reconstruction systems (GRS’s), that are associated with representations of finite groups G. These GRS’s generalize frames with high degree of symmetry, such as harmonic or geometrically uniform ones. Their canonical dual and canonical Parseval are shown to be GRS’s. We est...