Comparison of different radiography systems in an experimental study for detection of forearm fractures and evaluation of the Müller-AO and Frykman classification for distal radius fractures

OBJECTIVES: We sought to compare the diagnostic performance of screen-film radiography, storage-phosphor radiography, and a flat-panel detector system in detecting forearm fractures and to classify distal radius fractures according to the Müller-AO and Frykman classifications compared with the true extent, depicted by anatomic preparation. MATERIALS AND METHODS: A total of 71 cadaver arms were fractured in a material testing machine creating different fractures of the radius and ulna as well as of the carpal bones. Radiographs of the complete forearm were evaluated by 3 radiologists, and anatomic preparation was used as standard of reference in a receiver operating curve analysis. RESULTS: The highest diagnostic performance was obtained for the detection of distal radius fractures with area under the receiver operating curve (AUC) values of 0.959 for screen-film radiography, 0.966 for storage-phosphor radiography, and 0.971 for the flat-panel detector system (P > 0.05). Exact classification was slightly better for the Frykman (kappa values of 0.457-0.478) compared with the Müller-AO classification (kappa values of 0.404-0.447), but agreement can be considered as moderate for both classifications. CONCLUSIONS: The 3 imaging systems showed a comparable diagnostic performance in detecting forearm fractures. A high diagnostic performance was demonstrated for distal radius fractures and conventional radiography can be routinely performed for fracture detection. However, compared with anatomic preparation, depiction of the true extent of distal radius fractures was limited and the severity of distal radius fractures tends to be underestimated.

Control algorithms for large scale adaptive optics

In this dissertation, the problem of creating effective large scale Adaptive Optics (AO) systems control algorithms for the new generation of giant optical telescopes is addressed. The effectiveness of AO control algorithms is evaluated in several respects, such as computational complexity, compensation error rejection and robustness, i.e. reasonable insensitivity to the system imperfections. The results of this research are summarized as follows: 1. Robustness study of Sparse Minimum Variance Pseudo Open Loop Controller (POLC) for multi-conjugate adaptive optics (MCAO). The AO system model that accounts for various system errors has been developed and applied to check the stability and performance of the POLC algorithm, which is one of the most promising approaches for the future AO systems control. It has been shown through numerous simulations that, despite the initial assumption that the exact system knowledge is necessary for the POLC algorithm to work, it is highly robust against various system errors. 2. Predictive Kalman Filter (KF) and Minimum Variance (MV) control algorithms for MCAO. The limiting performance of the non-dynamic Minimum Variance and dynamic KF-based phase estimation algorithms for MCAO has been evaluated by doing Monte-Carlo simulations. The validity of simple near-Markov autoregressive phase dynamics model has been tested and its adequate ability to predict the turbulence phase has been demonstrated both for single- and multiconjugate AO. It has also been shown that there is no performance improvement gained from the use of the more complicated KF approach in comparison to the much simpler MV algorithm in the case of MCAO. 3. Sparse predictive Minimum Variance control algorithm for MCAO. The temporal prediction stage has been added to the non-dynamic MV control algorithm in such a way that no additional computational burden is introduced. It has been confirmed through simulations that the use of phase prediction makes it possible to significantly reduce the system sampling rate and thus overall computational complexity while both maintaining the system stable and effectively compensating for the measurement and control latencies.

A 5-year comparison of performance of sentinel and mandatory notification surveillance systems for measles in Switzerland

A sensitive, specific and timely surveillance is necessary to monitor progress towards measles elimination. We evaluated the performance of sentinel and mandatory-based surveillance systems for measles in Switzerland during a 5-year period by comparing 145 sentinel and 740 mandatory notified cases. The higher proportion of physicians who reported at least one case per year in the sentinel system suggests underreporting in the recently introduced mandatory surveillance for measles. Accordingly, the latter reported 2-36-fold lower estimates for incidence rates than the sentinel surveillance. However, these estimates were only 0.6-12-fold lower when we considered confirmed cases alone, which indicates a higher specificity of the mandatory surveillance system. In contrast, the sentinel network, which covers 3.5% of all outpatient consultations, detected only weakly and late a major national measles epidemic in 2003 and completely missed 2 of 10 cantonal outbreaks. Despite its better timeliness and greater sensitivity in case detection, the sentinel system, in the current situation of low incidence, is insufficient to perform measles control and to monitor progress towards elimination.

MODELING AND PROTOCOL DESIGN FOR EMERGING WIRELESS SYSTEMS

