Worst-case analysis of a dynamic channel assignment strategy

We consider the problem of channel assignment in cellular networks with arbitrary reuse distance. We show upper and lower bounds for the competitive ratio of a previously proposed and widely studied version of dynamic channel assignment, which we refer to as the greedy algorithm. We study two versions of this algorithm: one that performs reassignment of channels, and one that never reassigns channels to calls. For reuse distance 2, we show tight bounds on the competitive ratio of both versions of the algorithm. For reuse distance 3, we show non-trivial lower bounds for both versions of the algorithm.     

Harmonic functions with boundary values on Herz spaces

We discuss continuity of the Poisson transform on Herz spaces Bp as well as its action on weighted versions of these sets. We also consider Banach- valued versions of Herz spaces and study some of their properties.     

Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation

We consider the “flow on paths” versions of Max Flow and Min Cut when we restrict to paths having at most B arcs, and for versions where we allow fractional solutions or require integral solutions. We show that the continuous versions are polynomial even if B is part of the input, but that the integral versions are polynomial only when B ≤ 3. However, when B ≤ 3 we show how to solve the problems using ordinary Max Flow/Min Cut. We also give tight bounds on the integrality gaps between the integral and continuous objective values for both problems, and between the continuous objective values for the bounded-length paths version and the version allowing all paths. We give a primal–dual approximation algorithm for both problems whose approximation ratio attains the integrality gap, thereby showing that it is the best possible primal–dual approximation algorithm.     

Towards computability of elliptic boundary value problems in variational formulation

We present computable versions of the Fréchet–Riesz Representation Theorem and the Lax–Milgram Theorem. The classical versions of these theorems play important roles in various problems of mathematical analysis, including boundary value problems of elliptic equations. We demonstrate how their computable versions yield computable solutions of the Neumann and Dirichlet boundary value problems for a simple non-symmetric elliptic differential equation in the one-dimensional case. For the discussion of these elementary boundary value problems, we also provide a computable version of the Theorem of Schauder, which shows that the adjoint of a computably compact operator on Hilbert spaces is computably compact again.     

Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data

We address an integrated logistic system where decisions on location of depot, vehicle routing and assignment of routes to vehicles are considered simultaneously. Total cost and workload balance are common criteria influencing decision-making. Literature on location-routing problems addressed the location and vehicle routing decisions with a common assumption of assigning one route to one vehicle. However, the cost of acquiring vehicles (and crew) is often more significant than the routing cost. This notion of assigning several routes to a vehicle during the routing procedure is explored in our integrated model. We apply metaheuristics of tabu search and simulated annealing on real data and simulated data, to compare their performances under two versions: simultaneous or sequential routes assignment to vehicles. A new statistical procedure is proposed to compare two algorithms on the strength of their multi-objective solutions. Results show that the simultaneous versions have advantage over the sequential versions in problems where routes are capacity-constrained, but not in the time dimension. The simultaneous versions are also more effective in generating non-dominated solutions than the sequential versions.     

On statistical exhaustiveness

We study statistical versions of several types of convergence of sequences of functions between two metric spaces. Special attention is devoted to statistical versions of recently introduced notions of exhaustiveness (Gregoriades and Papanastassiou (2008) [4]) and strong uniform convergence on a bornology (Beer and Levi (2009) [3]). We obtain a few results about the continuity of the statistical pointwise limit of a sequence of functions.     

Operator Aczél inequality

We establish several operator versions of the classical Aczél inequality. One of operator versions deals with the weighted operator geometric mean and another is related to the positive sesquilinear forms. Some applications including the unital positive linear maps on C^*-algebras and the unitarily invariant norms on matrices are presented.     

Distributional versions of littlewood’s Tauberian theorem

We provide several general versions of Littlewood’s Tauberian theorem. These versions are applicable to Laplace transforms of Schwartz distributions. We employ two types of Tauberian hypotheses; the first kind involves distributional boundedness, while the second type imposes a one-sided assumption on the Cesàro behavior of the distribution. We apply these Tauberian results to deduce a number of Tauberian theorems for power series and Stieltjes integrals where Cesàro summability follows from Abel summability. We also use our general results to give a new simple proof of the classical Littlewood one-sided Tauberian theorem for power series.     

Comparing different versions of tiling cohomology

