Caches hide the growing latency of accesses to the main memory from the processor by storing the most recently used data on-chip. To limit the search time through the caches, they are organized in a direct mapped or set-associative way. Such an organization introduces many conflict misses that hamper performance. This paper studies randomizing set index functions, a technique to place the data ...

We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a rule might be “IF HOUSEHOLDSIZE={Two OR Tree} AND OCCUPATION={Professional OR Clerical} THEN PAYMENT_METHOD={CashCheck (Max=249) OR DebitCard (Max=175)}. The table semantics is supposed to be represented by a frequen...

A generating IFS of a Cantor set F is an IFS whose attractor is F . For a given Cantor set such as the middle-3rd Cantor set we consider the set of its generating IFSs. We examine the existence of a minimal generating IFS, i.e. every other generating IFS of F is an iterating of that IFS. We also study the structures of the semi-group of homogeneous generating IFSs of a Cantor set F in R under t...

we analyze some properties of the distribution $q_{g,k}$ of the first component in a $k$-tuple chosen uniformly‎ ‎in the set of all the $k$-tuples generating a finite group $g$ (the limiting distribution of the product replacement algorithm)‎. ‎in particular‎, ‎we concentrate our attention on‎ ‎the study of the variation distance $beta_k(g)$ between $q_{g,k}$ and the uniform distribution‎. ‎we ...

If X is an n-element set, we call a family G ⊂ PX a k-generator for X if every x ⊂ X can be expressed as a union of at most k disjoint sets in G. Frein, Lévêque and Sebő [10] conjectured that for n > 2k, the smallest k-generators for X are obtained by taking a partition of X into classes of sizes as equal as possible, and taking the union of the power-sets of the classes. We prove this conjectu...

1. Bourke, P.: An Introduction to fractals ,http://paulbourke.net/fractals/fracintro/ 2. Gangopadhyay, T. The effect of multiple rotations on Mobius transformations in generating IFS Fractalss, International journal of Computer Applications 142(6):18-22, May 2016 3. Julia, G. Mémoire sur l'itération des fonctions rationnelles, Journal de Mathématiques Pures et Appliquées, 1918 4. Krantz, S. G. ...

This chapter presents a generic scheme for generating prediction rules based on rough set approach for stock market prediction. To increase the efficiency of the prediction process, rough sets with Boolean reasoning discretization algorithm is used to discretize the data. Rough set reduction technique is applied to find all the reducts of the data, which contains the minimal subset of attribute...

—Let f be an interval-valued fuzzy subset of a nite set U of size n. This yields n closed intervals inside the unit interval. Picking a point in each interval and dividing by the sum of the points gives rise to a probability density on the set of intervals. For a given measure of dispersion, such as entropy, the problem is to pick points that maximize (or minimize) this dispersion. The particul...

Elementary flux modes give a mathematical representation of metabolic pathways in metabolic networks satisfying the constraint of non-decomposability. The large cost of their computation shifts attention to computing a minimal generating set which is a conically independent subset of elementary flux modes. When a metabolic network has reversible reactions and also admits a reversible pathway, t...

For a finite state automaton, a synchronizing sequence is an input sequence that takes all the states to the same state. Checking the existence of a synchronizing sequence and finding a synchronizing sequence, if one exists, can be performed in polynomial time. However, the problem of finding a shortest synchronizing sequence is known to be NP-hard. In this work, the usefulness of Answer Set Pr...