Structural Relaxation and Mode Coupling in a Simple Liquid: Depolarized Light Scattering in Benzene

We have measured depolarized light scattering in liquid benzene over the whole accessible temperature range and over four decades in frequency. Between 40 and 180 GHz we find a susceptibility peak due to structural relaxation. This peak shows stretching and time-temperature scaling as known from $\alpha$ relaxation in glass-forming materials. A simple mode-coupling model provides consistent fits of the entire data set. We conclude that structural relaxation in simple liquids and $\alpha$ relaxation in glass-forming materials are physically the same. A deeper understanding of simple liquids is reached by applying concepts that were originally developed in the context of glass-transition research.Comment: submitted to New J. Phy

Characterising strongly normalising intuitionistic sequent terms

This paper gives a characterisation, via intersection types, of the strongly normalising terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the typing system is reduced to that of a well known typing system with intersection types for the ordinary lambda-calculus. The completeness of the typing system is obtained from subject expansion at root position. This paper's sequent term calculus integrates smoothly the lambda-terms with generalised application or explicit substitution. Strong normalisability of these terms as sequent terms characterises their typeability in certain "natural'' typing systems with intersection types. The latter are in the natural deduction format, like systems previously studied by Matthes and Lengrand et al., except that they do not contain any extra, exceptional rules for typing generalised applications or substitution

Improving complex SMT strategies with learning

Satisfiability modulo theory (SMT) solving strategies are composed of various components and parameters that can dramatically affect the performance of an SMT solver. Each of these elements includes a huge amount of options that cannot be exploited without expert knowledge. In this work, we analyze separately the different strategy components of the Z3 theorem prover, which is one of the most important solvers of the SMT community. We propose some rules for modifying components, parameters, and structures of solving strategies. Using these rules inside different engines leads to an automated strategy learning process which does not require any end‐user expert knowledge to generate optimized strategies. Our algorithms and rules are validated by optimizing some solving strategies for some selected SMT logics. These strategies are then tested for solving some SMT library benchmarks issued from the SMT competitions. The strategies we automatically generated turn out to be very efficient

Focalisation and Classical Realisability (version with appendices)

The original publication is avalaible at : www.springerlink.comInternational audienceWe develop a polarised variant of Curien and Herbelin's lambda-bar-mu-mu-tilde calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised when cut-free), such as Girard's classical logic LC or linear logic. This gives a setting in which Krivine's classical realisability extends naturally (in particular to call-by-value), with a presentation in terms of orthogonality. We give examples of applications to the theory of programming languages

Sound and Complete Typing for lambda-mu

In this paper we define intersection and union type assignment for Parigot's calculus lambda-mu. We show that this notion is complete (i.e. closed under subject-expansion), and show also that it is sound (i.e. closed under subject-reduction). This implies that this notion of intersection-union type assignment is suitable to define a semantics.Comment: In Proceedings ITRS 2010, arXiv:1101.410

Innovation Management Techniques and Tools: a review from Theory and Practice

Knowledge is considered to be an economic driver in today’s economy. It has become a commodity, a resource that can be packed and transferred. The objective of this paper is to provide a comprehensive review of the scope, trends and major actors (firms, organizations, government, consultants, academia, etc.) in the development and use of methods to manage innovation in a knowledge-driven economy. The paper identifies the main innovation management techniques (IMTs) aiming at the improvement of firm competitiveness by means of knowledge management. It will specifically focus on those IMTs for which knowledge is a relevant part of the innovation process. The research study, based on a survey at the European level, concludes that a knowledge-driven economy affects the innovation process and approach. The traditional idea that innovation is based on research (technology-push theory) and interaction between firms and other actors has been replaced by the current social network theory of innovation, where knowledge plays a crucial role in fostering innovation. Simultaneously, organizations in both public and private sectors have launched initiatives to develop methodologies and tools to support business innovation management. Higher education establishments, business schools and consulting companies are developing innovative and adequate methodologies and tools, while public authorities are designing and setting up education and training schemes aimed at disseminating best practices among all kinds of businesse

Call-by-value λ-calculus and LJQ

LJQ is a focused sequent calculus for intuitionistic logic, with a simple restriction on the first premiss of the usual left introduction rule for implication. In a previous paper we discussed its history (going back to about 1950, or beyond) and presented its basic theory and some applications; here we discuss in detail its relation to call-by-value reduction in lambda calculus, establishing a connection between LJQ and the CBV calculus λC of Moggi. In particular, we present an equational correspondence between these two calculi forming a bijection between the two sets of normal terms, and allowing reductions in each to be simulated by reductions in the other