Determinación de reglas de decisión mediante redes de neuronas artificiales
Détermination de la représentation standard d'une série reconnaissable
Determination of the number of texture segments using wavelets.
Deterministic blow-ups of minimal NFA's
The paper treats the question whether there always exists a minimal nondeterministic finite automaton of n states whose equivalent minimal deterministic finite automaton has α states for any integers n and α with n ≤ α ≤ 2n. Partial answers to this question were given by Iwama, Kambayashi, and Takaki (2000) and by Iwama, Matsuura, and Paterson (2003). In the present paper, the question is completely solved by presenting appropriate automata for all values of n and α. However, in order to...
Deux constructions équivalentes d'un jeu d'arrangements pour les fichiers inverses multi-indices
Deux méthodes et quatre programmes automatiques de calcul de la fiabilité des circuits
Deux problèmes d'analyse d'algorithmes
Deux propriétés combinatoires du langage de Lukasiewicz
Deux remarques sur un théorème de S. Eilenberg
Developing a Metadata Exchange Format for Mathematical Literature
This paper describes an effort to develop a metadata element set for the exchange of descriptive metadata about mathematical literature. The approach taken uses the Dublin Core Application Profile (DCAP) framework, based on the DC Abstract Model. A fully developed DCAP for mathematical literature would be valuable, as both a guide and constraint in the creation of metadata records suitable for harvesting via OAI or sharing through other means. Adhering to the DCAP model would also enhance global...
Developing a procedure to transfer geometrical constraints from the plane into space.
Development of the Stock Exchange Information System
DFIS: A novel data filling approach for an incomplete soft set
The research on incomplete soft sets is an integral part of the research on soft sets and has been initiated recently. However, the existing approach for dealing with incomplete soft sets is only applicable to decision making and has low forecasting accuracy. In order to solve these problems, in this paper we propose a novel data filling approach for incomplete soft sets. The missing data are filled in terms of the association degree between the parameters when a stronger association exists between...
Diagonalization in proof complexity
We study diagonalization in the context of implicit proofs of [10]. We prove that at least one of the following three conjectures is true: ∙ There is a function f: 0,1* → 0,1 computable in that has circuit complexity . ∙ ≠ co . ∙ There is no p-optimal propositional proof system. We note that a variant of the statement (either ≠ co or ∩ co contains a function hard on average) seems to have a bearing on the existence of good proof complexity generators. In particular, we prove that if a minor variant...
Diagrammes de Penrose et réécriture en dimension
Diameter, Width, Closest Line Pair, and Parametric Searching.
Diamètre de graphes et qualité de service d'un réseau de données
Dicovering spaces.
Die Analyse von empirisch verteilten Zufallsgrössen auf dem Analogrechner
Die Berechnungskomplexität von elementarsymmetrischen Funkit