Fixed point theorems in metric spaces

In this paper, we establish two general theorems for equivalence between the Meir–Keeler type contractive conditions and the contractive definitions involving gauge functions. One of these theorems is an extension of a recent result of Lim (On characterization of Meir–Keeler contractive maps, Nonlinear Anal. 46 (2001) 113–120).     

Dual Characterizations of Set Containments with Strict Convex Inequalities

Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems where they are used to describe the containments as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.     

Orders of Indescribable Sets

We extract some properties of Mahlo’s operation and show that some other very natural operations share these properties. The weakly compact sets form a similar hierarchy as the stationary sets. The height of this hierarchy is a large cardinal property connected to saturation properties of the weakly compact ideal.     

A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms

This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems (MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented. An erratum to this article is available at .     

Magnetic anisotropy and anisotropic ballistic conductance of thin magnetic wires

The magnetocrystalline anisotropy of thin magnetic wires of iron and cobalt is quite different from the bulk phases. The spin moment of monatomic Fe wire may be as high as 3.4 μ_B, while the orbital moment as high as 0.5 μ_B. The magnetocrystalline anisotropy energy (MAE) was calculated for wires up to 0.6 nm in diameter starting from monatomic wire and adding consecutive shells for thicker wires. I observe that Fe wires exhibit the change sign with the stress applied along the wire. It means that easy axis may change from the direction along the wire to perpendicular to the wire. We find that ballistic conductance of the wire depends on the direction of the applied magnetic field, i.e. shows anisotropic ballistic magnetoresistance. This effect occurs due to the symmetry dependence of the splitting of degenerate bands in the applied field which changes the number of bands crossing the Fermi level. We find that the ballistic conductance changes with applied stress. Even for thicker wires the ballistic conductance changes by factor 2 on moderate tensile stain in our 5×4 model wire. Thus, the ballistic conductance of magnetic wires changes in the applied field due to the magnetostriction. This effect can be observed as large anisotropic BMR in the experiment.     

Local homology and dimensional full-valuedness

A natural criterion for dimensional full-valuedness of locally compact spaces with finitely generated local homology is given.     

The π-π-theorem for manifold pairs with boundaries

The surgery obstruction of a normal map to a simple Poincaré pair (X, Y) lies in the relative surgery obstruction group L _*(π ₁(Y) → π ₁(X)). A well-known result of Wall, the so-called π-π-theorem, states that in higher dimensions a normal map of a manifold with boundary to a simple Poincaré pair with π ₁(X) ? π ₁(Y) is normally bordant to a simple homotopy equivalence of pairs. In order to study normal maps to a manifold with a submanifold, Wall introduced the surgery obstruction groups LP _* for manifold pairs and splitting obstruction groups LS _*. In the present paper, we formulate and prove for manifold pairs with boundary results similar to the π-π-theorem. We give direct geometric proofs, which are based on the original statements of Wall’s results and apply obtained results to investigate surgery on filtered manifolds.     

An Implicit Iteration Process with Errors for a Finite Family of r-strictly Asymptotically Pseudocontractive Mappings

In this paper,we will establish several strong convergence theorems for the approximation ofcommon fixed points of r-strictly asymptotically pseudocontractive mappings in uniformly convex Banachspaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditionsfor the convergence of the sequence.Our results generalize,extend and improve the recent work,in thistopic.     

Achievable sets, brambles, and sparse treewidth obstructions

One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18