In 2013 Elkies described a method for bounding the transitivity degree of Galois groups. Our goal is to give additional applications this technique, in particular verifying that monodromy group degree-276 cover defined over degree-12 number field computed by Monien isomorphic sporadic Conway Co3.

A procedure for automatic mosaic construction over long image sequences is presented. This mosaic is used by an underwater vehicle to estimate its motion with respect to the ocean floor. The system exploits texture cues to solve the correspondence problem. The dynamic selection of a reference image extracted from the mosaic improves motion estimation, bounding accumulated error. Experiments wit...

Bounding is one of the important gaits in quadrupedal locomotion for negotiating obstacles. The authors proposed an effective approach that can learn robust bounding more efficiently despite its large variation dynamic body movements. first pretrained neural network (NN) based on data from a robot operated by conventional model-based controllers, and then further optimised NN via deep reinforce...

A set X is prime bounding if for every complete atomic decidable (CAD) theory T there is a prime model A of T decidable in X. It is easy to see that X = 0′ is prime bounding. Denisov claimed that every X <T 0′ is not prime bounding, but we discovered this to be incorrect. Here we give the correct characterization that the prime bounding sets X ≤T 0′ are exactly the sets which are not low2. Reca...

Training an object class detector typically requires a large set of images annotated with bounding-boxes, which is expensive and time consuming to create. We propose novel approach to annotate object locations which can substantially reduce annotation time. We first track the eye movements of annotators instructed to find the object and then propose a technique for deriving object bounding-boxe...

Distance-bounding protocols aim to prevent an adversary from pretending that two parties are physically closer than they really are. We show that proposed distance-bounding protocols of Hu, Perrig and Johnson (2003), Sastry, Shankar and Wagner (2003), and Čapkun and Hubaux (2005, 2006) are vulnerable to a guessing attack where the malicious prover preemptively transmits guessed values for a num...

The attractors of Iterated Function Systems in Euclidean space IFS fractals have been the subject of great interest for their ability to visually model a wide range of natural phenomena. Indeed computer-generated plants are often modeled using 3D IFS fractals, and thus their extent in virtual space is a fundamental question, whether for collision detection or ray tracing. A great variety of alg...

Experiments and simulations reveal that rigid fibers suspended at high concentration in a viscous fluid can be aligned the vorticity direction using shearing flow. Creating alignment requires an oscillatory shear over limited range of strain amplitudes. The suspension must also confined, as only those particles near bounding walls align.

We develop a general method for bounding Mordell-Weil ranks of Jacobians of arbitrary curves of the form y = f(x). As an example, we compute the Mordell-Weil ranks over Q and Q( √ −3) for a non-hyperelliptic curve of genus 8.

A bounding volume hierarchy is a common method for making ray tracing based rendering more efficient. Constructing good hierarchies, however, is a difficult problem as the number of hierarchies grows exponentially with the number of scene objects. In this paper, we attempted to apply stochastic search to techniques to solve the problem of automatic generation of bounding volume hierarchy. We ha...