Technische Universität Darmstadt

About: Technische Universität Darmstadt is a education organization based out in Darmstadt, Germany. It is known for research contribution in the topics: Computer science & Context (language use). The organization has 17316 authors who have published 40619 publications receiving 937916 citations. The organization is also known as: Darmstadt University of Technology & University of Darmstadt.

Serious games for health: personalized exergames

Abstract: In this paper, we describe a set of personalized exergames which combine methods and concepts of serious games, adaptation and personalization, authoring and sensor technologies Compared to existing systems, the set of games does not only keep track of the user's vital state, but also directly integrates vital parameters into the gameplay and supports the training and motivation for sustainable physical activity in a playful manner

Is negative selection appropriate for anomaly detection

Abstract: Negative selection algorithms for hamming and real-valued shape-spaces are reviewed. Problems are identified with the use of these shape-spaces, and the negative selection algorithm in general, when applied to anomaly detection. A straightforward self detector classification principle is proposed and its classification performance is compared to a real-valued negative selection algorithm and to a one-class support vector machine. Earlier work suggests that real-value negative selection requires a single class to learn from. The investigations presented in this paper reveal, however, that when applied to anomaly detection, the real-valued negative selection and self detector classification techniques require positive and negative examples to achieve a high classification accuracy. Whereas, one-class SVMs only require examples from a single class.

Matrix-assisted laser desorption/ionization mass spectrometry (MALDI-MS) of membrane proteins and non-covalent complexes

Abstract: Matrix-assisted laser desorption/ionization (MALDI) mass spectra and methods to improve their quality are reported for three hydrophobic, membrane-bound proteins: porin from Escherichia coli, bacteriorhodopsin from Halobacterium salinarium and cholesterolesterase from Pseudomonas fluorescens. Several commonly used UV and IR matrices have been tested. In addition, the susceptibility of MALDI mass spectrometry to various neutral and ionic detergents, known usually to degrade the quality of MALDI mass spectra, has been tested systematically. For porin, consisting of three identical non-covalently bound subunits, a new sample preparation is reported, resulting in the desorption of the intact quaternary protein structure. This leads to a better understanding of the way a given analyte is embedded into the host matrix crystals.

A specification of the Agent Reputation and Trust (ART) testbed: experimentation and competition for trust in agent societies

Abstract: A diverse collection of trust-modeling algorithms for multi-agent systems has been developed in recent years, resulting in significant breadth-wise growth without unified direction or benchmarks. Based on enthusiastic response from the agent trust community, the Agent Reputation and Trust (ART) Testbed initiative has been launched, charged with the task of establishing a testbed for agent trust- and reputation-related technologies. This testbed serves in two roles: (1) as a competition forum in which researchers can compare their technologies against objective metrics, and (2) as a suite of tools with flexible parameters, allowing researchers to perform customizable, easily-repeatable experiments. This paper first enumerates trust research objectives to be addressed in the testbed and desirable testbed characteristics, then presents a competition testbed specification that is justified according to these requirements. In the testbed's artwork appraisal domain, agents, who valuate paintings for clients, may gather opinions from other agents to produce accurate appraisals. The testbed's implementation architecture is discussed briefly, as well.

On the asymptotic convergence of collocation methods

Abstract: We prove quasioptimal and optimal order estimates in various Sobolev norms for the approximation of linear strongly elliptic pseudodifferential equations in one independent variable by the method of nodal collocation by odd degree polynomial splines. The analysis pertains in particular to many of the boundary element methods used for numerical computation in engineering applications. Equations to which the analysis is applied include Fredholm integral equations of the second kind, certain first kind Fredholm equations, singular integral equations involving Cauchy kernels, a variety of integro-differential equations, and two-point boundary value problems for ordinary differential equations. The error analysis is based on an equivalence which we establish between the collocation methods and certain nonstandard Galerkin methods. We compare the collocation method with a standard Galerkin method using splines of the same degree, showing that the Galerkin method is quasioptimal in a Sobolev space of lower index and furnishes optimal order approximation for a range of Sobolev indices containing and extending below that for the collocation method, and so the standard Galerkin method achieves higher rates of convergence.