### Refine

#### Year of publication

#### Document Type

- Preprint (567) (remove)

#### Language

- English (530)
- German (34)
- Multiple languages (2)
- French (1)

#### Keywords

- index (11)
- boundary value problems (9)
- elliptic operators (9)
- Fredholm property (8)
- K-theory (7)
- manifolds with singularities (6)
- pseudodifferential operators (6)
- relative index (6)
- Atiyah-Patodi-Singer theory (5)
- index theory (5)

#### Institute

- Institut für Mathematik (378)
- Interdisziplinäres Zentrum für Dynamik komplexer Systeme (52)
- Institut für Physik und Astronomie (44)
- Institut für Biochemie und Biologie (20)
- Institut für Psychologie (20)
- Institut für Anglistik und Amerikanistik (19)
- Institut für Erd- und Umweltwissenschaften (11)
- Institut für Chemie (8)
- Extern (7)
- Institut für Sportmedizin und Prävention (7)

The Collatz conjecture is a number theoretical problem, which has puzzled countless researchers using myriad approaches. Presently, there are scarcely any methodologies to describe and treat the problem from the perspective of the Algebraic Theory of Automata. Such an approach is promising with respect to facilitating the comprehension of the Collatz sequences "mechanics". The systematic technique of a state machine is both simpler and can fully be described by the use of algebraic means.
The current gap in research forms the motivation behind the present contribution. The present authors are convinced that exploring the Collatz conjecture in an algebraic manner, relying on findings and fundamentals of Graph Theory and Automata Theory, will simplify the problem as a whole.

In a bounded domain with smooth boundary in R^3 we consider the stationary Maxwell equations
for a function u with values in R^3 subject to a nonhomogeneous condition
(u,v)_x = u_0 on
the boundary, where v is a given vector field and u_0 a function on the boundary. We specify this problem within the framework of the Riemann-Hilbert boundary value problems for the Moisil-Teodorescu system. This latter is proved to satisfy the Shapiro-Lopaniskij condition if an only if the vector v is at no point tangent to the boundary. The Riemann-Hilbert problem for the Moisil-Teodorescu system fails to possess an adjoint boundary value problem with respect to the Green formula, which satisfies the Shapiro-Lopatinskij condition. We develop the construction of Green formula to get a proper concept of adjoint boundary value problem.

The present work will introduce a Finite State Machine (FSM) that processes any Collatz Sequence; further, we will endeavor to investigate its behavior in relationship to transformations of a special infinite input. Moreover, we will prove that the machine’s word transformation is equivalent to the standard Collatz number transformation and subsequently discuss the possibilities for use of this approach at solving similar problems. The benefit of this approach is that the investigation of the word transformation performed by the Finite State Machine is less complicated than the traditional number-theoretical transformation.

This essay reads Sam Selvon’s novel The Lonely Londoners (1956) as a milestone in the decolonisation of British fiction. After an introduction to Selvon and the core composition of the novel, it discusses the ways in which the narrative takes on issues of race and racism, how it in the tradition of the Trinidadian carnival confronts audiences with sexual profanation and black masculine swagger, and not least how the novel, especially through its elaborate use of creole Englishes, reimagines London as a West Indian metropolis. The essay then turns more systematically to the ways in which Selvon translates Western literary models and their isolated subject positions into collective modes of narrative performance taken from Caribbean orature and the calypsonian tradition. The Lonely Londoners breathes entirely new life into the ossified conventions of the English novel, and imbues it with unforeseen aesthetic, ethical, political and epistemological possibilities.

This is a brief survey of a constructive technique of analytic continuation related to an explicit integral formula of Golusin and Krylov (1933). It goes far beyond complex analysis and applies to the Cauchy problem for elliptic partial differential equations as well. As started in the classical papers, the technique is elaborated in generalised Hardy spaces also called Hardy-Smirnov spaces.

In order to evade detection by network-traffic analysis, a growing proportion of malware uses the encrypted HTTPS protocol. We explore the problem of detecting malware on client computers based on HTTPS traffic analysis. In this setting, malware has to be detected based on the host IP address, ports, timestamp, and data volume information of TCP/IP packets that are sent and received by all the applications on the client. We develop a scalable protocol that allows us to collect network flows of known malicious and benign applications as training data and derive a malware-detection method based on a neural networks and sequence classification. We study the method's ability to detect known and new, unknown malware in a large-scale empirical study.

Convoluted Brownian motion
(2016)

In this paper we analyse semimartingale properties of a class of Gaussian periodic processes, called convoluted Brownian motions, obtained by convolution between a deterministic function and a Brownian motion. A classical
example in this class is the periodic Ornstein-Uhlenbeck process. We compute their characteristics and show that in general, they are neither
Markovian nor satisfy a time-Markov field property. Nevertheless, by enlargement
of filtration and/or addition of a one-dimensional component, one can in some case recover the Markovianity. We treat exhaustively the case of the bidimensional trigonometric convoluted Brownian motion and the higher-dimensional monomial convoluted Brownian motion.

We consider a statistical inverse learning problem, where we observe the image of a function f through a linear operator A at i.i.d. random design points X_i, superposed with an additional noise. The distribution of the design points is unknown and can be very general. We analyze simultaneously the direct (estimation of Af) and the inverse (estimation of f) learning problems. In this general framework, we obtain strong and weak minimax optimal rates of convergence (as the number of observations n grows large) for a large class of spectral regularization methods over regularity classes defined through appropriate source conditions. This improves on or completes previous results obtained in related settings. The optimality of the obtained rates is shown not only in the exponent in n but also in the explicit dependence of the constant factor in the variance of the noise and the radius of the source condition set.