We consider a variety of preemptive scheduling problems with controllable processing times on a single machine and on identical/uniform parallel machines, where the objective is to minimize the total compression cost. In this paper, we propose fast divide-and-conquer algorithms for these scheduling problems. Our approach is based on the observation that each scheduling problem we discuss can be...

Multiple description coding of images can be implemented as preand post-processing by means of simple splitting of the pixels into subimages. A controllable amount of extra redundancy is inserted in order to improve estimation quality in case of one descriptor reception. This redundancy is usually inserted in a uniform spatial fashion. In this papers we propose a novel preand post-processing me...

The Internet of Things significantly increases the amount of data generated that strains the processing capability of current computing systems. Approximate computing can accelerate the computation and dramatically reduce the energy consumption with controllable accuracy loss. In this paper, we propose a Resistive Associative Unit, called RAU, which approximates computation alongside processing...

We present an ideal realization of the Tavis-Cummings model in the absence of atom number and coupling fluctuations by embedding a discrete number of fully controllable superconducting qubits at fixed positions into a transmission line resonator. Measuring the vacuum Rabi mode splitting with one, two, and three qubits strongly coupled to the cavity field, we explore both bright and dark dressed...

How we engage in mental state reasoning remains a contentious issue, reflected in the debate between theorytheorists, who argue that we deploy theory-based rules, and simulation theorists, who argue that such reasoning is subserved by simulation processes. The present study examined whether theory-based or simulation-based reasoning is adopted in regret-oriented counterfactual scenarios involvi...