Fault-tolerant additive weighted geometric spanners

Let S be a set of n points and let w be a function that assigns non-negative weights to points in S. The additive weighted distance d_w(p, q) between two points p,q belonging to S is defined as w(p) + d(p, q) + w(q) if p \ne q and it is zero if p = q. Here, d(p, q) denotes the (geodesic) Euclidean distance between p and q. A graph G(S, E) is called a t-spanner for the additive weighted set S of points if for any two points p and q in S the distance between p and q in graph G is at most t.d_w(p, q) for a real number t > 1. Here, d_w(p,q) is the additive weighted distance between p and q. For some integer k \geq 1, a t-spanner G for the set S is a (k, t)-vertex fault-tolerant additive weighted spanner, denoted with (k, t)-VFTAWS, if for any set S' \subset S with cardinality at most k, the graph G \ S' is a t-spanner for the points in S \ S'. For any given real number \epsilon > 0, we obtain the following results: - When the points in S belong to Euclidean space R^d, an algorithm to compute a (k,(2 + \epsilon))-VFTAWS with O(kn) edges for the metric space (S, d_w). Here, for any two points p, q \in S, d(p, q) is the Euclidean distance between p and q in R^d. - When the points in S belong to a simple polygon P, for the metric space (S, d_w), one algorithm to compute a geodesic (k, (2 + \epsilon))-VFTAWS with O(\frac{k n}{\epsilon^{2}}\lg{n}) edges and another algorithm to compute a geodesic (k, (\sqrt{10} + \epsilon))-VFTAWS with O(kn(\lg{n})^2) edges. Here, for any two points p, q \in S, d(p, q) is the geodesic Euclidean distance along the shortest path between p and q in P. - When the points in $S$ lie on a terrain T, an algorithm to compute a geodesic (k, (2 + \epsilon))-VFTAWS with O(\frac{k n}{\epsilon^{2}}\lg{n}) edges.Comment: a few update

A Spanner for the Day After

We show how to construct $(1+\varepsilon)$-spanner over a set $P$ of $n$ points in $\mathbb{R}^d$ that is resilient to a catastrophic failure of nodes. Specifically, for prescribed parameters $\vartheta,\varepsilon \in (0,1)$, the computed spanner $G$ has $O\bigl(\varepsilon^{-c} \vartheta^{-6} n \log n (\log\log n)^6 \bigr)$ edges, where $c= O(d)$. Furthermore, for any $k$, and any deleted set $B \subseteq P$ of $k$ points, the residual graph $G \setminus B$ is $(1+\varepsilon)$-spanner for all the points of $P$ except for $(1+\vartheta)k$ of them. No previous constructions, beyond the trivial clique with $O(n^2)$ edges, were known such that only a tiny additional fraction (i.e., $\vartheta$) lose their distance preserving connectivity. Our construction works by first solving the exact problem in one dimension, and then showing a surprisingly simple and elegant construction in higher dimensions, that uses the one-dimensional construction in a black box fashion

Screening and Characterization of Phenolic Compounds and Their Antioxidant Capacity in Different Fruit Peels

Fruit peels have a diverse range of phytochemicals including carotenoids, vitamins, dietary fibres, and phenolic compounds, some with remarkable antioxidant properties. Nevertheless, the comprehensive screening and characterization of the complex array of phenolic compounds in different fruit peels is limited. This study aimed to determine the polyphenol content and their antioxidant potential in twenty different fruit peel samples in an ethanolic extraction, including their comprehensive characterization and quantification using the LC-MS/MS and HPLC. The obtained results showed that the mango peel exhibited the highest phenolic content for TPC (27.51 ± 0.63 mg GAE/g) and TFC (1.75 ± 0.08 mg QE/g), while the TTC (9.01 ± 0.20 mg CE/g) was slightly higher in the avocado peel than mango peel (8.99 ± 0.13 mg CE/g). In terms of antioxidant potential, the grapefruit peel had the highest radical scavenging capacities for the DPPH (9.17 ± 0.19 mg AAE/g), ABTS (10.79 ± 0.56 mg AAE/g), ferric reducing capacity in FRAP (9.22 ± 0.25 mg AA/g), and total antioxidant capacity, TAC (8.77 ± 0.34 mg AAE/g) compared to other fruit peel samples. The application of LC-ESI-QTOF-MS/MS tentatively identified and characterized a total of 176 phenolics, including phenolic acids (49), flavonoids (86), lignans (11), stilbene (5) and other polyphenols (25) in all twenty peel samples. From HPLC-PDA quantification, the mango peel sample showed significantly higher phenolic content, particularly for phenolic acids (gallic acid, 14.5 ± 0.4 mg/g) and flavonoids (quercetin, 11.9 ± 0.4 mg/g), as compared to other fruit peel samples. These results highlight the importance of fruit peels as a potential source of polyphenols. This study provides supportive information for the utilization of different phenolic rich fruit peels as ingredients in food, feed, and nutraceutical products

Shortest Path in a Polygon using Sublinear Space

\renewcommand{\Re}{{\rm I\!\hspace{-0.025em} R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\VorX}[1]{\mathcal{V} \pth{#1}} \newcommand{\Polygon}{\mathsf{P}} \newcommand{\Space}{\overline{\mathsf{m}}} \newcommand{\pth}[2][\!]{#1\left({#2}\right)} We resolve an open problem due to Tetsuo Asano, showing how to compute the shortest path in a polygon, given in a read only memory, using sublinear space and subquadratic time. Specifically, given a simple polygon \Polygon with $n$ vertices in a read only memory, and additional working memory of size \Space, the new algorithm computes the shortest path (in \Polygon) in O( n^2 /\, \Space ) expected time. This requires several new tools, which we believe to be of independent interest

A Spanner for the Day After

We show how to construct (1+epsilon)-spanner over a set P of n points in R^d that is resilient to a catastrophic failure of nodes. Specifically, for prescribed parameters theta, epsilon in (0,1), the computed spanner G has O(epsilon^{-7d} log^7 epsilon^{-1} * theta^{-6} n log n (log log n)^6) edges. Furthermore, for any k, and any deleted set B subseteq P of k points, the residual graph G B is (1+epsilon)-spanner for all the points of P except for (1+theta)k of them. No previous constructions, beyond the trivial clique with O(n^2) edges, were known such that only a tiny additional fraction (i.e., theta) lose their distance preserving connectivity. Our construction works by first solving the exact problem in one dimension, and then showing a surprisingly simple and elegant construction in higher dimensions, that uses the one dimensional construction in a black box fashion