This paper analyzes the limits of applicability of the time domain surface impedance concept. Numerical results obtained by the boundary element formulation employing time domain surface impedance boundary conditions (SIBCs) of different orders of approximation are compared with experimental data and numerical results obtained using the finite element method. An analytical formula for evaluatio...

This paper considers the computational complexity of the discrete logarithm and related problems in the context of \generic algorithms"|that is, algorithms which do not exploit any special properties of the encodings of group elements, other than the property that each group element is encoded as a unique binary string. Lower bounds on the complexity of these problems are proved that match the ...

Introduction Tourism is an industry for people who are looking for something different and they want to be treated as valuable customers (Jung, 1993). Hughes (2000) indicates that holidays provide a strong fantasy element: there is often a hope that something exciting or romantic will happen while on holiday. Since taking a holiday is likely to be one of the largest single expenditures in a yea...

We consider the problem of determining finite integer sets which are knapsack-solvable in linear time (that is, it is possible to determine in linear time, for any integer b, whether b can be expressed as a sum of distinct elements of that set) and where the largest element is as small as possible. We study the condition that the k-subsets (for fixed k) when lexicographically ordered have incre...

Let Q = {qj, qz,..., qn / be a set of n points on the plane. The largest empty circle (LEC) problem consists in finding the largest circle C with center in the convex hull of Q such that no point q(C Q lies in the interior of C. Shamos recently outlined an O(n log n) algorithm for solving this problemJ 9) In this paper it is shown that this algorithm does not always work correctly. A different ...

Given a set of blue points and a set of red points in ddimensional space, we show how to find an axis-aligned hyperrectangle that contains no red points and as many blue points as possible. Our algorithm enumerates the set of relevant hyperrectangles (inclusion maximal axisaligned hyperrectangles that do not contain a red point) and counts the number of blue points in each one. The runtime of o...

We find an explicit bound, in terms of g when it is even, for the largest element of an aliquot cycle of repdigits to base g.

We consider the problem of finding most balanced cuts among minimum st-edge cuts and minimum st-vertex cuts, for given vertices s and t, according to different balance criteria. For edge cuts [S, S] we seek to maximize min{|S|, |S|}. For vertex cuts C of G we consider the objectives of (i) maximizing min{|S|, |T |}, where {S, T} is a partition of V (G)\C with s ∈ S, t ∈ T and [S, T ] = ∅, (ii) ...