Mobile Mesh Network based In-Transit Visibility (MMN-ITV) system facilitates global real-time tracking capability for the logistics system. In-transit containers form a multi-hop mesh network to forward the tracking information to the nearby sinks, which further deliver the information to the remote control center via satellite. The fundamental challenge to the MMN-ITV system is the energy constraint of the battery-operated containers. Coupled with the unique mobility pattern, cross-MMN behavior, and the large-spanned area, it is necessary to investigate the energy-efficient communication of the MMN-ITV system thoroughly. First of all, this dissertation models the energy-efficient routing under the unique pattern of the cross-MMN behavior. A new modeling approach, pseudo-dynamic modeling approach, is proposed to measure the energy-efficiency of the routing methods in the presence of the cross-MMN behavior. With this approach, it could be identified that the shortest-path routing and the load-balanced routing is energy-efficient in mobile networks and static networks respectively. For the MMN-ITV system with both mobile and static MMNs, an energy-efficient routing method, energy-threshold routing, is proposed to achieve the best tradeoff between them. Secondly, due to the cross-MMN behavior, neighbor discovery is executed frequently to help the new containers join the MMN, hence, consumes similar amount of energy as that of the data communication. By exploiting the unique pattern of the cross-MMN behavior, this dissertation proposes energy-efficient neighbor discovery wakeup schedules to save up to 60% of the energy for neighbor discovery. Vehicular Ad Hoc Networks (VANETs)-based inter-vehicle communications is by now growingly believed to enhance traffic safety and transportation management with low cost. The end-to-end delay is critical for the time-sensitive safety applications in VANETs, and can be a decisive performance metric for VANETs. This dissertation presents a complete analytical model to evaluate the end-to-end delay against the transmission range and the packet arrival rate. This model illustrates a significant end-to-end delay increase from non-saturated networks to saturated networks. It hence suggests that the distributed power control and admission control protocols for VANETs should aim at improving the real-time capacity (the maximum packet generation rate without causing saturation), instead of the delay itself. Based on the above model, it could be determined that adopting uniform transmission range for every vehicle may hinder the delay performance improvement, since it does not allow the coexistence of the short path length and the low interference. Clusters are proposed to configure non-uniform transmission range for the vehicles. Analysis and simulation confirm that such configuration can enhance the real-time capacity. In addition, it provides an improved trade off between the end-to-end delay and the network capacity. A distributed clustering protocol with minimum message overhead is proposed, which achieves low convergence time.

HIGH PERFORMANCE, LOW COST SUBSPACE DECOMPOSITION AND POLYNOMIAL ROOTING FOR REAL TIME DIRECTION OF ARRIVAL ESTIMATION: ANALYSIS AND IMPLEMENTATION

This thesis develops high performance real-time signal processing modules for direction of arrival (DOA) estimation for localization systems. It proposes highly parallel algorithms for performing subspace decomposition and polynomial rooting, which are otherwise traditionally implemented using sequential algorithms. The proposed algorithms address the emerging need for real-time localization for a wide range of applications. As the antenna array size increases, the complexity of signal processing algorithms increases, making it increasingly difficult to satisfy the real-time constraints. This thesis addresses real-time implementation by proposing parallel algorithms, that maintain considerable improvement over traditional algorithms, especially for systems with larger number of antenna array elements. Singular value decomposition (SVD) and polynomial rooting are two computationally complex steps and act as the bottleneck to achieving real-time performance. The proposed algorithms are suitable for implementation on field programmable gated arrays (FPGAs), single instruction multiple data (SIMD) hardware or application specific integrated chips (ASICs), which offer large number of processing elements that can be exploited for parallel processing. The designs proposed in this thesis are modular, easily expandable and easy to implement. Firstly, this thesis proposes a fast converging SVD algorithm. The proposed method reduces the number of iterations it takes to converge to correct singular values, thus achieving closer to real-time performance. A general algorithm and a modular system design are provided making it easy for designers to replicate and extend the design to larger matrix sizes. Moreover, the method is highly parallel, which can be exploited in various hardware platforms mentioned earlier. A fixed point implementation of proposed SVD algorithm is presented. The FPGA design is pipelined to the maximum extent to increase the maximum achievable frequency of operation. The system was developed with the objective of achieving high throughput. Various modern cores available in FPGAs were used to maximize the performance and details of these modules are presented in detail. Finally, a parallel polynomial rooting technique based on Newton’s method applicable exclusively to root-MUSIC polynomials is proposed. Unique characteristics of root-MUSIC polynomial’s complex dynamics were exploited to derive this polynomial rooting method. The technique exhibits parallelism and converges to the desired root within fixed number of iterations, making this suitable for polynomial rooting of large degree polynomials. We believe this is the first time that complex dynamics of root-MUSIC polynomial were analyzed to propose an algorithm. In all, the thesis addresses two major bottlenecks in a direction of arrival estimation system, by providing simple, high throughput, parallel algorithms.

Expected performance of the ATLAS experiment - detector, trigger and physics

A detailed study is presented of the expected performance of the ATLAS detector. The reconstruction of tracks, leptons, photons, missing energy and jets is investigated, together with the performance of b-tagging and the trigger. The physics potential for a variety of interesting physics processes, within the Standard Model and beyond, is examined. The study comprises a series of notes based on simulations of the detector and physics processes, with particular emphasis given to the data expected from the first years of operation of the LHC at CERN.

