Open Access

Development of colored surfaces by formation of nano-structured aggregates is a widely used strategy in nature to color lightweight structures (e.g. butterflies) without the use of dye pigments. The deposition of nanoscale particles mimics nature in it’s approach coloring surfaces. This work presents sol-gel modification of cellulose surfaces used to form a template for growth of Cu/Cu2O core-shell particles with defined size-distributions. Besides improving the adhesion of the deposited particulate material, the sol-gel matrix serves as a template for the control of particle sizes of the Cu/Cu2O structures, and as a consequence of particle size variation the surface color is tunable. As an example, red color was achieved with an average particle size of 35 nm, and shifts gradually to blue appearance when particles have grown to 80 nm on the sol-gel modified fabric. The copper concentration on representative fabrics is kept low to avoid modifying the textile characteristics and were all in the range of 150–170 mg per g of cellulose material. As a result of copper deposition on the surface of the material, the cellulose fabric also became electrically conductive. Remarkably, the electrical conductivity was found to be dependent on the average particle sizes of the deposits and thus related to the change in observed color. The generation of color by growth of nano-sized particles on sol-gel templates provides a highly promising approach to stain surfaces by physical effects without use of synthetic colorants, which opens a new strategy to improve environmental profile of coloration.

For robots acting in human-centered environments, the ability to improve based on experience is essential for reliable and adaptive operation; however, particularly in the context of robot failure analysis, experience-based improvement is only useful if robots are also able to reason about and explain the decisions they make during execution. In this paper, we describe and analyse a representation of execution-specific knowledge that combines (i) a relational model in the form of qualitative attributes that describe the conditions under which actions can be executed successfully and (ii) a continuous model in the form of a Gaussian process that can be used for generating parameters for action execution, but also for evaluating the expected execution success given a particular action parameterisation. The proposed representation is based on prior, modelled knowledge about actions and is combined with a learning process that is supervised by a teacher. We analyse the benefits of this representation in the context of two actions – grasping handles and pulling an object on a table – such that the experiments demonstrate that the joint relational-continuous model allows a robot to improve its execution based on experience, while reducing the severity of failures experienced during execution.

Solving differential-algebraic equations (DAEs) efficiently by means of appropriate numerical schemes for time-integration is an ongoing topic in applied mathematics. In this context, especially when considering large systems that occur with respect to many fields of practical application effective computation becomes relevant. In particular, corresponding examples are given when having to simulate network structures that consider transport of fluid and gas or electrical circuits. Due to the stiffness properties of DAEs, time-integration of such problems generally demands for implicit strategies. Among the schemes that prove to be an adequate choice are linearly implicit Rung-Kutta methods in the form of Rosenbrock-Wanner (ROW) schemes. Compared to fully implicit methods, they are easy to implement and avoid the solution of non-linear equations by including Jacobian information within their formulation. However, Jacobian calculations are a costly operation. Hence, necessity of having to compute the exact Jacobian with every successful time-step proves to be a considerable drawback. To overcome this drawback, a ROW-type method is introduced that allows for non-exact Jacobian entries when solving semi-explicit DAEs of index one. The resulting scheme thus enables to exploit several strategies for saving computational effort. Examples include using partial explicit integration of non-stiff components, utilizing more advantageous sparse Jacobian structures or making use of time-lagged Jacobian information. In fact, due to the property of allowing for non-exact Jacobian expressions, the given scheme can be interpreted as a generalized ROW-type method for DAEs. This is because it covers many different ROW-type schemes known from literature. To derive the order conditions of the ROW-type method introduced, a theory is developed that allows to identify occurring differentials and coefficients graphically by means of rooted trees. Rooted trees for describing numerical methods were originally introduced by J.C. Butcher. They significantly simplify the determination and definition of relevant characteristics because they allow for applying straightforward procedures. In fact, the theory presented combines strategies used to represent ROW-type methods with exact Jacobian for DAEs and ROW-type methods with non-exact Jacobian for ODEs. For this purpose, new types of vertices are considered in order to describe occurring non-exact elementary differentials completely. The resulting theory thus automatically comprises relevant approaches known from literature. As a consequence, it allows to recognize order conditions of familiar methods covered and to identify new conditions. With the theory developed, new sets of coefficients are derived that allow to realize the ROW-type method introduced up to orders two and three. Some of them are constructed based on methods known from literature that satisfy additional conditions for the purpose of avoiding effects of order reduction. It is shown that these methods can be improved by means of the new order conditions derived without having to increase the number of internal stages. Convergence of the resulting methods is analyzed with respect to several academic test problems. Results verify the theory determined and the order conditions found as only schemes satisfying the order conditions predicted preserve their order when using non-exact Jacobian expressions.

