Rupture or stress injury of the flexor tendon pulleys? Early diagnosis with MRI

In node-positive breast carcinoma, the presence of tumour cells in the efferent vessels (EV) of the axillary nodes (positive EV status) was shown to be of poor prognosis in 1979. Later the presence of nodal micrometastases was also related to survival. This report describes a new subgroup in this system that is of potential therapeutic interest. It consisted of the 40% of the EV-positive cases with micrometastases (< 0.2 cm2) in their nodes, in addition to nodes with macrometastases. In them the difference in prognosis associated with EV status no longer held. Their prognosis did not differ markedly from that in the EV-negative patients. In the absence of such 'additional' micrometastases, the prognostic difference was still highly significant. There was also some indication that the presence of micrometastases consisting of embolic tumour growth alone may be associated with early death in EV-negative cases, in keeping with the prognosis in cases with lone micrometastases.     

IV. Referate

Ohne Zusammenfassung     

Guided architecture trade space exploration: fusing model-based engineering and design by shopping

Software and Systems Modeling - Advances in model-based system engineering have greatly increased the predictive power of models and the analyses that can be run on them. At the same time, designs...     

An observer-based approach for the projection onto a 2d-curve under movement

Standard path control laws of autonomous vehicles use the shortest distance between the vehicle’s position and the path as a control error. In order to determine this distance, the projection point onto the path needs to be determined continuously. This requires fast algorithms that feature high numerical reliability in the field of vehicle application.This paper presents two different observer-based approaches for the projection problem. The identity observer reconstructs all states of interest for path control. The second one, a reduced observer, only possesses the curve parameter as a state and calculates the other values by algebraic formulas. Both algorithms consider the continuous movement of the vehicle, the run of the curve, and work without any approximation of the curve. Furthermore, they are applicable for arbitrary parameterized smooth curves, guarantee the required numerical stability, have short calculating time, and show good statistical properties. The performance is shown in several simulations as well as under real conditions.     

Towards inverse modeling of turbidity currents: The inverse lock-exchange problem

A new approach is introduced for turbidite modeling, leveraging the potential of computational fluid dynamics methods to simulate the flow processes that led to turbidite formation. The practical use of numerical flow simulation for the purpose of turbidite modeling so far is hindered by the need to specify parameters and initial flow conditions that are a priori unknown. The present study proposes a method to determine optimal simulation parameters via an automated optimization process. An iterative procedure matches deposit predictions from successive flow simulations against available localized reference data, as in practice may be obtained from well logs, and aims at convergence towards the best-fit scenario. The final result is a prediction of the entire deposit thickness and local grain size distribution. The optimization strategy is based on a derivative-free, surrogate-based technique. Direct numerical simulations are performed to compute the flow dynamics. A proof of concept is successfully conducted for the simple test case of a two-dimensional lock-exchange turbidity current. The optimization approach is demonstrated to accurately retrieve the initial conditions used in a reference calculation.     

The semigroups of linearly realizable finite automata. I

Summary First the problem is solved how one can decide whether an arbitrary finite semigroup H is linearly A-realizable, i.e., whether there exists a linearly realizable finite automaton having a semigroup isomorphic to H. This leads to a question about the existence of certain generating subsets of H. The determination of these subsets is rather complicated in case H-HH=Ø and very simple in case H-HH#Ø. But in the first case we are able to clear up completely the structure of the semigroups which are linearly A-realizable: These are exactly the finite right groups which have maximal subgroups of the type described by Ecker in [4]. In the second case we get only necessary structure conditions. Among other things we shall see: If a semigroup H is linearly A-realizable one can define a congruence relation on it having the property, that H is isomorphic to a semigroup of a strongly connected and linearly realizable automaton iff the so-called index of H equals the index of H/. Developing these results about semigroups we obtain at the same time many structure theorems about linearly realizable automata.