On the Milnor fibre and L numbers of semi-weighted homogeneous arrangements

Inthispaperwestudygermsofpolynomialsformedbytheproductofsemi-weighted homogeneous polynomials of the same type, which we call semi-weighted homogeneous arrangements. It is shown how the L numbers of such polynomials are computed using only their weights and degree of homogeneity. A key point of the main theorem is to find the number called polar ratio of this polynomial class. An important consequence is the description of the Euler characteristic of the Milnor fibre of such arrangements only depending on their weights and degree of homogeneity. The constancy of the L numbers in families formed by such arrangements is shown, with the deformed terms having weighted degree greater than the weighted degree of the initial germ. Moreover, using the results of Massey applied to families of function germs, we obtain the constancy of the homology of the Milnor fibre in this family of semi-weighted homogeneous arrangements.

Institutional arrangements in the emerging biodiesel industry: Case studies from Minas Gerais-Brazil

Connecting (small) family farmers to the emerging biodiesel industry requires careful design of the institutional arrangements between the producers of oil crops and the processing companies. According to institutional economics theory, the design of effective and efficient arrangements depends on production and transaction characteristics, the institutional environment, and the organizational environment supporting the transaction between producers and the industry. This paper presents a comparative study on two cases in the feedstock-for-biodiesel industry in the state of Minas Gerais, Brazil. The two case studies represent the production and transaction system of soybeans (Glycine max L Merrill) and castor beans (Ricinus communis L). Important elements of effective and efficient institutional arrangements are farmer collective action, availability of technical and financial support, and farmer experience with particular crops. (C) 2011 Elsevier Ltd. All rights reserved.

Matrix-vector multiplication and triangular linear solver using GPGPU for symmetric positive definite matrices derived from elliptic equations

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.