Learn More
In this paper, we consider a non-convex loss-minimization problem of learning Supervised PageRank models, which can account for features of nodes and edges. We propose gradient-based and random gradient-free methods to solve this problem. Our algorithms are based on the concept of an inexact oracle and unlike the state-of-the-art gradient-based method we(More)
Let C be a class of graphs and π be a graph parameter. Let Φ be a formula in the first-order language containing only the adjacency and the equality relations. We say that Φ defines C on connected graphs with sufficiently large π if there is a constant k such that, for every connected graph G with π(G) ≥ k, Φ is true on G exactly when G belongs to C. For a(More)
Relation between the risk of lung cancer and combined home and work indoor radon exposure was studied on the example of the population of Lermontov town (Stavropol Region, Russia). The town is situated in the former uranium mining area. Case (121 lung cancer cases) and control (196 individuals free of lung cancer diagnosis) groups of the study included both(More)
The relationship between 90Sr accumulation in the skeleton after single injection and the resulting dose load on bone surfaces was studied in laboratory mice. Radiation doses were measured by a thermoluminescent method. A positive correlation was revealed between the surface dose rate on the skull and mandible and 90Sr specific radioactivity in these bones.(More)
In the paper we investigate power law for PageRank components for the Buckley-Osthus model for web graph. We compare different numerical methods for PageRank calculation. With the best method we do a lot of numerical experiments. These experiments confirm the hypothesis about power law. At the end we discuss real model of web-ranking based on the classical(More)
The assessment of the relative biological effectiveness (RBE) for alpha-radiation was held in the cases of inhalation of radon progeny and incorporation of plutonium in lungs. It is based on simulation of lung cancer radiation risk for different types of radiation. Specific radiation risk models developed according to the results of direct epidemiological(More)
Given a graph $F$, let $I(F)$ be the class of graphs containing $F$ as an induced subgraph. Let $W[F]$ denote the minimum $k$ such that $I(F)$ is definable in $k$-variable first-order logic. The recognition problem of $I(F)$, known as Induced Subgraph Isomorphism (for the pattern graph $F$), is solvable in time $O(n^{W[F]})$. Motivated by this fact, we are(More)