97 resultados para library (computing)
Resumo:
This paper discusses the work of Claude Parent and The Serving Library, considering the critiques generated by their intersecting of architecture, art and editorial design. Through focus on the ways in which hosting environment, architecture and forms of expanded publishing can serve to dissolve disciplinary boundaries and activities of production, spectatorship and reception, it draws on the lineage of 1960s/70s Conceptual Art in considering these practices as a means through which to escape medium specificity and spatial confinement. Relationships between actual and virtual space are then read against this broadening of aesthetic ideas and the theory of critical modernity.
Resumo:
Group exhibition of artists books curated by Gregorio Magnani, including Frozen Tears I - III (2003-7). Including books by Kasper Andreasen, Linus Bill and Adrien Horni, blisterZine, Daniel Gustav Cramer, Arnaud Desjardin, Michael Dean, Karl Holmqvist, Louis Luthi, Sara MacKillop, Dan Mitchell, Kristen Mueller, Sophie Nys, Simon Popper, Preston is my Paris, Alessandro Roma, Karin Ruggaber, John Russell, Erik Steinbrecher, Peter Tillessen, Erik van der Weijde
Resumo:
We extend the method of Cassels for computing the Cassels-Tate pairing on the 2-Selmer group of an elliptic curve, to the case of 3-Selmer groups. This requires significant modifications to both the local and global parts of the calculation. Our method is practical in sufficiently small examples, and can be used to improve the upper bound for the rank of an elliptic curve obtained by 3-descent.
Resumo:
In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.
Resumo:
A digital reconstruction of Samuel Beckett's personal library, based on the volumes preserved at his apartment in Paris, in archives (Beckett International Foundation) and private collections (James and Elizabeth Knowlson Collection, Anne Atik, Noga Arikha, Terrence Killeen,...).