We devise schemes for producing, in the least possible time, p identical objects with n agents that work at differing speeds. This involves halting the process to transfer production across agent types. For the case of two types of agent, we construct schemes based on the Euclidean algorithm that seeks to minimize the number of pauses in production.

Clustering is a method of allocating data points in various groups, known as clusters, based on similarity. The notion of expressing similarity mathematically and then maximizing it (minimize dissimilarity) can be formulated as an optimization problem. Spectral clustering is an example of such an approach to clustering, and it has been successfully applied to visualization of clustering and mapping of points into clusters in two and three dimensions. Higher dimension problems remained untouched due to complexity and, most importantly, lack of understanding what “similarity” means in higher dimensions. In this paper, we apply spectral clustering to long timeseries EEG (electroencephalogram) data. We developed several models, based on different similarity functions and different approaches for spectral clustering itself. The results of the numerical experiment demonstrate that the created models are accurate and can be used for timeseries classification.

We construct a new stochastic interest rate model with two stochastic factors, by introducing a stochastic long-run equilibrium level into the Vasicek interest rate model which follows another Ornstein–Uhlenbeck process. With the interest rate under the Black–Scholes model being assumed to follow the newly proposed model, a closed-form representation of European option prices is successfully presented, when the analytical characteristic function of the underlying log-price under a forward measure is derived. To assess the model performance, a preliminary empirical study is conducted using S&P 500 index and its options, with the Vasicek model and an alternative two-factor Vasicek model taken as benchmarks.