Online news audiences: the challenges of web metrics

Online audience tracking technologies create an unprecedented opportunity for the media to collect natural, real-time data on what users do, and do not do, with news products. These user metrics have begun to shape editorial decisions and development strategies in newsrooms around the world. This chapter reviews this industrial trend and the challenges that web metrics present to journalism. It argues that these challenges, if not calmly addressed, could deepen an already critical crisis – the dumbing down of news – and bring newsroom tensions and conflicts to a new height. Journalists need to foster a stronger professional culture that helps them to take confidence and pride in their autonomous news judgement and to resist, wherever necessary, the sentiment of the crowd

A D.C. Algorithm via Convex Analysis Approach for Solving a Location Problem Involving Sets

We study a location problem that involves a weighted sum of distances to closed convex sets. As several of the weights might be negative, traditional solution methods of convex optimization are not applicable. After obtaining some existence theorems, we introduce a simple, but effective, algorithm for solving the problem. Our method is based on the Pham Dinh - Le Thi algorithm for d.c. programming and a generalized version of the Weiszfeld algorithm, which works well for convex location problems