4,296 Hits in 1.5 sec

Visual Representations of Christianity in Christian Music Videos

Andreas Häger
2005 Temenos  
This article discusses Christian rock videos. Videos from a collection entitled Wow Hits 2002: the year's top Christian music videos are used as examples.  ...  How may the videos be seen as visual representations of Christianity? Using a semiotic framework, two possible types of such representations of Christianity in the videos are discussed.  ...  For more on O'Connor, see Häger (2005) . For a somewhat more detailed methodological discussion on the analysis of visual aspects of Christian rock, see Häger (2003) .  ... 
doi:10.33356/temenos.4782 fatcat:xlu4xiadd5a3fojsacebfr2wpq

Miscorrection-free Decoding of Staircase Codes [article]

Christian Häger, Henry D. Pfister
2017 arXiv   pre-print
We propose a novel decoding algorithm for staircase codes which reduces the effect of undetected component code miscorrections. The algorithm significantly improves performance, while retaining a low-complexity implementation suitable for high-speed optical transport networks.
arXiv:1709.06827v1 fatcat:xfnl66mhuvgoxdusszqwjikxsi

Data-Driven Upper Bounds on Channel Capacity [article]

Christian Häger, Erik Agrell
2022 arXiv   pre-print
Häger and E. Agrell are with the Department of Electrical Engineering, Chalmers University of Technology, 41296 Gothenburg, Sweden (email: {hagerc, agrell} input-output samples.  ... 
arXiv:2205.06471v1 fatcat:cg7smu2ucbe3fooqbla7vreix4

Nonlinear Interference Mitigation via Deep Neural Networks [article]

Christian Häger, Henry D. Pfister
2017 arXiv   pre-print
A neural-network-based approach is presented to efficiently implement digital backpropagation (DBP). For a 32x100 km fiber-optic link, the resulting "learned" DBP significantly reduces the complexity compared to conventional DBP implementations.
arXiv:1710.06234v1 fatcat:2s5b6egwkjbg3bwmu2vrdpwdjq

Optimal stopping with signatures [article]

Christian Bayer and Paul Hager and Sebastian Riedel and John Schoenmakers
2021 arXiv   pre-print
We propose a new method for solving optimal stopping problems (such as American option pricing in finance) under minimal assumptions on the underlying stochastic process X. We consider classic and randomized stopping times represented by linear and non-linear functionals of the rough path signature 𝕏^<∞ associated to X, and prove that maximizing over these classes of signature stopping times, in fact, solves the original optimal stopping problem. Using the algebraic properties of the signature,
more » ... we can then recast the problem as a (deterministic) optimization problem depending only on the (truncated) expected signature 𝔼[ 𝕏^≤ N_0,T]. By applying a deep neural network approach to approximate the non-linear signature functionals, we can efficiently solve the optimal stopping problem numerically. The only assumption on the process X is that it is a continuous (geometric) random rough path. Hence, the theory encompasses processes such as fractional Brownian motion, which fail to be either semi-martingales or Markov processes, and can be used, in particular, for American-type option pricing in fractional models, e.g. on financial or electricity markets.
arXiv:2105.00778v1 fatcat:txx6ot2dtjajzdde2dodlqzsau

Reinforced optimal control [article]

Christian Bayer, Denis Belomestny, Paul Hager, Paolo Pigato, John Schoenmakers, Vladimir Spokoiny
2022 arXiv   pre-print
Least squares Monte Carlo methods are a popular numerical approximation method for solving stochastic control problems. Based on dynamic programming, their key feature is the approximation of the conditional expectation of future rewards by linear least squares regression. Hence, the choice of basis functions is crucial for the accuracy of the method. Earlier work by some of us [Belomestny, Schoenmakers, Spokoiny, Zharkynbay. Commun.~Math.~Sci., 18(1):109-121, 2020](arXiv:1808.02341) proposes
more » ... reinforce the basis functions in the case of optimal stopping problems by already computed value functions for later times, thereby considerably improving the accuracy with limited additional computational cost. We extend the reinforced regression method to a general class of stochastic control problems, while considerably improving the method's efficiency, as demonstrated by substantial numerical examples as well as theoretical analysis.
arXiv:2011.12382v2 fatcat:geqs7ryvwvba5dxywgtyxhaowi

Physics-Based Deep Learning for Fiber-Optic Communication Systems [article]

Christian Häger, Henry D. Pfister
2020 arXiv   pre-print
Häger is with the Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden and H. D.  ... 
arXiv:2010.14258v1 fatcat:vpee25gvszgbjn3ivcudubp5qu

Guide Me: Interacting with Deep Networks [article]

Christian Rupprecht, Iro Laina, Nassir Navab, Gregory D. Hager, Federico Tombari
2018 arXiv   pre-print
Interaction and collaboration between humans and intelligent machines has become increasingly important as machine learning methods move into real-world applications that involve end users. While much prior work lies at the intersection of natural language and vision, such as image captioning or image generation from text descriptions, less focus has been placed on the use of language to guide or improve the performance of a learned visual processing algorithm. In this paper, we explore methods
more » ... to flexibly guide a trained convolutional neural network through user input to improve its performance during inference. We do so by inserting a layer that acts as a spatio-semantic guide into the network. This guide is trained to modify the network's activations, either directly via an energy minimization scheme or indirectly through a recurrent model that translates human language queries to interaction weights. Learning the verbal interaction is fully automatic and does not require manual text annotations. We evaluate the method on two datasets, showing that guiding a pre-trained network can improve performance, and provide extensive insights into the interaction between the guide and the CNN.
arXiv:1803.11544v1 fatcat:czxjztoozvajtppn74vhuildii

Like a Prophet - On Christian Interpretations of a Madonna Video

Andreas Häger
1996 Scripta Instituti Donneriani Aboensis  
But there is also another aspect to the Christian discourse on popular music. Some Christians try to emphasise what is perceived as a positive message in "secular" rock music.  ...  More specifically, the article examines some examples of Christian views on popular music.  ...  Christian way.  ... 
doi:10.30674/scripta.67227 fatcat:fywrmcartzhmda7zesa6xshd7i

Christian rock concerts as a meeting between religion and popular culture

Andreas Häger
2003 Scripta Instituti Donneriani Aboensis  
The genre of "contemporary Christian music", or Christian rock, stands by definition with one foot in established institutional (in practicality often evangelical) Christianity, and the other in the commercial  ...  This paper deals with a contemporary form of religious music, Christian rock.  ...  Hager 2001 for a closer study) is the desire to sell records beyond the Christian bookstores and to play in other venues than churches.  ... 
doi:10.30674/scripta.67281 fatcat:p5ydpzraknfyfhwatmh73tygai

