Two-Dimensional Manganese(II) Coordination Polymer Based on Phthalate and Pyrazine Bridges Exhibiting Antiferromagnetic Porperties

Benzodifuran-functionalised pyrene and anthracene fluorophores 1 and 2 were obtained in reasonable yields. Their single crystal structures, electrochemical, optical absorption, and fluorescence characteristics have been described. They show strong luminescence with high quantum yields of 0.53 for 1 and 0.48 for 2. Magnetic measurements for the 2D coordination polymer [Mn(Pht(Pyz(H2O)2]n (1), in which metal centres are linked together by pyrazine (Pyz) and 1,6-bridging o-phthalate ligand (Pht2-), revealed antiferromagnetic interactions between Mn(II) ions.

ARIS-Campaign: Intercomparison of three ground based 22 GHz radiometers for middle atmospheric water vapor at the Zugspitze in winter 2009

This paper presents the Alpine Radiometer Intercomparison at the Schneefernerhaus (ARIS), which took place in winter 2009 at the high altitude station at the Zugspitze, Germany (47.42° N, 10.98° E, 2650 m). This campaign was the first direct intercomparison between three new ground based 22 GHz water vapor radiometers for middle atmospheric profiling with the following instruments participating: MIRA 5 (Karlsruhe Institute of Technology), cWASPAM3 (Max Planck Institute for Solar System Research, Katlenburg-Lindau) and MIAWARA-C (Institute of Applied Physics, University of Bern). Even though the three radiometers all measure middle atmospheric water vapor using the same rotational transition line and similar fundamental set-ups, there are major differences between the front ends, the back ends, the calibration concepts and the profile retrieval. The spectrum comparison shows that all three radiometers measure spectra without severe baseline artifacts and that the measurements are in good general agreement. The measurement noise shows good agreement to the values theoretically expected from the radiometer noise formula. At the same time the comparison of the noise levels shows that there is room for instrumental and calibration improvement, emphasizing the importance of low elevation angles for the observation, a low receiver noise temperature and an efficient calibration scheme. The comparisons of the retrieved profiles show that the agreement between the profiles of MIAWARA-C and cWASPAM3 with the ones of MLS is better than 0.3 ppmv (6%) at all altitudes. MIRA 5 has a dry bias of approximately 0.5 ppm (8%) below 0.1 hPa with respect to all other instruments. The profiles of cWASPAM3 and MIAWARA-C could not be directly compared because the vertical region of overlap was too small. The comparison of the time series at different altitude levels show a similar evolution of the H2O volume mixing ratio (VMR) for the ground based instruments as well as the space borne sensor MLS.

Graph-Based Multi-Surface Segmentation of OCT Data Using Trained Hard and Soft Constraints

Optical coherence tomography (OCT) is a well-established image modality in ophthalmology and used daily in the clinic. Automatic evaluation of such datasets requires an accurate segmentation of the retinal cell layers. However, due to the naturally low signal to noise ratio and the resulting bad image quality, this task remains challenging. We propose an automatic graph-based multi-surface segmentation algorithm that internally uses soft constraints to add prior information from a learned model. This improves the accuracy of the segmentation and increase the robustness to noise. Furthermore, we show that the graph size can be greatly reduced by applying a smart segmentation scheme. This allows the segmentation to be computed in seconds instead of minutes, without deteriorating the segmentation accuracy, making it ideal for a clinical setup. An extensive evaluation on 20 OCT datasets of healthy eyes was performed and showed a mean unsigned segmentation error of 3.05 ±0.54 μm over all datasets when compared to the average observer, which is lower than the inter-observer variability. Similar performance was measured for the task of drusen segmentation, demonstrating the usefulness of using soft constraints as a tool to deal with pathologies.

Authentication and Authorisation Mechanisms in support of Secure Access to WMN Resources

Over the past several years, a number of design approaches in wireless mesh networks have been introduced to support the deployment of wireless mesh networks (WMNs). We introduce a novel wireless mesh architecture that supports authentication and authorisation functionalities, giving the possibility of a seamless WMN integration into the home's organization authentication and authorisation infrastructure. First, we introduce a novel authentication and authorisation mechanism for wireless mesh nodes. The mechanism is designed upon an existing federated access control approach, i.e. the AAI infrastructure that is using just the credentials at the user's home organization in a federation. Second, we demonstrate how authentication and authorisation for end users is implemented by using an existing web-based captive portal approach. Finally, we observe the difference between the two and explain in detail the process flow of authorized access to network resources in wireless mesh networks. The goal of our wireless mesh architecture is to enable easy broadband network access to researchers at remote locations, giving them additional advantage of a secure access to their measurements, irrespective of their location. It also provides an important basis for the real-life deployment of wireless mesh networks for the support of environmental research.

Inference on Survival Data with Covariate Measurement Error - An Imputation-based Approach

We propose a new method for fitting proportional hazards models with error-prone covariates. Regression coefficients are estimated by solving an estimating equation that is the average of the partial likelihood scores based on imputed true covariates. For the purpose of imputation, a linear spline model is assumed on the baseline hazard. We discuss consistency and asymptotic normality of the resulting estimators, and propose a stochastic approximation scheme to obtain the estimates. The algorithm is easy to implement, and reduces to the ordinary Cox partial likelihood approach when the measurement error has a degenerative distribution. Simulations indicate high efficiency and robustness. We consider the special case where error-prone replicates are available on the unobserved true covariates. As expected, increasing the number of replicate for the unobserved covariates increases efficiency and reduces bias. We illustrate the practical utility of the proposed method with an Eastern Cooperative Oncology Group clinical trial where a genetic marker, c-myc expression level, is subject to measurement error.

Non-photorealistic rendering of virtual implant models for computer-assisted fluoroscopy-based surgical procedures

Surgical navigation systems visualize the positions and orientations of surgical instruments and implants as graphical overlays onto a medical image of the operated anatomy on a computer monitor. The orthopaedic surgical navigation systems could be categorized according to the image modalities that are used for the visualization of surgical action. In the so-called CT-based systems or 'surgeon-defined anatomy' based systems, where a 3D volume or surface representation of the operated anatomy could be constructed from the preoperatively acquired tomographic data or through intraoperatively digitized anatomy landmarks, a photorealistic rendering of the surgical action has been identified to greatly improve usability of these navigation systems. However, this may not hold true when the virtual representation of surgical instruments and implants is superimposed onto 2D projection images in a fluoroscopy-based navigation system due to the so-called image occlusion problem. Image occlusion occurs when the field of view of the fluoroscopic image is occupied by the virtual representation of surgical implants or instruments. In these situations, the surgeon may miss part of the image details, even if transparency and/or wire-frame rendering is used. In this paper, we propose to use non-photorealistic rendering to overcome this difficulty. Laboratory testing results on foamed plastic bones during various computer-assisted fluoroscopybased surgical procedures including total hip arthroplasty and long bone fracture reduction and osteosynthesis are shown.

Unifying energy minimization and mutual information maximization for robust 2D/3D registration of X-ray and CT images

Similarity measure is one of the main factors that affect the accuracy of intensity-based 2D/3D registration of X-ray fluoroscopy to CT images. Information theory has been used to derive similarity measure for image registration leading to the introduction of mutual information, an accurate similarity measure for multi-modal and mono-modal image registration tasks. However, it is known that the standard mutual information measure only takes intensity values into account without considering spatial information and its robustness is questionable. Previous attempt to incorporate spatial information into mutual information either requires computing the entropy of higher dimensional probability distributions, or is not robust to outliers. In this paper, we show how to incorporate spatial information into mutual information without suffering from these problems. Using a variational approximation derived from the Kullback-Leibler bound, spatial information can be effectively incorporated into mutual information via energy minimization. The resulting similarity measure has a least-squares form and can be effectively minimized by a multi-resolution Levenberg-Marquardt optimizer. Experimental results are presented on datasets of two applications: (a) intra-operative patient pose estimation from a few (e.g. 2) calibrated fluoroscopic images, and (b) post-operative cup alignment estimation from single X-ray radiograph with gonadal shielding.

Precise estimation of postoperative cup alignment from single standard X-ray radiograph with gonadal shielding

This paper addresses the problem of estimating postoperative cup alignment from single standard X-ray radiograph with gonadal shielding. The widely used procedure of evaluation of cup orientation following total hip arthroplasty using single standard anteroposterior radiograph is known inaccurate, largely due to the wide variability in individual pelvic position relative to X-ray plate. 2D-3D image registration methods have been introduced to estimate the rigid transformation between a preoperative CT volume and postoperative radiograph(s) for an accurate estimation of the postoperative cup alignment relative to an anatomical reference extracted from the CT data. However, these methods require either multiple radiographs or a radiograph-specific calibration, both of which are not avaiable for most retrospective studies. Furthermore, these methods were only evaluated on X-ray radiograph(s) without gonadal shielding. In this paper, we propose to use a hybrid 2D-3D registration scheme combining an iterative landmark-to-ray registration with a 2D-3D intensity-based registration to estimate the rigid transfromation for a precise estimation of cup alignment. Quantitative and qualitative results evaluated on clinical and cadaveric datasets are given which indicate the validity of our approach.

Payone : incentive for epidemic protocol-based anonymity system

Anonymity systems maintain the anonymity of communicating nodes by camouflaging them, either with peer nodes generating dummy traffic or with peer nodes participating in the actual communication process. The probability of any adversary breaking down the anonymity of the communicating nodes is inversely proportional to the number of peer nodes participating in the network. Hence to maintain the anonymity of the communicating nodes, a large number of peer nodes are needed. Lack of peer availability weakens the anonymity of any large scale anonymity system. This work proposes PayOne, an incentive based scheme for promoting peer availability. PayOne aims to increase the peer availability by encouraging nodes to participate in the anonymity system by awarding them with incentives and thereby promoting the anonymity strength. Existing incentive schemes are designed for single path based approaches. There is no incentive scheme for multipath based or epidemic based anonymity systems. This work has been specifically designed for epidemic protocols and has been implemented over MuON, one of the latest entries to the area of multicasting based anonymity systems. MuON is a peer-to-peer based anonymity system which uses epidemic protocol for data dissemination. Existing incentive schemes involve paying every intermediate node that is involved in the communication between the initiator and the receiver. These schemes are not appropriate for epidemic based anonymity systems due to the incurred overhead. PayOne differs from the existing schemes because it involves paying a single intermediate node that participates in the network. The intermediate node can be any random node that participates in the communication and does not necessarily need to lie in the communication path between the initiator and the receiver. The light-weight characteristics of PayOne make it viable for large-scale epidemic based anonymity systems.

MARVIN: a medical research application framework based on open source software

This paper describes the open source framework MARVIN for rapid application development in the field of biomedical and clinical research. MARVIN applications consist of modules that can be plugged together in order to provide the functionality required for a specific experimental scenario. Application modules work on a common patient database that is used to store and organize medical data as well as derived data. MARVIN provides a flexible input/output system with support for many file formats including DICOM, various 2D image formats and surface mesh data. Furthermore, it implements an advanced visualization system and interfaces to a wide range of 3D tracking hardware. Since it uses only highly portable libraries, MARVIN applications run on Unix/Linux, Mac OS X and Microsoft Windows.

ANALYSIS AND VISUALIZATION OF FLOW FIELDS USING INFORMATION-THEORETIC TECHNIQUES AND GRAPH-BASED REPRESENTATIONS

Three-dimensional flow visualization plays an essential role in many areas of science and engineering, such as aero- and hydro-dynamical systems which dominate various physical and natural phenomena. For popular methods such as the streamline visualization to be effective, they should capture the underlying flow features while facilitating user observation and understanding of the flow field in a clear manner. My research mainly focuses on the analysis and visualization of flow fields using various techniques, e.g. information-theoretic techniques and graph-based representations. Since the streamline visualization is a popular technique in flow field visualization, how to select good streamlines to capture flow patterns and how to pick good viewpoints to observe flow fields become critical. We treat streamline selection and viewpoint selection as symmetric problems and solve them simultaneously using the dual information channel [81]. To the best of my knowledge, this is the first attempt in flow visualization to combine these two selection problems in a unified approach. This work selects streamline in a view-independent manner and the selected streamlines will not change for all viewpoints. My another work [56] uses an information-theoretic approach to evaluate the importance of each streamline under various sample viewpoints and presents a solution for view-dependent streamline selection that guarantees coherent streamline update when the view changes gradually. When projecting 3D streamlines to 2D images for viewing, occlusion and clutter become inevitable. To address this challenge, we design FlowGraph [57, 58], a novel compound graph representation that organizes field line clusters and spatiotemporal regions hierarchically for occlusion-free and controllable visual exploration. We enable observation and exploration of the relationships among field line clusters, spatiotemporal regions and their interconnection in the transformed space. Most viewpoint selection methods only consider the external viewpoints outside of the flow field. This will not convey a clear observation when the flow field is clutter on the boundary side. Therefore, we propose a new way to explore flow fields by selecting several internal viewpoints around the flow features inside of the flow field and then generating a B-Spline curve path traversing these viewpoints to provide users with closeup views of the flow field for detailed observation of hidden or occluded internal flow features [54]. This work is also extended to deal with unsteady flow fields. Besides flow field visualization, some other topics relevant to visualization also attract my attention. In iGraph [31], we leverage a distributed system along with a tiled display wall to provide users with high-resolution visual analytics of big image and text collections in real time. Developing pedagogical visualization tools forms my other research focus. Since most cryptography algorithms use sophisticated mathematics, it is difficult for beginners to understand both what the algorithm does and how the algorithm does that. Therefore, we develop a set of visualization tools to provide users with an intuitive way to learn and understand these algorithms.

User and Machine Authentication and Authorization Infrastructure for Distributed Wireless Sensor Network Testbeds

The intention of an authentication and authorization infrastructure (AAI) is to simplify and unify access to different web resources. With a single login, a user can access web applications at multiple organizations. The Shibboleth authentication and authorization infrastructure is a standards-based, open source software package for web single sign-on (SSO) across or within organizational boundaries. It allows service providers to make fine-grained authorization decisions for individual access of protected online resources. The Shibboleth system is a widely used AAI, but only supports protection of browser-based web resources. We have implemented a Shibboleth AAI extension to protect web services using Simple Object Access Protocol (SOAP). Besides user authentication for browser-based web resources, this extension also provides user and machine authentication for web service-based resources. Although implemented for a Shibboleth AAI, the architecture can be easily adapted to other AAIs.

Streaming Support for Data Intensive Cloud-Based Sequence Analysis

Cloud computing provides a promising solution to the genomics data deluge problem resulting from the advent of next-generation sequencing (NGS) technology. Based on the concepts of “resources-on-demand” and “pay-as-you-go”, scientists with no or limited infrastructure can have access to scalable and cost-effective computational resources. However, the large size of NGS data causes a significant data transfer latency from the client’s site to the cloud, which presents a bottleneck for using cloud computing services. In this paper, we provide a streaming-based scheme to overcome this problem, where the NGS data is processed while being transferred to the cloud. Our scheme targets the wide class of NGS data analysis tasks, where the NGS sequences can be processed independently from one another. We also provide the elastream package that supports the use of this scheme with individual analysis programs or with workflow systems. Experiments presented in this paper show that our solution mitigates the effect of data transfer latency and saves both time and cost of computation.

A trilocus sequence typing scheme for hospital epidemiology and subspecies differentiation of an important nosocomial pathogen, Enterococcus faecalis.

In this study, we present a trilocus sequence typing (TLST) scheme based on intragenic regions of two antigenic genes, ace and salA (encoding a collagen/laminin adhesin and a cell wall-associated antigen, respectively), and a gene associated with antibiotic resistance, lsa (encoding a putative ABC transporter), for subspecies differentiation of Enterococcus faecalis. Each of the alleles was analyzed using 50 E. faecalis isolates representing 42 diverse multilocus sequence types (ST(M); based on seven housekeeping genes) and four groups of clonally linked (by pulsed-field gel electrophoresis [PFGE]) isolates. The allelic profiles and/or concatenated sequences of the three genes agreed with multilocus sequence typing (MLST) results for typing of 49 of the 50 isolates; in addition to the one exception, two isolates were found to have identical TLST types but were single-locus variants (differing by a single nucleotide) by MLST and were therefore also classified as clonally related by MLST. TLST was also comparable to PFGE for establishing short-term epidemiological relationships, typing all isolates classified as clonally related by PFGE with the same type. TLST was then applied to representative isolates (of each PFGE subtype and isolation year) of a collection of 48 hospital isolates and demonstrated the same relationships between isolates of an outbreak strain as those found by MLST and PFGE. In conclusion, the TLST scheme described here was shown to be successful for investigating short-term epidemiology in a hospital setting and may provide an alternative to MLST for discriminating isolates.

A serial scheme for minimizing the duration of resource-constrained projects within Microsoft Project

Microsoft Project is one of the most-widely used software packages for project management. For the scheduling of resource-constrained projects, the package applies a priority-based procedure using a specific schedule-generation scheme. This procedure performs relatively poorly when compared against other software packages or state-of-the-art methods for resource-constrained project scheduling. In Microsoft Project 2010, it is possible to work with schedules that are infeasible with respect to the precedence or the resource constraints. We propose a novel schedule-generation scheme that makes use of this possibility. Under this scheme, the project tasks are scheduled sequentially while taking into account all temporal and resource constraints that a user can define within Microsoft Project. The scheme can be implemented as a priority-rule based heuristic procedure. Our computational results for two real-world construction projects indicate that this procedure outperforms the built-in procedure of Microsoft Project