Helly-Type Theorems in Property Testing

Helly's theorem is a fundamental result in discrete geometry, describing the ways in which convex sets intersect with each other. If $S$ is a set of $n$ points in $R^d$, we say that $S$ is $(k,G)$-clusterable if it can be partitioned into $k$ clusters (subsets) such that each cluster can be contained in a translated copy of a geometric object $G$. In this paper, as an application of Helly's theorem, by taking a constant size sample from $S$, we present a testing algorithm for $(k,G)$-clustering, i.e., to distinguish between two cases: when $S$ is $(k,G)$-clusterable, and when it is $\epsilon$-far from being $(k,G)$-clusterable. A set $S$ is $\epsilon$-far $(0<\epsilon\leq1)$ from being $(k,G)$-clusterable if at least $\epsilon n$ points need to be removed from $S$ to make it $(k,G)$-clusterable. We solve this problem for $k=1$ and when $G$ is a symmetric convex object. For $k>1$, we solve a weaker version of this problem. Finally, as an application of our testing result, in clustering with outliers, we show that one can find the approximate clusters by querying a constant size sample, with high probability

The Separatrix Algorithm for Synthesis and Analysis of Stochastic Simulations with Applications in Disease Modeling

Decision makers in epidemiology and other disciplines are faced with the daunting challenge of designing interventions that will be successful with high probability and robust against a multitude of uncertainties. To facilitate the decision making process in the context of a goal-oriented objective (e.g., eradicate polio by ), stochastic models can be used to map the probability of achieving the goal as a function of parameters. Each run of a stochastic model can be viewed as a Bernoulli trial in which “success” is returned if and only if the goal is achieved in simulation. However, each run can take a significant amount of time to complete, and many replicates are required to characterize each point in parameter space, so specialized algorithms are required to locate desirable interventions. To address this need, we present the Separatrix Algorithm, which strategically locates parameter combinations that are expected to achieve the goal with a user-specified probability of success (e.g. 95%). Technically, the algorithm iteratively combines density-corrected binary kernel regression with a novel information-gathering experiment design to produce results that are asymptotically correct and work well in practice. The Separatrix Algorithm is demonstrated on several test problems, and on a detailed individual-based simulation of malaria

Multi sensor transducer and weight factor

A multi-sensor transducer and processing method allow insitu monitoring of the senor accuracy and transducer `health`. In one embodiment, the transducer has multiple sensors to provide corresponding output signals in response to a stimulus, such as pressure. A processor applies individual weight factors to reach of the output signals and provide a single transducer output that reduces the contribution from inaccurate sensors. The weight factors can be updated and stored. The processor can use the weight factors to provide a `health` of the transducer based upon the number of accurate versus in-accurate sensors in the transducer

Combinatorics of linear iterated function systems with overlaps

Let $\bm p_0,...,\bm p_{m-1}$ be points in ${\mathbb R}^d$, and let $\{f_j\}_{j=0}^{m-1}$ be a one-parameter family of similitudes of ${\mathbb R}^d$: $$f_j(\bm x) = \lambda\bm x + (1-\lambda)\bm p_j, j=0,...,m-1,$$ where $\lambda\in(0,1)$ is our parameter. Then, as is well known, there exists a unique self-similar attractor $S_\lambda$ satisfying $S_\lambda=\bigcup_{j=0}^{m-1} f_j(S_\lambda)$. Each $\bm x\in S_\lambda$ has at least one address $(i_1,i_2,...)\in\prod_1^\infty\{0,1,...,m-1\}$, i.e., $\lim_n f_{i_1}f_{i_2}... f_{i_n}({\bf 0})=\bm x$. We show that for $\lambda$ sufficiently close to 1, each $\bm x\in S_\lambda\setminus\{\bm p_0,...,\bm p_{m-1}\}$ has $2^{\aleph_0}$ different addresses. If $\lambda$ is not too close to 1, then we can still have an overlap, but there exist $\bm x$'s which have a unique address. However, we prove that almost every $\bm x\in S_\lambda$ has $2^{\aleph_0}$ addresses, provided $S_\lambda$ contains no holes and at least one proper overlap. We apply these results to the case of expansions with deleted digits. Furthermore, we give sharp sufficient conditions for the Open Set Condition to fail and for the attractor to have no holes. These results are generalisations of the corresponding one-dimensional results, however most proofs are different.Comment: Accepted for publication in Nonlinearit

