It is well-known, but frequently overlooked, that low- and high-throughput molecular data may contain batch effects, i.e., systematic technical variation. Confounding of experimental batches with the variable(s) of interest is especially concerning, as a batch effect may then be interpreted as a biologically significant finding. An integral step toward reducing false discovery in molecular data...

A new approach is presented in this paper for the display and processing of electrodermal activity. It offers a fully automated interface for the pre-processing and scoring individual skin conductance responses (SCRs). The application supports parallel processing by means of multiple threads. Batch processing is also available. The XML format is used to describe the derived features. The system...

Summingbird is an open-source domain-specific language implemented in Scala and designed to integrate online and batch MapReduce computations in a single framework. Summingbird programs are written using dataflow abstractions such as sources, sinks, and stores, and can run on different execution platforms: Hadoop for batch processing (via Scalding/Cascading) and Storm for online processing. Dif...

We consider a batch scheduling problem in which the processing time of a batch of jobs equals the maximum of the processing times of all jobs in the batch. This is the case, for example, for burn-in operations in semiconductor manufacturing, and other testing operations. Processing times are assumed to be random, and we consider minimizing the makespan and the flowtime. The problem is much more...

We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch start and complete together, and a constant setup is prior to each batch. The objective is to minimize the total completion time of all jobs. We primarily consider the special cases of these problems with identical proce...

Scheduling is a key factor for manufacturing productivity. Effective scheduling can improve on-time delivery, reduce work-in-process inventory, cut lead time, and improve machine utilization. Motivated by the extensive use of batch machines in manufacturing industries, the scheduling of job shops with batch machines is studied in this paper. Unlike machines that can process one part at a time (...

This paper presents the parallel design of a new type ATM network simulator. The proposed parallel design is to organize data by Virtual Paths and then to distribute them among processors, which all execute the same bunch of instructions on these data. The simulator is a pure time-true simulator but it is not a call-by-call type. It is characterized as a batch type. The whole duration of simula...

In this paper, we consider the scheduling problem of minimizing total weighted completion time on uniform machines with unbounded batch. Each of the machine Ml (l = 1, ⋅ ⋅ ⋅ ,m) has a speed sl and can process up to B(≥ n) jobs simultaneously as a batch. The processing time of a batch denoted by P(B) is given by the processing time of the longest job in it, and the running time of the batch on m...

An algorithm for data condensation using support vector machines (SVM’s) is presented. The algorithm extracts data points lying close to the class boundaries, which form a much reduced but critical set for classification. The problem of large memory requirements for training SVM’s in batch mode is circumvented by adopting an active incremental learning algorithm. The learning strategy is motiva...

Recent work on simultaneous trajectory estimation and mapping (STEAM) for mobile robots has used Gaussian processes (GPs) to efficiently represent the robot’s trajectory through its environment. GPs have several advantages over discrete-time trajectory representations: they can represent a continuous-time trajectory, elegantly handle asynchronous and sparse measurements, and allow the robot to ...