[Introduction to] Wim Wenders: Making Films That Matter

Wim Wenders: Making Films That Matter is the first book in 15 years to take a comprehensive look at Wim Wenders\u27s extensive filmography. In addition to offering new insights into his cult masterpieces, the 10 essays in this volume highlight the thematic and aesthetic continuities between his early films and his latest productions. Wenders\u27s films have much to contribute to current conversations on intermediality, whether it be through his adaptations of important literary works or his filmic reinventions of famous paintings by Edward Hopper or Andrew Wyeth. Wenders has also positioned himself as a decidedly transnational and translingual filmmaker taking on the challenge of representing peripheral spaces without falling into the trap of a neo-colonial gaze. Making Films That Matter argues that Wenders remains a true innovator in both his experiments in 3D filmmaking and his attempts to define a visual poetics of peace. Please download the Introduction from the link above. You may purchase this book directly from the publisher from the link below.https://scholarship.richmond.edu/bookshelf/1380/thumbnail.jp

Block Gauss and anti-Gauss quadrature with application to networks

Approximations of matrix-valued functions of the form WT f(A)W, where A ∈Rm×m is symmetric, W ∈ Rm×k, with m large and k ≪ m, has orthonormal columns, and f is a function, can be computed by applying a few steps of the symmetric block Lanczos method to A with initial block-vector W ∈ Rm×k. Golub and Meurant have shown that the approximants obtained in this manner may be considered block Gauss quadrature rules associated with a matrix-valued measure. This paper generalizes anti-Gauss quadrature rules, introduced by Laurie for real-valued measures, to matrix-valued measures, and shows that under suitable conditions pairs of block Gauss and block anti-Gauss rules provide upper and lower bounds for the entries of the desired matrix-valued function. Extensions to matrix-valued functions of the form WT f(A)V , where A ∈ Rm×m may be nonsymmetric, and the matrices V, W ∈ Rm×k satisfy VT W = Ik also are discussed. Approximations of the latter functions are computed by applying a few steps of the nonsymmetric block Lanczos method to A with initial block-vectors V and W. We describe applications to the evaluation of functions of a symmetric or nonsymmetric adjacency matrix for a network. Numerical examples illustrate that a combination of block Gauss and anti-Gauss quadrature rules typically provides upper and lower bounds for such problems. We introduce some new quantities that describe properties of nodes in directed or undirected networks, and demonstrate how these and other quantities can be computed inexpensively with the quadrature rules of the present paper

The Possibilities of Classification of Emotional States Based on User Behavioral Characteristics

The classification of user's emotions based on their behavioral characteristic, namely their keyboard typing and mouse usage pattern is an effective and non-invasive way of gathering user's data without imposing any limitations on their ability to perform tasks. To gather data for the classifier we used an application, the Emotnizer, which we had developed for this purpose. The output of the classification is categorized into 4 emotional categories from Russel's complex circular model - happiness, anger, sadness and the state of relaxation. The sample of the reference database consisted of 50 students. Multiple regression analyses gave us a model, that allowed us to predict the valence and arousal of the subject based on the input from the keyboard and mouse. Upon re-testing with another test group of 50 students and processing the data we found out our Emotnizer program can classify emotional states with an average success rate of 82.31%

Optical and electrical characterization of poly-Si/SiOx contacts and their implications on solar cell design

Abstract The scope of this paper lies on the phenomenon of free-carrier absorption (FCA) in heavily phosphorus-doped poly-Si layers, applied at solar cells featuring poly-Si/SiO x passivating contacts at the rear. Firstly, FCA is investigated on test structures featuring poly-Si contacts of different thickness and doping level. Secondly, these passivating contacts are integrated into the rear of solar cells featuring a boron-diffused emitter at the front. The infrared (IR) response of the solar cells is analyzed and FCA losses are quantified. In agreement with theory, it is shown that J sc losses due to FCA increase with poly-Si doping level and thickness. For instance, a total J sc loss of ~0.5 mA/cm² is obtained for a 145 nm thick poly-Si layer with a doping concentration of 1.9x10 20 cm -3

On the Size of Weights in Randomized Search Heuristics

Runtime analyses of randomized search heuristics for combinatorial optimization problems often depend on the size of the largest weight. We consider replacing the given set of weights with smaller weights such that the behavior of the randomized search heuristic does not change. Upper bounds on the size of the new, equivalent weights allow us to obtain upper bounds on the expected runtime of such randomized search heuristics independent of the size of the actual weights. Furthermore we give lower bounds on the largest weights for worst-case instances. Finally we present some experimental results, including examples for worst-case instances

Modeling and Experimental Investigation of Resonant Viscosity and Mass Density Sensors Considering their Cross-Sensitivity to Temperature

AbstractIn this contribution we discuss a generalized, reduced order model for resonant viscosity and mass density sensors which considers also the devices’ cross sensitivities to temperature. The applicability of the model is substantiated by experimental results from measurements obtained with a circular steel tuning fork in various liquids and temperatures. Advantages of this model are its simplicity, its general applicability for resonant mass density and viscosity sensors which furthermore facilitates the comparison of different sensors

The SHAP Microarchitecture and Java Virtual Machine

This report presents the SHAP platform consisting of its microarchitecture and its implementation of the Java Virtual Machine (JVM). Like quite a few other embedded implementations of the Java platform, the SHAP microarchitecture relies on an instruction set architecture based on Java bytecode. Unlike them, it, however, features a design with well-encapsulated components autonomously managing their duties on rather high abstraction levels. Thus, permanent runtime duties are transferred from the central computing core to concurrently working components so that it can actually spent a larger fraction of time executing application code. The degree of parallelity between the application and the runtime implementation is increased. Currently, the stack and heap management including the automatic garbage collection are implemented this way. After detailing the design of the microarchitecture, the SHAP implementation of the Java Virtual Machine is described. A major focus is laid on the presentation of the layout and the use of the runtime data structures representing the various language abstractions provided by Java. Also, the boot sequence starting the JVM is described