Search

The efficacy of supervised deep learning in medical image analyses, particularly in pathology, is hindered by the necessity for extensive manual annotations. Annotating images at the gigapixel level manually proves to be a highly labor-intensive and time-consuming task. Semi-supervised learning (SSL) has emerged as a promising approach that leverages unlabeled data to reduce labeling efforts. In this work, we introduce Semi-Path, a practical SSL framework enhanced with active learning (AL) for gigapixel pathology tasks. Unlike existing methods that treat SSL and AL as independent components where AL incurs significant computational complexity to SSL, we propose a deep fusion of SSL and AL into a unified framework. Our framework introduces Informative Active Annotation (IAA) that employs a SSL-AL iterative structure to effectively extract knowledge from unlabeled pathology data. This structure significantly minimizes labeling efforts and computational complexity. Then, we propose Adaptive Pseudo-Labeling (APL) to address heterogeneity in class distribution, and prediction difficulty that are often observed in real-world pathology tasks. We evaluate Semi-Path on pathology image classification and segmentation tasks over three datasets that include WSIs from breast, colorectal, and brain tissues. The experimental results demonstrate the consistent superiority of Semi-Path over state-of-the-art methods.

Dicrotic Notch (DN), one of the most significant and indicative features of the arterial blood pressure (ABP) waveform, becomes less pronounced and thus harder to identify as a matter of aging and pathological vascular stiffness. Generalizable and automatic DN identification for such edge cases is even more challenging in the presence of unexpected ABP waveform deformations that happen due to internal and external noise sources or pathological conditions that cause hemodynamic instability. We propose a physics-aware approach, named Physiowise (PW), that first employs a cardiovascular model to augment the original ABP waveform and reduce unexpected deformations, then apply a set of predefined rules on the augmented signal to find DN locations. We have tested the proposed method on in-vivo data gathered from 14 pigs under hemorrhage and sepsis study. Our result indicates 52% overall mean error improvement with 16% higher detection accuracy within the lowest permitted error range of 30ms. An additional hybrid methodology is also proposed to allow combining augmentation with any application-specific user-defined rule set.

As neurodegenerative disease pathological hallmarks have been reported in both grey matter (GM) and white matter (WM) with different density distributions, automating the segmentation process of GM/WM would be extremely advantageous for aiding in neuropathologic deep phenotyping. Standard segmentation methods typically involve manual annotations, where a trained researcher traces the delineation of GM/WM in ultra-high-resolution Whole Slide Images (WSIs). This method can be time-consuming and subjective, preventing a scalable analysis on pathology images. This paper proposes an automated segmentation pipeline (BrainSec) combining a Convolutional Neural Network (CNN) module for segmenting GM/WM regions and a post-processing module to remove artifacts/residues of tissues. The final output generates XML annotations that can be visualized via Aperio ImageScope. First, we investigate two baseline models for medical image segmentation: FCN, and U-Net. Then we propose a patch-based approach, BrainSec, to classify the GM/WM/background regions. We demonstrate BrainSec is robust and has reliable performance by testing it on over 180 WSIs that incorporate numerous unique cases as well as distinct neuroanatomic brain regions. We also apply gradient-weighted class activation mapping (Grad-CAM) to interpret the segmentation masks and provide relevant explanations and insights. In addition, we have integrated BrainSec with an existing Amyloid-β pathology classification model into a unified framework (without incurring significant computation complexity) to identify pathologies, visualize their distributions, and quantify each type of pathologies in segmented GM/WM regions, respectively.

In this paper, we propose an intelligent framework for Traffic Matrix (TM) inference in Software Defined Networks (SDN) where the Ternary Content Addressable Memory (TCAM) entries of switches are partitioned into two parts to: 1) effectively aggregate part of incoming flows for aggregate measurements, and 2) de-aggregate and directly measure the most informative flows for per-flow measurements. These measurements are then processed to effectively estimate the size of network flows. Under hard resource constraints of limited TCAM sizes, we show how to design the optimal and efficient-compressed flow aggregation matrices. We propose an optimal Multi-Armed Bandit (MAB) based algorithm to adaptively measure the most rewarding flows. We evaluate the performance of our framework using real traffic traces from different network environments and by considering two main applications: TM estimation and Heavy Hitter (HH) detection. Moreover, we have implemented a prototype of our framework in Mininet to demonstrate its effectiveness.

