1005111
Characterizing flows in large wireless data networks
Several studies have recently been performed on wireless university campus networks, corporate and public networks. Yet little is known about the flow-level characterization in such networks. In this paper, we statistically characterize both static flows and roaming flows in a large campus wireless network using a recently-collected trace. For static flows, we take a two-tier approach to characterizing the flow arrivals, which results a Weibull regression model. We further discover that the static flow arrivals in spatial proximity show strong similarity. As for roaming flows, they can also be well characterized statistically.We explain the results by user behaviors and application demands, and further cross-validate the modeling results by three other traces. Finally, we use two examples to illustrate how to apply our models for performance evaluation in the wireless context.
37815796
An architectural infrastructure and topological optimization for end system multicast
Although IP-multicast has been proposed and investigated for the some time, there are major problems inherent in the IP-multicasting technique, for example, scalability problems, difficulty to allocate a globally unique multicast address, complexity to support higher level features such as reliable data transfer congestion/flow control and security, and more importantly, deployment problem due to architectural changes to core routers. Recently, end-system multicast (ESM) has been proposed as an alternative solution so that multicasting services can be quickly deployed. In this paper we consider the "architectural" and "optimization " issues on designing an ESM-tree. Specifically, we present a distributed algorithm on how to create and maintain an ESM-tree. We also propose a distributed algorithm to perform a tree optimization (TO) so that an ESM-tree can dynamically adapt to the changing network condition (e.g., drop in transfer bandwidth) so that nodes can receive the multicast data more efficiently. The propose distributed algorithm has the theoretical properties that at all times, a tree-topology can be maintained and that any node joining, leaving, as well as any tree optimization operation will not "partition" an ESM-tree. Therefore, our work can be used to provide an efficient architectural infrastructure for ESM services. We have implemented a prototype ESM system and carried out experiments to illustrate the effectiveness and performance of our ESM optimization protocol.
7455983
A study of the short message service of a nationwide cellular network
In recent years, cellular networks have experienced an astronomical increase in the use of Short Message Service (SMS), making it a popular communication means for inter-personal as well as content provider-to-person usage. Yet little is known about the traffic and message user behavior in real SMS systems. In this paper, we present a measurement study of SMS based on traces collected from a nationwide cellular carrier during a three-week period. We characterize message traffic at both the message level and the conversation thread level. We also examine the "store-and-forward" mechanism of SMS and present initial measurements on how messages are actually delivered.
1370284
Robust Appearance-based Tracking using a sparse Bayesian classifier
An appearance-based approach to track an object that may undergo appearance change is proposed. Unlike recent methods that store a detailed representation of object's appearance, this method allows an appearance feature with a reduced dimension to be used. Through the use of a sparse Bayesian classifier, high classification and detection accuracy can be maintained even if a reduced feature vector is used. In addition, the classifier allows online-training which enables online-updating of the original classification model and provides better adaptability. Experiments show that the method can be used to track targets undergoing appearance change due to the change in view-point, facial expression and lighting direction
19718175
Development of Parallel Hybrid Optimisation Techniques Based on Genetic Algorithms and Simulated Annealing
This paper develops coarse-grained parallel algorithms for hybrid optimisation techniques based on genetic algorithms and simulated annealing. The design of the algorithms takes into consideration load balancing, processor synchronisation reduction, communication overhead reduction and memory contention elimination. In addition, the algorithms are designed to avoid the problem of premature convergence which exists in some previous parallel genetic algorithms. The algorithms are implemented on an i860 processor in a simulated environment and are applied to a short-term hydrothermal scheduling problem. The scheduling results are presented and are compared to those found by sequential GAs, by parallel simulated-annealing algorithm and by some earlier parallel genetic algorithms.
5967501
Real-Time Adaptive Hand Motion Recognition Using a Sparse Bayesian Classifier
An approach to increase adaptability of a recognition system, which can recognise 10 elementary gestures and be extended to sign language recognition, is proposed. In this work, recognition is done by firstly extracting a motion gradient orientation image from a raw video input and then classifying a feature vector generated from this image to one of the 10 gestures by a sparse Bayesian classifier. The classifier is designed in a way that it supports online incremental learning and it can be thus re-trained to increase its adaptability to an input captured under a new condition. Experiments show that the accuracy of the classifier can be boosted from less than 40% to over 80% by re-training it using 5 newly captured samples from each gesture class. Apart from having a better adaptability, the system can work reliably in real-time and give a probabilistic output that is useful in complex motion analysis.
8272641
Provenance-Based Validation of E-Science Experiments
E-Science experiments typically involve many distributed services maintained by different organisations. After an experiment has been executed, it is useful for a scientist to verify that the execution was performed correctly or is compatible with some existing experimental criteria or standards. Scientists may also want to review and verify experiments performed by their colleagues. There are no exsiting frameworks for validating such experiments in today's e-Science systems. Users therefore have to rely on error checking performed by the services, or adopt other ad hoc methods. This paper introduces a platform-independent framework for validating workflow executions. The validation relies on reasoning over the documented provenance of experiment results and semantic descriptions of services advertised in a registry. This validation process ensures experiments are performed correctly, and thus results generated are meaningful. The framework is tested in a bioinformatics application that performs protein compressibility analysis.
12209522
Workflow-enabled distributed component-based information architecture for digital medical imaging enterprises
Few information systems today offer a flexible means to define and manage the automated part of radiology processes, which provide clinical imaging services for the entire healthcare organization. Even fewer of them provide a coherent architecture that can easily cope with heterogeneity and inevitable local adaptation of applications and can integrate clinical and administrative information to aid better clinical, operational, and business decisions. We describe an innovative enterprise architecture of image information management systems to fill the needs. Such a system is based on the interplay of production workflow management, distributed object computing, Java and Web techniques, and in-depth domain knowledge in radiology operations. Our design adapts the approach of "4+1" architectural view. In this new architecture, PACS and RIS become one while the user interaction can be automated by customized workflow process. Clinical service applications are implemented as active components. They can be reasonably substituted by applications of local adaptations and can be multiplied for fault tolerance and load balancing. Furthermore, the workflow-enabled digital radiology system would provide powerful query and statistical functions for managing resources and improving productivity. This paper will potentially lead to a new direction of image information management. We illustrate the innovative design with examples taken from an implemented system.