We propose a new approach for parallelizing search for combinatorial optimization that is based on a recursive application of approximate Decision Diagrams. This generic scheme can, in principle, be applied to any combinatorial optimization problem for which a decision diagram representation is available. We consider the maximum independent set problem as a specific case study, and show how a r...

Multiview geometry is the study of two-dimensional images of threedimensional scenes, a foundational subject in computer vision. We determine a universal Gröbner basis for the multiview ideal of n generic cameras. As the cameras move, the multiview varieties vary in a family of dimension 11n − 15. This family is the distinguished component of a multigraded Hilbert scheme with a unique Borel-fix...

A fault-tolerant and stabilizing simulation of an atomic register is presented. The simulation works in asynchronous message-passing systems, and allows a minority of processes to crash. The simulation stabilizes in a pragmatic manner, by reaching a long execution in which it runs correctly. A key element in the simulation is a new combinatorial construction of a bounded labeling scheme accommo...

Card shuffling models have provided simple motivating examples for the mathematical theory of mixing times Markov chains. As a complement, we introduce more intricate realistic model certain observable real-world scheme human players onto teams. We quantify numerically effectiveness this over 7 or 8 steps performed in practice. give combinatorial proof non-trivial fact that chain is indeed irre...

In this article, we propose an identification scheme which is based on the two combinatorial problems Multivariate Quadratic equations (MQ) and Isomorphism of Polynomials (IP). We show that this scheme is statistical zero-knowledge. Using a trapdoor for the MQ-problem, it is possible to make it also identity-based, i.e., there is no need for distributing public keys or for certificates within t...

This article substantiates the importance of introducing topic “Raman and giant Raman scattering light” into course “Nanophysics”, taught to students Faculty Physics National University Uzbekistan named after Mirzo Ulugbek. The essence light is explained from point view quantum mechanics. Detailed information given on polarization, dipole moment molecules, stokes anti-stokes components spectrum...

We improve on the Bresson–Stern–Szydlo threshold ring signature scheme which uses Shamir secret sharing scheme [6] by showing that the security can be proved under a strictly weaker assumption, that is the random oracle model rather than the ideal cipher model. Then we propose an efficient (n− t)-out-of-n threshold ring signature scheme which is efficient when t is small compared with n. Our sc...

Descent methods for combinatorial optimization proceed by performing a sequence of local changes on an initial solution which improve each time the value of an objective function until a local optimum is found. Several metaheuristics have been proposed which extend in various ways this scheme and avoid being trapped in local optima. For example, Hansen and Mladenovic have recently proposed the ...

In this paper we derive novel algorithms for estimation of regularization parameters and for optimization of neural net architectures based on a validation set. Regularization parameters are estimated using an iterative gradient descent scheme. Architecture optimization is performed by approximative combinatorial search among the relevant subsets of an initial neural network architecture by emp...

Key distribution is an important problem in wireless sensor networks where sensor nodes are randomly scattered in adversarial environments. Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a keypath in which ens...