Document caching on is used to improve Web performance. An eÆcient caching policy keeps popular documents in the cache and replaces rarely used ones. The latest web cache replacement policies incorporate the document size, frequency, and age in the decision process. The recently-proposed and very popular Greedy-Dual-Size (GDS) policy is based on document size and has an elegant aging mechanism....

A Bayesian semiparametric proportional hazards model is presented to describe the failure behavior of machine tools. The semiparametric setup is introduced using a mixture of Dirichlet processes prior. A Bayesian analysis is performed on real machine tool failure data using the semiparametric setup, and development of optimal replacement strategies are discussed. The results of the semiparametr...

This paper describes our UT-KAY system that participated in the Workshop on Asian Translation 2016. Based on an Attention-based Neural Machine Translation (ANMT) model, we build our system by incorporating a domain adaptation method for multiple domains and an attention-based unknown word replacement method. In experiments, we verify that the attention-based unknown word replacement method is e...

Trace-driven cache simulation is central to computer design. A trace is a very long sequence, zl, ..., iN, of references to lines (contiguous locations) from main memory. At the t th instant, reference z, is hashed into a set of cache locations, the contents of which are then compared with _t. If at the t th instant zt is not present in the cache, then it is said to be a miss, and is loaded int...

In asset-intensive services, a well-known challenge is to maintain high availability of the physical assets while keeping the total maintenance cost low. In applications of high-value machinery such as heavy industrial equipment, a traditional approach is to perform periodic maintenance according to a runtime-based schedule. Most equipment vendors publish a maintenance schedule based on a “stan...

Stochastic approximation (SA), a stochastic analog of iterative techniques for finding the zeroes of a function (e.g., Newton-Raphson), is applied to a problem in resource allocation, the age replacement policy (ARP) problem. A stochastically failing unit is replaced at failure or at time t, whichever comes first, under an age replacement policy. When the form of the failure distribution is unk...

This paper presents a model where agents decide on the timing of replacement of ageing machines. The optimal replacement policy for an agent is influenced by other agents’ decisions because the productivity of a particular vintage displays network externalities that set in with a lag. In equilibrium, agents follow innovation cycles with a frequency that is lower than optimal, so there is too mu...

Caches do not grow in size at the speed of main memory or raw processor performance. Therefore, optimal use of the limited cache resources is of paramount importance to obtain a good system performance. Instead of a recency-based replacement policy (such as, e.g., LRU), we can also make use of a locality-based policy, based on the temporal reuse of data. These replacement policies have usually ...

Businesses are increasingly interested in how big data, artificial intelligence, machine learning, and predictive analytics can be used to increase revenue, lower costs, and improve their business processes. In this paper, we describe how we have developed a data-driven machine learning method to optimize the collection process for a debt collection agency. Precisely speaking, we create a frame...