Synthesis of poly(lactic acid) by heterogeneous acid catalysis from <Emphasis Type="SmallCaps">d</Emphasis>,<Emphasis Type="SmallCaps">l</Emphasis>-lactic acid

Poly(lactic acid) (PLA) is an important polymer because of its significant biocompatibility and biodegradability. Supported H₃PW₁₂O₄₀ (H₃PW) on activated carbon was utilized for the catalytic polymerization of D,L-lactic acid, resulting in blends of PLA. The stability of the polymer was monitored by thermogravimetry (TGA), and the decomposition temperature (T_d) was used to determine the optimal production conditions (i.e., temperature of 180 °C for 15 h; 0.1 wt. % catalyst; 20 wt. % H₃PW/carbon calcined at 400 °C). The best catalyst was reused three times with good activity and recovery (95 %) and was analyzed to confirm the consistency of its Keggin structure, dispersion, and acidity, which are important parameters that affect the catalyst’s activity. The obtained polymer was characterized by gel permeation chromatography (GPC), Fourier-transform infrared spectroscopy (FT-IR), ¹H/¹³C nuclear magnetic resonance (NMR) spectroscopy, specific optical rotation ([α]_D ²⁵), powder X-ray diffraction (XRD), and differential scanning calorimetry (DSC). The average molar mass of the polymer was 17,400 g mol^?1. Blends of poly(lactic acid) with 85 % poly(L-lactic acid) stereospecific isomer were obtained.

Open image in new window

Graphical Abstract Stereoselective synthesis of 85 % PLLA from polymerization of d,l-lactic acid using 12-tungstophosphoric acid supported on carbon as a catalyst

     

Very High Cycle Fatigue of Two Ductile Iron Grades

Two ductile iron grades, EN‐GJS‐600‐3 a ferritic–pearlitic grade, and EN‐GJS‐600‐10 a silicon strengthened ferritic nodular iron grade, are studied in the very high cycle fatigue range using a 20 kHz ultrasonic test equipment. Fatigue strengths and SN‐curves are achieved, and fracture surfaces and microstructures are investigated. The ferritic grade with higher ductility displays a lower fatigue strength at 10⁸ load cycles than the ferritic–pearlitic grade, 142 and 167 MPa, respectively. Examination of fracture surfaces shows that fatigue failures are controlled by micropores in both of the ductile iron grades, while the graphite nodule distributions do not seem to influence the difference in fatigue strengths. Prediction of the fatigue strengths, using a model for ductile iron proposed by Endo and Yanase, indicates a large potential for improvement in particular for the ferritic grade.     

Spatially varying image based lighting using HDR-video

Illumination is one of the key components in the creation of realistic renderings of scenes containing virtual objects. In this paper, we present a set of novel algorithms and data structures for visualization, processing and rendering with real world lighting conditions captured using High Dynamic Range (HDR) video. The presented algorithms enable rapid construction of general and editable representations of the lighting environment, as well as extraction and fitting of sampled reflectance to parametric BRDF models. For efficient representation and rendering of the sampled lighting environment function, we consider an adaptive (2D/4D) data structure for storage of light field data on proxy geometry describing the scene. To demonstrate the usefulness of the algorithms, they are presented in the context of a fully integrated framework for spatially varying image based lighting. We show reconstructions of example scenes and resulting production quality renderings of virtual furniture with spatially varying real world illumination including occlusions.     

Designing a parallel cloud based comparative genomics workflow to improve phylogenetic analyses

Over the last years, comparative genomics analyses have become more compute-intensive due to the explosive number of available genome sequences. Comparative genomics analysis is an important a prioristep for experiments in various bioinformatics domains. This analysis can be used to enhance the performance and quality of experiments in areas such as evolution and phylogeny. A common phylogenetic analysis makes extensive use of Multiple Sequence Alignment (MSA) in the construction of phylogenetic trees, which are used to infer evolutionary relationships between homologous genes. Each phylogenetic analysis aims at exploring several different MSA methods to verify which execution produces trees with the best quality. This phylogenetic exploration may run during weeks, even when executed in High Performance Computing (HPC) environments. Although there are many approaches that model and parallelize phylogenetic analysis as scientific workflows, exploring all MSA methods becomes a complex and expensive task to be performed. If scientists determine a priorithe most adequate MSA method to use in the phylogenetic analysis, it would save time, and, in some cases, financial resources. Comparative genomics analyses play an important role in optimizing phylogenetic analysis workflows. In this paper, we extend the SciHmm scientific workflow, aimed at determining the most suitable MSA method, to use it in a phylogenetic analysis. SciHmm uses SciCumulus, a cloud workflow execution engine, for parallel execution. Experimental results show that using SciHmm considerably reduces the total execution time of the phylogenetic analysis (up to 80%). Experiments also show that trees built with the MSA program elected by using SciHmm presented more quality than the remaining, as expected. In addition, the parallel execution of SciHmm shows that this kind of bioinformatics workflow has an excellent cost/benefit when executed in cloud environments.     

