Sustainable end-of-life vehicle recycling: R&;D collaboration between industry and the U.S. DOE

Approximately 15 million cars and trucks reach the end of their useful life in the United States each year. More than 75% of the materials from end-of-life vehicles are profitably recovered and recycled by the private sector; automotive materials recycling is a success story. To achieve greater fuel efficiency and safety, today’s cars incorporate an increasing share of innovative light-weight materials. While these materials greatly enhance efficiency during vehicle use, they can present special challenges for recycling. These challenges will persist as automotive designs and the mix of materials used in vehicles continue evolving to further improve safety and performance. To meet the challenges of automotive materials recycling, the U.S. Department of Energy has recently expanded its collaborative research with industry in this area. This article discusses this collaborative government/industry approach to sustainable end-of-life vehicle recycling. For more information, contact Edward J. Daniels, Argonne National Laboratory, 9700 S. Cass Avenue, Building 362, Room C393, Argonne, IL 60439-4815; (630) 252-5279; fax (630) 252-1342; e-mail edaniels@anl.gov.     

Hydrogen redistribution in the solid solutions ZrV2Dx, 2.2≤x≤2.7.: II. Structure of the intermediate phase: ‘Lattice liquid crystal’. A neutron-diffraction study

We have studied the crystal structure of the uncommon phase with k=0 in ZrV₂D_x, 2.2<x<2.5, which is an intermediate between the hydrogen-disordered phase and two hydrogen superstructures, ZrV₂D_<2 with k=(1/2 1/2 1/2) and ZrV₂D_>2.7 with k=(001). This phase is a primary superstructure combining the features of the disordered phase and, depending on the hydrogen concentration, one or another superstructure with k≠0. Its lattice (translational symmetry) is the same as in the disordered phase, which is k=0. Simultaneously, the lattice sites (the hydrogen arrangement in them) are prototypes of the sites of the subsequent superstructure with k≠0. Specifically, each site of the primary superstructure with k=0 is a mix of the sites with different spatial orientation of the superstructure with k≠0. In this sense the primary superstructure can be considered as a ‘lattice liquid crystal’ whereas usual superstructure with k≠0 is a ‘lattice crystal’. In addition, we have determined the crystal structure of the ‘ordered’ phase with k=(001) in ZrV₂D_2.73. It is a transitional state between the primary superstructure and the regular superstructure with the same k.     

A Hybrid Color Quantization Algorithm Incorporating a Human Visual Perception Model

Color quantization is a common image processing technique where full color images are to be displayed using a limited palette of colors. The choice of a good palette is crucial as it directly determines the quality of the resulting image. Standard quantization approaches aim to minimize the mean squared error (MSE) between the original and the quantized image, which does not correspond well to how humans perceive the image differences. In this article, we introduce a color quantization algorithm that hybridizes an optimization scheme based with an image quality metric that mimics the human visual system. Rather than minimizing the MSE, its objective is to maximize the image fidelity as evaluated by S‐CIELAB, an image quality metric that has been shown to work well for various image processing tasks. In particular, we employ a variant of simulated annealing with the objective function describing the S‐CIELAB image quality of the quantized image compared with its original. Experimental results based on a set of standard images demonstrate the superiority of our approach in terms of achieved image quality.     

Evaluation of Sensors and Mapping Approaches for Disasters in Tunnels

Ground or aerial robots equipped with advanced sensing technologies, such as three‐dimensional laser scanners and advanced mapping algorithms, are deemed useful as a supporting technology for first responders. A great deal of excellent research in the field exists, but practical applications at real disaster sites are scarce. Many projects concentrate on equipping robots with advanced capabilities, such as autonomous exploration or object manipulation. In spite of this, realistic application areas for such robots are limited to teleoperated reconnaissance or search. In this paper, we investigate how well state‐of‐the‐art and off‐the‐shelf components and algorithms are suited for reconnaissance in current disaster‐relief scenarios. The basic idea is to make use of some of the most common sensors and deploy some widely used algorithms in a disaster situation, and to evaluate how well the components work for these scenarios. We acquired the sensor data from two field experiments, one from a disaster‐relief operation in a motorway tunnel, and one from a mapping experiment in a partly closed down motorway tunnel. Based on these data, which we make publicly available, we evaluate state‐of‐the‐art and off‐the‐shelf mapping approaches. In our analysis, we integrate opinions and replies from first responders as well as from some algorithm developers on the usefulness of the data and the limitations of the deployed approaches, respectively. We discuss the lessons we learned during the two missions. These lessons are interesting for the community working in similar areas of urban search and rescue, particularly reconnaissance and search.     

Scalable digital hardware for a trapped ion quantum computer

