2020, Diehl, Joscha, Ebrahimi-Fard, Kurusch, Tapia, Nikolas

In data science, one is often confronted with a time series representing measurements of some quantity of interest. Usually, in a first step, features of the time series need to be extracted. These are numerical quantities that aim to succinctly describe the data and to dampen the influence of noise. In some applications, these features are also required to satisfy some invariance properties. In this paper, we concentrate on time-warping invariants. We show that these correspond to a certain family of iterated sums of the increments of the time series, known as quasisymmetric functions in the mathematics literature. We present these invariant features in an algebraic framework, and we develop some of their basic properties. © 2020, The Author(s).

2014, Li, L., Kurths, J., Yang, Y., Liu, G.

In recent years, the complex network as the frontier of complex system has received more and more attention. Peer-to-peer (P2P) networks with openness, anonymity, and dynamic nature are vulnerable and are easily attacked by peers with malicious behaviors. Building trusted relationships among peers in a large-scale distributed P2P system is a fundamental and challenging research topic. Based on interpersonal relationships among peers of large-scale P2P networks, we present prevention and trust evaluation scheme, called IRTrust. The framework incorporates a strategy of identity authentication and a global trust of peers to improve the ability of resisting the malicious behaviors. It uses the quality of service (QoS), quality of recommendation (QoR), and comprehensive risk factor to evaluate the trustworthiness of a peer, which is applicable for large-scale unstructured P2P networks. The proposed IRTrust can defend against several kinds of malicious attacks, such as simple malicious attacks, collusive attacks, strategic attacks, and sybil attacks. Our simulation results show that the proposed scheme provides greater accuracy and stronger resistance compared with existing global trust schemes. The proposed scheme has potential application in secure P2P network coding.

2020, Paolozzi, L., Cardarelli, R., Débieux, S., Favre, Y., Ferrère, D., Gonzalez-Sevilla, S., Iacobucci, G., Kaynak, M., Martinelli, F., Nessi, M., Rücker, H., Sanna, I., Sultan, D.M.S., Valerio, P., Zaffaroni, E.

SiGe BiCMOS technology can be used to produce ultra-fast, low-power silicon pixel sensors that provide state-of-the-art time resolution even without internal gain. The development of such sensors requires the identification and control of the main factors that may degrade the timing performance as well as the characterisation of the dependance of the sensor time resolution on the amplifier power consumption. Measurements with a 90Sr source of a prototype sensor produced in SG13G2 technology from IHP Microelectronics shows a time resolution of 140 ps at an amplifier current of 7 µA and 45 ps at a power consumption of 150 µA. The resolution on the measurement of the signal time-over-threshold, which is used to correct for time walk, is the main factor affecting the timing performance of this prototype. c 2020 CERN. Published by IOP Publishing Ltd on behalf of Sissa Medialab.

2012, Dryanov, D., Petrov, P.

In mathematics, the term approximation usually means either interpolation on a point set or approximation with respect to a given distance. There is a concept, which joins the two approaches together, and this is the concept of characterization of the best approximants via interpolation. It turns out that for some large classes of functions the best approximants with respect to a certain distance can be constructed by interpolation on a point set that does not depend on the choice of the function to be approximated. Such point sets are called canonical sets of best approximation. The present paper summarizes results on canonical sets of best L1-approximation with emphasis on multivariate interpolation and best L1-approximation by blending functions. The best L1-approximants are characterized as transfinite interpolants on canonical sets. The notion of a Haar-Chebyshev system in the multivariate case is discussed also. In this context, it is shown that some multivariate interpolation spaces share properties of univariate Haar-Chebyshev systems. We study also the problem of best one-sided multivariate L 1-approximation by sums of univariate functions. Explicit constructions of best one-sided L1-approximants give rise to well-known and new inequalities.

2020, Wei, Ruoyu, Cao, Jinde, Kurths, Jürgen

