Exponential dichotomies of evolution operators in Banach spaces

This paper considers three dichotomy concepts (exponential dichotomy, uniform exponential dichotomy and strong exponential dichotomy) in the general context of non-invertible evolution operators in Banach spaces. Connections between these concepts are illustrated. Using the notion of Green function, we give necessary conditions and sufficient ones for strong exponential dichotomy. Some illustrative examples are presented to prove that the converse of some implication type theorems are not valid

Sustainable solutions for the construction sector: integration of secondary raw materials in the production cycle of concrete

The construction industry is one of the largest consumers of raw materials and energy and one of the highest contributor to green-houses gases emissions. In order to become more sustainable it needs to reduce the use of both raw materials and energy, thus lim-iting its environmental impact. Developing novel technologies to integrate secondary raw materials (i.e. lightweight recycled aggre-gates and alkali activated “cementless” binders - geopolymers) in the production cycle of concrete is an all-inclusive solution to im-prove both sustainability and cost-efficiency of construction industry. SUS-CON “SUStainable, Innovative and Energy-Efficiency CONcrete, based on the integration of all-waste materials” is an European project (duration 2012-2015), which aim was the inte-gration of secondary raw materials in the production cycle of concrete, thus resulting in innovative, sustainable and cost-effective building solutions. This paper presents the main outcomes related to the successful scaling-up of SUS-CON concrete solutions in traditional production plants. Two European industrial concrete producers have been involved, to design and produce both pre-cast components (blocks and panels) and ready-mixed concrete. Recycled polyurethane foams and mixed plastics were used as aggre-gates, PFA (Pulverized Fuel Ash, a by-product of coal fuelled power plants) and GGBS (Ground Granulated Blast furnace Slag, a by-product of iron and steel industries) as binders. Eventually, the installation of SUS-CON concrete solutions on real buildings has been demonstrated, with the construction of three mock-ups located in Europe (Spain, Turkey and Romania

Effect of maleic anhydride–aniline derivative buffer layer on the properties of flexible substrate heterostructures: Indium tin oxide/nucleic acid base/metal

This paper presents some investigations on the properties of guanine (G) and cytosine (C) based heterostructures deposited on flexible substrates. The effects of two types of maleic anhydride–aniline derivatives (maleic anhydride-cyano aniline or maleic anhydride-2,4 dinitroaniline) buffer layer, deposited between indium tin oxide and (G) or (C) layer, on the optical and electrical properties of the heterostructures have been identified.The heterostructures containing a film of maleic anhydride-2,4 dinitroaniline have shown a good transparency and low photoluminescence in visible range. This buffer layer has determined an increase in the conductance only in the heterostructures based on (G) and (C) deposited on biaxially-oriented polyethylene terephthalate substrate

Using Verification Technology to Specify and Detect Malware

Computer viruses and worms are major threats for our computer infrastructure, and thus, for economy and society at large. Recent work has demonstrated that a model checking based approach to malware detection can capture the semantics of security exploits more accurately than traditional approaches, and consequently achieve higher detection rates. In this approach, malicious behavior is formalized using the expressive specification language CTPL based on classic CTL. This paper gives an overview of our toolchain for malware detection and presents our new system for computer assisted generation of malicious code specifications

Choreographies in Practice

Choreographic Programming is a development methodology for concurrent software that guarantees correctness by construction. The key to this paradigm is to disallow mismatched I/O operations in programs, called choreographies, and then mechanically synthesise distributed implementations in terms of standard process models via a mechanism known as EndPoint Projection (EPP). Despite the promise of choreographic programming, there is still a lack of practical evaluations that illustrate the applicability of choreographies to concrete computational problems with standard concurrent solutions. In this work, we explore the potential of choreographies by using Procedural Choreographies (PC), a model that we recently proposed, to write distributed algorithms for sorting (Quicksort), solving linear equations (Gaussian elimination), and computing Fast Fourier Transform. We discuss the lessons learned from this experiment, giving possible directions for the usage and future improvements of choreography languages

The Paths to Choreography Extraction

Choreographies are global descriptions of interactions among concurrent components, most notably used in the settings of verification (e.g., Multiparty Session Types) and synthesis of correct-by-construction software (Choreographic Programming). They require a top-down approach: programmers first write choreographies, and then use them to verify or synthesize their programs. However, most existing software does not come with choreographies yet, which prevents their application. To attack this problem, we propose a novel methodology (called choreography extraction) that, given a set of programs or protocol specifications, automatically constructs a choreography that describes their behavior. The key to our extraction is identifying a set of paths in a graph that represents the symbolic execution of the programs of interest. Our method improves on previous work in several directions: we can now deal with programs that are equipped with a state and internal computation capabilities; time complexity is dramatically better; we capture programs that are correct but not necessarily synchronizable, i.e., they work because they exploit asynchronous communication