For a connected graph G containing no bridges, let D(G) be the family of strong orientations of G; and for any D ∈ D(G), we denote by d(D) the diameter of D. The orientation number −→ d (G) of G is defined by −→ d (G) = min{d(D)|D ∈ D(G)}. Let G(p, q;m) denote the family of simple graphs obtained from the disjoint union of two complete graphs K p and Kq by adding m edges linking them in an arbi...

Let p1 ≤ p2 and consider estimating a fixed set {x : p1 ≤ f(x) ≤ p2} by the random set {x : p1 ≤ f̂n(x) ≤ p2}, where f̂n is a consistent estimator of the continuous function f . This paper gives consistency conditions for these sets, and provides a new method to construct confidence regions from empirical averages of sets. The method can also be used to construct confidence regions for sets of th...

and Applied Analysis 3

Consuming services online is an exponentially growing trend within different industries. A robust online authentication solution to these services is a critical requirement for establishing trust between end users and service providers. Currently, the shortcomings of password based authentication solutions are well recognized.Hence, many alternative strong authentication solutions are being ado...

Let X be a reflexive Banach space which has a weakly sequentially continuous duality mapping. In this paper, we consider the following viscosity approximation sequence x n λ n fx n 1−λ n T n x n , where λ n ∈ 0, 1, {T n } is a uniformly asymptotically regular sequence, and f is a weakly contractive mapping. Strong convergence of the sequence {x n } is proved.

A pair of Wolfe type non-differentiable second order symmetric primal and dual problems in mathematical programming is formulated. The weak and strong duality theorems are then established under second order F-convexity assumptions. Symmetric minimax mixed integer primal and dual problems are also investigated. 2002 Elsevier Science B.V. All rights reserved.

In this work the arbitrarily varying wiretap channel AVWC is studied. We derive a lower bound on the random code secrecy capacity for the average error criterion and the strong secrecy criterion in the case of a best channel to the eavesdropper by using Ahlswede’s robustification technique for ordinary AVCs. We show that in the case of a non-symmetrisable channel to the legitimate receiver the ...

If D = (V,A) is a digraph, its competition hypergraph CH(D) has the vertex set V and e ⊆ V is an edge of CH(D) iff |e| ≥ 2 and there is a vertex v ∈ V , such that e = {w ∈ V |(w, v) ∈ A}. We tackle the problem to minimize the number of strong components in D without changing the competition hypergraph CH(D). The results are closely related to the corresponding investigations for competition gra...

In 2006, businesses engaged in Internet commerce face a fundamental challenge when trying to implement strong authentication technologies because of the absence of widely accepted standards for the reliable authentication of transacting parties in Internet commerce. For more than a decade, governments have struggled unsuccessfully to create legal frameworks within which businesses can implement...

This paper deals with the problem of finding a base and strong generating set for the group generated by a given set of permutations. The concepts of base and strong generating set were introduced by Sims [5], [6] and provide the most effective tool for computing with permutation groups of high degree. One algorithm, originally proposed by Sims [7], is described in detail; its behavior on a num...