Search results for "Termini"

Security of public key cryptosystems based on Chebyshev Polynomials

2004

Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper we study a public key cryptosystem based on such polynomials, which provides both encryption and digital signature. The cryptosystem works on real numbers and is quite efficient. Unfortunately, from our analysis it comes up that it is not secure. We describe an attack which permits to recover the corresponding plaintext from a given ciphertext. The same attack can be applied to produce forgeries …

Superlinear advantage for exact quantum algorithms

2012

A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms. For total Boolean functions in the query model, the biggest known gap was just a factor of 2: PARITY of N inputs bits requires $N$ queries classically but can be computed with N/2 queries by an exact quantum algorithm. We present the first example of a Boolean function f(x_1, ..., x_N) for which exact quantum algorithms have superlinear advantage over the deterministic algorithms. Any deterministic algorithm that computes our function must use N qu…

Exact affine counter automata

2017

We introduce an affine generalization of counter automata, and analyze their ability as well as affine finite automata. Our contributions are as follows. We show that there is a language that can be recognized by exact realtime affine counter automata but by neither 1-way deterministic pushdown automata nor realtime deterministic k-counter automata. We also show that a certain promise problem, which is conjectured not to be solved by two-way quantum finite automata in polynomial time, can be solved by Las Vegas affine finite automata. Lastly, we show that how a counter helps for affine finite automata by showing that the language MANYTWINS, which is conjectured not to be recognized by affin…

Complexity of probabilistic versus deterministic automata

2005

Ambiguity and complementation in recognizable two-dimensional languages

2008

The theory of one-dimensional (word) languages is well founded and investigated since fifties. From several years, the increasing interest for pattern recognition and image processing motivated the research on two-dimensional or picture languages, and nowadays this is a research field of great interest. A first attempt to formalize the concept of finite state recognizability for two-dimensional languages can be attributed to Blum and Hewitt ([7]) who started in 1967 the study of finite state devices that can define two-dimensional languages, with the aim to finding a counterpart of what regular languages are in one dimension. Since then, many approaches have been presented in the literature…

Over the Cuckoo’s Nest : Towards a Nordic Model of the Responsible University?

2019

AbstractThis concluding chapter takes stock of the major elements, both empirical and conceptual, that underpin the case chapters presented in the book. The chapter is organised in three distinct sections. First, addressing a largely scientific audience, the chapter attempts to make conceptual sense of the findings from an organisational theory perspective. Second, it shifts focus to the wider community of practitioners (policy makers, advisers, university managers and administrators, etc.) by shedding light on the practical implications of the volume’s core findings for both policy and practice. Third, the chapter once again addresses an academic audience by sketching out the road ahead re…

Distance-constrained data clustering by combined k-means algorithms and opinion dynamics filters

2014

Data clustering algorithms represent mechanisms for partitioning huge arrays of multidimensional data into groups with small in–group and large out–group distances. Most of the existing algorithms fail when a lower bound for the distance among cluster centroids is specified, while this type of constraint can be of help in obtaining a better clustering. Traditional approaches require that the desired number of clusters are specified a priori, which requires either a subjective decision or global meta–information knowledge that is not easily obtainable. In this paper, an extension of the standard data clustering problem is addressed, including additional constraints on the cluster centroid di…

Comparison of Internal Clustering Validation Indices for Prototype-Based Clustering

2017

Clustering is an unsupervised machine learning and pattern recognition method. In general, in addition to revealing hidden groups of similar observations and clusters, their number needs to be determined. Internal clustering validation indices estimate this number without any external information. The purpose of this article is to evaluate, empirically, characteristics of a representative set of internal clustering validation indices with many datasets. The prototype-based clustering framework includes multiple, classical and robust, statistical estimates of cluster location so that the overall setting of the paper is novel. General observations on the quality of validation indices and on t…

RVVS 2013

2013

On the divide between animate and inanimate

2015

Vitalism was abandoned already for a long time ago, yet the impression that animate beings differ in some fundamental way from inanimate objects continues to thrive. Here, we argue that scale free patterns, found throughout nature, present convincing evidence that this demarcation is only imaginary. Therefore, all systems ought to be regarded alike, i.e., all are consuming free energy in least time. This way evolutionary processes can be understood as a series of changes from one state to another, so that flows of energy themselves naturally select those ways and means, such as species and societies or gadgets and galaxies to consume free energy in the least time in quest of attaining therm…