Search results for "35"
showing 10 items of 2413 documents
Synaptic scaling generically stabilizes circuit connectivity
2011
Neural systems regulate synaptic plasticity avoiding overly strong growth or shrinkage of the connections, thereby keeping the circuit architecture operational. Accordingly, several experimental studies have shown that synaptic weights increase only in direct relation to their current value, resulting in reduced growth for stronger synapses [1]. It is, however, difficult to extract from these studies unequivocal evidence about the underlying biophysical mechanisms that control weight growth. The theoretical neurosciences have addressed this problem by exploring mechanisms for synaptic weight change that contain limiting factors to regulate growth [2]. The effectiveness of these mechanisms i…
CCDC 1950443: Experimental Crystal Structure Determination
2021
Related Article: Liu-Pan Yang, Li Zhang, Mao Quan, Jas S. Ward, Yan-Long Ma, Hang Zhou, Kari Rissanen, Wei Jiang|2020|Nat.Commun.|11|2740|doi:10.1038/s41467-020-16534-9
CCDC 1913148: Experimental Crystal Structure Determination
2019
Related Article: Hongxin Chai, Zhi-Sheng Pan, Liu-Pan Yang, Shan He, Fangfang Pan, Kari Rissanen, Wei Jiang|2019|Chem.Commun.|55|7768|doi:10.1039/C9CC03341F
Non-autonomous rough semilinear PDEs and the multiplicative Sewing Lemma
2021
We investigate existence, uniqueness and regularity for local solutions of rough parabolic equations with subcritical noise of the form $du_t- L_tu_tdt= N(u_t)dt + \sum_{i = 1}^dF_i(u_t)d\mathbf X^i_t$ where $(L_t)_{t\in[0,T]}$ is a time-dependent family of unbounded operators acting on some scale of Banach spaces, while $\mathbf X\equiv(X,\mathbb X)$ is a two-step (non-necessarily geometric) rough path of H\"older regularity $\gamma >1/3.$ Besides dealing with non-autonomous evolution equations, our results also allow for unbounded operations in the noise term (up to some critical loss of regularity depending on that of the rough path $\mathbf X$). As a technical tool, we introduce a versi…
On First-Passage-Time Densities for Certain Symmetric Markov Chains
2004
The spatial symmetry property of truncated birth-death processes studied in Di Crescenzo [6] is extended to a wider family of continuous-time Markov chains. We show that it yields simple expressions for first-passage-time densities and avoiding transition probabilities, and apply it to a bilateral birth-death process with jumps. It is finally proved that this symmetry property is preserved within the family of strongly similar Markov chains.
Rough McKean-Vlasov dynamics for robust ensemble Kalman filtering
2021
Motivated by the challenge of incorporating data into misspecified and multiscale dynamical models, we study a McKean-Vlasov equation that contains the data stream as a common driving rough path. This setting allows us to prove well-posedness as well as continuity with respect to the driver in an appropriate rough-path topology. The latter property is key in our subsequent development of a robust data assimilation methodology: We establish propagation of chaos for the associated interacting particle system, which in turn is suggestive of a numerical scheme that can be viewed as an extension of the ensemble Kalman filter to a rough-path framework. Finally, we discuss a data-driven method bas…
Coupled conditional backward sampling particle filter
2020
The conditional particle filter (CPF) is a promising algorithm for general hidden Markov model smoothing. Empirical evidence suggests that the variant of CPF with backward sampling (CBPF) performs well even with long time series. Previous theoretical results have not been able to demonstrate the improvement brought by backward sampling, whereas we provide rates showing that CBPF can remain effective with a fixed number of particles independent of the time horizon. Our result is based on analysis of a new coupling of two CBPFs, the coupled conditional backward sampling particle filter (CCBPF). We show that CCBPF has good stability properties in the sense that with fixed number of particles, …
From Feynman–Kac formulae to numerical stochastic homogenization in electrical impedance tomography
2016
In this paper, we use the theory of symmetric Dirichlet forms to derive Feynman–Kac formulae for the forward problem of electrical impedance tomography with possibly anisotropic, merely measurable conductivities corresponding to different electrode models on bounded Lipschitz domains. Subsequently, we employ these Feynman–Kac formulae to rigorously justify stochastic homogenization in the case of a stochastic boundary value problem arising from an inverse anomaly detection problem. Motivated by this theoretical result, we prove an estimate for the speed of convergence of the projected mean-square displacement of the underlying process which may serve as the theoretical foundation for the de…
An elementary formula for computing shape derivatives of EFIE system matrix
2012
We derive analytical shape derivative formulas of the system matrix representing electric field integral equation discretized with Raviart-Thomas basis functions. The arising integrals are easy to compute with similar methods as the entries of the original system matrix. The results are compared to derivatives computed with automatic differentiation technique and finite differences, and are found to be in excellent agreement.
Guaranteed error control bounds for the stabilised space-time IgA approximations to parabolic problems
2017
The paper is concerned with space-time IgA approximations of parabolic initial-boundary value problems. We deduce guaranteed and fully computable error bounds adapted to special features of IgA approximations and investigate their applicability. The derivation method is based on the analysis of respective integral identities and purely functional arguments. Therefore, the estimates do not contain mesh-dependent constants and are valid for any approximation from the admissible (energy) class. In particular, they provide computable error bounds for norms associated with stabilised space-time IgA approximations as well as imply efficient error indicators enhancing the performance of fully adap…