Investigation of surface recombination is an important area for infrared detectors as the demand smaller pixels increases. In this study, we use transient microwave reflectance to characterize minority carrier lifetime InAsSb nBn structures under three conditions: As-Grown, blanket Barrier-Etched, and SU-8 Passivated barrier-etched. A qualitative comparison these samples shows that decreases Ba...

This paper presents a new approach to inductive learning that combines aspects of instancebased learning and rule induction in a single simple algorithm. The RISE system searches for rules in a speci c-to-general fashion, starting with one rule per training example, and avoids some of the di culties of separate-andconquer approaches by evaluating each proposed induction step globally, i.e., thr...

where the supremum is taken over all packings in R. A celebrated theorem of Minkowski states that ∆n ≥ ζ(n)/2 for all n ≥ 2. Since ζ(n) = 1+ o(1), the asymptotic behavior of the Minkowski bound [9] is given by Ω(2). Asymptotic improvements of the Minkowski bound were obtained by Rogers [10], Davenport and Rogers [4], and Ball [2], all of them being of the form ∆n ≥ cn2, where c > 0 is an absolu...

This paper is about searching the combina­ torial space of contingency tables during the inner loop of a nonlinear statistical optimiza­ tion. Examples of this operation in various data analytic communities include search­ ing for nonlinear combinations of attributes that contribute significantly to a regression (Statistics), searching for items to include in a decision list (machine learning) ...

1 Bipartite forbidden subgraphs We have seen the Erdős-Stone theorem which says that given a forbidden subgraph H, the extremal number of edges is ex(n,H) = 2(1−1/(χ(H)−1)+o(1))n. Here, o(1) means a term tending to zero as n → ∞. This basically resolves the question for forbidden subgraphs H of chromatic number at least 3, since then the answer is roughly cn2 for some constant c > 0. However, f...

The discovery of knowledge in databases is currently a very active research area. Many discovery systems adapt traditional attribute{based learners for the extraction of patterns. They have been, however, restricted by their inability to incorporate background knowledge into the learning process. In this paper an attribute{based learning algorithm, called SIDEC, which can incorporate a restrict...

RISE (Domingos 1995; in press) is a rule induction algorithm that proceeds by gradually generalizing rules, starting with one rule per example. This has several advantages compared to the more common strategy of gradually specializing initially null rules, and has been shown to lead to signi cant accuracy gains over algorithms like C4.5RULES and CN2 in a large number of application domains. How...

Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. It has previously predominantly been investigated in a two-class context. This paper investigates multi-class subgroup discovery methods. We consider six evaluation measures for multi-class subgroups, four of them new, and study their theoretical properti...