We show how a quantum Ising spin chain in a time-dependent transverse magnetic field can be simulated and experimentally probed in the framework of circuit QED with current technology. The proposed setup provides a new platform for observing the nonequilibrium dynamics of interacting many-body systems. We calculate its spectrum to offer a guideline for its initial experimental characterization....

On the basis of a variant of the EPR-Bohm example, we show that the no-signaling condition can be employed as a useful tool for deriving a constraint on a suitably defined measure of the ‘nonidealness’ of a SternGerlach(SG) setup. In this demonstration, a key ingredient is provided by the characteristics of the exact solution of the time-dependent Schroedinger equation as applied to a most gene...

We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine-type dependent setup time is required before a machine is available for processing. Jobs arrive online over time, have machine-type dependent size...

Dead fields are the unused setup fields in the test code which reduce the comprehensibility and maintainability of a software system. A test class contains dead fields when developers initialize setup fields without analyzing the usage of fields properly. Manually identifying dead fields to remove from the code is a time consuming and error-prone task. In this paper, a technique named Dead Fiel...

This article addresses the job-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequence-dependent setup and removal times. The processing of each job includes at most two operations that have to be non-preemptive. Machine routes may differ from job to job. If all setup and removal times are equal to zero, this problem is polynomially solvable...

This article addresses the job-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequence-dependent setup times and removal times. The processing of each job includes at most two operations that have to be non-preemptive. Machine routes may differ from job to job. If all setup and removal times are equal to zero, this problem is polynomially s...

The increased unavailability of electricity from the National Utility in South Africa, coupled with extreme conditions rural areas and general lack infrastructure, leads to setup unique microgrids utilize available. One such microgrid, a scalable photovoltaic (PV)-Diesel generator is situated Phuthaditjhaba district on University Free State (UFS) Qwaqwa campus Africa. Waste heat greenhouse gas ...