Novel reduction (Zn-AcOH) of DDHQ esters - A new route to tropone synthesis

Zn/acetic acid reaction of DDHQ esters 1 a-d gave the saturated acids 3 a-d and the hydrocarbons 7 a-d. The intermediacy of the aldehydes 10 and 11 in the formation of the products has been established. Oxidation of hydrocarbons 7a and 7b gave the corresponding tropones (5a and 5b).

Design and realization of high-performance wave-pipelined 8×8 b multiplier in CMOS technology

Wave pipelining is a design technique for increasing the throughput of a digital circuit or system without introducing pipelining registers between adjacent combinational logic blocks in the circuit/system. However, this requires balancing of the delays along all the paths from the input to the output which comes the way of its implementation. Static CMOS is inherently susceptible to delay variation with input data, and hence, receives a low priority for wave pipelined digital design. On the other hand, ECL and CML, which are amenable to wave pipelining, lack the compactness and low power attributes of CMOS. In this paper we attempt to exploit wave pipelining in CMOS technology. We use a single generic building block in Normal Process Complementary Pass Transistor Logic (NPCPL), modeled after CPL, to achieve equal delay along all the propagation paths in the logic structure. An 8×8 b multiplier is designed using this logic in a 0.8 ?m technology. The carry-save multiplier architecture is modified suitably to support wave pipelining, viz., the logic depth of all the paths are made identical. The 1 mm×0.6 mm multiplier core supports a throughput of 400 MHz and dissipates a total power of 0.6 W. We develop simple enhancements to the NPCPL building blocks that allow the multiplier to sustain throughputs in excess of 600 MHz. The methodology can be extended to introduce wave pipelining in other circuits as well

Reduction of DDHQ and TCC esters by NaBH4-its specificity in the presence of Alkyl/Aryl esters

DDHQ/TCC esters 3a–f, 7a–g were prepared either by oxidation of spiroketones 1 with DDQ/Image -chloranil or by condensation of acid chloride with DDHQ/TCC. NaBH4 reduction of unsaturated DDHQ 3a–b and TCC 7a–c esters gave the corresponding allylic alcohols in good yield without any observable 1,4-addition products. Reduction of saturated esters 3e, 7d, gave the corresponding alcohols. Alkyl esters 5 and 6, methyl benzoate and phenyl benzoate remained unaffected under these reduction conditions. In the reduction of compound 7e containing both alkyl and TCC esters, TCC ester is selectively reduced. Reduction of TCC mono esters 7f–g gave the lactones. The observed facile reduction has been rationalised.

The effect of traffic shaping in efficiently providing end-to-end performance guarantees

This paper reports new results concerning the capabilities of a family of service disciplines aimed at providing per-connection end-to-end delay (and throughput) guarantees in high-speed networks. This family consists of the class of rate-controlled service disciplines, in which traffic from a connection is reshaped to conform to specific traffic characteristics, at every hop on its path. When used together with a scheduling policy at each node, this reshaping enables the network to provide end-to-end delay guarantees to individual connections. The main advantages of this family of service disciplines are their implementation simplicity and flexibility. On the other hand, because the delay guarantees provided are based on summing worst case delays at each node, it has also been argued that the resulting bounds are very conservative which may more than offset the benefits. In particular, other service disciplines such as those based on Fair Queueing or Generalized Processor Sharing (GPS), have been shown to provide much tighter delay bounds. As a result, these disciplines, although more complex from an implementation point-of-view, have been considered for the purpose of providing end-to-end guarantees in high-speed networks. In this paper, we show that through ''proper'' selection of the reshaping to which we subject the traffic of a connection, the penalty incurred by computing end-to-end delay bounds based on worst cases at each node can be alleviated. Specifically, we show how rate-controlled service disciplines can be designed to outperform the Rate Proportional Processor Sharing (RPPS) service discipline. Based on these findings, we believe that rate-controlled service disciplines provide a very powerful and practical solution to the problem of providing end-to-end guarantees in high-speed networks.

Queuing strategies for qos management of traffic between lans interconnected by low-speed wan links

We provide a comparative performance evaluation of packet queuing and link admission strategies for low-speed wide area network Links (e.g. 9600 bps, 64 kbps) that interconnect relatively highspeed, connectionless local area networks (e.g. 10 Mbps). In particular, we are concerned with the problem of providing differential quality of service to interLAN remote terminal and file transfer sessions, and throughput fairness between interLAN file transfer sessions. We use analytical and simulation models to study a variety of strategies. Our work also serves to address the performance comparison of connectionless vs. connection-oriented interconnection of CLNS LANS. When provision of priority at the physical transmission level is not feasible, we show, for low-speed WAN links (e.g. 9600 bps), the superiority of connection-oriented interconnection of connectionless LANs, with segregation of traffic streams with different QoS requirements into different window flow controlled connections. Such an implementation can easily be obtained by transporting IP packets over an X.25 WAN. For 64 kbps WAN links, there is a drop in file transfer throughputs, owing to connection overheads, but the other advantages are retained, The same solution also helps to provide throughput fairness between interLAN file transfer sessions. We also provide a corroboration of some of our modelling results with results from an experimental test-bed.

