A Primitive Non-symmetric 3-Class Association Scheme on 36 Elements with p11 = 0 Exists and is Unique

In this paper we construct a primitive, non-symmetric 3-class association scheme with parameters v = 36, v₁ = 7, p¹₁₁ = 0 and p²₁₁ = 4 and show that such a scheme is determined by its parameters.     

Expression of theSU(2) rotation matrices D( j ) in terms of normalized irreducible tensorial matrices

TheSU(2) rotation matricesD ^(j), specified in terms of axis and angle of rotation, are expressed as linear combination of normalized irreducible tensorial matricces (NITM) of rankl = 0 to 2j rotated to the polar angles of the axis. The rotated NITM are constructed from spherical harmonics of the same rank. Since this formulation requires no matrix products, it may be computationally more efficient than Euler angle formulas, particularly for largej. Rotated NITM and formulas for theD ^(j) withj = 1/2 andj = 1 are written out explicitly. A formula for the structure constants of the products of conformable NITM is also given in terms of 3-j and 6-j symbols.     

Silver nitrate-acetonitrile and iodine-benzene complexes as studied by NMR in thermotropic liquid crystals

Silver nitrate-acetonitrile and π iodine-benzene complexes in thermotropic liquid crystals have been studied by ¹H, ²H, and ¹³C NMR spectroscopy and by optical microscopy. Evidence for at least two silver complexes in each liquid crystal is presented.     

Cost Effective VLSI Architectures for Full-Search Block-Matching Motion Estimation Algorithm

In this paper, we present efficient VLSI architectures for full-search block-matching motion estimation (BMME) algorithm. Given a search range, we partition it into sub-search arrays called tiles. By fully exploiting data dependency within a tile, efficient VLSI architectures can be obtained. Using the proposed VLSI architectures, all the block-matchings in a tile can be processed in parallel. All the tiles within a search range can be processed serially or concurrently depending on various requirements. With the consideration of processing speed, hardware cost, and I/O bandwidth, the optimal tile size for a specific video application is analyzed. By partitioning a search range into tiles with appropriate size, flexible VLSI designs with different throughput can be obtained. In this way, cost effective VLSI designs for a wide range of video applications, from H.261 to HDTV, can be achieved.     

The effect of bandwidth allocation policies on delay inunidirectional bus networks

We consider the problem of allocating bandwidth fairly to each node in a shared, unidirectional bus network. We focus on the p_i persistent protocol, since these are open loop policies designed to operate well in high speed networks, which have a very large bandwidth-delay product and feedback in the upstream direction is not available in a timely manner. First, we introduce an improvement to the basic p_i persistent protocol, in which we replace random coin tosses with a deterministic counting algorithm, and thereby reduce the delays for all nodes for any given choice of {p_i}. We then describe an exact method for calculating average packet delays and queue lengths in both the p_i persistent and our new deterministic n out of m protocols, based on the regenerative approach of Georgiades et al. (1987). These delay results, together with simulation measurements, show that both of these protocols still waste some bandwidth. After presenting a lower bounding argument to show that some wasted bandwidth is inevitable in all such distributed access control schemes, assuming a passive bus without feedback in the upstream direction, we show that changing the bus to unidirectional point-to-point links between (very simple) active interfaces at each node allows us to construct distributed access schemes that require no upstream feedback and are both work conserving and fair. To illustrate how this can be done, we introduce the p_i preemptive protocol, in which each node randomly inserts its own packets into the traffic arriving from upstream. We derive a simple and effective heuristic for calculating the preemption probability for each node, and use simulation to show how well it equalizes the delays at each node     

Image coding by multistep, adaptive flux interpolation

The authors describe and discuss the new technique, multistep adaptive flux interpolation (MAFI), and its application to image data for coding. When applied to an image, MAFI produces an output which is also in an image form, but which has a more uniform feature density and a greatly reduced size. MAFI warps the input image by removing those rows and columns which contain a majority of redundant pixels. The side information required for reconstruction is minimal, and the image can be further compressed using conventional coders, making the compression ratio even higher. Because of its warped nature, the MAFI output's statistics are also more consistent with the properties assumed by block-based discrete cosine transform (DCT) methods     

The star chromatic number of a graph

We study a generalization of the notion of the chromatic number of a graph in which the colors assigned to adjacent vertices are required to be, in a certain sense, far apart. © 1993 John Wiley & Sons, Inc.     

Addressing substrate coupling in mixed-mode ICs: simulation andpower distribution synthesis

This paper describes new techniques for the simulation and power distribution synthesis of mixed analog/digital integrated circuits considering the parasitic coupling of noise through the common substrate. By spatially discretizing a simplified form of Maxwell's equations, a three-dimensional linear mesh model of the substrate is developed. For simulation, a macromodel of the fine substrate mesh is formulated and a modified version of SPICE3 is used to simulate the electrical circuit coupled with the macromodel. For synthesis, a coarse substrate mesh, and interconnect models are used to couple linear macromodels of circuit functional blocks. Asymptotic Waveform Evaluation (AWE) is used to evaluate the electrical behavior of the network at every iteration in the synthesis process. Macromodel simulations are significantly faster than device level simulations and compare accurately to measured results. Synthesis results demonstrate the critical need to constrain substrate noise and simultaneously optimize power bus geometry and pad assignment to meet performance targets     

Microsomal and photochemical oxidation of aflatoxin B1

The UV irradiation (lambda = 362 nm) of aflatoxin B1 (AfB1) dissolved in water resulted in the formation of an oxidized product. The process was not inhibited by ionol, a routine inhibitor of the radical processes. The oxidized product was not found in the system where AfB1 was metabolized by the 3-methylcholanthrene-activated rat liver microsomes. It is suggested that the product is identical with 2,3-dihydrodiol of AfB1.