Evidence for the Flare Trigger Site and Three-Dimensional Reconnection in Multiwavelength Observations of a Solar Flare

Fletcher, L., Metcalf, T.R., Alexander, D., Brown, D.S. and Ryder, L.A., 2001, Evidence for the flare trigger site and 3D reconnection in multi-wavelength observations of a solar flare, Astrophysical Journal, 554, 451-463.

Exploitation of linguistic ambiguity in Polish and English jokes

English & Polish jokes based on linguistic ambiguity are constrasted. Linguistic ambiguity results from a multiplicity of semantic interpretations motivated by structural pattern. The meanings can be "translated" either by variations of the corresponding minimal strings or by specifying the type & extent of modification needed between the two interpretations. C. F. Hockett's (1972) translatability notion that a joke is linguistic if it cannot readily be translated into other languages without losing its humor is used to interpret some cross-linguistic jokes. It is claimed that additional intralinguistic criteria are needed to classify jokes. By using a syntactic representation, the humor can be explained & compared cross-linguistically. Since the mapping of semantic values onto lexical units is highly language specific, translatability is much less frequent with lexical ambiguity. Similarly, phonological jokes are not usually translatable. Pragmatic ambiguity can be translated on the basis of H. P. Grice's (1975) cooperative principle of conversation that calls for discourse interpretations. If the distinction between linguistic & nonlinguistic jokes is based on translatability, pragmatic jokes must be excluded from the classification. Because of their universality, pragmatic jokes should be included into the linguistic classification by going beyond the translatability criteria & using intralinguistic features to describe them.

Piecewise Linear Models for the Quasiperiodic Transition to Chaos

We formulate and study analytically and computationally two families of piecewise linear degree one circle maps. These families offer the rare advantage of being non-trivial but essentially solvable models for the phenomenon of mode-locking and the quasi-periodic transition to chaos. For instance, for these families, we obtain complete solutions to several questions still largely unanswered for families of smooth circle maps. Our main results describe (1) the sets of maps in these families having some prescribed rotation interval; (2) the boundaries between zero and positive topological entropy and between zero length and non-zero length rotation interval; and (3) the structure and bifurcations of the attractors in one of these families. We discuss the interpretation of these maps as low-order spline approximations to the classic ``sine-circle'' map and examine more generally the implications of our results for the case of smooth circle maps. We also mention a possible connection to recent experiments on models of a driven Josephson junction.

Characterizing Reference Locality in the WWW

As the World Wide Web (Web) is increasingly adopted as the infrastructure for large-scale distributed information systems, issues of performance modeling become ever more critical. In particular, locality of reference is an important property in the performance modeling of distributed information systems. In the case of the Web, understanding the nature of reference locality will help improve the design of middleware, such as caching, prefetching, and document dissemination systems. For example, good measurements of reference locality would allow us to generate synthetic reference streams with accurate performance characteristics, would allow us to compare empirically measured streams to explain differences, and would allow us to predict expected performance for system design and capacity planning. In this paper we propose models for both temporal and spatial locality of reference in streams of requests arriving at Web servers. We show that simple models based only on document popularity (likelihood of reference) are insufficient for capturing either temporal or spatial locality. Instead, we rely on an equivalent, but numerical, representation of a reference stream: a stack distance trace. We show that temporal locality can be characterized by the marginal distribution of the stack distance trace, and we propose models for typical distributions and compare their cache performance to our traces. We also show that spatial locality in a reference stream can be characterized using the notion of self-similarity. Self-similarity describes long-range correlations in the dataset, which is a property that previous researchers have found hard to incorporate into synthetic reference strings. We show that stack distance strings appear to be strongly self-similar, and we provide measurements of the degree of self-similarity in our traces. Finally, we discuss methods for generating synthetic Web traces that exhibit the properties of temporal and spatial locality that we measured in our data.

Validating Arbitrarily Large Network Protocol Compositions with Finite Computation

