bluuebunny/crossref_metadata_2025 huggingface dataset:
Semantic Domains and Denotational Semantics
Authors: Gunter Carl A. , Mosses Peter D. , Scott Dana S.
Published: February 2016

Denotational Semantics is a framework for the formal description of programming language semantics. The main idea of Denotational Semantics is that each phrase of the described language is given a denotation: a mathematical object that represents the contribution of the phrase to the meaning of any program in which it occurs. Moreover, the denotation of each phrase is determined just by the denotations of its subphrases.

This report consists of two chapters. The first, Semantic Domains, was written by Gunter and Scott. It is concerned with the theory of domains of denotations. The second, Denotational Semantics, was written by Mosses. It explains the formal notation used in denotational descriptions, and illustrates the major standard technigues for finding denotations of programming constructs.

Both chapters are to appear in the forthcoming Handbook of Theoretical Computer Science (North-Holland).
Object oriented development: integrating analysis, design and implementation
Authors: Sandvad Elmer
Published: February 2016

Object-orientation is discussed in relation to the traditional division of system development activities: analysis, design and implementation. Object-orientation integrates analysis, design and implementation. This statement is illustrated by introducing an object-oriented graphical notation for analysis as well as design and by showing how this notation can be mapped into the object-oriented programming language BETA. This mapping can be automated. It is shown how the programming environment, the Mjølner BETA System can support integration of the object-oriented notation and BETA, and thereby providing an object-oriented CASE tool that, at least partially, closes the CASE gap between design and implementation.
Are There Elimination Algorithms for the Permanent?
Authors: Sturtivant Carl
Published: February 2016

We define the class of elimination algorithms. These are algebraic algorithms for evaluating multivariate polynomials, and include as a special case, Gaussian elimination for evaluating the determinant. We show how to find the linear symmetries of a polynomial, defined appropriately, and use these methods to find the linear symmetries of the permanent and determinant. We show that in contrast to Gaussian elimination for the determinant, there is no elimination algorithm for the permanent.
A logical characterization of asynchronously communicating agents
Authors: Christensen Søren
Published: February 2016

In this paper we study the behaviour of distributed systems. We consider systems composed of a fixed number of sequential processes communicating by asynchronous message passing. The behaviour is represented by a subclass of partial orders called asynchronously communicating agent structures, abbreviated ACA structures.

We present a logical characterization of ACA structures in the framework of temporal logic.

The modalities of the logic capture the concepts of communication, concurrency and locality.

We define an axiomatic basis for the logic and show both soundness and completeness.
INTERFACE
Authors: Grudin Jonathan
Published: February 2016

This is an essay on the ways in which we have used, now use, and might use the terms ''user,'' ''interface,'' and ''designer,'' and their various combinations. Current usage conceals important changes in our field -- in some cases, the words have outlived their original usefulness in the engineering environment, however comfortable we now feel with them. They may conceal aspects of the environments in which computers are used today -- work environments often very unlike the engineering environment, which are increasingly important for systems developers to understand. The power of words is not total, but they may subtly and indirectly inhibit the adoption of new areas of research and approaches to development. Computer systems are presented as highly complex artifacts, the products of a continuous design process that has engaged countless individuals, incorporating considerable implicit understanding of people and their work. The terminology brought forward from the field's origins can obscure this history and the need to maintain and even strengthen the focus on human psychology and work.
The development of interactive systems: bridging the gaps between developers and users
Authors: Grudin Jonathan
Published: February 2016

A framework for interactive systems development projects is outlined.

Three development paradigms are contrasted: competitively bid contract development, product development, and in-house or custom development. They vary as to when in a project the users and the developers can be identified -- a distinction that is particularly significant for systems with a human-computer interface component. The historical influence of each of these paradigms on interactive systems development is reviewed. Other factors affecting the flow of information between users and developers are outlined. For each development paradigm, I identify the opportunities for adopting an effective ''user focus,'' the obstacles, and the mediators who contribute to bridging the gaps between developers and users.
On the compositional checking of validity
Authors: Winskel Glynn
Published: February 2016

This paper is concerned with deciding whether or not assertions are valid of a parallel process using methods which are directed by the way in which the process has been composed. The assertions are drawn from a modal logic with recursion, capable of expressing a great many properties of interest. The processes are described by a language inspired by Milner's CCS and Hoare's CSP, though with some modifications. The choice of constructors allows us to handle a range of synchronisation disciplines and ensures that the processes denoted are finite state. The operations are prefixing, a non-deterministic sum, product, restriction, relabelling and a looping construct. Arbitrary parallel compositions are obtained by using a combination of product, restriction and relabelling. We are interested in deciding whether or not an assertion A is valid of a process t. If it is valid, in the sense that every reachable state of t satisfies A, we write |= A:t. This paper investigates the extent to which the composition of t can guide methods for deciding |= A:t. For instance if t were a sum t_0 + t_1 we can ask what assertions A_0 and A_1 should be valid of t_0 and t_1 respectively to ensure that A is valid of t_0 + t_1. The paper formulates new compositional methods for deciding validity, and exposes some fundamental difficulties. Algorithms are provided to reduce validity problems for prefixing, sum, relabelling, restriction and looping to validity problems for their immediate components --- all these reductions depend only on the top-level structure of terms. The existence of these reductions rests on being able to 'embed' the properties of a term in the properties, or products of properties, of its immediate subterms. Because there is not such a simple embedding for the product construction of terms, as might be expected, similar reductions become much more complicated for products; although there are general results, and the reductions can be simple in special cases, the general treatment for products meets with fundamental difficulties. Whereas reductions for products always exist for this finite state language, they demonstrably no longer just depend on the top-level (product structure) of the term; in particular, a simple assertion is exhibited for which the size of the reduction must be quadratic in the number of states of the process. An attempt is thus made to explain what makes product different from the other operations with respect to compositional reasoning, and to delimit the obstacles to automated compositional checking of validity on parallel processes.
Strong typing of object-oriented languages revisited
Authors: Madsen Ole Lehrmann , Magnusson Boris , Møller-Pedersen Birger
Published: February 2016

