Contrast-enhanced ultrasound identifies early extrahepatic collateral contributing to residual hepatocellular tumor viability after transarterial chemoembolization.

The mainstay of treatment for unresectable hepatocellular carcinoma is locoregional therapy including percutaneous ablation and transarterial chemo- and radioembolization. While monitoring for tumor response after transarterial chemoembolization is crucial, current imaging strategies are suboptimal. The standard of care is contrast-enhanced magnetic resonance imaging or computed tomography imaging performed at least 4 to 6 weeks after therapy. We present a case in which contrast-enhanced ultrasound identified a specific extra-hepatic collateral from the gastroduodenal artery supplying residual viable tumor and assisting with directed transarterial management

Glimmers: Resolving the Privacy/Trust Quagmire

Many successful services rely on trustworthy contributions from users. To establish that trust, such services often require access to privacy-sensitive information from users, thus creating a conflict between privacy and trust. Although it is likely impractical to expect both absolute privacy and trustworthiness at the same time, we argue that the current state of things, where individual privacy is usually sacrificed at the altar of trustworthy services, can be improved with a pragmatic $Glimmer$ $of$ $Trust$, which allows services to validate user contributions in a trustworthy way without forfeiting user privacy. We describe how trustworthy hardware such as Intel's SGX can be used client-side -- in contrast to much recent work exploring SGX in cloud services -- to realize the Glimmer architecture, and demonstrate how this realization is able to resolve the tension between privacy and trust in a variety of cases

On Compact Routing for the Internet

While there exist compact routing schemes designed for grids, trees, and Internet-like topologies that offer routing tables of sizes that scale logarithmically with the network size, we demonstrate in this paper that in view of recent results in compact routing research, such logarithmic scaling on Internet-like topologies is fundamentally impossible in the presence of topology dynamics or topology-independent (flat) addressing. We use analytic arguments to show that the number of routing control messages per topology change cannot scale better than linearly on Internet-like topologies. We also employ simulations to confirm that logarithmic routing table size scaling gets broken by topology-independent addressing, a cornerstone of popular locator-identifier split proposals aiming at improving routing scaling in the presence of network topology dynamics or host mobility. These pessimistic findings lead us to the conclusion that a fundamental re-examination of assumptions behind routing models and abstractions is needed in order to find a routing architecture that would be able to scale ``indefinitely.''Comment: This is a significantly revised, journal version of cs/050802

As-Soon-As-Possible Top-k Query Processing in P2P Systems

International audienceTop-k query processing techniques provide two main advantages for unstructured peer-to-peer (P2P) systems. First they avoid overwhelming users with too many results. Second they reduce significantly network resources consumption. However, existing approaches suffer from long waiting times. This is because top-k results are returned only when all queried peers have finished processing the query. As a result, query response time is dominated by the slowest queried peer. In this paper, we address this users' waiting time problem. For this, we revisit top-k query processing in P2P systems by introducing two novel notions in addition to response time: the stabilization time and the cumulative quality gap. Using these notions, we formally define the as-soonas-possible (ASAP) top-k processing problem. Then, we propose a family of algorithms called ASAP to deal with this problem. We validate our solution through implementation and extensive experimentation. The results show that ASAP significantly outperforms baseline algorithms by returning final top-k result to users in much better times

Enabling High-Level Application Development in the Internet of Things

International audienceThe sensor networking field is evolving into the Internet of Things~(IoT), owing in large part to the increased availability of consumer sensing devices, including modern smart phones. However, application development in the IoT still remains challenging, since it involves dealing with several related issues, such as lack of proper identification of roles of various stakeholders, as well as lack of suitable (high-level) abstractions to address the large scale and heterogeneity in IoT systems. Although the software engineering community has proposed several approaches to address the above in the general case, existing approaches for IoT application development only cover limited subsets of above mentioned challenges. In this paper, we propose a multi-stage model-driven approach for IoT application development based on a precise definition of the role to be played by each stakeholder involved in the process -- domain expert, application designer, application developer, device developer, and network manager. The abstractions provided to each stakeholder are further customized using the inputs provided in the earlier stages by other stakeholders. We have also implemented code-generation and task-mapping techniques to support our approach. Our initial evaluation based on two realistic scenarios shows that the use of our techniques/framework succeeds in improving productivity in the IoT application development process

