The dielectric response of doped semiconducting glasses

Measurements are reported of the dielectric properties of two semiconducting glasses of composition SiO₂ · Na₂O with admixtures of Sb_{2O 5} and SnO₂, covering a wide range of temperatures and a range of six decades of frequency 10^–2 to 10⁴ Hz. Both glasses show a gradual evolution of growing low frequency dispersion (LFD) with increasing temperature, with both the real and imaginary components of the complex susceptibility following a power law of the type ^n–1, with n 1 at the lowest frequencies. There are also clear indications of reversible phase transitions taking place which manifest themselves by changes in the spectral shape of the dielectric response.     

Discrete logarithms inGF(p)

Several related algorithms are presented for computing logarithms in fieldsGF(p),p a prime. Heuristic arguments predict a running time of exp((1+o(1)) ) for the initial precomputation phase that is needed for eachp, and much shorter running times for computing individual logarithms once the precomputation is done. The running time of the precomputation is roughly the same as that of the fastest known algorithms for factoring integers of size aboutp. The algorithms use the well known basic scheme of obtaining linear equations for logarithms of small primes and then solving them to obtain a database to be used for the computation of individual logarithms. The novel ingredients are new ways of obtaining linear equations and new methods of solving these linear equations by adaptations of sparse matrix methods from numerical analysis to the case of finite rings. While some of the new logarithm algorithms are adaptations of known integer factorization algorithms, others are new and can be adapted to yield integer factorization algorithms.     

Analysis and tuning of adaptive generalized predictive control

The adaptive Generalized Predictive Controller (Clarke et al., 1987a, b) is capable of controlling plants with variable dead-time, unknown model orders and unstable poles and zeros. This paper shows how the GPC control law can be written in an equivalent general linear transfer function form which simplifies closed-loop (eg. root locus) analysis. Three recommended strategies for selecting the design parameters during the commissioning stage allow the user to adjust the closed-loop speed of response on-line using only a single active tuning parameter. Experimental runs confirm the ability of adaptive GPC to provide a consistent closed-loop response in spite of large process changes.     

Characterization of Ceramics by X-Ray and Neutron Small-Angle Scattering

This paper reviews some recent advances in small-angle X-ray and neutron scattering methods and their application to address complex issues in ceramic systems of technological importance. It is shown how small-angle scattering (SAS) can be applied to ceramic systems in order to extract statistically representative microstructure information (e.g., void volume fraction size distributions, internal surface areas, pore morphologies) that complements the information obtained from diffraction methods, X-ray microtomography, or electron microscopy. It is demonstrated how SAS studies provide insights, not obtainable by other means, on the processing–microstructure–property relationships that frequently govern technological performance.     

Automatic and Efficient Human Pose Estimation for Sign Language Videos

We present a fully automatic arm and hand tracker that detects joint positions over continuous sign language video sequences of more than an hour in length. To achieve this, we make contributions in four areas: (i) we show that the overlaid signer can be separated from the background TV broadcast using co-segmentation over all frames with a layered model; (ii) we show that joint positions (shoulders, elbows, wrists) can be predicted per-frame using a random forest regressor given only this segmentation and a colour model; (iii) we show that the random forest can be trained from an existing semi-automatic, but computationally expensive, tracker; and, (iv) introduce an evaluator to assess whether the predicted joint positions are correct for each frame. The method is applied to 20 signing footage videos with changing background, challenging imaging conditions, and for different signers. Our framework outperforms the state-of-the-art long term tracker by Buehler et al. (International Journal of Computer Vision 95:180–197, 2011), does not require the manual annotation of that work, and, after automatic initialisation, performs tracking in real-time. We also achieve superior joint localisation results to those obtained using the pose estimation method of Yang and Ramanan  (Proceedings of the IEEE conference on computer vision and pattern recognition, 2011).     

Deblurring Shaken and Partially Saturated Images

