Non-display uses of copyright works: Google Books and beyond

Copyright @ 2011 The AuthorsWith the advent of mass digitisation projects, such as the Google Book Search, a peculiar shift has occurred in the way that copyright works are dealt with. Contrary to what has so far been the case, works are turned into machine-readable data to be automatically processed for various purposes without the expression of works being displayed to the public. In the Google Book Settlement Agreement, this new kind of uses is referred to as “non-display uses” of digital works. The legitimacy of these uses has not yet been tested by Courts and does not comfortably fit in the current copyright doctrine, plainly because the works are not used as works but as something else, namely as data. Since non-display uses may prove to be a very lucrative market in the near future, with the potential to affect the way people use copyright works, we examine non-display uses under the prism of copyright principles to determine the boundaries of their legitimacy. Through this examination, we provide a categorisation of the activities carried out under the heading of “non-display uses”, we examine their lawfulness under the current copyright doctrine and approach the phenomenon from the spectrum of data protection law as could apply, by analogy, to the use of copyright works as processable data

Nuclear pairing from microscopic forces: singlet channels and higher-partial waves

Background: An accurate description of nuclear pairing gaps is extremely important for understanding static and dynamic properties of the inner crusts of neutron stars and to explain their cooling process. Purpose: We plan to study the behavior of the pairing gaps $\Delta_F$ as a function of the Fermi momentum $k_F$ for neutron and nuclear matter in all relevant angular momentum channels where superfluidity is believed to naturally emerge. The calculations will employ realistic chiral nucleon-nucleon potentials with the inclusion of three-body forces and self-energy effects. Methods: The superfluid states of neutron and nuclear matter are studied by solving the BCS gap equation for chiral nuclear potentials using the method suggested by Khodel et al., where the original gap equation is replaced by a coupled set of equations for the dimensionless gap function $\chi(p)$ defined by $\Delta(p) = \Delta_F \chi(p)$ and a non-linear algebraic equation for the gap magnitude $\Delta_F = \Delta(p_F)$ at the Fermi surface. This method is numerically stable even for small pairing gaps, such as that encountered in the coupled $^3PF_2$ partial wave. Results: We have successfully applied Khodel's method to singlet ($S$) and coupled channel ($SD$ and $PF$) cases in neutron and nuclear matter. Our calculations agree with other ab-initio approaches, where available, and provide crucial inputs for future applications in superfluid systems.Comment: 18 pages and 9 figure

On optimal and near-optimal turbo decoding using generalized max operator

Motivated by a recently published robust geometric programming approximation, a generalized approach for approximating efficiently the max* operator is presented. Using this approach, the max* operator is approximated by means of a generic and yet very simple max operator, instead of using additional correction term as previous approximation methods require. Following that, several turbo decoding algorithms are obtained with optimal and near-optimal bit error rate (BER) performance depending on a single parameter, namely the number of piecewise linear (PWL) approximation terms. It turns out that the known max-log-MAP algorithm can be viewed as special case of this new generalized approach. Furthermore, the decoding complexity of the most popular previously published methods is estimated, for the first time, in a unified way by hardware synthesis results, showing the practical implementation advantages of the proposed approximations against these method

DoWitcher: Effective Worm Detection and Containment in the Internet Core

Enterprise networks are increasingly offloading the responsibility for worm detection and containment to the carrier networks. However, current approaches to the zero-day worm detection problem such as those based on content similarity of packet payloads are not scalable to the carrier link speeds (OC-48 and up-wards). In this paper, we introduce a new system, namely DoWitcher, which in contrast to previous approaches is scalable as well as able to detect the stealthiest worms that employ low-propagation rates or polymorphisms to evade detection. DoWitcher uses an incremental approach toward worm detection: First, it examines the layer-4 traffic features to discern the presence of a worm anomaly; Next, it determines a flow-filter mask that can be applied to isolate the suspect worm flows and; Finally, it enables full-packet capture of only those flows that match the mask, which are then processed by a longest common subsequence algorithm to extract the worm content signature. Via a proof-of-concept implementation on a commercially available network analyzer processing raw packets from an OC-48 link, we demonstrate the capability of DoWitcher to detect low-rate worms and extract signatures for even the polymorphic worm

Motion estimation and CABAC VLSI co-processors for real-time high-quality H.264/AVC video coding

Real-time and high-quality video coding is gaining a wide interest in the research and industrial community for different applications. H.264/AVC, a recent standard for high performance video coding, can be successfully exploited in several scenarios including digital video broadcasting, high-definition TV and DVD-based systems, which require to sustain up to tens of Mbits/s. To that purpose this paper proposes optimized architectures for H.264/AVC most critical tasks, Motion estimation and context adaptive binary arithmetic coding. Post synthesis results on sub-micron CMOS standard-cells technologies show that the proposed architectures can actually process in real-time 720 × 480 video sequences at 30 frames/s and grant more than 50 Mbits/s. The achieved circuit complexity and power consumption budgets are suitable for their integration in complex VLSI multimedia systems based either on AHB bus centric on-chip communication system or on novel Network-on-Chip (NoC) infrastructures for MPSoC (Multi-Processor System on Chip

A multiprocessor based packet-switch: performance analysis of the communication infrastructure

The intra-chip communication infrastructures are receiving always more attention since they are becoming a crucial part in the development of current SoCs. Due to the high availability of pre-characterized hard-IP, the complexity of the design is moving toward global interconnections which are introducing always more constraints at each technology node. Power consumption, timing closure, bandwidth requirements, time to market, are some of the factors that are leading to the proposal of new solutions for next generation multi-million SoCs. The need of high programmable systems and the high gate-count availability is moving always more attention on multiprocessors systems (MP-SoC) and so an adequate solution must be found for the communication infrastructure. One of the most promising technologies is the Network-On-Chip (NoC) architecture, which seems to better fit with the new demanding complexity of such systems. Before starting to develop new solutions, it is crucial to fully understand if and when current bus architectures introduce strong limitations in the development of high speed systems. This article describes a case study of a multiprocessor based ethernet packet-switch application with a shared-bus communication infrastructure. This system aims to depict all the bottlenecks which a shared-bus introduces under heavy load. What emerges from this analysis is that, as expected, a shared-bus is not scalable and it strongly limits whole system performances. These results strengthen the hypothesis that new communication architectures (like the NoC) must be found

Spatial determinants of local government action on climate change: an analysis of local authorities in England

The engagement of UK local authorities is vital if national government is to meet its climate change commitments. However, with no mandatory targets at local government level, other drivers must explain engagement. Using a Geographic Information System, this study compares the spatial distribution of action on climate change based on past actions and stated intentions to a suite of relevant independent variables. The Action Index created is among the first to quantify climate change engagement beyond a simple binary measure and provides a useful comparative study to recent work in the US. The Index enables investigation of both mitigation and adaptation, which show different trends in relation to some variables. The study shows that action is strongest where the voting habits of the local population suggest environmental concern and where neighbouring local authorities are also engaging in action on climate change. Physical vulnerability to the effects of climate change is a motivator for action only where the dangers are obvious. Action is less likely where other resource intensive issues such as crime and housing exist within a local authority area