HOMEOMORPHISMS OF THE ANNULUS WITH A TRANSITIVE LIFT II

Let f be a homeomorphism of the closed annulus A that preserves the orientation, the boundary components and that has a lift (f) over tilde to the in finite strip (A) over tilde which is transitive. We show that, if the rotation number of (f) over tilde restricted to both boundary components of A is strictly positive, then there exists a closed nonempty connected set Gamma subset of (A) over tilde such that Gamma subset of] - infinity,0] x [0,1], Gamma is unbounded, the projection of to Gamma A is dense, Gamma - (1, 0) subset of Gamma and (f) over tilde(Gamma) subset of Gamma. Also, if p(1) is the projection on the first coordinate of (A) over tilde, then there exists d > 0 such that, for any (z) over tilde is an element of Gamma, lim sup (n ->infinity) p(1)((f) over tilde (n) ((Z) over tilde)) - p(1) ((Z) over tilde)/n < -d.

Homeomorphisms of the annulus with a transitive lift

Let f be a homeomorphism of the closed annulus A that preserves the orientation, the boundary components and that has a lift (f) over tilde to the infinite strip (A) over tilde which is transitive. We show that, if the rotation numbers of both boundary components of A are strictly positive, then there exists a closed nonempty unbounded set B(-) subset of (A) over tilde such that B(-) is bounded to the right, the projection of B to A is dense, B - (1, 0) subset of B and (f) over tilde (B) subset of B. Moreover, if p(1) is the projection on the first coordinate of (A) over tilde, then there exists d > 0 such that, for any (z) over tilde is an element of B(-), lim sup (n ->infinity) p1((f) over tilde (n)((z) over tilde)) - p(1) ((z) over tilde)/n < - d. In particular, using a result of Franks, we show that the rotation set of any homeomorphism of the annulus that preserves orientation, boundary components, which has a transitive lift without fixed points in the boundary is an interval with 0 in its interior.

On the use of rotational splitting asymmetries to probe the internal rotation profile of stars: Application to beta Cephei stars

Rotationally-split modes can provide valuable information about the internal rotation profile of stars. This has been used for years to infer the internal rotation behavior of the Sun. The present work discusses the potential additional information that rotationally splitting asymmetries may provide when studying the internal rotation profile of stars. We present here some preliminary results of a method, currently under development, which intends: 1) to understand the variation of the rotational splitting asymmetries in terms of physical processes acting on the angular momentum distribution in the stellar interior, and 2) how this information can be used to better constrain the internal rotation profile of the stars. The accomplishment of these two objectives should allow us to better use asteroseismology as a test-bench of the different theories describing the angular momentum distribution and evolution in the stellar interiors. (C) 2010 WILEY-VCH Verlag GmbH&Co. KGaA, Weinheim

Partitions selection strategy for set of clustering solutions

Clustering is a difficult task: there is no single cluster definition and the data can have more than one underlying structure. Pareto-based multi-objective genetic algorithms (e.g., MOCK Multi-Objective Clustering with automatic K-determination and MOCLE-Multi-Objective Clustering Ensemble) were proposed to tackle these problems. However, the output of such algorithms can often contains a high number of partitions, becoming difficult for an expert to manually analyze all of them. In order to deal with this problem, we present two selection strategies, which are based on the corrected Rand, to choose a subset of solutions. To test them, they are applied to the set of solutions produced by MOCK and MOCLE in the context of several datasets. The study was also extended to select a reduced set of partitions from the initial population of MOCLE. These analysis show that both versions of selection strategy proposed are very effective. They can significantly reduce the number of solutions and, at the same time, keep the quality and the diversity of the partitions in the original set of solutions. (C) 2010 Elsevier B.V. All rights reserved.

C(k)-solvability near the characteristic set for a class of planar complex vector fields of infinite type

