CD38 expression level and pattern of expression remains a reliable and robust marker of progressive disease in chronic lymphocytic leukemia

Chronic lymphocytic leukemia (CLL) follows a variable clinical course which is difficult to predict at diagnosis. We assessed somatic mutation (SHM) status, CD38 and ZAP-70 expression in 87 patients (49 male, 38 female) with stage A CLL and known cytogenetic profile to compare their role in predicting disease progression, which was assessed by the treatment free interval (TFI) from diagnosis. Sixty (69%) patients were SHM+, 24 (28%) were CD38+ and ten (12%) were ZAP-70+. The median TFI for: (i) SHM + versus SHM- patients was 124 versus 26 months; hazard ratio (HR) = 3.6 [95% confidence interval (CI) = 1.8 - 7.3; P = 0.001]: (ii) CD38- versus CD38+ patients was 120 versus 34 months; HR = 2.4 (95% CI = 1.4 - 5.3; P = 0.02); and (iii) ZAP70- versus ZAP70+ was 120 versus 16 months; HR = 3.4 (95% CI = 1.4 - 8.7; P = 0.01). SHM status and CD38 retained prognostic significance on multivariate analysis whereas ZAP-70 did not. We conclude that ZAP-70 analysis does not provide additional prognostic information in this group of patients.

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks

Motivated by the need for designing efficient and robust fully-distributed computation in highly dynamic networks such as Peer-to-Peer (P2P) networks, we study distributed protocols for constructing and maintaining dynamic network topologies with good expansion properties. Our goal is to maintain a sparse (bounded degree) expander topology despite heavy {\em churn} (i.e., nodes joining and leaving the network continuously over time). We assume that the churn is controlled by an adversary that has complete knowledge and control of what nodes join and leave and at what time and has unlimited computational power, but is oblivious to the random choices made by the algorithm. Our main contribution is a randomized distributed protocol that guarantees with high probability the maintenance of a {\em constant} degree graph with {\em high expansion} even under {\em continuous high adversarial} churn. Our protocol can tolerate a churn rate of up to $O(n/\poly\log(n))$ per round (where $n$ is the stable network size). Our protocol is efficient, lightweight, and scalable, and it incurs only $O(\poly\log(n))$ overhead for topology maintenance: only polylogarithmic (in $n$) bits needs to be processed and sent by each node per round and any node's computation cost per round is also polylogarithmic. The given protocol is a fundamental ingredient that is needed for the design of efficient fully-distributed algorithms for solving fundamental distributed computing problems such as agreement, leader election, search, and storage in highly dynamic P2P networks and enables fast and scalable algorithms for these problems that can tolerate a large amount of churn.

Ultra-Compact and Robust FPGA-Based PUF Identification Generator

Physically Unclonable Functions (PUFs), exploit inherent manufacturing variations and present a promising solution for hardware security. They can be used for key storage, authentication and ID generations. Low power cryptographic design is also very important for security applications. However, research to date on digital PUF designs, such as Arbiter PUFs and RO PUFs, is not very efficient. These PUF designs are difficult to implement on Field Programmable Gate Arrays (FPGAs) or consume many FPGA hardware resources. In previous work, a new and efficient PUF identification generator was presented for FPGA. The PUF identification generator is designed to fit in a single slice per response bit by using a 1-bit PUF identification generator cell formed as a hard-macro. In this work, we propose an ultra-compact PUF identification generator design. It is implemented on ten low-cost Xilinx Spartan-6 FPGA LX9 microboards. The resource utilization is only 2.23%, which, to the best of the authors' knowledge, is the most compact and robust FPGA-based PUF identification generator design reported to date. This PUF identification generator delivers a stable range of uniqueness of around 50% and good reliability between 85% and 100%.

An efficient and robust case sorting for algorithm for transient stability assessment

An efficient and robust case sorting algorithm based on Extended Equal Area Criterion (EEAC) is proposed in this paper for power system transient stability assessment (TSA). The time-varying degree of an equivalent image system can be deduced by comparing the analysis results of Static EEAC (SEEAC) and Dynamic EEAC (DEEAC), the former of which neglects all time-varying factors while the latter partially considers the time-varying factors. Case sorting rules according to their transient stability severity are set combining the time-varying degree and fault messages. Then a case sorting algorithm is designed with the “OR” logic among multiple rules, based on which each case can be identified into one of the following five categories, namely stable, suspected stable, marginal, suspected unstable and unstable. The performance of this algorithm is verified by studying 1652 contingency cases from 9 real Chinese provincial power systems under various operating conditions. It is shown that desirable classification accuracy can be achieved for all the contingency cases at the cost of very little extra computational burden and only 9.81% of the whole cases need to carry out further detailed calculation in rigorous on-line TSA conditions.

Design and deployment of secure, robust, and resilient SDN Controllers

