Fast Parallel Reordering and Isomorphism Testing of k -Trees

In this paper two problems on the class of k -trees, a subclass of the class of chordal graphs, are considered: the fast reordering problem and the isomorphism problem. An O(log ² n) time parallel algorithm for the fast reordering problem is described that uses O(nk(n-k)/\kern -1ptlog n) processors on a CRCW PRAM proving membership in the class NC for fixed k . An O(nk(k+1)!) time sequential algorithm for the isomorphism problem is obtained representing an improvement over the O(n ² k(k+1)!) algorithm of Sekharan (the second author) [10]. A parallel version of this sequential algorithm is presented that runs in O(log ² n) time using O((nk((k+1)!+n-k))/log n) processors improving on a parallel algorithm of Sekharan for the isomorphism problem [10]. Both the sequential and parallel algorithms use a concept introduced in this paper called the kernel of a k -tree.     

Observation of calcium aluminate inclusions at interfaces between Ca-treated,Al-killed steels and slags

The evolution of Al₂O₃-CaO inclusions on molten steel surfaces and at molten steel/slag interfaces was observed in-situ through a confocal scanning laser microscope (CSLM) equipped with a gold-image furnace. Depending on the slag chemistry, some of the initially liquid inclusions evolved into irregular Al₂O₃ or SiO₂-enriched inclusions during the separation across the interface. Inclusions were found to cluster at specific locations at the steel/slag interface. Unlike capillary-depression-driven clustering, which is observed on molten steel surfaces, a weak repulsive force opposes fluid-flow-driven clustering at the steel/slag interface. After clustering, the irregular solid inclusions were observed to agglomerate to form large aggregates. This article is based on a presentation given in the Mills Symposium entitled “Metals, Slags, Glasses: High Temperature Properties & Phenomena,” which took place at The Institute of Materials in London, England, on August 22–23, 2002.     

A 4.5-GHz 130-nm 32-KB L0 cache with a leakage-tolerant self reverse-bias bitline scheme

This paper describes a 32-KB two-read, one-write ported L0 cache for 4.5-GHz operation in 1.2-V 130-nm dual-V/sub TH/ CMOS technology. The local bitline uses a leakage-tolerant self reverse-bias (SRB) scheme with nMOS source-follower pullup access transistors, while preserving robust full-swing operation. Gate-source underdrive of -220 mV on the bitline read-select transistors is established without external bias voltages or gate-oxide overstress. Device-level measurements in the 130-nm technology show 72/spl times/ bitline active leakage reduction, enabling low-V/sub TH/ usage, 40% bitline keeper downsizing, and 16 bitcells/bitline. 11% faster read delay and 2/spl times/ higher dc noise robustness are achieved compared with high-performance dual-V/sub TH/ bitline scheme. Sustained performance and robustness benefits of the SRB technique against conventional dynamic bitline with scaling to 100- and 70-nm technology is also presented.     

Topology design and bridge-capacity assignment for interconnecting token ring LANs: A simulated annealing approach

We address the problem of determining the topology and bridge-capacity assignments for a network connecting a number of token rings via source-routing bridges. The objective is to minimize the cost of bridge installations while meeting the network users' performance requirements. The problem is modeled as a mixed 0–1 integer program. A comparison is given between two solution algorithms: a simulated annealing algorithm using the flow-deviation algorithm for each routing subproblem, and a drop algorithm using the simplex method for the same subproblems to provide benchmark solutions. In the former algorithm, the routing subproblem is formulated as a nonlinear program with penalty functions to model node and link capacity constraints, and in the latter as a multicommodity flow model with the same capacity constraints. Computational results show that the simulated-annealing/flow-deviation algorithm produced substantially better solutions than the LP-based drop algorithm.     

Vision-based obstacle detection for rotorcraft flight

The ability of rotorcraft to fly at low altitude is hindered by the high pilot workload required to avoid obstacles. The development of automation tools that can detect obstacles in the rotorcraft flight path, warn the crew, and interact with the guidance system to avoid detected obstacles would significantly reduce pilot workload and increase safety. This article describes an obstacle detection approach based on feature tracking and recursive range estimation that takes into account the characteristics of rotorcraft flight. The merits and weaknesses of the approach are discussed using image sequences from the laboratory and from flight. © 1992 John Wiley & Sons, Inc.     

Theoretical Investigation of Metal Cladding for Nanowire and Cylindrical Micropost Lasers

We investigate the transverse modal properties of cylindrical subwavelength metal-clad nanowire and micropost lasers via rigorous theoretical waveguide analysis, including the effects of finite thickness metal cladding and gain in the core. The results of this analysis show that air-metal surface guided TM₀₁ and some hybrid surface guided modes suffer less loss but are less confined to the core, while core-metal surface guided modes are better confined to the core but suffer greater loss. An increase in the thickness of the metal cladding reduces the loss of the core-metal surface guided modes. The modal gain and confinement of the metal-clad cavity are compared to an unclad cavity.     

Recent Advances in Hierarchical Reinforcement Learning

Reinforcement learning is bedeviled by the curse of dimensionality: the number of parameters to be learned grows exponentially with the size of any compact encoding of a state. Recent attempts to combat the curse of dimensionality have turned to principled ways of exploiting temporal abstraction, where decisions are not required at each step, but rather invoke the execution of temporally-extended activities which follow their own policies until termination. This leads naturally to hierarchical control architectures and associated learning algorithms. We review several approaches to temporal abstraction and hierarchical organization that machine learning researchers have recently developed. Common to these approaches is a reliance on the theory of semi-Markov decision processes, which we emphasize in our review. We then discuss extensions of these ideas to concurrent activities, multiagent coordination, and hierarchical memory for addressing partial observability. Concluding remarks address open challenges facing the further development of reinforcement learning in a hierarchical setting.     

The liquidus surface and tie-lines in the iron-cobalt-sulfur system between 1473 and 1623 K

The liquidus surface and tie-lines in the iron-cobalt-sulfur ternary system have been determined between 1473 and 1623 K. The experiments were conducted by equilibrating the liquid sulfide phase with the metallic alloy phase. The liquid sulfide phase was sampled and chemically analyzed. The alloy phase was analyzed by electron microprobe. Combining the present results with the available literature data, the thermodynamic properties of this system were calculated.