BACKGROUND: High content live cell imaging experiments are able to track the cellular localisation of labelled proteins in multiple live cells over a time course. Experiments using high content live cell imaging will generate multiple large datasets that are often stored in an ad-hoc manner. This hinders identification of previously gathered data that may be relevant to current analyses. Whilst solutions exist for managing image data, they are primarily concerned with storage and retrieval of the images themselves and not the data derived from the images. There is therefore a requirement for an information management solution that facilitates the indexing of experimental metadata and results of high content live cell imaging experiments. RESULTS: We have designed and implemented a data model and information management solution for the data gathered through high content live cell imaging experiments. Many of the experiments to be stored measure the translocation of fluorescently labelled proteins from cytoplasm to nucleus in individual cells. The functionality of this database has been enhanced by the addition of an algorithm that automatically annotates results of these experiments with the timings of translocations and periods of any oscillatory translocations as they are uploaded to the repository. Testing has shown the algorithm to perform well with a variety of previously unseen data. CONCLUSION: Our repository is a fully functional example of how high throughput imaging data may be effectively indexed and managed to address the requirements of end users. By implementing the automated analysis of experimental results, we have provided a clear impetus for individuals to ensure that their data forms part of that which is stored in the repository. Although focused on imaging, the solution provided is sufficiently generic to be applied to other functional proteomics and genomics experiments. The software is available from: fhttp://code.google.com/p/livecellim/

Automated tests are important for Web applications as they grow more complex day by day. Web application testing frameworks have emerged to help satisfy this need. However, used without a model that is designed for system evolution and realization, maintaining test code becomes cumbersome and inefficient. This paper describes an activity oriented approach to engineer automated tests for Web applications with reference to a Web application developed for grant funding agencies. In this approach, the developer defines a domain model to represent application state, and uses a test activity graph comprised of self-validating user interactions to verify application correctness. We have implemented a test code generator called iTester using activity-oriented approach.

A fundamental paradigm in peer-to-peer (P2P) content distribution is that of a large community of intermittently-connected nodes that cooperate to share files. Because nodes are intermittently connected, the P2P community must replicate and replace files as a function of their popularity to achieve satisfactory performance. In this paper, we develop an analytical optimization theory for benchmarking the performance of replication/replacement algorithms, including algorithms that employ erasure codes. We also consider a content management algorithm, the Top-K Most Frequently Requested algorithm, and show that in most cases this algorithm converges to an optimal replica profile. Finally, we present two approaches for achieving an evenly balanced load over all the peers in the community.

E-mail is a mission-critical communication function for virtually all institutions. Modern e-mail employs a server-centric design, in which the user is critically dependent on her mail server. We present a peer-to-peer (P2P) email architecture that eliminates the need to rely on a single server and boosts the resilience of email against any kinds of attacks. Our architecture also provides confidential communications for all users. We present how the basic mechanisms of sending and reading email are implemented in our architecture. We also consider additional schemes to improve anonymity in our architecture. We present our prototype implementation and discuss the future of P2P communication architectures.

Article Free Access Share on Optimal streaming of synchronized multimedia presentations Authors: David A. Turner Institut Eurécom, B.P. 193, 06904 Sophia-Antipolis, France Institut Eurécom, B.P. 193, 06904 Sophia-Antipolis, FranceView Profile , Keith W. Ross Institut Eurécom, B.P. 193, 06904 Sophia-Antipolis, France Institut Eurécom, B.P. 193, 06904 Sophia-Antipolis, FranceView Profile Authors Info & Claims MULTIMEDIA '99: Proceedings of the seventh ACM international conference on Multimedia (Part 2)October 1999 Pages 91–93https://doi.org/10.1145/319878.319903Published:01 October 1999Publication History 2citation189DownloadsMetricsTotal Citations2Total Downloads189Last 12 Months4Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

A two-stage algorithm for extraction of the ventricular chambers (endocardial surfaces) in flow-enhanced magnetic resonance images is described. In the first stage, the approximate locations and sizes of the endocardial surfaces are determined by intensity thresholding. In the second stage, points on each approximated surface are repositioned to nearest locally maximum gradient magnitude points and a generalized cylinder is fitted to them. Examples of ventricular chambers in cine MR images determined by this algorithm are presented.

An automatic method that can transform a sequence of tomographic image slices into an isotropic volume data set is described. In this method, correspondence is established between points in consecutive slices, and then this correspondence is used to estimate data between the slices by linear interpolation. The method takes advantage of the fact that consecutive slices have small geometric differences, and carries out the search in predicted small neighborhoods. Only points with high gradient magnitudes are used in the search process to increase the reliability of the correspondences. Mismatches that occur are detected and corrected using the continuity constraint in the correspondences. Experimental results showing the matching and interpolation of magnetic resonance slices and computed tomography slices are presented.