ALEA III 14th International Composition Competition for Young Composers

This is the concert program of the ALEA III 14th International Composition Competition for Young Composers performance on Wednesday, September 25, 1996 at 7:00 p.m., at the Tsai Performance Center. Works performed were "Passages" by Eliane Aberdam, "Peregrination" by Joao Pedro Oliveira, "L'Attimo Rapito" by Paolo Tortiglione, "Fire Mountain" by Gregory C. Smith, Fragment from "Prometheus Unbound" by Hendrik Pienaar Hofmeyr, "B'reshit" by Jorge Liderman, "Samandakas' Dance" by George Hatzimichelakis, and "The Unforgettable Hour" by Drew Hemenger. Digitization for Boston University Concert Programs was supported by the Boston University Humanities Library Endowed Fund

From Elements to a Set

Graduate Winner: 2nd Place, 2009. 22nd Annual Carl Neureuther Student Book Collection Competition

On the Complexity of Enumerating the Answers to Well-designed Pattern Trees

Well-designed pattern trees (wdPTs) have been introduced as an extension of conjunctive queries to allow for partial matching - analogously to the OPTIONAL operator of the semantic web query language SPARQL. Several computational problems of wdPTs have been studied in recent years, such as the evaluation problem in various settings, the counting problem, as well as static analysis tasks including the containment and equivalence problems. Also restrictions needed to achieve tractability of these tasks have been proposed. In contrast, the problem of enumerating the answers to a wdPT has been largely ignored so far. In this work, we embark on a systematic study of the complexity of the enumeration problem of wdPTs. As our main result, we identify several tractable and intractable cases of this problem both from a classical complexity point of view and from a parameterized complexity point of view

Towards an inclusive discourse: representation of Albanian immigrants in Greek cinema

This thesis outlines and discusses portrayals of Albanian and Ethnic Greek migrants from Albania in contemporary Greek cinema. The focus is on seven coproduced films made between 1993 and 2009 that set out to challenge endemic xenophobia and nationalism. The latter have served the most in the exclusion of Albanian immigrants in Greece. The exclusion of Albanian migrants in Greece can be linked to a history of opposition between both countries which has led to a collective predisposition towards Albanians as inherently criminal. This is not an isolated event, but a broad phenomenon that saw Southern European cinemas becoming increasingly preoccupied with the presence of migrants in a region that has not been conditioned to hosting but rather to sending émigrés. Such films therefore also challenge the cultural bedrock of Greece and Europe. It is argued in this thesis that the shift from a national cinema to a transnational mode of filmmaking and representation, that asserts difference and a decline in national sovereignty, is an entirely alien experience to the history of Greek cinema. By utilising a holistic and critically informed framework and methodology, the author unpacks the films' creative and cultural context and addresses them as one body in relation to the specific cultural and historical backdrop. Consequently the texts per se are addressed in order to measure the degree to which they achieve a radical representation of difference and an overall shift from the norm of an insular cinema and film discourse. It is argued that the proposed films plant the seeds for an inclusive discourse but not without reinforcing obvious essentialisms that underlie nationalism and Eurocentrism. Therefore, the author argues that nationalism and Eurocentrism inform the films and hinder their aspiration towards a radical discours

Hybrid GRU-CNN Bilinear Parameters Initialization for Quantum Approximate Optimization Algorithm

The Quantum Approximate Optimization Algorithm (QAOA), a pivotal paradigm in the realm of variational quantum algorithms (VQAs), offers promising computational advantages for tackling combinatorial optimization problems. Well-defined initial circuit parameters, responsible for preparing a parameterized quantum state encoding the solution, play a key role in optimizing QAOA. However, classical optimization techniques encounter challenges in discerning optimal parameters that align with the optimal solution. In this work, we propose a hybrid optimization approach that integrates Gated Recurrent Units (GRU), Convolutional Neural Networks (CNN), and a bilinear strategy as an innovative alternative to conventional optimizers for predicting optimal parameters of QAOA circuits. GRU serves to stochastically initialize favorable parameters for depth-1 circuits, while CNN predicts initial parameters for depth-2 circuits based on the optimized parameters of depth-1 circuits. To assess the efficacy of our approach, we conducted a comparative analysis with traditional initialization methods using QAOA on Erd\H{o}s-R\'enyi graph instances, revealing superior optimal approximation ratios. We employ the bilinear strategy to initialize QAOA circuit parameters at greater depths, with reference parameters obtained from GRU-CNN optimization. This approach allows us to forecast parameters for a depth-12 QAOA circuit, yielding a remarkable approximation ratio of 0.998 across 10 qubits, which surpasses that of the random initialization strategy and the PPN2 method at a depth of 10. The proposed hybrid GRU-CNN bilinear optimization method significantly improves the effectiveness and accuracy of parameters initialization, offering a promising iterative framework for QAOA that elevates its performance

Information Cascades on Arbitrary Topologies

In this paper, we study information cascades on graphs. In this setting, each node in the graph represents a person. One after another, each person has to take a decision based on a private signal as well as the decisions made by earlier neighboring nodes. Such information cascades commonly occur in practice and have been studied in complete graphs where everyone can overhear the decisions of every other player. It is known that information cascades can be fragile and based on very little information, and that they have a high likelihood of being wrong. Generalizing the problem to arbitrary graphs reveals interesting insights. In particular, we show that in a random graph $G(n,q)$, for the right value of $q$, the number of nodes making a wrong decision is logarithmic in $n$. That is, in the limit for large $n$, the fraction of players that make a wrong decision tends to zero. This is intriguing because it contrasts to the two natural corner cases: empty graph (everyone decides independently based on his private signal) and complete graph (all decisions are heard by all nodes). In both of these cases a constant fraction of nodes make a wrong decision in expectation. Thus, our result shows that while both too little and too much information sharing causes nodes to take wrong decisions, for exactly the right amount of information sharing, asymptotically everyone can be right. We further show that this result in random graphs is asymptotically optimal for any topology, even if nodes follow a globally optimal algorithmic strategy. Based on the analysis of random graphs, we explore how topology impacts global performance and construct an optimal deterministic topology among layer graphs

Comic Literature and Graphic Novel Uses in History, Literature, Math, and Science

Graphic novels and comics have a rich history and have long served as a medium for both education and entertainment. Although we live in an increasingly technology-rich era which offers abundant visual stimulation to compete with comics, graphic literature is arguably a more immediate and robust resource than ever before. The following paper highlights specific applications of graphic literature to pedagogical purposes, including implications for the use of comics in teaching history, world languages, English as a new language, science, and mathematics. Across these areas, a wide degree of application exists for teachers, in both K-12 and post-secondary settings. In addition, we draw upon the history of comics itself and the relationship between graphic literature and other popular media to demonstrate how the study of comics is itself a powerful lens through which to study history and sharpen skills for critical inquiry that hold utility across academic disciplines. The potential of graphic literature to be both a vehicle for teaching and learning academic content, as well as a topic that is itself worthy of deliberate study, is an essential theme explored by this paper with an emphasis on concrete examples which may be applied to educational practice