Cancellation of acoustic scattering from an elastic sphere

Recent research has suggested the possibility of creating acoustic cloaks using metamaterial layers to eliminate the acoustic field scattered from an elastic object. This paper explores the possibility of applying the scattering cancellation cloaking technique to acoustic waves and the use of this method to investigate its effectiveness in cloaking elastic and fluid spheres using only a single isotropic elastic layer. Parametric studies showing the influence of cloak stiffness and geometry on the frequency dependent scattering cross-section of spheres have been developed to explore the design space of the cloaking layer. This analysis shows that an appropriately designed single isotropic elastic cloaking layer can provide up to 30 dB of scattering reduction for ka values up to 1.6. This work also illustrates the importance of accounting for the elasticity of the object and the relevant limitations of simplistic quasi-static analyses proposed in recent papers.     

Totally asymmetric simple exclusion process on networks

We study the totally asymmetric simple exclusion process (TASEP) on complex networks, as a paradigmatic model for transport subject to excluded volume interactions. Building on TASEP phenomenology on a single segment and borrowing ideas from random networks we investigate the effect of connectivity on transport. In particular, we argue that the presence of disorder in the topology of vertices crucially modifies the transport features of a network: irregular networks involve homogeneous segments and have a bimodal distribution of edge densities, whereas regular networks are dominated by shocks leading to a unimodal density distribution. The proposed numerical approach of solving for mean-field transport on networks provides a general framework for studying TASEP on large networks, and is expected to generalize to other transport processes.     

Stability in the Rotating Bénard Problem and Its Optimal Lyapunov Functions

Stability analysis of the rotating Bénard problem gives a spectral instability threshold of the purely conducting solution that can be expressed as a critical Rayleigh number R ² depending on the Taylor number T ². The definition of a functional which can be used to prove Lyapunov stability up to the threshold of spectral instability (optimal Lyapunov function) is an important step forward both, for a proof of nonlinear stability and for the investigation of the basin of attraction of the equilibrium. In previous works a Lyapunov function was found, but its optimality could be proven only for small T ². In this work we describe the reason why this happens, and provide a weaker definition of Lyapunov function which allows to prove that, for the linearized system, the spectral instability threshold is also the Lyapunov stability threshold for every value of T ².     

Bilevel programming and the separation problem

In recent years, branch-and-cut algorithms have become firmly established as the most effective method for solving generic mixed integer linear programs (MILPs). Methods for automatically generating inequalities valid for the convex hull of solutions to such MILPs are a critical element of branch-and-cut. This paper examines the nature of the so-called separation problem, which is that of generating a valid inequality violated by a given real vector, usually arising as the solution to a relaxation of the original problem. We show that the problem of generating a maximally violated valid inequality often has a natural interpretation as a bilevel program. In some cases, this bilevel program can be easily reformulated as a simple single-level mathematical program, yielding a standard mathematical programming formulation for the separation problem. In other cases, no such polynomial-size single-level reformulation exists unless the polynomial hierarchy collapses to its first level (an event considered extremely unlikely in computational complexity theory). We illustrate our insights by considering the separation problem for two well-known classes of valid inequalities.     

Discretization orders for protein side chains

Proteins are important molecules that are widely studied in biology. Since their three-dimensional conformations can give clues about their function, an optimal methodology for the identification of such conformations has been researched for many years. Experiments of Nuclear Magnetic Resonance (NMR) are able to estimate distances between some pairs of atoms forming the protein, and the problem of identifying the possible conformations satisfying the available distance constraints is known in the scientific literature as the Molecular Distance Geometry Problem (MDGP). When some particular assumptions are satisfied, MDGP instances can be discretized, and solved by employing an ad-hoc algorithm, named the interval Branch & Prune. When dealing with molecules such as proteins, whose chemical structure is known, a priori information can be exploited for generating atomic orderings that allow for the discretization. In previous publications, we presented a handcrafted order for the protein backbones. In this work, we propose 20 new orders for the 20 side chains that can be present in proteins. Computational experiments on artificial and real instances from NMR show the usefulness of the proposed orders.     

Berezin quantization of homogeneous bounded domains

We prove that a homogeneous bounded domain admits a Berezin quantization.     

Overlapping Schwarz methods for Maxwell's equations in three dimensions

Summary. A two-level overlapping Schwarz method is considered for a Nédélec finite element approximation of 3D Maxwell's equations. For a fixed relative overlap, the condition number of the method is bounded, independently of the mesh size of the triangulation and the number of subregions. Our results are obtained with the assumption that the coarse triangulation is quasi-uniform and, for the Dirichlet problem, that the domain is convex. Our work generalizes well–known results for conforming finite elements for second order elliptic scalar equations. Numerical results for one and two-level algorithms are also presented. Received November 11, 1997 / Revised version received May 26, 1999 / Published online June 21, 2000     

Students discussing mathematics in small-group interactions: opportunities for discursive negotiation processes focused on contentious mathematical issues

Small-group discussions involving students and their teacher that focus on meanings constructed during the mathematics lessons or solutions to problems produced in these lessons offer great potential for debate and argument. An analysis of the epistemological nature of knowledge can give deeper insight, to gain a better understanding of the emerging discontinuities in argumentations, negotiations, and clarifications about contentious meaning differences that arise. In most cases mathematical interactions between students and a teacher about contentions are very fragile and seem to be handled more or less directly—by side-stepping to another topic or by resolving via the teacher’s authority, for example. Therefore, the maintenance of such negotiation processes in mathematics teaching is a specific challenge for students and the teacher. The type of closure of these processes seems to be related to the emerging maintenance processes. In this paper, small-group discussions are interpretatively analyzed in the three steps “Initiation—Maintenance—Closing” with the focus on fundamental (dialogical) learning.     

Orlicz–Sobolev boundary trace embeddings

We prove a sharp trace embedding theorem for Orlicz–Sobolev spaces into Orlicz spaces on the boundary. An optimal trace embedding into more general rearrangement invariant spaces on the boundary is also established.