Search results for: asymptotic analysis
-
Do positrons measure atomic and molecular diameters?
PublicationWe report on density functional calculations (DFT) of elastic integral scattering cross-sections for positron collisions with argon, krypton, nitrogen and methane. The long-range asymptotic polarization potential is described using higher-order terms going much beyond an induced dipole potential (−α / r 4) while the short-range interaction is modeled by two different forms of electron – positron correlation potential (Boroński-Nieminen...
-
Resistant to correlated noise and outliers discrete identification of continuous non-linear non-stationary dynamic objects
PublicationIn this article, specific methods of parameter estimation were used to identify the coefficients of continuous models represented by linear and nonlinear differential equations. The necessary discrete-time approximation of the base model is achieved by appropriately tuned FIR linear integral filters. The resulting discrete descriptions, which retain the original continuous parameterization, can then be identified using the classical...
-
Resistant to correlated noise and outliers discrete identification of continuous non-linear non-stationary dynamic objects
PublicationIn this study, dedicated methods of parameter estimation were used to identify the coefficients of continuous models represented by linear and nonlinear differential equations. The necessary discrete-time approximation of the base model is achieved by appropriately tuned FIR linear integral filters. The resulting discrete descriptions, which retain the original continuous parameterization, can then be identified using the classical...
-
Convex set of quantum states with positive partial transpose analysed by hit and run algorithm
PublicationThe convex set of quantum states of a composite K×K system with positive partial transpose is analysed. A version of the hit and run algorithm is used to generate a sequence of random points covering this set uniformly and an estimation for the convergence speed of the algorithm is derived. For K >3 or K=3 this algorithm works faster than sampling over the entire set of states and verifying whether the partial transpose is positive....
-
On a matching distance between rooted phylogenetic trees
PublicationThe Robinson–Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach...
-
Billiard in a rotating half-plane
PublicationThe main objective of this research is to study the properties of a billiard system in an unbounded domain with moving boundary. We consider a system consisting of an infinite rod (a straight line) and a ball (a massless point) on the plane. The rod rotates uniformly around one of its points and experiences elastic collisions with the ball. We define a mathematical model for the dynamics of such a system and write down asymptotic...
-
Schemes of transmission of classical information via quantum channels with many senders: Discrete- and continuous-variable cases
PublicationSuperadditivity effects in the classical capacity of discrete multiaccess channels and continuous variable (CV) Gaussian MACs are analyzed. Several examples of the manifestation of superadditivity in the discrete case are provided, including, in particular, a channel which is fully symmetric with respect to all senders. Furthermore, we consider a class of channels for which input entanglement across more than two copies of the...
-
Characterization of the Functionally Graded Shear Modulus of a Half-Space
PublicationIn this article, a method is proposed for determining parameters of the exponentialy varying shear modulus of a functionally graded half-space. The method is based on the analytical solution of the problem of pure shear of an elastic functionally graded half-space by a strip punch. The half-space has the depth-wise exponential variation of its shear modulus, whose parameters are to be determined. The problem is reduced to an integral...
-
Scale transformations in model exchange potentials in low energy electron-atom scattering
PublicationModel exchange potentials are particularly interesting to account for the indistinguishability between the projectile and target electrons in electron-atom scattering in vacuo and plasma environments. It is well known that their performance is pretty satisfactory in the high energies but also that discrepancies from the results obtained with exact exchange are found toward the zero energy limit. In this article, we examine how...
-
Coupled nonlinear Schrödinger equations in optic fibers theory
PublicationIn this paper a detailed derivation and numerical solutions of CoupledNonlinear Schr¨odinger Equations for pulses of polarized electromagnetic wavesin cylindrical fibers has been reviewed. Our recent work has been compared withsome previous ones and the advantage of our new approach over other methods hasbeen assessed. The novelty of our approach lies is an attempt to proceed withoutloss of information within the frame of basic...
-
Generalization of Phylogenetic Matching Metrics with Experimental Tests of Practical Advantages
PublicationThe ability to quantify a dissimilarity of different phylogenetic trees is required in various types of phylogenetic studies, for example, such metrics are used to assess the quality of phylogeny construction methods and to define optimization criteria in supertree building algorithms. In this article, starting from the already described concept of matching metrics, we define three new metrics for rooted phylogenetic trees. One...
-
Discrete identification of continuous non-linear and non-stationary dynamical systems that is insensitive to noise correlation and measurement outliers
PublicationThe 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
PublicationThe 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
PublicationA 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
PublicationWe 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
PublicationWe 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
PublicationWe 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
Open Research DataHes1 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...