Entwicklung eines optisch zugänglichen Reaktors zur Thermographiemessung in einer Katalysatorschüttung

To measure the microkinetics in heterogeneously catalyzed strongly exothermic gas phase reaction heat and mass transfer limitations should be excluded. Also an unequal distribution of temperature in the catalyst fixed bed, like a hot spot, distorts the results of microkinetic investigations. A promising approach to measure the temperature contactless is thermography. For this work, an optically accessible reactor is developed to measure the temperature in a catalytically powder fixed bed. In the scope of this work, this technique is used to investigate the temperature development and distribution during the exothermal CO₂ methanation depending on the bed and gas dilution and the reactor performance.     

Artificial Maturation of the Highly Active Heterodimeric [FeFe] Hydrogenase from Desulfovibrio desulfuricans ATCC 7757

Hydrogenases catalyze the reduction of protons and oxidation of molecular hydrogen with high turnover frequencies and low overpotentials under ambient conditions. The heterodimeric [FeFe] hydrogenase from Desulfovibrio desulfuricans has an exceptionally high activity, and can be purified aerobically in an oxygen-stable inactive state. Recently, it was demonstrated that monomeric [FeFe] hydrogenases produced recombinantly in Escherichia coli can be artificially maturated by simply incubating the inactive “apo” enzymes with the synthetic [2Fe] cofactor mimic [Fe₂(adt)(CO)₄(CN)₂]²⁻. Here, we use the same technique to produce the heterodimeric “apo” hydrogenase from D. desulfuricans in E. coli with a high yield and purity, and maturate the “apo” enzyme with [Fe₂(adt)(CO)₄(CN)₂]²⁻ to generate fully active “holo” enzyme. Interestingly, the rate of the artificial maturation process with D. desulfuricans is significantly slower than that for all other hydrogenases tested so far. The artificially maturated enzyme is spectroscopically and electrochemically identical to the native enzyme and shows high rates of hydrogen production (3700 s⁻¹) and hydrogen oxidation (63,000 s⁻¹). We expect that our highly efficient production method will facilitate future studies of this enzyme and other related [FeFe] hydrogenases from Desulfovibrio species.     

Electromechanical Interactions in Multibody Systems Containing Electromechanical Drives

Electromechanical systems are characterized by interaction of electromagnetic fields with inertial bodies. Electromechanical interactions can be described by so-called constitutive equations.Constitutive equations describing the coupling of multibody dynamics with Kirchhoffs theory of electrical networks as a quasi stationaryapproximation of Maxwells theory define discrete electromechanicalsystems, i.e. systems with a finite degree of freedom.Then, based on the principle of virtual work, motion equations can be obtained as Lagranges equations in explicit form due to a unified approach. The motion equations can be generated automatically. Hence, all electromechanical interactions are correctly taken into account.Examples for a MAGLEV and a planar motor are given.     

Critical mass in the emergence of collective intelligence: a parallelized simulation of swarms in noisy environments

We extend an abstract agent-based swarming model based on the evolution of neural network controllers, to explore further the emergence of swarming. Our model is grounded in the ecological situation, in which agents can access some information from the environment about the resource location, but through a noisy channel. Swarming critically improves the efficiency of group foraging, by allowing agents to reach resource areas much more easily by correcting individual mistakes in group dynamics. As high levels of noise may make the emergence of collective behavior depend on a critical mass of agents, it is crucial to reach sufficient computing power to allow for the evolution of the whole set of dynamics in simulation. Since simulating neural controllers and information exchanges between agents are computationally intensive, to scale up simulations to model critical masses of individuals, the implementation requires careful optimization. We apply techniques from astrophysics known as treecodes to compute the signal propagation, and efficiently parallelize for multi-core architectures. Our results open up future research on signal-based emergent collective behavior as a valid collective strategy for uninformed search over a domain space.     

Analysis of numerical methods for the simulation of deformable models

Simulating deformable objects based on physical laws has become the most popular technique for modeling textiles, skin, or volumetric soft objects like human tissue. The physical model leads to an ordinary differential equation. Recently, several approaches to fast algorithms have been proposed.In this work, more profound numerical background about numerical stiffness is provided. Stiff equations impose stability restrictions on a numerical integrator. Some one-step and multistep methods with adequate stability properties are presented. For an efficient implementation, the inexact Newton method is discussed. Applications to 2D and 3D elasticity problems show that the discussed methods are faster and give higher-quality solutions than the commonly used linearized Euler method.     

