Search results for "symbols.namesake"

Arm Space Decomposition as a Strategy for Tackling Large Scale Multi-armed Bandit Problems

2013

Recent multi-armed bandit based optimization schemes provide near-optimal balancing of arm exploration against arm exploitation, allowing the optimal arm to be identified with probability arbitrarily close to unity. However, the convergence speed drops dramatically as the number of bandit arms grows large, simply because singling out the optimal arm requires experimentation with all of the available arms. Furthermore, effective exploration and exploitation typically demands computational resources that grow linearly with the number of arms. Although the former problem can be remedied to some degree when prior knowledge about arm correlation is available, the latter problem persists. In this…

An Improved Method for Estimating the Time ACF of a Sum of Complex Plane Waves

2010

Time averaging is a well-known technique for evaluating the temporal autocorrelation function (ACF) from a sample function of a stochastic process. For stochastic processes that can be modelled as a sum of plane waves, it is shown that the ACF obtained by time averaging can be expressed as a sum of auto-terms (ATs) and cross-terms (CTs). The ATs result from the autocorrelation of the individual plane waves, while the CTs are due to the cross-correlation between different plane wave components. The CTs cause an estimation error of the ACF. This estimation error increases as the observation time decreases. For the practically important case that the observation time interval is limited, we pr…

Parallel Genetic Solution for Multiobjective MDO

1997

Publisher Summary This chapter reviews a multiobjective, multidisciplinary design optimization of two-dimensional airfoil designs. The control points on leading and trailing edges remain fixed, and the y-coordinates of the other control points are allowed to change during the optimization process. The grid for the Euler solver depends continuously and smoothly on the design parameters. The number of nodes and elements in the mesh might vary according to design because the meshes for the Helmholtz solver are done using the local fitting. The computations are made on an IBM SP2 parallel computer using high-performance switch and the MPICH message-passing library. As gradients are not required…

Max and Emmy Noether: Mathematics in Erlangen

2020

Until 1933, most of Emmy Noether’s life was spent in two middle-sized cities: Erlangen, her birthplace, and Gottingen, where she began her mathematical career.

Weak Maximum Principle and Application to Swimming at Low Reynolds Number

2018

We refer to [9, 42, 46] for more details about the general concepts and notations introduced in this section.

Semi-discrete Galerkin approximation method applied to initial boundary value problems for Maxwell's equations in anisotropic, inhomogeneous media

1981

SynopsisIn this paper the semi-discrete Galerkin approximation of initial boundary value problems for Maxwell's equations is analysed. For the electric field a hyperbolic system of equations is first derived. The standard Galerkin method is applied to this system and a priori error estimates are established for the approximation.

Phonon Deformation Potentials from Raman Measurements on Semiconductor Membranes

1997

Predictive control of networked systems with communication delays

2012

This paper studies the problem of predictive output feedback control for networked control systems with random communication delays. A networked predictive control scheme is employed to compensate for random communication delays, which mainly consists of the control prediction generator and network delay compensator. Furthermore, a new strategy of designing the time-varying predictive controller with mixed random delays for networked systems is proposed. Then the system can be formulated as a Markovian jump system. New techniques are presented to deal with the distributed delay in the discrete-time domain. Based on analysis of closed-loop networked predictive control systems, the designed p…

THE ARITHMETIC BOHR RADIUS

2007

We study the arithmetic Bohr radius of Reinhardt domains in ℂ n which was successfully used in our study of monomial expansions for holomorphic functions in infinite dimensions. We show that this new Bohr radius is different from the radii invented by Boas and Khavinson and Aizenberg. It gives an explicit formula for the n-dimensional hypercone (which means n-dimensional variants of classical results of Bohr and Bombieri), and moreover asymptotically corrects upper and lower estimates for various types of convex and non-convex Reinhardt domains.

Physics meets Bohemia Einstein in Bohemia Michael D. Gordin Princeton University Press, 2020. 360 pp.

2020

In Einstein in Bohemia, Michael Gordin seeks to illuminate the elusive sig­nificance of Einstein9s brief tenure in Prague, both for the biography of the famous physi­cist and for the cultural history of Bohemia. An expert in the his­tory of modern physical sciences and of Russian, European, and American history, Gordin pulls together a wealth of infor­mation about the wider context of Einstein9s stay in Prague and of the cultural, scientific, and political history of Bohemia.