This paper deals with semi-global C(k)-solvability of complex vector fields of the form L = partial derivative/partial derivative t + x(r) (a(x) + ib(x))partial derivative/partial derivative x, r >= 1, defined on Omega(epsilon) = (-epsilon, epsilon) x S(1), epsilon > 0, where a and b are C(infinity) real-valued functions in (-epsilon, epsilon). It is shown that the interplay between the order of vanishing of the functions a and b at x = 0 influences the C(k)-solvability at Sigma = {0} x S(1). When r = 1, it is permitted that the functions a and b of L depend on the x and t variables, that is, L = partial derivative/partial derivative t + x(a(x, t) + ib(x, t))partial derivative/partial derivative x, where (x, t) is an element of Omega(epsilon).

Gevrey solvability near the characteristic set for a class of planar complex vector fields of infinite type

We study the Gevrey solvability of a class of complex vector fields, defined on Omega(epsilon) = (-epsilon, epsilon) x S(1), given by L = partial derivative/partial derivative t + (a(x) + ib(x))partial derivative/partial derivative x, b not equivalent to 0, near the characteristic set Sigma = {0} x S(1). We show that the interplay between the order of vanishing of the functions a and b at x = 0 plays a role in the Gevrey solvability. (C) 2008 Elsevier Inc. All rights reserved.

A geometric mass-preserving redistancing scheme for the level set function

In this paper we describe and evaluate a geometric mass-preserving redistancing procedure for the level set function on general structured grids. The proposed algorithm is adapted from a recent finite element-based method and preserves the mass by means of a localized mass correction. A salient feature of the scheme is the absence of adjustable parameters. The algorithm is tested in two and three spatial dimensions and compared with the widely used partial differential equation (PDE)-based redistancing method using structured Cartesian grids. Through the use of quantitative error measures of interest in level set methods, we show that the overall performance of the proposed geometric procedure is better than PDE-based reinitialization schemes, since it is more robust with comparable accuracy. We also show that the algorithm is well-suited for the highly stretched curvilinear grids used in CFD simulations. Copyright (C) 2010 John Wiley & Sons, Ltd.

Crop rotation scheduling with adjacency constraints

In this article we propose a 0-1 optimization model to determine a crop rotation schedule for each plot in a cropping area. The rotations have the same duration in all the plots and the crops are selected to maximize plot occupation. The crops may have different production times and planting dates. The problem includes planting constraints for adjacent plots and also for sequences of crops in the rotations. Moreover, cultivating crops for green manuring and fallow periods are scheduled into each plot. As the model has, in general, a great number of constraints and variables, we propose a heuristics based on column generation. To evaluate the performance of the model and the method, computational experiments using real-world data were performed. The solutions obtained indicate that the method generates good results.

Sustainable vegetable crop supply problem

We consider an agricultural production problem, in which one must meet a known demand of crops while respecting ecologically-based production constraints. The problem is twofold: in order to meet the demand, one must determine the division of the available heterogeneous arable areas in plots and, for each plot, obtain an appropriate crop rotation schedule. Rotation plans must respect ecologically-based constraints such as the interdiction of certain crop successions, and the regular insertion of fallows and green manures. We propose a linear formulation for this problem, in which each variable is associated with a crop rotation schedule. The model may include a large number of variables and it is, therefore, solved by means of a column-generation approach. We also discuss some extensions to the model, in order to incorporate additional characteristics found in field conditions. A set of computational tests using instances based on real-world data confirms the efficacy of the proposed methodology. (C) 2009 Elsevier B.V. All rights reserved.

Partial spectral projected gradient method with active-set strategy for linearly constrained optimization

A method for linearly constrained optimization which modifies and generalizes recent box-constraint optimization algorithms is introduced. The new algorithm is based on a relaxed form of Spectral Projected Gradient iterations. Intercalated with these projected steps, internal iterations restricted to faces of the polytope are performed, which enhance the efficiency of the algorithm. Convergence proofs are given and numerical experiments are included and commented. Software supporting this paper is available through the Tango Project web page: http://www.ime.usp.br/similar to egbirgin/tango/.