Quantum Information Processing - Many of the challenges of scaling quantum computer hardware lie at the interface between the qubits and the classical control signals used to manipulate them....     

Towards a smooth design process for static communicative node‐link diagrams

Node‐link infographics are visually very rich and can communicate messages effectively, but can be very difficult to create, often involving a painstaking and artisanal process. In this paper we present an investigation of node‐link visualizations for communication and how to better support their creation. We begin by breaking down these images into their basic elements and analyzing how they are created. We then present a set of techniques aimed at improving the creation workflow by bringing more flexibility and power to users, letting them manipulate all aspects of a node‐link diagram (layout, visual attributes, etc.) while taking into account the context in which it will appear. These techniques were implemented in a proof‐of‐concept prototype called GraphCoiffure, which was designed as an intermediary step between graph drawing/editing software and image authoring applications. We describe how GraphCoiffure improves the workflow and illustrate its benefits through practical examples.     

An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications

Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application tasks with dependences. These applications exhibit both task and data parallelism, and combining these two (also called mixed parallelism) has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task and data parallelism required to minimize the parallel completion time (makespan) of these applications. In other words, our algorithm determines the set of tasks that should be run concurrently and the number of processors to be allocated to each task. The processor allocation and scheduling decisions are made in an integrated manner and are based on several factors such as the structure of the task graph, the runtime estimates and scalability characteristics of the tasks, and the intertask data communication volumes. A locality-conscious scheduling strategy is used to improve intertask data reuse. Evaluation through simulations and actual executions of task graphs derived from real applications and synthetic graphs shows that our algorithm consistently generates schedules with a lower makespan as compared to Critical Path Reduction (CPR) and Critical Path and Allocation (CPA), two previously proposed scheduling algorithms. Our algorithm also produces schedules that have a lower makespan than pure task- and data-parallel schedules. For task graphs with known optimal schedules or lower bounds on the makespan, our algorithm generates schedules that are closer to the optima than other scheduling approaches.     

Face Editing Using Part-Based Optimization of the Latent Space

We propose an approach for interactive 3D face editing based on deep generative models. Most of the current face modeling methods rely on linear methods and cannot express complex and non-linear deformations. In contrast to 3D morphable face models based on Principal Component Analysis (PCA), we introduce a novel architecture based on variational autoencoders. Our architecture has multiple encoders (one for each part of the face, such as the nose and mouth) which feed a single decoder. As a result, each sub-vector of the latent vector represents one part. We train our model with a novel loss function that further disentangles the space based on different parts of the face. The output of the network is a whole 3D face. Hence, unlike part-based PCA methods, our model learns to merge the parts intrinsically and does not require an additional merging process. To achieve interactive face modeling, we optimize for the latent variables given vertex positional constraints provided by a user. To avoid unwanted global changes elsewhere on the face, we only optimize the subset of the latent vector that corresponds to the part of the face being modified. Our editing optimization converges in less than a second. Our results show that the proposed approach supports a broader range of editing constraints and generates more realistic 3D faces.     

Hyperprolactinemia in end‐stage renal disease and effects of frequent hemodialysis

Introduction: End‐stage renal disease is associated with elevations in circulating prolactin concentrations, but the association of prolactin concentrations with intermediate health outcomes and the effects of hemodialysis frequency on changes in serum prolactin have not been examined. Methods: The FHN Daily and Nocturnal Dialysis Trials compared the effects of conventional thrice weekly hemodialysis with in‐center daily hemodialysis (6 days/week) and nocturnal home hemodialysis (6 nights/week) over 12 months and obtained measures of health‐related quality of life, self‐reported physical function, mental health and cognition. Serum prolactin concentrations were measured at baseline and 12‐month follow‐up in 70% of the FHN Trial cohort to examine the associations among serum prolactin concentrations and physical, mental and cognitive function and the effects of hemodialysis frequency on serum prolactin. Findings: Among 177 Daily Trial and 60 Nocturnal Trial participants with baseline serum prolactin measurements, the median serum prolactin concentration was 65 ng/mL (25th–75th percentile 48–195 ng/mL) and 81% had serum prolactin concentrations >30 ng/mL. While serum prolactin was associated with sex (higher in women), we observed no association between baseline serum prolactin and age, dialysis vintage, and baseline measures of physical, mental and cognitive function. Furthermore, there was no significant effect of hemodialysis frequency on serum prolactin in either of the two trials. Discussion: Serum prolactin concentrations were elevated in the large majority of patients with ESRD, but were not associated with several measures of health status. Circulating prolactin levels also do not appear to decrease in response to more frequent hemodialysis over a one‐year period.