Formal tools like finite-state model checkers have proven useful in verifying the correctness of systems of bounded size and for hardening single system components against arbitrary inputs. However, conventional applications of these techniques are not well suited to characterizing emergent behaviors of large compositions of processes. In this paper, we present a methodology by which arbitrarily large compositions of components can, if sufficient conditions are proven concerning properties of small compositions, be modeled and completely verified by performing formal verifications upon only a finite set of compositions. The sufficient conditions take the form of reductions, which are claims that particular sequences of components will be causally indistinguishable from other shorter sequences of components. We show how this methodology can be applied to a variety of network protocol applications, including two features of the HTTP protocol, a simple active networking applet, and a proposed web cache consistency algorithm. We also doing discuss its applicability to framing protocol design goals and to representing systems which employ non-model-checking verification methodologies. Finally, we briefly discuss how we hope to broaden this methodology to more general topological compositions of network applications.

Cluster-Based Optimizations for Distributed Hash Tables

We consider the problem of performing topological optimizations of distributed hash tables. Such hash tables include Chord and Tapestry and are a popular building block for distributed applications. Optimizing topologies over one dimensional hash spaces is particularly difficult as the higher dimensionality of the underlying network makes close fits unlikely. Instead, current schemes are limited to heuristically performing local optimizations finding the best of small random set of peers. We propose a new class of topology optimizations based on the existence of clusters of close overlay members within the underlying network. By constructing additional overlays for each cluster, a significant portion of the search procedure can be performed within the local cluster with a corresponding reduction in the search time. Finally, we discuss the effects of these additional overlays on spatial locality and other load balancing scheme.

Generating Representative ISP Technologies From First-Principles

Understanding and modeling the factors that underlie the growth and evolution of network topologies are basic questions that impact capacity planning, forecasting, and protocol research. Early topology generation work focused on generating network-wide connectivity maps, either at the AS-level or the router-level, typically with an eye towards reproducing abstract properties of observed topologies. But recently, advocates of an alternative "first-principles" approach question the feasibility of realizing representative topologies with simple generative models that do not explicitly incorporate real-world constraints, such as the relative costs of router configurations, into the model. Our work synthesizes these two lines by designing a topology generation mechanism that incorporates first-principles constraints. Our goal is more modest than that of constructing an Internet-wide topology: we aim to generate representative topologies for single ISPs. However, our methods also go well beyond previous work, as we annotate these topologies with representative capacity and latency information. Taking only demand for network services over a given region as input, we propose a natural cost model for building and interconnecting PoPs and formulate the resulting optimization problem faced by an ISP. We devise hill-climbing heuristics for this problem and demonstrate that the solutions we obtain are quantitatively similar to those in measured router-level ISP topologies, with respect to both topological properties and fault-tolerance.

Overlay Network Creation and Maintenance with Selfish Users

Overlay networks have been used for adding and enhancing functionality to the end-users without requiring modifications in the Internet core mechanisms. Overlay networks have been used for a variety of popular applications including routing, file sharing, content distribution, and server deployment. Previous work has focused on devising practical neighbor selection heuristics under the assumption that users conform to a specific wiring protocol. This is not a valid assumption in highly decentralized systems like overlay networks. Overlay users may act selfishly and deviate from the default wiring protocols by utilizing knowledge they have about the network when selecting neighbors to improve the performance they receive from the overlay. This thesis goes against the conventional thinking that overlay users conform to a specific protocol. The contributions of this thesis are threefold. It provides a systematic evaluation of the design space of selfish neighbor selection strategies in real overlays, evaluates the performance of overlay networks that consist of users that select their neighbors selfishly, and examines the implications of selfish neighbor and server selection to overlay protocol design and service provisioning respectively. This thesis develops a game-theoretic framework that provides a unified approach to modeling Selfish Neighbor Selection (SNS) wiring procedures on behalf of selfish users. The model is general, and takes into consideration costs reflecting network latency and user preference profiles, the inherent directionality in overlay maintenance protocols, and connectivity constraints imposed on the system designer. Within this framework the notion of user’s "best response" wiring strategy is formalized as a k-median problem on asymmetric distance and is used to obtain overlay structures in which no node can re-wire to improve the performance it receives from the overlay. Evaluation results presented in this thesis indicate that selfish users can reap substantial performance benefits when connecting to overlay networks composed of non-selfish users. In addition, in overlays that are dominated by selfish users, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naïve wiring strategies. To capitalize on the performance advantages of optimal neighbor selection strategies and the emergent global wirings that result, this thesis presents EGOIST: an SNS-inspired overlay network creation and maintenance routing system. Through an extensive measurement study on the deployed prototype, results presented in this thesis show that EGOIST’s neighbor selection primitives outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, these results demonstrate that EGOIST is competitive with an optimal but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overheads. This thesis also studies selfish neighbor selection strategies for swarming applications. The main focus is on n-way broadcast applications where each of n overlay user wants to push its own distinct file to all other destinations as well as download their respective data files. Results presented in this thesis demonstrate that the performance of our swarming protocol for n-way broadcast on top of overlays of selfish users is far superior than the performance on top of existing overlays. In the context of service provisioning, this thesis examines the use of distributed approaches that enable a provider to determine the number and location of servers for optimal delivery of content or services to its selfish end-users. To leverage recent advances in virtualization technologies, this thesis develops and evaluates a distributed protocol to migrate servers based on end-users demand and only on local topological knowledge. Results under a range of network topologies and workloads suggest that the performance of the distributed deployment is comparable to that of the optimal but unscalable centralized deployment.

