Parallel relaxed and extrapolated algorithms for computing PageRank

In this paper, parallel Relaxed and Extrapolated algorithms based on the Power method for accelerating the PageRank computation are presented. Different parallel implementations of the Power method and the proposed variants are analyzed using different data distribution strategies. The reported experiments show the behavior and effectiveness of the designed algorithms for realistic test data using either OpenMP, MPI or an hybrid OpenMP/MPI approach to exploit the benefits of shared memory inside the nodes of current SMP supercomputers.

Characterization of soluble and bound EPS obtained from 2 submerged membrane bioreactors by 3D-EEM and HPSEC

This research study deals with the quantification and characterization of the EPS obtained from two 25 L bench scale membrane bioreactors (MBRs) with micro-(MF-MBR) and ultrafiltration (UF-MBR) submerged membranes. Both reactors were fed with synthetic water and operated for 168 days without sludge extraction, increasing their mixed liquor suspended solid (MLSS) concentration during the experimentation time. The characterization of soluble EPS (EPSs) was achieved by the centrifugation of mixed liquor and bound EPS (EPSb) by extraction using a cationic resin exchange (CER). EPS characterization was carried out by applying the 3-dimensional excitation–emission matrix fluorescence spectroscopy (3D-EEM) and high-performance size exclusion chromatography (HPSEC) with the aim of obtaining structural and functional information thereof. With regard to the 3D-EEM analysis, fluorescence spectra of EPSb and EPSs showed 2 peaks in both MBRs at all the MLSS concentrations studied. The peaks obtained for EPSb were associated to soluble microbial by-product-like (predominantly protein-derived compounds) and to aromatic protein. For EPSs, the peaks were associated with humic and fulvic acids. In both MBRs, the fluorescence intensity (FI) of the peaks increased as MLSS and protein concentrations increased. The FI of the EPSs peaks was much lower than for EPSb. It was verified that the evolution of the FI clearly depends on the concentration of protein and humic acids for EPSb and EPSs, respectively. Chromatographic analysis showed that the intensity of the EPSb peak increased while the concentrations of MLSS did. Additionally, the mean MW calculated was always higher the higher the MLSS concentrations in the reactors. MW was higher for the MF-MBR than for the UF-MBR for the same MLSS concentrations demonstrating that the filtration carried out with a UF membrane lead to retentions of lower MW particles.

An approach to the application of shift-and-add algorithms on engineering and industrial processes

Different kinds of algorithms can be chosen so as to compute elementary functions. Among all of them, it is worthwhile mentioning the shift-and-add algorithms due to the fact that they have been specifically designed to be very simple and to save computer resources. In fact, almost the only operations usually involved with these methods are additions and shifts, which can be easily and efficiently performed by a digital processor. Shift-and-add algorithms allow fairly good precision with low cost iterations. The most famous algorithm belonging to this type is CORDIC. CORDIC has the capability of approximating a wide variety of functions with only the help of a slight change in their iterations. In this paper, we will analyze the requirements of some engineering and industrial problems in terms of type of operands and functions to approximate. Then, we will propose the application of shift-and-add algorithms based on CORDIC to these problems. We will make a comparison between the different methods applied in terms of the precision of the results and the number of iterations required.

Local job descriptions for two establishments in the malt liquor manufacturing industry : Malting Branch and Brewery Branch /

At head of title: Preliminary job study no. 5-113.

The execute statement : design, examples, and implementation algorithms /

"UILU-ENG 80 1741"--Cover.

Dynamic storage allocation : simulation techniques and efficient algorithms /

Thesis (M. S.)--University of Illinois at Urbana-Champaign.

Radix 16 division, multiplication, logarithmic and exponential algorithms based on continued product representations,

Thesis (M.S.)--University of Illinois at Urbana-Champaign.

Science and technology; a purchase guide for branch and small public libraries.

Accompanied by "Supplement 1963." (42 L.) Published: [Pittsburgh, Carnegie Library of Pittsburgh, 1964?]

Rules and regulations of Plant Pest Control Branch and Plant Quarantine Branch. Title 7, Chapter III, of the Code of Federal Regulations.

Amendments [issued by Plant Quarantine Division or Plant Pest Control Division.] (1 v. loose-leaf)

Stray subjects, arrested and bound over. Being the fugitive offspring of the "old 'un" and the "young 'un," that have been "lying round loose," and are now "tied up" for fast keeping.

"Hamilton 645 (2)"

The Vaughn Branch and Old Edwardsville Road sites : late Stirling and early Moorehead phase Mississippian occupations in the northern American Bottom /

Includes bibliographical references (p. 413-431).

Collected and bound

Mode of access: Internet.

Working agreement - woods between Weyerhauser Timber Company, Longview Branch, and Lumber and Sawmill Workers, Local union No. 2642, April l5, 1937.

Mode of access: Internet.

Performance comparisons between greedy and lagrange algorithms in adaptive MIMO MC-CDMA systems

This paper describes two algorithms for adaptive power and bit allocations in a multiple input multiple output multiple-carrier code division multiple access (MIMO MC-CDMA) system. The first is the greedy algorithm, which has already been presented in the literature. The other one, which is proposed by the authors, is based on the use of the Lagrange multiplier method. The performances of the two algorithms are compared via Monte Carlo simulations. At present stage, the simulations are restricted to a single user MIMO MC-CDMA system, which is equivalent to a MIMO OFDM system. It is assumed that the system operates in a frequency selective fading environment. The transmitter has a partial knowledge of the channel whose properties are measured at the receiver. The use of the two algorithms results in similar system performances. The advantage of the Lagrange algorithm is that is much faster than the greedy algorithm. ©2005 IEEE