Maintaining the Minimal Distance of a Point Set in Poly-logarithmic Time.
(Local) self-similarity is a seminal concept, especially for Euclidean random fields. We study in this paper the extension of these notions to manifold indexed fields. We give conditions on the (local) self-similarity index that ensure the existence of fractional fields. Moreover, we explain how to identify the self-similar index. We describe a way of simulating Gaussian fractional fields.
(Local) self-similarity is a seminal concept, especially for Euclidean random fields. We study in this paper the extension of these notions to manifold indexed fields. We give conditions on the (local) self-similarity index that ensure the existence of fractional fields. Moreover, we explain how to identify the self-similar index. We describe a way of simulating Gaussian fractional fields.
Abstract. At an exclusively online university such as the UOC the necessity for communicating mathematics in the web is pressing. In an environment that does not allow for face to face communication, things implicitly communicated when using a blackboard, such as the canonical verbalization or handwriting of formulae, are lost and become a big obstacle. Also, the editorial process for the creation of learning/teaching resources is suited for a generalist approach and, consequently, needs such as...
In most cases the current on-line journals in mathematics are supplied in the form of PDF with print images of papers in the front and OCR’ed hidden texts behind to provide with search facilily using key words. The embedded hidden texts usually does not include good information about mathematical formulae in the papers. We can say that, for the future development of DML, it is desirable to include, in the digitised journals, more structured information of the content of mathematical papers, e.g....
Saccular aneurisms, swelling of a blood vessel, are investigated in order (i) to estimate the development risk of the wall lesion, before and after intravascular treatment, assuming that the pressure is the major factor, and (ii) to better plan medical interventions. Numerical simulations, using the finite element method, are performed in three-dimensional aneurisms. Computational meshes are derived from medical imaging data to take into account both between-subject and within-subject anatomical...
Saccular aneurisms, swelling of a blood vessel, are investigated in order (i) to estimate the development risk of the wall lesion, before and after intravascular treatment, assuming that the pressure is the major factor, and (ii) to better plan medical interventions. Numerical simulations, using the finite element method, are performed in three-dimensional aneurisms. Computational meshes are derived from medical imaging data to take into account both between-subject and within-subject anatomical...
For preparing and validating metadata for the Digital Mathematics Library DML-CZ, a new tool, the Metadata Editor, has been developed. This paper outlines the procedures for Linguistic and geographical localizations its components. Also mentioned are such aspects as dynamic generation of form editing based on the XML Schema, the validation procedures as well as support for semiautomatic procedures regarding quality assurance.
In this article, a technique called Meta-Optimization is used to enhance the effectiveness of bio-inspired algorithms that solve antenna array synthesis problems. This technique consists on a second optimization layer that finds the best behavioral parameters for a given algorithm, which allows to achieve better results. Bio-inspired computational methods are useful to solve complex multidimensional problems such as the design of antenna arrays. However, their performance depends heavily on the...
We present briefly some results we obtained with known methods to solve minimum cost tension problems, comparing their performance on non-specific graphs and on series-parallel graphs. These graphs are shown to be of interest to approximate many tension problems, like synchronization in hypermedia documents. We propose a new aggregation method to solve the minimum convex piecewise linear cost tension problem on series-parallel graphs in operations.
We present briefly some results we obtained with known methods to solve minimum cost tension problems, comparing their performance on non-specific graphs and on series-parallel graphs. These graphs are shown to be of interest to approximate many tension problems, like synchronization in hypermedia documents. We propose a new aggregation method to solve the minimum convex piecewise linear cost tension problem on series-parallel graphs in O(m3) operations.