Distributed Placement of Service Facilities in Large-Scale Networks

The effectiveness of service provisioning in largescale networks is highly dependent on the number and location of service facilities deployed at various hosts. The classical, centralized approach to determining the latter would amount to formulating and solving the uncapacitated k-median (UKM) problem (if the requested number of facilities is fixed), or the uncapacitated facility location (UFL) problem (if the number of facilities is also to be optimized). Clearly, such centralized approaches require knowledge of global topological and demand information, and thus do not scale and are not practical for large networks. The key question posed and answered in this paper is the following: "How can we determine in a distributed and scalable manner the number and location of service facilities?" We propose an innovative approach in which topology and demand information is limited to neighborhoods, or balls of small radius around selected facilities, whereas demand information is captured implicitly for the remaining (remote) clients outside these neighborhoods, by mapping them to clients on the edge of the neighborhood; the ball radius regulates the trade-off between scalability and performance. We develop a scalable, distributed approach that answers our key question through an iterative reoptimization of the location and the number of facilities within such balls. We show that even for small values of the radius (1 or 2), our distributed approach achieves performance under various synthetic and real Internet topologies that is comparable to that of optimal, centralized approaches requiring full topology and demand information.

Monopoles for gravitation and for higher spin fields

We consider massless higher spin gauge theories with both electric and magnetic sources, with a special emphasis on the spin two case. We write the equations of motion at the linear level (with conserved external sources) and introduce Dirac strings so as to derive the equations from a variational principle. We then derive a quantization condition that generalizes the familiar Dirac quantization condition, and which involves the conserved charges associated with the asymptotic symmetries for higher spins. Next we discuss briefly how the result extends to the nonlinear theory. This is done in the context of gravitation, where the Taub-NUT solution provides the exact solution of the field equations with both types of sources. We rederive, in analogy with electromagnetism, the quantization condition from the quantization of the angular momentum. We also observe that the Taub-NUT metric is asymptotically flat at spatial infinity in the sense of Regge and Teitelboim (including their parity conditions). It follows, in particular, that one can consistently consider in the variational principle configurations with different electric and magnetic masses. © 2006 The American Physical Society.

Solo and Chamber Music of Pulitzer Prize-Winning Composers

