Enumeração de espectro de distâncias de esquemas de modulação codificada em treliça empregando codificação turbo

In this work, a performance analysis of transmission schemes employing turbo trellis coded modulation. In general, the performance analysis of such schemes is guided by evaluating the error probability of these schemes. The exact evaluation of this probability is very complex and inefficient from the computational point of view, a widely used alternative is the use of union bound of error probability, because of its easy implementation and computational produce bounds that converge quickly. Since it is the union bound, it should use to expurge some elements of distance spectrum to obtain a tight bound. The main contribution of this work is that the listing proposal is carried out from the puncturing at the level of symbol rather than bit-level as in most works of literature. The main reason for using the symbol level puncturing lies in the fact that the enummerating function of the turbo scheme is obtained directly from complex sequences of signals through the trellis and not indirectly from the binary sequences that require further binary to complex mapping, as proposed by previous works. Thus, algorithms can be applied through matrix from the adjacency matrix, which is obtained by calculating the distances of the complex sequences of the trellis. This work also presents two matrix algorithms for state reduction and the evaluation of the transfer function of this. The results presented in comparisons of the bounds obtained using the proposed technique with some turbo codes of the literature corroborate the proposition of this paper that the expurgated bounds obtained are quite tight and matrix algorithms are easily implemented in any programming software language

Effect of measurement error and autocorrelation on the (X)over-bar chart

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Safety illusion and error trap in a collectively-operated machine accident

Workplace accidents involving machines are relevant for their magnitude and their impacts on worker health. Despite consolidated critical statements, explanation centered on errors of operators remains predominant with industry professionals, hampering preventive measures and the improvement of production-system reliability. Several initiatives were adopted by enforcement agencies in partnership with universities to stimulate production and diffusion of analysis methodologies with a systemic approach. Starting from one accident case that occurred with a worker who operated a brake-clutch type mechanical press, the article explores cognitive aspects and the existence of traps in the operation of this machine. It deals with a large-sized press that, despite being endowed with a light curtain in areas of access to the pressing zone, did not meet legal requirements. The safety devices gave rise to an illusion of safety, permitting activation of the machine when a worker was still found within the operational zone. Preventive interventions must stimulate the tailoring of systems to the characteristics of workers, minimizing the creation of traps and encouraging safety policies and practices that replace judgments of behaviors that participate in accidents by analyses of reasons that lead workers to act in that manner.

Polynomials generated by a three term recurrence relation: bounds for complex zeros

This paper deals with the zeros of polynomials generated by a certain three term recurrence relation. The main objective is to find bounds, in terms of the coefficients of the recurrence relation, for the regions where the zeros are located. In most part, the zeros are explored through an Eigenvalue representation associated with a corresponding Hessenberg rnatrix. Applications to Szego polynomials, para-orthogonal polynomials and polynomials with non-zero complex coefficients are considered. (C) 2004 Elsevier B.V. All rights reserved.

Sharp bounds for the extreme zeros of classical orthogonal polynomials

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Bounds on direct couplings of superheavy metastable particles to the inflaton field from ultra high energy cosmic ray events

Top-down models for the origin of ultra high energy cosmic rays (UHECR's) propose that these events are the decay products of relic superheavy metastable particles, usually called X particles. These particles can be produced in the reheating period following the inflationary epoch of the early Universe. We obtain constraints on some parameters such as the lifetime and direct couplings of the X-particle to the inflaton field from the requirement that they are responsible for the observed UHECR flux.

Gravitational and quantum bounds on the photon mass

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Upper bounds on the photon mass

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Bounds on an Anomalous Dijet Resonance in W plus jets Production in p(p)over-bar Collisions at root s=1.96 TeV

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Radion-Higgs mixing effects on bounds from LHC Higgs boson searches

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

Lower bounds on blow up solutions of the three-dimensional Navier-Stokes equations in homogeneous Sobolev spaces

Suppose that u(t) is a solution of the three-dimensional Navier-Stokes equations, either on the whole space or with periodic boundary conditions, that has a singularity at time T. In this paper we show that the norm of u(T - t) in the homogeneous Sobolev space (H)over dot(s) must be bounded below by c(s)t(-(2s-1)/4) for 1/2 < s < 5/2 (s not equal 3/2), where c(s) is an absolute constant depending only on s; and by c(s)parallel to u(0)parallel to((5-2s)/5)(L2)t(-2s/5) for s > 5/2. (The result for 1/2 < s < 3/2 follows from well-known lower bounds on blowup in Lp spaces.) We show in particular that the local existence time in (H)over dot(s)(R-3) depends only on the (H)over dot(s)-norm for 1/2 < s < 5/2, s not equal 3/2. (C) 2012 American Institute of Physics. [http://dx.doi.org/10.1063/1.4762841]

Localization of the optimal solution and a posteriori bounds for aggregation

After an aggregated problem has been solved, it is often desirable to estimate the accuracy loss due to the fact that a simpler problem than the original one has been solved. One way of measuring this loss in accuracy is the difference in objective function values. To get the bounds for this difference, Zipkin (Operations Research 1980;28:406) has assumed, that a simple (knapsack-type) localization of an original optimal solution is known. Since then various extensions of Zipkin's bound have been proposed, but under the same assumption. A method to compute the bounds for variable aggregation for convex problems, based on general localization of the original solution is proposed. For some classes of the original problem it is shown how to construct the localization. Examples are given to illustrate the main constructions and a small numerical study is presented.

Error function approximations of interest in electrochemistry.

The error function is present in several equations describing eletrode processes. But, only approximations of this function are used. In this work, these and other approximations are studied and evaluated according to precision.

Effects of direction and curvature on variable error pattern of reaching movements

A number of studies have analyzed various indices of the final position variability in order to provide insight into different levels of neuromotor processing during reaching movements. Yet the possible effects of movement kinematics on variability have often been neglected. The present study was designed to test the effects of movement direction and curvature on the pattern of movement variable errors. Subjects performed series of reaching movements over the same distance and into the same target. However, due either to changes in starting position or to applied obstacles, the movements were performed in different directions or along the trajectories of different curvatures. The pattern of movement variable errors was assessed by means of the principal component analysis applied on the 2-D scatter of movement final positions. The orientation of these ellipses demonstrated changes associated with changes in both movement direction and curvature. However, neither movement direction nor movement curvature affected movement variable errors assessed by area of the ellipses. Therefore it was concluded that the end-point variability depends partly, but not exclusively, on movement kinematics.

Studying properties of Lagrangian bounds for many-to-many assignment problems

Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are studied. For the class of many-to-many assignment problems, this property of constraints is used to design a subgradient algorithm for solving the modified dual problem. Numerical results are presented to compare the quality of classical and modified bounds, as well as the properties of the corresponding Lagrangian solutions.