Search results for "REPRESENTATION"

Conjunction, Disjunction and Iterated Conditioning of Conditional Events

2013

Starting from a recent paper by S. Kaufmann, we introduce a notion of conjunction of two conditional events and then we analyze it in the setting of coherence. We give a representation of the conjoined conditional and we show that this new object is a conditional random quantity, whose set of possible values normally contains the probabilities assessed for the two conditional events. We examine some cases of logical dependencies, where the conjunction is a conditional event; moreover, we give the lower and upper bounds on the conjunction. We also examine an apparent paradox concerning stochastic independence which can actually be explained in terms of uncorrelation. We briefly introduce the…

New Representations for Multidimensional Functions Based on Kolmogorov Superposition Theorem. Applications on Image Processing

2012

Mastering the sorting of the data in signal (nD) can lead to multiple applications like new compression, transmission, watermarking, encryption methods and even new processing methods for image. Some authors in the past decades have proposed to use these approaches for image compression, indexing, median filtering, mathematical morphology, encryption. A mathematical rigorous way for doing such a study has been introduced by Andrei Nikolaievitch Kolmogorov (1903-1987) in 1957 and recent results have provided constructive ways and practical algorithms for implementing the Kolmogorov theorem. We propose in this paper to present those algorithms and some preliminary results obtained by our team…

Design of Representations and Search Operators

2015

Successful and efficient use of evolutionary algorithms depends on the choice of genotypes and the representation – that is, the mapping from genotype to phenotype – and on the choice of search operators that are applied to the genotypes. These choices cannot be made independently of each other. This chapter gives recommendations on the design of representations and corresponding search operators and discusses how to consider problem-specific knowledge. For most problems in the real world, similar solutions have similar fitness values. This fact can be exploited by evolutionary algorithms if they ensure that the representations and search operators used are defined in such a way that simila…

Representations for evolutionary algorithms

2015

Successful and efficient use of evolutionary algorithms (EA) depends on the choice of the genotype, the problem representation (mapping from genotype to phenotype) and on the choice of search operators that are applied to the genotypes. These choices cannot be made independently of each other. The question whether a certain representation leads to better performing EAs than an alternative representation can only be answered when the operators applied are taken into consideration. The reverse is also true: deciding between alternative operators is only meaningful for a given representation. In EA practice one can distinguish two complementary approaches. The first approach uses indirect repr…

Descriptional and Computational Complexity of the Circuit Representation of Finite Automata

2018

In this paper we continue to investigate the complexity of the circuit representation of DFA—BC-complexity. We compare it with nondeterministic state complexity, obtain upper and lower bounds which differ only by a factor of 4 for a Binary input alphabet. Also we prove that many simple operations (determining if a state is reachable or if an automaton is minimal) are PSPACE-complete for DFA given in circuit representation.

Relations frequency hypermatrices in mutual, conditional and joint entropy-based information indices.

2012

Graph-theoretic matrix representations constitute the most popular and significant source of topological molecular descriptors (MDs). Recently, we have introduced a novel matrix representation, named the duplex relations frequency matrix, F, derived from the generalization of an incidence matrix whose row entries are connected subgraphs of a given molecular graph G. Using this matrix, a series of information indices (IFIs) were proposed. In this report, an extension of F is presented, introducing for the first time the concept of a hypermatrix in graph-theoretic chemistry. The hypermatrix representation explores the n-tuple participation frequencies of vertices in a set of connected subgrap…

A performative paradigm for post-qualitative inquiry

2021

In this article, the authors explore and contribute to producing a performative research paradigm where post-qualitative as well as artistic research might dwell and breathe. Entering a thread of discussion that started with Haseman’s A manifesto for performative research in 2006, and building on their own friction-led research processes at the edges of qualitative research, the authors plug in with performativity, non-representational theories and methodologies, post-qualitative inquiry and post approaches. A performative paradigm for post-qualitative inquiry is proposed, where knowledge is viewed as knowledge-in-becoming as the constant creation of difference through researcher entanglem…

The tangible common denominator of substance use disorders: a reply to commentaries to Rehm et al. (2013a)

2014

In response to our suggestion to define substance use disorders via ‘heavy use over time’, theoretical and conceptual issues, measurement problems and implications for stigma and clinical practice were raised. With respect to theoretical and conceptual issues, no other criterion has been shown, which would improve the definition. Moreover, heavy use over time is shown to be highly correlated with number of criteria in current DSM-5. Measurement of heavy use over time is simple and while there will be some underestimation or misrepresentation of actual levels in clinical practice, this is not different from the status quo and measurement of current criteria. As regards to stigma, research ha…

Neural Network Based Finite-Time Stabilization for Discrete-Time Markov Jump Nonlinear Systems with Time Delays

2013

Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2013/359265 Open Access This paper deals with the finite-time stabilization problem for discrete-time Markov jump nonlinear systems with time delays and norm-bounded exogenous disturbance. The nonlinearities in different jump modes are parameterized by neural networks. Subsequently, a linear difference inclusion state space representation for a class of neural networks is established. Based on this, sufficient conditions are derived in terms of linear matrix inequalities to guarantee stochastic finite-time boundedness and stochastic finite-time stabi…

Tourism, language and globalization. A linguistic representation of St. Petersburg in Lonely Planet’s web site

Teaching foreign languages for specific purposes holds an importance that, at the present time, it is extended widely to the field of the tourism industry which uses natural languages to create a shared metalanguage. The languages used to describe a tourism destination are particularly interesting because they build up a tourism’s representation of the town in order to pilot the travellers’ choices. In this context, tour guides represent an interesting example because they offer to the learner-reader the possibility to explore the richness of a foreign language. This study proposes an analysis of St. Petersburg’s tourist guide contained in the Lonely Planet web magazine in the English langu…