We initiate the study of pseudofiniteness in continuous logic. We introduce a related concept, namely that of pseudocompactness, and investigate the relationship between the two concepts. We establish some basic properties of pseudofiniteness and pseudocompactness and provide many examples. We also investigate the injective-surjective phenomenon for definable endofunctions in pseudofinite struc...

In a previous paper we introduce the concept of full d-stability, in this work several types of generalizations were introduced ; minimal (maximal) d-stable; fully pseudo d-stable and afd-stable module. A dual to the notion of terse module is, also, introduced namely d-terse and it is shown that it is coincide with fully pseudo d-stable.

This article evaluates the performance of two techniques for query reformulation in a system for information retrieval, namely, the concept based and the pseudo relevance feedback reformulation. The experiments performed on a corpus of Arabic text have allowed us to compare the contribution of these two reformulation techniques in improving the performance of an information retrieval system for...

This chapter focuses on real-world applications of fuzzy techniques for information retrieval and data mining. It gives a presentation of the theoretical background common to all applications, lying on two main elements: the concept of similarity and the fuzzy machine learning framework. It then describes a panel of real-world applications covering several domains namely medical, educational, c...

This paper deals with a new class of sets namely, Tc fuzzy sets in fuzzy topological spaces (via)  sets. Some characterizations and properties of these sets are investigated. Further, we introduce the concept of Tc fuzzy continuous and Tc fuzzy irresolute mappings.

This work presents a novel concept in stochastic optimization, namely, the notion of forward performance. As an application, we analyze a portfolio management problem with exponential criteria. Under minimal model assumptions we explicitly construct the forward performance process and the associated optimal wealth and asset allocations. For various model parameters, we recover a range of invest...

The concept of tree-based picture generation is introduced. It is shown that there are equivalent tree-based deenitions of four picture-generating devices known from the literature, namely collage grammars, mutually recursive function systems, context-free chain-code grammars, and 0L-systems with turtle interpretation. Furthermore, generalisations of each of these systems are discussed.

Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual methods for constructing cyclic subspace codes over finite fields works for m-quasi cyclic codes, namely the subspaces polynomials and Frobenius mappings.

We extend the concept of two-level fingerprinting codes, introduced by Anthapadmanabhan and Barg (2009) in context of traceability (TA) codes [1], to other types of fingerprinting codes, namely identifiable parent property (IPP) codes, secure-frameproof (SFP) codes, and frameproof (FP) codes. We define and propose the first explicit non-trivial construction for two-level IPP, SFP and FP codes.

This paper analyses the performance of a genetic algorithm using a new concept, namely a fractional-order dynamic fitness function, for the synthesis of combinational logic circuits. The experiments reveal superior results in terms of speed and convergence to achieve a solution. Keywords— Circuit Design, Fractional-Order Systems, Genetic Algorithms, Logic Circuits.