Performance Evaluation of Material Flow Systems in Discrete Time

Im folgenden Beitrag werden zeitdiskrete analytische Methoden vorgestellt, mit Hilfe derer Informations- und Materialflüsse in logistischen Systemen analysiert und bewertet werden können. Bestehende zeitdiskrete Verfahren sind jedoch auf die Bearbeitung und Weitergabe in immer gleichen Mengen („One Piece Flow“) beschränkt. Vor allem in Materialflusssystemen kommt es, bedingt durch die Zusammenfassung von Aufträgen, durch Transporte und durch Sortiervorgänge, zur Bildung von Batches. Daher wurden analytische Methoden entwickelt, die es ermöglichen, verschiedene Sammelprozesse, Batchankünfte an Ressourcen, Batchbearbeitung und Sortieren von Batches analytisch abzubilden und Leistungskenngrößen zu deren Bewertung zu bestimmen. Die im Rahmen der Entwicklungsarbeiten entstandene Software-Lösung „Logistic Analyzer“ ermöglicht eine einfache Modellierung und Analyse von praktischen Problemen. Der Beitrag schließt mit einem numerischen Beispiel.

Comparison of performance measurement-systems used for order-picking

In consequence of rapidly changing market demands companies are permanently encouraged to review their own processes and structures and to modify them. Being one of these developments, order-picking is involved as part of an intra-logistics system. But to take appropriate actions, system performance and system costs have to be measured permanently. Concerning this the use of performance measurement-systems as further development of traditional systems of key figures is suitable. In this paper various performance measurement-systems are compared and their suitability for an implementation in order-picking systems is estimated. On the basis of the result of the evaluation a first concept of a performance measurement-system for order-picking will be developed by using typical key figures that are mentioned in academic literature. Finally, hints for a necessary detailed implementation and evaluation in practice will be given.

Performance Availability and Anticipatory Change Planning of Intralogistics Systems: A Simulation-Based Approach

In recent years, the ability to respond to real time changes in operations and reconfigurability in equipment are likely to become essential characteristics for next generation intralogistics systems as well as the level of automation, cost effectiveness and maximum throughput. In order to cope with turbulences and the increasing level of dynamic conditions, future intralogistics systems have to feature short reaction times, high flexibility in processes and the ability to adapt to frequent changes. The increasing autonomy and complexity in processes of today’s intralogistics systems requires new and innovative management approaches, which allow a fast response to (un)anticipated events and adaptation to changing environment in order to reduce the negative consequences of these events. The ability of a system to respond effectively a disruption depends more on the decisions taken before the event than those taken during or after. In this context, anticipatory change planning can be a usable approach for managers to make contingency plans for intralogistics systems to deal with the rapidly changing marketplace. This paper proposes a simulation-based decision making framework for the anticipatory change planning of intralogistics systems. This approach includes the quantitative assessments based on the simulation in defined scenarios as well as the analysis of performance availability that combines the flexibility corridors of different performance dimensions. The implementation of the approach is illustrated on a new intralogistics technology called the Cellular Transport System.

SLA-Driven Simulation of Multi-Tenant Scalable Cloud-Distributed Enterprise Information Systems

Cloud Computing is an enabler for delivering large-scale, distributed enterprise applications with strict requirements in terms of performance. It is often the case that such applications have complex scaling and Service Level Agreement (SLA) management requirements. In this paper we present a simulation approach for validating and comparing SLA-aware scaling policies using the CloudSim simulator, using data from an actual Distributed Enterprise Information System (dEIS). We extend CloudSim with concurrent and multi-tenant task simulation capabilities. We then show how different scaling policies can be used for simulating multiple dEIS applications. We present multiple experiments depicting the impact of VM scaling on both datacenter energy consumption and dEIS performance indicators.

Growth Codes: Intermediate Performance Analysis and Application to Video

Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared to other Rateless and conventional channel codes, Growth codes show improved intermediate performance which is particularly useful in applications where partial data presents some utility. In this paper, we investigate the asymptotic performance of Growth codes using the Wormald method, which was proposed for studying the Peeling Decoder of LDPC and LDGM codes. Compared to previous works, the Wormald differential equations are set on nodes' perspective which enables a numerical solution to the computation of the expected asymptotic decoding performance of Growth codes. Our framework is appropriate for any class of Rateless codes that does not include a precoding step. We further study the performance of Growth codes with moderate and large size codeblocks through simulations and we use the generalized logistic function to model the decoding probability. We then exploit the decoding probability model in an illustrative application of Growth codes to error resilient video transmission. The video transmission problem is cast as a joint source and channel rate allocation problem that is shown to be convex with respect to the channel rate. This illustrative application permits to highlight the main advantage of Growth codes, namely improved performance in the intermediate loss region.