This paper is concerned with the relation between subtyping and subclassing and their influence on programming language design. Traditionally subclassing as introduced by Simula has also been used for defining a hierarchical type system. The type system of a language can be characterized as strong or  weak and the type checking mechanism as static or dynamic. Parameterized classes in combination with a hierarchical type-system is an example of a language construct that is known to create complicated type checking situations. In this paper these situations are analyzed and several different solutions are found. It is argued that an approach with a combination of static and dynamic type checking gives a reasonable balance also here. It is also concluded that this approach makes it possible to base the type system on the class/subclass mechanism.
Proceedings of the CLICS Workshop: Part I og II
Authors: Winskel Glynn
Published: February 2016

This is a collection of papers, notes and copies of transparencies representing the talks of the CLICS Workshop at the Computer Science Department, Aarhus University, 23 - 27 March 1992. CLICS is an Esprit, Basic Research Action on Categorical Logic in Computer Science.
Towards a Prototyping Approach in Systems Development
Authors: Mogensen Preben Holst
Published: February 2016

This paper explores the notion of 'provocation through concrete experience' towards a provotyping approach. It addresses the question: How do we on the one hand, devise qualitatively new systems, and on the other hand, ensure their usability in a given practice? The notion of provocation through concrete experience is developed through an investigation of prototyping and activity theory. Exploration of this notion leads to the idea of the system developer 'provoking' concrete, everyday practice, by exposing current problems, calling forth what usually is taken for granted. Problems with current practice and a lack of mutual understanding, usually conceived of as hindrances to successful systems development, are used constructively. These ideas are compared to four related approaches: Euture Workshops, Metaphorical Design, Cooperative Prototyping, and Or ganizational Games. The comparison serves the twofold purpose of contextualizing the new ideas as well as developing techniques for carrying them out.
The Use of Sorts in Algebraic Specifications
Authors: Mosses Peter D.
Published: February 2016

Algebraic specification frameworks exploit a variety of sort disciplines. The treatment of sorts has a considerable influence on the ease with which such features as partiality and polymorphism can be specified. This survey gives an accessible overview of various frameworks, focusing on their sort disciplines and assessing their strengths and weaknesses for practical applications. Familiarity with the basic notions of algebraic specification is assumed.
Design, analysis and Reasoning about Tools: Abstracts from the Second Workshop (Aalborg, 1992, 20-21 August)
Authors: Nielson Flemming
Published: February 2016

The second DART workshop took place on August 20-21, 1992 in Aalborg. The primary aim of the workshop was to increase the awareness of DART participants for each other's work, and to stimulate cooperation between the various groups. This report contains a brief overview of DART as well as abstracts of the 20 talks given at the workshop and a status report of DART as of summer 1992.
Local Computation of Simultaneous Fixed-Points
Authors: Andersen Henrik Reif
Published: February 2016

We present a very simple, yet general algorithm for computing simultaneous, minimum fixed-points of monotonic functions, or turning the newpoint slightly, an algorithm for computing minimum solutions to a system of monotonic equations. The algorithm is local (demand-driven, lazy, ... ), i.e. it will try to determine the value of a single component in the simultaneous fixed-point by investigating only certain necessary parts of the description of the monotonic function, or in terms of the equational presentation, it will determine the value of a single variable by investigating only a part of the equational system.

In the worst-case this involves inspecting the complete system, and the algorithm will be a logarithmic factor worse than a global algorithm (computing the values of all variables simultaneously). But despite its simplicity the local algorithm has some advantages which promise much better performance on typical cases. The algorithm should be seen as a schema that for any particular application needs to be refined to achieve better efficiency, but the general mechanism remains the same. As such it seems to achieve performance comparable to, and for some examples improving upon, carefully designed ad hoc algorithms, still maintaining the benefits of being local.

We illustrate this point by tailoring the general algorithm to concrete examples in such (apparently) diverse areas as type inference, model checking, and strictness analysis. Especially in connection with the last example, strictness analysis, and more generally abstract interpretation, it is illustrated how the local algorithm provides a very minimal approach when determining the fixed-points, reminiscent of, but improving upon, what is known as Pending Analysis. In the case of model checking a specialised version of the algorithm has already improved on earlier known local algorithms.
Provably Correct Compiler Generation
Authors: Palsberg Jens
Published: February 2016

We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. We have used it to generate compilers for both a toy language and a non-trivial subset of Ada. The generated compilers emit absolute code for an abstract RISC machine language that is assembled into code for the SPARC and the HP Precision Architecture. The generated code is an order of magnitude better than that produced by compilers generated by the classical systems of Mosses, Paulson, and Wand. Our machine language needs no run time type-checking and is thus more realistic than those considered in previous compiler proofs. We use solely algebraic specifications; proofs are given in the initiaI model. The use of action semantics makes the processable language specifications easy to read and pleasant to work with. We view our compiler generator as a promising first step towards user-friendly and automatic generation of realistic and provably correct compilers.
Layered Predicates
Authors: Nielson Flemming , Nielson Hanne Riis
Published: February 2016

We review the concept of logical relations and how they interact with structural induction, furthermore we give examples of their use, and of particular interest is the combination with the PER-idea (partial equivalence relations). This is then generalized to Kripke logical relations; the major application is to show that in combination with the PER-idea this solves the problem of establishing a substitution property in a manner oonducive to structural induction. Finally we introduce the concept of Kripke-layered predicates; this allows a modular definition of predicates and supports a methodology of ''proofs in stages'' where each stage forcuses on only one aspect and thus is more manageable. All of these techniques have been tested and refined in ''realistic applications'' that have been documented elsewhere.
Technology as a Vehicle for Organisational Learning and Change
Authors: Bødker Susanne
Published: February 2016

In this paper, I suggest that technology can be used actively as a vehicle for organisational learning and change. My approach is one where work and the use of computer technology is studied from an action research perspective. This idea is illustrated by experiences from an ongoing project with the Danish National Labour Inspection Service. I discuss how ethnomethodology and activity theory, in particular the Finnish tradition of work development research, has informed our praxis, and the problems and challenges we have seen with their application in our area.
Length of Maximal Common Subsequences
Authors: Larsen Kim Skak
Published: February 2016

The problem of computing the length of the maximal common subsequences of two strings is quite well examined in the sequential case. There are many variations, but the standard approach is to compute the length in quadratic time using dynamic programming. A linear-time parallel algorithm can be obtained via a simple modification of this strategy by letting a linear number of processors sweep through the table created for the dynamic programming approach.

