纳米粒子/环氧树脂复合材料的固化动力学研究

在纳米Al2O3、Si3N4、SiC填充环氧树脂复合材料体系中,纳米粒子表面活性及粒子与环氧树脂之间的相互作用影响着环氧树脂的固化过程.本文利用傅立叶红外光谱表征了纳米粒子与环氧树脂之间的化学作用情况,并利用差视扫描量热仪研究了不同纳米粒子/环氧树脂复合材料的固化动力学.结果表明,具有相对最强表面活性的纳米Al2O3粒子与基体之间的相互作用最强,同时该粒子对环氧树脂固化过程的促进作用最显著.     

Stereoisomere Aromastoffe

Zusammenfassung Die Synthese von acht verschiedenen 2-Alkoxy-5-alkyl-tetrahydrofuranen und ihren Stereoisomeren wird vorgestellt, sieben von ihnen sind als Aromastoffe der Wassermelone bekannt. Alle Stereoisomeren werden, ausgehend von optisch reinen-Nonalacton-Enantiomeren, synthetisiert und mit Diisobutylaluminiumhydrid selektiv zu den entsprechenden Lactolen reduziert. Die Lactole werden mit den gewünschten Alkoholen in schwach saurer Lösung zucis/trans-Diastereomeren umgesetzt und durch Flüssigchromatographie in optisch reine Stereoisomere getrennt. Die sensorische Charakteristik aller Stereoisomeren der sieben Verbindungen wird aufgezeigt. Die Trennung dercis/trans-Diastereomeren an DB-210 wird vorgestellt und die chirospezifische Differenzierung der acht Verbindungen diskutiert.

---

Stereoisomeric flavour compounds L. Optically pure 2-alkoxy-5-alkyl-tetrahydrofurans — structures and properties

Summary The synthesis of eight different 2-alkoxy-5-alkyltetrahydrofurans and their stereoisomers is presented, seven of which are known to be flavour compounds of water melons. All stereoisomers were synthesized from optically pure-lactone enantiomers, which were selectively reduced by diisobutylaluminium hydride to the corresponding lactols. The lactols were treated with the desired alcohol component in weakly acidic media to yield thecis/trans diastereoisomers, which were separated into optically pure stereoisomers by liquid chromatography. The sensory characteristics of all four stereoisomers of the seven compounds are given. The Stereodifferentiation of thesecis/trans diastereoisomers on DB-210 is demonstrated and the direct chirospecific differentiation of all eight compounds discussed.

     

The influence of training level on manual flight in connection to performance,scan pattern,and task load

This work focuses on the analysis of pilots’ performance during manual flight operations in different stages of training and their influence on gaze strategy. The secure and safe operation of air traffic is highly dependent on the individual performances of the pilots. Before becoming a pilot, he/she has to acquire a broad set of skills by training to pass all the necessary qualification and licensing standards. A basic skill for every pilot is manual control operations, which is a closed-loop control process with several cross-coupled variables. Even with increased automation in the cockpit, the manual control operations are essential for every pilot as a last resort in the event of automation failure. A key element in the analysis of manual flight operations is the development over time in relation to performance and visual perception. An experiment with 28 participants (including 11 certified pilots) was conducted in a Boeing 737 simulator. For defined flight phases, the dynamic time warping method was applied to evaluate the performance for selected criteria, and eye-tracking methodology was utilized to analyze the gaze-pattern development. The manipulation of workload and individual experience influences the performance and the gaze pattern at the same time. Findings suggest that the increase of workload has an increased influence on pilots depending on the flight phase. Gaze patterns from experienced pilots provide insights into the training requirements of both novices and experts. The connection between workload, performance and gaze pattern is complex and needs to be analyzed under as many differing conditions. The results imply the necessity to evaluate manual flight operations with respect to more flight phases and a detailed selection of performance indications.

     

Zur personellen Verankerung der IT-Funktion im Vorstand börsennotierter Unternehmen: Ergebnisse einer inhaltsanalytischen Betrachtung

On the Rate of Board Members with IT Responsibilities in Firms Listed on the Stock Exchange: Results of a Content Analysis: This article reports on a content analysis that investigates the rate of board members with IT responsibilities in firms listed on the stock exchange in the German speaking countries. Furthermore, the study ascertains the correlation of six factors – which become evident through content analysis – with the rate of board members with IT responsibilities. A total of 679 annual reports of German, Austrian, and Swiss corporations have been analyzed. The results show that in Germany and Switzerland 26 percent of the firms investigated have a board member with IT responsibilities, in Austria the rate is 23 percent. Additionally, the results show that turnover and number of employees are highly positively correlated with the rate of board members with IT responsibilities. Furthermore, the data show a correlation between industry and the rate of board members with IT responsibilities.     

