The research on computational advertising so far has focused on finding the single best ad. However, in many real situations, more than one ad can be presented. Although it is possible to address this problem myopically by using a single-ad optimisation technique in serial-mode, i.e., one at a time, this approach can be ineffective and inefficient because it ignores the correlation between ads....

Muge Erdirik-Dogan and Ignacio E. Grossmann Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213 February 2007 Abstract In this paper we address the production planning of parallel multi-product batch reactors with sequence-dependent changeovers, a challenging problem that has been motivated by a real world application of a specialty chemicals business....

Batch normalization was introduced in 2015 to speed up training of deep convolution networks by normalizing the activations across the current batch to have zero mean and unity variance. The results presented here show an interesting aspect of batch normalization, where controlling the shape of the training batches can influence what the network will learn. If training batches are structured as...

It this paper we revisit the fast stylization method introduced in Ulyanov et al. (2016). We show how a small change in the stylization architecture results in a significant qualitative improvement in the generated images. The change is limited to swapping batch normalization with instance normalization, and to apply the latter both at training and testing times. The resulting method can be use...

The process industries — those firms that add value by mixing, separating, forming andror chemical reactions by either batch or continuous mode — continue to lag behind the discrete industries in the identification and implementation of Ž . effective production and inventory management P&IM techniques. A contributing factor is that the process industries have traditionally been lumped together ...

We introduce on-line batching problems as a new class of on-line combinatorial problems. In an on-line batching problem the task is to chop batches from a growing queue of objects, such that the cost is minimized, where the cost consists of setup cost for each batch, processing cost for each batch, and holding cost for each object that is not processed immediately. For on-line batching problems...

Differential privacy is a promising privacy-preserving paradigm for statistical query processing over sensitive data. It works by injecting random noise into each query result, such that it is provably hard for the adversary to infer the presence or absence of any individual record from the published noisy results. The main objective in differentially private query processing is to maximize the...

In the chemical industry, final products arise from chemical and physical transformations of materials in processing units. We consider the case of batch production mode, where the total requirements for intermediate and final products are divided into individual batches. To produce a batch, the inputs are first loaded into a processing unit, then a transformation process is executed, and final...