Device measures fluid drag on test vehicles

Electromechanical drag balance device measures the aerodynamic drag force acting on a vehicle as it moves through the atmosphere and telemeters the data to a remote receiving station. This device is also used for testing the hydrodynamic drag characteristics of underwater vehicles

Air frame drag balance Patent

Device for measuring drag forces in flight test

Competence-Oriented Teaching: Combining Theory and Practice in a Future-Oriented Teacher Education

Linking theory and practice in university teacher education is a necessary condition for the development of didactic competence. With this in mind, we developed a seminar to promote competence-oriented teaching through a continuous exchange of practical expertise with current teachers. As a result, all of the participants (students and teachers) should acquire greater pedagogical knowledge as a central element of their teaching expertise. In order to examine the impact of the seminar, we measured the development of the competence-oriented didactic knowledge of 57 participating students and 6 accompanying teachers. To do so, we used a pre–post design with different control groups. The results show a significant increase in didactic knowledge. But they also show that diagnostic competences need significant further development. Hence, in the future, the seminar will be supplemented by video-based learning elements, which in particular address the difficulty of teaching competences in classrooms with a wide variety of pupils

Succinct representation of regular languages by boolean automata II

AbstractBoolean automata are a generalization of finite automata in the sense that the next state (the result of the transition function, given a state and a letter) is not just a single state (deterministic automata) or a set of states (nondeterministic automata) but a boolean function of the states. Boolean automata accept precisely the regular languages; also, they correspond in a natural way to certain language equation involving complementation as well as to sequential networks. In a previous note we showed that for every n ⩾ 1, there exists a boolean automaton Bn with n states such that the smallest deterministic automaton for the same language has 22n states. In the present note we will show a precisely attainable lower bound on the succinctness of representing regular languages by boolean automata; namely, we will show that, for every n ⩾ 1, there exists a reduced automaton Dn with n states such that the smallest boolean automaton accepting the same language has also n states