4,803 research outputs found
The Price Premium for Organic Babyfood: A Hedonic Analysis
The price premium associated with organic babyfood is estimated by applying a hedonic model to price and characteristic data for babyfood products collected in two cities: Raleigh, North Carolina, and San Jose, California. The price per ounce of babyfood is modeled as a function of a number of babyfood and store characteristics. The estimated organic price premium is generally equal to 3 cents to 4 cents per ounce. To the extent this premium reflects consumer willingness to pay to reduce pesticide exposures, it could be used to infer values for reduced dietary exposures to pesticide residues for babies.babyfood, hedonic analysis, organic foods, Demand and Price Analysis,
Genetic mosaic dissection of candidate genes in mice using mosaic analysis with double markers
Mosaic analysis with double markers (MADM) technology enables the generation of genetic mosaic tissue in mice. MADM enables concomitant fluorescent cell labeling and introduction of a mutation of a gene of interest with single-cell resolution. This protocol highlights major steps for the generation of genetic mosaic tissue and the isolation and processing of respective tissues for downstream histological analysis. For complete details on the use and execution of this protocol, please refer to Contreras et al. (2021)
Reaching out to overcome political apathy: Building participatory capacity through deliberative engagement
Usage des médias et langue de communication dans la communauté francophone du nord-ouest de l’Ontario
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics
We consider the problem of computing a Steiner tree of minimum cost under a k-hop constraint which requires the depth of the tree to be at most k. Our main result is an exact algorithm for metrics induced by graphs of bounded treewidth that runs in time n^O(k). For the special case of a path, we give a simple algorithm that solves the problem in polynomial time, even if k is part of the input. The main result can be used to obtain, in quasi-polynomial time, a near-optimal solution that violates the k-hop constraint by at most one hop for more general metrics induced by graphs of bounded highway dimension and bounded doubling dimension
- …