Abstract The paper defends an account of the context-sensitivity norms that draws on resources counterfactual conditionals. combines two assumptions: assumption permission is rule-abiding performance in some contextually relevant situations; and situations are picked out by mechanism selects possible worlds for evaluation explains non-monotonicity permissions solves a puzzle, raised Timothy Wil...

A lemma from elliptic theory is used to improve a recent result by Li concerning the removability of an isolated point singularity from solutions of the coupled Yang-Mills-Dirac equations. MSC2000: 35J60, 70S15 Recently, Wei Li proved [2] that a smooth solution of the coupled YangMills-Dirac equations in a punctured Euclidean 4-disk B\{0} is equivalent via a continuous gauge transformation to a...

W settle the computational complexity of fundamental questions related to multicriteria integer linear programs, when the dimensions of the strategy space and of the outcome space are considered fixed constants. In particular we construct: (1) polynomial-time algorithms to determine exactly the number of Pareto optima and Pareto strategies; (2) a polynomial-space polynomial-delay prescribed-ord...

We provide a su cient condition for convergence of a general class of alternating estimation-maximization (EM) type continuous-parameter estimation algorithms with respect to a given norm. This class includes EM, penalized EM, Green's OSL-EM, and other approximate EM algorithms. The convergence analysis can be extended to include alternating coordinate-maximization EM algorithms such as Meng an...

Temporal queries on time evolving data are at the heart of a broad range of business and network intelligence applications ranging from consumer behavior analysis, trend analysis, temporal pattern mining, sentiment analysis on social media, cyber security, and network monitoring. In this work, we present an innovative data structure called Fast Approximate Query-able(FAQ), which provides a unif...

We give algorithms for computing the densest k-dimensional sublattice of an arbitrary lattice, and related problems. This is an important problem in the algorithmic geometry of numbers that includes as special cases Rankin’s problem (which corresponds to the densest sublattice problem with respect to the Euclidean norm, and has applications to the design of lattice reduction algorithms), and th...

Let $M$ be an orientable hypersurface in the Euclidean space $R^{2n}$ with induced metric $g$ and $TM$ be its tangent bundle. It is known that the tangent bundle $TM$ has induced metric $overline{g}$ as submanifold of the Euclidean space $R^{4n}$ which is not a natural metric in the sense that the submersion $pi :(TM,overline{g})rightarrow (M,g)$ is not the Riemannian submersion. In this paper...

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...

We analyze human poses and motion by introducing three sequences of easily calculated surface descriptors that are invariant under reparametrizations Euclidean transformations. These obtained associating to each finitely-triangulated two functions on the unit sphere: for vector u we compute weighted area projection onto plane orthogonal length its line spanned u. The L2 norms inner products pro...