In this paper, with the quaternion number and time-varying coefficients introduced into traditional BAMNNs, the model of quaternion-valued BAMNNs are formulated. For the first time, fixed-time stabilization of time-varying quaternion-valued BAMNNs is investigated. A novel fixed-time control method is adopted, in which the choice of the Lyapunov function is more general than in most previous results. To cope with the noncommutativity of the quaternion multiplication, two different fixed-time control methods are provided, a decomposition method and a non-decomposition method. Furthermore, to reduce the control strength and improve control efficiency, an adaptive fixed-time control strategy is proposed. Lastly, numerical examples are presented to demonstrate the effectiveness of the theoretical results. © 2020 the Author(s), licensee AIMS Press.

2018, Yuan, M., Wang, W., Luo, X., Ge, C., Li, L., Kurths, J., Zhao, W.

The paper addresses the issue of synchronization of memristive bidirectional associative memory neural networks (MBAMNNs) with mixed time-varying delays and stochastic perturbation via a sampled-data controller. First, we propose a new model of MBAMNNs with mixed time-varying delays. In the proposed approach, the mixed delays include time-varying distributed delays and discrete delays. Second, we design a new method of sampled-data control for the stochastic MBAMNNs. Traditional control methods lack the capability of reflecting variable synaptic weights. In this paper, the methods are carefully designed to confirm the synchronization processes are suitable for the feather of the memristor. Third, sufficient criteria guaranteeing the synchronization of the systems are derived based on the derive-response concept. Finally, the effectiveness of the proposed mechanism is validated with numerical experiments.

2020, Polzehl, Jörg, Papafitsoros, Kostas, Tabelow, Karsten

Image reconstruction from noisy data has a long history of methodological development and is based on a variety of ideas. In this paper we introduce a new method called patch-wise adaptive smoothing, that extends the propagation-separation approach by using comparisons of local patches of image intensities to define local adaptive weighting schemes for an improved balance of reduced variability and bias in the reconstruction result. We present the implementation of the new method in an R package aws and demonstrate its properties on a number of examples in comparison with other state-of-the art image reconstruction methods. © 2020, American Statistical Association. All rights reserved.

2020, Kovtunenko, Victor A., Reichelt, Sina, Zubkova, Anna V.

This paper is devoted to the homogenization of a nonlinear transmission problem stated in a two-phase domain. We consider a system of linear diffusion equations defined in a periodic domain consisting of two disjoint phases that are both connected sets separated by a thin interface. Depending on the field variables, at the interface, nonlinear conditions are imposed to describe interface reactions. In the variational setting of the problem, we prove the homogenization theorem and a bidomain averaged model. The periodic unfolding technique is used to obtain the residual error estimate with a first-order corrector. © 2019 The Authors. Mathematical Methods in the Applied Sciences published by John Wiley & Sons Ltd.

2020, González Grandón, T., Henrion, R., Pérez-Aros, P.

The paper investigates analytical properties of dynamic probabilistic constraints (chance constraints). The underlying random distribution is supposed to be continuous. In the first part, a general multistage model with decision rules depending on past observations of the random process is analyzed. Basic properties like (weak sequential) (semi-) continuity of the probability function or existence of solutions are studied. It turns out that the results differ significantly according to whether decision rules are embedded into Lebesgue or Sobolev spaces. In the second part, the simplest meaningful two-stage model with decision rules from L2 is investigated. More specific properties like Lipschitz continuity and differentiability of the probability function are considered. Explicitly verifiable conditions for these properties are provided along with explicit gradient formulae in the Gaussian case. The application of such formulae in the context of necessary optimality conditions is discussed and a concrete identification of solutions presented. © 2020, The Author(s).

2017, Botta, N., Jansson, P., Ionescu, C., Christiansen, D.R., Brady, E.

We present a computer-checked generic implementation for solving finite-horizon sequential decision problems. This is a wide class of problems, including inter-temporal optimizations, knapsack, optimal bracketing, scheduling, etc. The implementation can handle time-step dependent control and state spaces, and monadic representations of uncertainty (such as stochastic, non-deterministic, fuzzy, or combinations thereof). This level of genericity is achievable in a programming language with dependent types (we have used both Idris and Agda). Dependent types are also the means that allow us to obtain a formalization and computer-checked proof of the central component of our implementation: Bellman’s principle of optimality and the associated backwards induction algorithm. The formalization clarifies certain aspects of backwards induction and, by making explicit notions such as viability and reachability, can serve as a starting point for a theory of controllability of monadic dynamical systems, commonly encountered in, e.g., climate impact research.