scispace - formally typeset
Search or ask a question
Institution

University of Passau

EducationPassau, Bayern, Germany
About: University of Passau is a education organization based out in Passau, Bayern, Germany. It is known for research contribution in the topics: Computer science & Context (language use). The organization has 1543 authors who have published 4763 publications receiving 93338 citations.


Papers
More filters
Posted Content
TL;DR: In this paper, the authors developed a new method based on time series of accounting-based data to quantify the interest risk of banks and apply it to analyze the German banking system, and found evidence that their model yields a significantly better fit of banks' internally quantified interest rate risk than a standard approach that relies on one-point-in-time data.
Abstract: This paper describes the first thorough analysis of the interest risk of German banks on an individual bank level. We develop a new method that is based on time series of accountingbased data to quantify the interest risk of banks and apply it to analyze the German banking system. We find evidence that our model yields a significantly better fit of banks' internally quantified interest rate risk than a standard approach that relies on one-point-in-time data, and that the interest rate risk differs between banks of different size and banking group. Additionally, we find structural differences between trading book and non-trading book institutions.

30 citations

Journal ArticleDOI
TL;DR: The statistical distribution of three feature-related metrics collected from a corpus of 20 well-known and long-lived C-preprocessor-based systems from different domains is analyzed, showing that feature scattering is highly skewed and central statistics measures are reliable thresholds for tangling and nesting.
Abstract: Feature annotations (e.g., code fragments guarded by #ifdef C-preprocessor directives) control code extensions related to features. Feature annotations have long been said to be undesirable. When maintaining features that control many annotations, there is a high risk of ripple effects. Also, excessive use of feature annotations leads to code clutter, hinder program comprehension and harden maintenance. To prevent such problems, developers should monitor the use of feature annotations, for example, by setting acceptable thresholds. Interestingly, little is known about how to extract thresholds in practice, and which values are representative for feature-related metrics. To address this issue, we analyze the statistical distribution of three feature-related metrics collected from a corpus of 20 well-known and long-lived C-preprocessor-based systems from different domains. We consider three metrics: scattering degree of feature constants, tangling degree of feature expressions, and nesting depth of preprocessor annotations. Our findings show that feature scattering is highly skewed; in 14 systems (70 %), the scattering distributions match a power law, making averages and standard deviations unreliable limits. Regarding tangling and nesting, the values tend to follow a uniform distribution; although outliers exist, they have little impact on the mean, suggesting that central statistics measures are reliable thresholds for tangling and nesting. Following our findings, we then propose thresholds from our benchmark data, as a basis for further investigations.

30 citations

Journal ArticleDOI
TL;DR: This paper analyzes voting on a linear income tax whose proceeds are redistributed lump sum to the taxpayers and concludes that there may be equilibria where redistribution goes from the middle class to the rich and poor.
Abstract: This paper analyzes voting on a linear income tax whose proceeds are redistributed lump sum to the taxpayers. Individuals can evade taxes, which leads to penalties if evasion is detected. Since preferences satisfy neither single peakedness nor single crossing, a voting equilibrium may not exist. When an equilibrium does exist, there are several possible outcomes. There may be ‘conventional’ equilibria where the rich are expropriated by the poor and middle class. There may be equilibria without full expropriation where redistribution is limited by the threat of evasion. Finally, there may be equilibria where redistribution goes from the middle class to the rich and poor.

30 citations

Journal ArticleDOI
TL;DR: This article provides some new insight into the properties of four well-established classifier paradigms, namely support vector machines (SVM), classifiers based on mixture density models (CMM), fuzzy classifiers (FCL), and radial basis function neural networks (RBF).

29 citations

Journal ArticleDOI
TL;DR: In this paper, the authors consider countable couplings of finite-dimensional input-to-state stable systems and develop stability conditions of the small-gain type to guarantee that the whole system remains ISS and highlight the differences between finite and infinite couplings.

29 citations


Authors

Showing all 1643 results

NameH-indexPapersCitations
Björn Schuller8492934713
Thomas Zimmermann6825617984
David Eppstein6767220584
Matthias Jarke6259516345
Bernhard Steffen6134212396
Andreas Zeller6126417058
Christian Kästner5922810688
Donald Kossmann5825415953
Sven Apel5830511388
Michael Kaufmann5443010475
Paul Lukowicz5336311664
Alfons Kemper5234810467
Ulrik Brandes5023215316
Manfred Broy483759789
Gunter Saake474989464
Network Information
Related Institutions (5)
AT&T Labs
5.5K papers, 483.1K citations

87% related

Microsoft
86.9K papers, 4.1M citations

86% related

Hewlett-Packard
59.8K papers, 1.4M citations

86% related

Nokia
28.3K papers, 695.7K citations

85% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202371
2022120
2021320
2020309
2019321
2018369