For cluster video servers, it is very important to design a good distributed storage system with high performance. One of the important issues in designing a good distributed storage system is how to store multimedia data on many storage nodes. This issue includes two topics: the scheme of splitting an entire file into many clips, and the storage of these clips on many nodes. We have designed a...

Zeitler, E. 2011. Scalable Parallelization of Expensive Continuous Queries over Massive Data Streams. Acta Universitatis Upsaliensis. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 836. 35 pp. Uppsala. ISBN 978-91-554-8095-0. Numerous applications in for example science, engineering, and financial analysis increasingly require online analysis...

We analyze transport data from a quantum point contact (QPC), fabricated on a modulation doped Si/SiGe heterostructure, to extract experimental estimates for the valley splitting. The experimental data are fit to a form derived from a valley coupling theory that takes into account the fact that the quantum well is grown on a miscut substrate. The results of the fitting analysis are compared to ...

This paper proposes several novel hybrid ant colony optimization (ACO)-based algorithms to resolve multi-objective job-shop scheduling problem with equal-size lot splitting. The main issue discussed in this paper is lot-splitting of jobs and tradeoff between lot-splitting costs and makespan. One of the disadvantages of ACO is its uncertainty on time of convergence. In order to enrich search pat...

We present the universal two-loop splitting functions that describe the limits of two-loop n-point amplitudes of massless particles when two of the momenta are collinear. To derive the splitting amplitudes, we take the collinear limits of explicit two-loop four-point helicity amplitudes computed in the ’t Hooft-Veltman scheme. The g → gg splitting amplitude has recently been computed using the ...

We propose a method to improve the recognition rate of Bayesian classifiers by splitting the training data and using separate classifier to learn each sub-category. We use probabilistic Latent Semantic Analysis (pLSA) to split the training set automatically into subcategories. This sub-categorization is based on the similarity of training images in terms of object’s appearance or background con...

Incremental stack-copying was used to implement OR-parallel Prolog efficiently in the MUSE system. The idea of incremental stack-copying is to only copy the difference between the WAM data areas of two processors, instead of copying them entirely. In order to further reduce the communication during stack-copying and make its implementation efficient on distributed memory machines, a new techniq...

For object classification in video surveillance, features extracted from images are compared with a visual dictionary. The best-matching features are learned by the classifier to determine the object class. In this paper, the visual dictionary concept is extended with Interest Point Operators (IPOs). In a first experiment, the influence of using IPOs on the visual dictionary creation process is...

We present a FORTRAN-77 program to estimate the optimal depth of the source of anisotropy using spatial coherency of teleseismic shear-wave splitting (SWS) parameters. For a given assumed depth of anisotropy, the program computes a variation factor which is a weighted sum of the arithmetic standard deviation (SD) of the splitting times and the circular SD of the fast directions over overlapping...

In this paper, we consider two restricted types of dynamic orthogonal segment intersection search problems. One is the problem in which the underlying set is updated only by insertions. In the other, the set is updated only by deletions. We show that an intermixed sequence of O ( n ) queries and updates in both problems can be executed on-line in O(n1ognSK) time and O(n1ogn) space, where K is t...