Supramolecular architectures, photophysics, and electroluminescence of 1,3,4-oxadiazole-based iridium(III) complexes: From mu-dichloro bridged dimer to mononuclear complexes

One mu-dichloro bridged diiridium complex and three mononuclear iridium(III) complexes based on the 1,3,4-oxadiazole derivatives as cyclometalated ligands and acetylacetonate (acac) or dithiolates O,O'-diethyldithiophosphate (Et(2)dtp) or N,N'-diethyldithiocarbamate (Et(2)dtc) as ancillary ligands have been synthesized and systematically studied by X-ray diffraction analysis. The results reveal that three mononuclear complexes all adopt distorted octahedral coordination geometry around the iridium center by two chelating ligands with cis-C-C and trans-N-N dispositions, which have the same coordination mode as the diiridium dimer. The dinuclear complex crystallizes in the monoclinic system and space group C2/c, whereas three mononuclear iridium complexes are all triclinic system and space group P(1) over bar. In the stacking structure of the dimer, one-dimensional tape-like chains along the b-axis are formed by hydrogen bondings, which are strengthened by pi stacking interactions between phenyl rings of 1,3,4-oxadiazole ligands. Then these chains assemble a three-dimensional alternating peak and valley fused wave-shape structure. In each stacking structure of three mononuclear complexes, two molecules form a dimer by the C-H center dot center dot center dot O hydrogen bondings, and these dimers are connected by pi stacking interactions along the b-axis, constructing a zigzag chain.

