Search results for "ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION"
showing 10 items of 140 documents
Denoising Autoencoders for Fast Combinatorial Black Box Optimization
2015
Estimation of Distribution Algorithms (EDAs) require flexible probability models that can be efficiently learned and sampled. Autoencoders (AE) are generative stochastic networks with these desired properties. We integrate a special type of AE, the Denoising Autoencoder (DAE), into an EDA and evaluate the performance of DAE-EDA on several combinatorial optimization problems with a single objective. We asses the number of fitness evaluations as well as the required CPU times. We compare the results to the performance to the Bayesian Optimization Algorithm (BOA) and RBM-EDA, another EDA which is based on a generative neural network which has proven competitive with BOA. For the considered pro…
Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
2017
We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching Programs, with respect to "width" complexity. It is known that maximal complexity gap between deterministic and quantum model is exponential. But there are few examples of such functions. We present method (called "reordering"), which allows to build Boolean function $g$ from Boolean Function $f$, such that if for $f$ we have gap between quantum and deterministic OBDD complexity for natural order of variables, then we have almost the same gap for function $g$, but for any order. Using it we construct the total function $REQ$ which deterministic OBDD complexity is $2^{\Omega(n/\log n)}$ and present quantu…
RationalizeRoots: Software Package for the Rationalization of Square Roots
2019
The computation of Feynman integrals often involves square roots. One way to obtain a solution in terms of multiple polylogarithms is to rationalize these square roots by a suitable variable change. We present a program that can be used to find such transformations. After an introduction to the theoretical background, we explain in detail how to use the program in practice.
REDUCTION OF CONSTRAINT SYSTEMS
1993
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into well constrained, over-, and underconstrained subsystems. This paper also gives an efficient method to decompose well constrained systems into irreducible ones. These decompositions greatly speed up the resolution in case of reducible systems. They also allow debugging systems of constraints.
A uniform quantificational logic for algebraic notions ofcontext
2002
A quantificational framework of formal reasoning is proposed, which emphasises the pattern of entering and exiting context. Contexts are modelled by an algebraic structure which reflects the order and manner in which context is entered into and exited from. The equations of the algebra partitions context terms into equivalence classes. A formal semantics is defined, containing models that map equivalence classes of certain context terms to sets of first order structures. The corresponding Hilbert system incorporates the algebraic equations as axioms asserted in context. In this way a uniform logic for arbitrary algebras of context is obtained. Soundness and completeness are proved. In semig…
Rapid construction of algebraic axioms from samples
1991
Abstract An axiom is called reliable if it is confirmed in several places in a given sample of algebra. A very effective algorithm for enumerating such axioms is described.
Real quadrics in C n , complex manifolds and convex polytopes
2006
In this paper, we investigate the topology of a class of non-Kähler compact complex manifolds generalizing that of Hopf and Calabi-Eckmann manifolds. These manifolds are diffeomorphic to special systems of real quadrics Cn which are invariant with respect to the natural action of the real torus (S1)n onto Cn. The quotient space is a simple convex polytope. The problem reduces thus to the study of the topology of certain real algebraic sets and can be handled using combinatorial results on convex polytopes. We prove that the homology groups of these compact complex manifolds can have arbitrary amount of torsion so that their topology is extremely rich. We also resolve an associated wall-cros…
Teaching and Learning of Algebra
2015
Topic Study Group 9 aimed to bring together researchers, developers and teachers who investigate and develop theoretical accounts of the teaching and learning of algebra. The group sought both empirically grounded contributions focussing on the learning and teaching of algebra in diverse classrooms settings, the evolution of algebraic reasoning from elementary through university schooling as well as theoretical contributions throwing light on the complexities involved in teaching and learning of algebra. Prospective contributors were requested to address one or more of the following themes: early algebra, use of ICT in algebra classrooms, proof and proving in algebra, problem solving, semio…
Products of Bessel functions and associated polynomials
2013
The symbolic method is used to get explicit formulae for the products or powers of Bessel functions and for the relevant integrals.
Speeding up a few orders of magnitude the Jacobi method: high order Chebyshev-Jacobi over GPUs
2017
In this technical note we show how to reach a remarkable speed up when solving elliptic partial differential equations with finite differences thanks to the joint use of the Chebyshev-Jacobi method with high order discretizations and its parallel implementation over GPUs.