With the attractive feature of guaranteeing maximum network throughput, backpressure routing has been widely used in wireless communication networks. Motivated by the backpressure routing, in this paper, we propose a delay-based traffic signal control algorithm in transportation networks. We prove that this delay-based control achieves optimal throughput performance, same as the queue-based traffic signal control in the literature. However, a vehicle at a lane whose queue length remains very small may be excessively delayed under the queue-based signal control. Our delay-based backpressure control can deal with the excessive delays and achieve better fairness with respect to delay while still guaranteeing throughput optimality. Moreover, a general weighted control scheme combining the queue-based and delay-based schemes is also investigated, to provide a more flexible control according to the quality of service requirements. Numerical results explore their performance under both homogeneous and heterogeneous traffic scenarios.

A key requirement for network management is the accurate and reliable monitoring of relevant network characteristics. In today's large-scale networks, this is a challenging task due to the scarcity of network measurement resources and the hard constraints that this imposes. This paper proposes a new framework, called SNIPER, which leverages the flexibility provided by Software-Defined Networking (SDN) to design the optimal observation or measurement matrix that can lead to the best achievable estimation accuracy using Matrix Completion (MC) techniques. To cope with the complexity of designing large-scale optimal observation matrices, we use the Evolutionary Optimization Algorithms (EOA) which directly target the ultimate estimation accuracy as the optimization objective function. We evaluate the performance of SNIPER using both synthetic and real network measurement traces from different network topologies and by considering two main applications for per-flow size and delay estimations. Our results show that SNIPER can be applied to a variety of network performance measurements under hard resource constraints. For example, by measuring only 8.8% of all per-flow path delays in Harvard network [1], congested paths can be detected with probability of 0.94. To demonstrate the feasibility of our framework, we also have implemented a prototype of SNIPER in Mininet.

In real traffic networks, travellers’ route choice is affected by traffic control strategies. In this research, we capture the interaction between travellers’ route choice and traffic signal control in a coherent framework. For travellers’ route choice, a VANET (Vehicular Ad hoc NETwork) is considered, where travellers have access to the real-time traffic information through V2V/V2I (Vehicle to Vehicle/Vehicle to Infrastructure) infrastructures and make route choice decisions at each intersection using hyper-path trees. We test our algorithm and control strategy by simulation in OmNet++ (A network communication simulator) and SUMO (Simulation of Urban MObility) under several scenarios. The simulation results show that with the proposed dynamic routing, the overall travel cost significantly decreases. It is also shown that the proposed adaptive signal control reduces the average delay effectively, as well as reduces the fluctuation of the average speed within the whole network.

The rise of location-based services has enabled many opportunities for content service providers to optimize the content delivery to user's wireless devices based on her location. Since the sharing precise location remains a major privacy concern among the users, certain location-based services rely on contextual location (e.g. residence, work, etc.) as opposed to acquiring user's exact physical location. In this paper, we present PACL (Privacy-Aware Contextual Localizer) model, which can learn user's contextual location just by passively monitoring user's network traffic. PACL can discern a set of vital attributes (statistical and application-based) from user's network traffic, and predict user's contextual location with a very high accuracy. We design and evaluate PACL using real-world network traces of over 1700 users with over 100GB of total data. Our results show that PACL, when built using the Bayesian Network machine learning algorithm, can predict user's contextual location with the accuracy of around 89%.

Autonomous vehicles capable of navigating unpredictable real-world environments with little human feedback are a reality today. Such systems rely heavily on onboard sensors such as cameras, radar/LIDAR, and GPS as well as capabilities such as 3G/4G connectivity and V2V/V2I communication to make real-time maneuvering decisions. Autonomous vehicle control imposes very strict requirements on the security of the communication channels used by the vehicle to exchange information as well as the control logic that performs complex driving tasks such as adapting vehicle velocity or changing lanes. This study presents a first look at the effects of security attacks on the communication channel as well as sensor tampering of a connected vehicle stream equipped to achieve CACC. Our simulation results show that an insider attack can cause significant instability in the CACC vehicle stream. We also illustrate how different countermeasures, such as downgrading to ACC mode, could potentially be used to improve the security and safety of the connected vehicle streams.

In this paper, we present RED-BL (Relocate Energy Demand to Better Locations), a framework to minimize the electricity cost for operating data center networks over consecutive intervals of fixed duration. Within each interval, RED-BL provides a mapping of workload to a set of geographically distributed data centers. To this end, RED-BL uses the geographical and temporal variations in electricity prices as exhibited by electrical energy markets. In addition, we incorporate the transition costs associated with a change in workload mapping from one interval to the next, over a planning window comprising multiple such intervals. This results in a sequence of workload mappings that is optimal over the entire planning window, even though the workload mapping in a given interval may not be locally optimal. Our evaluation of RED-BL uses electricity prices from the US markets and workload traces from live Internet applications with millions of users. We find that RED-BL can reduce the electric bill by as much as 45% compared to the case when the workload is uniformly distributed. When compared to existing workload relocation solutions, for a wide range of data center deployment sizes, RED-BL achieves electricity cost savings that are 8.28% higher, on average. This seemingly modest reduction can save millions of dollars for the operators. The cost of this saving is an inexpensive computation at the start of each planning window. © 2014 Elsevier B.V. All rights reserved.

