8 resultados para Multiplication operators
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo
Resumo:
Shift workers from control centers of electrical systems are a group that has received little attention in Brazil. This study aimed to compare workers' job satisfaction at five control centers of a Brazilian company electrical system, and according to their job titles. Method: The Organization Satisfaction Index (OSI) questionnaire to assess job satisfaction was used. ANOVA was used to compare OSI means, according to job title and control center. The results showed that there is no difference in job satisfaction among job titles, but a significant difference was found according to the control center. A single organizational culture cannot be applied to several branches. It is required to implement actions that would result in job satisfaction improvements among workers of all studied control rooms centers. The high level of education of operators working in all centers might have contributed to the similar values of perceived satisfaction among distinct job titles.
Resumo:
We extend and provide a vector-valued version of some results of C. Samuel about the geometric relations between the spaces of nuclear operators N(E, F) and spaces of compact operators K(E, F), where E and F are Banach spaces C(K) of all continuous functions defined on the countable compact metric spaces K equipped with the supremum norm. First we continue Samuel's work by proving that N(C(K-1), C(K-2)) contains no subspace isomorphic to K(C(K-3), C(K-4)) whenever K-1, K-2, K-3 and K-4 are arbitrary infinite countable compact metric spaces. Then we show that it is relatively consistent with ZFC that the above result and the main results of Samuel can be extended to C(K-1, X), C(K-2,Y), C(K-3, X) and C(K-4, Y) spaces, where K-1, K-2, K-3 and K-4 are arbitrary infinite totally ordered compact spaces; X comprises certain Banach spaces such that X* are isomorphic to subspaces of l(1); and Y comprises arbitrary subspaces of l(p), with 1 < p < infinity. Our results cover the cases of some non-classical Banach spaces X constructed by Alspach, by Alspach and Benyamini, by Benyamini and Lindenstrauss, by Bourgain and Delbaen and also by Argyros and Haydon.
Resumo:
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.
Resumo:
Gelfand and Ponomarev [I.M. Gelfand, V.A. Ponomarev, Remarks on the classification of a pair of commuting linear transformations in a finite dimensional vector space, Funct. Anal. Appl. 3 (1969) 325-326] proved that the problem of classifying pairs of commuting linear operators contains the problem of classifying k-tuples of linear operators for any k. We prove an analogous statement for semilinear operators. (C) 2011 Elsevier Inc. All rights reserved.
Resumo:
We construct all self-adjoint Schrodinger and Dirac operators (Hamiltonians) with both the pure Aharonov-Bohm (AB) field and the so-called magnetic-solenoid field (a collinear superposition of the AB field and a constant magnetic field). We perform a spectral analysis for these operators, which includes finding spectra and spectral decompositions, or inversion formulae. In constructing the Hamiltonians and performing their spectral analysis, we follow, respectively, the von Neumann theory of self-adjoint extensions of symmetric operators and the Krein method of guiding functionals.
Resumo:
In the paper, a complete description of the delta-derivations and the delta-superderivations of semisimple finite-dimensional Jordan superalgebras over an algebraically closed field of characteristic p not equal 2 is given. In particular, new examples of nontrivial (1/2)-derivations and odd (1/2)-superderivations are given that are not operators of right multiplication by an element of the superalgebra.
Sharp estimates for eigenvalues of integral operators generated by dot product kernels on the sphere
Resumo:
We obtain explicit formulas for the eigenvalues of integral operators generated by continuous dot product kernels defined on the sphere via the usual gamma function. Using them, we present both, a procedure to describe sharp bounds for the eigenvalues and their asymptotic behavior near 0. We illustrate our results with examples, among them the integral operator generated by a Gaussian kernel. Finally, we sketch complex versions of our results to cover the cases when the sphere sits in a Hermitian space.
Resumo:
The modern GPUs are well suited for intensive computational tasks and massive parallel computation. Sparse matrix multiplication and linear triangular solver are the most important and heavily used kernels in scientific computation, and several challenges in developing a high performance kernel with the two modules is investigated. The main interest it to solve linear systems derived from the elliptic equations with triangular elements. The resulting linear system has a symmetric positive definite matrix. The sparse matrix is stored in the compressed sparse row (CSR) format. It is proposed a CUDA algorithm to execute the matrix vector multiplication using directly the CSR format. A dependence tree algorithm is used to determine which variables the linear triangular solver can determine in parallel. To increase the number of the parallel threads, a coloring graph algorithm is implemented to reorder the mesh numbering in a pre-processing phase. The proposed method is compared with parallel and serial available libraries. The results show that the proposed method improves the computation cost of the matrix vector multiplication. The pre-processing associated with the triangular solver needs to be executed just once in the proposed method. The conjugate gradient method was implemented and showed similar convergence rate for all the compared methods. The proposed method showed significant smaller execution time.