Activities in the spinel solid solution FeXMg1−XAl2O4

Abstract: Activities in the spinel solid solution FexMg1-xAl2O4 saturated with alpha-Al2O3 have been measured for the compositional range 0 < X < 1 between 1100 and 1350 K using a bielectrolyte solid-state galvanic cell, which may be represented as Pt, Fe + FexMg1-xAl2O4 + alpha-Al2O3//(Y2O3)ThO2/ (CaO)ZrO2//Fe + FeAl2O4 + alpha-Al2O3, Pt Activities of ferrous and magnesium aluminates exhibit small negative deviations from Raoult's law. The excess free energy of mixing of the solid solution is a symmetric function of composition and is independent of temperature: Delta G(E) = -1990 X(1 - X J/mol. Theoretical analysis of cation distribution in spinel solid solution also suggests mild negative deviations from ideality. The lattice parameter varies linearly with composition in samples quenched from 1300 K. Phase relations in the FeO-MgO-Al2O3 system at 1300 K are deduced from the results of this study and auxiliary thermodynamic data from the literature. The calculation demonstrates the influence of intracrystalline ion exchange equilibrium between nonequivalent crystallographic sites in the spinel structure on intercrystalline ion exchange equilibrium between the monoxide and spinel solid solutions (tie-lines). The composition dependence of oxygen partial pressure at 1300 K is evaluated for three-phase equilibria involving the solid solutions Fe + FexMg1-xAl2O4 + alpha-Al2O3 and Fe + FeyMg1-yO + FexMg1-xAl2O4. Dependence of X, denoting the composition of the spinel solid solution, on parameter Y, characterizing the composition of the monoxide solid solution with rock salt structure, in phase fields involving the two solid solutions is elucidated. The tie-lines are slightly skewed toward the MgAl2O4 corner.

Link failure detection for maintaining session continuity in packet data networks

A link failure in the path of a virtual circuit in a packet data network will lead to premature disconnection of the circuit by the end-points. A soft failure will result in degraded throughput over the virtual circuit. If these failures can be detected quickly and reliably, then appropriate rerouteing strategies can automatically reroute the virtual circuits that use the failed facility. In this paper, we develop a methodology for analysing and designing failure detection schemes for digital facilities. Based on errored second data, we develop a Markov model for the error and failure behaviour of a T1 trunk. The performance of a detection scheme is characterized by its false alarm probability and the detection delay. Using the Markov model, we analyse the performance of detection schemes that use physical layer or link layer information. The schemes basically rely upon detecting the occurrence of severely errored seconds (SESs). A failure is declared when a counter, that is driven by the occurrence of SESs, reaches a certain threshold.For hard failures, the design problem reduces to a proper choice;of the threshold at which failure is declared, and on the connection reattempt parameters of the virtual circuit end-point session recovery procedures. For soft failures, the performance of a detection scheme depends, in addition, on how long and how frequent the error bursts are in a given failure mode. We also propose and analyse a novel Level 2 detection scheme that relies only upon anomalies observable at Level 2, i.e. CRC failures and idle-fill flag errors. Our results suggest that Level 2 schemes that perform as well as Level 1 schemes are possible.

Reduction of electric are furnace slags in stainless steelmaking - Part 1 Observations

Simultaneous reduction of iron and chromium oxides from synthetic electric are furnace stainless steelmaking slag in a graphite crucible has been studied. Above the melting point of iron the reduction of iron oxide leads to a carbon saturated Fe-C melt, but below the melting point of iron initially solid iron or iron carbide forms on the crucible surface. Only when a certain number of Fe-C droplets are formed does the reduction of chromium oxide start to form an Fe-Cr-C alloy. The reaction proceeds with pronounced foaming which depends on the basicity, temperature, and iron oxide content of the slag. IS/1352a (C) 1998 The Institute of Materials.

Mixed convection in non-Newtonian fluids along a horizontal plate in a porous medium

The problem of mixed convection from horizontal surfaces in a porous medium saturated with a power-law-type non-Newtonian fluid is investigated. The transformed conservation laws are solved numerically for the case of variable wall hear pur conditions. Results for the details of the velocity and temperature fields as well as the Nusselt number have been presented. The viscosity index ranged from 0.5-1.5.

