Causation, Prediction, and Search by Spirtes, Glymour, and Scheines (SGS) is an ambitious book. SGS claim to have methods for discovering causal relations based only on empirical data, with no need for subjectmatter knowledge. These methods—which combine graph theory, statistics and computer science—are said to allow quick, virtually automated, conversion of association to causation. The algori...

The paper shows the set up of a large phonetic corpus (the LeaP corpus), how its metadata is structured and transformed into an extended IMDI/ISLE metadata structure, how this structure has been transcoded into the TASX metadata format and finally has been intergrated into the LeaP corpus.

Summary To construct gene co-expression networks based on single-cell RNA-Sequencing data, we present an algorithm called LEAP, which utilizes the estimated pseudotime of the cells to find gene co-expression that involves time delay. Availability and Implementation R package LEAP available on CRAN. Contact [email protected]. Supplementary information Supplementary data are available at Bioinf...

The decision to leave a job can be very stressful. Multiple variables must be considered before turning in your notice. The goal of this paper is to help you decide if changing jobs is a smart decision, and, if it is, when to do it.

Markovian pure jump processes model a wide range of phenomena, including chemical reactions at the molecular level, dynamics of wireless communication networks, and the spread of epidemic diseases in small populations. There exist algorithms such as Gillespie’s stochastic simulation algorithm (SSA) and Anderson’s modified next reaction method (MNRM) that simulate a single path with the exact di...

The first and second Zagreb indices of a graph are equal, respectively, to the sum of squares of the vertex degrees, and the sum of the products of the degrees of pairs of adjacent vertices. We now consider analogous graph invariants, based on the second degrees of vertices (number of their second neighbors), called leap Zagreb indices. A number of their basic properties is established.

By d(v|G) and d_2(v|G) are denoted the number of first and second neighborsof the vertex v of the graph G. The first, second, and third leap Zagreb indicesof G are defined asLM_1(G) = sum_{v in V(G)} d_2(v|G)^2, LM_2(G) = sum_{uv in E(G)} d_2(u|G) d_2(v|G),and LM_3(G) = sum_{v in V(G)} d(v|G) d_2(v|G), respectively. In this paper, we generalizethe results of Naji et al. [Commun. Combin. Optim. ...