ALWIN-Algorithmic Wiswesser Notation System for Organic Compounds

ALWIN, a new chemical notation system for organic compounds, based on the Wiswesser Line Notation, is described. Procedures and rules are given for constructing ALWIN for acyclic structures and cyclic structures, vi.?., benzene and Its derivatives, monocyclic, bicyclic, polycyclic, perifused, splro, bridged ring, and ring of rlngs systems. A new method called "tessellation" is introduced for the topological descrlptlon of fused and spiro ring systems. Also new concepts are introduced for describing bridged ring and ring of rlngs systems.

Bloch-Nordsieck thermometers: One-loop exponentiation in finite temperature QED

We study the scattering of hard external particles in a heat bath in a real-time formalism for finite temperature QED. We investigate the distribution of the 4-momentum difference of initial and final hard particles in a fully covariant manner when the scale of the process, Q, is much larger than the temperature, T. Our computations are valid for all T subject to this constraint. We exponentiate the leading infra-red term at one-loop order through a resummation of soft (thermal) photon emissions and absorptions. For T > 0, we find that tensor structures arise which are not present at T = 0. These carry thermal signatures. As a result, external particles can serve as thermometers introduced into the heat bath. We investigate the phase space origin of log (Q/M) and log (Q/T) terms.

Description of ring puckering of furanose: An analytical approach

An analytical approach for the description of the ring puckerings from the endocyclic ring torsion angles of a five-membered saturated ring is given. This description is independent of any reference conformation. For the description, a revised notation for the endocyclic ring torsion angles has been suggested. The application of this method to the furanose ring is described in detail.

Representation of Stereoisomers in ALWIN

Tlhe well-known Cahn-lngold-Prelog method of specifying the stereoisomers is introduced within the framework of ALWIN-Algorithmic Wiswesser Notation. Given the structural diagram, the structural ALWIN is first formed; the speclflcation symbols are then introduced at the appropriate places to describe the stereoisomers.

Isoperimetric Problem and Meta-fibonacci Sequences

Let G = (V,E) be a simple, finite, undirected graph. For S ⊆ V, let $\delta(S,G) = \{ (u,v) \in E : u \in S \mbox { and } v \in V-S \}$ and $\phi(S,G) = \{ v \in V -S: \exists u \in S$ , such that (u,v) ∈ E} be the edge and vertex boundary of S, respectively. Given an integer i, 1 ≤ i ≤ ∣ V ∣, the edge and vertex isoperimetric value at i is defined as b e (i,G) =  min S ⊆ V; |S| = i |δ(S,G)| and b v (i,G) =  min S ⊆ V; |S| = i |φ(S,G)|, respectively. The edge (vertex) isoperimetric problem is to determine the value of b e (i, G) (b v (i, G)) for each i, 1 ≤ i ≤ |V|. If we have the further restriction that the set S should induce a connected subgraph of G, then the corresponding variation of the isoperimetric problem is known as the connected isoperimetric problem. The connected edge (vertex) isoperimetric values are defined in a corresponding way. It turns out that the connected edge isoperimetric and the connected vertex isoperimetric values are equal at each i, 1 ≤ i ≤ |V|, if G is a tree. Therefore we use the notation b c (i, T) to denote the connected edge (vertex) isoperimetric value of T at i. Hofstadter had introduced the interesting concept of meta-fibonacci sequences in his famous book “Gödel, Escher, Bach. An Eternal Golden Braid”. The sequence he introduced is known as the Hofstadter sequences and most of the problems he raised regarding this sequence is still open. Since then mathematicians studied many other closely related meta-fibonacci sequences such as Tanny sequences, Conway sequences, Conolly sequences etc. Let T 2 be an infinite complete binary tree. In this paper we related the connected isoperimetric problem on T 2 with the Tanny sequences which is defined by the recurrence relation a(i) = a(i − 1 − a(i − 1)) + a(i − 2 − a(i − 2)), a(0) = a(1) = a(2) = 1. In particular, we show that b c (i, T 2) = i + 2 − 2a(i), for each i ≥ 1. We also propose efficient polynomial time algorithms to find vertex isoperimetric values at i of bounded pathwidth and bounded treewidth graphs.

An algorithm to detect linearly separable clusters of binary patterns

