Development and analysis of trapped field magnets in electromechanical devices

High temperature superconducting trapped field magnets (TFM) offer great potential as an alternative to 2>d generation YBCO wire, both in cost and performance. Attention is given to the calculation of current distribution within YBCO disks at partial and full activation and comparing this to experimental values. The best results are obtained by treating the current as a sequence of nested current rings. The fields are computed by integrating the elliptic integrals representing the fields from these rings and using variable metric optimization to choose the ring radii to best match the activation field over the on-activated material. A technique for treating the sub-regions of the TFM as voltage fed coils appears most expeditious for computing forces.Center for Electromechanic

The Gremlin Graph Traversal Machine and Language

Gremlin is a graph traversal machine and language designed, developed, and distributed by the Apache TinkerPop project. Gremlin, as a graph traversal machine, is composed of three interacting components: a graph $G$, a traversal $\Psi$, and a set of traversers $T$. The traversers move about the graph according to the instructions specified in the traversal, where the result of the computation is the ultimate locations of all halted traversers. A Gremlin machine can be executed over any supporting graph computing system such as an OLTP graph database and/or an OLAP graph processor. Gremlin, as a graph traversal language, is a functional language implemented in the user's native programming language and is used to define the $\Psi$ of a Gremlin machine. This article provides a mathematical description of Gremlin and details its automaton and functional properties. These properties enable Gremlin to naturally support imperative and declarative querying, host language agnosticism, user-defined domain specific languages, an extensible compiler/optimizer, single- and multi-machine execution models, hybrid depth- and breadth-first evaluation, as well as the existence of a Universal Gremlin Machine and its respective entailments.Comment: To appear in the Proceedings of the 2015 ACM Database Programming Languages Conferenc