This paper presents a scalable solution to the problem of tracking objects across spatially separated, uncalibrated, non-overlapping cameras. Unlike other approaches this technique uses an incremental learning method to create the spatio-temporal links between cameras, and thus model the posterior probability distribution of these links. This can then be used with an appearance model of the obj...

This research addresses a batch scheduling model for a single machine processing parts of a single item to minimize total actual flow time, defined as interval time from the arrival time to the due date. The part processing time is assumed to be increasing linearly with increasing the waiting time of the part from the batch completion time to its due date. The model consists of the following de...

The method introduced in this paper aims at helping deep learning practitioners faced with an overfit problem. The idea is to replace, in a multi-branch network, the standard summation of parallel branches with a stochastic affine combination. Applied to 3-branch residual networks, shake-shake regularization improves on the best single shot published results on CIFAR-10 and CIFAR100 by reaching...

Different software reengineering projects often perform similar reengineering tasks. This paper presents an industrial case study about an architecture recovery of a batch system using generic reengineering services. The case study is evaluated to identify key concerns for a generic approach.

We treat a single–server vacation queue with queue–length dependent vacation schedules. This subsumes the single–server vacation queue with exhaustive service discipline and the vacation queue with Bernoulli schedule as special cases. The lengths of vacation times depend on the number of customers in the system at the beginning of a vacation. The arrival process is a batch–Markovian arrival pro...

Most training algorithms for HMMs assume that the whole batch of observation sequences is given ahead of time. This is particularly the case for the the standard EM algorithm. However, in many applications such as speech, the data is generated by a temporal process. Singer and Warmuth developed online updates for HMMs that process a single observation sequence in each update. In this paper we t...

We study the decisions agents make in two queueing games with endogenously determined arrivals and batch service. In both games, agents are asked to independently decide when to join a queue, or they may simply choose not to join it at all. The symmetric mixed-strategy equilibrium of two games in discrete time where balking is prohibited and where it is allowed are tested experimentally in a st...

The Internet has changed the way many software developing companies have to work – They have to reconsider their IT strategy. Theory on IT strategy suggests a close intimate relationship between supplier and customer. Theory also suggests a job shop or a batch job organization of the software production. In 2002 we set out to study a number of Danish Internet software companies. Through careful...

We present a mathematical model of solvated crystallization of α-lactose monohydrate and discuss strategies to control the crystallization process in semi-batch mode with the goal to privilege the production of small particles in the range between 130μm and 330μm. We compare specific and unspecific cost functions leading to optimal strategies with significantly different effects on product qual...