@article{214,
abstract = {Given an absolutely irreducible ternary form F, the purpose of this paper is to produce better upper bounds for the number of integer solutions to the equation F=0, that are restricted to lie in very lopsided boxes. As an application of the main result, a new paucity estimate is obtained for equal sums of two like powers.},
author = {Timothy Browning and Heath-Brown, Roger},
journal = {Mathematische Zeitschrift},
number = {2},
pages = {233 -- 247},
publisher = {Unknown},
title = {{Plane curves in boxes and equal sums of two powers}},
doi = {10.1007/s00209-004-0719-z},
volume = {251},
year = {2005},
}
@article{217,
abstract = {We show that the number of nontrivial rational points of height at most B, which lie on the cubic surface x1 x2 x3 = x4 (x1 + x2 + x3)2, has order of magnitude B (log B)6. This agrees with Manin's conjecture.},
author = {Timothy Browning},
journal = {Journal of Number Theory},
number = {2},
pages = {242 -- 283},
publisher = {Elsevier},
title = {{The density of rational points on a certain singular cubic surface}},
doi = {10.1016/j.jnt.2005.11.007},
volume = {119},
year = {2005},
}
@inproceedings{4624,
abstract = {Surveying results from [5] and [6], we motivate and introduce the theory behind formalizing rich interfaces for software and hardware components. Rich interfaces specify the protocol aspects of component interaction. Their formalization, called interface automata, permits a compiler to check the compatibility of component interaction protocols. Interface automata support incremental design and independent implementability. Incremental design means that the compatibility checking of interfaces can proceed for partial system descriptions, without knowing the interfaces of all components. Independent implementability means that compatible interfaces can be refined separately, while still maintaining compatibility.},
author = {de Alfaro, Luca and Thomas Henzinger},
pages = {83 -- 104},
publisher = {Springer},
title = {{Interface-based design}},
doi = {10.1007/1-4020-3532-2_3},
volume = {195},
year = {2005},
}
@article{4625,
abstract = {Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, temporal logic is therefore fragile: even small changes in the model can lead to opposite truth values for a specification. We present a generalization of the branching-time logic CTL which achieves robustness with respect to model perturbations by giving a quantitative interpretation to predicates and logical operators, and by discounting the importance of events according to how late they occur. In every state, the value of a formula is a real number in the interval [0,1], where 1 corresponds to truth and 0 to falsehood. The boolean operators and and or are replaced by min and max, the path quantifiers ∃ and ∀ determine sup and inf over all paths from a given state, and the temporal operators ⋄ and □ specify sup and inf over a given path; a new operator averages all values along a path. Furthermore, all path operators are discounted by a parameter that can be chosen to give more weight to states that are closer to the beginning of the path.
We interpret the resulting logic DCTL over transition systems, Markov chains, and Markov decision processes. We present two semantics for DCTL: a path semantics, inspired by the standard interpretation of state and path formulas in CTL, and a fixpoint semantics, inspired by the μ-calculus evaluation of CTL formulas. We show that, while these semantics coincide for CTL, they differ for DCTL, and we provide model-checking algorithms for both semantics.},
author = {de Alfaro, Luca and Faella, Marco and Thomas Henzinger and Majumdar, Ritankar S and Stoelinga, Mariëlle},
journal = {Theoretical Computer Science},
number = {1},
pages = {139 -- 170},
publisher = {Elsevier},
title = {{Model checking discounted temporal properties}},
doi = {10.1016/j.tcs.2005.07.033},
volume = {345},
year = {2005},
}
@inproceedings{575,
abstract = {We present the first demonstration of Jozsa's "counterfactual computation", using an optical Grover's search algorithm. We put the algorithm in a superposition of 'running' and 'not-running', obtaining information even though the algorithm does not run.},
author = {Onur Hosten and Rakher, Matthew T and Barreiro, Julio T and Peters, Nicholas A and Kwiat, Paul G},
pages = {365 -- 367},
publisher = {IEEE},
title = {{Counterfactual quantum computation}},
doi = { 10.1109/QELS.2005.1548783},
volume = {1},
year = {2005},
}