We establish direct isomorphisms between different versions of tiling cohomology. The first version is the direct limit of the cohomologies of the approximants in the Anderson-Putnam-Gähler system, the second is the recently introduced PV-cohomology of Savinien and Bellissard and the third is pattern equivariant cohomology. For the last two versions one can define weak cohomology groups. We show that the isomorphisms extend to the weak versions. This leads to an alternative formulation of the pattern equivariant mixed quotient group which describes deformations of the tiling modulo topological conjugacy.     

Meeting infinitely many cells of a partition once

We investigate several versions of a cardinal characteristic defined by Frankiewicz. Vojtáš showed , and Blass showed . We show that all the versions coincide and that is greater than or equal to the splitting number. We prove the consistency of and of . Received: 2 October 1996 / Revised version: 22 May 1997     

QZ algorithm with two-sided generalized Rayleigh quotient shifts

We generalize the recently proposed two-sided Rayleigh quotient single-shift and the two-sided Grassmann–Rayleigh quotient double-shift used in the QR algorithm and apply the generalized versions to the QZ algorithm. With such shift strategies the QZ algorithm normally has a cubic local convergence rate. Our main focus is on the modified shift strategies and their corresponding truncated versions. Numerical examples are provided to demonstrate the convergence properties and the efficiency of the QZ algorithm equipped with the proposed shifts. For the truncated versions, local convergence analysis is not provided. Numerical examples show they outperform the modified shifts and the standard Rayleigh quotient single-shift and Francis double-shift.     

Monotonic Variable Consistency Rough Set Approaches

We consider probabilistic rough set approaches based on different versions of the definition of rough approximation of a set. In these versions, consistency measures are used to control assignment of objects to lower and upper approximations. Inspired by some basic properties of rough sets, we find it reasonable to require from these measures several properties of monotonicity. We consider three types of monotonicity properties: monotonicity with respect to the set of attributes, monotonicity with respect to the set of objects, and monotonicity with respect to the dominance relation. We show that consistency measures used so far in the definition of rough approximation lack some of these monotonicity properties. This observation led us to propose new measures within two kinds of rough set approaches: Variable Consistency Indiscernibility-based Rough Set Approaches (VC-IRSA) and Variable Consistency Dominance-based Rough Set Approaches (VC-DRSA). We investigate properties of these approaches and compare them to previously proposed Variable Precision Rough Set (VPRS) model, Rough Bayesian (RB) model, and previous versions of VC-DRSA.     

Combinatorial Generalizations of Jung’s Theorem

We consider combinatorial generalizations of Jung’s theorem on covering a set by a ball. We prove the “fractional” and “colorful” versions of the theorem.     

Frobenius and Dieudonné theorems over semirings

We obtain semiring versions of classical theorems by Frobenius and Dieudonné on determinant, singularity, and non-singularity preservers.     

Gradient methods with regularization for constrained optimization problems and their complexity estimates

We suggest simple implementable modifications of conditional gradient and gradient projection methods for smooth convex optimization problems in Hilbert spaces. Usually, the custom methods attain only weak convergence. We prove strong convergence of the new versions and establish their complexity estimates, which appear similar to the convergence rate of the weakly convergent versions. Preliminary results of computational tests confirm efficiency of the proposed modification.     

On the swapping algorithm

The Metropolis‐coupled Markov chain method (or “Swapping Algorithm”) is an empirically successful hybrid Monte Carlo algorithm. It alternates between standard transitions on parallel versions of the system at different parameter values, and swapping two versions. We prove rapid mixing for two bimodal examples, including the mean‐field Ising model. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 22: 66–97, 2002     

The Clifford-Fourier Transform {\mathcal {F}_o} and Monogenic Extensions

In the last decade several versions of the Fourier transform have been formulated in the framework of Clifford algebra. We present a (Clifford-Fourier) transform, constructed using the geometric properties of Clifford algebra. We show the corresponding results of operational calculus, and a connection between the Fourier transform and this new transform. We obtain a technique to construct monogenic extensions of a certain type of continuous functions, and versions of the Paley-Wiener theorems are formulated.     

The axiomatic approach to three values in games with coalition structure

We present a unified framework for a broad class of values in transferable utility games with coalition structure, including the Owen coalitional value and two weighted versions with weights given by the size of the coalitions. We provide three axiomatic characterizations using the properties of Efficiency, Linearity, Independence of Null Coalitions, and Coordination, with two versions of Balanced Contributions inside a Coalition and Weighted Sharing in Unanimity Games, respectively.     

Two-Sided Probabilistic Versions of Hardy’s Inequality

We prove two probabilistic versions of Hardy’s inequality concerning the Fourier coefficients of an integrable function on the unit circle.