DNS-based Internet Client Clustering and Characterization

This paper proposes a novel protocol which uses the Internet Domain Name System (DNS) to partition Web clients into disjoint sets, each of which is associated with a single DNS server. We define an L-DNS cluster to be a grouping of Web Clients that use the same Local DNS server to resolve Internet host names. We identify such clusters in real-time using data obtained from a Web Server in conjunction with that server's Authoritative DNS―both instrumented with an implementation of our clustering algorithm. Using these clusters, we perform measurements from four distinct Internet locations. Our results show that L-DNS clustering enables a better estimation of proximity of a Web Client to a Web Server than previously proposed techniques. Thus, in a Content Distribution Network, a DNS-based scheme that redirects a request from a web client to one of many servers based on the client's name server coordinates (e.g., hops/latency/loss-rates between the client and servers) would perform better with our algorithm.

A Hierarchical Characterization of a Live Streaming Media Workload

We present what we believe to be the first thorough characterization of live streaming media content delivered over the Internet. Our characterization of over five million requests spanning a 28-day period is done at three increasingly granular levels, corresponding to clients, sessions, and transfers. Our findings support two important conclusions. First, we show that the nature of interactions between users and objects is fundamentally different for live versus stored objects. Access to stored objects is user driven, whereas access to live objects is object driven. This reversal of active/passive roles of users and objects leads to interesting dualities. For instance, our analysis underscores a Zipf-like profile for user interest in a given object, which is to be contrasted to the classic Zipf-like popularity of objects for a given user. Also, our analysis reveals that transfer lengths are highly variable and that this variability is due to the stickiness of clients to a particular live object, as opposed to structural (size) properties of objects. Second, based on observations we make, we conjecture that the particular characteristics of live media access workloads are likely to be highly dependent on the nature of the live content being accessed. In our study, this dependence is clear from the strong temporal correlations we observed in the traces, which we attribute to the synchronizing impact of live content on access characteristics. Based on our analyses, we present a model for live media workload generation that incorporates many of our findings, and which we implement in GISMO [19].

Effectiveness of Loss labeling in Improving TCP Performance in Wired/Wireless Networks

The current congestion-oriented design of TCP hinders its ability to perform well in hybrid wireless/wired networks. We propose a new improvement on TCP NewReno (NewReno-FF) using a new loss labeling technique to discriminate wireless from congestion losses. The proposed technique is based on the estimation of average and variance of the round trip time using a filter cal led Flip Flop filter that is augmented with history information. We show the comparative performance of TCP NewReno, NewReno-FF, and TCP Westwood through extensive simulations. We study the fundamental gains and limits using TCP NewReno with varying Loss Labeling accuracy (NewReno-LL) as a benchmark. Lastly our investigation opens up important research directions. First, there is a need for a finer grained classification of losses (even within congestion and wireless losses) for TCP in heterogeneous networks. Second, it is essential to develop an appropriate control strategy for recovery after the correct classification of a packet loss.

Extending snBench to Support Hierarchical and Configurable Scheduling

It is useful in systems that must support multiple applications with various temporal requirements to allow application-specific policies to manage resources accordingly. However, there is a tension between this goal and the desire to control and police possibly malicious programs. The Java-based Sensor Execution Environment (SXE) in snBench presents a situation where such considerations add value to the system. Multiple applications can be run by multiple users with varied temporal requirements, some Real-Time and others best effort. This paper outlines and documents an implementation of a hierarchical and configurable scheduling system with which different applications can be executed using application-specific scheduling policies. Concurrently the system administrator can define fairness policies between applications that are imposed upon the system. Additionally, to ensure forward progress of system execution in the face of malicious or malformed user programs, an infrastructure for execution using multiple threads is described.

Isoperimetric Graph Partitioning for Data Clustering and Image Segmentation

Spectral methods of graph partitioning have been shown to provide a powerful approach to the image segmentation problem. In this paper, we adopt a different approach, based on estimating the isoperimetric constant of an image graph. Our algorithm produces the high quality segmentations and data clustering of spectral methods, but with improved speed and stability.

Eliminating Redundant Training Data Using Unsupervised Clustering Techniques

Training data for supervised learning neural networks can be clustered such that the input/output pairs in each cluster are redundant. Redundant training data can adversely affect training time. In this paper we apply two clustering algorithms, ART2 -A and the Generalized Equality Classifier, to identify training data clusters and thus reduce the training data and training time. The approach is demonstrated for a high dimensional nonlinear continuous time mapping. The demonstration shows six-fold decrease in training time at little or no loss of accuracy in the handling of evaluation data.

Adaptive Resonance Associative Map: A Hierarchical ART System for Fast Stable Associative Learning

This paper introduces a new class of predictive ART architectures, called Adaptive Resonance Associative Map (ARAM) which performs rapid, yet stable heteroassociative learning in real time environment. ARAM can be visualized as two ART modules sharing a single recognition code layer. The unit for recruiting a recognition code is a pattern pair. Code stabilization is ensured by restricting coding to states where resonances are reached in both modules. Simulation results have shown that ARAM is capable of self-stabilizing association of arbitrary pattern pairs of arbitrary complexity appearing in arbitrary sequence by fast learning in real time environment. Due to the symmetrical network structure, associative recall can be performed in both directions.

On the role of molecular clustering on infrared absorption line shapes of acetylene in a supersonic expansion

