Kidney injury and cell therapy: Preclinical study

The aim of this study is to show histological and immunofluorescence analysis of renal parenchyma of agoutis affected by gentamicin‐induced renal disease after the infusion of bone marrow mononuclear cells (BMMC) stained with Hoechst®. Nine agouti's males were divided into three groups: Test group (TG): renal disease by gentamicin induced (n = 3), cell therapy group (CTG): renal disease by gentamicin induced and BMMC infusion (n = 3), and control group (CG): nonrenal disease and BMMC infusion (n = 3). TG and CTG were submitted to the protocol of renal disease induction using weekly application of gentamicin sulfate for 4 months. CG and CTG received a 1 × 108 BMMC stained with Hoechst and were euthanized for kidney examination 21 days after BMMC injection and samples were collected for histology and immunofluorescence analysis. Histological analysis demonstrated typical interstitial lesions in kidney similarly to human disease, as tubular necrosis, glomerular destruction, atrophy tubular, fibrotic areas, and collagen deposition. We conclude that histological analysis suggest a positive application of agouti's as a model for a gentamicin inducing of kidney disease, beyond the immunofluorescence analysis suggest a significant migration of BMMC to sites of renal injury in CTG. Microsc. Res. Tech., 2012. © 2011 Wiley Periodicals, Inc.     

High‐quality pagination for publishing

The problem of line breaking consists of finding the best way to split paragraphs into lines. It has been cleverly addressed by the total‐fit algorithm exposed by Knuth and Plass in a well‐known paper. Similarly, page‐breaking algorithms break the content flow of a document into page units. Formatting languages—such as the World Wide Web Consortium standard Extensible Stylesheet Language Formatting Objects (XSL‐FO)—allow users to set which content should be kept in the same page and how many isolated lines are acceptable at the beginning/end of each page. The strategies most formatters adopt to meet these requirements, however, are not satisfactory for many publishing contexts as they very often generate unpleasant empty areas. In that case, typographers are required to manually craft the results in order to completely fill pages. This paper presents a page‐breaking algorithm that extends the original Knuth and Plass line‐breaking approach and produces high‐quality documents without unwanted empty areas. The basic idea consists of delaying the definitive choice of breaks in the line‐breaking process in order to provide a larger set of alternatives to the actual pagination step. The algorithm also allows users to decide the set of properties to be adjusted for pagination and their variation ranges. An application of the algorithm to XSL‐FO is also presented, with an extension of the language that allows users to drive the pagination process. The tool, named FOP+, is a customized version of the open‐source Apache Formatting Objects Processor formatter. Copyright © 2011 John Wiley & Sons, Ltd.     

ISHair: Importance Sampling for Hair Scattering

We present an importance sampling method for the bidirectional scattering distribution function (bsdf) of hair. Our method is based on the multi‐lobe hair scattering model presented by Sadeghi et al. [ [SPJT10] ]. We reduce noise by drawing samples from a distribution that approximates the bsdf well. Our algorithm is efficient and easy to implement, since the sampling process requires only the evaluation of a few analytic functions, with no significant memory overhead or need for precomputation. We tested our method in a research raytracer and a production renderer based on micropolygon rasterization. We show significant improvements for rendering direct illumination using multiple importance sampling and for rendering indirect illumination using path tracing.     

Distributed estimation via iterative projections with application to power network monitoring

This work presents a distributed method for control centers to monitor the operating condition of a power network, i.e., to estimate the network state, and to ultimately determine the occurrence of threatening situations. State estimation has been recognized to be a fundamental task for network control centers to operate safely and reliably a power grid. We consider (static) state estimation problems, in which the state vector consists of the voltage magnitude and angle at all network buses. We consider the state to be linearly related to network measurements, which include power flows, current injections, and voltage phasors at some buses. We admit the presence of several cooperating control centers, and we design two distributed methods for them to compute the minimum variance estimate of the state, given the network measurements. The two distributed methods rely on different modes of cooperation among control centers: in the first method an incremental mode of cooperation is used, whereas, in the second method, a diffusive interaction is implemented. Our procedures, which require each control center to know only the measurements and the structure of a subpart of the whole network, are computationally efficient and scalable with respect to the network dimension, provided that the number of control centers also increases with the network cardinality. Additionally, a finite-memory approximation of our diffusive algorithm is proposed, and its accuracy is characterized. Finally, our estimation methods are exploited to develop a distributed algorithm to detect corrupted network measurements.     

A covert attention P300-based brain-computer interface: Geospell

