Model Driven Architecture

Bei der Model Driven Architecture (MDA) bilden Modelle die zentralen Elemente des Softwareentwicklungsprozesses. Ziel ist es, plattformspezifische Modelle möglichst automatisiert aus plattformunabhängigen Modellen abzuleiten. Dadurch soll der Aufwand der Softwareentwicklung verringert und die Adaptierung an neue Technologien erleichtert werden.*Vorschläge an Prof. Dr. Frank Puppe oder Dieter Steinbauer Alle „Aktuellen Schlagwörter“ seit 1988 finden Sie unter: www.ai-wuerzburg.de/as     

Role of specific instances in controlling a dynamic system.

This article examines the claim that the learning of a dynamic control task is mediated by a lookup table consisting of previously successful trials on the task. Consistent with the predictions of a lookup table, in 2 experiments participants tended to give the same response to situations in which they had previously been successful rather than unsuccessful. Further, in both experiments, participants' knowledge did not generalize to new dissimilar situations, unless the dynamic control task was governed by a highly salient rule. A version of G. Logan's (1988) instance theory, which assumes that participants store each successful response as a separate instance linking the situation to the response, was able to quantitatively match a range of measures of participants' performance with 1 free parameter, except in the case in which the control task was governed by a salient rule. In a complementary way, an alternative rule-based model could only match participants' performance when the control task was governed by a highly salient rule. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Metallic Nanoparticles in Heterogeneous Catalysis

Catalysis Letters - Heterogeneous catalysis is a chemical process achieved at solid–gas or solid–liquid interfaces. Many factors including the particle size, shape and metal-support...     

Upgrading of gas oils: the HDS kinetics of dibenzothiophene and its derivatives in real gas oil

The hydrodesulphurization (HDS) of dibenzothiophene (DBT), 4-methyl dibenzothiophene (4 M-DBT), 4,6-dimethyl dibenzothiophene (4,6 DM-DBT) and 4,6-diethyl dibenzothiophene (4,6 DE-DBT) as real gas oil components on NiMo/Al₂O₃ catalyst was investigated. On the basis of the first order rate constants of HDS of the individual sulphur compounds reactivities of the investigated compounds decreased in the order DBT ≫ 4 M-DBT > 4,6 DE-DBT ≈ 4,6 DM-DBT. Apparent activation energies of HDS of above sulphur compounds increased from 80.0 to 120.5 kJ/mol.     

Development of a Phytochemical-Based Lure for the Dried Bean Beetle Acanthoscelides obtectus Say (Coleoptera: Chrysomelidae)

The dried bean beetle, Acanthoscelides obtectus, is an economically important, worldwide pest of legume crops including dry beans, Phaseolus vulgaris. Assessment of A. obtectus infestation levels in pre-harvest field crops and post-harvest granaries is difficult to achieve because there is no effective monitoring tool for early detection so that interventions can be deployed as needed. Because A. obtectus is a generic pollen and nectar feeder, we adopted an electrophysiological (EAG) screening approach, using the antennae of female A. obtectus to identify physiologically active, volatile phytochemicals, which could then be investigated for their attractiveness to A. obtectus in laboratory behavioral assays and preliminary field tests. Of the 27 compounds tested in EAG screening, 5 compounds, i.e., methyl anthranilate, methyl eugenol, benzyl alcohol, (RS)-lavandulol, and 2-phenylethanol, elicited stronger EAG responses than the standard (1-phenylethanol). In 4-arm olfactometer bioassays, female A. obtectus preferred the olfactometer arm containing the odor of either methyl anthranilate or benzyl alcohol compared to the solvent control. In preliminary field tests using these 2 compounds as a binary mixture, at least 5 times as many beetles were caught on baited traps compared to non-baited traps. The field data also suggested that benzyl alcohol was primarily responsible for the field activity of the blend. We hypothesize that the attraction of A. obtectus to the combined benzyl alcohol/methyl anthranilate and the single benzyl alcohol baits is connected to the species` nectar- and pollen-feeding behaviour and not to its intraspecific communication. To our knowledge, this is the first evidence that A. obtectus behavior in the field can be modified by the deployment of plant-derived semiochemicals.

     

The many meanings of UML 2 Sequence Diagrams: a survey

Scenario languages are widely used in software development. Typical usage scenarios, forbidden behaviors, test cases, and many more aspects can be depicted with graphical scenarios. Scenario languages were introduced into the Unified Modeling Language (UML) under the name of Sequence Diagrams. The 2.0 version of UML changed Sequence Diagrams significantly and the expressiveness of the language was highly increased. However, the complexity of the language (and the diversity of the goals Sequence Diagrams are used for) yields several possible choices in its semantics. This paper collects and categorizes the semantic choices in the language, surveys the formal semantics proposed for Sequence Diagrams, and presents how these approaches handle the various semantic choices.     

Better and Simpler Approximation Algorithms for?the?Stable Marriage Problem

We first consider the problem of finding a maximum size stable matching if incomplete lists and ties are both allowed, but ties are on one side only. For this problem we give a simple, linear time 3/2-approximation algorithm, improving on the best known approximation factor 5/3 of Irving and Manlove (J. Comb. Optim., doi:10.1007/s10878-007-9133-x, 2007). Next, we show how this extends to the Hospitals/Residents problem with the same ratio if the residents have strict orders. We also give a simple linear time algorithm for the general problem with approximation factor 5/3, improving the best known 15/8-approximation algorithm of Iwama, Miyazaki and Yamauchi (SODA ??07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.?288?C297, 2007). For the cases considered in this paper it is NP-hard to approximate within a factor of 21/19 by the result of Halldórsson et?al. (ACM Transactions on Algorithms 3(3):30, 2007). Our algorithms not only give better approximation ratios than the cited ones, but are much simpler and run significantly faster. Also we may drop a restriction used in (J. Comb. Optim., doi:10.1007/s10878-007-9133-x, 2007) and the analysis is substantially more moderate. Preliminary versions of this paper appeared in (Király, Egres Technical Report TR-2008-04, www.cs.elte.hu/egres/, 2008; Király in Proceedings of MATCH-UP 2008: Matching Under Preferences??Algorithms and Complexity, Satellite Workshop of ICALP, July 6, 2008, Reykjavík, Iceland, pp.?36?C45, 2008; Király in ESA 2008, Lecture Notes in Computer Science, vol.?5193, pp.?623?C634, 2008). For the related results obtained thenceforth see Sect.?5.