Experiments were performed at lab scale in order to test the possibility to grow microalgae with CO2 from gaseous effluent of cement industry. Four microalgal species (Dunaliella tertiolecta, Chlorella vulgaris, Thalassiosira weissflogii, and Isochrysis galbana), representing four different phyla were grown with CO2 enriched air or with a mixture of gasses mimicking the composition of a typical...

A synthetic blend of chemicals comprising volatiles released by the human body has been shown to be an effective attractant for female Aedes aegypti in olfactometer bioassays with laboratory-reared mosquitoes. We report the laboratory evaluation of Ae. aegypti response to a synthetic blend tested with 4 types of mosquito traps (CDC model 512, CDC model 1012, CFG, and Fay-Prince traps). Aedes ae...

We present combined-case k-induction, a novel technique for verifying software programs. This technique draws on the strengths of the classical inductive-invariant method and a recent application of k-induction to program verification. In previous work, correctness of programs was established by separately proving a base case and inductive step. We present a new k-induction rule that takes an u...

Given σ units of data and a digraph G = (V,E) whose edges have delays, bandwidth constraints, and are labeled by terminals from a CFG (context-free grammar) G. A path p adheres to G’s path constraints iff the concatenation of all terminals along p forms a word of the language generated by G. The all-pairs quickest CFG labeled-path distance problem is: for all pairs of vertices, find the minimum...

We contrast abstract ow of control in a sequential program environment which uses a control ow graph (CFG) to the abstraction of execution order within DAG parallelism using a simple precedence graph (PG). We note that often the analogous concepts are duals of each other with regard to universal and existential quantiiers. We are studying sparse data-ow analysis techniques, which include method...

Data Flow Analysis (DFA for short) is a basic technique to collect statical information on run-time behaviors of programs: it is essential in optimizing compilers and is also used in type inference problems [1]. When performing a DFA, the program to be analysed is modeled by its Control Flow Graph (CFG) and by a set of transformation functions, one for each node in the graph. The set of program...