The Farwell and Donchin P300 speller interface is one of the most widely used brain-computer interface (BCI) paradigms for writing text. Recent studies have shown that the recognition accuracy of the P300 speller decreases significantly when eye movement is impaired. This report introduces the GeoSpell interface (Geometric Speller), which implements a stimulation framework for a P300-based BCI that has been optimised for operation in covert visual attention. We compared the Geospell with the P300 speller interface under overt attention conditions with regard to effectiveness, efficiency and user satisfaction. Ten healthy subjects participated in the study. The performance of the GeoSpell interface in covert attention was comparable with that of the P300 speller in overt attention. As expected, the effectiveness of the spelling decreased with the new interface in covert attention. The NASA task load index (TLX) for workload assessment did not differ significantly between the two modalities. PRACTITIONER SUMMARY: This study introduces and evaluates a gaze-independent, P300-based brain-computer interface, the efficacy and user satisfaction of which were comparable with those off the classical P300 speller. Despite a decrease in effectiveness due to the use of covert attention, the performance of the GeoSpell far exceeded the threshold of accuracy with regard to effective spelling.     

Load forecasting framework of electricity consumptions for an Intelligent Energy Management System in the user-side

This work presents an electricity consumption-forecasting framework configured automatically and based on an Adaptative Neural Network Inference System (ANFIS). This framework is aimed to be implemented in industrial plants, such as automotive factories, with the objective of giving support to an Intelligent Energy Management System (IEMS). The forecasting purpose is to support the decision-making (i.e. scheduling workdays, on-off production lines, shift power loads to avoid load peaks, etc.) to optimize and improve economical, environmental and electrical key performance indicators. The base structure algorithm, the ANFIS algorithm, was configured by means of a Multi Objective Genetic Algorithm (MOGA), with the aim of getting an automatic-configuration system modelling. This system was implemented in an independent section of an automotive factory, which was selected for the high randomness of its main loads. The time resolution for forecasting was the quarter hour. Under these challenging conditions, the autonomous configuration, system learning and prognosis were tested with success.     

An efficient technique for implementing an image-compression neural algorithm on concurrent multiprocessor architectures

The paper describes a parallel implementation of a neural algorithm performing vector quantization for very low bit-rate video compression on toroidal-mesh multiprocessor systems. The neural model considered is a plastic version of the Neural Gas algorithm, whose features are suitable for implementations on toroidal mesh topologies. The architecture adopted, and the data-allocation strategy, enhance the method's scaling properties and remarkable efficiency. The parallel approach is supported by a theoretical analysis of the efficiency of the overall structure. Experimental results on a significant testbed and the fit between predicted and measured values confirm the validity of the parallel approach.     

Diagnosing attention disorders in a virtual classroom

The virtual classroom provides an efficient and scalable tool for conducting attention testing. The University of Southern California integrated media systems center and digital media works have partnered to develop virtual reality technology applications for the study, assessment, and rehabilitation of cognitive and functional processes. This work primarily focuses on the development of systems that address the special needs of clinical populations with central nervous system dysfunctions such as brain injury, learning disabilities, or neurological disorders.     

Order picking system design: the storage assignment and travel distance estimation (SA&TDE) joint method

Of all the warehouse activities, order picking is one of the most time-consuming and expensive. In order to improve the task, several researches have pointed out the need to consider jointly the layout of the warehouse, the storage assignment strategy and the routing policy to reduce travelled distances and picking time. This paper presents the storage assignment and travel distance estimation (SA&TDE) joint method, a new approach useful to design and evaluate a manual picker-to-parts picking system, focusing on goods allocation and distances estimation. Starting from a set of picking orders received in a certain time range, this approach allows to evaluate the combinations of product codes assigned to storage locations, aisles, sections or warehouse areas and to assess the most relevant ones, for the best location and warehouse layout, with the aim of ensuring optimal picking routes, through the application of the multinomial probability distribution. A case study is developed as well, in order to clarify the concept that underlies the SA&TDE joint method, and to show the validity and the flexibility of the approach, through the calculation of the saving at different levels of detail.     

The Marching Intersections algorithm for merging range images

A new algorithm for the integration of partially overlapping range images into a triangular mesh is presented. The algorithm consists of three main steps: it locates the intersections between the range surfaces and a reference grid chosen by the user, then merges all nearly coincident and redundant intersections according to a proximity criterion, and, finally, reconstructs the merged surface(s) from the filtered intersection set. Compared with previous methods, which adopt a volumetric approach, our algorithm shows lower computational costs and improves the accuracy of the surfaces produced. It takes into account the quality of the input measurements and is able to patch small holes corresponding to the parts of the 3D scanned object that were not observed by the acquisition device. The algorithm has been tested on several datasets of range maps; graphical and numeric results are reported.