A graph G is maximal nontraceable (MNT) if G does not have a hamiltonian path but, for every e ∈ E (

The following report is a case study example of how problematic information can invade and percolate through the literature on forensic human factors and ergonomics. Initially, a highly doubtful assertion was used to bolster an argument made in a legal case of wrongful death. The assertion was supported through reference to a number of cited works. When the trail of evidence was pursued, howeve...

This policy brief presents information about the walking habits of California adults based on data from the 2003 California Health Interview Survey (CHIS 2003). We examine the prevalence of regular walking and no walking by socio-demographic and neighborhood characteristics. Regular walking is defined as walking on at least five separate occasions for a combined total of at least 150 minutes in...

A well-known theorem of Goldberg and West states that two thieves can always split a necklace containing an even number of beads from each of k types fairly by at most k cuts. We prove that if we can use at most k− 1 cuts and fair splitting is not possible then the thieves still have the following option. Whatever way they specify two disjoint sets D1, D2 of the types of beads with D1 ∪ D2 6= ∅...

Most recent research of scalable inductive learning on very large dataset, decision tree construction in particular, focuses on eliminating memory constraints and reducing the number of sequential data scans. However, state-of-the-art decision tree construction algorithms still require multiple scans over the data set and use sophisticated control mechanisms and data structures. We first discus...