Digital dysfunctions in primary school: A pilot study

Learning often involves complex cognitive and motorical processes, and while most learners cope adequately with these challenges there are always some that struggle. When new kinds of knowledge are introduced there is a possibility that some learners will find this new knowledge hard to acquire, and thus manifest a dysfunction. Today the new knowledge can be found within the digital domain. Some learners need more time and more efforts to master the different aspects of digital literacy, some of these even need special attention from friends, teachers or others. Is it possible that this group of learners is experiencing some kind of dysfunctions? It is likely to think so, there are a variety of different learning dysfunctions related to many learning domains, and when a new domain is established it would not come as a surprise that a new form of dysfunction is discovered. This article seeks to answer the question: “Do digital dysfunctions exist?” The answer is given as indicators more than as solid proof. In this study a group of 144 pupils is reduced through a triangulation of qualitative and quantitative methods, and ends up with three cases where there are obvious lacks of digital literacy without any obvious reason. The study also deals with definitions on “digital literacy”, and tries to point out what construct the term “digital literacy” in the study material. This construct is then used for measuring digital literacy.     

Tuples of Disjoint $\mathsf{NP}$ -Sets

Disjoint -pairs are a well studied complexity-theoretic concept with important applications in cryptography and propositional proof complexity. In this paper we introduce a natural generalization of the notion of disjoint -pairs to disjoint k-tuples of -sets for k≥2. We define subclasses of the class of all disjoint k-tuples of -sets. These subclasses are associated with a propositional proof system and possess complete tuples which are defined from the proof system. In our main result we show that complete disjoint -pairs exist if and only if complete disjoint k-tuples of -sets exist for all k≥2. Further, this is equivalent to the existence of a propositional proof system in which the disjointness of all k-tuples is shortly provable. We also show that a strengthening of this conditions characterizes the existence of optimal proof systems. An extended abstract of this paper appeared in the proceedings of the conference CSR 2006 (Lecture Notes in Computer Science 3967, 80–91, 2006). Supported by DFG grant KO 1053/5-1.     

A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem

Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesperson problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt.     

SME Network Characteristics vs. Product Innovativeness: How to Achieve High Innovation Performance

Small‐ and medium‐sized enterprises (SMEs) must on the one hand innovate for company survival with the appropriate degree of product innovativeness, and on the other they need to collaborate and focus on core competences for efficiency matters. This research examines the relation of network characteristics and product innovativeness on innovation performance in SMEs. We tested hypotheses on the relationship between these three variables via data gathered from 60 SMEs, active in the medical devices sector. In this context we aim to offer consensus on the theoretical and empirical question of whether or not network characteristics and product innovativeness have a direct effect on innovation performance of SMEs. Results show no significant direct effect of product innovativeness on innovation performance. A positive interaction effect of multiple network characteristics on innovation performance was found, which confirms the significant importance of network configuration on innovation performance for SMEs. It indicates that, for SMEs in a highly regulated sector like the medical devices sector, the interaction of network characteristics is of crucial importance for high innovation performance. It is the combination of network characteristics that counts.     

Classifying and Formally Verifying Integer Constant Folding

Constant folding is a well-known optimization of compilers which evaluates constant expressions already at compile time. Constant folding is valid only if the results computed by the compiler are exactly the same as the results which would be computed at run-time by the target machine arithmetic. We classify different arithmetics by deriving a general condition under which a target-machine arithmetic can be replaced by a compiler arithmetic. Furthermore, we consider integer arithmetics as a special case. They can be described by residue class arithmetics. We show that these arithmetics form a lattice. Using the order relation in this lattice, we establish a necessary and sufficient criterion under which constant folding can be done in a residue class arithmetic that is different from the one of the target machine. Concerning formal verification, we have formalized our proofs in the Isabelle/HOL system. As examples, we discuss the Java and C integer arithmetics and show which compiler arithmetics are valid for constant folding. This discussion reveals also potential sources of incorrect behavior of C compilers.