The Trail, 1965-03-11

https://soundideas.pugetsound.edu/thetrail_all/1905/thumbnail.jp

Film policy and the emergence of the cross-cultural: exploring crossover cinema in Flanders (Belgium)

With several films taking on a cross-cultural character, a certain ‘crossover trend’ may be observed within the recent upswing of Flemish cinema (a subdivision of Belgian cinema). This trend is characterized by two major strands: first, migrant and diasporic filmmakers finally seem to be emerging, and second, several filmmakers tend to cross the globe to make their films, hereby minimizing links with Flemish indigenous culture. While paying special attention to the crucial role of film policy in this context, this contribution further investigates the crossover trend by focusing on Turquaze (2010, Kadir Balci) and Altiplano (2009, Peter Brosens & Jessica Woodworth)

From Tightrope to Gendered Trope: A comparative study of the print mediation of women Prime Ministers

Women politicians have historically experienced and continue to experience gendered and misogynistic coverage in the mainstream print media. This is visible above all in an undue media focus on their gender, appearance and personal lives that serves to delegitimise and trivialise their political careers. This dissertation aims to interrogate the origins and implications of such coverage for women prime ministers in Westminster-style democracies, and to demonstrate the central role that the media plays in the upholding of gender norms. As such, it is guided by a central question: how do the mainstream print media produce and reinforce gender norms in their coverage of women political leaders? Several sub-questions flow from this inquiry, including: How do the media construct gendered representations, and does this change across countries and over time? Do gendered representations differ in accordance with the political affiliation of the leader and newspaper? To address these questions, I examined print media coverage of the respective prime ministerial ascensions of the United Kingdom's Margaret Thatcher and Theresa May, Australia's Julia Gillard, and New Zealand's Jenny Shipley and Helen Clark, analysing a representative sample of 1039 mainstream newspaper articles published during the first three weeks of each leader's prime ministerial term. I used feminist critical discourse analysis (FCDA), feminist content analysis (FCA) and visual analysis to deconstruct and understand how and why the media rely on gender norms and stereotypes. I also interviewed former prime ministers Helen Clark and Julia Gillard, adhering to a feminist interviewing approach to gain a personal perspective and original insight into this phenomenon. On the basis of the research findings I developed a framework of 'gendered tropes', encompassing five significant themes found in the media coverage of women political leaders. The gendered tropes are: gender and femininity; appearance; family; first names; and comparisons to Thatcher. Each of these encompasses many 'sub-tropes', themes and metaphors that together serve to emphasise gender norms and thereby reinforce the existing gender order. I also found that the political spectrum was of relevance, as the conservative press generally rely on gendered tropes more frequently and more intensely than their progressive counterparts, especially with reference to progressive leaders. Finally, I show that gendered reportage differs over time, with recent leaders experiencing more gendered and misogynistic coverage than their predecessors, reflecting an increase in the personalisation of politics. Through these main findings, this dissertation opens up various avenues for discussion and exploration of the phenomenon of gendered media, and increases our understanding of a problem that not only affects women politicians and political leaders, but all women

Simplexity: A Hybrid Framework for Managing System Complexity

Knowledge management, management of mission critical systems, and complexity management rely on a triangular support connection. Knowledge management provides ways of creating, corroborating, collecting, combining, storing, transferring, and sharing the know-why and know-how for reactively and proactively handling the challenges of mission critical systems. Complexity management, operating on “complexity” as an umbrella term for size, mass, diversity, ambiguity, fuzziness, randomness, risk, change, chaos, instability, and disruption, delivers support to both knowledge and systems management: on the one hand, support for dealing with the complexity of managing knowledge, i.e., furnishing criteria for a common and operationalized terminology, for dealing with mediating and moderating concepts, paradoxes, and controversial validity, and, on the other hand, support for systems managers coping with risks, lack of transparence, ambiguity, fuzziness, pooled and reciprocal interdependencies (e.g., for attaining interoperability), instability (e.g., downtime, oscillations, disruption), and even disasters and catastrophes. This support results from the evident intersection of complexity management and systems management, e.g., in the shape of complex adaptive systems, deploying slack, establishing security standards, and utilizing hybrid concepts (e.g., hybrid clouds, hybrid procedures for project management). The complexity-focused manager of mission critical systems should deploy an ambidextrous strategy of both reducing complexity, e.g., in terms of avoiding risks, and of establishing a potential to handle complexity, i.e., investing in high availability, business continuity, slack, optimal coupling, characteristics of high reliability organizations, and agile systems. This complexity-focused hybrid approach is labeled “simplexity.” It constitutes a blend of complexity reduction and complexity augmentation, relying on the generic logic of hybrids: the strengths of complexity reduction are capable of compensating the weaknesses of complexity augmentation and vice versa. The deficiencies of prevalent simplexity models signal that this blended approach requires a sophisticated architecture. In order to provide a sound base for coping with the meta-complexity of both complexity and its management, this architecture comprises interconnected components, domains, and dimensions as building blocks of simplexity as well as paradigms, patterns, and parameters for managing simplexity. The need for a balanced paradigm for complexity management, capable of overcoming not only the prevalent bias of complexity reduction but also weaknesses of prevalent concepts of simplexity, serves as the starting point of the argumentation in this chapter. To provide a practical guideline to meet this demand, an innovative model of simplexity is conceived. This model creates awareness for differentiating components, dimensions, and domains of complexity management as well as for various species of interconnectedness, such as the aligned upsizing and downsizing of capacities, the relevance of diversity management (e.g., in terms of deviations and errors), and the scope of risk management instruments. Strategies (e.g., heuristics, step-by-step procedures) and tools for managing simplexity-guided projects are outlined

