Furnierverleimungen mit Fichten-und Kiefernrindenextrakten unter Zusatz von Phenolharz

Ohne Zusammenfassung     

伦敦证明交通拥堵收费政策如何在大城市发挥效用

一百年以前，在马车时代，穿越伦敦中心区的道路交通平均速度为每小时11英里。到20世纪末，城市交通的速度仍为每小时11英里，而这还只是平均速度。大多数时间，街道拥堵，车辆只能蠕动或者根本就无法移动。     

Isolation of translactone-containing triterpenes with thrombin inhibitory activities from the leaves of Lantana camara

Methanolic extracts prepared from the leaves of Lantana camara have been found to inhibit human thrombin. An assay, in which thrombin activity is measured as a function of clot formation from fibrinogen, was used to guide the fractionation and purification of five principal active constituents (1-5), which were all characterized as 5,5-trans-fused cyclic lactone-containing euphane triterpenes.     

Patienten — Daten — Schutz

Patientinnen und Patienten vertrauen sich heutzutage nicht mehr nur ihrem Haus- oder Facharzt, sondern immer h?ufiger auch einer Gro?klinik („Krankenhausmaschine“) an. Schon dort entsteht die Frage, wie die ?rztliche Schweigepflicht oder besser: das Patientengeheimnis, noch aufrechterhalten werden kann. Weitere Risiken drohen dem Patientengeheimnis in der zunehmend vernetzten Verarbeitung von medizinischen Befunden z.B. in Praxisnetzen und auch in der Online-Welt, die zweifellos gro?e Vorteile für die behandlungsbedürftigen Menschen bringen. Sie werfen aber auch die Frage nach der Verantwortung für die Sicherheit, Richtigkeit und Verfügbarkeit dieser Daten auf, die nicht selten lebenswichtig sein k?nnen.     

A taxonomy for and analysis of multi-person-display ecosystems

Interactive displays are increasingly being distributed in a broad spectrum of everyday life environments: they have very diverse form factors and portability characteristics, support a variety of interaction techniques, and can be used by a variable number of people. The coupling of multiple displays creates an interactive “ecosystem of displays”. Such an ecosystem is suitable for particular social contexts, which in turn generates novel settings for communication and performance and challenges in ownership. This paper aims at providing a design space that can inform the designers of such ecosystems. To this end, we provide a taxonomy that builds on the size of the ecosystem and on the degree of individual engagement as dimensions. We recognize areas where physical constraints imply certain kinds of social engagement, versus other areas where further work on interaction techniques for coupling displays can open new design spaces.     

A comparison between wet and cryogenic drilling of CFRP/Ti stacks

This paper compares conventional and cryogenic cooling in the deep hole drilling of carbon fiber reinforced polymer (CFRP)/Ti stacks. Various parameters are taken into account to find if the use of cryogenic coolant is justified by the improvement of the final results. Both the thrust and the torque were acquired continuously during the machining operations and compared both in average and distribution. The use of a cryogenic coolant brings a reduction in thrust force and torque without any sensible drawback. Overall the results prove that cryogenic drilling is a suitable technology for CFRP/Ti stack drill.     

The multi-agent programming contest from 2005–2010

The Multi-Agent Programming Contest is an annual international event on programming multi-agent systems: Teams of agents participate in a simulated cooperative scenario. It started in 2005 and is organised in 2010 for the sixth time. The contest is an attempt to stimulate research in the area of multi-agent system development and programming by (i) identifying key problems in the field and (ii) collecting suitable benchmarks that can serve as milestones for testing multi-agent programming languages, platforms and tools. This article provides a short history of the contest since it started and reports in more detail on the cows and cowboys scenario implemented for the 2008, 2009 and 2010 contest editions. We briefly discuss the underlying technological background and conclude with a critical discussion of the experiences and lessons learned.     

Model Checking Abilities of Agents: A Closer Look

Alternating-time temporal logic (atl) is a logic for reasoning about open computational systems and multi-agent systems. It is well known that atl model checking is linear in the size of the model. We point out, however, that the size of an atl model is usually exponential in the number of agents. When the size of models is defined in terms of states and agents rather than transitions, it turns out that the problem is (1) Δ ₃ ^P -complete for concurrent game structures, and (2) Δ ₂ ^P -complete for alternating transition systems. Moreover, for “Positive atl” that allows for negation only on the level of propositions, model checking is (1) Σ ₂ ^P -complete for concurrent game structures, and (2) NP-complete for alternating transition systems. We show a nondeterministic polynomial reduction from checking arbitrary alternating transition systems to checking turn-based transition systems, We also discuss the determinism assumption in alternating transition systems, and show that it can be easily removed. In the second part of the paper, we study the model checking complexity for formulae of atl with imperfect information (atl _ir ). We show that the problem is Δ ₂ ^P -complete in the number of transitions and the length of the formula (thereby closing a gap in previous work of Schobbens in Electron. Notes Theor. Comput. Sci. 85(2), 2004). Then, we take a closer look and use the same fine structure complexity measure as we did for atl with perfect information. We get the surprising result that checking formulae of atl _ir is also Δ ₃ ^P -complete in the general case, and Σ ₂ ^P -complete for “Positive atl _ir ”. Thus, model checking agents’ abilities for both perfect and imperfect information systems belongs to the same complexity class when a finer-grained analysis is used.     

Model checking multi-agent systems with logic based Petri nets

We introduce a class of Petri nets, simple logic Petri nets (SLPN), that are based on logical expressions. We show how this type of nets can be efficiently mapped into logic programs with negation: the corresponding answer sets describe interleaved executions of the underlying nets (Theorem 1). The absence of an answer set indicates a deadlock situation. We also show how to correctly model and specify AgentSpeak agents and multi-agent systems with SLPN’s (Theorem 2). Both theorems allow us to solve the task of model checking AgentSpeak multi-agent systems by computing answer sets of the obtained logic program with any ASP system.