background: nonspecific symptoms are common in all areas of medicine. patients and caregivers can be frustrated when an illness cannot be reduced to a discrete pathophysiological process that corresponds with the symptoms. we therefore asked the following questions: 1) which demographic factors and psychological comorbidities are associated with change from an initial diagnosis of nonspecific a...

Computer simulation of a system described by differential equations requires that some element of the system be approximated by discrete quantities. There are two system aspects that can be made discrete; time and state. When time is discrete, the differential equation is approximated by a difference equation (i.e., a discrete time system), and the solution is calculated at fixed points in time...

The forced flow driven flame spread behavior along an array of discrete wooden fuel elements was experimentally investigated, which could be important step to understanding the flow-flame interactions that govern fire spread. Fuel arrays with five different spacings (0.75, 0.875. 1.00, 1.125, and 1.25 cm) were subject speeds ranging from 2.2 4.3 m/s at approximately 0.2 intervals. For spacing-f...

We study the time-bounded reachability problem for continuous-time Markov decision processes (CTMDPs) and games (CTMGs). Existing techniques for this problem use discretisation techniques to break time into discrete intervals, and optimal control is approximated for each interval separately. Current techniques provide an accuracy of O(ε) on each interval, which leads to an infeasibly large numb...

In the present work, we consider discretization of continuous distributions and study relations between record values, weak values discrete obtained from by discretization. We first compare numbers registered in real intervals located on sets non-negative integers. Further paper, introduce so-called strong that hold out after discuss their distributional properties. also analyze what happens wi...

We investigate the statistical complexity of estimating parameters a discrete-state Markov chain kernel from single long sequence state observations. In finite case, we characterize (modulo logarithmic factors) minimax sample estimation with respect to operator infinity norm, while in countably infinite analyze problem natural entry-wise norm derived total variation. show that both cases, is go...

We construct  a noncommutative analog of additive functional equations on discrete quantum semigroups and show that this noncommutative functional equation has Hyers-Ulam stability on amenable discrete quantum semigroups. The discrete quantum semigroups that we consider in this paper are in the sense of van Daele, and the amenability is in the sense of Bèdos-Murphy-Tuset. Our main result genera...

We study the problem of designing a distributed observer for an LTI system over time-varying communication graph. The limited existing work on this topic imposes various restrictions either observation model or sequence graphs. In contrast, we propose single-time-scale that works under mild assumptions. Specifically, our only requires strong-connectivity to be preserved nonoverlapping, contiguo...

The present paper considers a discrete analog of the parking problem. Let n be an integer. If > 1, then we randomly locate interval (t, t + 1) with integer endpoints on segment [0, n]. Thus, original is divided into two: t] and [t n], each them further considered separately likewise one. phrase “randomly” in this problem means that uniformly distributed set {1, . , − 1} random variable. process...

A t-interval is a union of at most t half-open intervals on the real line. The special case where t = 1 is an interval. Often, the requests for contiguous allocation of a linear resource can be modeled by a sequence of t-intervals. We consider the problems of online scheduling intervals and t-intervals, which show up in Video-on-Demand services, high speed networks and molecular biology, among ...