Formal total synthesis of 2-pupukeanone via radical mediated cyclisation of an enyne

Diels-Alder reaction of the dienone 12, obtained by C-alkylation of sodium 2,6-dimethylphenoxide, with acrylonitrile and phenyl vinyl sulfones generate the enynes 14 and 17. Tributyltin radical addition to the terminal acetylene in 14 and 17 lead to the vinylstannanes 15 and 18 via 5-exo trig cyclisation of the resulting vinyl radical, which on oxidative cleavage furnishes the isotwistane-diones 16 and 19. Reductive desulfonylation of the diketosulfone 19 furnishes the dione 11, constituting a formal total synthesis of 2-pupukeanone 5 and 2-isocyanopupukeanone 3.

Parallel parsing of programming languages

A new method of specifying the syntax of programming languages, known as hierarchical language specifications (HLS), is proposed. Efficient parallel algorithms for parsing languages generated by HLS are presented. These algorithms run on an exclusive-read exclusive-write parallel random-access machine. They require O(n) processors and O(log2n) time, where n is the length of the string to be parsed. The most important feature of these algorithms is that they do not use a stack.

Data definition and manipulation languages for a CAD database

In this paper the main features of ARDBID (A Relational Database for Interactive Design) have been described. An overview of the organization of the database has been presented and a detailed description of the data definition and manipulation languages has been given. These have been implemented on a DEC 1090 system.

WISENOM. A formal organic chemical nomenclature system

A formal chemical nomenclature system WISENOM based on a context-free grammar and graph coding is described. The system is unique, unambiguous, easily pronounceable, encodable, and decodable for organic compounds. Being a formal system, every name is provable as a theorem or derivable as a terminal sentence by using the basic axioms and rewrite rules. The syntax in Backus-Naur form, examples of name derivations, and the corresponding derivation trees are provided. Encoding procedures to convert connectivity tables to WISENOM, parsing, and decoding are described.

Towards formal specification of a distributed computing system

Onboard spacecraft computing system is a case of a functionally distributed system that requires continuous interaction among the nodes to control the operations at different nodes. A simple and reliable protocol is desired for such an application. This paper discusses a formal approach to specify the computing system with respect to some important issues encountered in the design and development of a protocol for the onboard distributed system. The issues considered in this paper are concurrency, exclusiveness and sequencing relationships among the various processes at different nodes. A 6-tuple model is developed for the precise specification of the system. The model also enables us to check the consistency of specification and deadlock caused due to improper specification. An example is given to illustrate the use of the proposed methodology for a typical spacecraft configuration. Although the theory is motivated by a specific application the same may be applied to other distributed computing system such as those encountered in process control industries, power plant control and other similar environments.

A formal synthesis of 18-hydroxyestrone

A formal synthesis of Image -18-hydroxyestrone has been achieved by the preparation of Image -3-methanesulfonyloxy-13β,17β-dicarboxy-18--norestra-1,3,5(10)-triene anhydride, the dextrorotatory enantiomer of which is an intermediate in Barton's conversion of Image -estrone to Image -1β-hydroxyestrone (KC-6A).

A formal synthesis of 18-hydroxyestrone

A formal synthesis of -18-hydroxyestrone has been achieved by the preparation of -3-methanesulfonyloxy-13β,17β-dicarboxy-18--norestra-1,3,5(10)-triene anhydride, the dextrorotatory enantiomer of which is an intermediate in Barton's conversion of -estrone to -1β-hydroxyestrone (KC-6A).

Formal description, compression and transformation of digital pictures II. Picture algebra and geometry

In an earlier paper (Part I) we described the construction of Hermite code for multiple grey-level pictures using the concepts of vector spaces over Galois Fields. In this paper a new algebra is worked out for Hermite codes to devise algorithms for various transformations such as translation, reflection, rotation, expansion and replication of the original picture. Also other operations such as concatenation, complementation, superposition, Jordan-sum and selective segmentation are considered. It is shown that the Hermite code of a picture is very powerful and serves as a mathematical signature of the picture. The Hermite code will have extensive applications in picture processing, pattern recognition and artificial intelligence.

Formal description, compression and transformation of digital pictures

This paper describes the application of vector spaces over Galois fields, for obtaining a formal description of a picture in the form of a very compact, non-redundant, unique syntactic code. Two different methods of encoding are described. Both these methods consist in identifying the given picture as a matrix (called picture matrix) over a finite field. In the first method, the eigenvalues and eigenvectors of this matrix are obtained. The eigenvector expansion theorem is then used to reconstruct the original matrix. If several of the eigenvalues happen to be zero this scheme results in a considerable compression. In the second method, the picture matrix is reduced to a primitive diagonal form (Hermite canonical form) by elementary row and column transformations. These sequences of elementary transformations constitute a unique and unambiguous syntactic code-called Hermite code—for reconstructing the picture from the primitive diagonal matrix. A good compression of the picture results, if the rank of the matrix is considerably lower than its order. An important aspect of this code is that it preserves the neighbourhood relations in the picture and the primitive remains invariant under translation, rotation, reflection, enlargement and replication. It is also possible to derive the codes for these transformed pictures from the Hermite code of the original picture by simple algebraic manipulation. This code will find extensive applications in picture compression, storage, retrieval, transmission and in designing pattern recognition and artificial intelligence systems.

Stereoselective Formal Total Synthesis of (-)-Didemniserinolipid B

A formal total synthesis of (-)-didemniserinolipid B from L-(+)-tartaric acid is presented. Key features of the synthesis include construction of the bicyclic acetal core from bisdimethyl amide of tartaric acid and further elaboration by cross metathesis.

Formal Verification of Full-Wave Rectifier: A Case Study

We present a case study of formal verification of full-wave rectifier for analog and mixed signal designs. We have used the Checkmate tool from CMU [1], which is a public domain formal verification tool for hybrid systems. Due to the restriction imposed by Checkmate it necessitates to make the changes in the Checkmate implementation to implement the complex and non-linear system. Full-wave rectifier has been implemented by using the Checkmate custom blocks and the Simulink blocks from MATLAB from Math works. After establishing the required changes in the Checkmate implementation we are able to efficiently verify, the safety properties of the full-wave rectifier.

Enantioselective formal total syntheses of Clavukerin A and isoclavukerin A via a ring-closing metathesis reaction

Enantioselective formal total syntheses of the marine trisnorsesquiterpenes clavukerin A and isoclavukerin A, starting from (R)-limonene employing an RCM reaction as the key step, are described.

PROMIDS: A PROtotype multi-rIng data flow system for functional programming languages

This paper presents a detailed description of the hardware design and implementation of PROMIDS: a PROtotype Multi-rIng Data flow System for functional programming languages. The hardware constraints and the design trade-offs are discussed. The design of the functional units is described in detail. Finally, we report our experience with PROMIDS.