With increasing life expectancy, demands for dental tissue and whole-tooth regeneration are becoming more significant. Despite great progress in medicine, including regenerative therapies, the complex structure of dental tissues introduces several challenges to the field of regenerative dentistry. Interdisciplinary efforts from cellular biologists, material scientists, and clinical odontologists are being made to establish strategies and find the solutions for dental tissue regeneration and/or whole-tooth regeneration. In recent years, many significant discoveries were done regarding signaling pathways and factors shaping calcified tissue genesis, including those of tooth. Novel biocompatible scaffolds and polymer-based drug release systems are under development and may soon result in clinically applicable biomaterials with the potential to modulate signaling cascades involved in dental tissue genesis and regeneration. Approaches for whole-tooth regeneration utilizing adult stem cells, induced pluripotent stem cells, or tooth germ cells transplantation are emerging as promising alternatives to overcome existing in vitro tissue generation hurdles. In this interdisciplinary review, most recent advances in cellular signaling guiding dental tissue genesis, novel functionalized scaffolds and drug release material, various odontogenic cell sources, and methods for tooth regeneration are discussed thus providing a multi-faceted, up-to-date, and illustrative overview on the tooth regeneration matter, alongside hints for future directions in the challenging field of regenerative dentistry.

Despite the advances in research on usable secureemail, the majority of mail user agents found in practicestill violates best practices in UI design and uses ineffectiveand inhomogeneous design strategies to communicate andlet users control the security status of an email message.We propose a novel interaction and design concept thatwe refer to as persuasive message design. Our approachis derived from heuristics and a systematic meta-study ofexisting HCI literature on email management, usable secureemail and phishing research. Concluding on this body ofknowledge we propose the design of interfaces that sup-presses weak cues and instead manipulates the display ofemails according to their technical security level. Persuasivemessage design addresses several shortcomings of currentsecure email user interfaces and provides a consistent userexperience that can be deployed even by email providers.

Object detectors have improved considerably in the last years by using advanced Convolutional Neural Networks (CNNs) architectures. However, many detector hyper-parameters are not generally tuned, and they are used with values set by the detector authors. Blackbox optimization methods have gained more attention in recent years because of its ability to optimize the hyper-parameters of various machine learning algorithms and deep learning models. However, these methods are not explored in improving CNN-based object detector's hyper-parameters. In this research work, we propose the use of blackbox optimization methods such as Gaussian Process based Bayesian Optimization (BOGP), Sequential Model-based Algorithm Configuration (SMAC), and Covariance Matrix Adaptation Evolution Strategy (CMA-ES) to tune the hyper-parameters in Faster R-CNN and Single Shot MultiBox Detector (SSD). In Faster R-CNN, tuning the input image size, prior box anchor scales and ratios using BOGP, SMAC, and CMA-ES has increased the performance around 1.5% in terms of Mean Average Precision (mAP) on PASCAL VOC. Tuning the anchor scales of SSD has increased the mAP by 3% on PASCAL VOC and marine debris datasets. On the COCO dataset with SSD, mAP improvement is observed in the medium and large objects, but mAP decreases by 1% in small objects. The experimental results show that the blackbox optimization methods have proved to increase the mAP performance by optimizing the object detectors. Moreover, it has achieved better results than the hand-tuned configurations in most of the cases.