Two new species and a review of the inseminating freshwater fish genus Monotocheirodon (Characiformes: Characidae) from Peru and Bolivia

Two new species of inseminating freshwater fishes of the genus Monotocheirodon, family Characidae, are described from Peru. Males and females of both new species have an external, visually obvious urogenital papilla that was not detected in the females in previous studies, with this longer in males, which use it as an inseminating organ. A third inseminating species from Bolivia, Monotocheirodon pearsoni, unstudied in any detail since its original description in 1924, is redescribed. This latter species lacks an inseminating organ. Monotocheirodon is redescribed, its phylogenetic relationships are briefly discussed and it is suggested that it is possibly related to the stevardiin genera Ceratobranchia, Othonocheirodus, and Odontostoechus.

Analytic perturbation theory for bound states in the transfer matrix spectrum of weakly correlated lattice ferromagnetic spin systems

We consider general d-dimensional lattice ferromagnetic spin systems with nearest neighbor interactions in the high temperature region ('beta' << 1). Each model is characterized by a single site apriori spin distribution taken to be even. We also take the parameter 'alfa' = ('S POT.4') - 3 '(S POT.2') POT.2' > 0, i.e. in the region which we call Gaussian subjugation, where ('S POT.K') denotes the kth moment of the apriori distribution. Associated with the model is a lattice quantum field theory known to contain a particle of asymptotic mass -ln 'beta' and a bound state below the two-particle threshold. We develop a 'beta' analytic perturbation theory for the binding energy of this bound state. As a key ingredient in obtaining our result we show that the Fourier transform of the two-point function is a meromorphic function, with a simple pole, in a suitable complex spectral parameter and the coefficients of its Laurent expansion are analytic in 'beta'.

Two versions of the threshold contact model in two dimensions

Two versions of the threshold contact process ordinary and conservative - are studied on a square lattice. In the first, particles are created on active sites, those having at least two nearest neighbor sites occupied, and are annihilated spontaneously. In the conservative version, a particle jumps from its site to an active site. Mean-field analysis suggests the existence of a first-order phase transition, which is confirmed by Monte Carlo simulations. In the thermodynamic limit, the two versions are found to give the same results. (C) 2012 Elsevier B.V. All rights reserved.

Risk factors for computer visual syndrome (CVS) among operators of two call centers in Sao Paulo, Brazil

The aims of this study were to investigate work conditions, to estimate the prevalence and to describe risk factors associated with Computer Vision Syndrome among two call centers' operators in Sao Paulo (n = 476). The methods include a quantitative cross-sectional observational study and an ergonomic work analysis, using work observation, interviews and questionnaires. The case definition was the presence of one or more specific ocular symptoms answered as always, often or sometimes. The multiple logistic regression model, were created using the stepwise forward likelihood method and remained the variables with levels below 5% (p < 0.05). The operators were mainly female and young (from 15 to 24 years old). The call center was opened 24 hours and the operators weekly hours were 36 hours with break time from 21 to 35 minutes per day. The symptoms reported were eye fatigue (73.9%), "weight" in the eyes (68.2%), "burning" eyes (54.6%), tearing (43.9%) and weakening of vision (43.5%). The prevalence of Computer Vision Syndrome was 54.6%. Associations verified were: being female (OR 2.6, 95% CI 1.6 to 4.1), lack of recognition at work (OR 1.4, 95% CI 1.1 to 1.8), organization of work in call center (OR 1.4, 95% CI 1.1 to 1.7) and high demand at work (OR 1.1, 95% CI 1.0 to 1.3). The organization and psychosocial factors at work should be included in prevention programs of visual syndrome among call centers' operators.

Modeling the gluon propagator in Landau gauge: Lattice estimates of pole masses and dimension-two condensates

