A universal scaling function, describing the crossover between the Mott and the Efros-Shklovskii hopping regimes, is derived, using the percolation picture of transport in strongly localized systems. This function is agrees very well with experimental data. Quantitative comparison with experiment allows for the possible determination of the role played by polarons in the transport. 72.20.-i, 71...

ABSTRACT We present light-curve analyses of two newly identified detached eclipsing binaries, namely HD 96609 and 303734, in the region richly populated open cluster NGC 3532. is composed main sequence stars (B9-A0V + A2V) with masses radii M1 = 2.66 ± 0.02 M⊙, M2 1.84 0.01 R1 2.740 0.006 R⊙, R2 1.697 0.005 R⊙. The positions components on logM − logR plane suggest log(age/yr) 8.55, correspondin...

Vaccinations are one of the most important steps in combat against viral diseases such as COVID-19. Determining influence number vaccinated patients on infected population represents a complex problem. For this reason, aim research is to model total or fully and deceased patients. Five separate modeling algorithms used: Linear Regression (LR), Logistic (LogR), Least Absolute Shrinkage Selection...

We consider for a real number α the Kolmogorov complexities of its expansions with respect to different bases. In the paper it is shown that, for usual and self-delimiting Kolmogorov complexity, the complexity of the prefixes of their expansions with respect to different bases r and b are related in a way which depends only on the relative information of one base with respect to the other. More...

We revisit the problem of (1±ε)-approximating the Lp norm, 0 ≤ p ≤ 2, of an n-dimensional vector updated in a stream of length m with positive and negative updates to its coordinates. We give several new upper and lower bounds, some of which are optimal. LOWER BOUNDS.We show that for the interesting range of parameters, Ω(ε log(nm)) bits of space are necessary for estimating Lp in one pass for ...

We propose a method for measuring the cosmological density parameter from the statistics of the expansion scalar, H 1 r v, { the divergence of peculiar velocity, expressed in units of the Hubble constant, H 100h km s 1 Mpc 1 . The velocity eld is spatially smoothed over 10h 1 Mpc to remove strongly nonlinear e ects. Assuming weakly-nonlinear gravitational evolution from Gaussian initial uctuati...

We develop a polynomial time Ω ( 1 R logR ) approximate algorithm for Max 2CSP-R, the problem where we are given a collection of constraints, each involving two variables, where each variable ranges over a set of size R, and we want to find an assignment to the variables that maximizes the number of satisfied constraints. Assuming the Unique Games Conjecture, this is the best possible approxima...

An edge colored graph G is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this work we study the rainbow connectivity of binomial random graphs at the connectivity threshold p = log n+ω ...

Let f be a transcendental entire function of order < 1/2. We denote the maximum and minimum modulus of f by M(r, f) = max{|f(z)| : |z| = r} and m(r, f) = min{|f(z)| : |z| = r}. We obtain a minimum modulus condition satisfied by many f of order zero that implies all Fatou components are bounded. A special case of our result is that if log logM(r, f) = O(log r/(log log r)) for some K > 1, then th...