The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 121 –
140 of
182
Codd defined the relational algebra [E.F. Codd, Communications of the ACM13 (1970) 377–387;
E.F. Codd, Relational completeness of data base sublanguages, in Data Base Systems, R. Rustin, Ed.,
Prentice-Hall (1972) 65–98] as the
algebra with operations projection, join, restriction, union and
difference. His projection operator can drop, permute and repeat
columns of a relation. This permuting and repeating of columns does
not really add expressive power to the relational algebra. Indeed,
...
A new information system representation, which inherently represents indiscernibility is presented. The basic structure of this representation is a Binary Decision Diagram. We offer testing results for converting large data sets into a Binary Decision Diagram Information System representation, and show how indiscernibility can be efficiently determined. Furthermore, a Binary Decision Diagram is used in place of a relative discernibility matrix to allow for more efficient determination of the discernibility...
Los campos escalares, bidimensionales y dependientes del tiempo, se representan generalmente en Meteorología mediante una sucesión de imágenes o análisis separados con una interdistancia temporal adecuada. Esta técnica alcanza su máximo desarrollo en lo que se conoce como gráfico animado.En el presente artículo se describen brevemente los procesos que, a partir de los datos, culminan con la generación de un análisis, imagen o fotograma, particularizando al caso de episodios de lluvia. Tras un resumen...
In this paper the execution of Fuzzy Knowledge Bases in the truth space is briefly analyzed. The computational efficiency of the process is significantly increased by means of a parameterized description based on the linguistic truth values described by Baldwin. This permits executing the Fuzzy Knowledge Base through operations involving only simple numerical values, thus avoiding the direct analytic manipulation of possibility distributions. A Petri Net-based formalism that permits representing...
Soient et un sous-système. est une représentation en base d’une fonction du tore si pour tout point du tore, ses développements en base sont liés par le couplage aux développements en base de . On prouve que si est représentable en base alors , où . Réciproquement, toutes les fonctions de ce type sont représentables en base par un transducteur. On montre finalement que les fonctions du tore qui peuvent être représentées par automate cellulaire sont exclusivement les multiplications...
In the group theory various representations of free groups are used. A representation of a free group of rank two by the so-calledtime-varying Mealy automata over the changing alphabet is given. Two different constructions of such automata are presented.
Si dà una formalizzazione dei moduli e delle reti modulari a struttura variabile. Si dimostra che per ogni automa finito a struttura variabile esiste una rete modulare a struttura variabile che lo simula. Si stabilisce il legame tra un automa a struttura variabile e l'automa a struttura variabile associato a una rete modulare a struttura variabile che lo simula.
Currently displaying 121 –
140 of
182