The impact of faith on relational thought

Paper presented at the conf Faith, freedom and the academy: the idea of the university in the 21st century, Univ of Prince Edward Island, O 1-3 2004

Rations for growing and fattening roasters and capons

Cover title.Mode of access: Internet

Experiments with laying hens

Cover title.Mode of access: Internet

Factors responsible for remote-frequency masking in children and adults

Susceptibility to remote-frequency masking in children and adults was evaluated with respect to three stimulus features: (1) masker bandwidth, (2) spectral separation of the signal and masker, and (3) gated versus continuous masker presentation. Listeners were 4- to 6-year-olds, 7- to 10-year-olds, and adults. Detection thresholds for a 500-ms, 2000-Hz signal were estimated in quiet or presented with a band of noise in one of four frequency regions: 425–500 Hz, 4000–4075 Hz, 8000–8075 Hz, or 4000–10 000 Hz. In experiment 1, maskers were gated on in each 500-ms interval of a three-interval, forced-choice adaptive procedure. Masking was observed for all ages in all maskers, but the greatest masking was observed for the 4000–4075 Hz masker. These findings suggest that signal/masker spectral proximity plays an important role in remote-frequency masking, even when peripheral excitation associated with the signal and masker does not overlap. Younger children tended to have more masking than older children or adults, consistent with a reduced ability to segregate simultaneous sounds and/or listen in a frequency-selective manner. In experiment 2, detection thresholds were estimated in the same noises, but maskers were presented continuously. Masking was reduced for all ages relative to gated conditions, suggesting improved segregation and/or frequency-selective listening

Disjoint NP-pairs from propositional proof systems

For a proof system P we introduce the complexity class DNPP(P) of all disjoint NP-pairs for which the disjointness of the pair is efficiently provable in the proof system P. We exhibit structural properties of proof systems which make the previously defined canonical NP-pairs of these proof systems hard or complete for DNPP(P). Moreover we demonstrate that non-equivalent proof systems can have equivalent canonical pairs and that depending on the properties of the proof systems different scenarios for DNPP(P) and the reductions between the canonical pairs exist

Experiments with poultry

Cover title.Mode of access: Internet

Limitations of Algebraic Approaches to Graph Isomorphism Testing

We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and only if if the graphs are isomorphic, and then to (try to) decide satisfiability of the system using, for example, the Gr\"obner basis algorithm. In some cases this can be done in polynomial time, in particular, if the equations admit a bounded degree refutation in an algebraic proof systems such as Nullstellensatz or polynomial calculus. We prove linear lower bounds on the polynomial calculus degree over all fields of characteristic different from 2 and also linear lower bounds for the degree of Positivstellensatz calculus derivations. We compare this approach to recently studied linear and semidefinite programming approaches to isomorphism testing, which are known to be related to the combinatorial Weisfeiler-Lehman algorithm. We exactly characterise the power of the Weisfeiler-Lehman algorithm in terms of an algebraic proof system that lies between degree-k Nullstellensatz and degree-k polynomial calculus