Unexpected mechanism for formal 2+2] cycloadditions of metallacyclocumulenes

The formation of radialene complex 6M proceeds through a three-membered metallacyclopropene complex 7M, contrary to the prevailing notion of simple dimerization of metallacyclocumulene 1M. The 1M-7M equilibrium, which is predominantly governed by the size-dependent ligand binding of the metal atoms, plays a decisive role in the chemistry of Cp2M-ligand complexes. This size dependency is further fine-tuned by the substituents on the substrates and helps in exploiting these classes of metallacycles to generate new chemistry.

PolyGLoT: A Polyhedral Loop Transformation Framework for a Graphical Dataflow Language

Polyhedral techniques for program transformation are now used in several proprietary and open source compilers. However, most of the research on polyhedral compilation has focused on imperative languages such as C, where the computation is specified in terms of statements with zero or more nested loops and other control structures around them. Graphical dataflow languages, where there is no notion of statements or a schedule specifying their relative execution order, have so far not been studied using a powerful transformation or optimization approach. The execution semantics and referential transparency of dataflow languages impose a different set of challenges. In this paper, we attempt to bridge this gap by presenting techniques that can be used to extract polyhedral representation from dataflow programs and to synthesize them from their equivalent polyhedral representation. We then describe PolyGLoT, a framework for automatic transformation of dataflow programs which we built using our techniques and other popular research tools such as Clan and Pluto. For the purpose of experimental evaluation, we used our tools to compile LabVIEW, one of the most widely used dataflow programming languages. Results show that dataflow programs transformed using our framework are able to outperform those compiled otherwise by up to a factor of seventeen, with a mean speed-up of 2.30x while running on an 8-core Intel system.

Enantiospecific Formal Total Synthesis of Iriomoteolide 3a

A formal total synthesis of the marine macrolide iriomoteolide3a is described. Salient features of the synthesis include the elaboration of a -keto phosphonate derived from D-(-)-tartaric acid and the extension of a chiral butyrolactone derived from L-glutamic acid. Ring-closing metathesis is employed to construct the macrolactone core of the natural product.

Using formal reasoning on a model of tasks for FreeRTOS

FreeRTOS is an open-source real-time microkernel that has a wide community of users. We present the formal specification of the behaviour of the task part of FreeRTOS that deals with the creation, management, and scheduling of tasks using priority-based preemption. Our model is written in the Z notation, and we verify its consistency using the Z/Eves theorem prover. This includes a precise statement of the preconditions for all API commands. This task model forms the basis for three dimensions of further work: (a) the modelling of the rest of the behaviour of queues, time, mutex, and interrupts in FreeRTOS; (b) refinement of the models to code to produce a verified implementation; and (c) extension of the behaviour of FreeRTOS to multi-core architectures. We propose all three dimensions as benchmark challenge problems for Hoare's Verified Software Initiative.

Organocatalytic Enantioselective Formal C(sp(2))-H Alkylation

An organocatalytic enantioselective formal C(sp(2))-H alkylation is reported. This alkylative desymmetrization of prochiral 2,2-disubstituted cyclopentene-1,3-dione is catalyzed by a bifunctional tertiary aminourea derivative, utilizes air-stable and inexpensive nitroalkanes as the alkylating agents, and delivers synthetically versatile five-membered carbocycles containing an all-carbon quaternary stereogenic center remote from the reaction site in excellent enantioselectivity.

A versatile, RCM based approach to eudesmane and dihydroagarofuran sesquiterpenoids from (-)-carvone: a formal synthesis of (-)-isocelorbicol

An enantiospecific and diversity oriented approach to a range of functionalized eudesmane, nor-, iso-, and dihydroagarofuran frameworks from (-)-carvone is delineated. The cornerstone of this approach is the installation of the quaternary carbon center through reductive opening of the carvone epoxide and setting-up of RCM reaction to generate the bicyclic eudesmane framework. Various options like carbocation mediated oxycyclization and intramolecular hydroxy directed epoxide opening have been explored for the construction of the bridged tetrahydrofuran moiety. Among the several eudesmane and dihydroagarofurans accessed during the present study, one has been previously elaborated to iso-celorbicol, thus constituting its formal synthesis. (C) 2015 Elsevier Ltd. All rights reserved.