We present an analytic description of numerical results for the Landau-gauge SU(2) gluon propagator D(p(2)), obtained from lattice simulations (in the scaling region) for the largest lattice sizes to date, in d = 2, 3 and 4 space-time dimensions. Fits to the gluon data in 3d and in 4d show very good agreement with the tree-level prediction of the refined Gribov-Zwanziger (RGZ) framework, supporting a massive behavior for D(p(2)) in the infrared limit. In particular, we investigate the propagator's pole structure and provide estimates of the dynamical mass scales that can be associated with dimension-two condensates in the theory. In the 2d case, fitting the data requires a noninteger power of the momentum p in the numerator of the expression for D(p(2)). In this case, an infinite-volume-limit extrapolation gives D(0) = 0. Our analysis suggests that this result is related to a particular symmetry in the complex-pole structure of the propagator and not to purely imaginary poles, as would be expected in the original Gribov-Zwanziger scenario.

Hybrid heuristic-waterfilling game theory approach in MC-CDMA resource allocation

This paper discusses the power allocation with fixed rate constraint problem in multi-carrier code division multiple access (MC-CDMA) networks, that has been solved through game theoretic perspective by the use of an iterative water-filling algorithm (IWFA). The problem is analyzed under various interference density configurations, and its reliability is studied in terms of solution existence and uniqueness. Moreover, numerical results reveal the approach shortcoming, thus a new method combining swarm intelligence and IWFA is proposed to make practicable the use of game theoretic approaches in realistic MC-CDMA systems scenarios. The contribution of this paper is twofold: (i) provide a complete analysis for the existence and uniqueness of the game solution, from simple to more realist and complex interference scenarios; (ii) propose a hybrid power allocation optimization method combining swarm intelligence, game theory and IWFA. To corroborate the effectiveness of the proposed method, an outage probability analysis in realistic interference scenarios, and a complexity comparison with the classical IWFA are presented. (C) 2011 Elsevier B.V. All rights reserved.

Discrimination of media moments and media intervals: sticker-based watch-and-comment annotation

In this paper we discuss the problem of how to discriminate moments of interest on videos or live broadcast shows. The primary contribution is a system which allows users to personalize their programs with previously created media stickers-pieces of content that may be temporarily attached to the original video. We present the system's architecture and implementation, which offer users operators to transparently annotate videos while watching them. We offered a soccer fan the opportunity to add stickers to the video while watching a live match: the user reported both enjoying and being comfortable using the stickers during the match-relevant results even though the experience was not fully representative.

Minimal Landau background gauge on the lattice

We present the first numerical implementation of the minimal Landau background gauge for Yang-Mills theory on the lattice. Our approach is a simple generalization of the usual minimal Landau gauge and is formulated for the general SU(N) gauge group. We also report on preliminary tests of the method in the four-dimensional SU(2) case, using different background fields. Our tests show that the convergence of the numerical minimization process is comparable to the case of a null background. The uniqueness of the minimizing functional employed is briefly discussed.

LALP: a language to program custom FPGA-based acceleration engines

Field-Programmable Gate Arrays (FPGAs) are becoming increasingly important in embedded and high-performance computing systems. They allow performance levels close to the ones obtained with Application-Specific Integrated Circuits, while still keeping design and implementation flexibility. However, to efficiently program FPGAs, one needs the expertise of hardware developers in order to master hardware description languages (HDLs) such as VHDL or Verilog. Attempts to furnish a high-level compilation flow (e.g., from C programs) still have to address open issues before broader efficient results can be obtained. Bearing in mind an FPGA available resources, it has been developed LALP (Language for Aggressive Loop Pipelining), a novel language to program FPGA-based accelerators, and its compilation framework, including mapping capabilities. The main ideas behind LALP are to provide a higher abstraction level than HDLs, to exploit the intrinsic parallelism of hardware resources, and to allow the programmer to control execution stages whenever the compiler techniques are unable to generate efficient implementations. Those features are particularly useful to implement loop pipelining, a well regarded technique used to accelerate computations in several application domains. This paper describes LALP, and shows how it can be used to achieve high-performance computing solutions.