Interfacial activity and rate of palladium(II) extraction with decyl pyridine monocarboxylates

Decyl isonicotiniate and decyl nicotiniate permit a rapid extraction of palladium(II) from its hydrochloride solutions. Decyl picoliniate is not a suitable extractant. 4-Octylphenylamine can act as a phase transfer catalyst when its concentration in the organic phase is at least 2·5 × 10^?4 M . It seems that the interfacial adsorption of pyridine carboxylates and of 4-octylphenylamine is not the decisive phenomenon in palladium(II) extraction. The negligible protonation of the pyridine-type extractants and the phase transfer catalysis explains well the quick extraction of palladium(II) with the commercial and highly hydrophobic extractant ACORGA CLX-50.     

Applying “Design Thinking” in the context of media management education

“Design Thinking” – a cross-disciplinary and user centered method – is an approach towards the discovery of solutions and sparks innovative thinking in many ways. It also can be argued, that designers put themselves in the place of the user rather than co-creating with the consumer. Innovation is one of the current keywords across many industries, and many attempt to find new solutions to daily problems. Design Thinking as method allows to understand user needs and understand their principle problems in daily life. The design process uses intensive collaboration in cross-disciplinary settings and is divided into the exploration of the problem space and the solution space to achieve new ways of solving existing problems. Design Thinking has to integrate into the innovation process and into organizational structures right from the beginning. It constitutes a complement to classical analytical processes for problems that require lateral, not linear thinking. This article reviews the practical application of this energetic methodology in the academic context and presents some hands-on examples. The course series has been established by the Entertainment and Media Management Lab. (EMMi Lab.) at the Tampere University of Technology (TUT) and was held in cooperation with students from the University of Tampere (UTA), and the Tampere University of Applied Sciences (TAMK). One course has been held in cooperation with the University of Applied Sciences Magdeburg-Stendal, Germany. This article describes how to train students especially with strong technical background and analytical mind-sets in the development of innovations in the field of media, foster creative thinking, and achieve problem solutions beyond the current state of the art. We present the basic curriculum, course structure, goals & objectives, applied methods, settings, and theoretical aspects of Design Thinking. Our experience and reflections on conducting the courses concludes this article. The article shall be an introductory guide for anyone who intends to organize a similar course in the university context.     

The Complexity of Compressed Membership Problems for Finite Automata

In this paper, a compressed membership problem for finite automata, both deterministic (DFAs) and non-deterministic (NFAs), with compressed transition labels is studied. The compression is represented by straight-line programs (SLPs), i.e. context-free grammars generating exactly one string. A novel technique of dealing with SLPs is employed: the SLPs are recompressed, so that substrings of the input word are encoded in SLPs labelling the transitions of the NFA (DFA) in the same way, as in the SLP representing the input text. To this end, the SLPs are locally decompressed and then recompressed in a uniform way. Furthermore, in order to reflect the recompression in the NFA, we need to modify it only a little, in particular its size stays polynomial in the input size. Using this technique it is shown that the compressed membership for NFA with compressed labels is in NP, thus confirming the conjecture of Plandowski and Rytter (Jewels Are Forever, pp. 262–272, Springer, Berlin, 1999) and extending the partial result of Lohrey and Mathissen (in CSR, LNCS, vol. 6651, pp. 275–288, Springer, Berlin, 2011); as this problem is known to be NP-hard (in Plandowski and Rytter, Jewels Are Forever, pp. 262–272, Springer, Berlin, 1999), we settle its exact computational complexity. Moreover, the same technique applied to the compressed membership for DFA with compressed labels yields that this problem is in P, and this problem is known to be P-hard (in Markey and Schnoebelen, Inf. Process. Lett. 90(1):3–6, 2004; Beaudry et al., SIAM J. Comput. 26(1):138–152, 1997).     

Domain-specific discrete event modelling and simulation using graph transformation

Graph transformation is being increasingly used to express the semantics of domain-specific visual languages since its graphical nature makes rules intuitive. However, many application domains require an explicit handling of time to accurately represent the behaviour of a real system and to obtain useful simulation metrics to measure throughputs, utilization times and average delays. Inspired by the vast knowledge and experience accumulated by the discrete event simulation community, we propose a novel way of adding explicit time to graph transformation rules. In particular, we take the event scheduling discrete simulation world view and provide rules with the ability to schedule the occurrence of other rules in the future. Hence, our work combines standard, efficient techniques for discrete event simulation (based on the handling of a future event set) and the intuitive, visual nature of graph transformation. Moreover, we show how our formalism can be used to give semantics to other timed approaches and provide an implementation on top of the rewriting logic system Maude.     

Improved likelihood inference in Birnbaum-Saunders regressions

The Birnbaum-Saunders regression model is commonly used in reliability studies. We address the issue of performing inference in this class of models when the number of observations is small. Our simulation results suggest that the likelihood ratio test tends to be liberal when the sample size is small. We obtain a correction factor which reduces the size distortion of the test. Also, we consider a parametric bootstrap scheme to obtain improved critical values and improved p-values for the likelihood ratio test. The numerical results show that the modified tests are more reliable in finite samples than the usual likelihood ratio test. We also present an empirical application.