Forecasting stock market volatility and the informational efficiency of the DAX-index options market

Alternative strategies for predicting stock market volatility are examined. In out-of-sample forecasting experiments implied-volatility information, derived from contemporaneously observed option prices or history-based volatility predictors, such as GARCH models, are investigated, to determine if they are more appropriate for predicting future return volatility. Employing German DAX-index return data it is found that past returns do not contain useful information beyond the volatility expectations already reflected in option prices. This supports the efficient market hypothesis for the DAX-index options market

SapB and the rodlins are required for development of Streptomyces coelicolor in high osmolarity media

Streptomyces coelicolor produces spore-forming aerial hyphae after a period of vegetative growth. These aerial structures are decorated with a hydrophobic coating of rodlets consisting of chaplins and rodlins. Here, we show that rodlins and the surface-active peptide SapB are essential for development during growth in a medium with high osmolarity. To this end, both vegetative and aerial hyphae secrete SapB, whereas rodlins are only secreted by the spore-forming aerial hyphae.

Proof-Pattern Recognition and Lemma Discovery in ACL2

We present a novel technique for combining statistical machine learning for proof-pattern recognition with symbolic methods for lemma discovery. The resulting tool, ACL2(ml), gathers proof statistics and uses statistical pattern-recognition to pre-processes data from libraries, and then suggests auxiliary lemmas in new proofs by analogy with already seen examples. This paper presents the implementation of ACL2(ml) alongside theoretical descriptions of the proof-pattern recognition and lemma discovery methods involved in it

Conduction States with Vanishing Dimerization in Pt Nanowires on Ge(001) Observed with Scanning Tunneling Microscopy

The low-energy electronic properties of one-dimensional nanowires formed by Pt atoms on Ge(001) are studied with scanning tunneling microscopy down to the millivolt-regime. The chain structure exhibits various dimerized elements at high tunneling bias, indicative of a substrate bonding origin rather than a charge density wave. Unexpectedly, this dimerization becomes vanishingly small when imaging energy windows close to the Fermi level with adequately low tunneling currents. Evenly spaced nanowire atoms emerge which are found to represent conduction states. Implications for the metallicity of the chains are discussed.Comment: 4 pages, 4 figure

Speculate: discovering conditional equations and inequalities about black-box functions by reasoning from test results

This paper presents Speculate, a tool that automatically conjectures laws involving conditional equations and inequalities about Haskell functions. Speculate enumerates expressions involving a given collection of Haskell functions, testing to separate those expressions into apparent equivalence classes. Expressions in the same equivalence class are used to conjecture equations. Representative expressions of different equivalence classes are used to conjecture conditional equations and inequalities. Speculate uses lightweight equational reasoning based on term rewriting to discard redundant laws and to avoid needless testing. Several applications demonstrate the effectiveness of Speculate

A Faithful Semantics for Generalised Symbolic Trajectory Evaluation

Generalised Symbolic Trajectory Evaluation (GSTE) is a high-capacity formal verification technique for hardware. GSTE uses abstraction, meaning that details of the circuit behaviour are removed from the circuit model. A semantics for GSTE can be used to predict and understand why certain circuit properties can or cannot be proven by GSTE. Several semantics have been described for GSTE. These semantics, however, are not faithful to the proving power of GSTE-algorithms, that is, the GSTE-algorithms are incomplete with respect to the semantics. The abstraction used in GSTE makes it hard to understand why a specific property can, or cannot, be proven by GSTE. The semantics mentioned above cannot help the user in doing so. The contribution of this paper is a faithful semantics for GSTE. That is, we give a simple formal theory that deems a property to be true if-and-only-if the property can be proven by a GSTE-model checker. We prove that the GSTE algorithm is sound and complete with respect to this semantics

A seamless, client-centric programming model for type safe web applications

We propose a new programming model for web applications which is (1) seamless; one program and one language is used to produce code for both client and server, (2) client-centric; the programmer takes the viewpoint of the client that runs code on the server rather than the other way around, (3) functional and type-safe, and (4) portable; everything is implemented as a Haskell library that implicitly takes care of all networking code. Our aim is to improve the painful and error-prone experience of today's standard development methods, in which clients and servers are coded in different languages and communicate with each other using ad-hoc protocols. We present the design of our library called Haste.App, an example web application that uses it, and discuss the implementation and the compiler technology on which it depends