However, the contribution of this paper is to show that the problem is in NC. More specifically, we show that the length of the maximal common subsequences of two strings s and t can be computed in time O(log |s| € log |t|) in the CREW PRAM model and in time Theta(min(log |s|, log |t|)) in the COMMON CRCW PRAM model.
Models for Concurrency
Authors: Winskel Glynn , Nielsen Mogens
Published: February 2016

This is a draft version of a chapter for the Handbook of Logic and the Foundations of Computer Science, Oxford University Press. The final draft can be found as DAIMI PB 463.
 It surveys a range of models for parallel computation to include interleaving models like transition systems, synchronisation trees and languages (often called Hoare traces in this context), and models like Petri nets, asynchronous transition systems, event structures, pomsets and Mazurkiewicz traces where concurrency is represented more explicitly by a form of causal independence. The presentation is unified by casting the models in a category-theoretic framework. One aim is to use category theory to provide abstract characterisations of constructions like parallel composition valid throughout a range of different models and to provide formal means for translating between different models. It is still a draft at present. In particular, the ''Notes'' surveying related work are incomplete and the appendix on fibred categories needs to be overhauled in the light of some slick proofs, provided by Bart Jacobs. It is ragged in other places too. Constructive comments and corrections will be appreciated.
A knowledge of basic category theory is assumed, up to an acquaintance with the notion of adjunction.
Consistency and Semantics of Equational Definitions over Predefined Algebras
Authors: Antimirov Valentin M. , Degtyarev Anatoli
Published: February 2016

We introduce and study the notion of an equational definition over a predefined algebra (EDPA) which is a modification of the notion of an algebraic specification enrichment. We argue that the latter is not quite appropriate when dealing with partial functions (in particular, with those defined by non-terminating functional programs), and suggest EDPA as a more adequate tool for specification and verification purposes. Several results concerning consistency of enrichments and correctness of EDPA are presented. The relations between EDPA and some other approaches to algebraic specification of partial functions are discussed.
Exact Calculation of the Product of the Hessian Matrix of Feed-Forward Network Error Functions and a Vector in 0(N) Time
Authors: Møller Martin F.
Published: February 2016

Several methods for training feed-forward neural networks require second order information from the Hessian matrix of the error function. Although it is possible to calculate the Hessian matrix exactly it is often not desirable because of the computation and memory requirements involved. Some learning techniques do, however, only need the Hessian matrix times a vector. This paper presents a method to calculate the Hessian matrix times a vector in O(N) time, where N is the number of variables in the network. This is the same order as the calculation of the gradient to the error function. The usefulness of this algorithm is demonstrated by improvement of existing learning techniques.
Completeness Results for Linear Logic on Petri Nets
Authors: Engberg Uffe , Winskel Glynn
Published: February 2016

Completeness is shown for several versions of Girard's linear logic with respect to Petri nets as the class of models. The strongest logic considered is intuitionistic linear logic, with $\otimes$, $-\!\circ$, \&, $\oplus$ and the exponential ! (''of course´´), and forms of quantification. This logic is shown sound and complete with respect to atomic nets (these include nets in which every transition leads to a nonempty multiset of places). The logic is remarkably expressive, enabling descriptions of the kinds of properties one might wish to show of nets; in particular, negative properties, asserting the impossibility of an assertion, can also be expressed.
Type Inference of SELF: Analysis of Objects with Dynamic and Multiple Inheritance
Authors: Agesen Ole , Palsberg Jens , Schwartzbach Michael I.
Published: February 2016

We have designed and implemented a type inference algorithm for the full SELF language. The algorithm can guarantee the safety and disambiguity of message sends, and provide useful information for browsers and optimizing compilers.
Cryptanalysis of LOKI91
Authors: Knudsen Lars Ramkilde
Published: February 2016

In this paper we examine the redesign of LOKI, LOKI91 proposed by Brown et al. First it is shown that there is no characteristic with a probability high enough to do a successful differential attack on LOKI91. Secondly we show that the size of the image of the F-function in LOKI91 is 8\22*2^32. Finally we introduce a chosen plaintext attack that reduces an exhaustive key search on LOKI91 by almost a factor 4 using 2^33+2 chosen plaintexts.
Historical Analysis and Conflicting Perspectives: Contextualising HCI
Authors: Bødker Susanne
Published: February 2016

This paper develops two ways of analyzing the human-computer interaction of a computer application in use in an organization. The techniques, historical analyses and conflicting perspectives analysis, and the interplay between them, are used in providing the basis for a more detailed analysis.

Historical analyses focus on the historical development of artifacts and their use. Conflicting perspectives analysis reflects on the roles of the artifact in use, as system, tool, or medium. Combined, the two types of analysis allow for a focus in particular on conflicts between the roles of a specific artifact in use.

The techniques are based on human activity theory. They are illustrated by means of a case study of a computer application from a project with the Danish National Labour Inspection Service.
The breaking of the AR Hash Function
Authors: Damgård Ivan Bjerre , Knudsen Lars Ramkilde
Published: February 2016

The AR hash function has been proposed by  Algorithmic Research Ltd. It has been circulated in the ISO community (Working group 2, document WG2/N179), and is currently being used in practice in the German banking world. AR hash is based on DES and a variant of the CBC mode. It produces a 128 bit hash value.

 

In this paper, we present two attacks on AR hash. The first one constructs in one DES encryption two messages with the same hash value. The second one finds, given an arbitrary message  M , an M' 'not equal to' M with the same hash value as M. The attack is split into two parts, the first part needs about 2^33 DES encryptions and succeeds with probability 63 %, the second part needs at most about 2^66 DES encryptions and succeeds with probability about 99 % . Moreover, the 2^33 respectively 2^66 encryptions are necessary only in a one-time preprocessing phase, i.e. having done one of the attacks once with success, a new message can be attacked at the cost of no encryptions at all. Since the hash value is 128 bits long, the times for the attacks should be compared to 2^64, resp. 2^128 DES encryptions for brute force attacks.
Designing Dexter-based Cooperative Hypermedia Systems
Authors: Grønbæk Kaj , Hem Jens A. , Madsen Ole Lehrmann , Sloth Lennert
Published: February 2016