Computing presentations for subgroups of polycyclic groups and of context-free groups

Algorithms for solving uniform decision problems for algebraic structures crucially depend on the chosen finite presentations for the structures under consideration. Rewriting techniques have been used very successfully to solve uniform decision problems, when the presentations considered involve finite, noetherian, and ()-confluent rewriting systems. Whenever the class of algebraic structures considered is closed under the operation of taking finitely generated substructures, then the algorithms for solving the uniform decision problems can be applied to the substructures as well. However, since these algorithms depend on the form of the presentations, this involves the task of constructing a presentation of a certain form for a substructure given a presentation of this form for the structure itself and a finite set of generating elements for the substructure.This problem, which has received a lot of attention in algebra, is here investigated from an algorithmic point of view. The structures considered are the following two classes of groups, which have been studied extensively before: the polycyclic groups and the context-free groups.Finitely generated context-free groups can be presented by finite, monadic, and -confluent string-rewriting systems. Due to their nice algorithmic properties these systems provide a way to effectively solve many decision problems for context-free groups. Since finitely generated subgroups of context-free groups are again contextfree, they can be presented in the same way. Here we describe a process that, from a finite, monadic, and -confluent string-rewriting system presenting a context-free groupG and a finite subsetU ofG, determines a presentation of this form for the subgroup U ofG that is generated byU. For finitely presented polycyclic groups we obtain an analogous result, when we use finite confluent PCP2-presentations to describe these groups.This work was performed while this author was visiting at the Fachbereich Informatik, Universität Kaiserslautern, during his sabbatical 1991/92     

Illustrative stream surfaces

Stream surfaces are an intuitive approach to represent 3D vector fields. In many cases, however, they are challenging objects to visualize and to understand, due to a high degree of self-occlusion. Despite the need for adequate rendering methods, little work has been done so far in this important research area. In this paper, we present an illustrative rendering strategy for stream surfaces. In our approach, we apply various rendering techniques, which are inspired by the traditional flow illustrations drawn by Dallmann and Abraham \& Shaw in the early 1980s. Among these techniques are contour lines and halftoning to show the overall surface shape. Flow direction as well as singularities on the stream surface are depicted by illustrative surface streamlines. ;To go beyond reproducing static text book images, we provide several interaction features, such as movable cuts and slabs allowing an interactive exploration of the flow and insights into subjacent structures, e.g., the inner windings of vortex breakdown bubbles. These methods take only the parameterized stream surface as input, require no further preprocessing, and can be freely combined by the user. We explain the design, GPU-implementation, and combination of the different illustrative rendering and interaction methods and demonstrate the potential of our approach by applying it to stream surfaces from various flow simulations. ;     

On packing shortest cycles in graphs

We study the problems to find a maximum packing of shortest edge-disjoint cycles in a graph of given girth g (g-ESCP) and its vertex-disjoint analogue g-VSCP. In the case g=3, Caprara and Rizzi (2001) have shown that g-ESCP can be solved in polynomial time for graphs with maximum degree 4, but is APX-hard for graphs with maximum degree 5, while g-VSCP can be solved in polynomial time for graphs with maximum degree 3, but is APX-hard for graphs with maximum degree 4. For g∈{4,5}, we show that both problems allow polynomial time algorithms for instances with maximum degree 3, but are APX-hard for instances with maximum degree 4. For each g?6, both problems are APX-hard already for graphs with maximum degree 3.     

Betriebsinformatik und Wirtschaftsinformatik als notwendige anwendungsbezogene Ergänzung einer allgemeinen Informatik – Vorschläge zur Verbesserung der akademischen Ausbildung auf dem Gebiet der automatisierten Datenverarbeitung in der Bundesrepublik Deutschland

Zusammenfassung  Nachdruck eines Aufsatzes aus elektronische datenverarbeitung 11(11)1969:544–548. This article is also available in English via and : Grochla E (2008) Corporate Information Systems Engineering and Business and Information Systems Engineering as a Necessary Application-Oriented Extension of General Computer Science – Proposals for Enhancing Academic Education in the Field of Automated Data Processing in the Federal Republic of Germany. Bus Inf Syst Eng. doi .

---