Autoencoder-Based Unequal Error Protection Codes [article]

Vukan Ninkovic, Dejan Vukobratovic, Christian Häger, Henk Wymeersch, Alexandre Graell i Amat
2021 arXiv   pre-print
Häger, H. Wymeersch, and A.  ... 
arXiv:2104.08190v1 fatcat:4mt3awgh7bb4dnbtq75trdh5sy

Drachenspannung – Hatha-Yoga trifft Spiraldynamik

Christian Larsen, Theda van Lessen, Eva Hager-Forstenlechner
2021 physiopraxis  
Damit und mit vielen weiteren spannenden Fragestellungen hat sich das Autorentrio Christian Larsen, Theda van Lessen und Eva Hager-Forstenlechner im Buch "Medical Yoga professional" beschäftigt, das nun  ...  Christian Larsen, Theda van Lessen, Eva Hager- Forstenlechner ABB. 1 Beim Stemmen in den Seitstütz kommt es auf Länge in der Längsachse und die Breite zwischen den Schultern an.  ...  → YOGA praktischer Teil: Asanas mit Eva Hager-Forstenlechner → MEDICAL Fallbeispiele mit Christian Larsen → Schlussrunde, Perspektiven Dieses Dokument wurde zum persönlichen Gebrauch heruntergeladen.  ... 
doi:10.1055/a-1291-7342 fatcat:g5w3v3yvlvejnkaxvg6vx2mceq

Decoding Reed-Muller Codes Using Minimum-Weight Parity Checks [article]

Elia Santi, Christian Häger, Henry D. Pfister
2018 arXiv   pre-print
Reed-Muller (RM) codes exhibit good performance under maximum-likelihood (ML) decoding due to their highly-symmetric structure. In this paper, we explore the question of whether the code symmetry of RM codes can also be exploited to achieve near-ML performance in practice. The main idea is to apply iterative decoding to a highly-redundant parity-check (PC) matrix that contains only the minimum-weight dual codewords as rows. As examples, we consider the peeling decoder for the binary erasure
more » ... nel, linear-programming and belief propagation (BP) decoding for the binary-input additive white Gaussian noise channel, and bit-flipping and BP decoding for the binary symmetric channel. For short block lengths, it is shown that near-ML performance can indeed be achieved in many cases. We also propose a method to tailor the PC matrix to the received observation by selecting only a small fraction of useful minimum-weight PCs before decoding begins. This allows one to both improve performance and significantly reduce complexity compared to using the full set of minimum-weight PCs.
arXiv:1804.10319v1 fatcat:dx6o3qq4kbbubiyqibnfxlunp4

Approaching Miscorrection-free Performance of Product and Generalized Product Codes [article]

Christian Häger, Henry D. Pfister
2017 arXiv   pre-print
Product codes (PCs) protect a two-dimensional array of bits using short component codes. Assuming transmission over the binary symmetric channel, the decoding is commonly performed by iteratively applying bounded-distance decoding to the component codes. For this coding scheme, undetected errors in the component decoding-also known as miscorrections-significantly degrade the performance. In this paper, we propose a novel iterative decoding algorithm for PCs which can detect and avoid most
more » ... rections. The algorithm can also be used to decode many recently proposed classes of generalized PCs such as staircase, braided, and half-product codes. Depending on the component code parameters, our algorithm significantly outperforms the conventional iterative decoding method. As an example, for double-error-correcting Bose-Chaudhuri-Hocquenghem component codes, the net coding gain can be increased by up to 0.4 dB. Moreover, the error floor can be lowered by orders of magnitude, up to the point where the decoder performs virtually identical to a genie-aided decoder that avoids all miscorrections. We also discuss post-processing techniques that can be used to reduce the error floor even further.
arXiv:1711.07805v1 fatcat:um5o44u7lbfy7adehwfoyffc34

Randomized optimal stopping algorithms and their convergence analysis [article]

Christian Bayer, Denis Belomestny, Paul Hager, Paolo Pigato, John Schoenmakers
2020 arXiv   pre-print
In this paper we study randomized optimal stopping problems and consider corresponding forward and backward Monte Carlo based optimisation algorithms. In particular we prove the convergence of the proposed algorithms and derive the corresponding convergence rates.
arXiv:2002.00816v1 fatcat:dquqswltuzfxrds3ayx5dqqyhm
« Previous Showing results 1 — 15 out of 4,296 results