Growing a list

It is easy to find expert knowledge on the Internet on almost any topic, but obtaining a complete overview of a given topic is not always easy: Information can be scattered across many sources and must be aggregated to be useful. We introduce a method for intelligently growing a list of relevant items, starting from a small seed of examples. Our algorithm takes advantage of the wisdom of the crowd, in the sense that there are many experts who post lists of things on the Internet. We use a collection of simple machine learning components to find these experts and aggregate their lists to produce a single complete and meaningful list. We use experiments with gold standards and open-ended experiments without gold standards to show that our method significantly outperforms the state of the art. Our method uses the clustering algorithm Bayesian Sets even when its underlying independence assumption is violated, and we provide a theoretical generalization bound to motivate its use.

Power-constrained block-test list scheduling

A list scheduling approach is proposed in this paper to overcome the problem of unequal-length block-test scheduling under power dissipation constraints. An extended tree growing technique is also used in combination with the list scheduling algorithm in order to improve the test concurrency, having assigned power dissipation limits. Moreover, the algorithm features a power dissipation balancing provision. Test scheduling examples are discussed, highlighting further research steps towards an efficient system-level test scheduling algorith

A combined tree growing technique for block-test scheduling under power constraints

A tree growing technique is used here together with classical scheduling algorithms in order to improve the test concurrency having assigned power dissipation limits. First of all, the problem of unequal-length block-test scheduling under power dissipation constraints is modeled as a tree growing problem. Then a combination of list and force-directed scheduling algorithms is adapted to tackle it. The goal of this approach is to achieve rapidly a test scheduling solution with a near-optimal test application time. This is initially achieved with the list approach. Then the power dissipation distribution of this solution is balanced by using a force-directed global priority function. The force-directed priority function is a distribution-graph based global priority function. A constant additive model is employed for power dissipation analysis and estimation. Based on test scheduling examples, the efficiency of this approach is discussed as compared to the other approaches

Cell Phone Activities 2012

Fully 85% of American adults own a cell phone and now use the devices to do much more than make phone calls. Cell phones have become a portal for an ever-growing list of activities. In nationally representative phone surveys in the spring and summer, the Pew Research Center's Internet & American Life Project obtained readings on some of the most popular activities

Learning about America's Best: Resources on Educating, Training, and Hiring Returning Veterans and Service Members

This document provides a quick list of some of the many books, articles, and web sites that offer information for educators, trainers, employers, service members, veterans, and family members. It is part of a series of materials written to address the growing need for information and ideas that can help our nation's schools, training organizations, and workplaces make a welcoming, productive, and satisfying place for returning veterans and transitioning service members

The IUCN Red List of Ecosystems: motivations, challenges, and applications

Abstract In response to growing demand for ecosystem-level risk assessment in biodiversity conservation, and rapid proliferation of locally tailored protocols, the IUCN recently endorsed new Red List criteria as a global standard for ecosystem risk assessment. Four qualities were sought in the design of the IUCN criteria: generality; precision; realism; and simplicity. Drawing from extensive global consultation, we explore trade-offs among these qualities when dealing with key challenges, including ecosystem classification, measuring ecosystem dynamics, degradation and collapse, and setting decision thresholds to delimit ordinal categories of threat. Experience from countries with national lists of threatened ecosystems demonstrates well-balanced trade-offs in current and potential applications of Red Lists of Ecosystems in legislation, policy, environmental management and education. The IUCN Red List of Ecosystems should be judged by whether it achieves conservation ends and improves natural resource management, whether its limitations are outweighed by its benefits, and whether it performs better than alternative methods. Future development of the Red List of Ecosystems will benefit from the history of the Red List of Threatened Species which was trialed and adjusted iteratively over 50 years from rudimentary beginnings. We anticipate the Red List of Ecosystems will promote policy focus on conservation outcomes in situ across whole landscapes and seascapes

Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory

Let $f$ be a polynomial of degree $d$ in $n$ variables over a finite field $\mathbb{F}$. The polynomial is said to be unbiased if the distribution of $f(x)$ for a uniform input $x \in \mathbb{F}^n$ is close to the uniform distribution over $\mathbb{F}$, and is called biased otherwise. The polynomial is said to have low rank if it can be expressed as a composition of a few lower degree polynomials. Green and Tao [Contrib. Discrete Math 2009] and Kaufman and Lovett [FOCS 2008] showed that bias implies low rank for fixed degree polynomials over fixed prime fields. This lies at the heart of many tools in higher order Fourier analysis. In this work, we extend this result to all prime fields (of size possibly growing with $n$). We also provide a generalization to nonprime fields in the large characteristic case. However, we state all our applications in the prime field setting for the sake of simplicity of presentation. As an immediate application, we obtain improved bounds for a suite of problems in effective algebraic geometry, including Hilbert nullstellensatz, radical membership and counting rational points in low degree varieties. Using the above generalization to large fields as a starting point, we are also able to settle the list decoding radius of fixed degree Reed-Muller codes over growing fields. The case of fixed size fields was solved by Bhowmick and Lovett [STOC 2015], which resolved a conjecture of Gopalan-Klivans-Zuckerman [STOC 2008]. Here, we show that the list decoding radius is equal the minimum distance of the code for all fixed degrees, even when the field size is possibly growing with $n$

Andersonville’s Providence Spring

This post is part of a series featuring behind-the-scenes dispatches from our Pohanka Interns on the front lines of history this summer as interpreters, archivists, and preservationists. See here for the introduction to the series. At Andersonville National Historic Site there is not much left of what was here in 1864 when this site operated as a prison, aside from the earthworks, which now have pleasant green grass growing on them. The petrified stumps of the original stockade do still remain in the ground, but otherwise the park is a quaint pretty scene of rolling hills with tall grass. The only visible indication of the horrors that prisoners suffered here is in the cemetery. The headstones of the prisoners have no space between them, they are placed exactly where the prisoners were buried shoulder to shoulder in trenches, 13,000 of them side by side. Most of the stones have names on them but about 400 do not. This is something distinctive about Andersonville, the fact that so many of those who died here are known. This is thanks to a paroled prisoner, Dorace Atwater, and the secret list of the dead he kept when working in the hospital and the dead house. But sadly, this list was destroyed in a fire that consumed Atwater’s home in the early 20th century. Visitors frequently ask whether the museum has the Atwater list, but the best we can do is direct them to a book in the bookstore that has a portion of the list. [excerpt