McDiarmid C.J.H. and A. Sanchez-Arroyo, An upper bound for total colouring of graphs, Discrete Mathematics 111 (1993) 3899392. We give an upper bound on the number of colours required to extend a given vertex colouring of a graph to a total colouring. This shows that for any simple graph there is a total colouring using at most :d + 3 colours, where A is the maximum vertex degree.

Given a random graph G = G n;1=2 , we give almost sure bounds for the value of the minimum bisection of G. The lower bound is obtained by applying the rst moment method, while the upper bound is given by the analysis of a simple algorithm. Moreover, these results enable us to derive upper bounds for the maximum bisection and the maxcut of G.

Recently, the authors developed the Minimax Mutual Information algorithm for linear ICA of real-valued mixtures, which is based on a density estimate stemming from Jaynes’ maximum entropy principle. Since the entropy estimates result in an approximate upper bound for the actual mutual information of the separated outputs, minimizing this upper bound results in a robust performance and good gene...

this paper addresses the problem of minimizing the sum of maximum earliness and tardiness on identical parallel machines scheduling problem. each job has a processing time and a due date. since this problem is trying to minimize and diminish the values of earliness and tardiness, the results can be useful for just–in-time production systems. it is shown that the problem is np-hard. using effici...

Considerable amounts of organochlorine pesticides (DDT, lindane, heptachlor and methoxychlor) were detected in drinking water samples during a two-year study in Warka-Grojec rural region of Poland. The average incidence of drinking water sources with detectable levels of pesticides ranged from 20 to 30%. According to Polish regulations concerning water quality, individual concentrations did not...

Since it is inconvenient to generate a large number of video requests or changing network factors to perform actual network measurements, we have instead developed an analytical model for evaluating the network queueing delay. Our modeling approach is based on the use of Maximum Asymptotic Variance (MVA) technique to predict the maximum number of video flows that can be supported at a single no...

We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptanalysis. The best previous result (Hong et al. [9]) applies only when the linear transformation branch number (B) is M or (M + 1) (maximal case), where M is the number of s-boxes per round. In contrast, our upper bound can be co...

PURPOSE The need for greater clarity about the effects of 5-HT(3) receptor antagonists on cardiac repolarization is apparent in the changing product labeling across this therapeutic class. This study assessed the repolarization effects of granisetron, a 5-HT(3) receptor antagonist antiemetic, administered intravenously and by a granisetron transdermal system (GTDS). EXPERIMENTAL DESIGN In a p...

Preemptive online algorithms for the maximum matching problem maintain a valid matching M while edges of the underlying graph are presented one after the other. When presented with an edge e, the algorithm should decide whether to augment the matching M by adding e (in which case e may be removed later on) or to keep M in its current form without adding e (in which case e is lost for good). The...