Quasinormal Modes of Self-Dual Warped AdS3_3 Black Hole in Topological Massive Gravity

We consider the various perturbations of self-dual warped AdS$_3$ black hole and obtain the exact expressions of quasinormal modes by imposing the vanishing Dirichlet boundary condition at asymptotic infinity. It is expected that the quasinormal modes agree with the poles of retarded Green's functions of the dual CFT. Our results provide a quantitative test of the warped AdS/CFT correspondence.Comment: 10 pages, no figure, some references and comments on gravitational perturbations are adde

Effect of general and sub-arachnoid anesthesia on the incidence of postoperative delirium and cognitive impairments in elderly Chinese patients

Purpose: To investigate the effect of general and subarachnoid (spinal) anesthesia on the incidence of postoperative delirium and cognitive impairments in elderly Chinese patients. Methods: Elderly Chinese patients (n = 281) aged 65 – 79 years (mean age = 74.12 ± 4.15 years) who underwent proximal femoral fracture surgery were recruited over a 1-year period for this study. The patients were evaluated using neuropsychological assessment battery (NAB) 24 h before surgery, and on the first day 1 month after surgery. Data on activity of daily living (ADL) (in this case toileting at the time of discharge) were recorded and analyzed. Results: There was no significant difference in the number of patients that developed postoperative delirium between the two anesthesia groups (p > 0.05). Although the trail making test (TMT) scores (parts A and B) were increased on the first day 1 month after surgery, there were no significant differences in NAB results between the two groups (p > 0.05). Patients who received subarachnoid (spinal) anesthesia had significantly higher dependency for toileting at the time of discharge than those who received general anesthesia (p < 0.05). Conclusion: These results show that general and subarachnoid (spinal) anesthesia do not cause postoperative delirium and cognitive dysfunction in elderly Chinese patients who underwent proximal femoral fracture surgery

Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time

In the bounded-leg shortest path (BLSP) problem, we are given a weighted graph G with nonnegative edge lengths, and we want to answer queries of the form "what\u27s the shortest path from u to v, where only edges of length = f are considered. In this article we give an O~(n^{(omega+3)/2}epsilon^{-3/2}log W) time algorithm to compute a data structure that answers APSP-AF queries in O(log(epsilon^{-1}log (nW))) time and achieves (1+epsilon)-approximation, where omega < 2.373 is the exponent of time complexity of matrix multiplication, W is the upper bound of integer edge lengths, and n is the number of vertices. This is the first truly-subcubic time algorithm for these problems on dense graphs. Our algorithm utilizes the O(n^{(omega+3)/2}) time max-min product algorithm [Duan and Pettie 2009]. Since the all-pair bottleneck path (APBP) problem, which is equivalent to max-min product, can be seen as all-pair reachability for all flow, our approach indeed shows that these problems are almost equivalent in the approximation sense