Safe upper-bounds inference of energy consumption for java bytecode applications

Abstract is not available.

Resource bounds analysis.

We present a generic analysis that infers both upper and lower bounds on the usage that a program makes of a set of user-definable resources. The inferred bounds will in general be functions of input data sizes. A resource in our approach is a quite general, user-defined notion which associates a basic cost function with elementary operations. The analysis then derives the related (upper- and lower- bound) cost functions for all procedures in the program. We also present an assertion language which is used to define both such resources and resource-related properties that the system can then check based on the results of the analysis. We have performed some experiments with some concrete resource-related properties such as execution steps, bits sent or received by an application, number of arithmetic operations performed, number of calls to a procedure, number of transactions, etc. presenting the resource usage functions inferred and the times taken to perform the analysis. Applications of our analysis include resource consumption verification and debugging (including for mobile code), resource control in parallel/distributed computing, and resource-oriented specialization.

New lower bounds for the topological complexity of aspherical spaces

Date of Acceptance: 5/04/2015 15 pages, 4 figures

Lower bounds on merging networks /

Bibliography: leaf 16.

Bounds for selection /

Bibliography: p. 9.

Bounds on scheduling algorithms for heterogeneous computing systems /

Includes bibliographical references.

Parallel methods and bounds of evaluating polynomials.

Bibliography: p. 24.

Two upper bounds for the weighted path length of binary trees.

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

Memorials of Methodism in the bounds of the Rock River Conference /

Mode of access: Internet.

Fifty years of Methodism; a history of the Methodist Episcopal Church within the bounds of the California annual conference from 1847 to 1897.

Mode of access: Internet.

A narrative of the revival of religion, in the county of Oneida : particularly in the bounds of the Presbytery of Oneida, in the year 1826.

Appendix, p.[63]-88, contains a reply to a pamphlet by Ephraim Perkins entitled "A 'Bunker Hill' contest, A.D. 1826. ..."

A narrative of the late revivals of religion : within the bounds of the Geneva Presbytery /

Bruntjen

Documents relating to the purchase & exploration of Louisiana. I. The limits and bounds of Louisiana.

Designed by Bruce Rogers.

Lower bounds on the complexity of simulating quantum gates

We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries. We also note that a related lower bound holds for arbitrary n-qubit gates.

Correlations, integration and Hansen-Jagannathan Bounds

Recent studies have documented the growing economic and financial integration between countries. Among other things, this has led to the argument that greater integration results in higher bilateral correlations between returns on national stock markets. This study endeavours to link the two issues by utilizing the assumption that if countries are integrated, they would have to display a minimum level of correlation. This is achieved by constructing a bound on the level of the bilateral correlation, as originally developed by Kasa (1995). In contrast to Kasa, the present studies demonstrate that the correlation bound may not be downward sloping in all cases and careful interpretation of the results is required.