We investigate optimal geographical caching in heterogeneous cellular networks, where different types of base stations (BSs) have different cache capacities. The content library contains files with different popularities. The performance metric is the total hit probability. The problem of optimally placing content in all BSs jointly is not convex in general. However, we show that when BSs are d...

Some recent publications have raised the question of placing Ireland in a comparative perspective. Three such comparative frameworks are investigated in this paper: advanced capitalist countries, (West)European countries, and finally semi-peripheral European societies. Although not an advanced capitalist economy, Ireland displays the central institutional features of such societies. But on clos...

This introduction draws together the braad themes discussed in the articles presented in th is special issue, placing cross-national similarities and differences in gender, equality, and industrial relations within a broader conceptual and policy context. As a field of study, industrial relations traditionally downplays the salience of gender and other identity characteristics; however, the Eur...

In 2000/01, 10% of Canadians aged 20 or older reported having a repetitive strain injury (RSI) in the previous 12 months that was serious enough to limit their usual activities, the Canadian Community Health and the National Population Health surveys indicate. Of respondents reporting RSIs, 55% indicated that they had resulted from activities at work, while 20% cited sports or physical exercise...

Pavlovian fear conditioning depends on synaptic plasticity at amygdala neurons. Here, we review recent electrophysiological, molecular and behavioral evidence suggesting the existence of a distributed neural circuitry regulating amygdala synaptic plasticity during fear learning. This circuitry, which involves projections from the midbrain periaqueductal gray region, can be linked to prediction ...

We consider the problem of packing a family of disks “on a shelf,” that is, such that each disk touches the x-axis from above and such that no two disks overlap. We prove that the problem of minimizing the distance between the leftmost point and the rightmost point of any disk is NP-hard. On the positive side, we show how to approximate this problem within a factor of 4/3 in O(n logn) time, and...