A supersonic expansion containing acetylene seeded into Ar and produced from a circular nozzle is investigated using CW/cavity ring down spectroscopy, in the 1.5 μm range. The results, also involving experiments with pure acetylene and acetylene-He expansions, as well as slit nozzles, demonstrate that the denser central section in the expansion is slightly heated by the formation of acetylene aggregates, resulting into a dip in the monomer absorption line profiles. Acetylene-Ar aggregates are also formed at the edge of the circular nozzle expansion cone. © 2008 Elsevier B.V. All rights reserved.

Design and synthesis of hierarchical MnO2 nanospheres/carbon nanotubes/conducting polymer ternary composite for high performance electrochemical electrodes.

For efficient use of metal oxides, such as MnO(2) and RuO(2), in pseudocapacitors and other electrochemical applications, the poor conductivity of the metal oxide is a major problem. To tackle the problem, we have designed a ternary nanocomposite film composed of metal oxide (MnO(2)), carbon nanotube (CNT), and conducting polymer (CP). Each component in the MnO(2)/CNT/CP film provides unique and critical function to achieve optimized electrochemical properties. The electrochemical performance of the film is evaluated by cyclic voltammetry, and constant-current charge/discharge cycling techniques. Specific capacitance (SC) of the ternary composite electrode can reach 427 F/g. Even at high mass loading and high concentration of MnO(2) (60%), the film still showed SC value as high as 200 F/g. The electrode also exhibited excellent charge/discharge rate and good cycling stability, retaining over 99% of its initial charge after 1000 cycles. The results demonstrated that MnO(2) is effectively utilized with assistance of other components (fFWNTs and poly(3,4-ethylenedioxythiophene)-poly(styrenesulfonate) in the electrode. Such ternary composite is very promising for the next generation high performance electrochemical supercapacitors.

Nested dictionary learning for hierarchical organization of imagery and text

A tree-based dictionary learning model is developed for joint analysis of imagery and associated text. The dictionary learning may be applied directly to the imagery from patches, or to general feature vectors extracted from patches or superpixels (using any existing method for image feature extraction). Each image is associated with a path through the tree (from root to a leaf), and each of the multiple patches in a given image is associated with one node in that path. Nodes near the tree root are shared between multiple paths, representing image characteristics that are common among different types of images. Moving toward the leaves, nodes become specialized, representing details in image classes. If available, words (text) are also jointly modeled, with a path-dependent probability over words. The tree structure is inferred via a nested Dirichlet process, and a retrospective stick-breaking sampler is used to infer the tree depth and width.

UNC-6 (netrin) stabilizes oscillatory clustering of the UNC-40 (DCC) receptor to orient polarity.

The receptor deleted in colorectal cancer (DCC) directs dynamic polarizing activities in animals toward its extracellular ligand netrin. How DCC polarizes toward netrin is poorly understood. By performing live-cell imaging of the DCC orthologue UNC-40 during anchor cell invasion in Caenorhabditis elegans, we have found that UNC-40 clusters, recruits F-actin effectors, and generates F-actin in the absence of UNC-6 (netrin). Time-lapse analyses revealed that UNC-40 clusters assemble, disassemble, and reform at periodic intervals in different regions of the cell membrane. This oscillatory behavior indicates that UNC-40 clusters through a mechanism involving interlinked positive (formation) and negative (disassembly) feedback. We show that endogenous UNC-6 and ectopically provided UNC-6 orient and stabilize UNC-40 clustering. Furthermore, the UNC-40-binding protein MADD-2 (a TRIM family protein) promotes ligand-independent clustering and robust UNC-40 polarization toward UNC-6. Together, our data suggest that UNC-6 (netrin) directs polarized responses by stabilizing UNC-40 clustering. We propose that ligand-independent UNC-40 clustering provides a robust and adaptable mechanism to polarize toward netrin.

Fitting host-parasitoid models with CV² > 1 using hierarchical generalized linear models

The powerful general Pacala-Hassell host-parasitoid model for a patchy environment, which allows host density–dependent heterogeneity (HDD) to be distinguished from between-patch, host density–independent heterogeneity (HDI), is reformulated within the class of the generalized linear model (GLM) family. This improves accessibility through the provision of general software within well–known statistical systems, and allows a rich variety of models to be formulated. Covariates such as age class, host density and abiotic factors may be included easily. For the case where there is no HDI, the formulation is a simple GLM. When there is HDI in addition to HDD, the formulation is a hierarchical generalized linear model. Two forms of HDI model are considered, both with between-patch variability: one has binomial variation within patches and one has extra-binomial, overdispersed variation within patches. Examples are given demonstrating parameter estimation with standard errors, and hypothesis testing. For one example given, the extra-binomial component of the HDI heterogeneity in parasitism is itself shown to be strongly density dependent.

Multilevel approaches applied to the capacitated clustering problem

This paper presents two multilevel refinement algorithms for the capacitated clustering problem. Multilevel refinement is a collaborative technique capable of significantly aiding the solution process for optimisation problems. The central methodologies of the technique are filtering solutions from the search space and reducing the level of problem detail to be considered at each level of the solution process. The first multilevel algorithm uses a simple tabu search while the other executes a standard local search procedure. Both algorithms demonstrate that the multilevel technique is capable of aiding the solution process for this combinatorial optimisation problem.