Job rotation in assembly lines employing disabled workers

In this paper we consider the programming of job rotation in the assembly line worker assignment and balancing problem. The motivation for this study comes from the designing of assembly lines in sheltered work centers for the disabled, where workers have different task execution times. In this context, the well-known training aspects associated with job rotation are particularly desired. We propose a metric along with a mixed integer linear model and a heuristic decomposition method to solve this new job rotation problem. Computational results show the efficacy of the proposed heuristics. (C) 2009 Elsevier B.V. All rights reserved.

A Parallel Hardware Architecture for Scale and Rotation Invariant Feature Detection

This paper proposes a parallel hardware architecture for image feature detection based on the Scale Invariant Feature Transform algorithm and applied to the Simultaneous Localization And Mapping problem. The work also proposes specific hardware optimizations considered fundamental to embed such a robotic control system on-a-chip. The proposed architecture is completely stand-alone; it reads the input data directly from a CMOS image sensor and provides the results via a field-programmable gate array coupled to an embedded processor. The results may either be used directly in an on-chip application or accessed through an Ethernet connection. The system is able to detect features up to 30 frames per second (320 x 240 pixels) and has accuracy similar to a PC-based implementation. The achieved system performance is at least one order of magnitude better than a PC-based solution, a result achieved by investigating the impact of several hardware-orientated optimizations oil performance, area and accuracy.

Rotation effect on geodesic and zonal flow modes in tokamak plasmas with isothermal magnetic surfaces

The electrostatic geodesic mode oscillations are investigated in rotating large aspect ratio tokamak plasmas with circular isothermal magnetic surfaces. The analysis is carried out within the magnetohydrodynamic model including heat flux to compensate for the non-adiabatic pressure distribution along the magnetic surfaces in plasmas with poloidal rotation. Instead of two standard geodesic modes, three geodesic continua are found. The two higher branches of the geodesic modes have a small frequency up-shift from ordinary geodesic acoustic and sonic modes due to rotation. The lower geodesic continuum is a newzonal flowmode (geodesic Doppler mode) in plasmas with mainly poloidal rotation. Limits to standard geodesic modes are found. Bifurcation of Alfven continuum by geodesic modes at the rational surfaces is also discussed. Due to that, the frequency of combined geodesic continuum extends from the poloidal rotation frequency to the ion-sound band that can have an important role in suppressing plasma turbulence.

Temporal behaviour of toroidal rotation velocity in the TCABR tokamak

A new method for determining the temporal evolution of plasma rotation is reported in this work. The method is based upon the detection of two different portions of the spectral profile of a plasma impurity line, using a monochromator with two photomultipliers installed at the exit slits. The plasma rotation velocity is determined by the ratio of the two detected signals. The measured toroidal rotation velocities of C III (4647.4 angstrom) and C VI (5290.6 angstrom), at different radial positions in TCABR discharges, show good agreement, within experimental uncertainty, with previous results (Severo et al 2003 Nucl. Fusion 43 1047). In particular, they confirm that the plasma core rotates in the direction opposite to the plasma current, while near the plasma edge (r/a > 0.9) the rotation is in the same direction. This technique was also used to investigate the dependence of toroidal rotation on the poloidal position of gas puffing. The results show that there is no dependence for the plasma core, while for plasma edge (r/a > 0.9) some dependence is observed.

Systematics of nuclear densities, deformations and excitation energies within the context of the generalized rotation-vibration model

We present a large-scale systematics of charge densities, excitation energies and deformation parameters For hundreds of heavy nuclei The systematics is based on a generalized rotation vibration model for the quadrupole and octupole modes and takes into account second-order contributions of the deformations as well as the effects of finite diffuseness values for the nuclear densities. We compare our results with the predictions of classical surface vibrations in the hydrodynamical approximation. (C) 2010 Elsevier B V All rights reserved.