The Pulitzer Prize in Music, established in 1943, is one of America's most prestigious awards. It has been awarded to fifty-three composers for a "distinguished musical composition of significant dimension by an American that has had its first performance in the United States during the year." Composers who have won the Pulitzer Prize are considered to be at the pinnacle of their creativity and have provided the musical world with classical music compositions worthy of future notice. By tracing the history of Pulitzer Prize-winning composers and their compositions, researchers and musicians enhance their understanding of the historical evolution of American music, and its impact on American culture. Although the clarinet music of some of these composers is rarely performed today, their names will be forever linked to the Pulitzer, and because of that, their compositions will enjoy a certain sense of immortality. Of the fifty-four composers who have won the award, forty-seven have written for the clarinet in a solo or chamber music setting (five or less instruments). Just as each Pulitzer Prize-winning composition is a snapshot of the state of American music at that time, these works trace the history of American clarinet musical development, and therefore, they are valuable additions to the clarinet repertoire and worthy of performance. This dissertation project consists of two recitals featuring the solo and chamber clarinet music of sixteen Pulitzer Prize-winning composers, extended program notes containing information on each composer's life, their music, the Pulitzer Prize-winning composition and the recital selection, and a complete list of all Pulitzer Prize-winning composers and their solo and chamber clarinet music. Featured Composers Dominick Argento, To Be Sung Upon the Water Leslie Bassett, Soliloquies William Bolcom, Little Suite of Four Dances Aaron Copland, As it Fell Upon a Day John Corigliano, Soliloquy Norman Dello Joio, Concertante Morton Gould, Benny's Gig Charles Ives, Largo Douglas Moore, Quintet for Clarinet and Strings George Perle, Three Sonatas Quincy Porter, Quintet for Clarinet and Strings Mel Powell, Clarinade Shulamit Ran, Private Game Joseph Schwantner, Entropy Leo Sowerby, Sonata Ernst Toch, Adagio elegiaco

Multiple Dynamic Processes Contribute to the Complex Steady Shear Behavior of Cross-Linked Supramolecular Networks of Semidilute Entangled Polymer Solutions.

Molecular theories of shear thickening and shear thinning in associative polymer networks are typically united in that they involve a single kinetic parameter that describes the network -- a relaxation time that is related to the lifetime of the associative bonds. Here we report the steady-shear behavior of two structurally identical metallo-supramolecular polymer networks, for which single-relaxation parameter models break down in dramatic fashion. The networks are formed by the addition of reversible cross-linkers to semidilute entangled solutions of PVP in DMSO, and they differ only in the lifetime of the reversible cross-links. Shear thickening is observed for cross-linkers that have a slower dissociation rate (17 s(-1)), while shear thinning is observed for samples that have a faster dissociation rate (ca. 1400 s(-1)). The difference in the steady shear behavior of the unentangled vs. entangled regime reveals an unexpected, additional competing relaxation, ascribed to topological disentanglement in the semidilute entangled regime that contributes to the rheological properties.

Doubt, for narrator and orchestra