Bounding Helly numbers via Betti numbers

We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers $b$ and $d$ there exists an integer $h(b,d)$ such that the following holds. If $\mathcal F$ is a finite family of subsets of $\mathbb R^d$ such that $\tilde\beta_i\left(\bigcap\mathcal G\right) \le b$ for any $\mathcal G \subsetneq \mathcal F$ and every $0 \le i \le \lceil d/2 \rceil-1$ then $\mathcal F$ has Helly number at most $h(b,d)$. Here $\tilde\beta_i$ denotes the reduced $\mathbb Z_2$-Betti numbers (with singular homology). These topological conditions are sharp: not controlling any of these $\lceil d/2 \rceil$ first Betti numbers allow for families with unbounded Helly number. Our proofs combine homological non-embeddability results with a Ramsey-based approach to build, given an arbitrary simplicial complex $K$, some well-behaved chain map $C_*(K) \to C_*(\mathbb R^d)$.Comment: 29 pages, 8 figure

Lines pinning lines

A line g is a transversal to a family F of convex polytopes in 3-dimensional space if it intersects every member of F. If, in addition, g is an isolated point of the space of line transversals to F, we say that F is a pinning of g. We show that any minimal pinning of a line by convex polytopes such that no face of a polytope is coplanar with the line has size at most eight. If, in addition, the polytopes are disjoint, then it has size at most six. We completely characterize configurations of disjoint polytopes that form minimal pinnings of a line.Comment: 27 pages, 10 figure

Thermal ageing phenomena and strategies towards reactivation of NO x - storage catalysts

The thermal ageing and reactivation of Ba/CeO2 and Ba/Al2O3 based NO x -storage/ reduction (NSR) catalysts was studied on model catalysts and catalyst systems at the engine. The mixed oxides BaAl2O4 and BaCeO3, which lower the storage activity, are formed during ageing above 850°C and 900°C, respectively. Interestingly, the decomposition of BaCeO3 in an atmosphere containing H2O/NO2 leads again to NO x -storage active species, as evidenced by comparison of fresh, aged and reactivated Pt-Ba/CeO2 based model catalysts. This can be technically exploited, particularly for the Ba/CeO2 catalysts, as reactivation studies on thermally aged Ba/CeO2 and Ba/Al2O3 based NSR catalysts on an engine bench showed. An on-board reactivation procedure is presented, that improved the performance of a thermally aged catalyst significantl

Notes about the Caratheodory number

In this paper we give sufficient conditions for a compactum in $\mathbb R^n$ to have Carath\'{e}odory number less than $n+1$, generalizing an old result of Fenchel. Then we prove the corresponding versions of the colorful Carath\'{e}odory theorem and give a Tverberg type theorem for families of convex compacta

Augmenter of liver regeneration enhances the success rate of fetal pancreas transplantation in rodents

Background. Treatment of fetal pancreas (FP) isografts with insulin- like growth factor-I greatly improves the rate of conversion to euglycemia in diabetic rats. Complete knowledge of other factors that may facilitate the engraftment and function of FP in vivo is still embryonic. Augmenter of liver regeneration (ALR) is a newly described polypeptide growth factor found in weanling rat livers. ALR has trophic effects on regenerating liver. We studied the effects of in situ administration of this agent on FP isografts in rats. Methods. Streptozotocin-diabetic Lewis rats (blood glucose >300 mg/dl) received 16 FP isografts transplanted intramuscularly. ALR was delivered from day 1 through day 14, in doses of 40 or 400 ng/kg/d. Animals were followed for 3 months with serial weights and blood glucose monitoring. These animals were compared with those treated with vehicle alone. Results. Of the group treated with ALR at 40 ng/kg/day for 14 days, 89% (eight of nine) were euglycemic (P=0.0003). Of the group treated with ALR at 400 ng/kg/day for 14 days, 88% (seven of eight) were euglycemic (P=0.0007). Of the group treated with vehicle alone, none of the six were euglycemic. Euglycemia is defined here as glucose<200 mg/dl for 3 days. Pathology of the intramuscular transplant site showed patches of islet tissue embedded in fat. These patches demonstrated insulin immunoreactivity. Conclusions. Diabetes was reversed in a significantly greater proportion of FP + ALR-treated recipients than those animals treated with vehicle alone. Local delivery of growth factors my be used as an adjunct to FP transplantation to improve the rate of success. This in situ model may be useful to further evaluate other soluble factors