We propose to strengthen user-selected passwords against statistical-guessing attacks by allowing users of Internetscale systems to choose any password they want—so long as it’s not already too popular with other users. We create an oracle to identify undesirably popular passwords using an existing data structure known as a count-min sketch, which we populate with existing users’ passwords and ...

As we, all know that in every field it is very important to have quality of services. In the field of Real-time, applications like ATM and Wi-Fi are few examples. Some metrics for quality of services are Cost, Flexibility, Reliability and Efficiency. In this paper, we deal with quality of services in relation to admission control of the packets. In admission control, it should concentrate on sc...

The max-min fairness is one of the most widely used fairness concepts for resource sharing in communication networks. This paper describes some results related to it.

Skewness plays a very important role in task scheduling. It measures the degree of asymmetry in a data set. Moreover, the data set may be positively skewed or negatively skewed. The quartile coefficient of skewness lies in between -1 to 1. If the quartile coefficient is in between -1 to 0, then the data set is negatively skewed. Otherwise, it is positively skewed. Min-Min and Max-Min heuristic ...

We consider bounded occurrence (degree) instances of a minimum constraint satisfaction problem MIN-LIN2 and a MIN-BISECTION problem for graphs. MIN-LIN2 is an optimization problem for a given system of linear equations mod 2 to construct a solution that sat-isses the minimum number of them. E3-OCC-MIN-E3-LIN2 is the bounded occurrence (degree) problem restricted as follows: each equation has ex...

We analyze two and three-dimensional variants of Hotelling’s model of differentiated products. In our setup, consumers can place different importance on each product attribute; this is measured by a weight in the disutility of distance in each dimension. Two firms play a two-stage game; they choose locations in stage 1 and prices in stage 2. We seek subgame-perfect equilibria. We find that all ...

We generalize a smoothing algorithm for finite min–max to finite min– max–min problems. We apply a smoothing technique twice, once to eliminate the inner min operator and once to eliminate the max operator. In mini–max problems, where only the max operator is eliminated, the approximation function is decreasing with respect to the smoothing parameter. Such a property is convenient to establish ...