Doubt is a single-movement composition of roughly twelve minutes for narrator and orchestra (woodwinds, horns, and trumpets in pairs, timpani, percussion, strings). The piece explores the controversial issue of capital punishment. The text was compiled from resources found on the websites of Death Penalty Information Center (http://www.deathpenaltyinfo.org) and Anti-Death Penalty Information (http://www.antideathpenalty.org), as well as excerpts from the Bible. Doubt was conceived of as a dramatic work in which a narrator recites factual information in a direct and unemotional manner and the orchestra provides a response to the mixed emotions elicited by the text. The list of dates and case summaries presented in the middle section of the piece seemed most powerful and effective when recited in a natural speaking voice, which is why I chose not to set the text as song. Also, I chose the orchestral medium rather than a chamber setting because the nature of the topic demanded a larger range of colors and combinations, as well as a louder, fuller sound. Much of the music was composed while deciding which texts to include. Thus the music influenced the choice of text as much as the text suggested the musical setting. The four formal divisions of the piece are delineated primarily by the text. The first section is an orchestral introduction representing various emotional perspectives suggested by the texts. The narrator begins the second section with a Biblical verse over sparse orchestration. The third and main section of the piece begins with a new melody in the low strings that is closely related to the harmonic organization of the piece. The narrator lists dates of convictions, executions, exonerations and facts related to doubtful cases. The third section and the narration conclude with another brief passage from the Bible. The fourth section is a dramatic orchestral coda, bringing back the opening harmonies of juxtaposed perfect fifths. The final chord is full of tension and discord, reflecting the oppositions inherent in the topic of capital punishment: life vs. death, sympathy vs. reproach, pain vs. hope, but above all, doubt about guilt vs. innocence.

Lament for String Quartet

This piece explores the changing nature of emotion focusing especially on the feeling of sorrow. The opening and ending parts of the first movement represent the overall motive of sorrow. The first movement opens with an augmented chord G-C#-F-B and from this chord the first violin expands upwards while the cello moves downwards towards the C chord (p.2). As the melody alternates between each part, there is a subtle change in harmony which creates tension and release and changes the sound color. In addition, ornamentation in each part reinforces the movement towards the C chord. This progression represents the inner emotion of lament. Sostenuto e largamente section (p.2) uses heterophony in order to express a feeling of chaos. Section Scherzando (p.4) uses the interval relationship M7 and m2, and is a respite from the overwhelming feeling of sorrow. The ending of the first movement (p.12) returns to create a second tension by every instrument ascending slowly, and the viola produces a distinctive melody derived from the previous chaotic section that ends on an Ab. The second movement contrasts with the first movement in order to express a concealed, not explicit, sorrow, and differs in both tempo and texture. The tempo is a waltz that is faster than the first movement. This produces a light, playful figure and a simple melody without much ornamentation. Imitation and canonic structure emphasize the individuality of the strings. The third movement merges material from the first movement rhythmic figure and the second movement pizzicato (p.17). It shows timbral change through con sordino, pizzicato arpeggio, and sul ponticello to display string techniques. An Allegro section (p.19) especially contrasts with Misterioso in rhythm and dynamics. In the Grazioso (p.22), random beats are accentuated by pizzicato arpeggio to de-emphasize the meter. Finally, there is a return to the ending figure of the first movement with con sordino (p.23) and sul ponticello in viola that articulates the internal tension and the timbral change to return to a voice of sorrow.

The Oud Across Arabic Culture

This study is a compilation and compendium of information on the oud, the most important instrument in Arabic classical music. It has grown out of my own long-time involvement in studying and playing the oud, and in particular out of my interest in the lack of sources and knowledge available to the vast majority of oud players and researchers, as well as for the readers. My own path started from an intensive study of the oud, which included exposure to several treaties; some housed in museums around the globe, and some only available in the Arabic language. The study combines archival research (including Arabic poetry and pre-Islamic Era and medieval treaties), symbolism, new archaeological discoveries, field interviews, and analysis of existing scholarship, and draws on my professional performance experience for detailed stylistic analysis of the oud's performance practice and its historical development. The study consists of participant observation, personal performance, and interviews conducted in person, via telephone, and/or via e-mail, according to the choice of the performers. The performers have been selected from networks of musicians who perform regularly at lounges, concert halls, and private events. These performers have been chosen according to their musical knowledge, technical skill, experience, and activity in Arabic music and oud performance. Chapter one deals with the purpose of this study and the methods of investigation, as well as giving a brief overview of the history of the oud. In addition, there will be an introduction to the Arabic musical system (mâqâm), which is primarily based on the mechanics and sound production of the oud. Chapter two deals with the oud in Arabic sources: the first source is Arabic poetry in the pre-Islamic Era. The second source is Arabic poetry in the medieval era, in which I found a significant number of poets who allude to the oud, providing accurate descriptions of the player, singers, and the scenes within the contexts of oud performance. The third source is the Arab scholars' intensive treatises with meticulous accounts of the instrument's apparatii, including descriptions and measurements of the parts, strings, and tuning. While chapter three deals with the classification, the development of the oud, chapter four deals with topics such as: the symbolism of the oud and its relation to cosmology, astronomy, mathematics and anatomy. In most of the pertinent Arabic writings, philosophers mention a significant correlation between the oud and the other sciences. Chapter five deals with recreating the performance practice of the oud. A case study of the oud performers focuses on their style, technique, training, and personal experiences. Topics such as improvisation and ornamentation, the oud in the Arabic musical ensemble, the social uses and functions, and gender in musical performance practices will be included in detailed analysis. Other important topics will be analyzed such as traditional vs. modern technique, and the repertoire of the oud. Specifically, in regard to technique, the study outline the style of the music, the role of the oud in Arabic ensembles, the function of the oud in music composition, and the form of the ensembles in Arabic performance and practice.