Bike Sharing System (BSS) is a green mode of transportation that is employed extensively for short distance travels in major cities of the world. Unfortunately, the users behaviour driven by their personal needs can often result in empty or full base stations, thereby resulting in loss of customer demand. To counter this loss in customer demand, BSS operators typically utilize a fleet of carrie...

Though existing systems for sharing distributed resources in clusters of workstations are generally e ective at recruiting idle resources, these systems often have a disruptive e ect on desktop workstation users. Even when recruiting computing cycles from strictly idle workstations, a by-product of running foreign jobs is that the virtual memory pages of the original user's idle processes are u...

In this paper, we propose a task duplication based scheduling algorithm for avoiding useless duplication. In our algorithm, task duplication is divided into two phases: a task fill phase and a task duplication phase. In the task fill phase, tasks are duplicated and allocated to idle time slots in used processors. Namely, the task fill phase does not require additional idle processors. The task ...

Office and home environments are increasingly crowded with personal computers. Even though these computers see little use in the course of the day, they often remain powered, even when idle. Leaving idle PCs running is not only wasteful, but with rising energy costs it is increasingly more expensive. We propose partial migration of idle desktop sessions into the cloud to achieve energyproportio...

We consider a queueing loss system with heterogeneous skill based servers with arbitrary distributions. We assume Poisson arrivals, with each arrival having a vector indicating which of the servers are eligible to serve it. Arrivals can only be assigned to a server that is both idle and eligible. We assume arrivals are assigned to the idle eligible server that has been idle the longest and deri...

We propose an opportunistic channel access scheme for cognitive radio-enabled secondary networks. In our work, we model the channel occupancy due to Primary User (PU) activity as a 2-state Alternating Renewal Process, with alternating busy and idle periods. Once a Secondary Node (SN) senses the channel idle, the proposed scheme uses the residual idle time distribution to estimate the transmissi...

RSA Data Security, Inc. is sponsoring contests to prove the (in-)security of miscellaneous cryptographic algorithms as DES or RC5. We have joined RSA’s RC5 contest by combining idle CPU power from users visiting a web site. Via an embedded Java RC5 applet down-loading and testing RC5 keys from the web server it was originating from, visitors can participate and donate idle CPU cycles without ha...

We propose an opportunistic channel access scheme for cognitive radio-enabled secondary networks. In our work, we model the channel occupancy due to Primary User (PU) activity as a 2-state Alternating Renewal Process, with alternating busy and idle periods. Once a Secondary Node (SN) senses the channel idle, the proposed scheme uses the residual idle time distribution to estimate the transmissi...