From dynamic movement primitives to associative skill memories

In recent years, research on movement primitives has gained increasing popularity. The original goals of movement primitives are based on the desire to have a sufficiently rich and abstract representation for movement generation, which allows for efficient teaching, trial-and-error learning, and generalization of motor skills (Schaal 1999). Thus, motor skills in robots should be acquired in a natural dialog with humans, e.g., by imitation learning and shaping, while skill refinement and generalization should be accomplished autonomously by the robot. Such a scenario resembles the way we teach children and connects to the bigger question of how the human brain accomplishes skill learning. In this paper, we review how a particular computational approach to movement primitives, called dynamic movement primitives, can contribute to learning motor skills. We will address imitation learning, generalization, trial-and-error learning by reinforcement learning, movement recognition, and control based on movement primitives. But we also want to go beyond the standard goals of movement primitives. The stereotypical movement generation with movement primitives entails predicting of sensory events in the environment. Indeed, all the sensory events associated with a movement primitive form an associative skill memory that has the potential of forming a most powerful representation of a complete motor skill.     

Formal concept analysis in knowledge processing: A survey on applications

This is the second part of a large survey paper in which we analyze recent literature on Formal Concept Analysis (FCA) and some closely related disciplines using FCA. We collected 1072 papers published between 2003 and 2011 mentioning terms related to Formal Concept Analysis in the title, abstract and keywords. We developed a knowledge browsing environment to support our literature analysis process. We use the visualization capabilities of FCA to explore the literature, to discover and conceptually represent the main research topics in the FCA community. In this second part, we zoom in on and give an extensive overview of the papers published between 2003 and 2011 which applied FCA-based methods for knowledge discovery and ontology engineering in various application domains. These domains include software mining, web analytics, medicine, biology and chemistry data.     

Insight into cooperation processes for traffic scenarios: modelling with naturalistic decision making

With the introduction of automatic vehicle guidance (AV), mixed traffic scenarios between automatically and manually guided vehicles are to be expected, at least during a transitions phase. To ensure the safety of motor vehicle transportation, it will be essential to develop a cooperative relationship between human drivers and AV. Research in this area is currently being done to gain insight into the manner of human drivers’ decisions to transfer the same behaviours to automatic vehicle guidance. A lot of research is being done to prepare for the introduction of AV, but there is still a lack of information on how individual road users make decisions in cooperative decisions. Currently, there is no study that has tried to understand the decision-making process with the help of an online-survey. For that reason, a questionnaire study on cooperative traffic situations (N?=?281) was carried out, which was analysed with the Natural Decision Making approach. By means of the NDM approach and the use of the recognition module, links between planned action and the expected action between road users were identified. Furthermore, it was possible to categorize individual communication signals into offensive or defensive signals and thus make predictions about the intention of the driver. These findings can be used to derive design recommendations for automatic vehicle guidance in cooperative situations.     

Photorealistic rendering of mixed reality scenes

Photo‐realistic rendering of virtual objects into real scenes is one of the most important research problems in computer graphics. Methods for capture and rendering of mixed reality scenes are driven by a large number of applications, ranging from augmented reality to visual effects and product visualization. Recent developments in computer graphics, computer vision, and imaging technology have enabled a wide range of new mixed reality techniques including methods for advanced image based lighting, capturing spatially varying lighting conditions, and algorithms for seamlessly rendering virtual objects directly into photographs without explicit measurements of the scene lighting. This report gives an overview of the state‐of‐the‐art in this field, and presents a categorization and comparison of current methods. Our in‐depth survey provides a tool for understanding the advantages and disadvantages of each method, and gives an overview of which technique is best suited to a specific problem.     

Monte Carlo implementation of financial simulation on Cell/B.E. multi-core processor

The processor evolution has reached a critical moment in time where it will soon be impossible to increase the frequency much further. Processor designers such as Motorola, Intel and IBM have all realised that the only way to improve the FLOP/Watt ratio is to develop multi-core devices. One of the most current examples of multi-core processors is the new Sony/Toshiba/IBM Cell/B.E. multi-core processor. For the suitability to run in parallel, Monte Carlo methods are often considered embarrassingly parallel. This paper describes how a common Monte Carlo based financial simulation can be calculated in parallel using the Cell/B.E. multi-core processor. The measured performance with the achieved multi-core speed-up is also presented. With the recent availability of this increasingly available technology, financial simulations can now be performed in a fraction of the time it used to. This can also be achieved with a limited power and volume budget using commercially available technology. The main challenge with multi-core devices is clearly the programmability. The work presented here describes how this challenge could be dealt with.A basic MPI library has been developed to handle the partitioning and communication of data. The thread creation follows a POSIX thread creation model. MPI together with POSIX make the application portable in between various multi-processor systems and multi-core devices. The conclusions made indicate that a function offload MPI implementation on the Cell/B.E. multi-core processor can efficiently be used to speed-up the Monte Carlo solution of financial simulations. The conclusions made herein are also applicable to other situations where an algorithm can be easily parallelized.