We first investigated the similarity in optical quality of a batch of diffractive intraocular lenses (DIOLs), providing experimental evidence for one DIOL as representative of a batch. Using adaptive optics, we then evaluated one DIOL under different levels of Zernike spherical aberration (SA) by applying both a point spread function test and a psychophysical visual acuity test. We found that f...

The model presented in this paper assumes that a uniform lot size is produced through a series of manufacturing stages, with a single set-up mud without interruption at each stage. Transportation of partial lots, called batches, is allowed between stages after the whole batch is completed. The batch sizes must he equal at any particular stage, but the optimal number of equal-sized batches may d...

In this paper we propose a queueing model with a batch service with both event and time counter. Its lower power consumption is an improvement over the batch service with only an event counter which probably causes a longer mean response time. If there are few events in the queue, the event counter cannot reach the lower boundary of the number of events, and thus the computer system will requir...

Machine learning (ML) relies on stochastic algorithms, all of which rely gradient approximations with \textquotedbl{}batch size\textquotedbl{} examples. Growing the batch size as optimization proceeds is a simple and usable method to reduce training time, provided that number workers grows size. In this work, we provide package trains PyTorch models Dask clusters, can grow if desired. Our simul...

Several batch-verification algorithms for original ECDSA signatures are proposed for the first time in AfricaCrypt 2012. Two of these algorithms are based on the naive idea of taking square roots in the underlying fields, and the others perform symbolic manipulation to verify small batches of ECDSA signatures. In this paper, we use elliptic-curve summation polynomials to design a new ECDSA batc...

We propose an efficient batch signature generation scheme for signing multiple messages simultaneously. The scheme can be based on any signature scheme with appendix and resultant signatures preserve the property of independent verification by different recipients. The scheme is shown to be of almost constant complexity for both generation and verification as the number of messages increases wh...

We consider two questions at the heart of machine learning; how can we predict if a minimum will generalize to the test set, and why does stochastic gradient descent find minima that generalize well? Our work responds to Zhang et al. (2016), who showed deep neural networks can easily memorize randomly labeled training data, despite generalizing well on real labels of the same inputs. We show th...

A typical situation in preparative chromatography is that a certain target component elutes somewhere in the middle of a train of other components present in the feed. In order to isolate efficiently this target component the operating conditions of conventional batch chromatography have to be optimized carefully. Nevertheless the achievable production rates and recovery yields are frequently l...