Wyszukiwarka
Wyniki wyszukiwania dla: ASYMPTOTIC ANALYSIS
-
Discrete identification of continuous non-linear and non-stationary dynamical systems that is insensitive to noise correlation and measurement outliers
PublikacjaThe paper uses specific parameter estimation methods to identify the coefficients of continuous-time models represented by linear and non-linear ordinary differential equations. The necessary approximation of such systems in discrete time in the form of utility models is achieved by the use of properly tuned `integrating filters' of the FIR type. The resulting discrete-time descriptions retain the original continuous parameterization...
-
Amplifying the Randomness of Weak Sources Correlated With Devices
PublikacjaThe problem of device-independent randomness amplification against no-signaling adversaries has so far been studied under the assumption that the weak source of randomness is uncorrelated with the (quantum) devices used in the amplification procedure. In this paper, we relax this assumption, and reconsider the original protocol of Colbeck and Renner using a Santha-Vazirani (SV) source. To do so, we introduce an SV-like condition...
-
Effect of MgSO4 nutrition on Theobroma cacao L. susceptibility to Phytophthora megakarya infection
PublikacjaA new strategy to reduce the severity of black pod disease (BPD) in T. cacao plants using MgSO4 nutrition was investigated. The dynamics of the tolerance to BPD of 18 susceptible T. cacao plantlets coming from the cross (♀SNK64 × ♂UPA14) was monitored during weekly (8 weeks) supply of MgSO4 into the soil. Prior to MgSO4 application, disease scores of the 18 plantlets (in six sets of three plantlets per set) were varying between...
-
Fast collaborative graph exploration
PublikacjaWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Fast Collaborative Graph Exploration
PublikacjaWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Hopf bifurcation in time‐delayed gene expression model with dimers
PublikacjaWe study a mathematical model of gene transcription and protein synthesis with negative feedback. We consider a system of equations taking into account the formation of dimers (i.e., complex formed by two protein monomers), the way in which dimers bind to DNA and time delay in translation process. For the model consisting of three ordinary differential equations with time delay, we derive conditions for stability of the positive...
-
Data on solutions of Hes1 system
Dane BadawczeHes1 protein (hairy and enhancer of split 1) belongs to the helix-loop-helix (bHLH) family of transcription proteins, i.e. DNA-binding proteins in the promoter region or in another region where regulation of transcription processes occurs. The database collects data on solutions of the Hes1 systems with multiple binding sites and the dimer formation...