• Gyration under pressure was used to spin polyacrylonitrile-cellulose acetate blend fibres. • Self-generating porous structures were obtained by controlling working pressure. • Artificial porous fibrous structures were made by leaching and etching. • Structural evolution inpolyacrylonitrilecellulose acetate blend fibres is ex-

Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is difficult to find adequate predicate abstractions for the heap. In contrast, shape analysis, which uses graph-based heap abstractions, can provide a compact representation of recursive data structures. We integrate shape analysis...

This work is a comprehensive extension of Abu-Salem et al. (2015) that investigates the prowess of the Funnel Heap for implementing sums of products in the polytope method for factoring polynomials, when the polynomials are in sparse distributed representation. We exploit that the work and cache complexity of an Insert operation using Funnel Heap can be refined to depend on the rank of the inse...

The mathematical modeling of the unsaturated flow problem requires the simultaneous resolution of two problems: the Richards equation and the estimation of the hydraulic parameters involved in hydraulic conductivity and in the retention curve. Various techniques have been applied to both problems in a wide range of situations. In this article, a novel implementation of the processing techniques...

In this appendix, we provide some details on the data structures used to cluster the intersection segments. Although the data structures are fairly classical (a heap, a grid and a hashtable), we pay attention to the implementation details to ensure that the segment clustering is performed in almost linear time. 1 Intersection segment clustering

Two new facilities for Haskell are described: compression of data values in memory, and a new scheme for binary I/O. These facilities, although they can be used individually, can also be combined because they use the same binary representations for values. Heap compression in memory is valuable because it enables programs to run on smaller machines, or conversely allows programs to store more d...

Separation Logic (SL) provides a simple but powerful technique for reasoning about imperative programs that use shared data structures. Unfortunately, SL supports only “strong updates”, in which mutation to a heap location is safe only if a unique reference is owned. This limits the applicability of SL when reasoning about the interaction between many high-level languages (e.g., ML, Java, C#) a...

Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap structures, thus facilitating the verification of programs with pointers. In past work, separation logic has been developed for heaps containing records of basic data types. Languages like C or ML, however, also permit the...

This paper describes our rst step towards the integration of partial evaluation into standard interpretation. The two main issues in this integration are the treatment of heap objects and side-e ects. To enable specialization with respect to the heap objects that are allocated beforehand in standard evaluation, specialization is performed with respect to the heap state at specialization time ra...