Bayesian networks represent relations between variables using a directed acyclic graph (DAG). Learning the DAG is an NP-hard problem and exact learning algorithms are feasible only for small sets of variables. We propose two scalable heuristics DAGs in linear structural equation case. Our methods learn by alternating unconstrained gradient descent-based step to optimize objective function solvi...

For an étale sheaf on a smooth variety over a perfect field of positive characteristic, the characteristic cycle is expected to be defined. In this series of lectures, we give a conditional definition and prove some of basic properties assuming the existence of a singular support satisfying certain local acyclicity conditions for families of morphisms to curves and to surfaces. For a sheaf on a...

The fundamental theorem of the classical serializability theory states the necessary and suucient conditions for the connict serializability of an execution. In this paper, we extend the correctness criteria of the classical theory by presenting a deenition of connict serializability for concurrency control of nested transactions. We deene a serialization graph for nested transactions and we pr...

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 6 July 2020Accepted: 20 May 2021Published online: 19 August 2021Keywordsconnectivity problem, feedback vertex set, $d$-neighbor equivalence, $\sigma,\rho$-domination, clique-width, rank-width, mim-widthAMS Subject Headings05C85, 68Q27Publication DataISSN (print): 0895-480...

Canonical trace model of Hoare and He supports a satisfactory theory of graph properties. We use it to define a technique for the general composition of properties that extends the parallel-by-merge of Unifying Theories of Programming, and apply that to unique decompositions. Applications are provided to the fundamental concepts of acyclicity, reachability and canonicity; and those are used, in...

The acyclicity of individual improvements in a generalized congestion game (where the sums of local utilities are replaced with arbitrary aggregation rules) can be established with a Rosenthalstyle construction if aggregation rules of all players are “quasi-separable.” Every universal separable ordering on a finite set can be represented as a combination of addition and lexicography. MSC2010 Cl...