Extending Whitney's extension theorem: nonlinear function spaces

We consider a global, nonlinear version of the Whitney extension problem for manifold-valued smooth functions on closed domains $C$, with non-smooth boundary, in possibly non-compact manifolds. Assuming $C$ is a submanifold with corners, or is compact and locally convex with rough boundary, we prove that the restriction map from everywhere-defined functions is a submersion of locally convex manifolds and so admits local linear splittings on charts. This is achieved by considering the corresponding restriction map for locally convex spaces of compactly-supported sections of vector bundles, allowing the even more general case where $C$ only has mild restrictions on inward and outward cusps, and proving the existence of an extension operator.Comment: 37 pages, 1 colour figure. v2 small edits, correction to Definition A.3, which makes no impact on proofs or results. Version submitted for publication. v3 small changes in response to referee comments, title extended. v4 crucial gap filled, results not affected. v5 final version to appear in Annales de l'Institut Fourie

A clustering particle swarm optimizer for dynamic optimization

This article is posted here with permission of the IEEE - Copyright @ 2009 IEEEIn the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal solution but also track the trajectory of the changing global best solution in a dynamic environment. To achieve this, this paper proposes a clustering particle swarm optimizer (CPSO) for dynamic optimization problems. The algorithm employs hierarchical clustering method to track multiple peaks based on a nearest neighbor search strategy. A fast local search method is also proposed to find the near optimal solutions in a local promising region in the search space. Six test problems generated from a generalized dynamic benchmark generator (GDBG) are used to test the performance of the proposed algorithm. The numerical experimental results show the efficiency of the proposed algorithm for locating and tracking multiple optima in dynamic environments.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of the United Kingdom under Grant EP/E060722/1

Information Flow Model for Commercial Security

Information flow in Discretionary Access Control (DAC) is a well-known difficult problem. This paper formalizes the fundamental concepts and establishes a theory of information flow security. A DAC system is information flow secure (IFS), if any data never flows into the hands of owner’s enemies (explicitly denial access list.