We improve on anO(n5 log n) algorithmbyKats and Levner [V. Kats, E. Levner, A polynomial algorithm for 2-cyclic robotic scheduling, in: Gelbukh, Reyes-García (Eds.), Proceedings of MICAI’06, in: LNAI, vol. 4293, Springer Verlag, 2006, pp. 439–449] for 2-cyclic robotic scheduling. We provide in this work an O(n2 log n) algorithm for this problem. © 2008 Elsevier B.V. All rights reserved.

Least squares estimator of the stability parameter ̺ := |α|+ |β| for a spatial unilateral autoregressive process Xk,l = αXk−1,l +βXk,l−1 +εk,l is investigated and asymptotic normality with a scaling factor n5/4 is shown in the unstable case ̺ = 1. The result is in contrast to the unit root case of the AR(p) model Xk = α1Xk−1+ · · ·+αpXk−p+εk, where the limiting distribution of the least squares e...

We have synthesized and characterized two Mn(II) seven-coordinate complexes with N5 pentadentate ligands, which contain hydrazone and hydrazide groups respectively. We have shown that insertion of hydrazido (amido) groups into the ligand sphere increases the negative charge of the chelate, without changing a donor atom set and coordination geometry, and radically modulate a redox activity of se...

We show that the maximum number of occurrences of a given angle in a set of n points in R3 is O(n7/3), and that a right angle can actually occur Ω(n7/3) times. We then show that the maximum number of occurrences of any angle different from π/2 in a set of n points in R4 is O(n5/2β(n)), where β(n) = 2O(α(n) 2) and α(n) is the inverse Ackermann function.

The aim of the current investigation was to evaluate the fracture resistance of one-piece zirconia oral implants with and without all-ceramic incisor crowns after long-term thermomechanical cycling. A total of 48 implants were evaluated. The groups with crowns (C, 24 samples) and without crowns (N, 24 samples) were subdivided according to the loading protocol, resulting in three groups of 8 sam...

The art gallery problem enquires about the least number of guards sufficient to ensure that an art gallery, represented by a polygon P , is fully guarded. Most standard versions of this problem are known to be NP-hard. In 1987, Ghosh provided a deterministic O(log n)approximation algorithm for the case of vertex guards and edge guards in simple polygons. In the same paper, Ghosh also conjecture...

Aflatoxin B1 and benzo(a)pyrene were activated by both cultured human bronchus and human colon as measured by binding to cellular DNA and protein. The binding of aflatoxin B1 to DNA was dose dependent, and the level of binding was higher in cultured human bronchus than it was in the colon. When compared to aflatoxin B1, the binding level of benzo(a)pyrene to both bronchial and colonic DNA was g...

Arguably, the most important problem of ab initio quantum chemistry is accurate description of electron correlation. The exact solution of many-electron Schrödinger equation within a space spanned by the direct product of one-electron basis functions is known as Full Configuration Interaction (FCI). In general, the computation of FCI ground state scales exponentially with the system size. The p...