Search results for "SOFA"
showing 10 items of 172 documents
Dynamic 2- and 3-connectivity on planar graphs
1992
We study the problem of maintaining the 2-edge-, 2-vertex-, and 3-edge-connected components of a dynamic planar graph subject to edge deletions. The 2-edge-connected components can be maintained in a total of O(n log n) time under any sequence of at most O(n) deletions. This gives O(log n) amortized time per deletion. The 2-vertex- and 3-edge-connected components can be maintained in a total of O(n log2n) time. This gives O(log2n) amortized time per deletion. The space required by all our data structures is O(n).
Genistein effect on cognition in prodromal Alzheimer's disease patients : the GENIAL clinical trial
2022
Background: Delaying the transition from minimal cognitive impairment to Alzheimer’s dementia is a major concern in Alzheimer’s disease (AD) therapeutics. Pathological signs of AD occur years before the onset of clinical dementia. Thus, long-term therapeutic approaches, with safe, minimally invasive, and yet efective substances are recommended. There is a need to develop new drugs to delay Alzheimer’s dementia. We have taken a nutritional supplement approach with genistein, a chemically defned polyphenol that acts by multimodal specifc mechanisms. Our group previously showed that genistein supplementation is efective to treat the double transgenic (APP/PS1) AD animal model. Methods: In this…
Anion Recognition by a Bioactive Diureidodecalin Anionophore: Solid-State, Solution, and Computational Studies
2018
Recent work has identified a bis-(p-nitrophenyl)ureidodecalin anion carrier as a promising candidate for biomedical applications, showing good activity for chloride transport in cells yet almost no cytotoxicity. To underpin further development of this and related compounds, a detailed structural and binding investigation is reported. Crystal structures of the transporter as five solvates confirm the diaxial positioning of urea groups while revealing a degree of conformational flexibility. Structures of complexes with Cl−, Br−, NO3 −, SO4 2− and AcO−, supported by computational studies, show how the binding site can adapt to accommodate these anions. 1H NMR binding studies revealed exception…
Optimal Guard Placement Problem Under L-Visibility
2006
Two points a and b in the presence of polygonal obstacles are L-visible if the length of the shortest path avoiding obstacles is no more than L. For a given convex polygon Q, Gewali et al [4]. addressed the guard placement problem on the exterior boundary that will cover the maximum area exterior to the polygon under L-visibility. They proposed a linear time algorithm for some given value of L. When the length L is greater than half of the perimeter, they declared that problem as open. Here we address that open problem and present an algorithm whose time complexity is linear in number of vertices of the polygon.
Angular analysis of charged and neutral B → Kμ + μ − decays
2014
The angular distributions of the rare decays B → K+µ+µ- and B0 → K0 <inf>a</inf>Sμ+μ- are studied with data corresponding to 3 fb-1 of integrated luminosity, collected in proton-proton collisions at 7 and 8TeV centre-of-mass energies with the LHCb detector. The angular distribution is described by two parameters, FH and the forward-backward asymmetry of the dimuon system AFB, which are determined in bins of the dimuon mass squared. The parameter F<inf>H</inf> is a measure of the contribution from (pseudo)scalar and tensor amplitudes to the decay width. The measurements of A<inf>FB</inf> and F<inf>H</inf> reported here are the most precise to d…
Measurement of CP asymmetry in Bs0 → Ds ∓K± decays
2014
Journal of high energy physics 2018(3), 59 (2018). doi:10.1007/JHEP03(2018)059
Observation of an Excited $B^{\pm}_c$ Meson State with the ATLAS Detector
2014
A search for excited states of the B±c meson is performed using 4.9 fb-1 of 7 TeV and 19.2 fb-1 of 8 TeV pp collision data collected by the ATLAS experiment at the LHC. A new state is observed through its hadronic transition to the ground state, with the latter detected in the decay B±c→J/ψπ±. The state appears in the m(Bc±π+π-)-m(Bc±)-2m(π±) mass difference distribution with a significance of 5.2 standard deviations. The mass of the observed state is 6842±4±5 MeV, where the first error is statistical and the second is systematic. The mass and decay of this state are consistent with expectations for the second S-wave state of the B±c meson, B±c(2S).
Fast Algorithms for Pseudoarboricity
2015
The densest subgraph problem, which asks for a subgraph with the maximum edges-to-vertices ratio d∗, is solvable in polynomial time. We discuss algorithms for this problem and the computation of a graph orientation with the lowest maximum indegree, which is equal to ⌈d∗⌉. This value also equals the pseudoarboricity of the graph. We show that it can be computed in O(|E| √ log log d∗) time, and that better estimates can be given for graph classes where d∗ satisfies certain asymptotic bounds. These runtimes are achieved by accelerating a binary search with an approximation scheme, and a runtime analysis of Dinitz’s algorithm on flow networks where all arcs, except the source and sink arcs, hav…
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
2006
There remains today an open problem whether the rotation distance between binary trees or equivalently the diagonal-flip distance between triangulations can be computed in polynomial time. We present an efficient algorithm for computing lower and upper bounds of this distance between a pair of triangulations.
An efficient upper bound of the rotation distance of binary trees
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.