Structure characterization and physical properties of a complex with supramolecular architectures Co-2(2,6-DPC2Co(H2O)5 center dot 2H(2)O (DPC=2,6-pyridinedicarboxylate)

Reaction of 2,6-pyridinedicarboxylic with CoCl2 . 6H(2)O in aqueous solution give rise to a three-dimensional Complex CO2(2,6-DPC)(2)Co(H2O)(5).2H(2)O (DPC = 2,6-pyridinedicarboxylate) 1. It has been characterized by elemental analyses, infrared spectra (IR) spectrum, thermogravimetric (TG) analysis, EPR spectrum, and single crystal X-ray diffraction. The complex crystallizes in the P2(1)/c space group with a = 8.3906(3) Angstrom, b = 27.4005(8) Angstrom, c = 9.6192(4) A, alpha = 90.00degrees, beta = 98.327(2)degrees, gamma = 90.00degrees, V = 2188.20(14) Angstrom(3), Z = 4. There are two types of cobalt environments: Co(1) is coordinated by four oxygen atoms from four carboxyl groups and two nitrogen 2 atoms which are all from pdc(2). Co(2) is coordinated by six oxygen atoms, five from coordinated water molecules and one from a carboxyl of pdc(2) - of which the other oxygen atom is linked to the Co(1). The extensive intermolecular hydrogen bonds are formed in the crystal by means of the five coordinated water molecules.

HIGHLY SENSITIVE AND SELECTIVE DETERMINATION OF RIBOFLAVIN BY FLOW-INJECTION ANALYSIS USING PARALLEL DUAL-CYLINDER MICROELECTRODES

A novel wall-jet cell with parallel dual cylinder (PDC) microelectrodes was constructed and used for flow injection analysis (FLA). The detector takes the advantages of ''redox recycling'' between bipotentiostated microcylinder electrodes (- 0.4 V/SCE an

THEORY OF STEADY-STATE CURRENT AT MULTIPLE MICROCYLINDER ELECTRODES COUPLED WITH A PARALLEL PLANAR ELECTRODE

A novel device of multiple cylinder microelectrodes coupled with a parallel planar electrode was proposed. The feedback diffusion current at this device was studied using bilinear transformation of coordinates in the diffusion space, where lines of mass flux and equiconcentration are represented by orthogonal circular functions. The derived expression for the steady-state current shows that as the gap between cylindrical microelectrodes and planar electrode diminishes, greatly enhanced currents can be obtained with high signal-to-noise ratio. Other important geometrical parameters such as distance between adjacent microcylinders, cylinder radius, and number of microcylinders were also discussed in detail.

DETERMINATION OF THE RATE-CONSTANT OF A CATALYTIC REACTION USING A PARALLEL INCIDENT SPECTROELECTROCHEMICAL CELL

The possibility of determining the rate constant of a catalytic reaction using a parallel incident spectroelectrochemical cell was investigated in this work. Various spectroelectrochemical techniques were examined, including single-potential-step chronoabsorptometry, single-potential-step open-circuit relaxation chronoabsorptometry and double-potential-step chronoabsorptometry. The values determined for the kinetics of the ferrocyanide-ascorbic acid system are in agreement with the reported values. The parallel incident method is much more sensitive than the normal transmission method and can be applied to systems which have smaller molar absorptivities, larger rate constants or lower concentrations.

Parallel Networks for Machine Vision

The amount of computation required to solve many early vision problems is prodigious, and so it has long been thought that systems that operate in a reasonable amount of time will only become feasible when parallel systems become available. Such systems now exist in digital form, but most are large and expensive. These machines constitute an invaluable test-bed for the development of new algorithms, but they can probably not be scaled down rapidly in both physical size and cost, despite continued advances in semiconductor technology and machine architecture. Simple analog networks can perform interesting computations, as has been known for a long time. We have reached the point where it is feasible to experiment with implementation of these ideas in VLSI form, particularly if we focus on networks composed of locally interconnected passive elements, linear amplifiers, and simple nonlinear components. While there have been excursions into the development of ideas in this area since the very beginnings of work on machine vision, much work remains to be done. Progress will depend on careful attention to matching of the capabilities of simple networks to the needs of early vision. Note that this is not at all intended to be anything like a review of the field, but merely a collection of some ideas that seem to be interesting.

Parallel Computation of Vernier Offsets, Curvature and Chevrons in Humans

A vernier offset is detected at once among straight lines, and reaction times are almost independent of the number of simultaneously presented stimuli (distractors), indicating parallel processing of vernier offsets. Reaction times for identifying a vernier offset to one side among verniers offset to the opposite side increase with the number of distractors, indicating serial processing. Even deviations below a photoreceptor diameter can be detected at once. The visual system thus attains positional accuracy below the photoreceptor diameter simultaneously at different positions. I conclude that deviation from straightness, or change of orientation, is detected in parallel over the visual field. Discontinuities or gradients in orientation may represent an elementary feature of vision.

Convergence Results for the EM Approach to Mixtures of Experts Architectures

The Expectation-Maximization (EM) algorithm is an iterative approach to maximum likelihood parameter estimation. Jordan and Jacobs (1993) recently proposed an EM algorithm for the mixture of experts architecture of Jacobs, Jordan, Nowlan and Hinton (1991) and the hierarchical mixture of experts architecture of Jordan and Jacobs (1992). They showed empirically that the EM algorithm for these architectures yields significantly faster convergence than gradient ascent. In the current paper we provide a theoretical analysis of this algorithm. We show that the algorithm can be regarded as a variable metric algorithm with its searching direction having a positive projection on the gradient of the log likelihood. We also analyze the convergence of the algorithm and provide an explicit expression for the convergence rate. In addition, we describe an acceleration technique that yields a significant speedup in simulation experiments.

Parallel Simulation of Subsonic Fluid Dynamics on a Cluster of Workstations

An effective approach of simulating fluid dynamics on a cluster of non- dedicated workstations is presented. The approach uses local interaction algorithms, small communication capacity, and automatic migration of parallel processes from busy hosts to free hosts. The approach is well- suited for simulating subsonic flow problems which involve both hydrodynamics and acoustic waves; for example, the flow of air inside wind musical instruments. Typical simulations achieve $80\\%$ parallel efficiency (speedup/processors) using 20 HP-Apollo workstations. Detailed measurements of the parallel efficiency of 2D and 3D simulations are presented, and a theoretical model of efficiency is developed which fits closely the measurements. Two numerical methods of fluid dynamics are tested: explicit finite differences, and the lattice Boltzmann method.

A Coupled Multi-ALU Processing Node for a Highly Parallel Computer

This report describes Processor Coupling, a mechanism for controlling multiple ALUs on a single integrated circuit to exploit both instruction-level and inter-thread parallelism. A compiler statically schedules individual threads to discover available intra-thread instruction-level parallelism. The runtime scheduling mechanism interleaves threads, exploiting inter-thread parallelism to maintain high ALU utilization. ALUs are assigned to threads on a cycle byscycle basis, and several threads can be active concurrently. Simulation results show that Processor Coupling performs well both on single threaded and multi-threaded applications. The experiments address the effects of memory latencies, function unit latencies, and communication bandwidth between function units.

Reliable Interconnection Networks for Parallel Computers

This technical report describes a new protocol, the Unique Token Protocol, for reliable message communication. This protocol eliminates the need for end-to-end acknowledgments and minimizes the communication effort when no dynamic errors occur. Various properties of end-to-end protocols are presented. The unique token protocol solves the associated problems. It eliminates source buffering by maintaining in the network at least two copies of a message. A token is used to decide if a message was delivered to the destination exactly once. This technical report also presents a possible implementation of the protocol in a worm-hole routed, 3-D mesh network.

A Parallel Crossbar Routing Chip for a Shared Memory Multiprocessor

This thesis describes the design and implementation of an integrated circuit and associated packaging to be used as the building block for the data routing network of a large scale shared memory multiprocessor system. A general purpose multiprocessor depends on high-bandwidth, low-latency communications between computing elements. This thesis describes the design and construction of RN1, a novel self-routing, enhanced crossbar switch as a CMOS VLSI chip. This chip provides the basic building block for a scalable pipelined routing network with byte-wide data channels. A series of RN1 chips can be cascaded with no additional internal network components to form a multistage fault-tolerant routing switch. The chip is designed to operate at clock frequencies up to 100Mhz using Hewlett-Packard's HP34 $1.2\\mu$ process. This aggressive performance goal demands that special attention be paid to optimization of the logic architecture and circuit design.

Design and Evaluation of the Hamal Parallel Computer

Parallel shared-memory machines with hundreds or thousands of processor-memory nodes have been built; in the future we will see machines with millions or even billions of nodes. Associated with such large systems is a new set of design challenges. Many problems must be addressed by an architecture in order for it to be successful; of these, we focus on three in particular. First, a scalable memory system is required. Second, the network messaging protocol must be fault-tolerant. Third, the overheads of thread creation, thread management and synchronization must be extremely low. This thesis presents the complete system design for Hamal, a shared-memory architecture which addresses these concerns and is directly scalable to one million nodes. Virtual memory and distributed objects are implemented in a manner that requires neither inter-node synchronization nor the storage of globally coherent translations at each node. We develop a lightweight fault-tolerant messaging protocol that guarantees message delivery and idempotence across a discarding network. A number of hardware mechanisms provide efficient support for massive multithreading and fine-grained synchronization. Experiments are conducted in simulation, using a trace-driven network simulator to investigate the messaging protocol and a cycle-accurate simulator to evaluate the Hamal architecture. We determine implementation parameters for the messaging protocol which optimize performance. A discarding network is easier to design and can be clocked at a higher rate, and we find that with this protocol its performance can approach that of a non-discarding network. Our simulations of Hamal demonstrate the effectiveness of its thread management and synchronization primitives. In particular, we find register-based synchronization to be an extremely efficient mechanism which can be used to implement a software barrier with a latency of only 523 cycles on a 512 node machine.