We study the precise conditions under which all optimisation strategies for a given family of finite functions yield the same expected maximisation performance, when averaged over a uniform distribution of the functions. In the case of bounded-length searches in a family of Boolean functions, we provide tight connections between such “No Free Lunch” conditions and the structure of t-designs and...

In this paper, we discuss our ongoing work on a digitally augmented lunch area in our research lab. As we repeatedly observed how digital resources have the potential to enrich conversations in this semi-public, casual setting, we became interested in exploring the relationship between physical and digital artefacts in the context of social interaction. We turn to performance as a promising res...

By tracing the publication history of William Burroughs’ Naked Lunch, this article shows how gate-keeping mechanism censorship can facilitate literary prestige. The release Grove Press edition Lunch in 1966 after two obscenity trials marked end complete US and was a crucial step towards canonization underground authors. making it necessary to argue on behalf text’s form, helped framing Burrough...

The aim of the worksite study is to elucidate the strain reducing impact of different forms of spending lunch breaks. With the help of the so-called silent room cabin concept, it was possible to induce a lunch-break relaxation opportunity that provided visual and territorial privacy. To evaluate the proposed effects, 14 call center agents were assigned to either 20 min progressive muscle relaxa...

The sharpened No-Free-Lunch-theorem (NFL-theorem) states that, regardless of the performance measure, the performance of all optimization algorithms averaged uniformly over any finite set F of functions is equal if and only if F is closed under permutation (c.u.p.). In this paper, we first summarize some consequences of this theorem, which have been proven recently: The number of subsets c.u.p....

The sharpened No-Free-Lunch-theorem (NFL-theorem) states that the performance of all optimization algorithms averaged over any finite set F of functions is equal if and only if F is closed under permutation (c.u.p.) and each target function in F is equally likely. In this paper, we first summarize some consequences of this theorem, which have been proven recently: The average number of evaluati...

BACKGROUND Most young children are in child care. Previous studies suggest that children may receive insufficient vegetables, and foods and beverages with added sugars, fats, and sodium in these settings. None have compared the nutritional quality of meals to snacks. METHODS Directors from 258 full-day child-care centers in two urban counties of southwestern Ohio were surveyed via telephone i...

OBJECTIVES This study examined associations between high school students' lunch patterns and vending machine purchases and the school food environment and policies. METHODS A randomly selected sample of 1088 high school students from 20 schools completed surveys about their lunch practices and vending machine purchases. School food policies were assessed by principal and food director surveys...