Stacks of high temperature superconducting tape, magnetized using pulsed fields, provide a new type of permanent magnet using superconductors. To optimize the trapped field in such stacks, the role of stabilization layers was investigated by pulse magnetizing a 12 mm square stack of 15 tape layers over a temperature range of 15–77 K. The stacks consisted of commercial tape with a silver stabili...

We develop the theory of n-stacks (or more generally Segal n-stacks which are∞-stacks such that the morphisms are invertible above degree n). This is done by systematically using the theory of closed model categories (cmc). Our main results are: a definition of n-stacks in terms of limits, which should be perfectly general for stacks of any type of objects; several other characterizations of n-...

Memory-augmented neural networks equip a recurrent network with an explicit memory to support tasks that require information storage without interference over long times. A key motivation for such research is perform classic computation tasks, as parsing. However, memory-augmented are notoriously hard train, requiring many backpropagation epochs and lot of data. In this paper, we introduce the ...

Introduction As computing grows increasingly more data oriented, the speed of data handling, and especially of storage functions, becomes the limiting factor in the overall performance of modern computers. Storage systems typically use several technologies, which are linked together with the objective of effectively utilizing the advantages of each technology (high speed, low cost). Designing o...

In stack and queue layouts the vertices of a graph are linearly ordered from left to right, where each edge corresponds to an item and the left and right end vertex of each edge represents the addition and removal of the item to the used data structure. A graph admitting a stack or queue layout is a stack or queue graph, respectively. Typical stack and queue layouts are rainbows and twists visu...

We describe the first implementation of multi-prompt delimited control operators in OCaml that is direct in that it captures only the needed part of the control stack. The implementation is a library that requires no changes to the OCaml compiler or run-time, so it is perfectly compatible with existing OCaml source code and byte-code. The library has been in fruitful practical use for four year...

Current implementations of Java make security decisions by searching the runtime call stack. These systems have attractive security properties, but they have been criticized as being dependent on specific artifacts of the Java implementation. This paper models the stack inspection algorithm in terms of a well-understood logic for access control and demonstrates how stack inspection is a useful ...