The log delta log t method for the determination of the coefficient of consolidation

The behaviour of saturated soils undergoing consolidation is very complex, It may not follow Terzaghi's theory over the entire consolidation process, Different soils may behave in such a way as to fit into Terzaghi's theory over some specific stages of the consolidation process (percentage of consolidation), This may be one of the reasons for the difficulties faced by the existing curve-fitting procedures in obtaining the coefficient of consolidation, c(v). It has been shown that the slope of the initial linear portion of the theoretical log U-log T curve is constant over a wider range of degree of consolidation, U, when compared with the other methods in use, This initial well-defined straight line in the log U-log T plot intersects the U = 100% line at T = pi/4, which corresponds to U = 88.3%, The proposed log delta-log t method is based on this observation, which gives the value of c(v) through simple graphical construction, In the proposed method, which is more versatile, identification of the characteristic straight lines is very clear; the intersection of these lines is more precise and the method does not depend upon the initial compression for the determination of c(v).

Low-power pipelined LMS adaptive filter architectures with minimal adaptation delay

The use of delayed coefficient adaptation in the least mean square (LMS) algorithm has enabled the design of pipelined architectures for real-time transversal adaptive filtering. However, the convergence speed of this delayed LMS (DLMS) algorithm, when compared with that of the standard LMS algorithm, is degraded and worsens with increase in the adaptation delay. Existing pipelined DLMS architectures have large adaptation delay and hence degraded convergence speed. We in this paper, first present a pipelined DLMS architecture with minimal adaptation delay for any given sampling rate. The architecture is synthesized by using a number of function preserving transformations on the signal flow graph representation of the DLMS algorithm. With the use of carry-save arithmetic, the pipelined architecture can support high sampling rates, limited only by the delay of a full adder and a 2-to-1 multiplexer. In the second part of this paper, we extend the synthesis methodology described in the first part, to synthesize pipelined DLMS architectures whose power dissipation meets a specified budget. This low-power architecture exploits the parallelism in the DLMS algorithm to meet the required computational throughput. The architecture exhibits a novel tradeoff between algorithmic performance (convergence speed) and power dissipation. (C) 1999 Elsevier Science B.V. All rights resented.

Providing quality of service via opportunistic splitting using stochastic approximation

We consider the problem of wireless channel allocation to multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. Each metric sequence can be Markov. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Relay Load Balancing in Queued Cooperative Wireless Networks with Rateless Codes

Relay selection combined with buffering of packets of relays can substantially increase the throughput of a cooperative network that uses rateless codes. However, buffering also increases the end-to-end delays due to the additional queuing delays at the relay nodes. In this paper we propose a novel method that exploits a unique property of rateless codes that enables a receiver to decode a packet from non-contiguous and unordered portions of the received signal. In it, each relay, depending on its queue length, ignores its received coded bits with a given probability. We show that this substantially reduces the end-to-end delays while retaining almost all of the throughput gain achieved by buffering. In effect, the method increases the odds that the packet is first decoded by a relay with a smaller queue. Thus, the queuing load is balanced across the relays and traded off with transmission times. We derive explicit necessary and sufficient conditions for the stability of this system when the various channels undergo fading. Despite encountering analytically intractable G/GI/1 queues in our system, we also gain insights about the method by analyzing a similar system with a simpler model for the relay-to-destination transmission times.

Implications of the half-duplex constraint on relay-aided cooperation using rateless codes

The half-duplex constraint, which mandates that a cooperative relay cannot transmit and receive simultaneously, considerably simplifies the demands made on the hardware and signal processing capabilities of a relay. However, the very inability of a relay to transmit and receive simultaneously leads to a potential under-utilization of time and bandwidth resources available to the system. We analyze the impact of the half-duplex constraint on the throughput of a cooperative relay system that uses rateless codes to harness spatial diversity and efficiently transmit information from a source to a destination. We derive closed-form expressions for the throughput of the system, and show that as the number of relays increases, the throughput approaches that of a system that uses more sophisticated full-duplex nodes. Thus, half-duplex nodes are well suited for cooperation using rateless codes despite the simplicity of both the cooperation protocol and the relays.

Experimental validation of analytical performance models for IEEE 802.11 networks

We consider the simplest IEEE 802.11 WLAN networks for which analytical models are available and seek to provide an experimental validation of these models. Our experiments include the following cases: (i) two nodes with saturated queues, sending fixed-length UDP packets to each other, and (ii) a TCP-controlled transfer between two nodes. Our experiments are based entirely on Aruba AP-70 access points operating under Linux. We report our observations on certain non-standard behavior of the devices. In cases where the devices adhere to the standards, we find that the results from the analytical models estimate the experimental data with a mean error of 3-5%.