This paper discusses issues for the design of a Dexter-based cooperative hypermedia architecture and a specific system, DeVise Hypermedia (DHM), developed from this architecture. The Dexter Hypertext Reference Model was used as basis for designing the architecture. The Dexter model provides a general and solid foundation for designing a general hypermedia architecture. It introduces central concepts and proposes a layering of the architecture. However, to handle cooperative work aspects, such as sharing material and cooperative authoring, we have to go beyond the Dexter model concepts. To deal with such aspects we have extended our implementation of the Dexter concepts with support for long-term transactions, locking and event notification as called for by Halasz. The result is a platform independent architecture for developing cooperative hypermedia systems. The architecture consists of a portable kernel that constitutes an object oriented framework for developing Dexter compliant hypermedia systems. It is a client/server architecture including an object oriented database (OODB) to store the objects implementing the Dexter Storage Layer. We use a general OODB being co-developed to support long term transactions, flexible locking, and event notification. The transaction and locking mechanism support several modes of cooperation on shared hypermedia materials, and the notification mechanism supports the users in maintaining awareness of each others' activity. The portable kernel was used to implement the DHM system on two quite different platforms: UNIX/X-windows and Apple Macintosh.
Challenging Practice: an approach to Cooperative Analysis
Authors: Mogensen Preben Holst
Published: February 2016

Cooperative Analysis takes as its starting point the tradition of user-involvement in system development in Scandinavia, especially cooperative design. It points to the mismatch in this tradition between analysis as passive observation and design as cooperative intervention. Cooperative Analysis is conducted cooperatively and through intervention in the practice beeing analysed. Cooperative Analysis is seen as part of a large development process, and is thus seen as facilitating taking action in order to bring about change. The primary approach is one of provoking current practice through concrete experience. Provocation serves the purpose of calling forth hitherto taken-for-granted issues as well as it challenges the existing practice to investigate its dynamics and open up for new possibilities. As two specific means to this end, the book introduces an approach of using artifacts (e.g. commercially available products, prototypes, and mock-ups) to trigger new understandings of current practice and it introduces dilemma games to challenge current practice by exposing it to some of its inherent dilemmas.
The Emulated OCODE Machine for the Support of BCPL
Authors: Sørensen Ole
Published: February 2016

In the spring of 1973 it was decided to implement the language BCPL on the experimental microprogrammable computer RIKKE-1 being constructed in this department. The language was chosen to be the systems programming language for RlKKE-1, one argurment being the possibility of transferring the Oxford Operating system OS 8 to RIKKE-1. This paper describes the design process for an internal representation of OCODE, the resulting machine, the emulator, and the assembler, and finally there is a discussion of our experiences of running the OCODE machine during the past 8 months. Some future analysis and possible modifications are mentioned.
Absolute stability properties of the explicit linear 3-step formulae
Authors: Zlatev Zahari , Østerby Ole
Published: February 2016

A three-parameter family of explicit linear 3-step formulae is derived. The conditions which ensure zero-stability of the formulae in the family are formulated. The absolute stability properties of the zero-stable formulae in the family are investigated both for p = 3 and p = 2 where p is the order of the formulae under consideration. Some numerical experiments are carried out in order to illustrate that formulae with good absolute stability properties can efficiently be used in the numerical solution of problems in which the absolute stability properties are dominant.
La pratique réflexive dans la formation en travail social. Le parcours de professionnalisation et le mémoire de recherche
Authors: Molina1 Yvette
Published: February 2016

Cet article se propose d’analyser les enjeux de la pratique réflexive dans le champ professionnel du travail social au prisme du cadre théorique de la sociologie des professions. S’agissant des métiers du social dont les missions sont orientées vers le traitement de situations singulières et complexes, la posture réflexive s’impose au praticien comme une nécessité dans sa pratique au-delà des techniques et des méthodes d’intervention. Il s’agit de faire face à des situations conjecturelles qui obligent à des délibérations complexes et qui engagent le praticien dans des pratiques prudentielles au sein d’organisations de travail elles-mêmes réflexives. La pratique réflexive passe par un apprentissage dans un processus de professionnalisation au moment de la formation initiale. La démarche d’acquisition d’une posture réflexive du futur praticien est illustrée à travers deux dispositifs de formation : l’autoévaluation du parcours de professionnalisation et l’initiation à la recherche.
kula’ūtam epēšum
Authors: Peled Ilan
Published: February 2016

Several terms encountered in Mesopotamian sources stand for titles of persons who served either in the palace or in the temple and displayed ambiguous gender qualities. Some of these persons, albeit being males, were characterized by feminine traits and were therefore considered by their society to be effeminate. One of the terms related to these gender-ambiguous persons was kulu’u, whose exact meaning has never been fully determined, mainly because of the scarcity of its textual attestations. On several occasions this term is mentioned in contexts expressing scorn and contempt and was thus used as a pejorative expression. This paper aims at elucidating this phenomenon by clarifying the nature of the vague term kulu’u and subsequently the reasons for its use as a derogatory term.
Contours of Conversion
Authors: Carlson Thomas A.
Published: February 2016

The Islamization of Syria, a multi-faceted social and cultural process not limited to demography, was slow and highly variable across different locales. This article analyzes geographical works—ten in Arabic, one in Persian, and one in Hebrew— as well as the earliest Ottoman defters of the province to outline the process of Islamization in Syria from the Islamic conquest in the seventh century to the Ottoman conquest in the sixteenth. Geographical texts cannot be mined as databases, but when interpreted as literature they provide often detailed information regarding the foundation of mosques, the slow conversion of multi-religious shrines, and areas within Syria known for particular religious affiliations.
The Canonization of Islamic Law: A Social and Intellectual History. By Ahmed El Shamsy
Authors: Stewart Devin J.
Published: February 2016

The Canonization of Islamic Law: A Social and Intellectual History. By Ahmed El Shamsy. New
York: Cambridge University Press, 2013.

Pp. ix + 253. $90.
Expeditions: An Early Biography of Muḥammad by Maʿmar Ibn Rāshid according to the Recension of ʿAbd al-Razzāq al-Ṣanʿānī. Edited and translated by Sean W. Anthony
Authors: Lecker Michael
Published: February 2016