Cloud-computing services are provided to consumers through a network of servers and network equipment. Cloud-network (CN) providers virtualize resources [e.g., virtual machine (VM) and virtual network (VN)] for efficient and secure resource allocation. Disasters are one of the worst threats for CNs as they can causemassive disruptions andCN disconnection. A disaster may also induce post-disaster correlated, cascading failures which can disconnect more CNs. Survivable virtual-network embedding (SVNE) approaches have been studied to protect VNs against single physicallink/- node and dual physical-link failures in communication infrastructure, but massive disruptions due to a disaster and their consequences can make SVNE approaches insufficient to guarantee cloud-computing survivability. In this work, we study the problem of survivable CN mapping from disaster. We consider risk assessment, VM backup location, and post-disaster survivability to reduce the risk of failure and probability of CN disconnection and the penalty paid by operators due to loss of capacity.We formulate the proposed approach as an integer linear program and study two scenarios: a natural disaster, e.g., earthquake and a human-made disaster, e.g., weapons-of-mass-destruction attack. Our illustrative examples show that our approach reduces the risk of CN disconnection and penalty up to 90% compared with a baseline CNmapping approach and increases the CN survivability up to 100% in both scenarios. © 2014 Springer Science+Business Media New York.

Fine-grained traffic flow measurement, which provides useful information for network management tasks and security analysis, can be challenging to obtain due to monitoring resource constraints. The alternate approach of inferring flow statistics from partial measurement data has to be robust against dynamic temporal/spatial fluctuations of network traffic. In this paper, we propose an intelligent Traffic (de)Aggregation and Measurement Paradigm (iSTAMP), which partitions TCAM entries of switches/routers into two parts to: 1) optimally aggregate part of incoming flows for aggregate measurements, and 2) de-aggregate and directly measure the most informative flows for per-flow measurements. iSTAMP then processes these aggregate and per-flow measurements to effectively estimate network flows using a variety of optimization techniques. With the advent of Software-Defined-Networking (SDN), such real-time rule (re)configuration can be achieved via OpenFlow or other similar SDN APIs. We first show how to design the optimal aggregation matrix for minimizing the flow-size estimation error. Moreover, we propose a method for designing an efficient-compressive flow aggregation matrix under hard resource constraints of limited TCAM sizes. In addition, we propose an intelligent Multi-Armed Bandit based algorithm to adaptively sample the most 'rewarding' flows, whose accurate measurements have the highest impact on the overall flow measurement and estimation performance. We evaluate the performance of iSTAMP using real traffic traces from a variety of network environments and by considering two applications: traffic matrix estimation and heavy hitter detection. Also, we have implemented a prototype of iSTAMP and demonstrated its feasibility and effectiveness in Mininet environment. © 2014 IEEE.

In this paper, we propose to use vehicular ad hoc networks (VANETs) to collect and aggregate real-time speed and position information on individual vehicles to optimize signal control at traffic intersections. We first formulate the vehicular traffic signal control problem as a job scheduling problem on processors, with jobs corresponding to platoons of vehicles. Under the assumption that all jobs are of equal size, we give an online algorithm, referred to as the oldest job first (OJF) algorithm, to minimize the delay across the intersection. We prove that the OJF algorithm is 2-competitive, implying that the delay is less than or equal to twice the delay of an optimal offline schedule with perfect knowledge of the arrivals. We then show how a VANET can be used to group vehicles into approximately equal-sized platoons, which can then be scheduled using OJF. We call this the two-phase approach, where we first group the vehicular traffic into platoons and then apply the OJF algorithm, i.e., the oldest arrival first (OAF) algorithm. Our simulation results show that, under light and medium traffic loads, the OAF algorithm reduces the delays experienced by vehicles as they pass through the intersection, as compared with vehicle-actuated methods, Webster's method, and pretimed signal control methods. Under heavy vehicular traffic load, the OAF algorithm performs the same as the vehicle-actuated traffic method but still produces lower delays, as when compared with Webster's method and the pretimed signal control method. © 2012 IEEE.