We address the problem of deblurring images degraded by camera shake blur and saturated (over-exposed) pixels. Saturated pixels violate the common assumption that the image-formation process is linear, and often cause ringing in deblurred outputs. We provide an analysis of ringing in general, and show that in order to prevent ringing, it is insufficient to simply discard saturated pixels. We show that even when saturated pixels are removed, ringing is caused by attempting to estimate the values of latent pixels that are brighter than the sensor’s maximum output. Estimating these latent pixels is likely to cause large errors, and these errors propagate across the rest of the image in the form of ringing. We propose a new deblurring algorithm that locates these error-prone bright pixels in the latent sharp image, and by decoupling them from the remainder of the latent image, greatly reduces ringing. In addition, we propose an approximate forward model for saturated images, which allows us to estimate these error-prone pixels separately without causing artefacts. Results are shown for non-blind deblurring of real photographs containing saturated regions, demonstrating improved deblurred image quality compared to previous work.     

Increased α-linolenic acid intake increases tissue α-linolenic acid content and apparent oxidation with little effect on tissue docosahexaenoic acid in the guinea pig

The essential fatty acids do not have identical roles in nutrition. Linoleic acid (LA) accumulates throughout the body of most mammals, whereas α-linolenic acid (ALA) is rarely found in tissue lipids to the same extent as LA. It has been argued that this is the result of metabolism of ALA to docosahexaenoic acid (DHA) or that ALA is rapidly β-oxidized to acetyl CoA and CO₂. In this study, we consider the effect of high and low ALA levels on the tissue distribution of ALA and other n-3 polyunsaturated fatty acids (PUFA) in all tissues. Guinea pigs were fed one of two defined diets for 3 wk from wearning with both diets containing 1.8% (by weight) of LA and either 1.7% ALA or 0.03% ALA. The high ALA diet was associated with significantly increased ALA levels in all tissues except the brain and significantly increased levels of long-chain n-3 PUFA in all tissues except intestines, brain, carcass, and skin. The long-chain n-3 PUFA content of the whole body was less than 5% of that of the ALA content in both diet groups, and the major long-chain n-3 PUFA (>66% of total) in the body was 22∶5n−3. The brain was the only tissue where the DHA content exceeded that of 22∶5n−3. On the low ALA diet, there appeared to be conservation of ALA based on a comparison of the ratio of LA to ALA in the tissues compared with that in the diet. On the high ALA diet there was a loss of ALA relative to LA in the tissues compared with the diet. These studies suggest that the low levels of tissue ALA in the guinea pig are likely the result of β-oxidation or excretion via the skin and fur rather than metabolism to DHA.     

Perceiving,learning, and exploiting object affordances for autonomous pile manipulation

Autonomous manipulation in unstructured environments will enable a large variety of exciting and important applications. Despite its promise, autonomous manipulation remains largely unsolved. Even the most rudimentary manipulation task—such as removing objects from a pile—remains challenging for robots. We identify three major challenges that must be addressed to enable autonomous manipulation: object segmentation, action selection, and motion generation. These challenges become more pronounced when unknown man-made or natural objects are cluttered together in a pile. We present a system capable of manipulating unknown objects in such an environment. Our robot is tasked with clearing a table by removing objects from a pile and placing them into a bin. To that end, we address the three aforementioned challenges. Our robot perceives the environment with an RGB-D sensor, segmenting the pile into object hypotheses using non-parametric surface models. Our system then computes the affordances of each object, and selects the best affordance and its associated action to execute. Finally, our robot instantiates the proper compliant motion primitive to safely execute the desired action. For efficient and reliable action selection, we developed a framework for supervised learning of manipulation expertise. To verify the performance of our system, we conducted dozens of trials and report on several hours of experiments involving more than 1,500 interactions. The results show that our learning-based approach for pile manipulation outperforms a common sense heuristic as well as a random strategy, and is on par with human action selection.     

A memetic algorithm for the capacitated m-ring-star problem

The Capacitated m-Ring-Star Problem (CmRSP) models a network topology design problem in the telecommunications industry. In this paper, we propose to solve this problem using a memetic algorithm that includes a crossover operation, a mutation operation, a local search involving three neighborhood operators, and a population selection strategy that maintains population diversity. Our approach generates the best known solutions for 131 out of 138 benchmark instances, improving on the previous best solutions for 24 of them, and exhibits more advantages on large benchmark instances when compared with the best existing approach. Additionally, all existing algorithms for this problem in literature assume that the underlying graph of the problem instance satisfies the triangle inequality rule; our approach does not require this assumption. We also generated a new set of 36 larger test instances based on a digital data service network price structure to serve as a new benchmark data set for future researchers.