The Expeditions: An Early Biography of Muḥammad by Maʿmar Ibn Rāshid according to the Recension of ʿAbd al-Razzāq al-Ṣanʿānī. Edited and translated by Sean W. Anthony. Library of Arabic Literature. New York: New York University Press, 2014. Pp. xlv + 372. $35.
Spells, Images, and Mandalas: Tracing the Evolution of Esoteric Buddhist Rituals. By Koichi Shinohara
Authors: Copp Paul
Published: February 2016

Spells, Images, and Mandalas: Tracing the Evolution of Esoteric Buddhist Rituals. By Koichi Shinohara. The Sheng Yen Series in Chinese Buddhist Studies. New York: Columbia University Press, 2014. Pp. xxii + 324. $55.
Buddhist Manuscripts from Central Asia: The British Library Sanskrit Fragments, vol. II. Edited by Seishi Karashima and Klaus Wille
Authors: Baums Stefan
Published: February 2016

Buddhist Manuscripts from Central Asia: The British Library Sanskrit Fragments, vol. II. Edited by Seishi Karashima and Klaus Wille. Tokyo: International Research Institute for Advanced Buddhology, 2009. Vol. II.1: pp. 668. Vol. II.2: 382 plates.
Weather Omens of Enūma Anu Enlil: Thunderstorms, Wind and Rain (Tablets 44–49). By Erlend Gehlken
Authors: Steele John M.
Published: February 2016

Weather Omens of Enūma Anu Enlil: Thunderstorms, Wind and Rain (Tablets 44–49). By Erlend Gehlken. Cuneiform Monographs, vol. 43. Leiden: Brill, 2012. Pp. x + 286, 47 plts. $144.
Books Received
Authors: Editors
Published: February 2016

Books received
ChemInform Abstract: PHOSPHOR‐FLUOR‐CHEMIE 12. MITT. ALKYLTHIO‐ UND ARYLTHIO‐FLUORPHOSPHORANE
Authors: PEAKE S. C. , SCHMUTZLER R.
Published: February 2016

Die Silylsulfide (I) reagieren mit den Phosphoranen (II) unter Aufspaltung der S‐Si‐Bindung zu den Thiofluorphosphoranen (III) (Ausbeuten 50‐100%).
ChemInform Abstract: SCHWEFEL‐STICKSTOFF‐VERBINDUNGEN 29. MITT. TRIFLUORMETHYLSULFONYLSTICKSTOFF‐VERBINDUNGEN
Authors: ROESKY H. W. , HOLTSCHNEIDER G. , GIERE H. H.
Published: February 2016

Das Sulfonamid (I) reagiert mit PCl5 in 15 ‐20%iger Ausbeute zu dem Sulfonyl‐Derivat (II); durch Umsetzung mit Thionylchlorid wird das Imid (III) (Ausbeute 40%) dargestellt.
ChemInform Abstract: UMSETZUNG VON TRICHLORPHOSPHAZOVERBINDUNGEN MIT CHLOROXID
Authors: KORNUTA P. P. , SEVCENKO V. I.
Published: February 2016

Die Trichlorphosphazo‐1,1,2,2‐tetrachloralkane (I) reagieren in CCl4 mit frisch bereitetem Dichloroxid bei 12 ‐ 15°C innerhalb von 10 ‐ 12 Stdn. mit sehr guten Ausbeuten zu Säurechloriden vom Typ (II).
ChemInform Abstract: SULFIDE VON ALKYLTHIONOPHOSPHINEN 10. MITT. MECHANISMUS DER RK. VON SULFIDEN MIT ALKOHOLEN IN GEGENWART VON AMINEN
Authors: GRISINA O. N. , ELFIMOVA I. A.
Published: February 2016

Die Geschwindigkeit der Umsetzung von Sulfiden (I) mit Alkoholen in Gegenwart von Aminen (II) wird durch die Bildung innerer Salze (III) beschleunigt.
ChemInform Abstract: FLUORDIPHENYLPHOSPHIN
Authors: BROWN C. , MURRAY M. , SCHMUTZLER R.
Published: February 2016

Die Amide (I) bilden mit dem Fluorid (II) die entsprechenden Fluorphosphine (III) und Carboxyamide (IV).
ChemInform Abstract: ANLAGERUNG DER DIALKYLPHOSPHORIGEN SAEURE AN TRIS‐(P‐ISOCYANATOPHENYL)‐METHAN
Authors: BACHITOV M. I. , KUZNECOV E. V. , KOKINA G. T.
Published: February 2016

Eine 20%ige Lösung von Tris‐(p‐isocyanatophenyl)‐methan (I) in Dichlor= äthan wird langsam mit dialkylphosphoriger Säure (II) vermischt, die als Katalysator Natriumdialkylphosphit enthält.
ChemInform Abstract: ELEKTROCHEMISCHE SYNTH. PHOSPHORORGANISCHER VERBINDUNGEN 3. MITT. ELEKTROREDUKTION DES PHOSPHORS IN GEGENWART VON STYROL
Authors: KAABAK L. V. , SANDRINOV N. JA. , TOMILOV A. P.
Published: February 2016

Bei der elektrochemischen Reduktion des weißen Phosphors in Gegenwart von Styrol entsteht vorzugsweise die Verbindung (II), in deutlich geringeren Mengen die Substanzen (III) und (IV), zuweilen auch noch (I).
ChemInform Abstract: KONDENSATION VON 2‐PYRIDYLAZOMETHINEN UND 2,2′‐DIPYRIDYLDIAZOMETHINEN MIT DIALKYLPHOSPHITEN
Authors: LUGOVKIN B. P.
Published: February 2016

Aus Pyridinaldehyd (I) und p‐Anisidin (IIa) bzw. p‐Phenetidin (IIb) erhält man in siedendem Äthanol die Azomethine (III).
ChemInform Abstract: SYNTH. UND EIGENSCHAFTEN TERT.‐MESITYL(AETHYL)PHOSPHINE
Authors: IL'INA L. K. , KARAVANOV K. V. , KARPOVA E. N. , BOKANOV A. I. , STEPANOV B. I.
Published: February 2016

