The Amnesiac Consciousness of the Contemporary Holocaust Novel: Lily Brett’s Too Many Men and Jonathan Safran Foer’s Everything Is Illuminated

No abstract (available)

Water for food, water for life: a comprehensive assessment of water management in agriculture: summary. In Arabic

Water management / Irrigation management / Policy / Water scarcity / Poverty / Water rights / Ecosystems / Rainfed farming

Electrospray synthesis of PLGA TIPS microspheres

We successfully demonstrate the synthesis of polymer microspheres using a single electrospray source, and show their physical characterisation. Electrospray has proven to be a versatile method to manufacture particles, giving tight control over size with quasi-monodisperse size distributions. It is a liquid atomisation technique that generates a monodisperse population of highly charged liquid droplets over a broad size range (nanometres to tens of microns). The droplets contain liquid precursors for the in-flight synthesis of particles, and control over the trajectory of these droplets can be precisely manipulated with the use of electric fields to drive them to a grounded substrate. This study reports a method to synthesize poly(lactic-co-glycolic) acid (PLGA) microspheres using the electrospray and thermally induced phase separation (TIPS) techniques, followed by subsequent freeze-drying, for particle production. These microspheres are of interest as vehicles for controlled drug release systems

Are There Good Mistakes? A Theoretical Analysis of CEGIS

Counterexample-guided inductive synthesis CEGIS is used to synthesize programs from a candidate space of programs. The technique is guaranteed to terminate and synthesize the correct program if the space of candidate programs is finite. But the technique may or may not terminate with the correct program if the candidate space of programs is infinite. In this paper, we perform a theoretical analysis of counterexample-guided inductive synthesis technique. We investigate whether the set of candidate spaces for which the correct program can be synthesized using CEGIS depends on the counterexamples used in inductive synthesis, that is, whether there are good mistakes which would increase the synthesis power. We investigate whether the use of minimal counterexamples instead of arbitrary counterexamples expands the set of candidate spaces of programs for which inductive synthesis can successfully synthesize a correct program. We consider two kinds of counterexamples: minimal counterexamples and history bounded counterexamples. The history bounded counterexample used in any iteration of CEGIS is bounded by the examples used in previous iterations of inductive synthesis. We examine the relative change in power of inductive synthesis in both cases. We show that the synthesis technique using minimal counterexamples MinCEGIS has the same synthesis power as CEGIS but the synthesis technique using history bounded counterexamples HCEGIS has different power than that of CEGIS, but none dominates the other.Comment: In Proceedings SYNT 2014, arXiv:1407.493

Human-Centric Program Synthesis

Program synthesis techniques offer significant new capabilities in searching for programs that satisfy high-level specifications. While synthesis has been thoroughly explored for input/output pair specifications (programming-by-example), this paper asks: what does program synthesis look like beyond examples? What actual issues in day-to-day development would stand to benefit the most from synthesis? How can a human-centric perspective inform the exploration of alternative specification languages for synthesis? I sketch a human-centric vision for program synthesis where programmers explore and learn languages and APIs aided by a synthesis tool

On the use of observation equivalence in synthesis abstraction

In a previous paper we introduced the notion of synthesis abstraction, which allows efficient compositional synthesis of maximally permissive supervisors for large-scale systems of composed finite-state automata. In the current paper, observation equivalence is studied in relation to synthesis abstraction. It is shown that general observation equivalence is not useful for synthesis abstraction. Instead, we introduce additional conditions strengthening observation equivalence, so that it can be used with the compositional synthesis method. The paper concludes with an example showing the suitability of these relations to achieve substantial state reduction while computing a modular supervisor

The Materials Science Procedural Text Corpus: Annotating Materials Synthesis Procedures with Shallow Semantic Structures

Materials science literature contains millions of materials synthesis procedures described in unstructured natural language text. Large-scale analysis of these synthesis procedures would facilitate deeper scientific understanding of materials synthesis and enable automated synthesis planning. Such analysis requires extracting structured representations of synthesis procedures from the raw text as a first step. To facilitate the training and evaluation of synthesis extraction models, we introduce a dataset of 230 synthesis procedures annotated by domain experts with labeled graphs that express the semantics of the synthesis sentences. The nodes in this graph are synthesis operations and their typed arguments, and labeled edges specify relations between the nodes. We describe this new resource in detail and highlight some specific challenges to annotating scientific text with shallow semantic structure. We make the corpus available to the community to promote further research and development of scientific information extraction systems.Comment: Accepted as a long paper at the Linguistic Annotation Workshop (LAW) at ACL 201

Reconstitution of recombination-associated DNA synthesis with human proteins.

The repair of DNA breaks by homologous recombination is a high-fidelity process, necessary for the maintenance of genome integrity. Thus, DNA synthesis associated with recombinational repair must be largely error-free. In this report, we show that human DNA polymerase delta (δ) is capable of robust DNA synthesis at RAD51-mediated recombination intermediates dependent on the processivity clamp PCNA. Translesion synthesis polymerase eta (η) also extends these substrates, albeit far less processively. The single-stranded DNA binding protein RPA facilitates recombination-mediated DNA synthesis by increasing the efficiency of primer utilization, preventing polymerase stalling at specific sequence contexts, and overcoming polymerase stalling caused by topological constraint allowing the transition to a migrating D-loop. Our results support a model whereby the high-fidelity replicative DNA polymerase δ performs recombination-associated DNA synthesis, with translesion synthesis polymerases providing a supportive role as in normal replication

Application of Permutation Group Theory in Reversible Logic Synthesis

The paper discusses various applications of permutation group theory in the synthesis of reversible logic circuits consisting of Toffoli gates with negative control lines. An asymptotically optimal synthesis algorithm for circuits consisting of gates from the NCT library is described. An algorithm for gate complexity reduction, based on equivalent replacements of gates compositions, is introduced. A new approach for combining a group-theory-based synthesis algorithm with a Reed-Muller-spectra-based synthesis algorithm is described. Experimental results are presented to show that the proposed synthesis techniques allow a reduction in input lines count, gate complexity or quantum cost of reversible circuits for various benchmark functions.Comment: In English, 15 pages, 2 figures, 7 tables. Proceeding of the RC 2016 conferenc