Ultralow-voltage boron-doped diamond field emitter vacuum diode

A boron-doped diamond field emitter diode with ultralow turn-on voltage and high emission current is reported. The diamond field emitter diode structure with a built-in cap was fabricated using molds and electrostatic bonding techniques. The emission current versus anode voltage of the capped diamond emitter diode with boron doping, sp² content, and vacuum thermal electric (VTE) treatment shows a very low turn-on voltage of 2 V. A high emission current of 1 μA at an anode voltage of less than 10 V can be obtained from a single diamond tip. The turn-on voltage is significantly lower than comparable silicon field emitters     

Evaluation of multicast routing algorithms for real-timecommunication on high-speed networks

Multicast (MC) routing algorithms capable of satisfying the quality of service (QoS) requirements of real-time applications will be essential for future high-speed networks. We compare the performance of all of the important MC routing algorithms when applied to networks with asymmetric link loads. Each algorithm is judged based on the quality of the MC trees it generates and its efficiency in managing the network resources. Simulation results over random networks show that unconstrained algorithms are not capable of fulfilling the QoS requirements of real-time applications in wide-area networks. Simulations also reveal that one of the unconstrained algorithms, reverse path multicasting (RPM), is quite inefficient when applied to asymmetric networks. We study how combining routing with resource reservation and admission control improves the RPM's efficiency in managing the network resources. The performance of one semiconstrained heuristic, MSC, three constrained Steiner tree (CST) heuristics, Kompella, Pasquale, and Polyzos (1992), constrained adaptive ordering (CAO), and bounded shortest multicast algorithm (BSMA), and one constrained shortest path tree (CSPT) heuristic, the constrained Dijkstra heuristic (CDKS) are also studied. Simulations show that the semiconstrained and constrained heuristics are capable of successfully constructing MC trees which satisfy the QoS requirements of real-time traffic. However, the cost performance of the heuristics varies. The BSMA's MC trees are lower in cost than all other constrained heuristics. Finally, we compare the execution times of all algorithms, unconstrained, semiconstrained, and constrained     

Selective catalytic reduction of NOx by hydrocarbons on Pt/Al2O3 catalysts at low temperatures without the formation of N2O

The selective reduction of nitrogen oxides by hydrocarbons on a Pt catalyst has been investigated. Some variations are observed between different reductants. However, the most significant result is the observation that no N₂O is observed as a by-product when toluene is used as a reductant.     

An empirical study of information technology enabled business process redesign and corporate competitive strategy

Business process redesign (BPR) has been widely touted as a means for leveraging the power of information technology to change business processes radically, resulting in substantial improvements in organizational effectiveness and efficiency. This study represents an early attempt at examining the strategic nature of the phenomenon. Because BPR is radical change and has the ability to alter both the competitive and operational nature of the corporation, it is critical that BPR be coordinated with corporate strategy. Through a survey of information system executives, the relationships between corporate competitive strategy and three types of BPR – intrafunctional, interfunctional and interorganizational – were examined. It was found that organizations following a cost strategy tended to do more BPR projects on interfunctional processes. Furthermore, the positive effect of a cost strategy on interfunctional BPR was found to be strengthened by the degree of integration of IS and business planning. It was also found that while interorganizational BPR was not related to a specific strategy, it was strongly related directly with IS–business planning integration.     

ON THE USE OF BUFFER INVENTORIES TO MINIMIZE COSTS WITH AN UNRELIABLE MACHINE

In this paper, we discuss the problem of quality control with an unreliable machine which produces defects at a rate of Λ₀, per unit when in-control and a rate of Lambda; ₁, when out-of-control (where Λ₁ Λ ₀). Every h time periods, we sample n units, count the number of defects, and (using a process based on a Shewart c-chart) test the hypothesis that the machine is in control by comparing the total number of defects to an upper control limit (UCL). More important, we introduce the concept that a buffer inventory which immediately follows the unreliable machine may reduce expected total costs. This buffer serves to delay the movement of items from the unreliable machine to the next stage of the production process. In this way, we can isolate and repair most defective items before they are embedded in a product downstream or sold to customers where repair is more costly. To search for the optimal control policy, we find bounds for n, h, and UCL; given values for these variables, we show how the optimal buffer size can be determined directly. Numerical results illustrate the magnitude of potential savings.     

Structural allograft in two-stage revisions for failed septic hip arthroplasty

We report 11 patients having revision of total hip arthroplasty using massive structural allografts for failure due to sepsis and associated bone loss. All patients had a two-stage reconstruction and the mean follow-up was 47.8 months (24 to 72). Positive cultures were obtained at the first stage in nine of the 11 patients, with Staphylococcus epidermidis being the most common organism. The other two patients had draining sinuses with negative cultures. There was no recurrence of infection in any patient. The mean increase in the modified Harris hip score was 45 and all the grafts appeared to have united to host bone. Two patients required additional procedures, but only one was related to the allograft. Complications included an incomplete sciatic nerve palsy and one case of graft resorption. Our results support the use of massive allografts in failed septic hip arthroplasty in which there is associated bone loss.     

Efficacy and pharmacokinetics of gallopamil in patients with coronary artery disease

We prospectively studied 10 patients with stable exertional ischaemia, selected from a larger group of patients referred for suspected coronary artery disease or to detect residual ischaemia after myocardial infarction, to evaluate pharmacokinetic changes during chronic treatment with gallopamil and its correlation with clinical efficacy in patients with coronary artery disease. Our study consisted of a 1-week run-in single-blind placebo treatment and a 4-week single-blind gallopamil treatment. At the end of the run-in period patients underwent two different exercise tests, the first 2 hours and the second 7 hours after placebo administration. During active treatment all patients underwent two different exercise tests, the first 2 hours and the second 7 hours after gallopamil (50 mg) administration on the 1st and 28th days of gallopamil therapy. On the same days in eight of the patients we evaluated gallopamil pharmacokinetic changes. Our data revealed a rapid increase of unchanged gallopamil and its metabolite (norgallopamil) in the plasma, and a peak concentration of these substances about 2 hour after oral administration on both the 1st and 28th day of observation. Moreover, our results demonstrated an increase between the first and 28th day of treatment in peak concentration of unchanged gallopamil in the plasma, and of AUC 0-infinity and AUC o-c values during chronic treatment with gallopamil. Our clinical data showed an improvement in exercise results during gallopamil therapy related to increased concentration of the drug.     

Parallel, self-organizing, hierarchical neural networks. II

For pt.I see IEEE Trans. Neural Networks, vol.1, p.167-78 (1990). Parallel, self-organizing, hierarchical neural networks (PSHNNs) involve a number of stages with error detection at the end of each stage, i.e., rejection of error-causing vectors, which are then fed into the next stage after a nonlinear transformation. The stages operate in parallel during testing. Statistical properties and the mechanisms of vector rejection of the PSHNN are discussed in comparison to the maximum likelihood method and the backpropagation network. The PSHNN is highly fault tolerant and robust against errors in the weight values due to the adjustment of the error detection bounds to compensate errors in the weight values. These properties are exploited to develop architectures for programmable implementations in which the programmable parts are reduced to on-off or bipolar switching operations for bulk computations and attenuators for pointwise operations