Virtually all mail sorting machines currently used in China only recognize post code and ignore the useful destination address information on the envelopes. This paper discusses how to eciently utilize such important information on handwritten Chinese envelopes in order to improve the sorting performance. For this purpose, two particular problems are addressed, respectively. One is the locatio...

In this paper we propose a general framework for character segmentation in complex multilingual documents, which is an endeavor to combine the traditionally separated segmentation and recognition processes into a cooperative system. The framework contains three basic steps: Dissection, Local Optimization and Global Optimization, which are designed to fuse various properties of the segmentation ...

In this paper, we prove new common best proximity point theorems for proximity commuting mapping by using concept of Geraghty’s theorem in complete metric spaces. Our results improve and extend recent result of Sadiq Basha [Basha, S. S., Common best proximity points: global minimization of multi-objective functions, J. Glob Optim, 54 (2012), No. 2, 367-373] and some results in the literature. A...

In this paper short introduction in dielectric lens antennas at mm-waves will be given. Dielectric lens antennas become more popular as applications start to migrate to higher frequencies where lens dimensions and weight become small enough and allow easy integration. Typically used feeds and lens shapes will be discussed together with global optimization techniques and analyzing kernels employ...

Metaheuristic algorithms are often nature-inspired, and they are becoming very powerful in solving global optimization problems. More than a dozen of major metaheuristic algorithms have been developed over the last three decades, and there exist even more variants and hybrid of metaheuristics. This paper intends to provide an overview of nature-inspired metaheuristic algorithms, from a brief hi...

Programs written in point-free form express computation purely in terms of functions. Such programs are especially amenable to local transformation. In this paper, we describe a process for optimising the transport of data through point-free programs. This process systematically applies local transformations to achieve effective global optimisation. We describe the strategies we employ to ensur...

We use the simple, but little-known, result that a uniformly continuous function on a convex set is -Lipschitz (as defined below) to extend Piyavskii’s algorithm for Lipschitz global optimization to the larger domain of continuous (not-necessarilyLipschitz) global optimization.

The aim of this paper is to describe and analyse function-als which can be used for computing hyperthermia treatment plans. All these functionals have in common that they can be optimised by eecient numerical methods. These methods have been implemented and tested with real data from the Rudolf Virchow Klinikum, Berlin. The results obtained by these methods are comparable to those obtained by c...

Some methods based on simple regularizing geometric element transformations have heuristically been shown to give runtime efficient and quality effective smoothing algorithms for meshes. We describe the mathematical framework and a systematic approach to global optimization-based versions of such methods for mixed volume meshes, which generalizes to arbitrary dimensions. We also identify some a...