Infinite symmetries in the Skyrme model

We show that the Skyrme theory possesses a submodel with an infinite number of local conserved currents. The constraints leading to the submodel explore a decomposition of SU(2) with a complex field parametrizing the symmetric space SU(2)/U(1) and a real field in the direction of U(1). We demonstrate that the Skyrmions of topological charges ii belong to such integrable sector of the theory. Our results open ways to the development of exact methods, compensating for the non-existence of a BPS type sector in the Skyrme theory. (C) 2001 Published by Elsevier B.V. B.V.

Bayesian approximations in randomized response model

Practical Bayesian inference depends upon detailed examination of posterior distribution. When the prior and likelihood are conjugate, this is easily carried out; however, in general, one must resort to numerical approximation. In this paper, our aim is to solve, using MAPLE, the Bayesian paradigm, for a very special data collecting procedure, known as the randomized-response technique. This allows researchers to obtain sensitive information while guaranteeing privacy to respondents. This approach intends to reduce false responses on sensitive questions. Exact methods and approximations will be compared from the accuracy point of view as well as for the computational effort.

Problem of assignment cells to switches in a cellular mobile network via beam search method

The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.

A decomposition heuristic for the maximal covering location problem

This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facilities that attend a same client. Coupling constraints, corresponding to some edges of this graph, are identified and relaxed in the Lagrangean way, resulting in disconnected subgraphs representing smaller subproblems that are computationally easier to solve by exact methods. The proposed technique is compared to the classical approach, using real data and instances from the available literature. © 2010 Edson Luiz França Senne et al.

Bayesian L-optimal exact design of experiments for biological kinetic models

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

On certain new exact solutions of a diffusive predator-prey system

We construct exact solutions for a system of two coupled nonlinear partial differential equations describing the spatio-temporal dynamics of a predator-prey system where the prey per capita growth rate is subject to the Allee effect. Using the G'/G expansion method, we derive exact solutions to this model for two different wave speeds. For each wave velocity we report three different forms of solutions. We also discuss the biological relevance of the solutions obtained. © 2012 Elsevier B.V.

Spurious transients of projection methods in microflow simulations

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)