Adding symmetry breaking constraints is one of the oldest ways of breaking variable symmetries for CSPs. For instance, it is well known that all the symmetries for the pigeon hole problem can be removed by ordering the variables. We have generalized this result to all CSPs where the variables are subject to an all different constraint. In such case it is possible to remove all variable symmetri...

Group key transfer protocols depend on a mutually trusted key generation center (KGC) to transport the group key to all group members secretly. This approach requires that a trusted sever be set up, and it incurs communication overhead costs. In addition, the existing group key transfer protocols based on secret sharing all use threshold schemes that need to compute a -degree interpolating poly...

We describe how Computational Group Theory provides tools for manipulating tensors in explicit index notation. In special, we present an algorithm that puts tensors with free indices obeying permutation symmetries into the canonical form. The method is based on algorithms for determining the canonical coset representative of a subgroup of the symmetric group. The complexity of our algorithm is ...

We study the problem of deciding whether or not the image of an irreducible representation of the braid group B3 of degree ≤ 5 has finite image if we are only given the eigenvalues of a generator. We provide a partial algorithm that determines when the images are finite or infinite in all but finitely many cases, and use these results to study examples coming from quantum groups. Our technique ...

The generic group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Although generic hardness proofs exhibit many similarities, still the computational intractability of every newly introduced problem needs to be proven from scratch, a task that can easily become complicated and cumbersome when done rigorously. In this pa...

The objective of this work is to develop an algorithm for pansharpening of very high resolution (VHR) satellite imagery that reduces the spectral distortion of the pansharpened images and enhances their spatial clarity with minimal computational costs. In order to minimize the spectral distortion and computational costs, the global injection gain is transformed to the local injection gains usin...

Several Galerkin schemes for approximate solution of linear elliptic boundary value problems are studied for such computational aspects as obtainable accuracy, sensitivity to parameters and conditioning of linear systems. Methods studied involve computing subspaces (e.g., splines) whose elements need not satisfy boundary conditions. A Poisson problem study on the square produces computed error ...

In this report, a density functional theory (DFT) computational approach was used to investigate the structural and electronic properties of molecular hydrogens adsorbed on single-walled boron nitride nanotubes (BNNTs) with/without doped by group IV elements, such as carbon (C), silicon (Si), germanium (Ge) atom. The twelve hydrogen molecules (H2) were added outer surfaces BNNT frameworks. Geom...