The scale of the Software-Defined Network (SDN) Controller design problem has become apparent with the expansion of SDN deployments. Initial SDN deployments were small-scale, single controller environments for research and usecase testing. Today, enterprise deployments requiring multiple controllers are gathering momentum e.g. Google’s backbone network, Microsoft’s public cloud, and NTT’s edge gateway. Third-party applications are also becoming available e.g. HP SDN App Store. The increase in components and interfaces for the evolved SDN implementation increases the security challenges of the SDN controller design. In this work, the requirements of a secure, robust, and resilient SDN controller are identified, stateof-the-art open-source SDN controllers are analyzed with respect to the security of their design, and recommendations for security improvements are provided. This contribution highlights the gap between the potential security solutions for SDN controllers and the actual security level of current controller designs.

Three-dimensional porous carbon nanofiber networks decorated with cobalt-based nanoparticles: A robust electrocatalyst for efficient water oxidation

Electrochemical water splitting used for generating hydrogen has attracted increasingly attention due to energy and environmental issues. It is a major challenge to design an efficient, robust and inexpensive electrocatalyst to achieve preferable catalytic performance. Herein, a novel three-dimensional (3D) electrocatalyst was prepared by decorating nanostructured biological material-derived carbon nanofibers with in situ generated cobalt-based nanospheres (denoted as CNF@Co) through a facile approach. The interconnected porous 3D networks of the resulting CNF@Co catalyst provide abundant channels and interfaces, which remarkably favor both mass transfer and oxygen evolution. The as-prepared CNF@Co shows excellent electrocatalytic activity towards the oxygen evolution reactions with an onset potential of about 0.445 V vs. Ag/AgCl. It only needs a low overpotential of 314 mV to achieve a current density of 10 mA/cm² in 1.0 M KOH. Furthermore, the CNF@Co catalyst exhibits excellent stability towards water oxidation, even outperforming commercial IrO<inf>2</inf> and RuO<inf>2</inf> catalysts.

Largest Matching Areas for Illumination and Occlusion Robust Face Recognition

In this paper, we introduce a novel approach to face recognition which simultaneously tackles three combined challenges: 1) uneven illumination; 2) partial occlusion; and 3) limited training data. The new approach performs lighting normalization, occlusion de-emphasis and finally face recognition, based on finding the largest matching area (LMA) at each point on the face, as opposed to traditional fixed-size local area-based approaches. Robustness is achieved with novel approaches for feature extraction, LMA-based face image comparison and unseen data modeling. On the extended YaleB and AR face databases for face identification, our method using only a single training image per person, outperforms other methods using a single training image, and matches or exceeds methods which require multiple training images. On the labeled faces in the wild face verification database, our method outperforms comparable unsupervised methods. We also show that the new method performs competitively even when the training images are corrupted.

Robust implantable antenna for in-body communications

A compact implantable printed meandered folded dipole antenna with a volume of 101.8 mm3 and robust performance is presented for operation in the 2.4 GHz medical ISM bands. The implant antenna is shown to maintain its return loss performance in the 2360???2400 MHz, 2400???2483.5 MHz and 2483.5???2500 MHz frequency bands, simulated in eleven different body tissue types with a broad range of electrical properties. Bandwidth and resonant frequency changes are reported for the same antenna implanted in high water content tissues such as muscle and skin as well as low water content tissues such as subcutaneous fat and bone. The antenna was also shown to maintain its return loss performance as it was moved towards a tissue boundary within a simulated phantom testbed.

Immunohistochemistry should undergo robust validation equivalent to that of molecular diagnostics

Immunohistochemistry (IHC) is a widely available and highly utilised tool in diagnostic histopathology and is used to guide treatment options as well as provide prognostic information. IHC is subjected to qualitative and subjective assessment, which has been criticised for a lack of stringency, while PCR-based molecular diagnostic validations by comparison are regarded as very rigorous. It is essential that IHC tests are validated through evidence-based procedures. With the move to ISO15189 (2012), not just of the accuracy, specificity and reproducibility of each test need to be determined and managed, but also the degree of uncertainty and the delivery of such tests. The recent update to ISO 15189 (2012) states that it is appropriate to consider the potential uncertainty of measurement of the value obtained in the laboratory and how that may impact on prognostic or predictive thresholds. In order to highlight the problems surrounding IHC validity, we reviewed the measurement of Ki67and p53 in the literature. Both of these biomarkers have been incorporated into clinical care by pathology laboratories worldwide. The variation seen appears excessive even when measuring centrally stained slides from the same cases. We therefore propose in this paper to establish the basis on which IHC laboratories can bring the same level of robust validation seen in the molecular pathology laboratories and the principles applied to all routine IHC tests.

Robust Room Temperature Hysteresis in an FeIII Spin Crossover Metallomesogen

The high temperature magnetic and structural properties of an amphiphilic iron(III) spin crossover complex are reported. Thermal cycling reveals a scan rate-dependent 20 K thermal hysteresis in the mT vs. T data close to room temperature. A fast scan rate is essential for the hysteresis but it is robust and reproducible after multiple thermal cycles. Differential scanning calorimetry and cross polarized microscopy are used to show that the magnetic switching aligns with a material state change from solid to ordered liquid phase on warming.