734 research outputs found
Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles
No full textA foundational result in origami mathematics is Kawasaki and Justin’s simple, efficient characterization of flat foldability for unassigned single-vertex crease patterns (where each crease can fold mountain or valley) on flat material. This result was later generalized to cones of material, where the angles glued at the single vertex may not sum to 360^∘. Here we generalize these results to when the material forms a complex (instead of a manifold), and thus the angles are glued at the single vertex in the structure of an arbitrary planar graph (instead of a cycle). Like the earlier characterizations, we require all creases to fold mountain or valley, not remain unfolded flat; otherwise, the problem is known to be NP-complete (weakly for flat material and strongly for complexes). Equivalently, we efficiently characterize which combinatorially embedded planar graphs with prescribed edge lengths can fold flat, when all angles must be mountain or valley (not unfolded flat). Our algorithm runs in O(n log³ n) time, improving on the previous best algorithm of O(n² log n)
Lower Bounds on Retroactive Data Structures
No full textWe prove essentially optimal fine-grained lower bounds on the gap between a data structure and a partially retroactive version of the same data structure. Precisely, assuming any one of three standard conjectures, we describe a problem that has a data structure where operations run in O(T(n,m)) time per operation, but any partially retroactive version of that data structure requires T(n,m)⋅m^{1-o(1)} worst-case time per operation, where n is the size of the data structure at any time and m is the number of operations. Any data structure with operations running in O(T(n,m)) time per operation can be converted (via the "rollback method") into a partially retroactive data structure running in O(T(n,m)⋅m) time per operation, so our lower bound is tight up to an m^o(1) factor common in fine-grained complexity
Dylan: A Commemoration
No full textDylan: A Commemoration. Edited by Stephen Pickering. California, 1971. Philosophical musings of an early Dylan enthusiast. This rare publication explores the author\u27s appreciation for Dylan as the greatest poet of the century, and rejects the rationalist distortions of rock magazines. Released the same year as Tarantula, it hails the work as scintillating and brilliant.https://digitalcommons.lasalle.edu/dylan_popular_culture_response/1000/thumbnail.jp
Bob Dylan and religion
No full textThis article, which is located within the field of research on religion and popular culture, is a discussion of the relations of one particular rock artist, Bob Dylan, to religion. Religion can be seen as a recurring topic in Dylan’s work—particularly during a period at the end of the 1970s and beginning of the 1980s, often referred to as his ‘Christian era’—and also in the discourses around him. This article explores how the topic of religion appears in discourses around Bob Dylan. In this article one particular aspect of the connection between religion and popular culture is looked at: the construction of certain artists or stars as religious figures, and more specifically Bob Dylan as a case. The author does not try to discover whether Dylan is religious or not; or which religion he possibly adheres to. Rather, the author looks at how rock artists and in this case Bob Dylan are ‘constructed’ as religious figures
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard
No full textWe prove PSPACE-completeness of two classic types of Chess problems when generalized to n × n boards. A "retrograde" problem asks whether it is possible for a position to be reached from a natural starting position, i.e., whether the position is "valid" or "legal" or "reachable". Most real-world retrograde Chess problems ask for the last few moves of such a sequence; we analyze the decision question which gets at the existence of an exponentially long move sequence. A "helpmate" problem asks whether it is possible for a player to become checkmated by any sequence of moves from a given position. A helpmate problem is essentially a cooperative form of Chess, where both players work together to cause a particular player to win; it also arises in regular Chess games, where a player who runs out of time (flags) loses only if they could ever possibly be checkmated from the current position (i.e., the helpmate problem has a solution). Our PSPACE-hardness reductions are from a variant of a puzzle game called Subway Shuffle
Bob Dylan and religion
No full textThis article, which is located within the field of research on religion and popular culture, is a discussion of the relations of one particular rock artist, Bob Dylan, to religion. Religion can be seen as a recurring topic in Dylan’s work—particularly during a period at the end of the 1970s and beginning of the 1980s, often referred to as his ‘Christian era’—and also in the discourses around him. This article explores how the topic of religion appears in discourses around Bob Dylan. In this article one particular aspect of the connection between religion and popular culture is looked at: the construction of certain artists or stars as religious figures, and more specifically Bob Dylan as a case. The author does not try to discover whether Dylan is religious or not; or which religion he possibly adheres to. Rather, the author looks at how rock artists and in this case Bob Dylan are ‘constructed’ as religious figures.
Recommended from our members
Dylan
No full textThe Indonesian poet and public figure Goenawan Mohamad published "Bob Dylan" in the magazine Tempo and it was also published in the English version of Tempo. Reprinted by permission of the author Goenawan Mohamad and the translator Jennifer Lindsay
Gratitude as a practice to manage uncertainty and foster well being
No full textDylan Le Roy is a Student Affairs and Services Counsellor at Douglas College. He provided a much-needed “Managing Uncertainty with Gratitude” session for the Better Together Conference.
The campus community and the world are experiencing a large amount of uncertainty and change. Dylan Le Roy discusses how this increase in uncertainty may have impacted our sense of wellbeing. Through an experiential practice, participants explore how grounding in gratitude can help foster a greater sense of resiliency, creativity, and connection.presentationBetter Together Conferenc
Dylan to English Dictionary
No full textDylan to English Dictionary, by A.J. Weberman. New York, 2005.
This curious resource would seem, at first glance, to be a basic reference work treating Dylan\u27s lyrics to some form of translation. One only needs to read the very first paragraph of this work to learn that its author was deeply obsessed with Dylan, and through various experiences on LSD came to believe he could interpret hidden meaning in all of Dylan\u27s lyrics. He also credits himself for coining the term Dylanology.https://digitalcommons.lasalle.edu/dylan_academic_interpretations/1001/thumbnail.jp
Bob Dylan and American Folk Music: The Pigeonhole Effect
No full textThis article tracks Bob Dylan\u27s early musical career and his relation to the American Folk music movement of the late 1950s into the early 1960s. The author grapples with the question of why Bob Dylan went electric and explores some of the stories around the seminal event in American Folk Music history. The author mainly uses Bob Dylan\u27s personal interviews and songs to draw conclusions
- …