Mesitylmagnesiumbromid (I) wird bei ‐10°C in Tetrahydrofuran mit Diäthylchlorphosphin (II) oder Äthyldichlorphosphin (V) zu den Mono‐ und Dimesitylphosphinen (III) und (VI) umgesetzt.
ChemInform Abstract: CYCLISCHE ANORGANISCHE VERBINDUNGEN 9. MITT. FLUORIERUNG VON BIS‐DIMETHYLAMINO‐TETRACHLOR‐TRIPHOSPHONITRIL
Authors: GREEN BRIAN , SOWERBY D. B.
Published: February 2016

Mit K‐fluorsulfit reagiert ein Gemisch des cis‐Nitrils (I) und seines trans‐Isomeren durch Substitution von zwei Cl‐Atomen an der PCI, ‐Gruppe zum Di‐ fluorid (II) und dem entsprechenden trans‐Isomeren.
ChemInform Abstract: ARSENORGANO‐VERBINDUNGEN 14. MITT. DARST. DER OMEGA‐CHLORALKYL‐DIALKYLARSINE R2AS‐(CH2)NCL
Authors: TZSCHACH ALFRED , NINDEL HORST
Published: February 2016

Die Umsetzung der Li‐arside (I) mit den Dichloralkanen (II) im Überschuß in Äther bei 0°C liefert die Titelverbindungen (III) (70‐76% Ausbeute) neben ditertiären Arsinen (ca.
ChemInform Abstract: KOMPLEXONE 43. MITT. KOMPLEXE DES DREIWERTIGEN ANTIMONS MIT POLYAMINOCARBOXYLATEN 44. MITT. KOMPLEXE DER ANIONEN DER TRIAETHYLENTETRAMINHEXAESSIGSAEURE MIT CALCIUM(II), KUPFER(II) UND ZINK(II), KOMPLEXBLDG.‐TENDENZ DES DREIWERTIGEN ANTIMONS IN WAESSRIGER LOESUNG
Authors: ANDEREGG G. , MALIK S. , LINDEN W. V. D.
Published: February 2016

Die Komplexbildung von Sb(III) mit den Liganden‐Anionen L(1) und L(2) wird untersucht.
ChemInform Abstract: STABILITAET VON TROPOLON‐CHELATEN VON ZWEI‐ UND DREIWERTIGEN METALL‐IONEN
Authors: HIRAI MICHIO , OKA YOSHINAGA
Published: February 2016

Die Reaktion des Tropolons (I) mit einem Überschuß an Metall(II)‐ bzw. Metall(III)‐perchloraten zu den 1:1‐Chelaten (II) wurde spektrophotometrisch untersucht.
ChemInform Abstract: OPTISCHE EIGENSCHAFTEN VON EU(3+)‐CHELATEN
Authors: RAO V. J. , RAO D. R. , SINHA A. P. B.
Published: February 2016

Absorptions‐ und Fluoreszenzemissions‐Spektren der nach bekannten Methoden dargestellten Eu(III)‐Chelate (I)‐(III) werden untersucht.
ChemInform Abstract: SYNERGETISCHER EFFEKT BEI DER LOESUNGSMITTELEXTRAKTION ‐ EINFLUSS VON CHELATBILDENDEN LIGANDEN AUF DIE STABILITAET GEMISCHTER LUTETIUM‐CHELATE MIT BETA‐DIKETONEN UND IHRER ADDITIONSVERBINDUNGEN MIT TOPO
Authors: SHIGEMATSU TSUNENOBU , HONJYO TAKAHARU
Published: February 2016

Die Extraktion von Lu(III) aus wäßriger Lösung mit einem Gemisch der entsprechenden Diketone in Benzol in und ohne Gegenwart von TOPO wird untersucht.
ChemInform Abstract: TITAN‐STICKSTOFF‐VERBINDUNGEN 9. MITT. TRIS‐(DIALKYLAMINO)‐TITAN‐DERIVATE DER ELEMENTE P UND AS
Authors: BUERGER H. , NEESE H. J.
Published: February 2016

Die Reaktion des Alkylaminotitanbromids (I) mit dem entsprechenden metallierten Pniktid (II) führt zu den Verbindungen (III).
ChemInform Abstract: RK. VON ZIRKONIUMISOPROPANOLAT MIT BETA‐DIKETONEN UND BETA‐KETOESTERN
Authors: SAXENA U. B. , RAI A. K. , MATHUR V. K. , MEHROTRA R. C. , RADFORD D.
Published: February 2016

Die Reaktion des Zr‐Alkoholates (I) mit den Diketonen (II) bzw. (IV) oder dem Ketoester (V) ergibt gemischte Enolato‐Komplexe wie (III).
ChemInform Abstract: RK. VON ORGANOZINNVERBINDUNGEN MIT ALKOXOTITAN‐CHELATEN
Authors: GOPINATHAN SARADA , GOPINATHAN C. , GUPTA J.
Published: February 2016

Die aus den entsprechenden Dichloro‐Ti‐Chelaten und Butanol dargestellten Ti‐Chelate (I) bilden beim Kochen mit einem Überschuß der Sn(IV)‐Verbindungen (II) bzw. (IV) in Toluol die Stannyloxy‐Ti‐Komplexe (III) bzw. (V).
ChemInform Abstract: KINETIK UND MECHANISMUS DER RK. VON CHROM(II)‐CYANID‐KOMPLEXEN MIT WASSERSTOFFPEROXID IN WAESSRIGER LOESUNG
Authors: DAVIES GOEFFREY , SUTIN NORMAN , WATKINS KAY O.
Published: February 2016

Die Kinetik der Reaktion von Cr(II) mit Wasserstoffperoxid wurde in alkalischer Cyanid‐Lösung bei 25°C unter Reaktionsbedingungen pseudo‐erster Ordnung spektrophotometrisch untersucht.
ChemInform Abstract: UEBERGANGSMETALL‐CARBEN‐KOMPLEXE 22. MITT. AETHOXYDIAETHYLAMINOCARBEN‐PENTACARBONYL‐CHROM(0)
Authors: FISCHER E. O. , KOLLMEIER H. J.
Published: February 2016

Aus dem Li‐amid (I) und Hexacarbonylchrom entsteht in Diäthyläther das kristalline Produkt (II), das wahrscheinlich als 1:1‐Addukt mit Äther vorliegt.
ChemInform Abstract: BILDUNGSKONSTANTEN VON CHROM(II)‐KOMPLEXEN MIT LIGANDEN VOM (O,O)‐, (O,N)‐ UND (N,N)‐TYP UND VERGLEICH MIT KOMPLEXEN MIT ELEMENTEN DER ERSTEN UEBERGANGSMETALL‐PERIODE
Authors: FUKUDA YUTAKA , KYUNO EISHIN , TSUCHIYA RYOKICHI
Published: February 2016

Die Bildungskonstanten der Cr(II)‐Komplexe (I), (II) und (III) und eines 1:3‐Komplexes mit Bipyridyl und die Säuredissoziationskonstanten der Liganden wurden bestimmt.
ChemInform Abstract: SCHWINGUNGSSPEKTROSKOPISCHE UNTERSUCHUNGEN DER INNEREN ROTATION VON SYMMETRISCHEN GRUPPEN 1. MITT. BEWEIS EINER HOHEN BARRIERE DER INNEREN ROTATION VON METHYLPENTACARBONYLMANGAN
Authors: DEMPSTER A. B. , POWELL D. B. , SHEPPARD N.
Published: February 2016

Die IR‐Spektren der Titelverbindung im Gaszustand, in Lösung und in KBr werden untersucht.
ChemInform Abstract: IONISATIONSISOMERIE BEI SULFINATO‐KOMPLEXEN VON UEBERGANGSMETALLEN
Authors: LINDNER EKKEHARD , VITZTHUM GUENTER
Published: February 2016

Bei der Einwirkung des Amins (II) auf den Sulfinato‐Komplex (I) in Äthanol entsteht bei Raumtemperatur in ca. 70%iger Ausbeute die Ionenverbindung (III), deren Kation als Tetraphenylborat charakterisiert werden kann.
ChemInform Abstract: ENDGUELTIGE IDENTIFIZIERUNG DER STRUKTUREN VON DICYCLOPENTADIENYLDIEISENTETRACARBONYL IN LOESUNG
Authors: BULLITT J. G. , COTTON F. A. , MARKS T. J.
Published: February 2016

In polaren Lösungsmitteln wurde anhand der PMR‐Spektren ein Gleichgewicht zwischen dem cis‐ (I) und dem trans‐Isomeren (II) festgestellt.
ChemInform Abstract: THEORETISCHE UNTERSUCHUNG UND ANWENDUNGSMOEGLICHKEITEN DER METHODE DER ′KONTINUIERLICHEN VARIATIONEN′ AUF STARK DISSOZIIERTE KOMPLEXE
Authors: MARCANTONATOS M. , BUFFLE R. , MONNIER D.
Published: February 2016

Es werden Grenzwerte für den Molenbruch des Liganden angegeben, durch die die allgemeine Gleichung einer J ob‐Kurve auch zur Bestimmung der Stabilitätskonstanten stark dissoziierter Komplexe verwendet werden kann.
ChemInform Abstract: EIN ′KRITERIUM FUER DIE AROMATIZITAET′, KONZENTRATIONSABHAENGIGKEIT DER MOLAREN MAGNETISCHEN DREHUNG
Authors: BAUER K. , EBERHARDT H. , FALK H. , HALLER G. , LEHNER H.
Published: February 2016

Es wurde der Versuch unternommen, ein für die Aromatizität angegebenes Kriterium ("4 Labarresches Kriterium"), nämlich den Verlauf der Konzentrationsabhängigkeit der molaren magnetischen Drehung, auf Metallocene wie z.B. Äthylferrocen anzuwenden.
ChemInform Abstract: THERMODYNAMIK UND KINETIK DER UMWANDLUNG PLANAR‐TETRAEDRISCH VON DIHALOGENO‐BIS‐(DIARYLMETHYLPHOSPHIN)‐NICKEL(II)‐KOMPLEXEN
Authors: PIGNOLET L. H. , HORROCKS WILLIAM DEW. JUN. , HOLM R. H.
Published: February 2016

Die Komplexe (II) werden durch Umsetzung des entsprechenden Phosphins (I) mit hydratisierten Ni(II)‐Halogeniden unter Stickstoff dargestellt.
ChemInform Abstract: KOMPLEXE MIT MAKROCYCLISCHEN LIGANDEN 1. MITT. MECHANISMUS DER KOMPLEXBLDG. ZWISCHEN NI(2+) UND 1,4,8,11‐TETRAAZACYCLOTETRADECAN
Authors: KADEN TH.
Published: February 2016

Die Kinetik der Bildung des Komplexes (I) aus Ni(2+) und der bei pH 5‐8 diprotoniert vorliegenden Titelverbindung unter Abspaltung zweier Protonen wird spektrophotometrisch und potentiometrisch untersucht.
ChemInform Abstract: UEBERGANGSMETALL‐KOMPLEXE EINER REIHE VON NEUEN MAKROCYCLISCHEN SECHSZAEHNIGEN LIGANDEN
Authors: FLEISCHER E. B. , TASKER P. A.
Published: February 2016

Bei der Umsetzung des Dialdehyds (I) und des Phenylmercaptoäthans (II) mit entsprechenden Metallperchloraten in Methanol bilden sich die Komplexe (III) als Methanol‐Solvat.
ChemInform Abstract: SYNTH. VON ALICYCLISCHEN 1‐AMINO‐CARBONSAEUREN UND IHREN DERIVATEN
Authors: CREMLYN R. J. W. , ELLAM R. M. , MITRA T. K.
Published: February 2016

Aus entsprechenden Ketonen wurden unter Anwendung der Bucherer‐Synthese bzw. der Strecker‐Synthese Hydantoine wie (I) dargestellt und alkalisch zu den entsprechenden Aminosäuren wie (II) verseift.
ChemInform Abstract: CHEMIE MEHRKERNIGER VERBINDUNGEN 19. MITT. RK.‐PRODUKTE VON DODECACARBONYLTRIRUTHENIUM UND DI‐N‐BUTYLAETHER
Authors: JOHNSON B. F. G. , LEWIS J. , WILLIAMS I. G.
Published: February 2016

Das Carbonyl (I) reagiert mit Di‐n‐butyläther bei 140°C zu den Carbonylverbindungen (II) (Ausbeute 30%), (III) (10%) und (IV) (2%), die mit Hilfe von IR‐, NMR‐ und Massenspektren charakterisiert werden.
ChemInform Abstract: WECHSELWIRKUNG ZWISCHEN ORGANOQUECKSILBERKOMPLEXEN UND HALOGENOKOMPLEXEN VON PLATIN, PALLADIUM UND NICKEL, KOHLENMONOXID‐EINLAGERUNG IN DIE PLATIN‐KOHLENSTOFF‐BINDUNG
Authors: CROSS R. J. , WARDLE R.
Published: February 2016

Die Reaktion der Platinkomplexe (I) mit der Organoquecksilberverbindung (II) führt immer ohne Berücksichtigung der Stereochemie des Ausgangskomplexes zu den stabileren trans‐Komplexen (III), die auch durch Reaktion des Komplexes (IV) mit QuecksilberUD‐chlorid erhalten werden.
ChemInform Abstract: DARST. VON PLATIN‐SILICIUM‐BINDUNGEN ENTHALTENDEN VERBINDUNGEN AUS SILICIUMHYDRIDEN UND PLATIN(0)‐KOMPLEXEN
Authors: CHATT J. , EABORN C. , KAPOOR P. N.
Published: February 2016

Die Komplexe (I) reagieren mit den Siliciumhydriden (II) je nach den Reaktionsbedingungen zu den Komplexen (III) oder (IV), wobei der Komplex (IV) durch das Trichlorderivat (II) in den entsprechenden Komplex (III) umgewandelt werden kann.
ChemInform Abstract: STRUKTUR VON ORGANOSCHWEFELVERBINDUNGEN XVI, UV‐SPEKTREN DER RINGSULFOXIDE, DIE SICH VON BENZOTHIACYCLENEN UND BENZOTHIACYCLENONEN ABLEITEN
Authors: KRESZE G. , AMANN W.
Published: February 2016

Die UV‐Spektren der cyclischen Sulfoxide (I) und (II), ihrer offenkettigen Analoga (III) sowie entsprechender Ketonderivate (IV)‐(VII) werden untersucht (Abbildungen, Tabellen).
ChemInform Abstract: INTEGRALE INTENSITAETEN VON CARBONYL‐VALENZSCHWINGUNGSBANDEN IN LOESUNG VON ACETONITRIL UND DEREN STRUKTURELLE BEDEUTUNG
Authors: WOOD A. B. , BUCKINGHAM B.
Published: February 2016

Von Ketonen wie (I) und (II), Carbonsäuren wie (III) und (IV), Anhydriden wie (V), Lactonen wie (VI) und den toxisch fungalen Metaboliten (VII) werden die integralen Intensitäten der CO‐Valenzschwingungsbanden in Acetonitril gemessen und mit solchen in weniger polaren Lösungsmitteln verglichen.
ChemInform Abstract: NACHWEIS GEOMETRISCHER ISOMERE DURCH FRAKTIONIERTE SUBLIMATION IM MASSENSPEKTROMETER
Authors: MAJER J. R. , PERRY R.
Published: February 2016

Am Beispiel der Oxime (I), der 0‐ und p‐Nitroverbindungen (II), der cis‐ und trans‐Verbindung (III), sowie acht 3‐5gliedriger Aromaten und den Verbindungen (IV) wird gezeigt, daß für spezifische m/e‐Werte die integrierten Ionenstromkurven Feinstrukturen zeigen, wenn die Proben Mischungen von Isomeren enthalten.
ChemInform Abstract: BEWEIS FUER VERDRILLTE NORBORNANE, ROENTGEN‐BEUGUNG UND VALENZ‐KRAFTFELD‐BERECHNUNGEN
Authors: ALTONA C. , SUNDARALINGAM M.
Published: February 2016

Gerüsttorsions‐Winkel von Norbornanen, Camphanen und z.T. Norbornenen werden berechnet.
ChemInform Abstract: MO‐BERECHNUNGEN AN CARBONIUMIONEN 3. MITT. BARRIEREN IN AETHYLKATIONEN
Authors: WILLIAMS JAMES E. JUN. , BUSS VOLKER , ALLEN LELAND C. , R. SCHLEYER PAUL VON , LATHAN WILLIAM A. , HEHRE WARREN J. , POPLE JOHN A.
Published: February 2016

Zur Berechnung von Energien, die sich auf die Nichtplanarität und die Torsionswechselwirkungen in nichtebenen Ionen beziehen, wird das Äthylkation als einfachstes Ion, in dem Torsionsbarrieren möglich sind, als geeignetes Modell herangezogen.
ChemInform Abstract: KONFORMATIONSANALYSE, NMR‐SPEKTREN VON DIASTEREOMEREN 3‐METHYL‐PENTANDIOLEN‐(2,4) ABGELEITETEN ACETALEN
Authors: PIHLAJA KALEVI , AEYRAES PERTTI
Published: February 2016

Die Konformation der Acetale (I)‐(III) wird aus den NMR‐Spektren abgeleitet.
ChemInform Abstract: ROENTGENSTRUKTURANALYSE EINES 1,2,3,6,7,8‐HEXATHIECANS
Authors: LEMMER FRIEDHELM , FEHER FRANZ , GIEREN ALFRED , HECHTFISCHER SIEGFRIED , HOPPE WALTER
Published: February 2016

Nach der dreidimensionalen Analyse besitzt das Thiecan (I) ein kristallogra‐ phisches Symmetriezentrum; der zehngliedrige Ring hat eine dem Cyclodecan analoge Konformation mit acht synklinalen und zwei antiperiplanaren partiellen Konformationen.
ChemInform Abstract: EINFLUSS VON TEMPERATUR UND KONZENTRATION AUF DIE WECHSELWIRKUNGEN VON NICKEL(II)‐CHLORID IN DIMETHYLSULFOXID
Authors: GRIFFITHS T. R. , SCARROW R. K.
Published: February 2016

Die in DMSO erhaltenen oktaedrischen und tetraedrischen Ni(II)‐Komplexe (I), (II) bzw. (III), (IV) werden beschrieben.