The clusters of binary patterns can be considered as Boolean functions of the (binary) features. Such a relationship between the linearly separable (LS) Boolean functions and LS clusters of binary patterns is examined. An algorithm is presented to answer the questions of the type: “Is the cluster formed by the subsets of the (binary) data set having certain features AND/NOT having certain other features, LS from the remaining set?” The algorithm uses the sequences of Numbered Binary Form (NBF) notation and some elementary (NPN) transformations of the binary data.

An algorithm to detect linearly separable clusters of binary patterns

The clusters of binary patterns can be considered as Boolean functions of the (binary) features. Such a relationship between the linearly separable (LS) Boolean functions and LS clusters of binary patterns is examined. An algorithm is presented to answer the questions of the type: “Is the cluster formed by the subsets of the (binary) data set having certain features AND/NOT having certain other features, LS from the remaining set?” The algorithm uses the sequences of Numbered Binary Form (NBF) notation and some elementary (NPN) transformations of the binary data.

Simultaneous display of image and spectrum in the same plane: a generalized analysis

A generalized analysis, using the Vander Lugt operational notation, of the building block optical system comprising a single holographic optical element (HOE) for achieving simultaneous display of the spectrum and the image of an object in a single plane, has been carried out. The salient features of this analysis are: (1) it allows comprehensive characterization of the HOE, (2) it provides insights into the many possible configurations for the system, and (3) it explains the existing results in a consistent manner.

The absolute orientation of a molecule in space: Extension of the 'CIP' system

A scheme for denoting the absolute spatial orientation of molecules and molecular fragments is presented; this is based on three angular deviations - one for each spatial dimension - with respect to a reference orientation, which is itself defined with the help of certain features of the Cahn-Ingold-Prelog stereochemical notation. The new scheme helps in reconstructing the three-dimensional characteristics of molecules from purely verbal descriptors, and may thus find application in various information storage and retrieval processes (e.,-. encrypting holograms, etc.).

An interior penalty method for a sixth-order elliptic equation

We derive and study a C(0) interior penalty method for a sixth-order elliptic equation on polygonal domains. The method uses the cubic Lagrange finite-element space, which is simple to implement and is readily available in commercial software. After introducing some notation and preliminary results, we provide a detailed derivation of the method. We then prove the well-posedness of the method as well as derive quasi-optimal error estimates in the energy norm. The proof is based on replacing Galerkin orthogonality with a posteriori analysis techniques. Using this approach, we are able to obtain a Cea-like lemma with minimal regularity assumptions on the solution. Numerical experiments are presented that support the theoretical findings.

Intensity profile of light scattered from a rough surface

We present in this paper, approximate analytical expressions for the intensity of light scattered by a rough surface, whose elevation. xi(x,y) in the z-direction is a zero mean stationary Gaussian random variable. With (x,y) and (x',y') being two points on the surface, we have h. = 0 with a correlation, = sigma(2)g(r), where r = (x - x')(2) + ( y - y')(2)](1/2) is the distance between these two points. We consider g(r) = exp-r/l)(beta)] with 1 <= beta <= 2, showing that g(0) = 1 and g(r) -> 0 for r >> l. The intensity expression is sought to be expressed as f(v(xy)) = {1 + (c/2y)v(x)(2) + v(y)(2)]}(-y), where v(x) and v(y) are the wave vectors of scattering, as defined by the Beckmann notation. In the paper, we present expressions for c and y, in terms of sigma, l, and beta. The closed form expressions are verified to be true, for the cases beta = 1 and beta = 2, for which exact expressions are known. For other cases, i.e., beta not equal 1, 2 we present approximate expressions for the scattered intensity, in the range, v(xy) = (v(x)(2) + v(y)(2))(1/2) <= 6.0 and show that the relation for f(v(xy)), given above, expresses the scattered intensity quite accurately, thus providing a simple computational methods in situations of practical importance.

Checking Liveness Properties of Presburger Counter Systems Using Reachability Analysis

Counter systems are a well-known and powerful modeling notation for specifying infinite-state systems. In this paper we target the problem of checking liveness properties in counter systems. We propose two semi decision techniques towards this, both of which return a formula that encodes the set of reachable states of the system that satisfy a given liveness property. A novel aspect of our techniques is that they use reachability analysis techniques, which are well studied in the literature, as black boxes, and are hence able to compute precise answers on a much wider class of systems than previous approaches for the same problem. Secondly, they compute their results by iterative expansion or contraction, and hence permit an approximate solution to be obtained at any point. We state the formal properties of our techniques, and also provide experimental results using standard benchmarks to show the usefulness of our approaches. Finally, we sketch an extension of our liveness checking approach to check general CTL properties.

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.