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     

Light diffraction from rough gratings

Two holographic diffraction gratings with very similar parameters, designed for maximum performance inTM polarization, are investigated, their diffraction efficiency measured, an electron microscopic picture of their surface observed, and numerical simulation of light diffraction done with the surface roughness taken into account. It is demonstrated numerically that a small-scale roughness imposed on the grating surface could increase significantly both scattering and absorption from the surface, this influence being greater in the TM case. A very good coincidence between the numerical and experimental data is obtained in TE polarization, whereas in TM polarization only a qualitative agreement exists.     

Novel Aerosol-Based Approach toward Mesoporous Silica Nanoparticles

This study introduces a novel gas-phase method for the synthesis of mesoporous silica nanoparticles (MSNs). The method is a two-step templating approach by first forming silicon-coated carbon structures in a hybrid microwave-plasma/hot-wall reactor followed by an annealing step to produce mesoporous silica with distinct nanostructure and porosity. Two different (sacrificial) carbonaceous templates have been prepared (plasma reactor) and coated (hot-wall reactor), 2D few-layer graphene (FLG) flakes and soot-like fractal aggregates. Results show that the wall thickness of the porous silica structures can be adjusted by changing the concentration of the silicon precursor (monosilane). High monosilane concentrations, however, result in solid silica particles after annealing. Using soot-like particle templates permitted to control of the shell thickness of the hollow porous particles, while the FLG template results in ultrathin silica sheets after heat treatment. The pore volume and specific surface area increase up to 263 m² g⁻¹ and 0.6 cm³ g⁻¹, respectively, by the formation of hollow porous particles. An adsorption study on carbamazepine reveals up to ≈86% removal. The gas-phase aerosol-based template method presented here offers scalability and versatility, and it is capable of producing MSNs with a controlled structure and porosity by modifying the carbonaceous templates.     

Visualizing and fuzzy filtering for discovering temporal trajectories of association rules

We propose a user-centric rule filtering method that allows to identify association rules that exhibit a certain user-specified temporal behavior with respect to rule evaluation measures. The method can considerably reduce the number of association rules that have to be assessed manually after a rule induction. This is especially necessary if the rule set contains many rules as it is the case for the task of finding rare patterns inside the data. For the proposed method, we will reuse former work on the visualization of association rules [M. Steinbrecher, R. Kruse, Visualization of possibilistic potentials, in: Foundations of Fuzzy Logic and Soft Computing, in: Lecture Notes in Comput. Sci., vol. 4529, Springer-Verlag, Berlin/Heidelberg, 2007, pp. 295–303] and use an extension of it to motivate and assess the presented filtering technique. We put the focus on rules that are induced from a data set that contains a temporal variable and build our approach on the requirement that temporally ordered sets of association rules are available, i.e., one set for every time frame. To illustrate this, we propose an ad-hoc learning method along the way. The actual rule filtering is accomplished by means of fuzzy concepts. These concepts use linguistic variables to partition rule-related domains of interest, such as the confidence change rate. The original rule sets are then matched against these user concepts and result in only those rules that match the respective concepts to a predefined extent. We provide empirical evidence by applying the proposed methods to hand-crafted as well as real-world data sets and critically discuss the current state and further prospects.     

Information fusion for automotive applications – An overview

This article focusses on the fusion of information from various automotive sensors like radar, video, and lidar for enhanced safety and traffic efficiency. Fusion is not restricted to data from sensors onboard the same vehicle but vehicular communication systems allow to propagate and fuse information with sensor data from other vehicles or from the road infrastructure as well. This enables vehicles to perceive information from regions that are hardly accessible otherwise and represents the basis for cooperative driving maneuvers. While the Bayesian framework builds the basis for information fusion, automobile environments are characterized by their a priori unknown topology, i.e., the number, type, and structure of the perceived objects is highly variable. Multi-object detection and tracking methods are a first step to cope with this challenge. Obviously, the existence or non-existence of an object is of paramount importance for safe driving. Such decisions are highly influenced by the association step that assigns sensor measurements to object tracks. Methods that involve multiple sequences of binary assignments are compared with soft-assignment strategies. Finally, fusion based on finite set statistics that (theoretically) avoid an explicit association are discussed.     

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. ;