Advances in Modern Clinical Ultrasound

Advances in modern clinical ultrasound include developments in ultrasound signal processing, imaging techniques and clinical applications. Improvements in ultrasound processing include contrast and high-fidelity ultrasound imaging to expand B-mode imaging and microvascular (or microluminal) discrimination. Similarly, volumetric sonography, automated or intelligent ultrasound, and fusion imaging developed from the innate limitations of planar ultrasound, including user-operator technical dependencies and complex anatomic spatial prerequisites. Additionally, ultrasound techniques and instrumentation have evolved towards expanding access amongst clinicians and patients. To that end, portability of ultrasound systems has become paramount. This has afforded growth into the point-of-care ultrasound and remote or tele-ultrasound arenas. In parallel, advanced applications of ultrasound imaging have arisen. These include high frequency superficial sonograms to diagnose dermatologic pathologies as well as various intra-cavitary or lesional interrogations by contrast-enhanced ultrasound. Properties such as real­time definition and ease-of-access have spumed procedural and interventional applications for vascular access. This narrative review provides an overview of these advances and potential future directions of ultrasound

Interference Alignment and Cancellation

The throughput of existing MIMO LANs is limited by the number of antennas on the AP. This paper shows how to overcome this limit. It presents interference alignment and cancellation (IAC), a new approach for decoding concurrent sender-receiver pairs in MIMO networks. IAC synthesizes two signal processing techniques, interference alignment and interference cancellation, showing that the combination applies to scenarios where neither interference alignment nor cancellation applies alone. We show analytically that IAC almost doubles the throughput of MIMO LANs. We also implement IAC in GNU-Radio, and experimentally demonstrate that for 2x2 MIMO LANs, IAC increases the average throughput by 1.5x on the downlink and 2x on the uplink.United States. Defense Advanced Research Projects Agency. Information Theory for Mobile Ad-Hoc Networks Progra

An Atypical Case of Hepatitis B-Associated Vasculitis

One of the many extra-hepatic manifestations of hepatitis B virus (HBV) infections is vasculitis. While the classic HBV-associated vasculitis is polyarteritis nodosa, other vasculitides have been reported. The authors present an atypical case of acute HBV-associated vasculitis in a 57-year-old male with tobacco use disorder, characterised by extremity ischaemia, gangrene, splenic infarction, and positive proteinase-3 antibodies without sinopulmonary, gastrointestinal, or renal disease. The aggressiveness of the patient’s disease necessitated pulse-dose corticosteroids, cyclophosphamide, and two courses of plasmapheresis, and ultimately required multiple amputations of fingers and toes

Wiselib: A Generic Algorithm Library for Heterogeneous Sensor Networks

One unfortunate consequence of the success story of wireless sensor networks (WSNs) in separate research communities is an ever-growing gap between theory and practice. Even though there is a increasing number of algorithmic methods for WSNs, the vast majority has never been tried in practice; conversely, many practical challenges are still awaiting efficient algorithmic solutions. The main cause for this discrepancy is the fact that programming sensor nodes still happens at a very technical level. We remedy the situation by introducing Wiselib, our algorithm library that allows for simple implementations of algorithms onto a large variety of hardware and software. This is achieved by employing advanced C++ techniques such as templates and inline functions, allowing to write generic code that is resolved and bound at compile time, resulting in virtually no memory or computation overhead at run time. The Wiselib runs on different host operating systems, such as Contiki, iSense OS, and ScatterWeb. Furthermore, it runs on virtual nodes simulated by Shawn. For any algorithm, the Wiselib provides data structures that suit the specific properties of the target platform. Algorithm code does not contain any platform-specific specializations, allowing a single implementation to run natively on heterogeneous networks. In this paper, we describe the building blocks of the Wiselib, and analyze the overhead. We demonstrate the effectiveness of our approach by showing how routing algorithms can be implemented. We also report on results from experiments with real sensor-node hardware.Comment: 16 pages, 1 figure, 7 tables. Appears in European Conference on Wireless Sensor Networks (EWSN 2010