Synthesis, characterization, and thermal degradation studies on group VIA derived weak-link polymers

Polymers containing group VIA derived weak links, viz. poly(styrene disulfide) (PSD), poly- (styrene tetrasulfide) (PST), and poly(styrene diselenide) (PSDSE), have been synthesized. The polymers PSD and PST were characterized by NMR, IR, UV, TGA, and fast atom bombardment m w spectrometric (FABMS) techniques. The presence of different configurational sequences in PSD and PST were identified by *3C NMR spectroscopy. PSDSE, being insoluble in common organic solvents, was characterized using solid-state lac NMR (CP-MAS) spectroscopy. Thermal degradation of polymers under direct pyrolysis-mass spectrometric (DP-MS) conditions revealed that all the polymers undergo degradation through the weaklink scission. A comparative study of the pyrolysis products of these polymers with that of poly(styrene peroxide) (PSP) revealed a smooth transformation down the group with no monomer (styrene or oxygen) formation in PSP to only styrene and selenium metal in PSDSE. This trend of group VIA is explained from the energetics of the C-X bond (X = 0, S, and Se) which also seems to be important in addition to the weak X-X bond cleavage. In PSP and PSD, the behavior is also explained from the energetics of the alkoxy and thiyl radicals. The unique exothermic degradation in PSP compared to endothermic degradation in PSD and PSDSE is explained from the nature of the producta of degradation.

Past Queue Length Based Low-Overhead Link Scheduling in Multi-beam Wireless Mesh Networks

Wireless mesh networks with multi-beam capability at each node through the use of multi-antenna beamforming are becoming practical and attracting increased research attention. Increased capacity due to spatial reuse and increased transmission range are potential benefits in using multiple directional beams in each node. In this paper, we are interested in low-complexity scheduling algorithms in such multi-beam wireless networks. In particular, we present a scheduling algorithm based on queue length information of the past slots in multi-beam networks, and prove its stability. We present a distributed implementation of this proposed algorithm. Numerical results show that significant improvement in delay performance is achieved using the proposed multi-beam scheduling compared to omni-beam scheduling. In addition, the proposed algorithm is shown to achieve a significant reduction in the signaling overhead compared to a current slot queue length approach.

Link Conditions for Simplifying Meshes with Embedded Structures

Interactive visualization applications benefit from simplification techniques that generate good-quality coarse meshes from high-resolution meshes that represent the domain. These meshes often contain interesting substructures, called embedded structures, and it is desirable to preserve the topology of the embedded structures during simplification, in addition to preserving the topology of the domain. This paper describes a proof that link conditions, proposed earlier, are sufficient to ensure that edge contractions preserve the topology of the embedded structures and the domain. Excluding two specific configurations, the link conditions are also shown to be necessary for topology preservation. Repeated application of edge contraction on an extended complex produces a coarser representation of the domain and the embedded structures. An extension of the quadric error metric is used to schedule edge contractions, resulting in a good-quality coarse mesh that closely approximates the input domain and the embedded structures.

Synthesis of path generating flexible-link mechanisms

Flexible-link mechanisms are those linkage mechanisms (or structures) which are capable of motion by virtue of elastic deformation of one or more;links. In such mechanisms a single flexible link; can replace several rigid links and joints resulting in fewer links, fewer pin joints, reduced overall weight and reduced mechanical error. In spite of such clear advantages, contributions toward flexible-link mechanisms remain very scarce. The area of flexible-link mechanisms offers much scope for further exploration. This paper attempts to show the potential of flexible-link mechanisms in accomplishing a kinematic task like path generation. Synthesis of a four-bar mechanism with a flexible rocker for circular and straight line path generation is carried out. Displacement analysis of the structure is carried out using finite element method (FEM) and synthesis is formulated and solved as an optimization problem. Several numerical examples are presented for illustration. Based on the results obtained with these examples, the flexible-link mechanism considered shows good promise for-path generation.

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.

Analysis, Design, Modeling, and Implementation of an Active Clamp HF Link Converter

