Abstract—This paper presents a numerical solution, namely limit and shakedown analysis, to predict the safety state of smart structures made of heterogeneous materials under unknown cyclic loadings, for instance, the flexure hinge in the micro-positioning stage driven by piezoelectric actuator. In combination of homogenization theory and finite-element method (FEM), the safety evaluation proble...

This paper presents an algorithm for solving global optimization problems with bounded variables. The algorithm is a modification of the electromagnetism-like mechanism proposed by Birbil and Fang [J. of Global Optimization 25 (2003), pp. 263-282]. The differences are mainly on the local search procedure and on the force vector used to move each point in the population. Several widely used benc...

Most popular programming languages are strict. In a strict language, the binding of a variable to an expression coincides with the evaluation of the expression. Non-strict languages attempt to make life easier for programmers by decoupling expression binding and expression evaluation. In a non-strict language, a variable can be bound to an unevaluated expression, and such expressions can be pas...

We show that a non-expansive action of a topological semigroup S on a metric space X is linearizable iff its orbits are bounded. The crucial point here is to prove that X can be extended by adding a fixed point of S, thus allowing application of a semigroup version of the Arens-Eells linearization, iff the orbits of S in X are bounded.

By relating positive inductive definitions to space-bounded computations of alternating Turing machines, Rounds, Comp. Linguistics 14, 1988, has given uniform grammatical characterizations of the EXPTIME and PTIME languages. But his proof gives fairly poor bounds for language recognition with context-free resp. head grammars. We improve Rounds’ analysis in two respects: first, we introduce a mo...

We present a memory-bounded approximate algorithm for solving infinite-horizon decentralized partially observable Markov decision processes (DEC-POMDPs). In particular, we improve upon the bounded policy iteration (BPI) approach, which searches for a locally optimal stochastic finite state controller, by accompanying reachability analysis on controller nodes. As a result, the algorithm has diff...

Given an undirected planar graph G with n vertices and a set S of n points inside a simple polygon P , a point-set embedding of G on S is a planar drawing of G such that each vertex is mapped to a distinct point of S and the edges are polygonal chains surrounded by P . A special case of the embedding problem is that in which G is a balanced binary tree. In this paper, we present a new algorithm...

We show that a continuous map or a continuous flow on Rn with a certain recurrence relation must have a fixed point. Specifically, if there is a compact set W with the property that the forward orbit of every point in R n intersects W then there is a fixed point in W . Consequently, if the omega limit set of every point is nonempty and uniformly bounded then there is a fixed point. In this note...

We consider a dissipative map of the plane with a bounded perturbation term. This perturba-tion represents e.g. an extra time dependent term, a coupling to another system or noise. Theunperturbed map has a spiral attracting fixed point. We derive an analytical/numerical method todetermine the effect of the additional term on the phase portrait of the original map, as a function<...

A connection is established between uniform rational approximation and approximation in the mean by polynomials on compact nowhere dense subsets of the complex plane C. Peak points for R(X) and bounded point evaluations for Hp(X, dA), 1 ≤ p < ∞, play a fundamental role.