TY - INPR A1 - Aizenberg, Lev A. A1 - Tarkhanov, Nikolai Nikolaevich T1 - An integral formula for the number of lattice points in a domain N2 - Using the multidimensional logarithmic residue we show a simple formula for the difference between the number of integer points in a bounded domain of R^n and the volume of this domain. The difference proves to be the integral of an explicit differential form over the boundary of the domain. T3 - Preprints des Instituts für Mathematik der Universität Potsdam - 3 (2014) 3 KW - logarithmic residue KW - lattice point Y1 - 2014 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-70453 SN - 2193-6943 VL - 3 IS - 3 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - JOUR A1 - Alsaedy, Ammar A1 - Tarkhanov, Nikolai Nikolaevich T1 - Normally solvable nonlinear boundary value problems JF - Nonlinear analysis : theory, methods & applications ; an international multidisciplinary journal N2 - We investigate nonlinear problems which appear as Euler-Lagrange equations for a variational problem. They include in particular variational boundary value problems for nonlinear elliptic equations studied by F. Browder in the 1960s. We establish a solvability criterion of such problems and elaborate an efficient orthogonal projection method for constructing approximate solutions. KW - Nonlinear Laplace operator KW - Boundary value problem KW - Dirichlet to Neumann operator Y1 - 2014 U6 - https://doi.org/10.1016/j.na.2013.09.024 SN - 0362-546X SN - 1873-5215 VL - 95 SP - 468 EP - 482 PB - Elsevier CY - Oxford ER - TY - JOUR A1 - Amezcua, Javier A1 - Ide, Kayo A1 - Kalnay, Eugenia A1 - Reich, Sebastian T1 - Ensemble transform Kalman-Bucy filters JF - Quarterly journal of the Royal Meteorological Society N2 - Two recent works have adapted the Kalman-Bucy filter into an ensemble setting. In the first formulation, the ensemble of perturbations is updated by the solution of an ordinary differential equation (ODE) in pseudo-time, while the mean is updated as in the standard Kalman filter. In the second formulation, the full ensemble is updated in the analysis step as the solution of single set of ODEs in pseudo-time. Neither requires matrix inversions except for the frequently diagonal observation error covariance. We analyse the behaviour of the ODEs involved in these formulations. We demonstrate that they stiffen for large magnitudes of the ratio of background error to observational error variance, and that using the integration scheme proposed in both formulations can lead to failure. A numerical integration scheme that is both stable and is not computationally expensive is proposed. We develop transform-based alternatives for these Bucy-type approaches so that the integrations are computed in ensemble space where the variables are weights (of dimension equal to the ensemble size) rather than model variables. Finally, the performance of our ensemble transform Kalman-Bucy implementations is evaluated using three models: the 3-variable Lorenz 1963 model, the 40-variable Lorenz 1996 model, and a medium complexity atmospheric general circulation model known as SPEEDY. The results from all three models are encouraging and warrant further exploration of these assimilation techniques. KW - Kalman-Bucy Filter KW - Ensemble Kalman Filter KW - stiff ODE KW - weight-based formulations Y1 - 2014 U6 - https://doi.org/10.1002/qj.2186 SN - 0035-9009 SN - 1477-870X VL - 140 IS - 680 SP - 995 EP - 1004 PB - Wiley-Blackwell CY - Hoboken ER - TY - CHAP A1 - Andersson, H. A1 - Keunecke, A. A1 - Eser, A. A1 - Huisinga, Wilhelm A1 - Reinisch, W. A1 - Kloft, Charlotte T1 - Pharmacokinetic considerations for optimising dosing regimens of a potsdam univ infliximab in patients with Crohn's disease T2 - JOURNAL OF CROHNS & COLITIS Y1 - 2014 U6 - https://doi.org/10.1016/S1873-9946(14)60086-6 SN - 1873-9946 SN - 1876-4479 VL - 8 SP - S44 EP - S44 PB - Oxford Univ. Press CY - Oxford ER - TY - JOUR A1 - Baerenzung, Julien A1 - Holschneider, Matthias A1 - Lesur, Vincent T1 - Bayesian inversion for the filtered flow at the Earth's core-mantle boundary JF - Journal of geophysical research : Solid earth N2 - The inverse problem of determining the flow at the Earth's core-mantle boundary according to an outer core magnetic field and secular variation model has been investigated through a Bayesian formalism. To circumvent the issue arising from the truncated nature of the available fields, we combined two modeling methods. In the first step, we applied a filter on the magnetic field to isolate its large scales by reducing the energy contained in its small scales, we then derived the dynamical equation, referred as filtered frozen flux equation, describing the spatiotemporal evolution of the filtered part of the field. In the second step, we proposed a statistical parametrization of the filtered magnetic field in order to account for both its remaining unresolved scales and its large-scale uncertainties. These two modeling techniques were then included in the Bayesian formulation of the inverse problem. To explore the complex posterior distribution of the velocity field resulting from this development, we numerically implemented an algorithm based on Markov chain Monte Carlo methods. After evaluating our approach on synthetic data and comparing it to previously introduced methods, we applied it to a magnetic field model derived from satellite data for the single epoch 2005.0. We could confirm the existence of specific features already observed in previous studies. In particular, we retrieved the planetary scale eccentric gyre characteristic of flow evaluated under the compressible quasi-geostrophy assumption although this hypothesis was not considered in our study. In addition, through the sampling of the velocity field posterior distribution, we could evaluate the reliability, at any spatial location and at any scale, of the flow we calculated. The flow uncertainties we determined are nevertheless conditioned by the choice of the prior constraints we applied to the velocity field. Y1 - 2014 U6 - https://doi.org/10.1002/2013JB010358 SN - 2169-9313 SN - 2169-9356 VL - 119 IS - 4 SP - 2695 EP - 2720 PB - American Geophysical Union CY - Washington ER - TY - JOUR A1 - Bagderina, Yulia Yu. A1 - Tarkhanov, Nikolai Nikolaevich T1 - Differential invariants of a class of Lagrangian systems with two degrees of freedom JF - Journal of mathematical analysis and applications KW - Equivalence KW - Differential invariant KW - Euler-Lagrange equations Y1 - 2014 U6 - https://doi.org/10.1016/j.jmaa.2013.08.015 SN - 0022-247X SN - 1096-0813 VL - 410 IS - 2 SP - 733 EP - 749 PB - Elsevier CY - San Diego ER - TY - JOUR A1 - Becker, Christian T1 - Relative differential cohomology JF - Lecture notes in mathematics : a collection of informal reports and seminars JF - Lecture Notes in Mathematics N2 - We study two notions of relative differential cohomology, using the model of differential characters. The two notions arise from the two options to construct relative homology, either by cycles of a quotient complex or of a mapping cone complex. We discuss the relation of the two notions of relative differential cohomology to each other. We discuss long exact sequences for both notions, thereby clarifying their relation to absolute differential cohomology. We construct the external and internal product of relative and absolute characters and show that relative differential cohomology is a right module over the absolute differential cohomology ring. Finally we construct fiber integration and transgression for relative differential characters. Y1 - 2014 SN - 978-3-319-07034-6; 978-3-319-07033-9 U6 - https://doi.org/10.1007/978-3-319-07034-6_2 SN - 0075-8434 VL - 2112 SP - 91 EP - 180 PB - Springer CY - Berlin ER - TY - JOUR A1 - Blanchard, Gilles A1 - Delattre, Sylvain A1 - Roquain, Etienne T1 - Testing over a continuum of null hypotheses with False Discovery Rate control JF - Bernoulli : official journal of the Bernoulli Society for Mathematical Statistics and Probability N2 - We consider statistical hypothesis testing simultaneously over a fairly general, possibly uncountably infinite, set of null hypotheses, under the assumption that a suitable single test (and corresponding p-value) is known for each individual hypothesis. We extend to this setting the notion of false discovery rate (FDR) as a measure of type I error. Our main result studies specific procedures based on the observation of the p-value process. Control of the FDR at a nominal level is ensured either under arbitrary dependence of p-values, or under the assumption that the finite dimensional distributions of the p-value process have positive correlations of a specific type (weak PRDS). Both cases generalize existing results established in the finite setting. Its interest is demonstrated in several non-parametric examples: testing the mean/signal in a Gaussian white noise model, testing the intensity of a Poisson process and testing the c.d.f. of i.i.d. random variables. KW - continuous testing KW - false discovery rate KW - multiple testing KW - positive correlation KW - step-up KW - stochastic process Y1 - 2014 U6 - https://doi.org/10.3150/12-BEJ488 SN - 1350-7265 SN - 1573-9759 VL - 20 IS - 1 SP - 304 EP - 333 PB - International Statistical Institute CY - Voorburg ER - TY - JOUR A1 - Blanchard, Gilles A1 - Dickhaus, Thorsten A1 - Roquain, Etienne A1 - Villers, Fanny T1 - On least favorable configurations for step-up-down tests JF - Statistica Sinica KW - False discovery rate KW - least favorable configuration KW - multiple testing; Y1 - 2014 U6 - https://doi.org/10.5705/ss.2011.205 SN - 1017-0405 SN - 1996-8507 VL - 24 IS - 1 SP - 1 EP - U31 PB - Statistica Sinica, Institute of Statistical Science, Academia Sinica CY - Taipei ER - TY - JOUR A1 - Bubenzer, Johannes T1 - Cycle-aware minimization of acyclic deterministic finite-state automata JF - Discrete applied mathematics N2 - In this paper a linear-time algorithm for the minimization of acyclic deterministic finite-state automata is presented. The algorithm runs significantly faster than previous algorithms for the same task. This is shown by a comparison of the running times of both algorithms. Additionally, a variation of the new algorithm is presented which handles cyclic automata as input. The new cycle-aware algorithm minimizes acyclic automata in the desired way. In case of cyclic input, the algorithm minimizes all acyclic suffixes of the input automaton. KW - Minimization KW - Deterministic finite state automata KW - Algorithmic Y1 - 2014 U6 - https://doi.org/10.1016/j.dam.2013.08.003 SN - 0166-218X SN - 1872-6771 VL - 163 SP - 238 EP - + PB - Elsevier CY - Amsterdam ER -