This paper deals with the system oriented analysis, design, modeling, and implementation of active clamp HF link three phase converter. The main advantage of the topology is reduced size, weight, and cost of the isolation transformer. However, violation of basic power conversion rules due to presence of the leakage inductance in the HF transformer causes over voltage stresses across the cycloconverter devices. It makes use of the snubber circuit necessary in such topologies. The conventional RCD snubbers are dissipative in nature and hence inefficient. The efficiency of the system is greatly improved by using regenerative snubber or active clamp circuit. It consists of an active switching device with an anti-parallel diode and one capacitor to absorb the energy stored in the leakage inductance of the isolation transformer and to regenerate the same without affecting circuit performance. The turn on instant and duration of the active device are selected such that it requires simple commutation requirements. The time domain expressions for circuit dynamics, design criteria of the snubber capacitor with two conflicting constrains (over voltage stress across the devices and the resonating current duration), the simulation results based on generalized circuit model and the experimental results based on laboratory prototype are presented.

Studies on the variations in compression strengths of graphite powders bearing glass-epoxy composites exposed to humid conditions

The moisture absorption and changes in compression strengths in glass-epoxy (G-E composites without and with discrete quantities of graphite powders introduced into the resin mix prior to its spreading on specific glass fabric (layers) during the lay-up (stacking) sequence forms the subject matter of this report. The results point to higher moisture absorption for graphite bearing specimens. The strengths of graphite-free coupons show a continuous decrease, while the filler bearing ones show an initial rise followed by a drop for larger exposure times. Scanning Fractographic features were examined for an understanding of the process. The observations were explained invoking the effect of matrix plasticizing and the role of interfacial regions.

Neighbor oblivious link reversal over duty-cycled WSNs

We propose partial and full link reversal algorithms to bypass voids during geographic routing over duty-cycled wireless sensor networks. We propose a distributed approach that is oblivious to one-hop neighbor information. Upon termination of the algorithm, the resulting network is guaranteed to be destination-oriented. Further, to reduce the delays incurred under reactive link reversal, we propose the use of `pseudo-events', a preemptive link reversal strategy, that renders the network destination-oriented before the onset of a real event. A simulation study of the effectiveness of pseudo-events is also provided.

Analysis of link-layer backoff schemes on point-to-point Markov fading links

Backoff algorithms are typically employed in multiple-access networks (e.g., Ethernet) to recover from packet collisions. In this letter, we propose and carry out the analysis for three types of link-layer backoff schemes, namely, linear backoff, exponential backoff, and geometric backoff, on point-to-point wireless fading links where packet errors occur nonindependently. In such a scenario, the backoff schemes are shown to achieve better energy efficiency without compromising much on the link layer throughput performance.

Experimental investigation of link between growth and decay of fiber Bragg gratings

We report here an experimental investigation for establishing and quantifying a link between the growth and decay characteristics of fiber Bragg gratings. One of the key aspects of our work is the determination of the defect energy distribution from the grating characteristics measured during their fabrication. We observe a strong correlation between the growth-based defect energy distribution and that obtained through accelerated aging experiments, paving the way for predicting the decay characteristics of fiber Bragg gratings from their growth data. Such a prediction is significant in simplifying the postfabrication steps required to enhance the thermal stability of fiber Bragg gratings. (c) 2011 Optical Society of America

A Multilevel inverter structure with cascaded two level and three level inverters for IM drive with CMV elimination and DC link capacitor voltage balancing

Common mode voltage (CMV) variations in PWM inverter-fed drives generate unwanted shaft and bearing current resulting in early motor failure. Multilevel inverters reduce this problem to some extent, with higher number of levels. But the complexity of the power circuit increases with an increase in the number of inverter voltage levels. In this paper a five-level inverter structure is proposed for open-end winding induction motor (IM) drives, by cascading only two conventional two-level and three-level inverters, with the elimination of the common mode voltage over the entire modulation range. The DC link power supply requirement is also optimized by means of DC link capacitor voltage balancing, with PWM control, using only inverter switching state redundancies. The proposed power circuit gives a simple power bus structure.

Pricing a Shared Access Link for Fair and Efficient Operation with Variable User Data Rates

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data; this leads to variable user data rates. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. User preferences are modelled by concave increasing utility functions. Further, we introduce two additional elements: a convex increasing disutility function and a convex increasing multiplicative congestion-penally function. The disutility function takes the shortfall (contracted rate minus present rate) as its argument, and essentially encourages users to send traffic at their contracted rates, while the congestion-penalty function discourages heavy users from sending excess data when the link is congested. We obtain simple necessary and sufficient conditions on prices for fair and efficient link sharing; moreover, we show that a single price for all users achieves this. We illustrate the ideas using a simple experiment.