Toward the reduction of population obesity: Macrolevel environmental approaches to the problems of food, eating, and obesity.

The authors reviewed the evidential basis of three environmental approaches to reducing population obesity: What are the effects of (a) taxing or subsidizing foods, (b) manipulating the ease of food access, and (c) restricting access to certain foods? A narrative review evaluated evidence using National Heart, Lung, and Blood Institute criteria. There was strong evidence that subsidization influences food purchases, but not necessarily food consumption or body weight. Ease of food access may influence food purchases, and possibly food intake and body weight. Data on restriction were lacking. More studies are needed to justify that altering these macro-environmental variables will necessarily reduce population obesity. A proposed conceptual model posits that the steps through environmental interventions may exert intended and unintended influences on body weight and obesity prevalence. Contemplated policy changes should weigh scientific evidence with social judgments and values concerning changes to the environment. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Tight Bounds for Adopt-Commit Objects

We give matching upper and lower bounds of \(\varTheta(\min(\frac{\log m}{\log \log m},\, n))\) for the individual step complexity of a wait-free m-valued adopt-commit object implemented using multi-writer registers for n anonymous processes. While the upper bound is deterministic, the lower bound holds for randomized adopt-commit objects as well. Our results are based on showing that adopt-commit objects are equivalent, up to small additive constants, to a simpler class of objects that we call conflict detectors. Our anonymous lower bound also applies to the individual step complexity of m-valued wait-free anonymous consensus, even for randomized algorithms with global coins against an oblivious adversary. The upper bound can be used to slightly improve the cost of randomized consensus against an oblivious adversary. For deterministic non-anonymous implementations of adopt-commit objects, we show a lower bound of \(\varOmega(\min(\frac{\log m}{\log \log m}, \frac{\sqrt{\log n}}{\log \log n}))\) and an upper bound of \(O(\min(\frac{\log m}{\log \log m},\, \log n))\) on the worst-case individual step complexity. For randomized non-anonymous implementations, we show that any execution contains at least one process whose steps exceed the deterministic lower bound.     

The space complexity of unbounded timestamps

The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide information about the real-time ordering of those events. We consider the space complexity of wait-free implementations of timestamps from shared read-write registers in a system of n processes. We prove an lower bound on the number of registers required. If the timestamps are elements of a nowhere dense set, for example the integers, we prove a stronger, and tight, lower bound of n. However, if timestamps are not from a nowhere dense set, this bound can be beaten: we give an implementation that uses n − 1 (single-writer) registers. We also consider the special case of anonymous implementations, where processes are programmed identically and do not have unique identifiers. In contrast to the general case, we prove anonymous timestamp implementations require n registers. We also give an implementation to prove that this lower bound is tight. This is the first anonymous timestamp implementation that uses a finite number of registers.     

Universal constructions that ensure disjoint-access parallelism and wait-freedom

A universal construction is a general mechanism for obtaining a concurrent implementation of an object from its sequential code. We show that there is no universal construction that is both disjoint-access parallel (guaranteeing the processes operating on different parts of an implemented object do not interfere with one another) and wait-free (guaranteeing progress for each nonfaulty process when accessing an object). In contrast, we present a universal construction which results in disjoint-access parallel, wait-free implementations of any object provided there is a bound on the number of data items accessed by each operation supported by the object.     

Fully-adaptive algorithms for long-lived renaming

Long-lived renaming allows processes to repeatedly get distinct names from a small name space and release these names. This paper presents two long-lived renaming algorithms in which the name a process gets is bounded above by the number of processes currently occupying a name or performing one of these operations. The first algorithm is asynchronous, uses LL/SC objects, and has step complexity that is linear in the number of processes, c, currently getting or releasing a name. The second is synchronous, uses registers and counters, and has step complexity that is polylogarithmic in c. Both tolerate any number of process crashes.     

Personalization and privacy: a survey of privacy risks and remedies in personalization-based systems

Personalization technologies offer powerful tools for enhancing the user experience in a wide variety of systems, but at the same time raise new privacy concerns. For example, systems that personalize advertisements according to the physical location of the user or according to the user??s friends?? search history, introduce new privacy risks that may discourage wide adoption of personalization technologies. This article analyzes the privacy risks associated with several current and prominent personalization trends, namely social-based personalization, behavioral profiling, and location-based personalization. We survey user attitudes towards privacy and personalization, as well as technologies that can help reduce privacy risks. We conclude with a discussion that frames risks and technical solutions in the intersection between personalization and privacy, as well as areas for further investigation. This frameworks can help designers and researchers to contextualize privacy challenges of solutions when designing personalization systems.     

Remembering the Good, Forgetting the Bad: Intentional Forgetting of Emotional Material in Depression.

The authors examined intentional forgetting of negative material in depression. Participants were instructed to not think about emotional nouns that they had learned to associate with a neutral cue word. The authors provided participants with multiple occasions to suppress the unwanted words. Overall, depressed participants successfully forgot negative words. Moreover, the authors obtained a clear practice effect. However, forgetting came at a cost: Compared with the nondepressed participants and with the depressed participants who were instructed to forget positive words, depressed participants who were instructed to forget negative words showed significantly worse recall of the baseline words. These results indicate that training depressed individuals in intentional forgetting could prove to be an effective strategy to counteract automatic ruminative tendencies and mood-congruent biases. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Hierarchical Growth of ZnO Particles by a Hydrothermal Route

The crystallization of ZnO microrods by hydrothermal treatment of a suspension formed from reaction of zinc acetate and sodium hydroxide has been examined using scanning and transmission electron microscopy. Polycrystalline hexagonal ZnO microrods first appeared after 0.5 h reaction time at 120°C. These early stage rods were composed of stacks of hexagonal layers, each ~50 nm in thickness containing closely aligned assemblies of nanocrystallites <20 nm in size. Further growth of the microrods involved columns of nanoparticles extending from the basal layers of the preformed hexagonal stacks. Re‐crystallization produced single‐crystal microrods, many of which existed as twin particles.     

PET validation of a novel prefrontal task: Delayed response alteration.

Deficits in working memory have been proposed to explain the performance failures of frontally lesioned primates on delayed alternation (DA) and delayed response (DR) tasks. The authors examined a computerized test of delayed response alternation (DRA), which combines elements of DR and DA in a sample of 18 normal volunteers who underwent oxygen-15 PET regional cerebral blood flow scans during the DRA and a sensorimotor control task. Significant activations were observed in a network of frontal, parietal, occipital, and temporal regions during initial task performance. A qualitatively similar but somewhat reduced set of activations was observed in a subset of participants who repeated the task after practice and instruction. These results are consistent with distributed models of working memory derived from studies of nonhuman primates and suggest that the frontal lobes contribute to human working memory function. (PsycINFO Database Record (c) 2010 APA, all rights reserved)