Media Convergence's Third Wave Content Streaming

Movies, pieces of music, books, or newspapers can all be expressed in the same binary code. Discrete forms of analogue media are just different dialects of the language of computerese. Content is becoming a very liquid asset. To take Marshall McLuhan's famed dictum a step further: The message is now independent of the medium

Think global, act global: Corporate content streaming and Australian media policy

Australia ’s media policy agenda has recently been dominated by debate over two key issues: media ownership reform, and the local content provisions of the Australia–United States Free Trade Agreement. Challenging the tendency to analyse these issues separately, the article considers them as interlinked indicators of fundamental shifts occurring in the digital media environment. Converged media corporations increasingly seek to achieve economies of scale through ‘content streaming’: multi-purposing proprietary content across numerous digitally enabled platforms. This has resulted in rivalries for control of delivery technologies (as witnessed in media ownership debates) as well as over market access for corporate content (in the case of local content debates). The article contextualises Australia’s contemporary media policy flashpoints within international developments and longer-term industry strategising. It further questions the power of media policy as it is currently conceived to deal adequately with the challenges raised by a converging digital media marketplace.

Sheet flow sediment transport under waves with acceleration skewness and boundary layer streaming

The effect of acceleration skewness on sheet flow sediment transport rates (q) over bar (s) is analysed using new data which have acceleration skewness and superimposed currents but no boundary layer streaming. Sediment mobilizing forces due to drag and to acceleration (similar to pressure gradients) are weighted by cosine and sine, respectively, of the angle phi(.)(tau)phi(tau) = 0 thus corresponds to drag dominated sediment transport, (q) over bar (s)similar to vertical bar u(infinity)vertical bar u(infinity), while phi(tau) = 90 degrees corresponds to total domination by the pressure gradients, (q) over bar similar to du(infinity)/dt. Using the optimal angle, phi = 51 degrees based on that data, good agreement is subsequently found with data that have strong influence from boundary layer streaming. Good agreement is also maintained with the large body of U-tube data simulating sine waves with superimposed currents and second-order Stokes waves, all of which have zero acceleration skewness. The recommended model can be applied to irregular waves with arbitrary shape as long as the assumption negligible time lag between forcing and sediment transport rate is valid. With respect to irregular waves, the model is much easier to apply than the competing wave-by-wave models. Issues for further model developments are identified through a comprehensive data review.

Motion vector encryption in multimedia streaming

Streaming video application requires high security as well as high computational performance. In video encryption, traditional selective algorithms have been used to partially encrypt the relatively important data in order to satisfy the streaming performance requirement. Most video selective encryption algorithms are inherited from still image encryption algorithms, the encryption on motion vector data is not considered. The assumption is that motion vector data are not as important as pixel image data. Unfortunately, in some cases, motion vector itself may be sufficient enough to leak out useful video information. Normally motion vector data consume over half of the whole video stream bandwidth, neglecting their security may be unwise. In this paper, we target this security problem and illustrate attacks at two different levels that can restore useful video information using motion vectors only. Further, an information analysis is made and a motion vector information model is built. Based on this model, we describe a new motion vector encryption algorithm called MVEA. We show the experimental results of MVEA. The security strength and performance of the algorithm are also evaluated.

Fault-tolerant quantum computation with cluster states

The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)] shows that it is possible to quantum compute using only a fixed entangled resource known as a cluster state, and adaptive single-qubit measurements. This model is the basis for several practical proposals for quantum computation, including a promising proposal for optical quantum computation based on cluster states [M. A. Nielsen, Phys. Rev. Lett. (to be published), quant-ph/0402005]. A significant open question is whether such proposals are scalable in the presence of physically realistic noise. In this paper we prove two threshold theorems which show that scalable fault-tolerant quantum computation may be achieved in implementations based on cluster states, provided the noise in the implementations is below some constant threshold value. Our first threshold theorem applies to a class of implementations in which entangling gates are applied deterministically, but with a small amount of noise. We expect this threshold to be applicable in a wide variety of physical systems. Our second threshold theorem is specifically adapted to proposals such as the optical cluster-state proposal, in which nondeterministic entangling gates are used. A critical technical component of our proofs is two powerful theorems which relate the properties of noisy unitary operations restricted to act on a subspace of state space to extensions of those operations acting on the entire state space. We expect these theorems to have a variety of applications in other areas of quantum-information science.

An introduction to efficiency and productivity analysis

The second edition of An Introduction to Efficiency and Productivity Analysis is designed to be a general introduction for those who wish to study efficiency and productivity analysis. The book provides an accessible, well-written introduction to the four principal methods involved: econometric estimation of average response models; index numbers, data envelopment analysis (DEA); and stochastic frontier analysis (SFA). For each method, a detailed introduction to the basic concepts is presented, numerical examples are provided, and some of the more important extensions to the basic methods are discussed. Of special interest is the systematic use of detailed empirical applications using real-world data throughout the book. In recent years, there have been a number of excellent advance-level books published on performance measurement. This book, however, is the first systematic survey of performance measurement with the express purpose of introducing the field to a wide audience of students, researchers, and practitioners. Indeed, the 2nd Edition maintains its uniqueness: (1) It is a well-written introduction to the field. (2) It outlines, discusses and compares the four principal methods for efficiency and productivity analysis in a well-motivated presentation. (3) It provides detailed advice on computer programs that can be used to implement these performance measurement methods. The book contains computer instructions and output listings for the SHAZAM, LIMDEP, TFPIP, DEAP and FRONTIER computer programs. More extensive listings of data and computer instruction files are available on the book's website: (www.uq.edu.au/economics/cepa/crob2005).

The meeting place problem: Salience and search.

The notion of salience was developed by Schelling in the context of the meeting-place problem of locating a partner in the absence of a pre-agreed meeting place. In this paper, we argue that a realistic specification of the meeting place problem involves allowing a strategy of active search over a range of possible meeting places. We solve this extended problem, allowing for extensions such as repeated play, search costs and asymmetric payoffs. The result is a considerably richer, but more complex, notion of salience. (C) 1998 Elsevier Science B.V.

Subcycling first- and second-order generalizations of the trapezoidal rule

Subcycling algorithms which employ multiple timesteps have been previously proposed for explicit direct integration of first- and second-order systems of equations arising in finite element analysis, as well as for integration using explicit/implicit partitions of a model. The author has recently extended this work to implicit/implicit multi-timestep partitions of both first- and second-order systems. In this paper, improved algorithms for multi-timestep implicit integration are introduced, that overcome some weaknesses of those proposed previously. In particular, in the second-order case, improved stability is obtained. Some of the energy conservation properties of the Newmark family of algorithms are shown to be preserved in the new multi-timestep extensions of the Newmark method. In the first-order case, the generalized trapezoidal rule is extended to multiple timesteps, in a simple way that permits an implicit/implicit partition. Explicit special cases of the present algorithms exist. These are compared to algorithms proposed previously. (C) 1998 John Wiley & Sons, Ltd.

An overview of the MPEG-7 description definition language (DDL)

This paper presents an overview of the MPEG-7 Description Definition Language (DDL). The DDL provides the syntactic rules for creating, combining, extending and refining MPEG-7 Descriptors (Ds) and Description Schemes (DSs), In the interests of interoperability, the W3C's XML Schema language, with the addition of certain MPEG-7-specific extensions, has been chosen as the DDL. This paper describes the background to this decision and using examples, provides an overview of the core XML, schema features used within MPEG-7 and the extensions made in order to satisfy the MPEG-7 DDL requirements.