Formal synthesis of degraded sterol (+)-aplykurodinone-1

The formal synthesis of aplykurodinone-1 is accomplished starting from a suitably functionalized bicyclic lactone having the requisite cis-fused ring junction with a quaternary chiral center that was assembled following a Cp2TiCl-mediated radical cyclization protocol. Our synthetic route further elaborates implementation of Grubbs ring closing metathesis (RCM), Eschenmoser-Claisen rearrangement and iodo-lactonization reactions for the synthesis of the final tricyclic precursor of the target molecule. (C) 2015 Elsevier Ltd. All rights reserved.

Translation Induction on Indian Language Corpora Using Translingual Themes from Other Languages

Identifying translations from comparable corpora is a well-known problem with several applications, e.g. dictionary creation in resource-scarce languages. Scarcity of high quality corpora, especially in Indian languages, makes this problem hard, e.g. state-of-the-art techniques achieve a mean reciprocal rank (MRR) of 0.66 for English-Italian, and a mere 0.187 for Telugu-Kannada. There exist comparable corpora in many Indian languages with other ``auxiliary'' languages. We observe that translations have many topically related words in common in the auxiliary language. To model this, we define the notion of a translingual theme, a set of topically related words from auxiliary language corpora, and present a probabilistic framework for translation induction. Extensive experiments on 35 comparable corpora using English and French as auxiliary languages show that this approach can yield dramatic improvements in performance (e.g. MRR improves by 124% to 0.419 for Telugu-Kannada). A user study on WikiTSu, a system for cross-lingual Wikipedia title suggestion that uses our approach, shows a 20% improvement in the quality of titles suggested.

Segregating Discourse Segments from Engineering Documents for Knowledge Acquisition

The broader goal of the research being described here is to automatically acquire diagnostic knowledge from documents in the domain of manual and mechanical assembly of aircraft structures. These documents are treated as a discourse used by experts to communicate with others. It therefore becomes possible to use discourse analysis to enable machine understanding of the text. The research challenge addressed in the paper is to identify documents or sections of documents that are potential sources of knowledge. In a subsequent step, domain knowledge will be extracted from these segments. The segmentation task requires partitioning the document into relevant segments and understanding the context of each segment. In discourse analysis, the division of a discourse into various segments is achieved through certain indicative clauses called cue phrases that indicate changes in the discourse context. However, in formal documents such language may not be used. Hence the use of a domain specific ontology and an assembly process model is proposed to segregate chunks of the text based on a local context. Elements of the ontology/model, and their related terms serve as indicators of current context for a segment and changes in context between segments. Local contexts are aggregated for increasingly larger segments to identify if the document (or portions of it) pertains to the topic of interest, namely, assembly. Knowledge acquired through such processes enables acquisition and reuse of knowledge during any part of the lifecycle of a product.

Falcon: A Graph Manipulation Language for Heterogeneous Systems

Graph algorithms have been shown to possess enough parallelism to keep several computing resources busy-even hundreds of cores on a GPU. Unfortunately, tuning their implementation for efficient execution on a particular hardware configuration of heterogeneous systems consisting of multicore CPUs and GPUs is challenging, time consuming, and error prone. To address these issues, we propose a domain-specific language (DSL), Falcon, for implementing graph algorithms that (i) abstracts the hardware, (ii) provides constructs to write explicitly parallel programs at a higher level, and (iii) can work with general algorithms that may change the graph structure (morph algorithms). We illustrate the usage of our DSL to implement local computation algorithms (that do not change the graph structure) and morph algorithms such as Delaunay mesh refinement, survey propagation, and dynamic SSSP on GPU and multicore CPUs. Using a set of benchmark graphs, we illustrate that the generated code performs close to the state-of-the-art hand-tuned implementations.