Electrochemical generation of ferrate Part 2: Influence of anode composition

The influence of the composition of the anode on the anodic dissolution of iron based alloys in 10m NaOH to give ferrate has been studied. It is shown that the current efficiency for ferrate formation increases significantly with the carbon content of the alloy. A silver steel with a carbon content of 0.90% initially gave a current efficiency greater than 70%, dropping to 30% after an hour, in a cell with flat plate electrodes and using a current density of 1 mA cm^–2. In comparison, in the same conditions, an alloy with a carbon content of 0.08% showed a current efficiency dropping from 12 to 8%.     

Compact holographic storage demonstrator with rapid access

We discuss the design of a complete, compact holographic storage demonstrator based on a combination of spatial and angular multiplexing and using acousto-optic deflectors for rapid nonmechanical access. We also describe the implementation of this design and preliminary results of both the analog storage and the retrieval of 20,000 holograms in twenty 1-mm-thick layers of a lithium niobate crystal and of the digital storage and error-free retrieval of color images by using error-correcting techniques.     

Sparse CCA using a Lasso with positivity constraints

Canonical correlation analysis (CCA) describes the relationship between two sets of variables by finding linear combinations of the variables with maximal correlation. A sparse version of CCA is proposed that reduces the chance of including unimportant variables in the canonical variates and thus improves their interpretation. A version of the Lasso algorithm incorporating positivity constraints is implemented in tandem with alternating least squares (ALS), to obtain sparse canonical variates. The proposed method is demonstrated on simulation studies and a data set from market basket analysis.     

Deciding k-Colorability of P 5-Free Graphs in Polynomial Time

The problem of computing the chromatic number of a P ₅-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show that for every fixed integer k, there exists a polynomial-time algorithm determining whether or not a P ₅-free graph admits a k-coloring, and finding one, if it does.     

Discriminating between disturbance and process model mismatch in model predictive control

A novel method for discriminating faults in model predictive control is presented. The proposed method monitors the Kalman filter innovations to detect the presence of autocorrelation, which is an indication of suboptimal state estimation. The cause of the suboptimal state estimation is diagnosed by the observability of this innovations process. This task involves determining the order of the autocorrelation present in the innovations. The proposed MPC fault discrimination method is demonstrated on a SISO process and a MIMO process.     

New statistical methods for investigating submarine pockmarks

We investigate the applicability of some novel spatial analysis techniques, developed for studies of astrophysical datasets, to the analysis of spatial point data in sedimentary basins. The techniques are evaluated and compared with standard methods using two test areas that contain large numbers of submarine pockmarks developed in distributed arrays. The familiar Ripley K and Voronoi tesselation techniques are used, and the results are then compared with those obtained using more novel techniques, the correlation length and minimal spanning tree. The correlation length technique is found to identify the precise distances at which clustering occurs more accurately, making a physical interpretation more clear than is possible using the Ripley K. The minimal spanning tree is found to be powerful at identifying the space-filling nature of the pockmark distribution, and has the advantage of being immune to edge effects. The use of these two novel techniques permits more information to be extracted from the datasets, and demonstrates clear statistically significant differences between them, which are not detectable using standard techniques.     

Real time video frames allocation in mobile networks using cooperative pre-fetching

In this paper, we study the bandwidth allocation problem for serving video requests in a mobile real-time video player system. One of the main issues to maintain the quality of services (QoS) in mobile video playback is to ensure sufficient number of video frames available at the client side while a video is being played. However, due to the limited bandwidth of a mobile network and variable workload streaming video, this is not easy to achieve in practice. In addition, the communication link between mobile clients and a video server is subject to frequent errors and temporary disconnection. In this paper, we propose to use the notion of buffered bandwidth in addition to the network bandwidth to support real-time playback of videos at mobile clients. Based on this, we designed a bandwidth allocation scheme called Cooperative Pre-Fetching (CP) in which the amount of bandwidth to be allocated to serve a video request depends on the current buffer level of the video at the client relative to the target buffer level of the client. In determining the target buffer level, we consider the errors in communication to the client as well as the other clients who are concurrently served by the system. The buffered video frames at the clients are then used to minimize the impact of error in communications on the overall QoS of video playbacks in the whole system.

An advanced evenly-spaced streamline placement algorithm

This paper presents an advanced evenly-spaced streamline placement algorithm for fast, high-quality, and robust layout of flow lines. A fourth-order Runge-Kutta integrator with adaptive step size and error control is employed for rapid accurate streamline advection. Cubic Hermite polynomial interpolation with large sample-spacing is adopted to create fewer evenly-spaced samples along each streamline to reduce the amount of distance checking. We propose two methods to enhance placement quality. Double queues are used to prioritize topological seeding and to favor long streamlines to minimize discontinuities. Adaptive distance control based on the local flow variance is explored to reduce cavities. Furthermore, we propose a universal, effective, fast, and robust loop detection strategy to address closed and spiraling streamlines. Our algorithm is an order-of-magnitude faster than Jobard and Lefer's algorithm with better placement quality and over 5 times faster than Mebarki et al.'s algorithm with comparable placement quality, but with a more robust solution to loop detection.