New Applications of Random Sampling in Computational Geometry.
New applications of the wreath product of forest algebras
We give several new applications of the wreath product of forest algebras to the study of logics on trees. These include new simplified proofs of necessary conditions for definability in CTL and first-order logic with the ancestor relation; a sequence of identities satisfied by all forest languages definable in PDL; and new examples of languages outside CTL, along with an application to the question of what properties are definable in both CTL and LTL.
New aspects about using neural networks in integrated numerical circuits and systems.
New aspects on extraction of fuzzy rules using neural networks.
In previous works, we have presented two methodologies to obtain fuzzy rules in order to describe the behaviour of a system. We have used Artificial Neural Netorks (ANN) with the Backpropagation algorithm, and a set of examples of the system. In this work, some modifications which allow to improve the results, by means of an adaptation or refinement of the variable labels in each rule, or the extraction of local rules using distributed ANN, are showed. An interesting application on the assignement...
New bounds for codes identifying vertices in graphs.
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains.
New bounds for oblivious mesh routing.
New complexity results for time-constrained dynamical optimal path problems.
New filtering technique for the impulsive noise reduction in color images.
New lower bound on the number of ternary square-free words.
New norm type inequalities for linear mappings.
New recursive characterizations of the elementary functions and the functions computable in polynomial space.
We formulate recursive characterizations of the class of elementary functions and the class of functions computable in polynomial space that do not require any explicit bounded scheme. More specifically, we use functions where the input variables can occur in different kinds of positions ?normal and safe? in the vein of the Bellantoni and Cook's characterization of the polytime functions.
New results of a class of two-neuron networks with time-varying delays.
New results on fair multi-threaded paging.
New results on generalized graph coloring.
New temperatures in Domineering.
Noise effects in the quantum search algorithm from the viewpoint of computational complexity
We analyse the resilience of the quantum search algorithm in the presence of quantum noise modelled as trace preserving completely positive maps. We study the influence of noise on the computational complexity of the quantum search algorithm. We show that it is only for small amounts of noise that the quantum search algorithm is still more efficient than any classical algorithm.
Noise Shaping in Neural Populations with Global Delayed Feedback
The interplay between intrinsic and network dynamics has been the focus of many investigations. Here we use a combination of theoretical and numerical approaches to study the effects of delayed global feedback on the information transmission properties of neural networks. Specifically, we compare networks of neurons that display intrinsic interspike interval correlations (nonrenewal) to networks that do not (renewal). We find that excitatory and...
Nombre de sauts et graphes série-parallèles
Non additive ordinal relations representable by lower or upper probabilities
We characterize (in terms of necessary and sufficient conditions) binary relations representable by a lower probability. Such relations can be non- additive (as the relations representable by a probability) and also not “partially monotone” (as the relations representable by a belief function). Moreover we characterize relations representable by upper probabilities and those representable by plausibility. In fact the conditions characterizing these relations are not immediately deducible by means...