Advances in Artificial Intelligence: Models, Optimization, and Machine Learning

The present book contains all the articles accepted and published in the Special Issue “Advances in Artificial Intelligence: Models, Optimization, and Machine Learning” of the MDPI Mathematics journal, which covers a wide range of topics connected to the theory and applications of artificial intelligence and its subfields. These topics include, among others, deep learning and classic machine learning algorithms, neural modelling, architectures and learning algorithms, biologically inspired optimization algorithms, algorithms for autonomous driving, probabilistic models and Bayesian reasoning, intelligent agents and multiagent systems. We hope that the scientific results presented in this book will serve as valuable sources of documentation and inspiration for anyone willing to pursue research in artificial intelligence, machine learning and their widespread applications

The Courier, Volume 21, Issue 27, June 6, 1988

Stories: $3 Million Micro Plan To Link CD Rise In Enrollment, Tax Base Fuel Budget CD To Graduate 450 Students At Commencement Lemme Named Top CD Teacher Changes Hamper Journalism Program, Courier CD ‘Athletes Of The Year’ Named Krenek Repeats As Top CD Woman Bridel Credits Webster For Top Play CD Student’s Cartoons Far From Ordinary Summer Sensations (photos) People: Barbara Hansen Lemme Sharyl Krenek Brett Bridel Dave Webster Darrin Otten Jim Bec

Scheduling and reconfiguration of interconnection network switches

Interconnection networks are important parts of modern computing systems, facilitating communication between a system\u27s components. Switches connecting various nodes of an interconnection network serve to move data in the network. The switch\u27s delay and throughput impact the overall performance of the network and thus the system. Scheduling efficient movement of data through a switch and configuring the switch to realize a schedule are the main themes of this research. We consider various interconnection network switches including (i) crossbar-based switches, (ii) circuit-switched tree switches, and (iii) fat-tree switches. For crossbar-based input-queued switches, a recent result established that logarithmic packet delay is possible. However, this result assumes that packet transmission time through the switch is no less than schedule-generation time. We prove that without this assumption (as is the case in practice) packet delay becomes linear. We also report results of simulations that bear out our result for practical switch sizes and indicate that a fast scheduling algorithm reduces not only packet delay but also buffer size. We also propose a fast mesh-of-trees based distributed switch scheduling (maximal-matching based) algorithm that has polylog complexity. A circuit-switched tree (CST) can serve as an interconnect structure for various computing architectures and models such as the self-reconfigurable gate array and the reconfigurable mesh. A CST is a tree structure with source and destination processing elements as leaves and switches as internal nodes. We design several scheduling and configuration algorithms that distributedly partition a given set of communications into non-conflicting subsets and then establish switch settings and paths on the CST corresponding to the communications. A fat-tree is another widely used interconnection structure in many of today\u27s high-performance clusters. We embed a reconfigurable mesh inside a fat-tree switch to generate efficient connections. We present an R-Mesh-based algorithm for a fat-tree switch that creates buses connecting input and output ports corresponding to various communications using that switch

Scheduling in Transactional Memory Systems: Models, Algorithms, and Evaluations

Transactional memory provides an alternative synchronization mechanism that removes many limitations of traditional lock-based synchronization so that concurrent program writing is easier than lock-based code in modern multicore architectures. The fundamental module in a transactional memory system is the transaction which represents a sequence of read and write operations that are performed atomically to a set of shared resources; transactions may conflict if they access the same shared resources. A transaction scheduling algorithm is used to handle these transaction conflicts and schedule appropriately the transactions. In this dissertation, we study transaction scheduling problem in several systems that differ through the variation of the intra-core communication cost in accessing shared resources. Symmetric communication costs imply tightly-coupled systems, asymmetric communication costs imply large-scale distributed systems, and partially asymmetric communication costs imply non-uniform memory access systems. We made several theoretical contributions providing tight, near-tight, and/or impossibility results on three different performance evaluation metrics: execution time, communication cost, and load, for any transaction scheduling algorithm. We then complement these theoretical results by experimental evaluations, whenever possible, showing their benefits in practical scenarios. To the best of our knowledge, the contributions of this dissertation are either the first of their kind or significant improvements over the best previously known results